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 Alexander polynomial from the zeroth elementary ideal
Definition
Assume the Axiom of Choice, so that the Alexander module of an oriented nonempty link is defined and finitely presented over (The one-variable Alexander module of an oriented link, The Alexander module of a link complement is finitely presented). Let be the number of components of . Define the one-variable Alexander polynomial to be a greatest common divisor of the zeroth elementary ideal (Elementary ideals of a finitely presented module), i.e. a generator of the smallest principal ideal of containing (The Laurent polynomial ring is Noetherian and a unique factorisation domain, Unique factorisation domain); it is well defined up to multiplication by a unit of (Units, powers and the domain property of the Laurent polynomial ring). The Alexander invariant is the normalisation understood for a knot as an element of the fraction field of when ; for the integer-valued link formulas of this page the distinction matters and is stated with each use.
Caveats. The ideal is a well-defined invariant of because is finitely presented and elementary ideals are independent of the presentation (Elementary ideals are independent of the presentation); a greatest common divisor in a unique factorisation domain is well defined up to units, and the units of are . For every link the absolute one-variable Alexander module admits a square presentation, so is principal, generated by its determinant (the standard link fact recorded in [F3]). For a knot (), every gcd representative satisfies . These standard presentation and normalisation facts are recorded here; the gcd definition itself uses only finite presentability and unique factorisation.
Facts & Assumptions
Given: AC and an oriented link with components, its Alexander module over and its zeroth elementary ideal . No other choice principle is used.
is a finitely generated -module, hence finitely presented, and is therefore defined and independent of the presentation (The Alexander module of a link complement is finitely presented, Elementary ideals of a finitely presented module, Elementary ideals are independent of the presentation).
is a unique factorisation domain with units exactly , ; in a unique factorisation domain a greatest common divisor of a nonempty set of elements exists and is well defined up to multiplication by a unit (The Laurent polynomial ring is Noetherian and a unique factorisation domain, Unique factorisation domain, Units, powers and the domain property of the Laurent polynomial ring).
Literature input. For every oriented link, the absolute one-variable Alexander module has a square presentation (Burde–Zieschang, section 9.18, pp. 135–136); the connected-Seifert-surface presentation is (Exercise 9.5, p. 140). Thus its zeroth elementary ideal is the principal determinant ideal, including the zero ideal when the determinant vanishes. For a knot with a Seifert matrix , the square matrix presents the absolute Alexander module (Burde–Zieschang, Theorem 8.8, p. 110). Its determinant at is in their canonical surface basis (Proposition 8.11, p. 112); hence is principal and every gcd representative has . The indexing is essential because is absolute homology: for one has and . This is the standard normalisation of the Alexander polynomial (Burde–Zieschang, Theorem 8.8 and Proposition 8.11; locators in the references); it is recorded here and not used in the proofs of this page.
Proof
Well-definedness of . By [F1] the ideal is an invariant of and is a UFD; write for a finite nonempty generating family (possible since is Noetherian; use the single generator for the zero ideal) and choose a greatest common divisor of , whose existence in a UFD is [F2]. Then is the smallest principal ideal containing : it contains every , hence , and any principal ideal contains all , so by the defining property of the gcd, hence . Replacing by a unit multiple gives the same ideal, and by [F2] these are exactly the other choices. The normalisation is then defined by the displayed formula, with the fraction understood in the fraction field of the domain when and .
The knot normalisation. For the quoted standard fact [F3] identifies the normalisation of the Alexander polynomial used in the Burau comparison: with for every unit choice; for no division is performed and . Both statements are part of the definition of the invariant used on this page.
Depends on
- The one-variable Alexander module of an oriented link
- Elementary ideals of a finitely presented module
- Elementary ideals are independent of the presentation
- The Alexander module of a link complement is finitely presented
- The Laurent polynomial ring is Noetherian and a unique factorisation domain
- Unique factorisation domain
- Units, powers and the domain property of the Laurent polynomial ring
- The Axiom of Choice
Used by
- The Burau determinant for a two-strand torus link Example
- The deficiency-one Fox calculus rule for the Alexander invariant Lemma
- The Burau determinant recovers the Alexander polynomial of a closed braid Proposition
- The Alexander polynomial is an oriented link invariant Theorem
- The Burau determinant formula for a closed braid and its axis Theorem
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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 4.2 equation (15) and section 4.4 (the Alexander polynomial, its normalisation and the Burau determinant formula) (standard reference, not scraped)
- Burde and Zieschang, Knots, second edition (2003), Theorem 8.8, Proposition 8.11, section 9.18 and Exercise 9.5, printed pp. 110, 112, 135-136 and 140 (absolute one-variable square presentations for knots and links; knot determinant at t=1) (standard reference, not scraped)
- John Milnor, Infinite cyclic coverings, Conference on the Topology of Manifolds (1968), 115-133 (the Alexander module, its elementary ideals and the Alexander polynomial) (standard reference, not scraped)