Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

The finite covering-tower endpoint has spherical boundary

Statement

Let V be a compact connected orientable piecewise linear three-manifold with a finite compatible triangulation K, with boundary a subcomplex, and with every simplex link a standard piecewise linear sphere or ball of the appropriate dimension. If V has no connected twofold covering space, every connected component of ∂V is piecewise linearly homeomorphic to the standard two-sphere. This conclusion uses only finite simplicial and cellular calculations and has no choice hypothesis.

Facts & Assumptions

Given: V,K and the stated covering condition. All chains, cochains and matrices in this proof have coefficients in F2 and have finite dimension.

[F1]

Finite cellular chain complexes compute singular homology, including relative CW pairs, and the pair homology sequence is exact (Cellular homology computes singular homology, Relative cellular homology computes relative singular homology, Long exact sequence of a pair).

[F2]

A finite triangulated surface has a one-polygon schema; its finite polygonal reduction moves preserve the realization, and prescribed PL maps of polygonal disk boundaries extend over those disks (A finite triangulated surface has a one-polygon schema, Homeomorphism-preserving polygonal schema moves, Finite polygonal disk parametrizations and boundary surgery).

Proof

Given: The data above. Fix an ordering of the finite vertex and simplex sets, used for all pivot selections.

1.1givenconstruct

Let C∗(K) be the simplicial chain complex and C∗(K) its vector-space dual, with coboundary δ. Every simplicial one-cocycle a is a coboundary. To prove this, construct a twofold simplicial cover from a: its vertices are (v,ϵ) for ϵ∈F2, its lifted edge over vw goes from (v,ϵ) to (w,ϵ+a(vw)), and its lifted simplex over a simplex with vertices v0,…,vk has labels ϵ+a(v0vj) at vj, with a(v0v0)=0. The cocycle identity on every triangle makes these prescriptions agree on faces and makes the two lifts of each vertex star disjoint copies of that star. Their realization is a genuine twofold covering space of V. If it were connected, it would contradict the hypothesis. Otherwise it has exactly two connected components, each projecting homeomorphically to V: path lifting connects a chosen fiber point to one point in every other fiber; if the same component contained both points of one fiber, it would contain both points of every fiber and the whole cover would be connected. Choose one component. The label b(v) of its unique vertex over v satisfies a(vw)=b(v)+b(w), so a=δb. Thus H1(C∗(K))=0.

2.1F1step 1.1algebra

Write dj:Cj(K)→Cj−1(K) for the finite boundary matrices. Gaussian elimination, always taking the first available pivot in the fixed ordering, proves that a matrix and its transpose have the same rank. Consequently dim⁡H1(C∗(K))=dim⁡C1−rank⁡d1−rank⁡d2=dim⁡H1(C∗(K))=0. Thus H1(V;F2)=0 by [F1]. No infinite basis or extension of a functional is selected.

2.2givenstep 1.1construct

For the finite triangulation fixed in step 1.1, there is also a relative dual-cell decomposition of (V,∂V). For a k-simplex σ of K, let Bσ be the closed union of barycentric simplices whose defining face chain begins with σ, together with all their faces. Its coface poset identifies it piecewise linearly with the cone on the barycentric subdivision of lk⁡(σ,K). Hence it is a (3−k)-ball by the simplex-link hypothesis. For an interior simplex its boundary is the union of the blocks Bτ for proper cofaces τ⊋σ. For a boundary simplex its boundary additionally contains its side in ∂V: in the cone-on-ball model that side is the cone on the boundary of the link ball. The boundary side and the coface blocks are the two parts of its ball boundary. The interiors of the blocks off ∂V are pairwise disjoint and cover V∖∂V. Indeed, the least face with positive barycentric-chain coordinate determines the unique block interior, while a point whose chain lies wholly in ∂V belongs to the boundary subcomplex. Starting with a finite triangulation of ∂V and attaching these blocks in increasing dimension therefore gives a finite relative CW decomposition of (V,∂V).

3.1F1step 1.1step 2.2construct

Its relative cellular boundary is ∂Bσ=∑τ⊃σdim⁡τ=k+1Bτ(mod∂V). Each listed block is an embedded codimension-one facet of Bσ and occurs once. All other boundary faces have smaller dimension or lie in ∂V. Equivalently, in its barycentric triangulation the faces obtained by omitting an intermediate chain member cancel in pairs, and the uncanceled faces are precisely those with the least member replaced by an immediate coface; boundary-side faces are zero in the relative complex. Thus the basis correspondence from the cochain dual to σ to Bσ identifies Ck(K), with coboundary, with the degree-reversed relative dual-cell complex in degree 3−k. By [F1], this gives H2(V,∂V;F2)≅H1(C∗(K))=0. This is a finite chain-matrix duality calculation, not an invocation of a general Poincaré duality theorem.

4.1F1step 2.1step 3.1algebra

The portion H2(V,∂V;F2)→H1(∂V;F2)→H1(V;F2) of the exact sequence in [F1] now has zero outer groups. Therefore H1(∂V;F2)=0. In particular this holds for each boundary component, since the finite boundary chain complex is the direct sum of its component complexes. Each component is a closed orientable finite PL surface.

5.1F2step 4.1construct

For completeness, apply the finite surface procedure [F2] to such a component S. Coherent triangle orientations give opposite directions on the two occurrences of every paired polygon side. Cancel adjacent inverse pairs, retaining the terminal sphere bigon. If an uncanceled residue is nonempty and is not that bigon, it has interlaced pairs: otherwise all pairing chords on its boundary circle would be noncrossing, and an innermost chord would give an adjacent inverse pair. Extract an interlaced pair as a commutator block using [F2]'s explicit cut-and-merge identity, reserve that block, and repeat on the residue. Each cancellation deletes a pair, and each extraction removes two pairs from the unprocessed residue, so this terminates with either the sphere bigon or a product of g≥1 commutator blocks. All cuts and disk identifications are polygonal, and their parametrizations are PL by the disk-extension clause of [F2], so the resulting model is PL homeomorphic to S.

6.1F1F2step 4.1step 5.1∎

A nonempty commutator model has one vertex, 2g one-cells, and one two-cell. Its first boundary is zero and its second boundary is zero modulo two, since every side occurs twice. Hence its first homology has dimension 2g>0 by [F1], contrary to step 4.1. The only remaining model is the sphere bigon, whose quotient is the standard PL two-sphere; one may subdivide its two boundary arcs and realize it as two polygonal disks glued along their common boundary. Thus every component is a PL sphere. All covers, blocks, reductions and pivots used finite data; no arbitrary-index or countable choice was required.

Depends on

Used by

Dependency tree · two levels

45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources