Face (geometry)

Insolid geometry,afaceis a flatsurface(aplanar region) that forms part of the boundary of a solid object;^[1]a three-dimensional solid bounded exclusively by faces is apolyhedron.A face can be finite like a polygon or circle, or infinite like a half-plane or plane.^[2]

In more technical treatments of the geometry of polyhedra and higher-dimensionalpolytopes,the term is also used to mean an element of any dimension of a more general polytope (in any number of dimensions).^[3]

Polygonal face

In elementary geometry, afaceis apolygon^{[note 1]}on the boundary of apolyhedron.^[3]^[4]Other names for a polygonal face includepolyhedron sideand Euclidean planetile.

For example, any of the sixsquaresthat bound acubeis a face of the cube. Sometimes "face" is also used to refer to the 2-dimensional features of a4-polytope.With this meaning, the 4-dimensionaltesseracthas 24 square faces, each sharing two of 8cubiccells.

Regular examples bySchläfli symbol
Polyhedron	Star polyhedron	Euclidean tiling	Hyperbolic tiling	4-polytope
{4,3}	{5/2,5}	{4,4}	{4,5}	{4,3,3}
Thecubehas 3 squarefacesper vertex.	Thesmall stellated dodecahedronhas 5pentagrammicfaces per vertex.	Thesquare tilingin the Euclidean plane has 4 squarefacesper vertex.	Theorder-5 square tilinghas 5 squarefacesper vertex.	Thetesseracthas 3 squarefacesper edge.

Number of polygonal faces of a polyhedron

Anyconvex polyhedron's surface hasEuler characteristic

V-E+F=2,

where $V$ is the number ofvertices, $E$ is the number ofedges,and $F$ is the number of faces. This equation is known asEuler's polyhedron formula.Thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, acubehas 12 edges and 8 vertices, and hence 6 faces.

k-face

In higher-dimensional geometry, the faces of apolytopeare features of all dimensions.^[3]^[5]^[6]A face of dimension $k$ is called a $k$ -face. For example, the polygonal faces of an ordinary polyhedron are 2-faces. Inset theory,the set of faces of a polytope includes the polytope itself and the empty set, where the empty set is for consistency given a "dimension" of −1. For any $n$ -polytope ( $n$ -dimensional polytope), $-1 \leq k \leq n$ .

For example, with this meaning, the faces of acubecomprise the cube itself (3-face), its (square)facets(2-faces), its (line segment) edges (1-faces), its (point) vertices (0-faces), and the empty set.

In some areas of mathematics, such aspolyhedral combinatorics,a polytope is by definition convex. Formally, a face of a polytope $P$ is the intersection of $P$ with anyclosed halfspacewhose boundary is disjoint from the interior of $P$ .^[7]From this definition it follows that the set of faces of a polytope includes the polytope itself and the empty set.^[5]^[6]

In other areas of mathematics, such as the theories ofabstract polytopesandstar polytopes,the requirement for convexity is relaxed. Abstract theory still requires that the set of faces include the polytope itself and the empty set.

An $n$ -dimensionalsimplex(line segment ( $n = 1$ ), triangle ( $n = 2$ ), tetrahedron ( $n = 3$ ), etc.), defined by $n + 1$ vertices, has a face for each subset of the vertices, from the empty set up through the set of all vertices. In particular, there are $2 n + 1$ faces in total. The number of them that are $k$ -faces, for $k \in {-1, 0,..., n}$ ,is thebinomial coefficient ${\binom {n+1}{k+1}}$ .

There are specific names for $k$ -faces depending on the value of $k$ and, in some cases, how close $k$ is to the dimensionality $n$ of the polytope.

Vertex or 0-face

Vertexis the common name for a 0-face.

Edge or 1-face

Edgeis the common name for a 1-face.

Face or 2-face

The use offacein a context where a specific $k$ is meant for a $k$ -face but is not explicitly specified is commonly a 2-face.

Cell or 3-face

Acellis apolyhedralelement (3-face) of a 4-dimensional polytope or 3-dimensional tessellation, or higher. Cells arefacetsfor 4-polytopes and 3-honeycombs.

Examples:

Regular examples bySchläfli symbol
4-polytopes		3-honeycombs
{4,3,3}	{5,3,3}	{4,3,4}	{5,3,4}
Thetesseracthas 3 cubic cells (3-faces) per edge.	The120-cellhas 3dodecahedralcells (3-faces) per edge.	Thecubic honeycombfills Euclidean 3-space with cubes, with 4 cells (3-faces) per edge.	Theorder-4 dodecahedral honeycombfills 3-dimensional hyperbolic space with dodecahedra, 4 cells (3-faces) per edge.

In higher-dimensional geometry, thefacets(also calledhyperfaces)^[8]of a $n$ -polytope are the ( $n - 1$ )-faces (faces of dimension one less than the polytope itself).^[9]A polytope is bounded by its facets.

For example:

The facets of aline segmentare its 0-faces orvertices.
The facets of apolygonare its 1-faces oredges.
The facets of apolyhedronor planetilingare its2-faces.
The facets of a4D polytopeor3-honeycombare its3-facesor cells.
The facets of a5D polytopeor 4-honeycomb are its4-faces.

Ridge or (n− 2)-face

In related terminology, the ( $n - 2$ )-faces of an $n$ -polytope are calledridges(alsosubfacets).^[10]A ridge is seen as the boundary between exactly two facets of a polytope or honeycomb.

For example:

The ridges of a 2Dpolygonor 1D tiling are its 0-faces orvertices.
The ridges of a 3Dpolyhedronor planetilingare its 1-faces oredges.
The ridges of a4D polytopeor3-honeycombare its 2-faces or simplyfaces.
The ridges of a5D polytopeor 4-honeycomb are its 3-faces orcells.

Peak or (n− 3)-face

The ( $n - 3$ )-faces of an $n$ -polytope are calledpeaks.A peak contains a rotational axis of facets and ridges in a regular polytope or honeycomb.

For example:

The peaks of a 3Dpolyhedronor planetilingare its 0-faces orvertices.
The peaks of a4D polytopeor3-honeycombare its 1-faces oredges.
The peaks of a5D polytopeor 4-honeycomb are its 2-faces or simplyfaces.

Notes

^Some other polygons, which are not faces, are also important for polyhedra and tilings. These includePetrie polygons,vertex figuresandfacets(flat polygons formed by coplanar vertices that do not lie in the same face of the polyhedron).

References

^Merriam-Webster's Collegiate Dictionary(Eleventh ed.). Springfield, MA:Merriam-Webster.2004.
^Wylie Jr., C.R. (1964),Foundations of Geometry,New York: McGraw-Hill, p. 66,ISBN 0-07-072191-2
^^a ^b ^cMatoušek, Jiří(2002),Lectures in Discrete Geometry,Graduate Texts in Mathematics,vol. 212, Springer, 5.3 Faces of a Convex Polytope, p. 86,ISBN 9780387953748.
^Cromwell, Peter R. (1999),Polyhedra,Cambridge University Press, p. 13,ISBN 9780521664059.
^^a ^bGrünbaum, Branko(2003),Convex Polytopes,Graduate Texts in Mathematics, vol. 221 (2nd ed.), Springer, p.17.
^^a ^bZiegler, Günter M.(1995),Lectures on Polytopes,Graduate Texts in Mathematics, vol. 152, Springer, Definition 2.1, p. 51,ISBN 9780387943657.
^Matoušek (2002)andZiegler (1995)use a slightly different but equivalent definition, which amounts to intersecting $P$ with either a hyperplane disjoint from the interior of $P$ or the whole space.
^N.W. Johnson:Geometries and Transformations,(2018)ISBN 978-1-107-10340-5Chapter 11:Finite symmetry groups,11.1 Polytopes and Honeycombs, p.225
^Matoušek (2002),p. 87;Grünbaum (2003),p. 27;Ziegler (1995),p. 17.
^Matoušek (2002),p. 87;Ziegler (1995),p. 71.

External links

[4] Some other polygons, which are not faces, are also important for polyhedra and tilings. These includePetrie polygons,vertex figuresandfacets(flat polygons formed by coplanar vertices that do not lie in the same face of the polyhedron).

[1] Merriam-Webster's Collegiate Dictionary(Eleventh ed.). Springfield, MA:Merriam-Webster.2004.

[2] Wylie Jr., C.R. (1964),Foundations of Geometry,New York: McGraw-Hill, p. 66,ISBN 0-07-072191-2

[m-3] Matoušek, Jiří(2002),Lectures in Discrete Geometry,Graduate Texts in Mathematics,vol. 212, Springer, 5.3 Faces of a Convex Polytope, p. 86,ISBN 9780387953748.

[5] Cromwell, Peter R. (1999),Polyhedra,Cambridge University Press, p. 13,ISBN 9780521664059.

[g-6] Grünbaum, Branko(2003),Convex Polytopes,Graduate Texts in Mathematics, vol. 221 (2nd ed.), Springer, p.17.

[z-7] Ziegler, Günter M.(1995),Lectures on Polytopes,Graduate Texts in Mathematics, vol. 152, Springer, Definition 2.1, p. 51,ISBN 9780387943657.

[8] Matoušek (2002)andZiegler (1995)use a slightly different but equivalent definition, which amounts to intersecting $P$ with either a hyperplane disjoint from the interior of $P$ or the whole space.

[9] N.W. Johnson:Geometries and Transformations,(2018)ISBN 978-1-107-10340-5Chapter 11:Finite symmetry groups,11.1 Polytopes and Honeycombs, p.225

[10] Matoušek (2002),p. 87;Grünbaum (2003),p. 27;Ziegler (1995),p. 17.

[11] Matoušek (2002),p. 87;Ziegler (1995),p. 71.

[1]

[2]

[3]

[note 1]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

Face (geometry)

Polygonal face

Number of polygonal faces of a polyhedron

k-face

Vertex or 0-face

Edge or 1-face

Face or 2-face

Cell or 3-face

Facet or (n− 1)-face

Ridge or (n− 2)-face

Peak or (n− 3)-face

See also

Notes

References

External links