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.

Torsion first homology forces twisted acyclicity for a deficiency-one exterior spine

Statement

Assume the Axiom of Choice convention of the twisted-chain definition. Let X be a connected finite based two-dimensional CW complex with one 0-cell, n≥2 1-cells and n−1 2-cells, so χ(X)=0. Let G=π1(X), let ψ:G↠H≅Zm be an epimorphism with m≥1, let ρ:G→GLd(F) be a representation over a field F, set Λ=F[H] and Q=Frac⁡(Λ), and give Λd the right F[G]-action v⋅g=vρ(g)ψ(g), with ψ(g) acting by its central monomial. Form

C∗ρ,ψ(X;Λd)=Λd⊗F[G]C∗(X~;F),

where X~ is the universal cover, and set C∗ρ,ψ(X;Qd)=Q⊗ΛC∗ρ,ψ(X;Λd). If every element of H1(C∗ρ,ψ(X;Λd)) is annihilated by some nonzero element of Λ, then C∗ρ,ψ(X;Qd) is acyclic. No assumption that its degree-two homology vanishes before localization is required.

Facts & Assumptions

Given: AC; the finite based 2-complex and its cell counts; a positive-rank free abelian quotient ψ:G↠H; a field F; and the torsion hypothesis on H1 over Λ=F[H].

[A1]

AC is inherited from the maximal-abelian-cover convention used to define the coefficient complex. The finite-dimensional linear-algebra argument below itself uses no choice principle. The Axiom of Choice

[F1]

The twisted complex is formed from the chosen based universal-cover cellular chains using the right action v⋅g=vρ(g)ψ(g); the boundary of a lifted oriented 1-cell x is multiplication by ρ(x)ψ(x)−Id. Twisted chain complex and based Reidemeister torsion for link exteriors

Proof

1.1A1givenF2algebra

By [A1], use the prescribed AC-based twisted coefficient convention. Choose an ordered basis t1,…,tm of H. Then Λ is the Laurent-polynomial ring F[t1±1,…,tm±1]. Order exponent vectors lexicographically. For nonzero Laurent polynomials f,g, their finite supports have largest exponents a,b with nonzero coefficients fa,gb; the largest exponent of fg is a+b and its coefficient is fagb≠0. Thus Λ is an integral domain, and [F2] makes Q a field containing Λ.

2.1givenF1step 1.1algebra

Let z/s∈C1⊗ΛQ be a fraction-field cycle, with z∈C1 and 0≠s∈Λ. Since d1(z)/s=0 and each coordinate of C0 lies in the domain Λ, d1(z)=0. The torsion hypothesis gives 0≠f∈Λ and w∈C2 with fz=d2(w). Hence z/s=d2(w/(fs)), so every fraction-field 1-cycle is a boundary and H1(C∗⊗Q)=0.

2.2givenF1step 1.1algebra

Because ψ is onto a positive-rank free abelian group, some 1-cell generator x has ψ(x)=h≠1. Lift that oriented edge from the unique 0-cell to the universal-cover vertex; its cellular boundary is (x−1) times that vertex. Tensoring with the stated right action gives the corresponding d1 block A=ρ(x)h−Id. Its determinant is a polynomial in the distinct monomials 1,h,…,hd whose top coefficient is det⁡ρ(x)≠0, so det⁡A≠0 in Λ. Thus A is invertible over Q, this block makes d1:C1⊗Q→C0⊗Q surjective, and H0(C∗⊗Q)=0.

3.1F1step 2.1step 2.2algebra∎

The fraction-field chain dimensions are d(n−1),dn,d, whose alternating sum is d((n−1)−n+1)=0. Euler–Poincaré for this finite-dimensional complex gives dim⁡QH0−dim⁡QH1+dim⁡QH2=0. Steps 2.1 and 2.2 make the first two terms zero, hence H2=0; there are no chain groups above degree 2. The localized complex is acyclic.

Depends on

Used by

Dependency tree · two levels

16 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