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.
Root-product test for cyclic branched-cover homology
Statement
Assume the Axiom of Choice. Let be a smooth oriented knot, let be a connected compact oriented Seifert surface of genus , and let be its positive-push Seifert matrix in an ordered integral basis of . Write for the Alexander polynomial normalized up to multiplication by , and let with a primitive -th root of unity. Then is finite if and only if for every , and, when it is finite,
The same criterion and order hold when is replaced by .
Statement references
Cyclic branched-cover homology as Alexander-module coinvariants
The Seifert-matrix presentation of the Alexander module
The Seifert determinant represents the Alexander polynomial
The Seifert matrix skew part is unimodular surface intersection
The determinant criterion for a square integer presentation
Facts & Assumptions
Given: Full AC, , and the primitive root in the Statement.
Full AC is the choice-function axiom required by the cyclic-cover definition and coinvariant lemma. The Axiom of Choice
, where is the infinite-cyclic-cover Alexander module with positive-meridian deck action . Homology of a cyclic branched cover as Alexander-module coinvariants
has presentation over . A Seifert matrix presents the one-variable Alexander module
is the matrix of the integral intersection form on , hence has determinant . The skew part of a Seifert matrix is the surface intersection form
represents up to multiplication by . The Seifert determinant is the knot Alexander polynomial
The cokernel of a square integer matrix is finite exactly when its determinant is nonzero, and then its order is the absolute determinant. Finiteness and order of the cokernel of a square integer matrix
Proof
Given: The data in the Statement and Facts & Assumptions. Put and .
Quotienting the module presentation in [F2] by gives as abelian groups. The group is free abelian of rank on for and , so this map is represented by a square integer matrix .
After tensoring with , multiplication by on is diagonalizable: its eigenvalues are the distinct roots for , each with one-dimensional eigenspace. On the corresponding -dimensional summand, acts by . Therefore . The factor is by [F3]. Thus exactly when every factor with is nonzero, and its absolute value is the product of the absolute values of those factors.
By [F1], the group in question is . Applying [F5] shows it is finite exactly when , with order ; if any nontrivial-root factor vanishes, the square integer cokernel has positive free rank and is infinite.
By [F4], for some integer . At every root of unity, , so . Hence the determinant-root criterion and product from step 3.1 give exactly the Alexander-polynomial criterion and order in the Statement, including the empty-matrix case .
Depends on
- Cyclic branched cover of a knot
- Oriented Seifert surfaces in the three-sphere
- Seifert pairing and matrix of an oriented knot
- Homology of a cyclic branched cover as Alexander-module coinvariants
- The Alexander polynomial from the zeroth elementary ideal
- A Seifert matrix presents the one-variable Alexander module
- The Seifert determinant is the knot Alexander polynomial
- The skew part of a Seifert matrix is the surface intersection form
- Finiteness and order of the cokernel of a square integer matrix
- The Axiom of Choice
Used by
Dependency tree · two levels
62 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
- Dale Rolfsen, Knots and Links (standard reference, not scraped)
- Charles Livingston, Seifert Forms and Concordance (standard reference, not scraped)
- Jozef H. Przytycki and Akira Yasuhara, Linking Numbers in Rational Homology 3-Spheres, Cyclic Branched Covers and Infinite Cyclic Covers (standard reference, not scraped)