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.
Cyclic-cover homology order from the Alexander polynomial
Statement
Assume the Axiom of Choice. Let be a smooth oriented knot and let . If is any primitive -th root of unity, then is finite exactly when for every , and in that case
Statement references
The root-product test and proof for cyclic-cover homology
The Alexander polynomial normalization
The definition and genus convention for a Seifert surface
Rolfsen, Knots and Links, Chapter 8.D
Livingston, “Seifert Forms and Concordance,” Theorem 3.1
Existence of a connected compact oriented Seifert surface for every knot
The compact surface normal form and free fundamental group
The positive-push Seifert matrix convention
First homology is the abelianization of the fundamental group
Facts & Assumptions
Given: Full AC, a smooth oriented knot , and .
Full AC is the choice-function axiom required by the root-product lemma. The Axiom of Choice
The root-product lemma gives the finiteness criterion and order for any primitive -th root. Root-product test for cyclic branched-cover homology
is defined up to multiplication by . The Alexander polynomial from the zeroth elementary ideal
Full AC supplies the countable-choice hypotheses used by the surface-existence and surface-normal-form results: apply its choice function to the range of any sequence of nonempty sets and reuse the selected element at each index. Thus the sequence assertions in The Axiom of Countable Choice () and The countable-choice principle used in the foliation pair hold. The Axiom of Choice
Every smooth oriented knot bounds a connected compact smooth oriented embedded surface with its given boundary, which is a Seifert surface under Oriented Seifert surfaces in the three-sphere. Every smooth oriented knot in bounds a Seifert surface For a connected compact oriented surface with one boundary component and genus , the fundamental group is free of rank . Finite surface normal forms, Jordan disks, and torsion control
A connected smooth surface is locally path-connected, so its path components are open and it is path-connected. The first Hurewicz map identifies with the abelianization of ; for the genus- surface in [F4], this gives and an ordered integral basis. The first Hurewicz map is abelianization
Proof
Given: The data in the Statement and Facts & Assumptions.
By [F3]--[F5], choose a connected compact smooth oriented Seifert surface for and an ordered integral basis of . Let be its positive-push Seifert matrix as defined in Seifert pairing and matrix of an oriented knot. The hypotheses of [F1] then hold for this , and the selected primitive root . Hence it gives the stated nonvanishing criterion and product formula for this root.
If is another primitive -th root, then for some integer relatively prime to . Multiplication by permutes the nonzero residue classes modulo , so the nonvanishing conditions and the product over are unchanged.
Depends on
- Cyclic branched cover of a knot
- The Alexander polynomial from the zeroth elementary ideal
- Root-product test for cyclic branched-cover homology
- Oriented Seifert surfaces in the three-sphere
- Seifert pairing and matrix of an oriented knot
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The countable-choice principle used in the foliation pair
- Finite surface normal forms, Jordan disks, and torsion control
- The first Hurewicz map is abelianization
- Every smooth oriented knot in $S^3$ bounds a Seifert surface
- The Axiom of Choice
Used by
Dependency tree · two levels
75 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)