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.

Multivariable Alexander modules and chain models

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The integral multivariable Laurent polynomial ring is Noetherian and a UFD

Statement

For every integer r≥1, the commutative ring

Λr=Z[t1±1,…,tr±1]

is Noetherian and a unique factorisation domain. Its units are exactly the elements ±t1k1⋯trkr with ki∈Z.

Facts & Assumptions

Given: An integer r≥1 and commuting indeterminates t1,…,tr.

[F1]

The one-variable Laurent ring Λ1=Z[t1±1] is Noetherian and a UFD, and its units are ±t1k (The Laurent polynomial ring is Noetherian and a unique factorisation domain).

[F2]

A polynomial ring in finitely many variables over a Noetherian commutative ring is Noetherian (If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N).

[F3]

Every localization of a Noetherian commutative ring is Noetherian (Every quotient and every localisation of a Noetherian ring is Noetherian).

[F4]

Products of primitive polynomials over a UFD are primitive, and a primitive positive-degree polynomial is irreducible over the UFD exactly when it is irreducible over its fraction field (Gauss lemma over a UFD).

[F5]

For every field K, K[x] is a UFD (For every field F, F[x] is a unique factorisation domain).

Proof

1.1givenF1constructbase

For r=1 the statement is [F1]. Suppose r>1, put Pr=Λ1[t2,…,tr], and let Sr be the multiplicative set generated by t2,…,tr. Clearing negative powers identifies Λr with Sr−1Pr.

1.2givenF1F4F5inductionconstructIH

We prove by induction on the number of added variables that Λ1[t2,…,tr] is a UFD. The base is [F1]. For the induction step let R be the preceding UFD and K its fraction field. Every nonzero f∈R[x] is its content c∈R times a primitive polynomial f0: since f has finitely many coefficients, take the product over irreducibles of their minimum exponents in those coefficients. Factor c in R and factor f0 in K[x] using [F5]. Clear denominators in each positive-degree irreducible factor and divide by its content to obtain primitive polynomials q1,…,qm∈R[x]. By [F4], their product q is primitive and is associated to f0 in K[x]. Write this scalar as a/b with coprime a,b∈R, so bf0=aq. Any irreducible divisor of a then divides every coefficient of f0, and any irreducible divisor of b divides every coefficient of q; primitiveness forces a and b to be units. Thus f0 is associated in R[x] to the product of the qi. Each qi is irreducible in R[x] by [F4], and the content factors in R, so every nonzero nonunit of R[x] factors into irreducibles.

2.1givenF1F2F3step 1.1

By [F2], Pr is Noetherian because Λ1 is Noetherian by [F1]. Its localization Sr−1Pr=Λr is Noetherian by [F3].

2.2givenF1F4F5step 1.2inductionalgebra

For uniqueness in the same induction step, contents have unique factorization in R. Two factorizations of the primitive part become factorizations in the UFD K[x], so their primitive positive-degree factors pair up up to scalar associates. If primitive f,g∈R[x] satisfy f=(a/b)g for coprime a,b∈R, then bf=ag; any irreducible factor of a must divide every coefficient of f, and any irreducible factor of b must divide every coefficient of g. Primitiveness forces a,b to be units, so the scalar is a unit of R. This proves uniqueness in R[x] and completes the induction.

3.1givenstep 1.1step 2.2algebra

Localizing the UFD Pr at Sr preserves unique factorization: factor a numerator in Pr and discard the irreducible factors that divide an element of Sr, since precisely those factors become units. Every remaining irreducible stays prime: if it divides a product of localized fractions, clearing denominators gives divisibility of the product of their numerators in Pr, so primality in Pr makes it divide one numerator; it cannot divide a cleared denominator because it was not inverted. Uniqueness follows by clearing denominators and using uniqueness in Pr. Thus Λr is a UFD.

4.1givenF1step 2.2step 3.1algebra

If u=f/s∈Sr−1Pr is a unit, then fg=sq for some q∈Sr. Every irreducible factor of f therefore divides a product of powers of t2,…,tr, so it is associated in Pr to one of these variables. The only units already in Pr are the units of Λ1, namely ±t1k, by degree in t2,…,tr and [F1]. Consequently the units of Λr are exactly ±t1k1⋯trkr.

5.1givenstep 2.1step 3.1step 4.1discharge-induction∎

Steps 2.1, 3.1 and 4.1 prove Noetherianity, unique factorization, and the stated unit description for every r≥1.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The maximal-abelian-cover Alexander module of an oriented link

Definition

Assume the Axiom of Choice. Let L=K1∪⋯∪Kr⊂S3 be a nonempty oriented smooth link with r≥1 components, and let XL=S3∖L be its open complement. For each component choose a smooth fibrewise norm on its normal plane bundle ν(Ki) and a tubular map Φi from an open neighborhood of the zero section, fixing the zero section, together with a radius ϵi>0 whose closed disk subbundle lies in that neighborhood. Require the resulting closed tubes N(Ki)=Φi(Dϵiν(Ki)) to be pairwise disjoint, and put N(L)=⋃i=1rN(Ki) and EL=S3∖int⁡S3N(L), the resulting compact smooth 3-manifold with boundary. The tube choices are part of the input. Choose a basepoint b∈EL⊂XL. Orient each normal disk so that the positive tangent to Ki followed by its positive normal basis agrees with the fixed orientation of S3. A positive meridian μi of Ki is the oriented boundary of the radius-ϵi normal disk in one fibre of ν(Ki); the curve lies on ∂EL and is disjoint from every component of L; its spanning normal disk meets Ki transversely once with positive sign and misses every other component. Alexander duality identifies H1(XL;Z) with Zr and identifies the classes of μ1,…,μr with its standard basis. Write G=π1(XL,b) and let ϕ:G→H1(XL;Z) be the first Hurewicz homomorphism, equivalently abelianization. The subgroup ker⁡ϕ is normal. The connected covering p:XLab→XL classified by ker⁡ϕ is the maximal abelian cover; it is regular and its deck group is identified with G/ker⁡ϕ≅H1(XL;Z). Put Λr=Z[H1(XL;Z)]≅Z[t1±1,…,tr±1], where ti is the deck transformation corresponding to [μi]. The isomorphism sends each variable to its group-ring basis element; monomials t1n1⋯trnr correspond bijectively to the basis elements indexed by n1[μ1]+⋯+nr[μr]. Define the absolute multivariable Alexander module by

AL=H1(XLab;Z),

as a left Λr-module under the deck action. “Absolute” means this is ordinary homology of the covering space, not relative homology with respect to a fibre over the basepoint.

Definition references

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Topological linking number as a meridian coordinate

Definition

Let K and J be disjoint oriented smooth embedded circles in the oriented three-sphere. Choose a closed product tube N(K) disjoint from J, let EK=S3∖int⁡N(K), and let μK be the positive meridian. Since H1(EK;Z)=Z[μK], define the topological linking number relative to this tube by the unique integer a satisfying [J]=a[μK]in H1(EK;Z). The chosen tube is part of the data for this definition.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Cellular chains of the maximal abelian cover compute the link Alexander module

Statement

Assume the Axiom of Choice. Let L be a nonempty oriented smooth r-component link with r≥1, compact exterior EL, and maximal abelian cover ELab→EL with deck group H≅Zr and group ring Λr=Z[H]. For any finite CW structure on EL, the inverse-image cells and one chosen lift of each open cell form a finite-rank free Λr cellular chain complex. Its first homology is the absolute multivariable Alexander module AL=H1(XLab;Z), with the deck action specified by the positive meridians.

Facts & Assumptions

Given: AC; a nonempty oriented smooth r-component link with r≥1; its chosen compact exterior EL; its regular maximal abelian cover ELab→EL with deck group H≅Zr; and a finite CW structure on EL.

[A1]

AC is the explicit hypothesis under which the maximal-abelian-cover definition is being used; selecting the finitely many cell lifts below itself needs no choice principle (The Axiom of Choice).

[F1]

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

[F2]

The compact exterior cover is the restriction of the open-complement cover; lifted deformation retraction gives a deck-equivariant isomorphism H1(ELab;Z)≅AL (The maximal abelian cover retracts onto the cover over the compact link exterior).

[F3]

Cellular homology is naturally isomorphic to singular homology for every CW complex, and the isomorphism commutes with cellular maps (Cellular homology computes singular homology).

Proof

1.1F1givenchoose

A finite CW structure has finitely many open cells. Each open cell is contractible, so its inverse image under a covering is a disjoint union of copies of that cell. The regular deck group H acts freely and transitively on those copies. Choose one lifted copy for each cell; finitely many choices suffice. Every other lift is uniquely a deck translate of the chosen lift, so the lifted cellular chain group in degree n is a free Z[H]=Λr-module with one basis element per n-cell of EL.

2.1F1step 1.1construct

Translating a lifted characteristic map by h∈H translates all of its oriented boundary cells by the same h. Thus every cellular boundary map is Λr-linear. The cellular identity ∂2=0 then makes these finite-rank free modules a chain complex over Λr.

3.1F1F3step 2.1

Each deck transformation is cellular on the lifted CW structure. By the naturality in [F3], the cellular-to-singular homology isomorphism commutes with every deck transformation and hence is Λr-linear. In degree one it identifies the homology of the lifted cellular complex with H1(ELab;Z).

4.1A1F2step 3.1∎

Under the Axiom-of-Choice convention [A1], [F2] says inclusion of the restricted maximal abelian cover into XLab induces a Λr-module isomorphism on first homology. Therefore the lifted cellular complex has first homology AL with the stated deck action.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Build the maximal-abelian-cover chain complex from a marked triangulated exterior

Definition

Inputs. A nonempty oriented r-component link L; its compact exterior EL; a finite oriented simplicial triangulation K of EL with connected 1-skeleton, an ordering of its vertices and simplices, and least vertex v0 as the based point used to classify the cover; one certified positive-meridian edge loop in the boundary triangulation for each component, each loop oriented as the boundary of a normal disk whose positive tangent followed by its positive normal basis agrees with the orientation of S3; and a label ℓ(e)∈Zr for every oriented edge e of K.

Admissible input conditions. The input is admissible when edge reversal gives ℓ(eˉ)=−ℓ(e), the sum of the labels around every oriented 2-simplex is zero, and the sum around the ith certified positive meridian loop is the standard basis vector ei∈Zr. The last check verifies the marking: by the Alexander-dual meridian basis and the compact-exterior retraction, these loops give the standard basis of H1(EL;Z), so their evaluations determine the full abelianization. The edge labels define a covering model by assigning to each oriented edge e:v→w the transition (v,g)↦(w,g+ℓ(e)) on vertex exponents g∈Zr; the face check makes all simplex lifts compatible. The procedure takes the geometric status of the supplied triangulation and peripheral curves as input data; it does not recognize a 3-manifold or discover meridians.

Output. Either invalid-labeling, or the finite free graded Λr=Z[t1±1,…,tr±1] modules with one basis element per simplex orbit and the prescribed Laurent-polynomial boundary matrices. The main theorem on this page proves that these matrices make the output a chain complex and that its first homology is AL.

Instructions.

  1. Check the edge-reversal rule, each oriented 2-simplex sum, and each meridian-loop evaluation. Return invalid-labeling if any check fails.
  2. Order the 1-simplices by their supplied simplex order. Start with no tree edges and with each vertex in its own component. Scan the edges in that order, adding an edge exactly when its endpoints lie in different current components and then merging those components. Because the 1-skeleton is connected, this finite scan produces the lexicographically first spanning tree. Use the least-ordered based vertex v0 as root, assign its lift to the identity deck element, and assign every other vertex lift by summing edge labels along its unique tree path from the root.
  3. For each oriented simplex σ, choose its least-ordered vertex as anchor and use the label sums along edges of σ to determine the lift incident to the already chosen anchor lift. For each oriented face τ of σ, compute the unique deck exponent g(σ,τ)∈Zr taking the chosen lift of τ to that face of the chosen lift of σ.
  4. If τ occurs with incidence sign ϵ(σ,τ)∈{−1,1} in ∂σ, place the coefficient ϵ(σ,τ)t1g1(σ,τ)⋯trgr(σ,τ) in the corresponding matrix entry. Repeat for every simplex and dimension.
  5. Return the chain groups and boundary matrices in the input simplex order. Coning a closed edge path in a simplex to its anchor expresses it as a sum of triangular face boundaries, so the face-sum check makes its edge-path sum independent of path; the meridian checks ensure the deck group is the prescribed full abelianization.

The following triangle records the local consistency check. Each arrow is oriented as drawn and its label lies in Zr. The face check in instruction 1 is exactly the equation g01+g12+g20=0.

g01g12g20v0v1v2
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Fitting ideals, order, and diagonal specialization of the multivariable Alexander module

Statement

Assume the Axiom of Choice and let L be a nonempty oriented r-component link with r≥1 and maximal-abelian-cover module AL over Λr=Z[t1±1,…,tr±1]. Then AL is finitely presented, every elementary/Fitting ideal Ej(AL) is independent of the chosen finite triangulation and of the chosen lifts of its cells, and the order ord⁡(AL)—the greatest common divisor of the generators of Eq(AL), where q=dim⁡Frac⁡(Λr)(AL⊗ΛrFrac⁡(Λr))—is defined up to a unit ±t1k1⋯trkr. The diagonal ring map η:Λr→Λ1=Z[t±1], ti↦t, specializes the lifted chain complex by coefficient extension to the total-linking cyclic-cover chain complex. This statement concerns the chain complex only; it does not identify AL⊗Λr,ηΛ1 with the first homology of the specialized complex. For r≥2, the diagonal map is nonflat and such an identification need not hold because homology need not commute with nonflat base change.

Facts & Assumptions

Given: AC; a nonempty oriented r-component link L with r≥1; its maximal-abelian-cover module AL; Λr=Z[t1±1,…,tr±1]; a basepoint b∈EL, and the first Hurewicz map ϕE:π1(EL,b)→H1(EL;Z).

[A1]

AC, as assumed by the link-complement and one-variable-cover suppliers (The Axiom of Choice).

[F1]

The maximal-abelian-cover module is AL=H1(XLab;Z) with its Λr deck action (The maximal-abelian-cover Alexander module of an oriented link).

[F2]

The ring Λr is Noetherian and a UFD, with units exactly signed Laurent monomials (The integral multivariable Laurent polynomial ring is Noetherian and a UFD).

[F3]

For a finitely presented module, the jth elementary ideal is the ideal generated by all minors of the prescribed size in a finite presentation matrix (Elementary ideals of a finitely presented module).

[F4]

For every commutative ring and finitely presented module, each elementary ideal is independent of the finite presentation and invariant under module isomorphism (Elementary ideals are independent of the presentation).

[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]

The one-variable Alexander module is first homology of the cover classified by total linking, whose defining map sums the Alexander-dual meridian coordinates (The one-variable Alexander module of an oriented link).

[F7]

Connected covers are classified by their induced fundamental-group subgroups (Connected covering spaces are classified by conjugacy classes of fundamental-group subgroups).

[F8]

The maximal abelian cover deformation retracts equivariantly onto the restricted compact-exterior cover (The maximal abelian cover retracts onto the cover over the compact link exterior).

[F10]

Every compact smooth manifold with boundary, regarded as a manifold with corners, admits a finite corner-adapted triangulation and hence a finite CW structure (Finite smooth triangulation of compact corners, relative to admissible boundary data).

Proof

1.1A1F1F2F5F10givenconstruct

By [F10], choose a finite CW structure on the compact smooth exterior EL. By [F5], its lift gives a finite free complex C2→d2C1→d1C0 with first homology AL. Since Λr is Noetherian by [F2], every submodule of a finite free module is finitely generated: induct on the rank n of Λrn; project a submodule N to the first coordinate, choose lifts of finitely many generators of its image ideal, and apply the induction hypothesis to the kernel in Λrn−1. Thus Z1=ker⁡d1 is finitely generated, and B1=im⁡d2 is generated by the finitely many columns of d2. The quotient AL=Z1/B1 is finitely generated. Choose a surjection Λrm→AL with finite m; its kernel is a submodule of Λrm and hence finitely generated by the same argument. This is a finite presentation of AL.

1.2F1F5F6F7F8F9construct

Let ηˉ:H1(EL;Z)→Z be the total-linking map. By [F1] the positive meridians are the coordinate basis, so the coordinate-sum definition [F6] sends each one to 1. Define η:Λr→Λ1 to be its induced ring map ti↦t. By [F7], quotienting the maximal abelian cover of EL by ker⁡ηˉ gives the connected cover classified by ker⁡(ηˉ∘ϕE); this quotient cover is regular with deck group H1(EL;Z)/ker⁡ηˉ≅Z by [F9]. The equivariant deformation retraction [F8] descends to a deformation retraction of the corresponding quotient of the open-complement cover onto this compact-exterior quotient cover; by [F6] these are the one-variable total-linking covers of the open complement and exterior, respectively. For every lifted cell orbit, tensoring its free rank-one Λr summand with Λ1 along η identifies the quotient-orbit generator with a free rank-one Λ1 generator, and sends each boundary coefficient to its image under η. Therefore C∗cell(ELab;Z)⊗Λr,ηΛ1 is the cellular chain complex of the total-linking cover of EL.

2.1F1F3F4F5step 1.1

Use the resulting finite presentation to define each Ej(AL) as in [F3]. Any other triangulation of the same marked exterior lifts to another CW structure on the same topological cover; [F5] identifies the homology of either lifted cellular complex with the same singular module AL, and the deck action in both identifications is the same. A different lift of a cell multiplies its basis element by a deck monomial, also leaving the resulting singular module unchanged. Hence the modules computed from the two choices are isomorphic. By [F4] all their elementary ideals agree.

2.2F2F3F4step 1.1algebra

Put K=Frac⁡(Λr) and q=dim⁡K(AL⊗ΛrK). For a finite presentation matrix with n target generators, tensoring with K shows its rank is n−q. Therefore at least one (n−q)×(n−q) minor is nonzero (with the empty minor equal to 1 when n=q), so Eq(AL)≠0. This ideal has finitely many generators by its finite presentation, and in the UFD [F2] their gcd exists and is unique up to a unit. Since [F4] makes the ideal presentation-independent, the gcd is well-defined up to a unit of Λr, which by [F2] is ±t1k1⋯trkr.

3.1F2step 1.2algebra∎

Homology does not in general commute with this coefficient extension. For r=1, η is the identity; for r≥2, consider the finite free chain complex C1=Λr→ t1−t2 C0=Λr with all other chain groups zero. The ring Λr is a domain and t1−t2≠0, so H1(C∗)=0. After diagonal base change η, the differential is multiplication by t−t=0, hence H1(C∗⊗Λr,ηΛ1)=Λ1, while H1(C∗)⊗Λr,ηΛ1=0. The multiplication map Λr→t1−t2Λr is injective before tensoring and becomes the zero map afterward, so Λ1 is nonflat over Λr for r≥2. Thus for r≥2 the chain specialization does not in general identify the specialized chain-complex homology with the tensor product of AL, and no equality of specialized homology orders follows without additional hypotheses.

Sources

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Termination and exact validation of the triangulated-exterior chain procedure

Statement

For every finite ordered triangulation of a compact link exterior with certified positive-meridian edge loops and a label vector on each oriented edge, execution terminates. It returns exactly the finite free graded modules and boundary matrices prescribed by the procedure if and only if edge reversal, every oriented 2-simplex cocycle sum, and every marked-meridian image check pass; otherwise it returns invalid-labeling. The procedure does not recognize whether the supplied triangulation is a link exterior or whether the certified peripheral loops are genuine meridians; those are geometric input hypotheses.

Facts & Assumptions

Given: A finite ordered triangulation of a compact link exterior with certified positive meridian edge loops, and an encoded integer vector label on every oriented edge. Prove the procedure terminates and has exactly the stated validation behavior.

[F1]

The procedure checks edge reversal, each oriented 2-simplex sum, and each meridian-loop evaluation, returns invalid-labeling upon a failed check, and otherwise constructs one boundary matrix entry for each oriented face incidence of each simplex (Build the maximal-abelian-cover chain complex from a marked triangulated exterior).

[A1]

The finite complex is a valid triangulation of the compact exterior, its 1-skeleton is connected, and the listed boundary loops are already certified as positive meridians. These geometric facts are input hypotheses; the procedure does not test them (Build the maximal-abelian-cover chain complex from a marked triangulated exterior).

Proof

1.1givenF1A1construct

There are finitely many edges, 2-simplices, meridian-loop edges, vertices, simplices, and face incidences in the finite input. Each validation pass performs finitely many additions and comparisons of integer vectors, so it terminates. It returns invalid-labeling at the first failed edge-reversal, face-sum, or meridian-image check; if none fails, it proceeds to construction. By [F1] there are no other label-rejection branches, so rejection occurs exactly for the stated failed checks.

2.1A1F1step 1.1construct∎

By [A1] the 1-skeleton is finite and connected. The procedure scans its finite ordered edge list, adds an edge exactly when its endpoints lie in different current components, and merges those components. Each addition reduces the number of components by one; connectedness therefore yields a spanning tree after finitely many additions, with exactly ∣V∣−1 edges. The paths in this tree have finite length, and the sum of their integer edge labels is a finite computation for each vertex. Each simplex has finitely many edges and faces, so the prescribed exponent and signed Laurent coefficient are computed by finitely many additions, comparisons, and table insertions. There are finitely many simplices, hence all boundary matrices are produced and the algorithm terminates with exactly the free modules and face-incidence entries in [F1].

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

4 · Examples, counterexamples and false statements

None yet.

Sources