Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generated
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 AL of an oriented nonempty link L is defined and finitely presented over Λ=Z[t±1] (The one-variable Alexander module of an oriented link, The Alexander module of a link complement is finitely presented). Let r be the number of components of L. Define the one-variable Alexander polynomial ΔL(t)∈Λ to be a greatest common divisor of the zeroth elementary ideal E0(AL) (Elementary ideals of a finitely presented module), i.e. a generator of the smallest principal ideal of Λ containing E0(AL) (The Laurent polynomial ring is Noetherian and a unique factorisation domain, Unique factorisation domain); it is well defined up to multiplication by a unit ±tk of Λ (Units, powers and the domain property of the Laurent polynomial ring). The Alexander invariant is the normalisation DL(t):={ΔL(t),r>1,ΔL(t)1−t,r=1, understood for a knot as an element of the fraction field of Λ when (1−t)∤ΔL(t); for the integer-valued link formulas of this page the distinction matters and is stated with each use.

Caveats. The ideal E0(AL) is a well-defined invariant of L because AL 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 ±tk. For every link the absolute one-variable Alexander module admits a square presentation, so E0(AL) is principal, generated by its determinant (the standard link fact recorded in [F3]). For a knot (r=1), every gcd representative satisfies ΔL(1)=±1. 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 L with r components, its Alexander module AL over Λ=Z[t±1] and its zeroth elementary ideal E0(AL). No other choice principle is used.

[F1]

AL is a finitely generated Λ-module, hence finitely presented, and E0(AL) 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).

[F2]

Λ is a unique factorisation domain with units exactly ±tk, k∈Z; 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).

[F3]

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 VT−tV (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 V, the square matrix VT−tV presents the absolute Alexander module (Burde–Zieschang, Theorem 8.8, p. 110). Its determinant at t=1 is 1 in their canonical surface basis (Proposition 8.11, p. 112); hence E0(AL) is principal and every gcd representative has ΔL(1)=±1. The E0 indexing is essential because AL is absolute homology: for AL=Λ/(p) one has E0=(p) and E1=Λ. 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

1.1F1F2

Well-definedness of ΔL. By [F1] the ideal E0(AL)⊆Λ is an invariant of L and Λ is a UFD; write E0(AL)=(g1,…,gm) for a finite nonempty generating family (possible since Λ is Noetherian; use the single generator 0 for the zero ideal) and choose a greatest common divisor g of g1,…,gm, whose existence in a UFD is [F2]. Then (g) is the smallest principal ideal containing E0(AL): it contains every gi, hence E0, and any principal ideal (h)⊇E0 contains all gi, so h∣g by the defining property of the gcd, hence (g)⊆(h). Replacing g by a unit multiple ±tkg gives the same ideal, and by [F2] these are exactly the other choices. The normalisation DL is then defined by the displayed formula, with the fraction understood in the fraction field of the domain Λ when r=1 and (1−t)∤ΔL(t).

2.1F2F3step 1.1∎

The knot normalisation. For r=1 the quoted standard fact [F3] identifies the normalisation of the Alexander polynomial used in the Burau comparison: DL=ΔL/(1−t) with ΔL(1)=±1 for every unit choice; for r>1 no division is performed and DL=ΔL. Both statements are part of the definition of the invariant used on this page.

Depends on

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