The open star in a simplicial complex of a vertex is the union of the relative interiors of the simplices containing . In barycentric coordinates it is
Let be the subcomplex consisting of all simplices not containing . The complement of the star is exactly : the positive-coordinate support of a point misses precisely when it is a simplex of . By the allowed closed-subcomplex theorem, is closed in . Hence the star is open.
This is the open-star convention required by the question. The closed star, which also includes the opposite faces, is a different subset and need not be open.
An abstract simplicial complex consists of a vertex set and a collection of finite nonempty subsets containing every singleton and every nonempty subset of each member. A member with vertices is an -simplex.
Its topological realization glues a standard geometric simplex for each member along common faces. A concrete model is
with finite support and the weak topology of a simplicial realization: a set is closed precisely when its intersection with every simplex is closed. This agrees with the quotient topology of the gluing construction. Specifying this topology matters for complexes with infinitely many vertices.
The standard simplex of dimension is
It is the convex hull of the coordinate vectors, and its faces of a simplex arise by setting selected coordinates to zero.
An abstract simplicial complex is a pair where is the vertex set and consists of finite nonempty subsets of , contains every singleton, and contains every nonempty subset of each member. A member with vertices is an -simplex.
Its geometric realization is obtained by gluing one standard simplex for each member along the faces specified by common vertex subsets. Equivalently, its points have barycentric coordinates with finite support, nonnegative entries summing to one, and support a simplex of . Use the topology induced by this gluing, equivalently the weak topology of a simplicial realization.
An abstract simplicial complex is a pair , where is a set of vertices and is a family of finite nonempty subsets of satisfying two conditions: every singleton is in , and every nonempty subset of a member of is again in . Its members are the simplexes; a face with vertices has dimension .
To form its topological realization, take a disjoint copy of the standard geometric simplex for every , label its vertices by , and identify shared labelled faces using affine face inclusions. Give the resulting space the quotient topology of this disjoint union. Equivalently, its points have finite-support barycentric coordinates with and positive support belonging to .
The topology is part of the definition: is open exactly when is open in each closed geometric simplex. This is the weak topology of a simplicial realization, used below for the infinite complex. For finite complexes it coincides with the usual Euclidean realization topology.[ref]
A topological surface is a Hausdorff space with a countable basis of a topology in which every point has an open neighbourhood homeomorphic to an open subset of the Euclidean plane. We use the convention that a surface has no boundary unless a surface with boundary is explicitly specified. A closed surface is compact and has no boundary. Some conventions also include connectedness in the definition; we impose it on the closed combinatorial surface below.
A closed combinatorial surface is a finite connected simplicial complex with the following properties: every simplex is a face of a simplex of dimension two, and the link of a simplex at every vertex is a cycle graph. Explicitly, for a vertex its link is the simplicial subcomplex
To say this is a cycle graph means that there are distinct vertices , with , and exactly the link edges , with indices modulo . In particular, every edge of belongs to exactly two triangles. The vertex-link condition also requires that the triangles around each vertex form one cyclic fan; edge incidence alone would allow singular examples.
These conditions make a closed surface. A point inside a triangle has a disc neighbourhood, the two triangles at an edge give a disc neighbourhood, and the cyclic fan at a vertex gives a disc neighbourhood. Finiteness gives compactness, the Hausdorff property, and a countable basis of a topology from a realization in a finite-dimensional Euclidean space. If disconnected closed combinatorial surfaces are allowed, each connected component satisfies this definition separately.
Fix a vertex of a simplicial complex , and let be the set of vertices reachable from by an edge path. If a simplex contains a vertex of , every vertex of that simplex lies in : append its edge from the reachable vertex to the existing edge path. Thus every simplex has either all its vertices in or all outside .
Partition the geometric realization as , according to whether the support in the barycentric coordinate system lies in or outside . On each geometric simplex, the intersection with is either the whole simplex or the empty set, and the same holds for . The defining realization topology therefore makes both and closed, hence also open because they are complements.
The vertex belongs to . If any vertex were unreachable, it would belong to the nonempty set , giving a separation of a topological space of . This contradicts connectedness. Therefore every vertex is reachable from , and any two vertices can be joined by an edge path.
An abstract simplicial complex consists of a set of vertices of a simplicial complex and a family of finite nonempty subsets of , called abstract simplexes, such that every singleton belongs to and every nonempty subset of a member of also belongs to . One may include the empty set as an additional face by convention. A member with vertices is a -simplex; its nonempty subsets are its faces of a simplex.
The geometric realization has the following explicit description using a barycentric coordinate system:
Here the support is . Each gives a standard geometric simplex
with its usual Euclidean topology. Common faces of a simplex are identified using the same barycentric coordinate system.
Precisely, the topology on is defined by declaring closed if and only if is closed in for every . Equivalently, use the quotient topology on the disjoint union of all the standard geometric simplexes, identifying identical points of common faces of a simplex. For a finite simplicial complex, this agrees with the subspace topology in . For an infinite simplicial complex, the stated rule specifies the realization topology without presuming a finite-dimensional ambient space.
Use compatible edge identifications: choose a bijection between the three boundary vertices of and those of , and extend it linearly on each edge. This defines a simplicial homeomorphism of the two boundary circles. This compatibility is the usual meaning of gluing the two boundary triangles; independently chosen edge reversals need not agree at their endpoints. The classification needed here is 3(a)(iv); the printed reference to 3(a)(iii) is a source error.
Delete the two triangular simplexes but retain all their proper faces of a simplex, and identify the two resulting boundary simplicial subcomplexes by this map. The result is a finite abstract simplicial complex : vertices from different sides are identified only in the boundary, and the only shared edges are boundary edges. There is no triangle consisting of all three boundary vertices after the two faces have been removed. Consequently no other simplexes become duplicates. Its geometric realization has the specified quotient topology and is homeomorphic to .
We check the closed combinatorial surface conditions. Away from the seam, vertex links of a simplex remain cycle graphs. At a boundary vertex of or , removing the face changes its link from a cycle graph to a graph path, with endpoints corresponding to its two boundary edges. Gluing the boundaries identifies the two paths' respective endpoints, making one cycle graph. Each seam edge now meets one triangle from and one from , and all other edges retain their original two incident triangles. Thus every vertex link is a cycle graph and every simplex lies in a triangle. The simplicial complex is connected, since the two connected punctured surfaces meet along their boundary circle. Hence is a closed combinatorial surface.
This construction is the connected sum of surfaces . For completeness, compute its Euler characteristic directly. Removing a triangular face while retaining its edges and vertices subtracts one, so
Gluing identifies three vertex pairs and three edge pairs, giving
For the explicit triangulations above, this is also .
Finally is a nonorientable surface. If were orientable, its restriction would make orientable. The consistent choices of orientation of a simplex on its triangles extend across a capping disc: choose the cap's orientation of a simplex so that the induced directions on the common boundary oppose. Capping by would therefore make the real projective plane orientable, a contradiction. The obstruction to orientability in the real projective plane can also be seen from a Möbius band neighbourhood of a projective line.
By the classification theorem for closed combinatorial surfaces, a nonorientable surface with Euler characteristic has , hence . Therefore
We construct both the required triangulation and its polygonal schema. Subdivide the square into a grid. Insert the centre of each small square and join it by line segments to its four corners, making four triangles per small square. Identify opposite sides of by translations: and . This is the standard quotient space presentation of the torus.
The grid and centre vertices, with these identifications, define an abstract simplicial complex . Every triangle contains its own small-square centre and two consecutive grid vertices, so no triangle has identified vertices and no distinct triangles acquire the same vertex set. Only intended common sides or vertices are shared. Thus this is a genuine finite triangulation, whose geometric realization is homeomorphic to . There are vertices, edges and triangles, giving Euler characteristic zero.
Choose the simplex represented in the interior of by the triangle with vertices
Remove its relative interior. Before identifying the square's sides, the remainder is a closed disc with a triangular hole, hence an annulus. Cut this annulus along the line segment from to , treating the two banks as distinct boundary arcs. The cut space is a closed disc; traversing its boundary follows the four outer edges, one bank, the three inner edges, and the other bank. It therefore has nine marked boundary sides.
A homeomorphism from this cut disc to a convex nine-sided polygon can be chosen to carry its nine marked sides to the nine polygon sides. One justification is to choose a boundary homeomorphism with the prescribed marked vertices and extend it over the disc by radial extension after disc parametrizations. Transport the identifications to this convex polygon. With labels recording traversal direction, its boundary word is
Identify equally labelled sides in their arrow directions: the two sides and two sides restore the torus pairings, while the two sides undo the cut. Leave unpaired. Their union is the triangular boundary of the removed simplex. The resulting quotient space is exactly
This is the polygonal presentation of a punctured surface. The word supplies all nine sides and every gluing; inverse exponents reverse the boundary traversal direction.
The strictly positive case states that a real square matrix with has a positive simple eigenvalue and positive left and right eigenvectors, with all other eigenvalues strictly smaller in modulus. The Brouwer fixed-point theorem applied to on the nonnegative unit simplex gives and . For another eigenvector , maximize ; the triangle inequality gives . Equality forces every modulus ratio and complex argument to agree because every entry is positive, so is proportional to and . Apply the same argument to for a positive left eigenvector; its positive pairing with rules out a generalized eigenvector at , establishing algebraic simplicity. For merely nonnegative matrices a nonnegative leading eigenvector exists. An irreducible nonnegative matrix has a positive leading eigenvector and simple Perron eigenvalue; a primitive nonnegative matrix has the strict modulus gap.
Piecewise linear ball Created 2026-10-14 Updated 2026-10-14
Polytope 2026-11-05
A convex polytope is the convex hull of finitely many points in a finite-dimensional real vector space. Equivalently, it is a bounded intersection of finitely many closed half-spaces. Its affine dimension may be smaller than that of the ambient space. Broader uses of polytope, including abstract or nonconvex versions, must specify their convention.
The simplex is the convex hull of affinely independent points; a square is a two-dimensional polytope with four vertices. The cube can be described either by its vertices or by the inequalities . These are its vertex and half-space descriptions.
A linear objective on a nonempty polytope attains its maximum at some vertex: every point is a convex combination of vertices, and its objective value is the same combination of vertex values. This links the geometry to linear programming. The maximizing vertex need not be unique, and an entire face may attain the optimum.
Simplex Created 2026-09-24 Updated 2026-11-05
An -simplex is the convex hull of affinely independent points. Every point has a unique expression with and , its barycentric coordinates. A zero-simplex is a point, a one-simplex a line segment, a two-simplex a filled triangle, and a three-simplex a tetrahedron. Its faces are obtained by taking subsets of the vertices. This uniform description allows simplicial complexes to build spaces from elementary pieces in every dimension.
Simplicial chain group 2026-11-05
For an abstract simplicial complex , the integer simplicial chain group is the free abelian group on its oriented -simplexes, with reversal of orientation changing sign. Thus a chain is a finite formal integer sum of oriented simplices. After choosing one orientation for each simplex, those chosen simplices form a basis of this abelian group.
For a filled triangle with vertices , , and . Its oriented two-simplex has boundary
Taking another boundary gives . This cancellation makes the simplicial chain complex possible: boundaries are cycles, and simplicial homology measures cycles modulo boundaries. With coefficients in an abelian group , use .[ref]
Simplicial complex Created 2026-09-24 Updated 2026-10-31
An abstract simplicial complex is a pair , where is a set of vertices of a simplicial complex and is a collection of finite nonempty subsets, called simplexes. Every singleton belongs to , and every nonempty subset of a simplex is a simplex. Its dimension is the supremum of over . Some conventions also include an empty simplex; it contributes no points to the geometric realization.
Simplicial homeomorphism 2026-10-25
A simplicial homeomorphism is the homeomorphism of geometric realizations induced by an isomorphism of simplicial complexes: a bijection of their vertex sets such that a finite vertex set is a simplex exactly when its image is a simplex. The map acts linearly in each barycentric coordinate system. It and its inverse are continuous by the realization topology. Between the boundaries of two triangles, any bijection of the three vertices extends linearly on edges to a simplicial homeomorphism. This ensures that the edge identifications agree at common endpoints.
Simplicial subdivision Created 2026-10-14 Updated 2026-10-25
A simplicial subdivision replaces the simplexes of a simplicial complex by finitely many smaller simplexes with the same underlying space, compatibly on common faces. A piecewise linear ball can be parametrized by a map linear on the simplexes after appropriate subdivisions of its domain and target.
Tetrahedron Created 2026-09-29 Updated 2026-10-14
A tetrahedron is the three-dimensional simplex, with four vertices, six edges, and four triangular faces.
Start with a singular disk whose boundary represents a prescribed nontrivial class in a boundary subsurface. Repeatedly lift it through double covering spaces of regular neighbourhoods of its image. The number of distinct image simplexes strictly increases and is bounded by the number of domain simplexes, so the tower ends. At the top, vanishing first mod-two homology forces every boundary component to be a sphere. An embedded disk can then be constructed and projected down the tower. Resolving double curves preserves a boundary class outside a chosen normal subgroup, giving an embedded compression disk at the bottom.
Walras's law 2026-10-13
At any price vector, the total value of aggregate excess demand is zero when consumers exhaust their budgets. After normalization to a price simplex, choosing a price that maximizes the value of a candidate excess-demand vector is a useful Kakutani fixed-point theorem construction.