How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Simplicial Subdivision and Simplicial Approximation
1 · Prerequisites
- Abelian Categories
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Foundations of the Real Numbers for Analysis
- Homotopy and Homotopy Equivalence
- Limits and Colimits
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simplicial Complexes and Simplicial Homology
- Subspaces, Products, and Quotients
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
Face chains give geometric barycentric subdivision and its canonical homeomorphism. Augmented cone contractions establish the oriented integral chain equivalence, including degree −1. Mesh estimates and the open-star criterion give finite-source approximation for pairs. Relative derived subdivision and a neighbourhood adjustment retain an already simplicial restriction pointwise; finite intersection cells then provide common linear refinements. The general compact-subset lemma states its Countable Choice hypothesis separately. The finite-source approximation argument is choice-free, and the chain inverse takes a vertex order as data.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Face poset and order complex
Definition
For an abstract simplicial complex , its face poset is ordered by inclusion. For a poset , its order complex has vertex set and faces all finite chains in , including the empty chain. Here a chain means a subset in which every two elements are comparable.
Inclusion is reflexive, antisymmetric and transitive, as required by Partial order and partially ordered set. Every subset of a finite chain is a finite chain, and each singleton is a chain, so this satisfies An abstract simplicial complex. If , then has no vertices. If has a least element , every face can be enlarged by ; this is a cone with a vertex, not the empty complex.
Source locators
2.5.10, pp.51–52 (face-chain description); general-poset formulation is an explicit abstraction of the face-chain construction, not a quotation.
Barycentric subdivision of an abstract simplicial complex
Definition
The barycentric subdivision of is , using Face poset and order complex. Thus its vertices are the nonempty faces of , and its nonempty simplices are strict chains .
A subcomplex gives with the induced order; hence every chain in is a chain in and is a subcomplex. The vertex associated to is distinct as a label from , though its geometric position will be the same. There is no vertex for the empty face; the complex with no vertices subdivides to itself.
Source locators
2.5.7–2.5.10, pp.49–52.
Canonical barycentric realization map
Definition
Write for the coordinate vertex of . For each nonempty face put . The canonical barycentric realization map is Here , and , as in Barycentric subdivision of an abstract simplicial complex. Each coordinate is nonnegative, the total is , and the support lies in , so the formula belongs to the realization in The geometric realization of an abstract simplicial complex. Zero coefficients can be deleted without changing the sum, so formulas on intersecting simplices agree. Each restriction is affine and continuous into the maximal original simplex, hence into ; the weak topology of the source makes continuous. For a vertex-free complex it is the unique empty map.
Source locators
2.5.7–2.5.10, pp.49–52.
Finite simplicial weak topology agrees with euclidean topology
Statement
For finite , the weak topology on equals the Euclidean subspace topology in ; is compact, metrizable and Hausdorff. If is a finite subcomplex of any , then is a closed embedding, with that same finite Euclidean topology.
Source locators
2C.1 proof, p.178; direct closed-cover verification.
Facts & Assumptions
Weak openness is tested on every Euclidean simplex. The geometric realization of an abstract simplicial complex.
A closed bounded subset of a positive finite-dimensional Euclidean space is compact. Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line.
Proof
Given: A simplicial complex and, for the last assertion, a finite subcomplex .
In a finite nonempty vertex set, each simplex is defined by nonnegative coordinates, sum , and zero coordinates outside its face. It is closed and bounded in the ambient finite-dimensional Euclidean space, hence compact. The finite union is also closed and bounded, hence compact by Heine–Borel. If has no vertices its realization is empty and compact directly.
If is weakly closed, then is closed in the Euclidean simplex, and thus closed in the ambient Euclidean space since is closed. Their finite union is , so is Euclidean closed. Conversely, a Euclidean relatively closed has closed traces on every simplex and is weakly closed. Consequently both topologies agree, and the Euclidean metric and Hausdorff property restrict to .
For finite and closed , write . For any , each summand meets in a closed subset of the common face , hence in a closed subset of . There are finitely many summands, so is weakly closed in . Conversely an ambient weakly closed set has closed traces on the simplices of . These two implications show that the inclusion induces exactly the topology of and is closed; taking proves the closed-image assertion.
Barycentric face chains triangulate a geometric simplex
Statement
For a finite geometric simplex , the convex hulls of barycenters along strict chains of nonempty faces form a triangulation of . Each such chain is affinely independent. Two chain simplices intersect in exactly the simplex spanned by their common face labels, with empty intersection when there are no common labels.
Source locators
2.5.8 and 2.5.10, pp.49–52.
Facts & Assumptions
Barycenters have equal coordinates on their face. Canonical barycentric realization map.
Affine coordinates in the original simplex are unique. Barycentric coordinates are unique.
Proof
Given: A simplex with unique barycentric coordinates, and strict chains of its nonempty faces.
Let a point have distinct positive coordinate levels , put , and set . These are nested nonempty faces. With , a vertex whose coordinate is has coordinate in . Also . Thus every point lies in a chain simplex.
For any strict chain , the vectors are linearly independent in barycentric coordinate space: in , a coordinate in gives , and descending induction gives every (finish with any vertex of ). Hence they are affinely independent in the original simplex too, by uniqueness of its affine coordinates.
If a point is expressed in one of these chain simplices, delete zero weights. Its coordinate on the successive layers of the remaining chain is strictly decreasing, with consecutive differences equal to the corresponding positive weight divided by the face cardinality. Thus the positive-weight faces are exactly the level sets in the first step and the weights are exactly . In two chain representations only common face labels can therefore carry positive weights. Conversely every convex combination of common labels belongs to both simplices. This proves precisely the intersection assertion and hence the triangulation. The empty simplex has no points; a one-vertex simplex has the sole weight .
Barycentric subdivision realizes homeomorphically
Statement
For any abstract simplicial complex with weak realization topology, is a homeomorphism. Its restriction over every subcomplex is , under the natural inclusions.
Source locators
2.5.8, pp.49–50; weak-topology extension proved locally.
Facts & Assumptions
Face chains triangulate each finite simplex with unique positive-weight representations. Barycentric face chains triangulate a geometric simplex.
Continuity out of the weak realization can be tested simplexwise. The geometric realization of an abstract simplicial complex.
Proof
Given: An arbitrary simplicial complex , without a local-finiteness assumption.
For every original finite simplex , its chain triangulation gives a bijection . The inverse formulas agree on common faces because the positive coordinate level sets depend only on the point. Every point of has a finite support face, so these inverses define a single global inverse to . This also proves .
On each subdivided simplex is affine into its maximal original simplex and is continuous. The weak topology on therefore implies global continuity: the inverse image of a closed set has closed trace on each simplex. On each original simplex the inverse is affine on finitely many closed chain simplices. A closed set has closed inverse trace on each of these pieces, and their finite union is closed in the original simplex; hence this inverse restriction is continuous. Testing on every original simplex with the weak topology gives continuity of the global inverse. The empty case is the empty homeomorphism, and all formulas restrict identically to subcomplexes.
Open and closed stars in a subdivision
Definition
For a vertex of a complex define its open star by . Define its closed star to be the subcomplex These definitions apply separately to and from Barycentric subdivision of an abstract simplicial complex; in the latter, vertices are nonempty original faces. Coordinates always refer to as in The geometric realization of an abstract simplicial complex.
On each simplex the condition is open, so the open star is weakly open. The closed star is closed under faces; its realization meets every simplex in a finite union of faces and is weakly closed. If and , then for is in the open star and converges to in that finite simplex. Hence the realization of the closed star is exactly the closure of the open star. Merely listing simplices containing would omit faces and would not define a subcomplex.
Source locators
2.C, p.178, star paragraph and Lemma 2C.2.
Compact subsets of an arbitrary simplicial realization meet finitely many open simplices
Statement
Assume the Axiom of Countable Choice. For any simplicial complex with weak topology, every compact meets only finitely many open simplices, and is contained in a finite subcomplex. Consequently the images of a finite family of continuous maps from compact simplices lie in one finite subcomplex. No local finiteness is assumed.
Source locators
Appendix Proposition A.1, p.520.
Facts & Assumptions
Countable independent families of nonempty sets admit a choice function. The Axiom of Countable Choice ().
Support faces are finite and weak closedness is tested on simplices. The geometric realization of an abstract simplicial complex.
Closed subsets of compact spaces and finite unions of compact subsets are compact. A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact.
Proof
Given: Countable Choice, an arbitrary , and compact .
If the set of open simplices meeting were infinite, for each positive integer let be the nonempty set of ordered -tuples of points of with distinct support faces. Countable Choice selects one tuple for each . Flatten these finite tuples into a sequence and retain, in their natural order, the first point in each previously unseen support face. There are infinitely many retained points since the tuple of length supplies different faces. This gives a sequence in distinct open simplices, using only the stated countable independent choices and least-index deletions.
A closed simplex has finitely many faces. Each retained point in it has a distinct support face contained in , so it contains only finitely many . Every subset of consequently has finite closed trace on every simplex and is weakly closed in . Thus is closed in and its subspace topology is discrete. Closedness in compact makes compact, whereas its singleton open cover has no finite subcover. This contradiction proves finite.
Include all faces of the finitely many simplices in to obtain a finite subcomplex containing ; if is empty use the vertex-free subcomplex. A continuous image of a compact simplex is compact because any open cover pulls back to an open cover with a finite subcover. A finite union of these images is compact, so the preceding conclusion applies to the entire family at once, including an empty family.
An augmented simplicial cone has an explicit chain contraction
Statement
A simplicial cone with specified apex means that for every . On its augmented integral chain complex, put and interpreting a repeated vertex as zero. Then in every degree, including , so the augmented complex is contractible. In particular the subdivision of a nonempty full simplex is a cone whose apex is its maximal face.
Source locators
2.1, p.121, cone identity adapted to oriented simplicial chains.
Facts & Assumptions
Oriented relations and alternating boundaries govern the computation. Simplicial chain groups and the boundary operator.
The degree-zero boundary on augmented chains sends every vertex to 1. Augmentation and reduced simplicial homology.
A null homotopy of the identity is a contraction. A contractible complex.
Proof
Given: A cone with apex ; integral oriented chains, augmented by and .
Adjoining stays inside by the cone hypothesis. Permuting the original vertices changes by the same sign, so respects the oriented-chain relations. If is absent from , expansion gives .
If , then . In all terms except deletion of repeat and vanish. The remaining term is , because moving back to position contributes another . In degree zero this says for , and for . In degree , . Thus the identity holds on all generators and hence all chains.
The identity is a null homotopy of the identity, hence contractibility. A chain of faces of a nonempty full simplex can always be enlarged by the maximal face; thus its order complex, as defined in Barycentric subdivision of an abstract simplicial complex, is a cone with that face as specified apex, and the same calculation applies.
Simplicial chain maps carried by specified cones are chain homotopic
Statement
Assign to each nonempty simplex of a cone subcomplex with a specified augmented contraction . Suppose whenever . If augmentation-preserving chain maps are carried by (their values on are supported in ), then a carried chain homotopy satisfies , with .
Source locators
4.3.9 proof, p.119, carried induction; specialized cone version.
Facts & Assumptions
A specified cone contraction fills each augmented cycle. An augmented simplicial cone has an explicit chain contraction.
The equation is the definition of chain homotopy. A chain homotopy.
Proof
Given: Nested cone carriers with specified contractions, and augmentation-preserving carried chain maps .
Set . For an oriented vertex , has augmentation . It lies in its carrier, so satisfies , using . Changing the sign of the generator changes by the same sign.
Suppose is defined through degree with there. For an oriented -simplex put . The nesting of the carriers puts all summands in . Since commute with boundary, . Here is part of the given chain complexes.
Define . The contraction identity gives , so . The formula is alternating in the original oriented representative: the boundary and are alternating, the already defined is linear, and depends only on the underlying face. It therefore defines a homomorphism without choosing orientations on all simplices. Induction defines all degrees, carried by , with the asserted identity; in degree both maps are the identity on , so their difference is zero. This is a chain homotopy by definition.
Oriented simplicial subdivision operator
Definition
On oriented integral chains define the graded subdivision operator by sending an oriented simplex to the sum of its top-dimensional chain simplices with the orientation inherited through the barycentric realization. The triangulation in Barycentric face chains triangulate a geometric simplex makes these pieces nondegenerate. The source and target groups use Simplicial chain groups and the boundary operator, and target vertices are faces as in Barycentric subdivision of an abstract simplicial complex.
Equivalently, using Augmentation and reduced simplicial homology, augment with , , set , and recursively set where is the underlying face of . Every face label occurring in is a proper face of , so coning is defined. The boundary of a geometric oriented cone with its apex first induces the given orientation on its opposite face: this follows from the positive coefficient of that face in the alternating boundary. Coning the oriented boundary triangulation therefore gives precisely the inherited orientations of the pieces. Reversing the original orientation changes every summand's sign, so this defines the graded operator on oriented chains. In degree zero . Boundary compatibility is a separate result; no chain-map property is assumed here.
Source locators
2.1, pp.121–122, recursive subdivision.
Oriented simplicial subdivision commutes with boundary
Statement
The oriented subdivision operator on integral augmented chains satisfies . Restriction to ordinary chains is also a chain map.
Source locators
2.1, pp.121–122.
Facts & Assumptions
Subdivision is given by the augmented cone recursion. Oriented simplicial subdivision operator.
The cone on the maximal face satisfies the contraction identity. An augmented simplicial cone has an explicit chain contraction.
The simplicial boundary squares to zero. The simplicial boundary squares to zero.
Proof
Given: The augmented recursion and .
For a vertex , . The degree equation is zero on each side. On an edge , the formula is , abbreviating singleton face labels by their vertices and by . Its boundary is .
Assume boundary compatibility through degree . In the cone the contraction identity gives . For the augmented boundary square at a one-simplex, ; in higher degrees use the boundary-square theorem. Induction proves the identity in every degree. Geometrically the cone terms on boundary-of-boundary faces cancel, exactly accounting for internal faces. Setting the degree-zero ordinary boundary to zero preserves the identity on ordinary chains.
Last vertex map is carried by original simplices
Statement
Given a specified total order on , the last-vertex map sends each nonempty face to its greatest vertex. It is simplicial; every simplex over an original face maps into . Its induced oriented chain map is augmentation-preserving.
Source locators
2.5.13, p.52, vertex-selection approximation.
Facts & Assumptions
Subdivision simplices are nested chains of nonempty faces. Barycentric subdivision of an abstract simplicial complex.
A vertex function is simplicial when it takes faces to faces. A simplicial map and its geometric realization.
Simplicial maps induce chain maps. Induced simplicial chain maps commute with boundaries.
Proof
Given: A simplicial complex whose vertices have a specified total order.
Each nonempty face is finite, so it has a unique greatest vertex. If is a chain, every lies in . Their set is therefore a face of , proving simpliciality. If the entire chain lies over a face , all these vertices belong to , proving the carrier assertion. Repeated selected vertices are permitted for a simplicial map.
The induced chain map sends an oriented chain to its ordered list of selected vertices if distinct, and to zero otherwise. It commutes with the ordinary boundary by the induced-chain-map lemma. In degree zero each vertex is sent to a vertex, so both augmentations equal ; extending by the identity in degree gives an augmented chain map. The empty complex gives the empty vertex map and identity only in degree . No existence of a total order on an arbitrary set is inferred: the order is supplied data.
Simplicial subdivision is a chain map and homology isomorphism
Statement
For an abstract simplicial complex with a specified total order on its vertices, is a chain-homotopy equivalence of ordinary and augmented integral simplicial chains, with inverse up to chain homotopy . It induces isomorphisms on ordinary and augmented reduced homology, including degree . The inverse homology map is independent of the chosen order.
Source locators
4.3.9 and subdivision discussion following 4.3.10, pp.119–120.
Facts & Assumptions
Subdivision commutes with augmented and ordinary boundaries. Oriented simplicial subdivision commutes with boundary.
The last-vertex map is carried and augmentation-preserving. Last vertex map is carried by original simplices.
Nested specified cone carriers give a carried chain homotopy. Simplicial chain maps carried by specified cones are chain homotopic.
Chain homotopy gives equality on homology. Chain-homotopic maps induce the same map on homology.
Proof
Given: A complex with a given vertex order, its subdivision operator , and its last-vertex chain map .
Both and commute with boundary and augmentation. For a nonempty original face , carry and by the full simplex on , a cone with apex its greatest vertex. Indeed stays over and lands in . These carriers are nested under faces. The specified cone contractions and the carried-homotopy lemma give .
For a face chain carry and by , a cone with apex . The identity lies there; either vanishes or is a face of , whose subdivision lies there as well. Removing any chain vertex leaves the same or a smaller maximum, so the carriers are nested. The carried-homotopy lemma gives . Its homotopies have , so restriction also gives ordinary chain homotopies.
Chain-homotopic maps induce equal homology maps, hence and . These equations hold in every augmented degree and every ordinary degree. If has no vertices, both augmented degree groups are and both maps are the identity. Any other vertex order produces another two-sided inverse to the same ; then , proving independence.
Mesh of iterated simplicial barycentric subdivision tends to zero
Statement
For a finite Euclidean simplicial complex define its simplex mesh to be the maximum diameter of its nonempty simplices, with the separate convention if there are none. If , then Every nonempty vertex star has diameter at most . Zero-dimensional and vertex-free complexes have mesh zero. The metric is the original Euclidean metric transported through barycentric realization, not a new unit-edge metric at each subdivision.
Source locators
2.1, p.120 (complete mesh argument); Maunder 2.5.15 p.53.
Facts & Assumptions
Diameter is the supremum of distances for nonempty bounded sets. Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space.
Subdivided simplices have vertices in nested barycentric face chains. Barycentric face chains triangulate a geometric simplex.
Finite weak and Euclidean topologies agree. Finite simplicial weak topology agrees with euclidean topology.
Proof
Given: A finite complex linearly realized in Euclidean space, with its inherited distance.
For points and in a simplex, , since all weights are nonnegative and sum to . The maximum is attained by vertices, so it equals the diameter. A point has diameter zero; the definition of mesh assigns zero to a vertex-free complex without taking a diameter of the empty set.
For nonempty nested faces , . Thus . Vertices of every subdivided simplex form such a chain, so the previous diameter calculation bounds its diameter by this factor. Iteration gives the asserted estimate. Since , its powers tend to zero. Zero-dimensional simplices remain points.
For any in the open or closed vertex star of , some simplex contains both and , so . For two points in that star, the triangle inequality gives , and taking the supremum proves the star bound. Finite weak realization topology agrees with the Euclidean topology, so these estimates use a compatible metric.
The open star criterion produces a simplicial map
Statement
Let be finite, arbitrary, continuous, and assign a vertex of to every vertex of such that . Then extends to a simplicial map. For each , and lie in the carrier simplex of (the face given by its positive support). The straight-line homotopy between them is continuous and fixes every point where they agree. It respects every subcomplex pair for which . These conclusions require no choice axiom.
Source locators
2C.1 and 2C.2 proofs, pp.178–179; Appendix A.1, p.520, closed-discrete argument. The finite-source rational-grid/least-index choice-free refinement is proved locally, not attributed to Hatcher..
Facts & Assumptions
The finite source is compact. A finite simplicial complex has a compact Hausdorff realization.
Finite realizations are Euclidean and finite subcomplexes embed with that topology. Finite simplicial weak topology agrees with euclidean topology.
Closed subsets of compact spaces are compact. A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact.
Open stars are positivity loci. Open and closed stars in a subdivision.
The image of each face must be a face and realization sums vertex coordinates. A simplicial map and its geometric realization.
A relative homotopy is jointly continuous and fixed on the specified subspace. Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints.
Proof
Given: A finite source , continuous , and a vertex assignment satisfying the star inclusions.
If is vertex-free all assertions concern empty maps. Otherwise enumerate its finitely many vertices. For each positive denominator enumerate, lexicographically, all barycentric rational grid points on every face, allowing repetitions, to obtain a sequence . On a face with vertices, round the first coordinates down to multiples of and give the last coordinate the remaining mass; every coordinate error is at most . These points approximate every point of each simplex. Hence the sequence is dense in the finite Euclidean realization, and therefore in the weak realization. The image is compact: pull an open cover back to compact and take a finite subcover.
Suppose the union of the finite supports of were infinite. Recursively select the least index whose image support is not contained in the finite union of previously selected supports, and call the resulting images . Each new point introduces a fresh target vertex. In a fixed closed simplex , at most of the points can occur, since each such occurrence introduces a fresh vertex of . Every subset of thus has finite closed trace on each target simplex and is weakly closed. Therefore is closed in compact , and every subset is closed in , making discrete. Its singleton cover contradicts compactness. All repeated choices here are least natural indices, not applications of Countable Choice.
The union of those supports is therefore finite. Let contain all faces of whose vertices lie in . This is finite and weakly closed: its intersection with any simplex is a finite union of closed faces. The closed set contains the dense sequence, so equals . By the closed-embedding assertion, regarded as a map into is continuous for its Euclidean topology.
For any nonempty source face , its barycenter lies in the star of every vertex of . Its image therefore has every , , in its support. That support is a face of , so its subset is a face. This proves simpliciality. For an arbitrary point the same reasoning applies to each positive-coordinate vertex of : every corresponding belongs to . Consequently lies in that very simplex. In particular the image of lies in .
The realization is affine on each of finitely many closed source simplices; these maps agree on their common faces, so it is continuous into finite Euclidean . Hence is jointly continuous into its ambient Euclidean space. The common-carrier conclusion puts its image in , so it is continuous into and then . At it equals , and if it is constant in . If and , its carrier is a simplex of , so the entire segment remains in .
Remarks
The star condition also composes: if approximates and approximates , then . Thus the simplicial composite approximates (Maunder 2.5.5, p.47). The finite-image proof above replaces any appeal to the separate compact-subset lemma with Countable Choice.
Finite simplicial approximation for maps of pairs
Statement
Let be finite, and subcomplexes, and continuous. For all sufficiently large integers , there is a simplicial approximation , homotopic as a map of pairs to . Here is the composite barycentric homeomorphism. No pointwise fixing of a positive-dimensional restriction is asserted.
Source locators
2C.1 pp.177–179; Maunder 2.5.4 p.47.
Facts & Assumptions
Barycentric realization is a homeomorphism compatible with subcomplexes. Barycentric subdivision realizes homeomorphically.
Finite subdivisions have a compatible metric and their star diameters tend to zero. Mesh of iterated simplicial barycentric subdivision tends to zero.
A compact metric open cover has a positive Lebesgue number. Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover.
Star inclusions produce a simplicial map and a common-carrier homotopy. The open star criterion produces a simplicial map.
Proof
Given: A continuous map of the indicated pairs with finite source.
Use the barycentric homeomorphisms to view every subdivision as a triangulation of the same finite Euclidean polyhedron. The inverse images cover it, since the support of every image point is nonempty. They are open, and the source is compact metric. The Lebesgue-number lemma gives such that any nonempty set of diameter less than lies in one of these inverse images. For an empty source use the empty map for every .
Choose with for every , using the mesh estimate; in dimension zero already. Each vertex star in that triangulation is nonempty and has diameter at most . Hence for each of the finitely many vertices select with . This is only finite choice. The star criterion gives a simplicial map and a continuous common-carrier straight-line homotopy.
If is a face of , its barycenter lies in , so the support of its image under is a face of . The star criterion puts all for in this support; hence . At every point of the same carrier argument keeps the homotopy inside . Pulling back to the abstract subdivided realization gives the stated homotopy of pairs to , for every .
Remarks
Approximations need not be unique. On one edge, the constant map with value its midpoint has both constant endpoint maps as star approximations, since the midpoint belongs to both target vertex stars. Some maps admit none before subdivision: the continuous edge self-map sends the open star of onto , which lies in neither target vertex star. This is the failure tested by Maunder 2.5.6, pp.47–48; it is stronger than failure of exact simpliciality.
Relative derived subdivision of a finite simplicial pair
Definition
For a finite Euclidean simplicial pair , define the relative derived subdivision by keeping unchanged and processing the other simplices by increasing dimension: triangulate their boundaries using the already processed faces, then cone that boundary from the simplex barycenter. A vertex outside stays its own barycenter. Include all faces. Write , , also denoted .
The coning triangulates a simplex because every ray from its interior barycenter meets its boundary in a unique point: in barycentric coordinates the ray stops when the first decreasing coordinate reaches zero. Cones over boundary simplices intersect in cones over their intersections; the apex is not in the affine hull of a proper face, so the new simplices are affinely independent. This is the radial version of Barycentric face chains triangulate a geometric simplex. Since adjacent original simplices have the same already triangulated common face, the construction is compatible and preserves the underlying polyhedron. It restricts to on each subcomplex . If has no vertices, the result is the ordinary barycentric subdivision of Barycentric subdivision of an abstract simplicial complex; if , it is itself.
The simplex description is a face (possibly empty), followed by barycenters of a strict chain of faces outside that strictly contain . Repeated coning proves both directions of this description: adjoining an outer barycenter extends the face chain, and every chain is built by successively coning its shorter initial chain.
Remarks
In Maunder 2.5.9 (pp.50–51), take the three triangles with all faces and fix the full triangle . It remains one triangle. Triangle has its edge fixed and edges bisected, so coning its subdivided boundary gives triangles. Triangle has all three edges bisected, giving triangles. Thus the relative subdivision has exactly triangles, as in the source example. The common edge has the same midpoint on both sides.
Source locators
2.5.7–2.5.8 pp.49–50.
Relative derived subdivision makes the fixed subcomplex full
Statement
For finite , is full in for every : the vertices of any simplex that lie in span a face of , and its geometric intersection with is exactly that face (possibly empty).
Source locators
2.5.10–2.5.12 pp.51–52.
Facts & Assumptions
Relative derived simplices have a fixed-face plus outside-face-chain form. Relative derived subdivision of a finite simplicial pair.
Proof
Given: A finite pair and at least one relative derived subdivision.
A simplex of consists of a face of and barycenters of nested faces outside , strictly containing . The only vertices in are those of : a barycenter of has support , so cannot lie in the subcomplex . Thus the vertices in span precisely .
For a point in that simplex with a positive coefficient at some , take the largest such face . All its vertex coordinates in the original simplex become positive, with no cancellation, so the original support contains . Such a point cannot belong to , since that would put its support and every subface, including , in . Conversely every point using only vertices of lies in . Therefore the intersection is exactly . The same argument applies with replaced by each . If is empty intersections are empty; if , every simplex is already in .
Relative subdivision neighbourhood adjustment
Statement
Let be a finite simplicial pair, . There is a finite linear subdivision between and and a piecewise affine homotopic to the identity rel , sending an open neighbourhood of into . More precisely, let be the subcomplex of consisting of simplices with no vertex in . Then:
- for every and every vertex of outside , there is a vertex with ; if take ;
- the maximum of the diameters of the stars of vertices of lying in tends to zero.
The homotopy from the identity to stays in each original simplex. The maximum of an empty family of star diameters here is assigned zero.
Source locators
2.5.18–2.5.20 pp.54–56; Zeeman theorem proof pp.40–42.
Facts & Assumptions
The relative subdivision is full on the A vertices. Relative derived subdivision makes the fixed subcomplex full.
The finite source permits continuous affine common-carrier interpolation. The open star criterion produces a simplicial map.
Ordinary iterated mesh tends to zero and stars are bounded by twice mesh. Mesh of iterated simplicial barycentric subdivision tends to zero.
Proof
Given: A finite pair, geometrically identify all relative subdivisions with , and put .
By fullness, in the fixed complex is induced on its vertices. Let be the induced subcomplex on the other vertices. They are disjoint. Form : it subdivides just the mixed simplices of . Its new vertices are barycenters of mixed faces. The face is nonempty by mixedness and is a face by fullness; choose one of its vertices . Define to fix the vertices of and send to . All choices are finite.
For a simplex of , its base face belongs to and its additional vertices are barycenters of a nested chain of mixed faces of . Every image vertex lies in the largest face of this chain, or in the base face if the chain is empty. Hence the images span a simplex of , so extends simplicially from to . Moreover each belongs to the positive support of : this is immediate for a fixed old vertex, and a mixed barycenter is positive at every vertex of its face. If , its positive coefficient at therefore makes its coordinate positive in . Thus , which verifies the star hypothesis for the identity map and the vertex assignment . For any point in such a simplex, and lie in the same original simplex. Thus remains there. Finite simplexwise affine formulas agree on faces, so and are continuous in finite Euclidean realization, and , with .
If a simplex of contains a vertex , its base face is in , and every other vertex is a mixed-face barycenter mapped to . Its image simplex lies in , since is full in . Moreover a positive coefficient of remains positive at in the image. Therefore . The union of these open stars is an open neighbourhood of mapped into .
The full relative subdivision refines : it additionally subdivides and uses the same barycenters on the mixed faces, coning their refined boundaries. It retains the vertices of and their positive barycentric coordinates, so . If is a vertex of any further outside , its minimal carrier face in has an -vertex with positive coordinate at . Every point of has positive coefficient at in some refined simplex; the coordinate of , affine and nonnegative on that simplex, is then positive. Thus this star is contained in and its -image in . For its carrier is the vertex itself.
Let be the induced subcomplex of on vertices outside . No simplex of containing an -vertex can meet : its relative face-chain description has an base face and all outside barycenters lie on faces containing that base. Every point of such a simplex has a positive coordinate at some vertex of that base in , whereas points of have all those coordinates zero. Consequently every simplex meeting is in . For and a vertex , every simplex containing lies in a simplex meeting , hence in . Since is disjoint from , its further relative subdivisions are ordinary barycentric subdivisions. Each such star has diameter at most , which tends to zero by the mesh estimate.
If is vertex-free then , and ; the neighbourhood can be empty and the mesh estimate handles all stars. If , then , , and is vertex-free, so only the near clause occurs. These constructions also cover a vertex-free , with empty maps.
Relative simplicial approximation after subdivision
Statement
Let be finite complexes, a subcomplex, and continuous with the realization of a simplicial map. For some there is a simplicial agreeing pointwise with on and homotopic to rel . This is a homotopy of pairs into .
A prescribed compatible finite linear subdivision of can first be extended to a finite linear subdivision of . If is simplicial on this prescribed , the conclusion applies to , fixing it pointwise. The simpliciality condition must hold on the chosen triangulation; refining a source alone does not automatically retain it.
Source locators
Theorem and proof, pp.39–42; Maunder 2.5.20 pp.55–56.
Facts & Assumptions
Adjustment provides the near-A star condition and shrinking far stars. Relative subdivision neighbourhood adjustment.
Every compact metric open cover has a Lebesgue number. Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover.
The finite realization is compact metric with its Euclidean topology. Finite simplicial weak topology agrees with euclidean topology.
Star approximation gives a homotopy fixed wherever the maps agree. The open star criterion produces a simplicial map.
Compatible boundary coning extends finite triangulations. Relative derived subdivision of a finite simplicial pair.
Proof
Given: Finite , subcomplex , and continuous and simplicial on .
Take and from the neighbourhood-adjustment lemma. Compose its homotopy with to obtain a homotopy from to , fixed on . The inverse images under of the target vertex stars form an open cover of compact metric , so there is a Lebesgue number . For empty the empty map already proves the theorem.
Choose so that every star of a vertex in has diameter less than . For each such vertex the Lebesgue-number property gives a target vertex whose open star contains . For any remaining vertex , the adjustment lemma gives with . Since is simplicial, a point having positive coordinate has positive coordinate in its image, so ; take . On take , hence . These are finitely many choices.
All vertex stars now satisfy the criterion for , so extends simplicially and the criterion supplies . On , the simplicial maps and agree on vertices and therefore on all affine combinations; also is the identity there. Thus fixes . Concatenate for with for . At the join both equal , so this is a continuous homotopy from to , fixed on . Its restriction there always lies in the simplicial image , proving the pair assertion.
To extend a prescribed compatible , process simplices of outside by increasing dimension. Their boundary triangulations are already fixed and compatible. Cone each such boundary from an interior barycenter of its original simplex. Every ray meets the boundary once, so these cones triangulate the simplex and restrict to the already specified boundaries. This finite induction constructs restricting exactly to . If is simplicial there, apply the preceding argument to . When is empty it is ordinary approximation; when and is already simplicial take .
Remarks
The result approximates , not necessarily in the strict carrier sense. Zeeman, pp.40–43, explains the distinction: near a fixed edge the star cover need not become subordinate to the pullback cover for , even after relative subdivision. His p.43 circular-arc example rules out requiring the final map to stay in the carrier of at every point while fixing that edge. The two successive homotopies above impose no such additional claim. The prescribed-subdivision clause is conditional on simpliciality in that triangulation, not on the original one alone.
Finite convex cell complex and linear subdivision
Definition
A compact convex polyhedral cell is a nonempty bounded set in a finite-dimensional Euclidean affine subspace given by finitely many affine inequalities . It is closed, hence compact by Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line in positive ambient dimension; in dimension zero it is a singleton. A face is the empty set, the cell itself, or its intersection with a supporting hyperplane where on the cell. Equivalently, every nonempty face arises by turning some of the defining inequalities into equalities; this equivalence is proved in the face calculus below.
A finite convex cell complex is a finite family of such cells and the empty cell, containing every face of each cell, such that the intersection of any two cells is a face of each. Its underlying set is the union of its cells. A finite linear simplicial complex is one whose cells are geometric simplices. Its topology is the Euclidean subspace topology; for a finite abstract complex it agrees by Finite simplicial weak topology agrees with euclidean topology with its realization topology from The geometric realization of an abstract simplicial complex.
A linear subdivision of a finite convex cell complex is a finite linear simplicial complex with the same underlying set and with every new simplex contained in an old cell. A subdivision on a subcomplex is compatible if it is precisely the restriction of the new triangulation. Zero-dimensional cells are singletons, whose only proper face is empty. The empty complex here means the family consisting only of the empty cell. These are convex polyhedral cells, not general CW cells.
Source locators
Chapter 2, Cells and Cell Complexes, pp.13–15.
Intersections of finite linear complexes form a convex cell complex
Statement
Let be finite linear simplicial complexes in one Euclidean space, with the same underlying polyhedron. Their cells , together with all their faces and the empty cell, form a finite convex cell complex refining both. Each nonempty cell has finitely many faces and a relative interior point, and its proper faces cover its relative boundary.
The face and interior assertions also hold for every nonempty bounded finite-inequality cell in the definition.
Source locators
2.6–2.8(5), pp.13–15; Appendix to Chapter 2 pp.27–30.
Facts & Assumptions
Cells are bounded finite-inequality sets; supporting equality defines a face. Finite convex cell complex and linear subdivision.
Proof
Given: Two finite geometric simplicial complexes, and finite systems of affine inequalities for their simplices.
A simplex in its affine hull is defined by its barycentric coordinates . Intersecting two simplices combines these finitely many inequalities in the intersection of their affine hulls. A nonempty intersection is closed and bounded, hence is a cell. More generally consider any nonempty such finite-inequality cell . Discard inequalities identically zero on . For each remaining inequality choose a witness where it is positive. Their average is in and makes every remaining inequality positive, since all other terms are nonnegative. Finitely many strict inequalities give a relative open ball about this average in . If no inequalities remain, boundedness forces to be a singleton, and its sole point is relatively interior.
For , put and . This is an exposed face, using the supporting function ; an empty index set gives . Its remaining inequalities are strict at , so is relatively interior in . If is any exposed face containing , then for a small extension still lies in : active inequalities stay zero and all others stay nonnegative for small positive . Since lies strictly between and , a supporting function nonnegative on and zero at must vanish at both endpoints. Hence and .
Conversely, choose relatively interior to any nonempty exposed face , using the finite-inequality argument with its added supporting equality. For any , extend slightly past away from inside . Every original inequality active at must vanish at , by the same nonnegative weighted-sum argument. Thus , and the reverse inclusion was just proved. Consequently every face is obtained from an active subset of the finite inequalities, so there are finitely many faces. Intersections of faces are faces by adding their active equalities, and a face of a face is a face of by adding more equalities. A point is in the relative boundary exactly when at least one inequality not identically zero on is active: otherwise a relative ball lies in ; if one is active its nonconstant affine function has negative values arbitrarily nearby in . Thus proper faces cover exactly the relative boundary.
Let and . In each original simplicial complex the intersections and are common faces. They are cut out by supporting affine equalities nonnegative on and , respectively. Restricting these equalities to shows is a face of ; reversing the roles proves it is a face of . Now take arbitrary faces of and of . First restrict to the common face ; intersections and transitivity of faces from the preceding step show is a face of and . Including all faces therefore gives a finite complex. Every such cell is contained in its original and , and each point of the common polyhedron lies in at least one such intersection, proving refinement and equality of underlying sets.
Finite convex cell complexes admit compatible triangulations
Statement
Every finite convex cell complex has a compatible finite simplicial triangulation. Choose one relative interior point in each nonempty cell; triangulate the boundary in increasing dimension and cone from that point. This construction agrees on every common face and preserves each cell as a subpolyhedron.
Source locators
2.7(6), 2.9, pp.14–16; Appendix pp.29–30.
Facts & Assumptions
Finite-inequality cells have relative interiors and proper-face boundary decompositions. Intersections of finite linear complexes form a convex cell complex.
Proof
Given: A finite convex cell complex and one relative interior point in each nonempty cell.
Every nonempty cell has relative interior by the finite-inequality face calculus, so the finitely many choices exist. A zero-cell is already a single vertex. Suppose all cells of dimension less than have compatible triangulations. The proper faces of an -cell are lower-dimensional and cover its boundary; their triangulations agree on common faces by the induction hypothesis. Hence together they triangulate .
For the ray meets in a closed bounded parameter interval with . Convexity makes it an interval; compactness makes its endpoint belong to . Its last point lies on the boundary, since an interior endpoint could be extended. Every point with is relatively interior: a small ball at contracted toward the endpoint gives a ball at that point. Thus is the unique boundary point of the ray, and . It follows that the cones from over the triangulated boundary cover .
Every boundary simplex is contained in a proper face supported by a hyperplane not containing . Its vertices together with are affinely independent. For two boundary simplices, a non-apex point in the intersection of their cones has the unique ray endpoint just proved, lying in both boundary simplices. Therefore the cones intersect in the cone on their common face, or only at the apex if that face is empty. Their intersections with the old boundary are precisely their base simplices. For adjacent cells, the intersection is a common boundary face already triangulated identically, so the extensions agree. Induction over the finitely many dimensions gives the claimed finite triangulation; the vertex-free complex requires no choices or cones.
Two finite linear subdivisions have a common simplicial refinement
Statement
Two finite linear simplicial subdivisions of a fixed finite Euclidean simplicial complex have a common finite linear simplicial refinement. This asserts refinement of triangulations of the same embedded polyhedron, not of arbitrary abstractly homeomorphic triangulations.
Source locators
2.8(5), 2.9 and 2.12, pp.15–16.
Facts & Assumptions
Intersection cells form a finite complex refining both triangulations. Intersections of finite linear complexes form a convex cell complex.
A finite cell complex has a compatible simplicial triangulation. Finite convex cell complexes admit compatible triangulations.
Proof
Given: Two finite linear subdivisions with the same embedded underlying set.
Form the finite convex cell complex of all intersections , , , and their faces. It covers the common polyhedron and every cell is contained in a simplex of each triangulation.
Choose a compatible simplicial triangulation of that finite cell complex. Each simplex of lies in an intersection cell, hence in one simplex of and one of , and is their common underlying set. These are exactly the conditions for a common linear refinement. If the set is empty take the empty complex; for points and lower-dimensional intersections the same cell triangulation applies. Only finitely many interior-point choices are required.
5 · Examples, counterexamples and false statements
None yet.