Cross-polytope Created 2026-10-05 Updated 2026-10-06
The convex hull of the positive and negative coordinate unit vectors. Its boundary triangulates a sphere, and each face contains at most one member of each antipodal pair of coordinate unit vectors. This makes its barycentric subdivision useful for triangulating Real projective space.
Edge inversion 2026-11-05
An edge inversion in a group action on a tree occurs when a group element preserves an edge as a set while exchanging its two endpoints. Thus setwise edge preservation is weaker than fixing the edge pointwise.
For the tree consisting of one edge with endpoints , the order-two action swapping and is an inversion. It has no fixed vertex, although the midpoint is fixed in the geometric realization. Arguments requiring a fixed vertex must therefore exclude inversions or change the tree.
Barycentric subdivision inserts one new vertex at the midpoint of every edge. The induced action preserves the old and new vertex types. Each subdivided edge joins different types, so its endpoints can no longer be exchanged. This removes all edge inversions while retaining the original action on the underlying geometric tree.
Free group action on a tree Created 2026-09-24 Updated 2026-11-05
Suppose a group acts on a tree without edge inversions, and only the identity fixes a vertex. Then is a free group. Equivalently, the induced action on the geometric realization is free on every point: no nonidentity element fixes a vertex or an edge midpoint.
The quotient is a graph, and the map from the tree is a covering graph. Indeed, two incident edge germs with the same image would be related by a vertex stabilizer, which is trivial. Since the tree is simply connected, it is the universal cover of the quotient. Choosing lifts of a maximal subtree identifies with the quotient graph's fundamental group, freely generated by the edges outside that subtree.
The no-inversion hypothesis matters. The order-two group acting on a single edge by swapping its endpoints fixes no vertex, yet fixes the midpoint. That group is not a free group, and its quotient map folds the edge instead of giving a covering graph. Barycentric subdivision exposes the midpoint as a fixed vertex, removing this ambiguity.
Mesh of a simplicial complex Created 2026-10-03 Updated 2026-11-05
For a geometric simplicial complex in a Euclidean space, its mesh is the supremum of its simplex diameters:
If has finite dimension , its barycentric subdivision satisfies
The vertices of a subdivided simplex are barycentres of nested faces. Bounding the distances between those barycentres gives the displayed factor, uniformly over all original simplexes.
Consequently, if the initial mesh is finite, iterating gives . In particular this holds for a finite simplicial complex. An infinite geometric complex with unbounded edge lengths can instead have infinite mesh after every finite subdivision, so finite dimension alone does not imply the asserted convergence.
The two-dimensional Schoenflies theorem says that a simple closed piecewise linear curve in separates it into two components whose closures are piecewise linear balls of dimension two. In particular, a homeomorphism of the curve to the equator extends to a piecewise linear homeomorphism of the whole sphere.
A piecewise linear ball is a space piecewise linearly homeomorphic to a standard simplex. Write . The complementary disk to in each is a disk by the two-dimensional Schoenflies theorem. Thus each pair is piecewise linearly homeomorphic to a sphere with a chosen hemisphere. Choose these boundary maps to agree on . Extend them to the interiors by coning from an interior point, after compatible subdivisions. The resulting maps identify and with the two halves of a standard ball, glued along its equatorial disk. Consequently
The same boundary parametrization proves a useful companion fact: if a ball is indented by removing a smaller ball attached along a boundary disk, the closure of what remains is again a ball. In the standard boundary-disk model, move the indented disk through a collar neighbourhood to a flat disk.
A handle decomposition is a filtration obtained by attaching handles along in the boundary of the preceding stage. The number is the handle index; index-zero handles are disjoint balls, and index- handles close the remaining spherical boundary components. Starting with a triangulation of , thicken its vertices, then its edges, and successively its higher-dimensional simplexes. In a barycentric subdivision these thickenings have precisely the indicated handle and attaching-region product structures. Adding collars between successive attachments gives a collared handle decomposition.
For a critical level handle embedding, assign successive distinct heights to the handles. At height the horizontal slice contains the th handle and its attaching region. Between handle heights, the embedded boundary of the previously attached handles travels along its product collar; there is no topological change there. The lower boundary collar meets the attaching region of the next handle, and the upper collar leaves its new boundary. The stated ambient isotopy therefore separates all topology changes into horizontal handles and all intervening motion into collars. For an embedded surface, the local changes are the appearance of a disk, attachment of a band, and disappearance of a disk.
Here is the three-dimensional conclusion, with the distinction between the bounded and unbounded regions made explicit: a piecewise linear embedded in bounds a piecewise linear three-ball; in the one-point compactification , both complementary closures are three-balls. The unbounded closure in itself is not a compact ball.
Put the embedded sphere in critical level handle embedding position. At a regular horizontal level its intersection with the plane is a finite disjoint union of simple closed curves. An innermost such curve bounds a planar disk whose interior misses the sphere. Cut the sphere along this curve and insert two slightly displaced copies of the disk. This replaces one sphere by two spheres. Repeat at regular levels between the critical heights, using innermost curves first. The number of curves at these chosen levels decreases at each operation, so the process stops. Each resulting sphere then lies in a slab containing at most one horizontal handle.
These terminal spheres bound balls directly. With no handle the surface is a disk transported through a collar and capped at its ends, the boundary of . A minimum or maximum merely supplies one of those caps. At a band level there are two planar boundary circles on one side and one on the other. Cap the two circles, straighten each planar disk using the two-dimensional Schoenflies theorem, and straighten the joining band in its planar collar. If the circles are not nested, this gives two balls joined along a boundary disk; if they are nested, it gives a ball with one boundary-attached ball removed. The gluing three-balls along a boundary disk argument and its indentation version show in both cases that the terminal sphere bounds a ball. This also explains why the planar position of the band matters: no assertion about an arbitrary knotted band is being made.
Reverse the disk surgeries. Suppose the two resulting spheres bound balls and . Their disjoint boundaries imply that the balls are disjoint or one contains the other. Shrink the small displacement of the two surgery caps back to the original planar disk. In the disjoint case, the pre-surgery sphere bounds the union of two balls along that disk. In the nested case, it bounds the larger ball with the smaller boundary-attached ball removed. Both are balls by the preceding elementary facts. Induction through the finitely many surgeries proves the Three-dimensional Schoenflies theorem. To treat the other region in , remove a point inside the ball just constructed and apply the same argument in the resulting copy of .
A 3-manifold is an irreducible three-manifold when every piecewise linear embedded two-sphere bounds a ball. Suppose is a universal cover, and lift an embedded sphere to . Since is simply connected, its lift maps homeomorphically to . By the Three-dimensional Schoenflies theorem, bounds a compact ball. The inverse image of is locally finite, so only finitely many other lifted spheres lie inside this ball. Choose an innermost one, bounding a ball whose interior meets no lift of .
The interior of maps to one component of . This restriction is a covering map onto : a path in starting in the image lifts into , since it cannot cross a lifted boundary sphere. The covering is proper, because a compact subset of has preimage closed in the compact ball and cannot meet . Near , the boundary map is one-to-one, so this connected covering has one sheet. The map on is therefore a homeomorphism onto . Thus every embedded sphere in bounds a ball, and is an irreducible three-manifold.
The standard simplicial decomposition of a sphere is the boundary of the cross-polytope with vertices , identified radially with . A face chooses distinct coordinate indices and one sign for each; it never contains an antipodal pair.
A regular antipodal triangulation of a sphere is invariant under the antipodal map and has the nested coordinate equators as subcomplexes. In particular each equator separates its sphere into two triangulated hemispheres. These conditions are preserved by barycentric subdivision.
For a simplicial map , a positive alternating simplex of dimension has distinct image labels
The opposite alternating pattern is negative; all other simplices, including collapsed images, are neutral.
To prove the antipodal alternating-simplex parity lemma, let count positive -simplices in the equatorial . There is exactly one positive vertex in , so . A -simplex has an odd number of positive alternating facets precisely when it is positive or negative alternating. Indeed an alternating sequence has exactly one positive alternating deletion; a nonalternating sequence has either zero or two. For a collapsed image, a positive facet can occur only when exactly one label is repeated; deleting either copy gives two such facets.
Count incidences of positive -faces with -simplices in one closed hemisphere. Interior faces contribute twice and equatorial faces once. The count modulo two is therefore . It is also the number of positive or negative -simplices in that hemisphere modulo two. Because is antipodal, each alternating pair has one positive and one negative member, with one member in each hemisphere. Thus
Induction gives odd , proving the existence of a positive -simplex. In particular, an antipodal simplicial map is impossible: a positive -simplex would require distinct coordinate labels but only are available.
The Borsuk-Ulam theorem states that every continuous map has some with . First rule out a continuous antipodal map for . By uniform continuity, take a sufficiently fine regular barycentric subdivision so that endpoints of each edge have images less than apart. Label a vertex by , where is the smallest index maximizing . Since is unit length, this maximum is at least ; two adjacent vertices cannot have opposite labels. The labels therefore define an antipodal simplicial map to , contradicting the preceding result.
If the stated Borsuk-Ulam theorem failed, the map
would be just such a continuous antipodal map. This proves the required version; is immediate.
For the Kneser conjecture, equivalently Lovász theorem on Kneser graphs, the claim is
The Kneser graph joins disjoint -subsets of . Let . Colour each -set by its least element in when it has one, and otherwise by one final colour. A colour class indexed by is an intersecting family because all its members contain ; the final class lies in a -set and is also intersecting. This proves the upper bound .
For the lower bound, first deduce the open-cover Lusternik-Schnirelmann-Borsuk theorem. An open cover of admits a continuous partition of unity subordinate to it. Apply the Borsuk-Ulam theorem to . Equal values at and make all values equal. At least one common value is positive, so some contains an antipodal pair.
Now suppose the -sets could be coloured with only colours, each an intersecting family. Choose points such that every of their vectors are linearly independent. For example, normalize for distinct real ; the Vandermonde determinant proves this property. The general-position hemisphere count says that at most points lie on any equator. Since , at least one of the opposite open hemispheres determined by contains an -set of the labelled points.
Let be the open set of directions whose positive open hemisphere contains an -set of colour . It contains no antipodal pair, as such a pair would give two disjoint sets of that colour. The compact set also contains no antipodal pair: otherwise each of the two opposite hemispheres would have at most points, contradicting the count .
If is nonempty, compactness gives a positive set distance between and ; an open neighbourhood of radius less than half that set distance still has no antipodal pair. If is empty, take . In either case is an open cover with no member containing an antipodal pair, contradicting the Lusternik-Schnirelmann-Borsuk theorem. Hence at least colours are required.
The Simplicial approximation theorem states that a continuous map between realizations of finite simplicial complexes becomes homotopic to a simplicial map after sufficiently many barycentric subdivisions of the domain. More precisely, a vertex assignment is a simplicial approximation when the image of each open star is contained in the open star of its assigned vertex; sufficiently fine subdivision permits such an assignment. The resulting straight-line homotopy stays in the appropriate target simplices.
The vertices of a barycentric subdivision are the barycentres of nonempty faces. An -simplex has such faces. A top-dimensional subdivided simplex corresponds to a full flag of faces of sizes , equivalently to an ordering of the original vertices. Thus
Triangulate both copies of the sphere using finite complexes. For each fixed subdivision level there are only finitely many vertex maps to the finite target vertex set, hence only finitely many simplicial maps. Every continuous map is homotopic to one of them at some finite level. A countable union of finite sets is countable, proving at most countably many homotopy classes without needing their classification by degree.
The Excision theorem for singular homology states that if and , inclusion induces isomorphisms for all . For an open cover , its small-chain form says that the subcomplex of singular chains whose individual simplices lie in or computes . Concretely, repeated barycentric subdivision puts each finite chain in that subcomplex, and subdivision is chain-homotopic to the identity. There is then a short exact sequence of chain complexes
Its long exact sequence in homology, with excision identifying the last complex's homology with , is the Mayer–Vietoris sequence:
The Real projective space is a circle. The projective plane has one cell in each dimension , with cellular homology boundary maps and . Thus, writing , we have , and for . Cover the circle by two open arcs with a two-component intersection and multiply this cover by the projective plane. In the Mayer–Vietoris sequence the overlap-to-cover map is
Its kernel and cokernel are each . Consequently for . In degree one the quotient is free, so this sequence splits; in degree two it identifies the group directly with . The integral homology of a circle times a real projective plane is therefore
Without a compactness restriction, the answer to the final existence question is yes: there is a noncompact oriented four-manifold. Explicitly, take
The involution is free and reverses orientation on both and , hence preserves their product orientation. Its quotient is consequently an oriented three-manifold, the orientable total space of the orientation line bundle of the projective plane. The contraction is a deformation retraction onto , so .
If a closed oriented manifold is intended, the answer instead is no. A closed connected oriented -manifold has and no homology above . Here the highest nonzero positive-dimensional homology is the torsion group , so no dimension can supply that required top fundamental class. The distinction is necessary because the printed wording does not require the oriented manifold to be closed or three-dimensional.
Let be a homotopy from to . The inverse images form a finite open cover of the compact product. By the Lebesgue number lemma there is such that every subset of diameter less than lies in one of these inverse images.
Choose a barycentric subdivision with all its open stars of diameter less than , and times with gaps less than . For each vertex and each time , the set
(with the evident endpoint conventions) has diameter less than in the product metric. Choose a vertex of whose open star contains its image under , and set .
At time , the star condition makes a simplicial approximation to . Adjacent intervals overlap, so choose a time in their overlap and a point in the interior of any simplex of . Its image belongs to the stars of every and for . As in (i), their vertices lie in one carrier simplex, proving contiguity. Thus the sequence starts with an approximation to , ends with one to , and has contiguous adjacent pairs. Relabeling its indices gives the requested .
Here denotes contiguity, with the endpoint maps approximating respectively.
A Heegaard splitting of a closed oriented three-manifold is a decomposition into two handlebodies, with their common boundary the Heegaard surface . With boundary present, the corresponding pieces are compression bodies, whose negative boundaries account for .
For the given triangulation, take the barycentric subdivision. A regular neighbourhood of the original one-skeleton is a handlebody: thicken vertices to balls and edges to one-handles, then contract a spanning tree. The complementary region is a regular neighbourhood of the dual one-skeleton, whose vertices are tetrahedron centres and whose edges cross triangular faces. It too is a handlebody. Both graphs are connected, and their common boundary supplies the Heegaard splitting. If the original triangulation has vertices and edges, its Heegaard surface has genus ; the dual count gives the same number by .
Choose an oriented meridian of a knot and the Seifert longitude supplied by a Seifert surface for the null-homologous knot. For relatively prime integers , rational Dehn surgery removes the interior of a tubular neighborhood and attaches a solid torus with its meridian of a solid torus on the unoriented slope . The choices and describe the same slope; is the original meridional filling. The boundary gluing reverses boundary orientation so that the oriented three-manifold extends across the filling.
For integral coefficients , attach two-handles to along the components of the framed link, with their indicated Seifert framing shifts. The boundary operation removes and inserts , with meridian . Thus the compact oriented surgery trace satisfies
For a finite rational coefficient, use a negative continued fraction
Replace that component by an integrally framed chain of successive meridians with coefficients . Repeated slam-dunk moves give back . Perform this replacement for every rationally framed component, leaving meridional fillings out. The resulting integral framed link has the same filled boundary, so its surgery trace proves that every such rational filling bounds a compact oriented four-manifold.
A simplicial approximation to is a simplicial map satisfying the open-star condition
for every vertex . Equivalently, whenever lies in the interior of a simplex of , lies in that simplex. In particular and are joined by the simplexwise straight-line homotopy.
The Simplicial approximation theorem says that, for finite , every continuous has such an approximation after sufficiently many barycentric subdivisions of . For general complexes one uses a subdivision adapted to the open-star cover; a single uniform number of barycentric subdivisions is the compact-domain version.
Given triangulations , , choose a simplicial approximation on a suitable subdivision . Its chain map sends an oriented simplex to , with repeated-vertex simplices sent to zero. It commutes with the boundary operator and induces . Compose this with the subdivision isomorphism and the triangulation identifications to define .
For , a positively oriented fundamental loop winds times around the target circle. With integer coefficients,
All higher homology groups vanish. The result can also be read from a subdivision into copies of a target fundamental cycle.
Triangulate the sphere by the boundary complex of the cross-polytope with simplicial vertices : a face contains at most one simplicial vertex from each antipodal pair. Take its barycentric subdivision. Its simplicial vertices are the nonempty faces of the original complex, and its simplices are strictly nested chains .
Form a quotient complex whose simplicial vertices are pairs , and whose simplices are the images of these chains. No chain contains both and . Moreover a chain of face-orbits lifts uniquely up to simultaneous negation: after choosing a largest face, every smaller face has at most one representative contained in it, because an original face contains no antipodal simplicial vertices. Thus the quotient is an honest simplicial complex, without two different simplices with the same simplicial vertex set. Its realization is homeomorphic to the sphere modulo its antipodal action. This provides a triangulation of Real projective space . The subdivision avoids the duplicate-simplex problem of naively identifying simplicial vertices in the unsubdivided cross-polytope boundary.
For every nonempty simplex of , let be its barycentre. The first barycentric subdivision has the as vertices, and
is a simplex exactly when, after reordering, . Its realization is the same polyhedron as that of . The iterated barycentric subdivision is defined by
Suppose and that the interiors of and cover . The Mayer–Vietoris theorem gives the long exact sequence in homology
where all four displayed maps except the connecting homomorphism are induced by the relevant inclusion maps.
To prove it, let be the chain complex generated by those singular simplices whose images lie wholly in or wholly in . The sequence
is a short exact sequence of chain complexes. Repeated barycentric subdivision makes every singular simplex small enough to lie in or , and the subdivision operator is chain homotopic to the identity. The inclusion therefore induces an isomorphism on every homology group. The long exact homology sequence of a short exact sequence of chain complexes now gives the displayed sequence. Explicitly, if an -cycle with and , then lies in and represents the connecting class .
The small simplex theorem says that the inclusion of the subcomplex generated by singular simplices whose images lie wholly in or wholly in ,
is a chain-homotopy equivalence. Repeated barycentric subdivision supplies the inverse up to chain homotopy.
The simplices in a barycentric subdivision are strict chains of nonempty faces. A tetrahedron has nonempty faces, so . Counting strict two-face chains gives
A strict three-face chain amounts to choosing a terminal face and partitioning its vertices into three nonempty ordered blocks. Hence
where denotes a Stirling number of the second kind. Therefore
Equivalently, the full subdivision has tetrahedra and Euler characteristic one, so deleting its three-dimensional simplices from the alternating count gives . This is the f-vector computation for the barycentric subdivision of a tetrahedron.
For an open cover , the Mayer–Vietoris theorem gives the long exact sequence
It ends in . To prove it, let be the subcomplex generated by singular simplices lying wholly in or wholly in . There is a short exact sequence of chain complexes
Exactness follows from the singular-simplex bases: the intersection of the two chain subgroups consists exactly of simplices lying in both sets. The small-chain locality theorem for singular homology says the inclusion of this small-chain complex into induces an isomorphism on homology; barycentric subdivision is its standard justification. The long exact sequence of a short exact sequence of chain complexes now proves the theorem. For a homological cycle represented as , the connecting map is , since lies in the intersection. This also identifies the displayed maps and their signs.
For the glued solid tori, use open collar enlargements of the two halves. Each retracts to a circle; the overlap retracts to their boundary torus. Thus the halves have and higher homology zero, while the overlap has and . In the overlap choose longitude and meridian generators. The meridian bounds a disk in each solid torus and the longitude generates each first homology, so the map on is
Its kernel is the meridian copy of and its cokernel is . The map on is the injective map . Exactness therefore gives and . The preceding segment is , giving . Connectedness gives , and all higher groups vanish. Hence
As a geometric check, the identity boundary gluing identifies the product with .
Use a convex representative of the marked polygonal schema, retaining the side-pairing parametrizations. This does not change the quotient up to homeomorphism: a matching boundary homeomorphism extends over the two polygonal discs by radial extension in disc coordinates. Join an interior point to every vertex, producing finitely many triangles. Orient radial edges away from the interior point and choose boundary-edge orientations consistently with the side identifications. Each triangle then has a local vertex ordering with the centre first; the other two vertices are ordered along its boundary-edge arrow. These orderings agree on shared edges, so the quotient is a finite delta-complex whose underlying space is the prescribed polygon quotient.
This need not yet be an abstract simplicial complex: two vertices of a triangle may become identified, or different triangles may have the same vertex set. Apply barycentric subdivision twice.
In the first subdivision, every small simplex corresponds to a flag of faces of strictly increasing dimensions. Identifications preserve dimension, so its vertices are distinct. In the second subdivision, a vertex records an actual cell of the first subdivision. A set of such vertices determines their order by dimension. Inside any one first-subdivision simplex, distinct vertices make each face inclusion uniquely determined by its vertex subset; hence a flag has at most one realization. Therefore different second-subdivision simplexes cannot share the same vertex set, and they meet in precisely their common faces. Thus the second subdivision is an abstract simplicial complex .
The affine subdivision maps are compatible with every face identification, so their realizations are homeomorphisms. Consequently
where is finite. This proves triangulation of a polygon with paired sides by the second barycentric subdivision of a delta-complex construction.[ref]
A triangulation of is regular in this antipodal-combinatorics convention when the antipodal map preserves its simplices and its nested coordinate equators are subcomplexes. The two closed hemispheres at each stage are then triangulated balls. Barycentric subdivision preserves these conditions while making the mesh of a simplicial complex arbitrarily small. This convention is distinct from other meanings of regular triangulation in polyhedral geometry. Cambridge extremal-combinatorics notes use this convention.
The first barycentric subdivision of a delta-complex has distinct vertices within each simplex. Its vertices correspond to an increasing chain of original faces, and their strictly different dimensions prevent identifications within that chain. Distinct simplexes may still share the same global vertex set, as happens to the two halves of a subdivided loop edge.
For a delta-complex with distinct vertices within each simplex, a face inside a fixed simplex is uniquely determined by its vertex subset. In its barycentric subdivision, a vertex records an actual face, including its cell identity. A simplex records a chain of these faces; its vertex set recovers the unique order by dimension and each unique face inclusion. Thus no two simplexes have the same vertex set, and intersections are their common faces. Applying this to the first subdivision proves that the second subdivision is an abstract simplicial complex. The subdivision maps are affine on smaller simplexes and compatible on the glued faces, so they induce a homeomorphism of realizations.[ref]