Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 Seifert determinant is the knot Alexander polynomial

Statement

Assume the full Axiom of Choice. Let K⊂S3 be a smooth oriented knot, and let F⊂S3 be a connected compact smooth oriented embedded surface whose oriented boundary is K, with χ(F)=1−2g. Choose an ordered integral basis a1,…,a2g of H1(F;Z) and use the positive normal convention Vij=lk⁡(ai+,aj). Let AK be the first homology of the infinite cyclic cover of S3∖K classified by total linking, with t acting by the positive-meridian deck transformation. Let ΔK(t) be the generator of the zeroth elementary ideal E0(AK) in Λ=Z[t±1], and write p≐q when p and q differ by a unit ±tk of Λ. Then for every such F and basis,

det⁡(V−tVT)≐ΔK(t).

The determinant is 1 for the empty 0×0 matrix when g=0. This formula concerns the polynomial ΔK; the existing knot-normalized fraction DK=ΔK/(1−t) is a separate invariant.

Facts & Assumptions

Given: Full AC, a smooth oriented knot K⊂S3, a connected compact smooth oriented spanning surface F, and an ordered integral basis of H1(F;Z).

[A1]

Full AC is the choice-function axiom; it is the stated hypothesis of the Alexander-module and Seifert-matrix presentation suppliers. (The Axiom of Choice)

[F7]

Full AC implies DC and hence the Axiom of Countable Choice, which is the stated choice hypothesis of the Seifert-surface supplier. (AC implies DC implies countable choice, The Axiom of Countable Choice (ACω))

[F1]

The surface has the specified oriented boundary, and its positive-push matrix is Vij=lk⁡(ai+,aj). (Oriented Seifert surfaces in the three-sphere, Seifert pairing and matrix of an oriented knot)

[F2]

With the same positive normal and positive-meridian deck convention, AK≅coker⁡(V−tVT) over Λ. (A Seifert matrix presents the one-variable Alexander module)

[F3]

For every such matrix, E0(AK)=(det⁡(V−tVT)) and det⁡(V−VT)=±1. (The square Seifert presentation generates the knot Alexander polynomial)

[F5]

Under an orientation-preserving ambient isotopy of knot-surface pairs, the transported Seifert matrix is unchanged and any other target basis changes it by V′=PTVP with P∈GL2g(Z). (Seifert matrices of ambient-isotopic pairs are S-equivalent)

[F6]

The Alexander modules of orientation-preserving ambient-isotopic links are isomorphic, so their Alexander polynomials agree up to a unit. (The Alexander polynomial is an oriented link invariant)

Proof

1.1A1F7F2F3F4givenalgebra

Fix the arbitrary knot, surface, and basis in the Statement, put n=2g, and set M=V−tVT. By [F2] the cokernel of M is AK, and [F3] gives E0(AK)=(det⁡M). By [F4], ΔK also generates this ideal. The local lemma gives (det⁡M)(1)=±1, so det⁡M≠0. If ΔK=adet⁡M and det⁡M=bΔK for a,b∈Λ, then det⁡M=badet⁡M; since Λ is a domain and det⁡M≠0, ba=1. Thus a is a unit, and [F4] identifies it as ±tk. Hence det⁡M≐ΔK.

2.1F1F5F6step 1.1givenalgebra∎

If the basis is changed by P∈GLn(Z), then M′=PTMP and det⁡M′=(det⁡P)2det⁡M=det⁡M. Under an orientation-preserving ambient isotopy, [F5] gives the same transported-matrix relation and [F6] preserves ΔK up to a unit. Since the original K,F, and basis were arbitrary, the formula holds for every surface and basis in the Statement and is compatible with the oriented knot invariant.

Depends on

Used by

Dependency tree · two levels

73 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