Face (geometry)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 5 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In solid geometry, a face is a flat surface (a planar region) that forms part of the boundary of a solid object. For example, a cube has six faces in this sense. In more modern treatments of the geometry of polyhedra and higher-dimensional polytopes, a "face" is defined in such a way that it may have any dimension. The vertices, edges, and (2-dimensional) faces of a polyhedron are all faces in this more general sense.

In solid geometry, a face is a flat surface (a planar region) that forms part of the boundary of a solid object. For example, a cube has six faces in this sense. In more modern treatments of the geometry of polyhedra and higher-dimensional polytopes, a "face" is defined in such a way that it may have any dimension. The vertices, edges, and (2-dimensional) faces of a polyhedron are all faces in this more general sense.

Polygonal face

In elementary geometry, polyhedra are defined in various ways as shapes defined by systems of vertices (points), edges (line segments), and faces (polygons), that in many but not all of these definitions are required to form a surface that encloses a solid volume; the faces are the two-dimensional polygons of these definitions. Other names for a polygonal face include polyhedron side and Euclidean plane tile. For example, any of the six squares that bound a cube is a face of the cube. Sometimes "face" is also used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, each sharing two of 8 cubic cells.

Number of polygonal faces of a polyhedron

Any convex polyhedron's surface has Euler characteristic V - E + F = 2, where is the number of vertices, is the number of edges, and is the number of faces. This equation is known as Euler'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, a cube has 12 edges and 8 vertices, and hence 6 faces.

k-face

In higher-dimensional geometry, the faces of a polytope are features of all dimensions. A face of dimension is sometimes called a -face. For example, the polygonal faces of an ordinary polyhedron are 2-faces. The word "face" is defined differently in different areas of mathematics. For example, many but not all authors allow the polytope itself and the empty set as faces of a polytope, where the empty set is for consistency given a "dimension" of −1. For any -dimensional polytope, faces have dimension k with -1 \leq k \leq n . For example, with this meaning, the faces of a cube comprise the cube itself (a 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 as polyhedral combinatorics, a polytope is by definition convex. In this setting, there is a precise definition: a face of a polytope in Euclidean space \mathbf{R}^n is the intersection of with any closed halfspace whose boundary is disjoint from the relative interior of . According to this definition, the set of faces of a polytope includes the polytope itself and the empty set. For convex polytopes, this definition is equivalent to the general definition of a face of a convex set, given below. In other areas of mathematics, such as the theories of abstract polytopes and star polytopes, the requirement of convexity is relaxed. One precise combinatorial concept that generalizes some earlier types of polyhedra is the notion of a simplicial complex. More generally, there is the notion of a polytopal complex. An -dimensional simplex (line segment ( ), triangle ( ), tetrahedron ( ), etc.), defined by 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 faces in total. The number of -faces, for , is the binomial coefficient \binom{n+1}{k+1} . There are specific names for -faces depending on the value of and, in some cases, how close is to the dimension of the polytope.

Face of a convex set

The notion of a face can be generalized from convex polytopes to all convex sets, as follows. Let C be a convex set in a real vector space V . A face or extreme set of C is a convex subset F\subseteq C such that whenever a point p\in F lies strictly between two points x and y in C , both x and y must be in F . Equivalently, for any x,y\in C and any real number 0 such that \theta x+(1-\theta)y is in F , x and y must be in F .

See also

Face lattice Polyhedral combinatorics Discrete geometry

Bibliography

External links

de:Fläche (Mathematik)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1377967376 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.