Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Face poset and order complex

Definition

For an abstract simplicial complex K, its face poset is F(K)=K{} ordered by inclusion. For a poset (P,), its order complex ΔP has vertex set P and faces all finite chains in P, 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 P=, then ΔP={} has no vertices. If P has a least element p, every face can be enlarged by p; 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Barycentric subdivision of an abstract simplicial complex

Definition

The barycentric subdivision of K is sdK=ΔF(K), using Face poset and order complex. Thus its vertices are the nonempty faces σ of K, and its nonempty simplices are strict chains σ0σq.

A subcomplex AK gives F(A)F(K) with the induced order; hence every chain in F(A) is a chain in F(K) and sdA is a subcomplex. The vertex associated to {v} is distinct as a label from v, 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Canonical barycentric realization map

Definition

Write ev for the coordinate vertex of K. For each nonempty face σ put bσ=1#σvσev. The canonical barycentric realization map is bK:sdKK,bK(i=0qtieσi)=i=0qtibσi. Here ti0, iti=1 and σ0σq, as in Barycentric subdivision of an abstract simplicial complex. Each coordinate is nonnegative, the total is 1, and the support lies in σq, 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 K; the weak topology of the source makes bK continuous. For a vertex-free complex it is the unique empty map.

Source locators

2.5.7–2.5.10, pp.49–52.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Finite simplicial weak topology agrees with euclidean topology

Statement

For finite K, the weak topology on K equals the Euclidean subspace topology in RV(K); K is compact, metrizable and Hausdorff. If P is a finite subcomplex of any K, then PK is a closed embedding, with that same finite Euclidean topology.

Source locators

2C.1 proof, p.178; direct closed-cover verification.

Proof

Given: A simplicial complex K and, for the last assertion, a finite subcomplex P.

1.1

In a finite nonempty vertex set, each simplex is defined by nonnegative coordinates, sum 1, and zero coordinates outside its face. It is closed and bounded in the ambient finite-dimensional Euclidean space, hence compact. The finite union K is also closed and bounded, hence compact by Heine–Borel. If K has no vertices its realization is empty and compact directly.

F1F2
2.1

If EK is weakly closed, then Eσ is closed in the Euclidean simplex, and thus closed in the ambient Euclidean space since σ is closed. Their finite union is E, so E is Euclidean closed. Conversely, a Euclidean relatively closed E has closed traces on every simplex and is weakly closed. Consequently both topologies agree, and the Euclidean metric and Hausdorff property restrict to K.

F1step 1.1
3.1

For finite PK and closed EP, write E=σP(Eσ). For any τK, each summand meets τ in a closed subset of the common face στ, hence in a closed subset of τ. There are finitely many summands, so E is weakly closed in K. Conversely an ambient weakly closed set has closed traces on the simplices of P. These two implications show that the inclusion induces exactly the topology of P and is closed; taking E=P proves the closed-image assertion.

F1step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

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

[F1]

Barycenters have equal coordinates on their face. Canonical barycentric realization map.

[F2]

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.

1.1

Let a point have distinct positive coordinate levels a1>>am>0, put am+1=0, and set Fj={v:xvaj}. These are nested nonempty faces. With wj=#Fj(ajaj+1)>0, a vertex whose coordinate is a has coordinate j=mwj/#Fj=a in jwjbFj. Also jwj=vxv=1. Thus every point lies in a chain simplex.

F1F2
1.2

For any strict chain G1Gs, the vectors bGj are linearly independent in barycentric coordinate space: in cjbGj=0, a coordinate in GsGs1 gives cs/#Gs=0, and descending induction gives every cj=0 (finish with any vertex of G1). Hence they are affinely independent in the original simplex too, by uniqueness of its affine coordinates.

F1F2
2.1

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 Fj in the first step and the weights are exactly wj. 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 1.

step 1.1step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Barycentric subdivision realizes homeomorphically

Statement

For any abstract simplicial complex K with weak realization topology, bK:sdKK is a homeomorphism. Its restriction over every subcomplex A is bA, under the natural inclusions.

Source locators

2.5.8, pp.49–50; weak-topology extension proved locally.

Facts & Assumptions

[F1]

Face chains triangulate each finite simplex with unique positive-weight representations. Barycentric face chains triangulate a geometric simplex.

[F2]

Continuity out of the weak realization can be tested simplexwise. The geometric realization of an abstract simplicial complex.

Proof

Given: An arbitrary simplicial complex K, without a local-finiteness assumption.

1.1

For every original finite simplex σ, its chain triangulation gives a bijection sdσσ. The inverse formulas agree on common faces because the positive coordinate level sets depend only on the point. Every point of K has a finite support face, so these inverses define a single global inverse to bK. This also proves bK1(A)=sdA.

F1F2
2.1

On each subdivided simplex bK is affine into its maximal original simplex and is continuous. The weak topology on sdK 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.

F1F2step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Open and closed stars in a subdivision

Definition

For a vertex v of a complex T define its open star by stT(v)={xT:xv>0}. Define its closed star to be the subcomplex StT(v)={τT:τ{v}T}. These definitions apply separately to T=K and T=sdK from Barycentric subdivision of an abstract simplicial complex; in the latter, vertices are nonempty original faces. Coordinates always refer to T as in The geometric realization of an abstract simplicial complex.

On each simplex the condition xv>0 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 xτ and τ{v}T, then (1t)x+tev for 0<t1 is in the open star and converges to x in that finite simplex. Hence the realization of the closed star is exactly the closure of the open star. Merely listing simplices containing v would omit faces and would not define a subcomplex.

Source locators

2.C, p.178, star paragraph and Lemma 2C.2.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Compact subsets of an arbitrary simplicial realization meet finitely many open simplices

Statement

Assume the Axiom of Countable Choice. For any simplicial complex K with weak topology, every compact CK 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

[F1]

Countable independent families of nonempty sets admit a choice function. The Axiom of Countable Choice (ACω).

[F2]

Support faces are finite and weak closedness is tested on simplices. The geometric realization of an abstract simplicial complex.

[F3]

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 K, and compact CK.

1.1

If the set J of open simplices meeting C were infinite, for each positive integer n let Xn be the nonempty set of ordered n-tuples of points of C with distinct support faces. Countable Choice selects one tuple for each n. 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 n supplies n different faces. This gives a sequence qj in distinct open simplices, using only the stated countable independent choices and least-index deletions.

F1F2
2.1

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 qj. Every subset of Q={qj:j1} consequently has finite closed trace on every simplex and is weakly closed in K. Thus Q is closed in C and its subspace topology is discrete. Closedness in compact C makes Q compact, whereas its singleton open cover has no finite subcover. This contradiction proves J finite.

F2F3step 1.1
3.1

Include all faces of the finitely many simplices in J to obtain a finite subcomplex containing C; if C 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.

F3step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

An augmented simplicial cone has an explicit chain contraction

Statement

A simplicial cone with specified apex a means that σ{a}K for every σK. On its augmented integral chain complex, put h1(1)=[a] and hn[v0,,vn]=[a,v0,,vn](n0), interpreting a repeated vertex as zero. Then h+h=1 in every degree, including 1, 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

[F1]

Oriented relations and alternating boundaries govern the computation. Simplicial chain groups and the boundary operator.

[F2]

The degree-zero boundary on augmented chains sends every vertex to 1. Augmentation and reduced simplicial homology.

[F3]

A null homotopy of the identity is a contraction. A contractible complex.

Proof

Given: A cone K with apex a; integral oriented chains, augmented by C1=Z and [v]=1.

1.1

Adjoining a stays inside K by the cone hypothesis. Permuting the original vertices changes [a,v0,,vn] by the same sign, so h respects the oriented-chain relations. If a is absent from s=[v0,,vn], expansion gives [a,v0,,vn]=s+i=0n(1)i+1[a,v0,,v^i,,vn]=shs.

F1F2
2.1

If a=vj, then h(s)=0. In hs all terms except deletion of vj repeat a and vanish. The remaining term is (1)j[a,v0,,v^j,,vn]=s, because moving a back to position j contributes another (1)j. In degree zero this says [a,v]+[a]=[v] for va, and 0+[a]=[a] for v=a. In degree 1, h(1)=[a]=1. Thus the identity holds on all generators and hence all chains.

F1F2step 1.1
3.1

The identity 1=h+h 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.

F3step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Simplicial chain maps carried by specified cones are chain homotopic

Statement

Assign to each nonempty simplex σ of K a cone subcomplex Φ(σ)L with a specified augmented contraction cσ. Suppose Φ(τ)Φ(σ) whenever τσ. If augmentation-preserving chain maps f,g:C(K)C(L) are carried by Φ (their values on σ are supported in Φ(σ)), then a carried chain homotopy h satisfies fg=h+h, with h1=0.

Source locators

4.3.9 proof, p.119, carried induction; specialized cone version.

Facts & Assumptions

[F1]

A specified cone contraction fills each augmented cycle. An augmented simplicial cone has an explicit chain contraction.

[F2]

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 f,g.

1.1

Set h1=0. For an oriented vertex s, z=f(s)g(s) has augmentation 11=0. It lies in its carrier, so h0(s)=csz satisfies h0(s)=z, using cs+cs=1. Changing the sign of the generator changes h0 by the same sign.

F1
2.1

Suppose h is defined through degree n1 with h+h=fg there. For an oriented n-simplex s put z=f(s)g(s)h(s). The nesting of the carriers puts all summands in Cn(Φ(s)). Since f,g commute with boundary, z=(fg)(s)h(s)=h2s=0. Here 2=0 is part of the given chain complexes.

step 1.1given
3.1

Define hn(s)=csz. The contraction identity gives hn(s)=zcsz=z, so hn(s)+hn1(s)=f(s)g(s). The formula is alternating in the original oriented representative: the boundary and f,g are alternating, the already defined h is linear, and cs 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 1 both maps are the identity on Z, so their difference is zero. This is a chain homotopy by definition.

F1F2step 2.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Oriented simplicial subdivision operator

Definition

On oriented integral chains define the graded subdivision operator S:Cn(K)Cn(sdK) 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 C1=Z, [v]=1, set S1=1, and recursively set S(s)=cσS(s),cσ[t0,,tj]=[σ,t0,,tj],cσ(1)=[σ], where σ is the underlying face of s. Every face label occurring in S(s) 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 S[v]=[{v}]. Boundary compatibility is a separate result; no chain-map property is assumed here.

Source locators

2.1, pp.121–122, recursive subdivision.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Oriented simplicial subdivision commutes with boundary

Statement

The oriented subdivision operator on integral augmented chains satisfies S=S. Restriction to ordinary chains is also a chain map.

Source locators

2.1, pp.121–122.

Facts & Assumptions

[F1]

Subdivision is given by the augmented cone recursion. Oriented simplicial subdivision operator.

[F2]

The cone on the maximal face satisfies the contraction identity. An augmented simplicial cone has an explicit chain contraction.

[F3]

The simplicial boundary squares to zero. The simplicial boundary squares to zero.

Proof

Given: The augmented recursion S(s)=cσS(s) and S1=1.

1.1

For a vertex v, S[v]=[{v}]=1=S[v]. The degree 1 equation is zero on each side. On an edge [a,b], the formula is S[a,b]=[ab,b][ab,a]=[a,ab][b,ab], abbreviating singleton face labels by their vertices and {a,b} by ab. Its boundary is [b][a]=S[a,b].

F1
2.1

Assume boundary compatibility through degree n1. In the cone sdσ the contraction identity gives S(s)=cσS(s)=S(s)cσS(s)=S(s)cσS(2s)=S(s). For the augmented boundary square at a one-simplex, ε([b][a])=0; 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.

F1F2F3step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Last vertex map is carried by original simplices

Statement

Given a specified total order on V(K), the last-vertex map λ:sdKK 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

[F1]

Subdivision simplices are nested chains of nonempty faces. Barycentric subdivision of an abstract simplicial complex.

[F2]

A vertex function is simplicial when it takes faces to faces. A simplicial map and its geometric realization.

[F3]

Simplicial maps induce chain maps. Induced simplicial chain maps commute with boundaries.

Proof

Given: A simplicial complex whose vertices have a specified total order.

1.1

Each nonempty face is finite, so it has a unique greatest vertex. If σ0σq is a chain, every maxσi lies in σq. Their set is therefore a face of K, 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.

F1F2
2.1

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 1; extending by the identity in degree 1 gives an augmented chain map. The empty complex gives the empty vertex map and identity only in degree 1. No existence of a total order on an arbitrary set is inferred: the order is supplied data.

F3step 1.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Simplicial subdivision is a chain map and homology isomorphism

Statement

For an abstract simplicial complex with a specified total order on its vertices, S 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 1. 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

[F1]

Subdivision commutes with augmented and ordinary boundaries. Oriented simplicial subdivision commutes with boundary.

[F2]

The last-vertex map is carried and augmentation-preserving. Last vertex map is carried by original simplices.

[F3]

Nested specified cone carriers give a carried chain homotopy. Simplicial chain maps carried by specified cones are chain homotopic.

[F4]

Chain homotopy gives equality on homology. Chain-homotopic maps induce the same map on homology.

Proof

Given: A complex K with a given vertex order, its subdivision operator S, and its last-vertex chain map λ#.

1.1

Both S and λ# commute with boundary and augmentation. For a nonempty original face σ, carry λ#S and 1 by the full simplex on σ, a cone with apex its greatest vertex. Indeed S stays over σ and λ lands in σ. These carriers are nested under faces. The specified cone contractions and the carried-homotopy lemma give λ#S1.

F1F2F3
2.1

For a face chain η=(σ0<<σq) carry Sλ# and 1 by sdσq, a cone with apex σq. The identity lies there; λ#η either vanishes or is a face of σq, 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 Sλ#1. Its homotopies have h1=0, so restriction also gives ordinary chain homotopies.

F2F3step 1.1
3.1

Chain-homotopic maps induce equal homology maps, hence H(λ#)H(S)=1 and H(S)H(λ#)=1. These equations hold in every augmented degree and every ordinary degree. If K has no vertices, both augmented degree 1 groups are Z and both maps are the identity. Any other vertex order produces another two-sided inverse J to the same H(S); then J=JH(S)H(λ#)=H(λ#), proving independence.

F4step 1.1step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Mesh of iterated simplicial barycentric subdivision tends to zero

Statement

For a finite Euclidean simplicial complex K define its simplex mesh m(K) to be the maximum diameter of its nonempty simplices, with the separate convention m(K)=0 if there are none. If dimK=n1, then m(sdrK)(nn+1)rm(K)0. Every nonempty vertex star has diameter at most 2m(K). 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

[F1]
[F2]

Subdivided simplices have vertices in nested barycentric face chains. Barycentric face chains triangulate a geometric simplex.

[F3]

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.

1.1

For points x=iaivi and y=jbjvj in a simplex, xyi,jaibjvivjmaxi,jvivj, since all weights are nonnegative and sum to 1. 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.

F1
2.1

For nonempty nested faces FGσ, bG=(#F/#G)bF+(1#F/#G)bGF. Thus bGbF(1#F/#G)diamσn/(n+1)diamσ. 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 0<n/(n+1)<1, its powers tend to zero. Zero-dimensional simplices remain points.

F2step 1.1
3.1

For any x in the open or closed vertex star of v, some simplex contains both x and v, so xvm(K). For two points x,y in that star, the triangle inequality gives xy2m(K), and taking the supremum proves the star bound. Finite weak realization topology agrees with the Euclidean topology, so these estimates use a compatible metric.

F1F3step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The open star criterion produces a simplicial map

Statement

Let K be finite, L arbitrary, f:KL continuous, and assign a vertex g(v) of L to every vertex v of K such that f(stK(v))stL(g(v)). Then g extends to a simplicial map. For each x, f(x) and g(x) lie in the carrier simplex of f(x) (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 (A,B) for which f(A)B. 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

[F2]

Finite realizations are Euclidean and finite subcomplexes embed with that topology. Finite simplicial weak topology agrees with euclidean topology.

[F4]

Open stars are positivity loci. Open and closed stars in a subdivision.

[F5]

The image of each face must be a face and realization sums vertex coordinates. A simplicial map and its geometric realization.

[F6]

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 K, continuous f, and a vertex assignment satisfying the star inclusions.

1.1

If K 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 dj. On a face with s vertices, round the first s1 coordinates down to multiples of 1/N and give the last coordinate the remaining mass; every coordinate error is at most (s1)/N. 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 C=f(K) is compact: pull an open cover back to compact K and take a finite subcover.

F1F2
2.1

Suppose the union of the finite supports of f(dj) 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 qn. Each new point introduces a fresh target vertex. In a fixed closed simplex τ, at most #τ of the points qn can occur, since each such occurrence introduces a fresh vertex of τ. Every subset of Q={qn} thus has finite closed trace on each target simplex and is weakly closed. Therefore Q is closed in compact C, and every subset is closed in Q, making Q discrete. Its singleton cover contradicts compactness. All repeated choices here are least natural indices, not applications of Countable Choice.

F3step 1.1
3.1

The union W of those supports is therefore finite. Let P contain all faces of L whose vertices lie in W. This is finite and weakly closed: its intersection with any simplex is a finite union of closed faces. The closed set f1(P) contains the dense sequence, so equals K. By the closed-embedding assertion, f regarded as a map into P is continuous for its Euclidean topology.

F2step 1.1step 2.1
4.1

For any nonempty source face σ, its barycenter lies in the star of every vertex of σ. Its image therefore has every g(v), vσ, in its support. That support is a face of L, so its subset g(σ) is a face. This proves simpliciality. For an arbitrary point x the same reasoning applies to each positive-coordinate vertex of x: every corresponding g(v) belongs to suppf(x). Consequently g(x)=vxveg(v) lies in that very simplex. In particular the image of g lies in P.

F4F5step 3.1
5.1

The realization g is affine on each of finitely many closed source simplices; these maps agree on their common faces, so it is continuous into finite Euclidean P. Hence H(x,t)=(1t)f(x)+tg(x) is jointly continuous into its ambient Euclidean space. The common-carrier conclusion puts its image in P, so it is continuous into P and then L. At t=0,1 it equals f,g, and if f(x)=g(x) it is constant in t. If xA and f(x)B, its carrier is a simplex of B, so the entire segment remains in B.

F2F6step 4.1

Remarks

The star condition also composes: if g approximates f and k approximates j, then jf(st(v))j(st(g(v)))st(k(g(v))). Thus the simplicial composite kg approximates jf (Maunder 2.5.5, p.47). The finite-image proof above replaces any appeal to the separate compact-subset lemma with Countable Choice.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Finite simplicial approximation for maps of pairs

Statement

Let K be finite, AK and BL subcomplexes, and f:(K,A)(L,B) continuous. For all sufficiently large integers r, there is a simplicial approximation g:(sdrK,sdrA)(L,B), homotopic as a map of pairs to fbKr. Here bKr 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

[F1]

Barycentric realization is a homeomorphism compatible with subcomplexes. Barycentric subdivision realizes homeomorphically.

[F2]

Finite subdivisions have a compatible metric and their star diameters tend to zero. Mesh of iterated simplicial barycentric subdivision tends to zero.

[F4]

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.

1.1

Use the barycentric homeomorphisms to view every subdivision as a triangulation of the same finite Euclidean polyhedron. The inverse images f1(stL(w)) 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 δ>0 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 r.

F1F2F3F4
2.1

Choose r0 with 2m(sdrK)<δ for every rr0, using the mesh estimate; in dimension zero m=0 already. Each vertex star in that triangulation is nonempty and has diameter at most 2m. Hence for each of the finitely many vertices v select g(v) with f(st(v))st(g(v)). This is only finite choice. The star criterion gives a simplicial map and a continuous common-carrier straight-line homotopy.

F2F3F4step 1.1
3.1

If σ is a face of sdrA, its barycenter lies in A, so the support of its image under f is a face of B. The star criterion puts all g(v) for vσ in this support; hence g(σ)B. At every point of A the same carrier argument keeps the homotopy inside B. Pulling back to the abstract subdivided realization gives the stated homotopy of pairs to fbKr, for every rr0.

F1F4step 2.1

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 f(x)=min(2x,1) sends the open star [0,1) of 0 onto [0,1], 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Relative derived subdivision of a finite simplicial pair

Definition

For a finite Euclidean simplicial pair AK, define the relative derived subdivision DAK by keeping A 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 A stays its own barycenter. Include all faces. Write T0=K, Tr=DATr1, also denoted DArK.

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 DAPP on each subcomplex P. If A has no vertices, the result is the ordinary barycentric subdivision of Barycentric subdivision of an abstract simplicial complex; if A=K, it is K itself.

The simplex description is a face αA (possibly empty), followed by barycenters of a strict chain of faces outside A 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 012,023,234 with all faces and fix the full triangle 012. It remains one triangle. Triangle 023 has its edge 02 fixed and edges 03,23 bisected, so coning its subdivided boundary gives 1+2+2=5 triangles. Triangle 234 has all three edges bisected, giving 6 triangles. Thus the relative subdivision has exactly 1+5+6=12 triangles, as in the source example. The common edge 23 has the same midpoint on both sides.

Source locators

2.5.7–2.5.8 pp.49–50.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Relative derived subdivision makes the fixed subcomplex full

Statement

For finite AK, A is full in DArK for every r1: the vertices of any simplex that lie in A span a face of A, and its geometric intersection with A is exactly that face (possibly empty).

Source locators

2.5.10–2.5.12 pp.51–52.

Facts & Assumptions

[F1]

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 AK and at least one relative derived subdivision.

1.1

A simplex of DAK consists of a face α of A and barycenters bσ1,,bσs of nested faces outside A, strictly containing α. The only vertices in A are those of α: a barycenter of σA has support σ, so cannot lie in the subcomplex A. Thus the vertices in A span precisely α.

F1
2.1

For a point in that simplex with a positive coefficient at some bσj, take the largest such face σj. All its vertex coordinates in the original simplex become positive, with no cancellation, so the original support contains σj. Such a point cannot belong to A, since that would put its support and every subface, including σj, in A. Conversely every point using only vertices of α lies in A. Therefore the intersection is exactly α. The same argument applies with K replaced by each DAr1K. If A is empty intersections are empty; if A=K, every simplex is already in A.

F1step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Relative subdivision neighbourhood adjustment

Statement

Let AK be a finite simplicial pair, Tr=DArK. There is a finite linear subdivision T+ between T1 and T2 and a piecewise affine h:KK homotopic to the identity rel A, sending an open neighbourhood of A into A. More precisely, let B2 be the subcomplex of T2 consisting of simplices with no vertex in A. Then:

  • for every r3 and every vertex v of Tr outside B2, there is a vertex aA with h(stTr(v))stA(a); if vA take a=v;
  • the maximum of the diameters of the stars of vertices of Tr lying in B2 tends to zero.

The homotopy from the identity to h 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

[F1]

The relative subdivision is full on the A vertices. Relative derived subdivision makes the fixed subcomplex full.

[F2]

The finite source permits continuous affine common-carrier interpolation. The open star criterion produces a simplicial map.

[F3]

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 K, and put Tr=DArK.

1.1

By fullness, in T1 the fixed complex A is induced on its vertices. Let B1 be the induced subcomplex on the other vertices. They are disjoint. Form T+=DAB1T1: it subdivides just the mixed simplices of T1. Its new vertices are barycenters bσ of mixed faces. The face σA is nonempty by mixedness and is a face by fullness; choose one of its vertices aσ. Define h to fix the vertices of AB1 and send bσ to aσ. All choices are finite.

F1
2.1

For a simplex of T+, its base face belongs to AB1 and its additional vertices are barycenters of a nested chain of mixed faces of T1. 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 T1, so h extends simplicially from T+ to T1. Moreover each h(v) belongs to the positive T1 support of v: this is immediate for a fixed old vertex, and a mixed barycenter is positive at every vertex of its face. If xstT+(v), its positive coefficient at v therefore makes its h(v) coordinate positive in T1. Thus stT+(v)stT1(h(v)), which verifies the star hypothesis for the identity map and the vertex assignment h. For any point x in such a simplex, x and h(x) lie in the same original T1 simplex. Thus Ht(x)=(1t)x+th(x) remains there. Finite simplexwise affine formulas agree on faces, so h and H are continuous in finite Euclidean realization, and H0=1,H1=h, with HtA=1.

F2step 1.1
3.1

If a simplex of T+ contains a vertex aA, its base face is in A, and every other vertex is a mixed-face barycenter mapped to A. Its image simplex lies in A, since A is full in T1. Moreover a positive coefficient of a remains positive at a in the image. Therefore h(stT+(a))stA(a). The union of these open stars is an open neighbourhood of A mapped into A.

F1step 1.1step 2.1
4.1

The full relative subdivision T2 refines T+: it additionally subdivides B1 and uses the same barycenters on the mixed faces, coning their refined boundaries. It retains the vertices of A and their positive barycentric coordinates, so stT2(a)stT+(a). If v is a vertex of any further Tr outside B2, its minimal carrier face in T2 has an A-vertex a with positive coordinate at v. Every point of stTr(v) has positive coefficient at v in some refined simplex; the T2 coordinate of a, affine and nonnegative on that simplex, is then positive. Thus this star is contained in stT2(a) and its h-image in stA(a). For vA its carrier is the vertex itself.

step 3.1
5.1

Let B3 be the induced subcomplex of T3 on vertices outside A. No simplex of T3 containing an A-vertex can meet B2: its relative face-chain description has an A base face and all outside barycenters lie on T2 faces containing that base. Every point of such a simplex has a positive coordinate at some vertex of that base in T2, whereas points of B2 have all those coordinates zero. Consequently every T3 simplex meeting B2 is in B3. For r3 and a vertex vB2, every Tr simplex containing v lies in a T3 simplex meeting B2, hence in B3. Since B3 is disjoint from A, its further relative subdivisions are ordinary barycentric subdivisions. Each such star has diameter at most 2m(sdr3B3), which tends to zero by the mesh estimate.

F1F3step 4.1
6.1

If A is vertex-free then B1=T1, T+=T1 and h=1; the neighbourhood can be empty and the mesh estimate handles all stars. If A=K, then T+=K, h=1, and B2 is vertex-free, so only the near clause occurs. These constructions also cover a vertex-free K, with empty maps.

step 2.1step 4.1step 5.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Relative simplicial approximation after subdivision

Statement

Let K,L be finite complexes, AK a subcomplex, and f:KL continuous with fA the realization of a simplicial map. For some r there is a simplicial g:DArKL agreeing pointwise with f on A and homotopic to f rel A. This is a homotopy of pairs into (L,f(A)).

A prescribed compatible finite linear subdivision A of A can first be extended to a finite linear subdivision K of K. If fA is simplicial on this prescribed A, the conclusion applies to DArK, 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

[F1]

Adjustment provides the near-A star condition and shrinking far stars. Relative subdivision neighbourhood adjustment.

[F3]

The finite realization is compact metric with its Euclidean topology. Finite simplicial weak topology agrees with euclidean topology.

[F4]

Star approximation gives a homotopy fixed wherever the maps agree. The open star criterion produces a simplicial map.

[F5]

Compatible boundary coning extends finite triangulations. Relative derived subdivision of a finite simplicial pair.

Proof

Given: Finite K,L, subcomplex A, and f continuous and simplicial on A.

1.1

Take h and Tr from the neighbourhood-adjustment lemma. Compose its homotopy Ht with f to obtain a homotopy from f to fh, fixed on A. The inverse images under fh of the target vertex stars form an open cover of compact metric K, so there is a Lebesgue number δ>0. For empty K the empty map already proves the theorem.

F1F2F3
2.1

Choose r3 so that every star of a Tr vertex in B2 has diameter less than δ. For each such vertex the Lebesgue-number property gives a target vertex g(v) whose open star contains fh(st(v)). For any remaining vertex v, the adjustment lemma gives aA with h(st(v))stA(a). Since fA is simplicial, a point having positive a coordinate has positive f(a) coordinate in its image, so f(stA(a))stL(f(a)); take g(v)=f(a). On A take a=v, hence g(v)=f(v). These are finitely many choices.

F1F2step 1.1
3.1

All vertex stars now satisfy the criterion for fh, so g extends simplicially and the criterion supplies Jt(x)=(1t)fh(x)+tg(x). On A, the simplicial maps g and f agree on vertices and therefore on all affine combinations; also h is the identity there. Thus J fixes fA. Concatenate fH2t for 0t1/2 with J2t1 for 1/2t1. At the join both equal fh, so this is a continuous homotopy from f to g, fixed on A. Its restriction there always lies in the simplicial image f(A), proving the pair assertion.

F4step 1.1step 2.1
4.1

To extend a prescribed compatible A, process simplices of K outside A 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 K restricting exactly to A. If f is simplicial there, apply the preceding argument to (K,A). When A is empty it is ordinary approximation; when A=K and f is already simplicial take g=f,r=0.

F5step 3.1

Remarks

The result approximates fh, not necessarily f 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 f, even after relative subdivision. His p.43 circular-arc example rules out requiring the final map to stay in the carrier of f(x) 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

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 i(x)0. It is closed, hence compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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 =0 where 0 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.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Intersections of finite linear complexes form a convex cell complex

Statement

Let K1,K2 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

[F1]

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.

1.1

A simplex in its affine hull is defined by its barycentric coordinates λi0. Intersecting two simplices combines these finitely many inequalities in the intersection of their affine hulls. A nonempty intersection C is closed and bounded, hence is a cell. More generally consider any nonempty such finite-inequality cell C. Discard inequalities identically zero on C. For each remaining inequality choose a witness xiC where it is positive. Their average is in C 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 affC. If no inequalities remain, boundedness forces C to be a singleton, and its sole point is relatively interior.

F1
2.1

For xC, put I(x)={i:i(x)=0} and Fx={yC:i(y)=0 for iI(x)}. This is an exposed face, using the supporting function iI(x)i; an empty index set gives C. Its remaining inequalities are strict at x, so x is relatively interior in Fx. If G is any exposed face containing x, then for yFx a small extension z=x+ϵ(xy) still lies in Fx: active inequalities stay zero and all others stay nonnegative for small positive ϵ. Since x lies strictly between y and z, a supporting function nonnegative on C and zero at x must vanish at both endpoints. Hence yG and FxG.

step 1.1
3.1

Conversely, choose x relatively interior to any nonempty exposed face G, using the finite-inequality argument with its added supporting equality. For any yG, extend slightly past x away from y inside G. Every original inequality active at x must vanish at y, by the same nonnegative weighted-sum argument. Thus GFx, 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 C by adding more equalities. A point is in the relative boundary exactly when at least one inequality not identically zero on C is active: otherwise a relative ball lies in C; if one is active its nonconstant affine function has negative values arbitrarily nearby in affC. Thus proper faces cover exactly the relative boundary.

step 1.1step 2.1
4.1

Let C=στ and D=στ. 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 C shows CD is a face of C; reversing the roles proves it is a face of D. Now take arbitrary faces F of C and G of D. First restrict to the common face CD; intersections and transitivity of faces from the preceding step show FG is a face of F and G. 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.

F1step 3.1
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-09Open item page →

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

[F1]

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 pC in each nonempty cell.

1.1

Every nonempty cell has relative interior by the finite-inequality face calculus, so the finitely many choices pC exist. A zero-cell is already a single vertex. Suppose all cells of dimension less than n have compatible triangulations. The proper faces of an n-cell C are lower-dimensional and cover its boundary; their triangulations agree on common faces by the induction hypothesis. Hence together they triangulate C.

F1
2.1

For xC{pC} the ray pC+t(xpC) meets C in a closed bounded parameter interval [0,T] with T1. Convexity makes it an interval; compactness makes its endpoint belong to C. Its last point y lies on the boundary, since an interior endpoint could be extended. Every point with 0t<T is relatively interior: a small ball at pC contracted toward the endpoint gives a ball at that point. Thus y is the unique boundary point of the ray, and x=(11/T)pC+(1/T)y. It follows that the cones from pC over the triangulated boundary cover C.

F1step 1.1
3.1

Every boundary simplex is contained in a proper face supported by a hyperplane not containing pC. Its vertices together with pC 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.

step 1.1step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Two finite linear subdivisions have a common simplicial refinement

Statement

Two finite linear simplicial subdivisions K1,K2 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

[F1]

Intersection cells form a finite complex refining both triangulations. Intersections of finite linear complexes form a convex cell complex.

[F2]

A finite cell complex has a compatible simplicial triangulation. Finite convex cell complexes admit compatible triangulations.

Proof

Given: Two finite linear subdivisions K1,K2 with the same embedded underlying set.

1.1

Form the finite convex cell complex of all intersections στ, σK1, τK2, and their faces. It covers the common polyhedron and every cell is contained in a simplex of each triangulation.

F1
2.1

Choose a compatible simplicial triangulation T of that finite cell complex. Each simplex of T lies in an intersection cell, hence in one simplex of K1 and one of K2, and T 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.

F2step 1.1

5 · Examples, counterexamples and false statements

None yet.

Sources