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.
Twisted chain complex and based Reidemeister torsion for link exteriors
Definition
Assume the Axiom of Choice as in the maximal-abelian-cover convention. Let be a nonempty oriented smooth link, with , compact exterior formed by deleting the interiors of pairwise-disjoint chosen closed normal-disk tubes, and basepoint . For a knot, and . The full meridian abelianization group is , with the positive normal-disk meridians as its ordered basis. Choose a finite-rank free abelian group of positive rank and an epimorphism ; write for the induced map from . The identity choice is the full multivariable deck map; a coloring may identify its variables only through the explicitly stated map . Let be a field, let , and let be a representation. Put , the commutative Laurent-polynomial ring with monomial basis , and . On row vectors define the right action by , where is central multiplication by its monomial in . For a chosen finite based CW structure on , orient and order its cells and choose one lift of each cell to the universal cover . The twisted cellular complex is
and its fraction-field complex is . The lifted cell bases and the standard coordinate basis of give the based -vector-space bases. If this fraction-field complex is not acyclic, define its twisted torsion to be . If it is acyclic, choose in each degree a basis of and lifts of under ; with the based cellular basis, set
where brackets denote the determinant of the change-of-basis matrix. The twisted Reidemeister torsion is this value modulo the subgroup . This exact determinant image is contained in the commonly used coarser unit subgroup . The choice-free statement uses the full abelianization chain model first and specializes it only by the declared coefficient map .
Depends on
- Knot exterior
- Meridian and preferred longitude
- The maximal-abelian-cover Alexander module of an oriented link
- The maximal abelian cover retracts onto the cover over the compact link exterior
- The group ring $R[G]$ of finitely supported formal $R$-linear combinations of group elements
- The group ring $R[G]$ is a unital $R$-algebra with basis $G$, and each $g\in G$ is a unit of $R[G]$
- The field of fractions $\operatorname{Frac}(D)=(D\setminus\{0\})^{-1}D$ of an integral domain
- The Axiom of Choice
Used by
- Compute the twisted Burau determinant for a colored braid closure Algorithm
- A zero Wada denominator makes that deleted column inadmissible Counterexample
- Adjoint-twisted homology and Culler-Shalen data Definition
- Character-variety logarithmic slope Definition
- Integral half-solutions, Strebel classes, and L²-signatures Definition
- The admissible Wada quotient of a deficiency-one exterior spine Definition
- Trefoil torsion from its torus spine and colored Burau block Example
- Baldwin–Sivek instanton-surgery and Newton-polygon input module Lemma
- Based twisted torsion changes only by determinant and deck units Lemma
- The evaluated Fox Jacobian is the twisted cellular boundary Lemma
- Torsion first homology forces twisted acyclicity for a deficiency-one exterior spine Lemma
- Torsion first homology makes the localized exterior spine complex acyclic Lemma
- A certified knot-spine Wada quotient equals twisted Reidemeister torsion Theorem
- The admissible Wada deleted minor equals based twisted torsion Theorem
- The braid-axis torsion product gives the twisted Burau determinant Theorem
- The colored twisted Burau procedure computes exterior torsion Theorem
Dependency tree · two levels
35 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
- Anthony Conway, Burau Maps and Twisted Alexander Polynomials, §§2.2–2.4 and 3.3 (standard reference, not scraped)
- Paul Kirk and Charles Livingston, Twisted Alexander Invariants, Reidemeister Torsion, and Casson–Gordon Invariants, §§2.1–3 (standard reference, not scraped)
- Andrew Ranicki, Notes on Reidemeister Torsion, Definitions 4 and 6 (standard reference, not scraped)