Plato’s Error and a Mean Field Formula for Convex Mosaics

Plato claimed that the regular solids are the building blocks of all matter. His views, commonly referred to as the geometric atomistic model, had enormous impact on human thought despite the fact that four of the five Platonic solids can not fill space without gaps. In this paper we quantify these gaps, showing that the errors in Plato’s estimates were quite small. We also develop a mean field approximation to convex honeycombs using a generalized version of Plato’s idea. This approximation not only admits to view convex mosaics in d=3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d=3$$\end{document} dimensions as a continuum but we also find that it is quite accurate, showing that Plato’s geometric intuition may have been remarkable.


Plato's Idea
One of the greatest triumphs of Greek mathematics is undoubtedly the identification of the five regular solids. The time of discovery of the individual solids is very hard to trace, cubic dice were carved in Mesopotamia many thousand years ago and several dodecahedra of Etruscan and Celtic origin have been identified (Heath 1921 Oxford (1927Oxford ( .2727. Nevertheless, the unification of these concepts and the recognition of the significance of regular solids is mostly attributed to the Pythagoreans and to Theaetetus of Athens (Heath 1921), a pupil of Plato. The last (XIIIth) book of Euclid's Elements is dedicated to the study of the regular solids and it culminates by delivering an (albeit incomplete) proof that there exist exactly five such objects. Apparently, Plato recognized the great significance of the regular solids (Senechal 1981) (which now carry his name) and coupled this seminal geometric discovery with another fundamental idea of Greek (and in fact, Oriental) philosophy (Ball 2004): the four elements: earth, air, fire and water. The numbers (five solids versus four elements) were almost matched and he resolved this by assigning the fifth solid (the dodecahedron) as the building block of the cosmos. While Aristotle did not share Plato's views (on which we will elaborate later), it is remarkable that he also complemented the list of four elements with a fifth one (aether) (Lloyd 1968).
While it is beyond the scope of the current paper to present any novelty on the philosophical interpretation of Plato's Timaeus (Plato 2015), given the broad range of existing interpretations of this text (Wilberding and Horn 2012) it might be appropriate to indicate which is closest to our current approach. In this respect the work of Whitehead (1938) is certainly relevant as we regard Plato's interpretation of the Elements as static ideal forms. We mention that dynamic interpretations, in the context of the perpetually incomplete Universe, also exist (Zeyl and Sattler 2019). Plato regards (Plato 2015) the Universe as the purposeful work of the divine Craftsman (Demiurge) (Perl 1998) and the Elements (and their realization as the regular solids) can be viewed as part of the activity of the Demiurge who created these regular geometric shapes. It is a highly interesting subject how the regular solids reflect the perceived qualities (Albertazzi 2013) of the Elements and how the latter are related to our contemporary thinking about our environment (Macauley 2010) however, we will not explore these avenues in this paper.
Plato's theory, representing a distinct direction of classical Greek philosophy, is commonly referred to as the geometric atomistic model (Wilberding and Horn 2012) and it had enormous impact on human thought.
Despite its philosophical significance, Plato's atomistic theory is, from the point of view of theoretical physics, at first sight, merely a 'beautiful mistake' (Wilczek 2011). Nevertheless, at closer inspection, one discovers the seeds of modern atomic theory: reducing the physical world to a few indivisible substances existing in great numbers of identical copies coincides with our current understanding. Also, Nobel laureate Wilczek (2011) hails Plato's insight that symmetry defines structure as particularly deep. So, from the physical point of view, Plato's theory appears to be technically flawed, nevertheless, it contains deep ideas, inspiring even for modern science.
Since Plato's ideas appear to be deeply rooted in geometric intuition, it might be appropriate to take a close look at his model by using the tools of modern convex geometry. Our goal is to show that, analogously to the physics approach, we find technical flaws, however, there are deep ideas and in this paper we make an attempt to carry these ideas somewhat further. While Plato did not claim (Plato 2015) explicitly that regular solids fill space without gaps, his critics, foremost Aristotle (Senechal 1981) pointed out that this would be a logical consequence of his theory. Apparently, Plato's claim, or at least its logical consequence, appears to contain some kind of geometric error, except in the case of the cube. In order to quantify this error we will use the concept of solid angles, certainly not available to the Greeks. Despite this fact, as we will show, the quantitative errors (which we may call the technical flaws of Plato's geometric theory) appear to be rather small. Since Plato's main interest was philosophy rather than geometry, we will attempt to give another interpretation to his model which ignores small mismatches and can be generalized to an approximation which we call a mean field theory. The natural framework to study the geometry of space-filling by polyhedra is the geometric theory of convex mosaics the basic concepts of which we outline below and then we apply these tools to interpret and generalize Plato's ideas.

Definition and Brief History of Mosaics
A d-dimensional mosaic M is a countable system of compact domains in ℝ d , with nonempty interiors, that cover the whole space and have pairwise no common interior points (Schneider and Weil 2008). We call a mosaic convex if these domains are convex and in this case all domains are convex polytopes (Schneider and Weil 2008, Lemma 10.1.1). In this paper we deal only with convex mosaics. We call these polytopes the cells of the mosaic, and the faces, edges and vertices of the cells the faces, edges and nodes of the mosaic, respectively. A cell having v vertices is called a cell of degree v, and a node which is the vertex of n cells is called a node of degree n. Our prime focus is to determine how average values of these quantities, denoted by n and v , respectively, depend on each other. We remark that for planar regular mosaics, the pair {v,n} is called the Schläfli symbol of the mosaic so, by generalizing this concept, we will refer to the [n,v] plane as the symbolic plane of convex mosaics. These, and closely related global averages have been studied before and proved to be powerful tools in the geometric study of mosaics: in Chung et al.
(2012) the planar isoperimetric problem restricted to convex polygons with v < 6 vertices is resolved using these quantities.
Our main focus will be face-to-face mosaics, in which each face of the mosaic (that is, each face of any cell of the mosaic) is the face of exactly two cells. Unless stated otherwise, any mosaic discussed in our paper will be a convex face-toface mosaic. Furthermore, we assume that the mosaic is normal, that is, for some 0 < r < R each cell contains a ball of radius r, and is contained in a ball of radius R (see, e.g. Schulte 1993). This implies, in particular, that the volumes of the cells are bounded from above, and that the mosaic is locally finite; that is, each point of space belongs to finitely many cells. We note that a precise definition of v and n can be obtained in the usual way, that is, by taking the limit of the average degrees of cells/nodes contained in a large ball whose radius tends to infinity. Here, we always tacitly assume that these limits exist.
Geometric intuition suggests that v and n should have an inverse-type relationship: more polytopes meeting at a node implies smaller internal angles in the polytopes, which, in turn, suggests a smaller number of vertices for each polytope. One can (Domokos and Lángi 2019) in fact, express the nodal degree n also by the average internal angle Ω as where S d−1 denotes the surface area of the (d − 1)-dimensional ball, i.e. the total angle in d-dimensions. In one dimension ( d = 1 ) we have v = n = 2 for each cell and vertex. In two dimensions one can have cells and nodes of various degrees, nonetheless, it is known (Schneider and Weil 2008, Theorem 10.1.6) that for all convex mosaics thus convex mosaics in d = 2 dimensions are represented by a 1-dimensional continuum on the [n,v] symbolic plane.
The situation in d = 3 dimensions appears, at least at first sight, to be radically different. (Schneider and Weil 2008) provide the general equations governing 3D random mosaics showing that, beyond the trivial inequalities v,n ≥ 4 these formulae do not yield additional constraints on n,v suggesting that in the [n,v] symbolic plane, except for the unphysical domains characterized by n,v < 4 , we might expect to see mosaics anywhere. However, this is not the case if we look at the best known mosaics: uniform honeycombs. The latter are a special class of convex mosaics where cells are congruent, uniform polyhedra and all nodes are identical under translation. The list of all possible convex uniform honeycombs was completed only recently by Johnson (1991) who described 28 such mosaics (for more details on the 28 uniform honeycombs see Grünbaum 1994; Deza and Shtogrin 2000 and more details on the history see Senechal 1981). To provide the complete list of these 28 honeycombs has been a major result in discrete geometry. On the [n,v] symbolic plane the points corresponding to these mosaics appear to accumulate on a narrow stripe (cf. Fig. 1, Table 2) which may suggest that, in some way analogous to the 2D case, there exists a continuum representing 3D mosaics on the symbolic plane. However, by studying the data in Table 2 we can see that there can not even exist any exact formula of the type analogous to (2), since, for example, the dual of the cantellated cubic honeycomb (4 ′ ) is characterized by (n,f ,v) = (12, 5, 6) and the dual of the runcic cubic honeycomb (9 ′ ) is characterized by (n,f ,v) = (10, 5, 6) . Our goal is to offer some partial understanding of this phenomenon by introducing, based on Plato's ideas, a mean field approximation of type (3). To explain this approach we first analyze Plato's original claims.

Interpretation of Plato's Error
Plato's idea was resurrected in the study of non-Euclidean mosaics (Coxeter 1956) where, by choosing suitable sign for the curvature, all Platonic solids fill space without gaps so, in this broader setting, there is no error at all. Our main target is nevertheless Euclidean space which imposes strict constraints on the geometry of mosaics and our goal is to explain how, under these constraints, some part of the Platonic idea may be salvaged and also serve the understanding of Euclidean mosaics.
Using the framework of convex mosaics and the concept of the symbolic plane, Plato's error can be interpreted in several ways. Apparently, except for the cube, it is not possible to obtain the total solid angle S 2 = 4 at one node by assembling an integer number of any of the other four Platonic solids. In other words, we may say that Eq. (1) can not be fulfilled if n is an integer. However, since our (hypothetical) mosaic contains only one type of cell, n has to be an integer. As a consequence, we have to admit some error term either in the solid angle Ω or in the nodal degree n ; essentially it is the same error expressed in two different ways. If we substitute the exact value of Ω(f , v) associated with the Platonic solid with f faces and v vertices into Eq. (1) then we obtain a virtual nodal degree n as (right). Mosaics (virtual or real) associated with the five Platonic solids shown as circles in both diagrams (for numerical data associated with the 5 Platonic solids see Table 1). Continuous straight lines on the right panel correspond to simple and simplicial polyhedra. Dotted line on the left panel corresponds to prismatic mosaics. Continuous curves on the left panel show the Platonic approximation associated with the latter. For detailed numerical data see Table 2 associated with the Platonic solid with f faces and v vertices. The error may be expressed as where [] denotes rounding to the nearest integer. This is illustrated in Fig. 2, numerical data is summarized in Table 1. We may observe that the errors are remarkably small ( < 10% ) for all Platonic solids.
Observe that (4) is reminiscent of the elusive formula (3), albeit, it is interpreted only for pairs (f, v) associated with the 5 Platonic solids. Our goal is to carry this idea further and expand it into a mean field model encompassing all convex mosaics.  . 2 The five regular solids interpreted as cells of a convex honeycomb. Horizontal axis shows the best (integer) approximation for the nodal degree n , vertical axis shows the relative error indicating the mismatch in the solid angle (absolute value of angular excess or deficit) at such an imaginary node. We can observe that only the cube can be used as a cell of a honeycomb, nonetheless, the relative errors are rather small also in case of the other 4 regular solids 1 3 Axiomathes (2022) 32:889-905

Platonic Approximation of Mosaics
Our goal is to extend the domain of formula (4) to arbitrary values (f ,v) and this construction we will call a (real or virtual) Platonic mosaic associated to geometric mosaics with averages (f ,v). A cell in a d-dimensional mosaic M is characterized by d integers m i ( i = 0, 1, 2 … d − 1 ) defining the numbers of i-dimensional faces. We will refer to these scalars as the cell descriptors.
Remark 1 Our choice of cell descriptors is, of course, arbitrary. For example, we did not include overall descriptors such as elongation, isoperimetric ratio or the average of angles. Our choice was motivated by the mean field model we intend to construct.
In a random mosaic the cell descriptors associated with a typical cell (Schneider and Weil 2008) are d random variables corresponding the aforementioned scalars. Motivated by this we introduce Average error is 6.6%, maximal error is 26.2 % We will refer to the (real or virtual) mosaic composed of the average cell as a Platonic mosaic associated with M and we denote it by P(M) . We call a Platonic mosaic real if the average cell is real and it fills space without gaps.
We may regard the associated Platonic mosaic P(M) as a mean field approximation of M. Our key observation is the following Remark 4 While virtual cells do not admit the global construction of a polytope, they might still admit the computation of vertex angles and nodal angles. We will denote all quantities computed based on the average cell by ( ) . Using this concept we can determine the solid angle Ω at a vertex and instead of (4) we may write with the error term: so we see that the concept of Platonic mosaics is a natural, straightforward extension of Plato's original idea.
Using this concept we immediately have a heuristic argument supporting formula (2) result for planar mosaics. To construct the average cell in d = 2 dimensions we just need the average number v of vertices; for the angles we use the fact that they are constant in the average cell. Now we can construct the average cell as a polygon with v vertices. If v is an integer then the average cell is real because it can be realized as a regular polygon with internal angles = (v − 2)∕v . However, if v is not an integer this formula still yields an angle. Next we construct a virtual node to compute the approximation n for the nodal degree n as n = 2 ∕ = 2v∕(v − 2) . While this is certainly a heuristic argument, it happens to provide the exact formula for all convex mosaics in the plane. We certainly do not expect this construction to be exact for all mosaics, nevertheless, the above examples suggest that it may serve as a useful approximation. In d = 3 dimensions we have 2 independent integer-type cell descriptors: the number v of vertices and the number f of faces with averages v,f and the main result of our paper concerns this case: Theorem 1 In d = 3 dimensions, the average cell yields the following approximation n for the nodal degree based on the cell descriptors v,f :

Based on which we can formulate.
Theorem 2 In case of the 28 uniform honeycombs, their duals, hyperplane mosaics, Poisson-Voronoi mosaics and Poisson-Delaunay mosaics we have an average error E average ≤ 7% and a maximal error E max ≤ 27%.
Beyond the relatively small quantitative errors, the formula in Theorem 1 has other remarkable features. This formula may be formally interpreted over all pairs (f ,v) ∈ ℝ 2 . However, we should keep in mind that these numbers represent averages for the numbers of faces and vertices of convex polyhedra. Steinitz proved (Steinitz 1906(Steinitz , 1922) that for any convex polyhedron the inequalities v ≥ 4 , 1 2 v + 2 ≤ f ≤ 2v − 4 hold. The extreme cases corresponding to are called simplicial and simple polyhedra, respectively, and the only polyhedron in both categories is the tetrahedron with f = v = 4 . Since these are extreme cases, we can see that they also provide the extremes for the averages f ,v . The left panel of Fig. 2 shows these straight lines which indeed provide a hull for all convex mosaics. If we regard the values provided by (9) as averages f ,v , and substitute these averages into the formula of Theorem 1, the latter yields two curves on the symbolic plane [n,v] . While these curves (shown with solid lines on the left panel) do not provide a hull for the illustrated 60 mosaics, the range between the curves appears to be a reasonable approximation of the actual observed range. This illustrates that Platonic approximations may capture some essential characteristics of 3D mosaics. .
In the next section we prove Theorems 1 and 2, and in Sect. 3 we summarize our findings.

Proof of Theorem 1: The Construction of the Average Cell
In the proof we use the next lemma.
Lemma 1 Let S be the tetrahedron with vertices a = cos 2 , − sin 2 , 0 , b = cos 2 , sin 2 , 0 , o = (0, 0, 0) and m = (0, 0, ) . For x ∈ {a, b, o, m} , let Ω x denote the solid angle of S at x. Then and Proof Note that the solid angle of S at a vertex x is equal to the area of the radial projection of S onto the unit sphere x + 2 centered at x. This projection is a spherical triangle, the angles of which are equal to the dihedral angles of S between pairs of faces meeting at x. It is well known that the area of a spherical triangle, with angles , , , is equal to the excess angle + + − . Thus, to prove Lemma 1, it is sufficient to compute the dihedral angles of S. In the following, if x, y are distinct vertices of S, we denote the dihedral angle of S at the edge xy by ∠ S (xy).
Clearly, ∠ S (om) = , ∠ S (oa) = ∠ S (ob) = 2 , implying Ω o = , and by symmetry, ∠ S (ma) = ∠ S (mb) . The cross-section of S with the [x, z] coordinate plane is a triangle T whose vertices are o, m and the midpoint u = cos 2 , 0, 0 of ab. This triangle has a right angle at o, and its legs are of length and cos 2 . Observe that ∠ S (ab) is the angle of T at u, and thus, it is equal to The exterior unit normal vector of the face abm of S is The interior unit normal vector of the face oam is v 2 = sin 2 , cos 2 , 0 . Since v 1 is the rotated copy of v 2 around the line of am with angle ∠ S (am) , ∠ S (am) is the angle between v 1 and v 2 . The inner product of v 1 and v 2 is equal to ⟨v 1 , v 2 ⟩ = cos ∠ S (am) , and thus, we have: Now the rest of the solid angles can be computed from the dihedral angles as ◻ Now we prove Theorem 1.

Proof of Theorem 1
An average cell in the mosaic has f faces, v vertices and ē =v +f − 2 edges. In our model, we denote the number of cells meeting at a node by n =n(v,f ) . A face of an average cell has ē f = 2ē f edges, and, within the cell, the degree of a vertex is v c = 2ē v . Based on Definition 1, we imagine an average cell as a polyhedron with 'regular' ē f -gons as faces such that the projection of the center of the polyhedron onto the plane of a face coincides with the center of the face. Let us decompose such a cell into tetrahedra whose vertices are two vertices of an edge of the cell, the center of one of the two faces containing this edge, and the center of the cell. Note that in this way we decompose the cell into 2ē congruent tetrahedra. Let S be such a tetrahedron, and let ab denote the edge, o the center of the face and m the center of the cell in S. Let Ω m denote the solid angle of S at m, and Ω a the solid angle of S at a. Note that since these tetrahedra are congruent, Ω m = 4 2ē = 2ē , and the solid angle of the cell at a is 2v c Ω a . This angle is equal to 4n , implying that Ω a = 2 v cn =̄v en , from which Using Lemma 1, we compute Ω a as a function of ē,v and f . In our computations, for simplicity, we use the notations of Lemma 1. Then we have 2 = 2 From this, it follows that Note that sin̄f 2ē = cos 2 −̄f 2ē = cos (v−2) 2ē , and thus, which implies, in particular, that the expression behind the square root is positive. Now, algebraic transformations yield Thus, Combining this with (12) yields Now, the formula in Theorem 1 is an immediate consequence of (13) and the iden- (13) n = 2v 2ē arcsin cos̄v 2ē .
Before stating a supplement of Theorem 1, recall that by a result of Steinitz (1906Steinitz ( , 1922, there is a convex polyhedron with v vertices and f faces if and only if v ≥ 4 , and 1 2 v + 2 ≤ f ≤ 2v − 4 , or equivalently, 4 + 1 2 (v − 4) ≤ f ≤ 4 + 2(v − 4). Proof Let ē =v + 4 + t(v − 4) − 2 = (t + 1)v + 2 − 4v , and observe that the conditions in Proposition 1 for v and t are equivalent to 3 2v ≤ē ≤ 3v − 6. An elementary computation yields that where and Note that under our conditions, the above partial derivative of n is negative if F is negative on the domain v > 4, 3 2v ≤ē ≤ 3v − 6. Using algebraic transformations, we obtain that where x =̄v 2ē and y = (v−2) 2ē . Here, the inequalities v > 4 and 3 2v ≤ē ≤ 3v − 6 are equivalent to the inequalities 6 ≤ x ≤ 3 and 6 ≤ y < x . Thus, we prove that the expression on the right-hand side of (14) is negative on this domain. Simplifying this expression, we have where To estimate the values of A and B, we use the fact that the function z ↦ z sin z is strictly increasing on the interval 0 < z < 2 . Our inequalities imply that 0 < x − y < 6 , 0 < arcsin √ 1 − cos 2 x cos y < arcsin √ 2 3 , and x ≤ 2y . From the first two inequalities it follows that A − B ≤ 0.123 . Substituting this and the third inequality into (15), we obtain proving Proposition 1. ◻

Remark 5
Note that by Proposition 1, for any value v ≥ 4 , n(t,v) attains all values between n 1 2 ,v and n(2,v).

Proof of Theorem 2: Explicit Computation of Errors
Proof Table 2 proves Theorem 2. ◻

Summary
In this paper we took a close look at Plato's atomistic model which proposed the five regular solids as the building blocks of the Universe. On one hand, we found that this approach contains some quantitative errors, as four of the five Platonic solids do not fill space without gaps. This mismatch led to criticism of Plato's ideas, most notably by Aristotle. However, not only did our computations show that the quantitative errors in Plato's model are quite small, we also introduced another, holistic interpretation of the Platonic approach (possibly closer to Plato's original ideas) which we interpreted as a mean field approximation to some special convex mosaics. We developed this idea a little further to obtain a formula which serves as a mean field approximation to all .
F < 2ē sin(x − y)y 0.369 sin(3y) 3y − 1 < 0, 1 3 convex mosaics in d = 3 dimensions. This mean field theory not only offers a good quantitative approximation to a large variety of known mosaics, it may also help to explain some curious facts associated with 3D mosaics. We represented mosaics on the [n,v] symbolic plane of average nodal and cell degrees. While 2D mosaics appear on a curve [given by formula (2)], however, the 60 three-dimensional mosaics examined in this paper appear scattered in the vicinity of an (imaginary) curve. Since our mean field theory is a straightforward generalization of Plato's original approach, we called the resulting geometric constructions Platonic mosaics. If interpreted over the admissible domain of pairs (f, v), Platonic mosaics provide a reasonable approximation of that imaginary curve showing that this theory, despite its simplicity, captures some essential geometric features of 3D mosaics. Whether or not Platonic mosaics contribute to the vindication of Plato's original views about the Universe is certainly not a mathematical question. Nevertheless, we hope that these geometric constructions may help to reveal some of the secrets which inspired Plato: the geometric patterns in which convex polyhedra may or may not fill space without gaps.