Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 triangulated-exterior chain model computes the multivariable Alexander module

Statement

Assume the Axiom of Choice. Let L be a nonempty oriented smooth r-component link with r≥1, compact exterior EL=S3∖int⁡N(L) obtained from pairwise-disjoint closed normal disk tubes, a finite oriented simplicial triangulation K of EL with ordered vertices and simplices, with least vertex v0 as the basepoint used in the cover definition, and one certified positive-meridian edge loop μi per component. Orient each normal disk so the positive tangent to its component followed by the positive disk basis agrees with the orientation of S3, and assume the resulting classes form the standard basis of H1(EL;Z). If an integer-vector edge labeling is antisymmetric under edge reversal, sums to zero on every oriented 2-simplex, and evaluates to the ith standard basis vector on μi, then the chain procedure returns a finite free chain complex over Λr=Z[t1±1,…,tr±1]. The first homology of this complex is the absolute maximal-abelian-cover Alexander module AL. Its Fitting ideals are independent of the triangulation and cell lifts, and its order is defined up to multiplication by a unit ±t1k1⋯trkr.

Facts & Assumptions

Given: AC; a nonempty oriented smooth r-component link; its chosen compact exterior and finite ordered oriented simplicial triangulation; certified positive-meridian edge loops forming the basis of H1(EL;Z); and an edge labeling accepted by the chain procedure.

[A1]

AC is assumed in the maximal-abelian-cover definition and its link-complement supplier (The Axiom of Choice).

[F1]

The module AL is H1(XLab;Z) with Laurent variables acting by positive-meridian deck transformations (The maximal-abelian-cover Alexander module of an oriented link).

[F2]

Inclusion of the compact exterior into the open complement lifts to a deck-equivariant homotopy equivalence of maximal abelian covers and preserves the positive-meridian basis (The maximal abelian cover retracts onto the cover over the compact link exterior).

[F3]

The procedure checks edge reversal, all oriented 2-simplex sums and the marked meridian images, returning invalid-labeling upon any failed check (Build the maximal-abelian-cover chain complex from a marked triangulated exterior).

[F4]

On each encoded admissible input the procedure terminates and rejects exactly inputs that fail one of its three label checks (Termination and exact validation of the triangulated-exterior chain procedure).

[F5]

A finite CW structure on EL lifts to a finite-rank free Λr cellular chain complex whose first homology is AL (Cellular chains of the maximal abelian cover compute the link Alexander module).

[F6]

For every CW complex, cellular homology agrees naturally with singular homology and the comparison is natural for cellular maps (Cellular homology computes singular homology).

[F7]

The first Hurewicz homomorphism identifies π1(EL,b)ab with H1(EL;Z) (The first Hurewicz map is abelianization).

[F8]

The Fitting ideals of AL and its order are independent of finite triangulation and cell lifts; the order has the signed Laurent-monomial unit ambiguity (Fitting ideals, order, and diagonal specialization of the multivariable Alexander module).

[F9]

Connected covers of a path-connected, locally path-connected, semilocally simply connected space are classified by their induced subgroups (Connected covering spaces are classified by conjugacy classes of fundamental-group subgroups).

[F10]

For each lifted face incidence, the procedure inserts the signed incidence number times the deck monomial of its lift displacement (Build the maximal-abelian-cover chain complex from a marked triangulated exterior).

Proof

1.1A1F3F4given

By [F4], an admissible input passes all three label checks and the finite procedure terminates. Thus its output is the finite free complex whose cells and boundary matrices are prescribed in [F3].

2.1F2F3F6step 1.1algebra

Antisymmetry makes the edge labels a homomorphism from the cellular 1-chain group of K to Zr. The zero sum on each oriented triangle says this homomorphism vanishes on every cellular 2-boundary. Its restriction to cellular 1-cycles therefore descends to a homomorphism H1cell(EL;Z)→Zr. By [F6] and the meridian-basis assertion in [F2], this map sends the basis [μi] to ei, so it is precisely the isomorphism that records the full meridian abelianization.

3.1F2F7step 2.1

By [F7], the corresponding homomorphism on π1(EL,b) factors through its abelianization and has kernel equal to the commutator subgroup. Thus the cover represented by the labels is the maximal abelian cover of EL, with deck exponents indexed by the stated meridian basis.

4.1F2F3F9step 2.1step 3.1construct

Let λ(v) be the sum of edge labels along the unique spanning-tree path from the least vertex v0 to v. Construct a simplicial cover with vertices (v,g), g∈Zr, and with each oriented edge e:v→w lifting from (v,g) to (w,g+ℓ(e)). In a simplex, assign a vertex exponent by summing labels along an edge path from its least vertex; if two such paths have the same endpoints, their difference is a 1-cycle, and coning that cycle to the least vertex expresses it as a sum of triangular face boundaries. The face checks make each such sum zero. Thus every simplex has a unique lift through each of its vertex lifts, and the lifted simplices agree on common faces. At each vertex (v,g), each simplex incident to v has a unique lift through (v,g); therefore the open star maps homeomorphically to the open star of v, proving the covering condition. A loop lifts closed exactly when its label sum is zero; by steps 2.1, 3.1 this subgroup is the kernel of abelianization. Whiskering the certified meridian loops to v0 and back gives loops with label sums ei, so the whole fiber over v0 is connected. The spanning tree paths then connect every vertex in every other fiber to that fiber, hence the cover is connected. By [F9] the constructed cover is the maximal abelian cover.

5.1F10step 4.1construct

The tree assignments select the vertex lifts (v,λ(v)). The procedure then selects each simplex lift through its anchor lift. For a face τ of σ, the difference between the exponent of this face occurrence and the selected lift of τ is exactly g(σ,τ) computed in instruction 3. Therefore its lifted boundary coefficient is ϵ(σ,τ)t1g1(σ,τ)⋯trgr(σ,τ), as in instruction 4. These are the cellular face-incidence boundaries in the constructed cover, so the procedure matrices satisfy ∂2=0 and form its lifted cellular chain complex.

6.1F1F5F8step 5.1∎

By [F1] and [F5], the first homology of that complex is AL as a Λr-module. By [F8], its Fitting ideals and order are independent of the triangulation and lift choices, with the stated unit ambiguity. This proves every conclusion.

Depends on

Used by

Dependency tree · two levels

58 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