Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 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 braid-axis torsion product gives the twisted Burau determinant

Statement

Assume the Axiom of Choice convention of the twisted-chain definition. Let β∈Bn be a geometric braid with n≥2 strands, let X be the compact exterior of its oriented closure, and let Y be the compact exterior of the closure together with the braid axis. Suppose finite based deficiency-one two-dimensional spine certificates are supplied for X and Y, with compatible cell bases for the filling decomposition X=Y∪TV, where T is the boundary torus and V≅D2×S1 is the filled solid torus. The certificate for X has generators g1,…,gn, where gi=x1⋯xi are cumulative positive meridians, and relators ri=gi−1β∗(gi) for 1≤i<n; the certificate for Y has generators g1,…,gn,x, where x is the axis meridian, and relators si=β∗(gi)(x−1gix)−1 for 1≤i≤n. The gluing certificate gives T its one-vertex cell structure with 1-cells x,gn and one commutator 2-cell, and gives V its one-vertex and one-core-edge structure, with compatible based cell bases. Assume these are actual compatible based spine and gluing certificates; an abstract group isomorphism or matching relator list alone is insufficient.

Let HL=H1(X;Z) have its ordered positive-meridian basis, let χ:HL↠H≅Zm be the declared color map with m≥1, and write ψ for the induced deck map. Let F be a field, let ρ:π1(X)→GLd(F) be a representation, and use the coefficient systems on Y,T,V pulled back or extended across the filling; thus x acts as the identity and the core gn of V acts by Mn=ρ(gn)ψ(gn). Put D=det⁡(Mn−Id) and assume D≠0. Compute the reduced colored Burau block B‾ρ(β) in the cumulative-meridian basis as in the finite procedure, and put N=det⁡(B‾ρ(β)−I(n−1)d). For the declared convention that torsion is zero on a nonacyclic fraction-field complex, if the twisted complex of X is acyclic then its torsion is represented by N/D modulo the exact determinant and deck-unit subgroup of the coefficient system. If the complex is nonacyclic then N=0 and τ(X)=N/D=0 in Q. The acyclic identity follows from the braid-axis filling product.

The diagram records only the supplied gluing certificate; it is schematic and is not a substitute for the cell or spine data.

TYV=D2£S1X=Y[TVinclusioninclusiongluealongTgluealongT

Facts & Assumptions

Given: AC; the actual compatible based spine and filling certificates; the full positive-meridian abelianization followed by the explicit color map; a field-valued representation of π1(X); and D≠0.

[A1]

The maximal-abelian-cover and twisted-chain conventions explicitly assume AC. The Axiom of Choice; Twisted chain complex and based Reidemeister torsion for link exteriors

[F1]

For a based acyclic twisted complex, torsion is the alternating determinant product in the cellular bases; nonacyclic torsion is defined to be zero. Twisted chain complex and based Reidemeister torsion for link exteriors

[F2]

For a certified deficiency-one exterior spine with torsion degree-one homology over the Laurent ring and an admissible deleted column, the Fox minor divided by its boundary determinant equals the based torsion class. The admissible Wada deleted minor equals based twisted torsion

[F3]

The finite braid procedure fixes the positive Artin convention, the cumulative meridians gi, the closure relators, the reduced Fox block B‾ρ(β), and the numerator and denominator N,D. Compute the twisted Burau determinant for a colored braid closure

[F4]

The closure and axis exteriors, their meridian generators, and the Artin action use the stated geometric braid and punctured-disk conventions; the assignment of generator automorphisms extends to a well-defined Artin representation and agrees with the geometric action on meridians; the standard positive puncture meridians form a free basis. The closure of a geometric braid; Artin automorphisms of the free group; The Artin representation on a free group; The geometric action on meridians is the Artin representation; Standard meridians of a punctured disk; The punctured-disk fundamental group is free on the standard meridians

[F5]

The based Fox block matrix is the cellular boundary matrix of the based presentation complex under the row-coefficient convention. The evaluated Fox Jacobian is the twisted cellular boundary

[F6]

The colored-braid algorithm forms the full positive-meridian basis before applying the declared map χ. Compute the twisted Burau determinant for a colored braid closure

[F7]

Filling the axis torus kills its meridian in the fundamental group, and the gluing fundamental group is determined by the inclusions of the common boundary torus. Seifert–van Kampen identifies the fundamental group with a group pushout; Knot exterior

[F8]

The Laurent coefficient ring is an integral domain embedded in its fraction field, so clearing a nonzero denominator in a free module is valid. The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain; Frac⁡(D) is a field and d↦d/1 embeds the integral domain D

[F9]

External relative-cellular gluing input. For the actual braid-axis filling X=Y∪T(D2×S1) with agreeing local coefficients, use finite CW representatives relative to the common boundary torus, with the based simple comparisons to the supplied exterior spines. The cellular inclusion and difference maps give the degreewise split exact gluing sequence. The based comparison is with those relative models, not with a core circle as a boundary-containing subcomplex. This is the geometric gluing/excision operation used in Conway, Burau Maps and Twisted Alexander Polynomials, arXiv:1510.06678v2, proof of Theorem 3.15, printed/PDF pp. 16–17; its based-chain multiplicativity is Proposition 2.4, printed/PDF p. 7. This finite relative-cellular comparison is an explicit external input, not a locally reconstructed relative-CW theorem. In the present proof the solid-torus comparison is additionally computed in step 3.1. The cellular operation applies after the declared color map as well: its degreewise splittings use individual lifted cells, so applying the coefficient representation preserves exactness; the only inverse needed in the solid-torus computation is the assumed invertible Mn−Id. No acyclicity is assumed before that specialization. Conway, Proposition 2.4 and proof of Theorem 3.15

Proof

1.1A1givenF3F4F6F7

Let α(g)=ρ(g)ψ(g) denote the coefficient matrix. Under [A1], the supplied filling certificate and [F7] identify π1(X) as the quotient of π1(Y) that kills the axis meridian x. Pulling the coefficient system back from X therefore gives α(x)=Id and ψ(x)=1; the core of V is represented on T by gn, with matrix Mn. The algorithm forms the full positive-meridian basis on X before applying χ, while the compatible filling certificate specifies the resulting pulled-back or extended coefficient systems on Y,T,V and makes them agree on overlaps. The map π1(Y)→π1(X) is surjective, so the pulled-back deck map on Y is still onto and the coefficient-unit images for the two exteriors agree. Since D≠0, Mn−Id is invertible.

2.1F1F5step 1.1algebra

First compute the core-circle spine Vcore with one 0-cell and one 1-cell for gn. Its twisted boundary is Mn−Id, so this core complex is acyclic and its torsion is D−1. This core is not used as a CW pair containing T; a separate relative model and its torsion comparison are established before applying the gluing sequence. Give T the standard one-vertex CW structure with 1-cells x,gn and one commutator 2-cell xgnx−1gn−1. The Fox boundary blocks are d1=(0,Mn−Id)T and d2=(Id−Mn,0): hence d1 is onto, d2 is injective onto ker⁡d1, and T is acyclic. In the torsion determinant product, the factors det⁡(Id−Mn) and det⁡((Mn−Id)−1) cancel up to (−1)d, so τ(T)=(−1)d.

2.2F3F5step 1.1algebra

For X, Fox differentiation of ri=gi−1β∗(gi) gives block row Mi−1(B~i,∗−ei), where ei is the ith identity block row and Mi=ρ(gi)ψ(gi). Thus, after deleting the gn column, the Fox block is diag⁡(M1−1,…,Mn−1−1)(B‾ρ(β)−I), whose determinant is (∏i=1n−1det⁡(Mi−1))N. The prefactor is a nonzero coefficient unit. The d1 block for gn is Mn−Id, which is invertible, so d1 is onto and projection from ker⁡d1 to the first n−1 coordinate blocks is an isomorphism. By [F5], the projected d2 is the displayed deleted Fox block. Therefore N≠0 implies d2 injective and, by dimensions and d1d2=0, the complex is acyclic; if the complex is acyclic, the same projection makes d2 injective and forces N≠0. Hence nonacyclicity is equivalent to N=0.

3.1F1F5givenstep 1.1step 2.1constructalgebra

Give D2 its boundary vertex, boundary edge x, and meridian disk cell a, and give S1 its vertex and core edge gn. Their product is a finite CW model Vrel of the actual solid torus containing exactly the specified torus CW structure as its boundary subcomplex. Besides the cells of T, it has the 2-cell a×{∗}, still denoted a, and the 3-cell b=a×gn. Put A=Mn−Id and let q denote the torus 2-cell, with the orientation in step 2.1. For a coefficient row v, the product boundaries are ∂a(v)=x(v),∂q(v)=x(−vA),∂b(v)=q(v)+a(vA). The first formula is the meridian disk boundary, the second is the torus Fox boundary from step 2.1, and the third is the oriented boundary of disk times core edge; its two terms have cancelling images under ∂. Replace the degree-two block q(v) by q′(v)=q(v)+a(vA). This block-triangular basis change has determinant one, ∂q′=0, and ∂b(v)=q′(v). Split off the unit two-term pair (b,q′), then the unit pair (a,x). The remaining based complex is exactly the core complex with ∂gn(v)=vA. Each split pair has identity incidence and torsion one up to the sign unit, and the triangular change contributes determinant one. Hence Vrel has the same homology and torsion class as Vcore, so it is acyclic and its torsion is D−1 up to the declared units. This calculation supplies the missing based comparison while retaining T in the actual gluing model.

4.1F9givenstep 2.1step 3.1algebra

Use the relative-cellular gluing operation [F9] for the actual decomposition in the supplied certificate. For V use Vrel from step 3.1, not its core spine. For the exterior pieces the operation uses the compatible relative CW representatives and the supplied based simple-spine comparisons. Equivalently, a boundary map into a spine is represented by its finite cellular mapping cylinder: each added prism over a torus cell pairs with its source face, with lifted incidence a unit; these pairs are removed in decreasing cell dimension. Their torsion changes lie in the declared unit subgroup. Thus the based torsion classes used below are those of the supplied spines, without identifying the boundary torus with a subcomplex of a core circle or of an abstract presentation. In the common relative models each cell of T occurs in both pieces, and each other cell occurs in exactly one. Inclusion into the first piece and its negative into the second, followed by the difference quotient to the union, therefore give the degreewise split short exact sequence 0⟶C∗(T)⟶C∗(Yrel)⊕C∗(Vrel)⟶C∗(Xrel)⟶0. Choose the shared lifts compatibly; any permitted adjustment changes only the declared determinant/deck units. Since T and Vrel are acyclic by steps 2.1 and 3.1, the long exact homology sequence identifies H∗(Y;Qd) with H∗(X;Qd). Thus Y is acyclic exactly when X is. Subsequent references to the gluing sequence mean these relative models and their certified based comparisons.

5.1F1step 2.1step 4.1algebra

In the acyclic case, choose boundary bases in the short exact sequence compatibly: lift a basis of each quotient boundary space, append a basis of the subcomplex boundary space, and lift the resulting boundary bases to chain groups. The change-of-basis matrices are block triangular with diagonal blocks the matrices for the subcomplex and quotient, so their determinants multiply degree by degree; the alternating torsion product therefore gives τ(Y)τ(V)=±τ(T)τ(X). As τ(T)=±1 and both signs lie in the declared unit subgroup, step 2.1 yields τ(Y)≐τ(X)D.

5.2givenF1F8step 4.1algebra

Suppose X and hence Y are acyclic over Q. The finite based chain modules over Λ=F[H] are free. If z∈C1(Y;Λd) is a 1-cycle, acyclicity over Q gives z/1=d2(y)/s for some y∈C2(Y;Λd) and nonzero s∈Λ. By [F8], equality in the fraction field means that some nonzero u∈Λ annihilates sz−d2(y); since C1(Y;Λd) is free over the domain Λ, multiplication by u is injective, so sz=d2(y). Every degree-one homology class is therefore killed by a nonzero element of Λ.

6.1F2F3F5step 5.2algebra

Apply [F2] to the certified spine of Y and delete the gn column, whose denominator is D≠0. For si=β∗(gi)(x−1gix)−1, the g1,…,gn Fox blocks evaluate to B~−I, where B~ is the full cumulative-meridian Fox matrix, and the x-column blocks are Id−Mi with Mi=ρ(gi)ψ(gi). Because β∗(gn)=gn, the last row of B~−I is zero; after deleting its gn column, the remaining matrix has upper-left block B‾ρ(β)−I, arbitrary upper-right block, zero lower-left block, and lower-right block Id−Mn. It is block upper triangular, so its determinant is (−1)dND. Dividing by D gives (−1)dN, which represents N modulo the sign unit. Consequently τ(Y)≐N.

7.1F1step 5.1step 6.1step 2.2algebra∎

If the complex is acyclic, combine steps 5.1 and 6.1 to obtain τ(X)D≐N, hence τ(X)≐N/D. If it is nonacyclic, step 2.2 gives N=0, and the declared convention sets τ(X)=0=N/D. This proves the statement in both branches.

Depends on

Used by

Dependency tree · two levels

78 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