Eberhard's theorem

Last updated • 4 min readFrom Wikipedia, The Free Encyclopedia

In mathematics, and more particularly in polyhedral combinatorics, Eberhard's theorem partially characterizes the multisets of polygons that can form the faces of simple convex polyhedra. It states that, for given numbers of triangles, quadrilaterals, pentagons, heptagons, and other polygons other than hexagons, there exists a convex polyhedron with those given numbers of faces of each type (and an unspecified number of hexagonal faces) if and only if those numbers of polygons obey a linear equation derived from Euler's polyhedral formula. [1]

Contents

The theorem is named after Victor Eberhard, a blind German mathematician, who published it in 1888 in his habilitation thesis and in expanded form in an 1891 book on polyhedra. [1] [2] [3]

Definitions and statement

For an arbitrary convex polyhedron, one can define numbers , , , etc., where counts the faces of the polyhedron that have exactly sides. A three-dimensional convex polyhedron is defined to be simple when every vertex of the polyhedron is incident to exactly three edges. In a simple polyhedron, every vertex is incident to three angles of faces, and every edge is incident to two sides of faces. Since the numbers of angles and sides of the faces are given, one can calculate the three numbers (the total number of vertices), (the total number of edges), and (the total number of faces), by summing over all faces and multiplying by an appropriate factor: [1]

and

Plugging these values into Euler's polyhedral formula and clearing denominators leads to the equation

which must be satisfied by the face counts of every simple polyhedron. However, this equation is not affected by the value of (as its multiplier is zero), and, for some choices of the other face counts, changing can change whether or not a polyhedron with those face counts exists. That is, obeying this equation on the face counts is a necessary condition for the existence of a polyhedron, but not a sufficient condition, and a complete characterization of which face counts are realizable would need to take into account the value of . [1]

Eberhard's theorem implies that the equation above is the only necessary condition that does not depend on . It states that, if an assignment of numbers to (omitting ) obeys the equation

then there exists a value of and a simple convex polyhedron with exactly -sided faces for all . [1]

Examples

There are three simple Platonic solids, the tetrahedron, cube, and dodecahedron. The tetrahedron has , the cube has , and the dodecahedron has , with all other values of being zero. These three assignments of numbers to all obey the equation that Eberhard's theorem requires them to obey. The existence of these polyhedra shows that, for these three assignments of numbers to , there exists a polyhedron with . The case of the dodecahedron, with and all others except zero, describes more generally the fullerenes. There is no fullerene with but these graphs are realizable for any other value of ; [4] see for instance, the 26-fullerene graph, with .

A hexagon bisects the cube into two copies of a simple polyhedron with one hexagonal face, three isosceles right triangle faces, and three irregular pentagonal faces. It is not possible to form a simple polyhedron using only three triangles and three pentagons, without the added hexagon. Hexagon in cube.svg
A hexagon bisects the cube into two copies of a simple polyhedron with one hexagonal face, three isosceles right triangle faces, and three irregular pentagonal faces. It is not possible to form a simple polyhedron using only three triangles and three pentagons, without the added hexagon.

There is no simple convex polyhedron with three triangle faces, three pentagon faces, and no other faces. That is, it is impossible to have a simple convex polyhedron with , and for . However, Eberhard's theorem states that it should be possible to form a simple polyhedron by adding some number of hexagons, and in this case one hexagon suffices: bisecting a cube on a regular hexagon passing through six of its faces produces two copies of a simple roofless polyhedron with three triangle faces, three pentagon faces, and one hexagon face. That is, setting suffices in this case to produce a realizable combination of face counts. [5]

An analogous result to Eberhard's theorem holds for the existence of polyhedra in which all vertices are incident to exactly four edges. In this case the equation derived from Euler's formula is not affected by the number of quadrilaterals, and for every assignment to the numbers of faces of other types that obeys this equation it is possible to choose a number of quadrilaterals that allows a 4-regular polyhedron to be realized. [1]

A strengthened version of Eberhard's theorem states that, under the same conditions as the original theorem, there exists a number such that all choices of that are greater than equal to and have the same parity as are realizable by simple convex polyhedra. [6]

A theorem of David W. Barnette provides a lower bound on the number of hexagons that are needed, whenever the number of faces of order seven or higher is at least three. It states that, in these cases,

For polygons with few pentagons and many high-order faces, this inequality can force the number of hexagons to be arbitrarily large. More strongly, it can be used to find assignments to the numbers of faces for which the required number of hexagons cannot be bounded by any function of the maximum number of sides of a face. [7]

Analogues of Eberhard's theorem have also been studied for other systems of faces and face counts than simple convex polyhedra, for instance for toroidal graphs [8] and for tessellations. [9]

See also

Related Research Articles

<span class="mw-page-title-main">Dual polyhedron</span> Polyhedron associated with another by swapping vertices for faces

In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.

<span class="mw-page-title-main">Regular icosahedron</span> Polyhedron with 20 regular triangular faces

In geometry, the regular icosahedron is a convex polyhedron that can be constructed from pentagonal antiprism by attaching two pentagonal pyramids with regular faces to each of its pentagonal faces, or by putting points onto the cube. The resulting polyhedron has 20 equilateral triangles as its faces, 30 edges, and 12 vertices. It is an example of the Platonic solid and of the deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron.

<span class="mw-page-title-main">Polyhedron</span> 3D shape with flat faces, straight edges and sharp corners

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

In elementary geometry, a polytope is a geometric object with flat sides (faces). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a (k + 1)-polytope consist of k-polytopes that may have (k – 1)-polytopes in common.

<span class="mw-page-title-main">Truncated icosahedron</span> Archimedean solid

In geometry, the truncated icosahedron is an Archimedean solid, one of 13 convex isogonal nonprismatic solids whose 32 faces are two or more types of regular polygons. It is the only one of these shapes that does not contain triangles or squares. In general usage, the degree of truncation is assumed to be uniform unless specified.

In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by .

<span class="mw-page-title-main">Pick's theorem</span> Formula for area of a grid polygon

In geometry, Pick's theorem provides a formula for the area of a simple polygon with integer vertex coordinates, in terms of the number of integer points within it and on its boundary. The result was first described by Georg Alexander Pick in 1899. It was popularized in English by Hugo Steinhaus in the 1950 edition of his book Mathematical Snapshots. It has multiple proofs, and can be generalized to formulas for certain kinds of non-simple polygons.

In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric. Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three-dimensional space, or as a three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorove, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope.

<span class="mw-page-title-main">Edge (geometry)</span> Line segment joining two adjacent vertices in a polygon or polytope

In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal.

Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.

In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.

<span class="mw-page-title-main">Toroidal polyhedron</span> Partition of a toroidal surface into polygons

In geometry, a toroidal polyhedron is a polyhedron which is also a toroid, having a topological genus of 1 or greater. Notable examples include the Császár and Szilassi polyhedra.

<span class="mw-page-title-main">Parallelohedron</span> Polyhedron that tiles space by translation

In geometry, a parallelohedron is a polyhedron that can be translated without rotations in 3-dimensional Euclidean space to fill space with a honeycomb in which all copies of the polyhedron meet face-to-face. There are five types of parallelohedron, first identified by Evgraf Fedorov in 1885 in his studies of crystallographic systems: the cube, hexagonal prism, rhombic dodecahedron, elongated dodecahedron, and truncated octahedron.

<span class="mw-page-title-main">Density (polytope)</span> Number of windings of a polytope around its center of symmetry

In geometry, the density of a star polyhedron is a generalization of the concept of winding number from two dimensions to higher dimensions, representing the number of windings of the polyhedron around the center of symmetry of the polyhedron. It can be determined by passing a ray from the center to infinity, passing only through the facets of the polytope and not through any lower dimensional features, and counting how many facets it passes through. For polyhedra for which this count does not depend on the choice of the ray, and for which the central point is not itself on any facet, the density is given by this count of crossed facets.

<span class="mw-page-title-main">First stellation of the rhombic dodecahedron</span> Self I intersecting polyhedron with 12 faces

In geometry, the first stellation of the rhombic dodecahedron is a self-intersecting polyhedron with 12 faces, each of which is a non-convex hexagon. It is a stellation of the rhombic dodecahedron and has the same outer shell and the same visual appearance as two other shapes: a solid, Escher's solid, with 48 triangular faces, and a polyhedral compound of three flattened octahedra with 24 overlapping triangular faces.

<span class="mw-page-title-main">Goldberg polyhedron</span> Convex polyhedron made from hexagons and pentagons

In mathematics, and more specifically in polyhedral combinatorics, a Goldberg polyhedron is a convex polyhedron made from hexagons and pentagons. They were first described in 1937 by Michael Goldberg (1902–1990). They are defined by three properties: each face is either a pentagon or hexagon, exactly three faces meet at each vertex, and they have rotational icosahedral symmetry. They are not necessarily mirror-symmetric; e.g. GP(5,3) and GP(3,5) are enantiomorphs of each other. A Goldberg polyhedron is a dual polyhedron of a geodesic sphere.

<span class="mw-page-title-main">Chamfer (geometry)</span> Geometric operation which truncates the edges of polyhedra

In geometry, chamfering or edge-truncation is a topological operator that modifies one polyhedron into another. It is similar to expansion, moving faces apart and outward, but also maintains the original vertices. For polyhedra, this operation adds a new hexagonal face in place of each original edge.

In geometry, a plesiohedron is a special kind of space-filling polyhedron, defined as the Voronoi cell of a symmetric Delone set. Three-dimensional Euclidean space can be completely filled by copies of any one of these shapes, with no overlaps. The resulting honeycomb will have symmetries that take any copy of the plesiohedron to any other copy.

Convex Polytopes is a graduate-level mathematics textbook about convex polytopes, higher-dimensional generalizations of three-dimensional convex polyhedra. It was written by Branko Grünbaum, with contributions from Victor Klee, Micha Perles, and G. C. Shephard, and published in 1967 by John Wiley & Sons. It went out of print in 1970. A second edition, prepared with the assistance of Volker Kaibel, Victor Klee, and Günter M. Ziegler, was published by Springer-Verlag in 2003, as volume 221 of their book series Graduate Texts in Mathematics.

References

  1. 1 2 3 4 5 6 Grünbaum, Branko (2003), "13.3 Eberhard's theorem", Convex Polytopes, Graduate Texts in Mathematics, vol. 221 (2nd ed.), Springer, pp. 253–271
  2. Eberhard, Victor (1891), Zur Morphologie der Polyeder (in German), Teubner, JFM   23.0544.03
  3. "Viktor Eberhard", Catalogus Professorum Halensis (in German), Martin Luther University of Halle-Wittenberg, retrieved 2020-09-02
  4. Grünbaum, Branko (1968), "Some analogues of Eberhard's theorem on convex polytopes", Israel Journal of Mathematics , 6: 398–411 (1969), doi: 10.1007/BF02771220 , MR   0244854
  5. For both the nonexistence of a polyhedron with three triangles, three pentagons, and no hexagons, and the existence with one hexagon, see Grünbaum (2003), third row of Table 13.3.1, page 268.
  6. Fisher, J. C. (1974), "An existence theorem for simple convex polyhedra", Discrete Mathematics , 7: 75–97, doi: 10.1016/S0012-365X(74)80020-8 , MR   0333984
  7. Barnette, David (1969), "On -vectors of 3-polytopes", Journal of Combinatorial Theory , 7: 99–103, doi: 10.1016/S0021-9800(69)80042-6 , MR   0244851
  8. Gritzmann, Peter (1983), "The toroidal analogue to Eberhard's theorem", Mathematika , 30 (2): 274–290 (1984), doi:10.1112/S002557930001055X, MR   0737179
  9. Grünbaum, Branko; Shephard, G. C. (1982), "The theorems of Euler and Eberhard for tilings of the plane", Results in Mathematics, 5 (1): 19–44, doi:10.1007/bf03323298, MR   0662793