Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Trefoil torsion from its torus spine and colored Burau block

Example

Assume the Axiom of Choice. Let K be the positively oriented trefoil, the closure of the positive two-strand braid σ13, and use the trivial one-dimensional representation and the single-color deck map sending each positive meridian to t. Use the standard genus-one Heegaard decomposition of S3 with K the (2,3) curve on the splitting torus. Its two exterior pieces are solid tori meeting in an annulus whose core maps with degrees 2 and 3 to their oriented cores; the associated based simple-spine certificate has one vertex, core generators a,b, and one 2-cell with attaching word a2b−3. The full abelianization sends a to t3 and b to t2. Deleting the a column in this spine gives Wada quotient −(t4+t2+1)/(t3−1)=(t2−t+1)/(1−t). In the cumulative-meridian basis, the reduced colored Burau block for σ1 is [−t], so for σ13 it is [−t3]; its numerator and boundary denominator are −(t3+1) and t2−1. Their quotient is also (t2−t+1)/(1−t), the twisted torsion value for this based spine up to the declared units. Interpreting that ratio as the output of the full braid-axis procedure additionally requires the compatible axis-exterior and filling certificate in the procedure hypotheses.

The braid portion shown below uses the positive crossing convention from the colored procedure. The closure joins bottom endpoint i to top endpoint i; because the endpoint permutation is a transposition, the closure is one component.

1212

Facts & Assumptions

Given: AC; the standard genus-one splitting and (2,3) torus-knot certificate; the trivial representation; the positive-meridian deck map; and the positive braid convention.

[A1]

AC is inherited from the maximal-abelian-cover and twisted-chain conventions. The Axiom of Choice; Twisted chain complex and based Reidemeister torsion for link exteriors

[F1]

For an admissible deficiency-one exterior-spine column, the Wada quotient is the deleted Fox minor divided by det⁡(ρ(xj)ψ(xj)−I). The admissible Wada quotient of a deficiency-one exterior spine

[F2]

The based torsion uses the declared acyclic fraction-field determinant convention and is invariant under certified simple spine changes modulo determinant and deck units. Twisted chain complex and based Reidemeister torsion for link exteriors; A certified knot-spine Wada quotient equals twisted Reidemeister torsion

[F3]

The braid procedure uses σ1(x1)=x1x2x1−1, σ1(x2)=x1, the cumulative basis g1=x1, g2=x1x2, and the reduced block obtained from the evaluated Fox Jacobian. Compute the twisted Burau determinant for a colored braid closure

[F4]

Seifert–van Kampen computes the group of a union from the two solid-torus pieces and their annular intersection. Seifert–van Kampen identifies the fundamental group with a group pushout

[F5]

The colored Burau formula identifies the procedure value with exterior torsion only when the compatible based spine and axis-filling certificates are supplied. The colored twisted Burau procedure computes exterior torsion

[F6]

The positive meridian generates the first homology of a knot exterior. Homology and preferred longitude of a knot exterior; Meridian and preferred longitude

[F7]

In the standard torus-knot construction, the finite complex Xm,n is the union of mapping cylinders of the degree-m and degree-n maps of a circle, and the compact exterior is the mapping cylinder of a map from the boundary torus to Xm,n. Hatcher, §1.2, Example 1.24

Proof

1.1A1givenF4F7constructalgebra

Under [A1], let A be the annulus left on the Heegaard torus after removing an open annular neighborhood of the (2,3) curve. The torus-knot model identifies its core with the common source circle c in the finite spine X=M2∪cM3, where M2 and M3 are mapping cylinders of the degree-two and degree-three maps of a circle and their target core circles are a and b. By [F7], the compact exterior is the mapping cylinder of an explicit map from its boundary torus to X. Choose finite cell structures compatible with this map and the two degree maps, with circle vertices vc,va,vb and cylinder edges ea:vc→va, eb:vc→vb; take vc as basepoint. In the resulting exterior mapping-cylinder CW structure, each prism over a boundary-torus cell σ pairs with its unglued face σ×{0}; removing these pairs in decreasing cell dimension gives a finite sequence of elementary collapses onto X, fixing X and vc. Thus this specific exterior-to-X equivalence is simple. The natural CW structure on X has these three vertices, edges a,b,c,ea,eb, and 2-cells with based words eaa2ea−1c−1 and ebb3eb−1c−1. The two connecting edges form a maximal tree. Contract it to obtain a based presentation complex X‾: this contraction is simple, as can be seen by moving the loops and attaching paths at each terminal vertex across its connecting edge by cellular edge slides, then collapsing that edge with the now free terminal vertex. Each cellular slide is realized by an elementary expansion followed by an elementary collapse; the root vc is fixed. After the two contractions, X‾ has one vertex, edges a,b,c, and 2-cells λ2,λ3 attached by r2=a2c−1 and r3=b3c−1. Work in X‾ for the following further simple changes. Slide λ3 over the oppositely oriented λ2, replacing its attaching word by r3r2−1=(b3c−1)(a2c−1)−1=b3a−2. This elementary based 2-cell slide removes c from that attaching map. The edge c now occurs exactly once in the boundary of λ2 and nowhere else, so (c,λ2) is a free 1- and 2-cell pair and collapses. Reversing the orientation of the remaining 2-cell gives the attaching word a2b−3. Thus the resulting one-vertex complex with core edges a,b and one 2-cell is based simple-homotopy equivalent to the chosen compact exterior and supplies the required certificate.

2.1F6step 1.1algebra

The abelianization of this spine has generators [a],[b] and relation 2[a]−3[b]=0. By [F6], the positive meridian class [m] generates H1(EK;Z)≅Z. Write [a]=p[m] and [b]=q[m]; the relation gives 2p=3q, and a,b generate the abelianization, so gcd⁡(p,q)=1. Hence (p,q)=(3,2) or (−3,−2); orient the two core generators consistently with the positive meridian to choose (3,2). Thus the full positive-meridian deck map sends a↦t3 and b↦t2.

3.1F1step 2.1algebra

For r=a2b−3, the Fox product and inverse rules give ∂r/∂a=1+a and ∂r/∂b=−a2(b−1+b−2+b−3). Evaluating at a=t3, b=t2 gives 1+t3 and −(t4+t2+1). The a denominator is t3−1≠0, so the deleted-a quotient is −(t4+t2+1)/(t3−1). Factoring t4+t2+1=(t2+t+1)(t2−t+1) and t3−1=(t−1)(t2+t+1) reduces it to (t2−t+1)/(1−t).

3.2F1F3step 2.1induction

In the cumulative basis, g1=x1 and g2=x1x2. The positive Artin rule gives σ1(g1)=g2g1−1 and fixes g2. The Fox row of g2g1−1 is (−g2g1−1,1), which evaluates to (−t,1) under the trivial representation and equal strand colors; the fixed boundary word contributes the second row (0,1). Therefore the reduced block for σ1 is [−t]. For automorphisms β,γ of the free group, the product and inverse recursions imply ∂(β(u))/∂gj=∑kβ(∂u/∂gk) ∂(β(gk))/∂gj: it holds for generators and inverses, and the product rule extends it to every word by induction. After evaluation, the braid-preserved color map makes coefficient substitution by β leave the coefficients unchanged, so the full Fox matrices compose by matrix multiplication; their block form has bottom row (0,1), so the reduced scalar blocks multiply. The two strands close to one component, hence this coloring is preserved, and the reduced block for σ13 is [−t]3=[−t3].

4.1F1step 3.1algebra

The fraction-field d1 has the invertible block t3−1, so it is onto. The deleted Fox minor from step 3.1 is nonzero, so d2 is injective; since the chain dimensions are 1,2,1 and d1d2=0, its image is the one-dimensional kernel of d1. The complex is acyclic. Moreover, any Laurent-ring 1-cycle becomes a boundary over Q(t); clearing its denominator and using that the chain module is free over the domain Q[t±1] shows that the cycle's homology class is annihilated by a nonzero Laurent polynomial. Thus the degree-one Laurent-ring homology is torsion, and the hypotheses of the exterior-spine Wada theorem hold.

5.1F2step 3.1step 4.1

Apply [F2] to the certified spine and admissible a column. Its Wada quotient from step 3.1 represents the twisted torsion class. This identifies the displayed rational function with the torsion computed from the torus-spine certificate.

6.1F1F5step 3.2step 3.1algebra∎

The Burau numerator and boundary denominator are N=det⁡([−t3]−[1])=−(t3+1) and D=t2−1. Hence N/D=−(t3+1)/(t2−1)=−((t+1)(t2−t+1))/((t−1)(t+1))=(t2−t+1)/(1−t). This is exactly the quotient in step 3.1, so the finite determinant calculation equals the based-spine torsion value. If the compatible axis-filling certificate is supplied as well, [F5] identifies the same ratio with the procedure output.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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