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: Examples

1 · Prerequisites

2 · Summary

Explicit edge and triangle subdivisions test face counts and orientation signs. A quadratic interval map illustrates endpoint-relative approximation and failure of exact simpliciality. The infinite fan distinguishes weak-topology compactness from distances in a drawing. The fixed-edge midpoint obstruction explains the need for relative derived subdivision.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Barycentric subdivision of an edge and triangle

Example

For the full edge on {a,b}, barycentric subdivision has three vertices and two edges. For the full triangle on {a,b,c} it has seven vertices, twelve edges, and six triangles, with one empty face in each complex.

Source locators

2.5.7–2.5.9 pp.49–51.

Facts & Assumptions

[F1]

Subdivision faces are strict chains of nonempty original faces. Barycentric subdivision of an abstract simplicial complex.

[F2]

The barycentric realization identifies the subdivision with the original simplex. Barycentric subdivision realizes homeomorphically.

Verification

Given: The full edge and full triangle, including all their faces.

1.1

The edge has nonempty faces a,b,ab, abbreviating braces. Its only length-two chains are a<ab and b<ab, so the two subdivided edges meet at bab=(a+b)/2. There are three singleton chains and one empty chain. Thus its numbers of faces in dimensions 1,0,1 are (1,3,2).

F1
2.1

The triangle has face labels a,b,c,ab,ac,bc,abc. The maximal chains are a<ab<abc, b<ab<abc, a<ac<abc, c<ac<abc, b<bc<abc, and c<bc<abc. The comparable pairs are six vertex-edge pairs, three vertex-triangle pairs, and three edge-triangle pairs, giving twelve edges. The seven singleton chains and one empty chain give face counts (1,7,12,6). Barycenters place these six triangles inside the original triangle and the barycentric homeomorphism identifies their union with it. For a vertex-free complex there is only the empty chain, so the counts reduce to (1,0,0,0).

F1F2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The subdivision chain of an oriented two simplex

Example

Abbreviate singleton face vertices by a,b,c, two-element face vertices by ab,ac,bc, and the triangle face vertex by T=abc. For the orientation [a,b,c], S[a,b,c]=[b,bc,T][c,bc,T][a,ac,T]+[c,ac,T]+[a,ab,T][b,ab,T]. Its boundary is [b,bc][c,bc][a,ac]+[c,ac]+[a,ab][b,ab]=S([b,c][a,c]+[a,b]).

Source locators

2.1 pp.121–122.

Facts & Assumptions

[F1]

Subdivision uses the cone recursion. Oriented simplicial subdivision operator.

[F2]

The general boundary identity is a chain-map identity. Oriented simplicial subdivision commutes with boundary.

Verification

Given: The full oriented triangle [a,b,c] and the displayed face-label abbreviations.

1.1

The augmented cone recursion gives S[u,v]=[uv,v][uv,u]=[u,uv][v,uv]. Hence S[a,b,c]=[b,bc][c,bc][a,ac]+[c,ac]+[a,ab][b,ab]. Prepending T to each term and moving it past the two other vertices changes sign by (1)2=1, giving exactly the six displayed oriented triangles.

F1
2.1

For a term [u,e,T], its boundary is [e,T][u,T]+[u,e]. The first two triangle terms give radial contribution [b,T]+[c,T] after the [bc,T] terms cancel. The next two give [a,T][c,T] after the [ac,T] terms cancel. The last two give [a,T]+[b,T] after the [ab,T] terms cancel. The three remaining radial contributions sum to zero. The six base terms are exactly the displayed S[a,b,c], verifying the boundary identity directly, in agreement with the general chain-map lemma.

F2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

A relative simplicial approximation fixed on the endpoints

Example

For f:[0,1][0,1], f(x)=x2, fix the endpoint subcomplex A={0,1}. On the midpoint subdivision define the simplicial vertex map g(0)=g(1/2)=0, g(1)=1. Its realization is g(x)=0 for 0x1/2, and g(x)=2x1 for 1/2x1. Then g is homotopic to f rel both endpoints.

Source locators

Relative theorem pp.39–42, interval specialization.

Facts & Assumptions

[F1]

Star inclusions certify a simplicial approximation. The open star criterion produces a simplicial map.

[F2]

Relative approximation permits fixed endpoint subcomplexes. Relative simplicial approximation after subdivision.

Verification

Given: The specified interval map and the midpoint triangulation.

1.1

The first source edge maps to the target vertex 0 and the second to the target edge, so g is simplicial. The two affine formulas agree at 1/2, both giving 0, and g(0)=0, g(1)=1. The target stars are [0,1) and (0,1]. The source stars of 0,1/2,1 are [0,1/2), (0,1), (1/2,1]; under x2 they lie respectively in [0,1), [0,1), (0,1]. Thus this is even a star approximation to f.

F1
2.1

The explicit homotopy is H(x,t)=(1t)x2+tg(x). It is continuous because its piecewise polynomial formulas agree at x=1/2; its values lie in [0,1] as convex combinations. It satisfies H(x,0)=x2, H(x,1)=g(x) and H(0,t)=0,H(1,t)=1. At the midpoint, f(1/2)=1/4, g(1/2)=0, and H(1/2,t)=(1t)/4, so fixing the endpoints does not mean fixing the entire interval. This explicitly realizes the relative theorem for the pair.

F2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

A compact set in an infinite non locally finite realization still meets finitely many cells

Example

Let K have vertices o,v1,v2,, edges {o,vn} and their faces, with weak realization topology. Every compact subset lies in finitely many edges although the vertex o has infinitely many incident edges. An explicit compact subset is C0={(1t)o+tv1:0t1}  {(1t)o+tv2:0t1/2}. In contrast the set Q={(11/n)o+(1/n)vn:n1} is closed discrete and not compact. For this countably indexed fan the conclusion for every compact subset has the choice-free proof below.

Source locators

Proposition A.1 p.520, simplicial specialization.

Facts & Assumptions

[F1]

Stars and weak topology use simplexwise coordinates. Open and closed stars in a subdivision.

Verification

Given: The countably indexed fan with weak topology and, when proving the universal claim, a compact subset C.

1.1

The two segments defining C0 are continuous images of compact closed real intervals, so their finite union is compact. Its positive supports are {o}, {v1}, {o,v1} and {o,v2}, exactly four open simplices in two edges. Any neighbourhood of o intersects each edge in a relative neighbourhood of its endpoint, hence meets the interior of every edge. Thus o is not locally finite.

F1
1.2

Each closed edge meets Q in exactly one point, and the central vertex is not in Q. Every subset of Q therefore has finite closed traces on every simplex and is weakly closed. In particular Q is closed and discrete, and its singleton cover has no finite subcover. The numerical parameter 1/n tending to zero does not imply convergence to o in the weak topology: KQ is an open neighbourhood of o missing all these points.

F1
1.3

For a compact nonempty C, the coordinate xxvn is continuous because it is continuous on every simplex. Let mn=sup{xvn:xC}[0,1]. This supremum is attained: otherwise the sets {xC:xvn<mn1/k} for positive integers k would cover C, and a finite subcover would bound all coordinates by mn1/k0 for its largest index k0, contradicting the supremum. If mn>0, there is exactly one point of the entire fan with coordinate xvn=mn, namely pn=(1mn)o+mnvn, so this point belongs to C. These points are canonical and require no countable selections.

given
2.1

If infinitely many mn are positive, the corresponding pn form an infinite set with at most one point on each edge, every subset of which is weakly closed just as for Q. It is therefore closed in compact C, and is compact (adjoin its open complement to any cover to see this directly). Yet it is discrete with an infinite singleton cover, a contradiction. Only finitely many mn are positive, so C lies in their edges and possibly o; if none are positive use the first edge to contain o. For empty C no edge is needed.

step 1.2step 1.3

Remarks

Under Countable Choice the general result Compact subsets of an arbitrary simplicial realization meet finitely many open simplices supplies the compact-support conclusion immediately. The specialized maximum-coordinate argument above proves this countably indexed example without adding that hypothesis. The supplied instance C0 and the noncompact set Q are explicit, rather than unspecified selections of points on the edges.

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

A continuous map need not be simplicial before subdivision

Statement refuted

False assertion: every continuous self-map of a geometric edge is the realization of a simplicial self-map in the original triangulation.

Source locators

2.5.1–2.5.6 pp.46–48.

Facts & Assumptions

[F1]

A star approximation is homotopic to the continuous map. The open star criterion produces a simplicial map.

[F2]

Finite-source approximation gives a simplicial representative after sufficient subdivision. Finite simplicial approximation for maps of pairs.

Counterexample

Given: The edge [0,1] with vertices exactly 0,1, and f(x)=x2.

1.1

The map takes [0,1] into itself, fixes both vertices, and is continuous: x2y2=xyx+y2xy on this interval. Any simplicial map whose realization equals f must therefore send 0 to 0 and 1 to 1. Its affine realization on the single edge must be (1x)0+x1=x.

given
2.1

At x=1/2 this affine map equals 1/2, while f(1/2)=1/4. Hence f is not simplicial in the original triangulation, refuting the assertion. Nevertheless the identity vertex map is a star approximation: f([0,1))[0,1) and f((0,1])(0,1]. The star criterion therefore gives a homotopy to the identity, consistent with finite simplicial approximation. Failure of exact simpliciality is not failure of a simplicial approximation.

F1F2step 1.1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Ordinary barycentric subdivision cannot fix a nonconstant simplicial edge

Statement refuted

False assertion: ordinary iterated barycentric subdivision can always give a simplicial map to the unchanged target agreeing pointwise with an already simplicial map on a fixed subcomplex. Already an edge mapped identically to an unsubdivided target edge makes this impossible for every r1.

Source locators

Opening warning pp.39–40; elementary vertex obstruction.

Facts & Assumptions

[F1]

The edge face becomes a subdivision vertex and singleton vertices persist. Barycentric subdivision of an abstract simplicial complex.

[F2]

Relative subdivision admits a map fixed on the simplicial subcomplex. Relative simplicial approximation after subdivision.

Counterexample

Given: Take K=A to be the full edge [0,1], take the target to be the same unsubdivided edge, and let f(x)=x.

1.1

The identity is continuous and simplicial on all of A. In sdK the nonempty edge face supplies the midpoint m=1/2 as a vertex. Every subsequent barycentric subdivision retains that geometric point as a singleton-face vertex, so m is a vertex of sdrK for every r1.

F1
2.1

A simplicial map to the unchanged target must send m to the target vertex 0 or 1. Pointwise agreement on A instead requires g(m)=f(m)=1/2, impossible. More generally any source containing a fixed edge mapped identically to a target edge has the same obstruction by restricting to its midpoint. Relative derived subdivision avoids it: for A=K, DArK=K, so the identity itself is simplicial and fixed throughout, as allowed by the relative theorem.

F2step 1.1

Sources