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.

Knot determinant is the order of double-cover homology

Statement

Assume the Axiom of Choice. Let K be a smooth oriented knot with Alexander polynomial ΔK(t) normalized up to multiplication by ±tk. Then H1(Σ2(K);Z) is finite if and only if ΔK(−1)≠0, and in that case

∣H1(Σ2(K);Z)∣=∣ΔK(−1)∣.

Moreover, ΔK(−1) is odd, so the first homology of every double branched cover is finite.

Facts & Assumptions

Given: Full AC and a smooth oriented knot K.

[A1]

Full AC is the choice-function axiom required by the cyclic branched-cover definition and Seifert determinant presentation. The Axiom of Choice

[F1]

For a positive-push Seifert matrix V, H1(Σ2(K);Z)≅coker⁡(V+VT). Homology of the double branched cover from a Seifert matrix

[F2]

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

[F3]

det⁡(V−tVT) represents ΔK(t) up to multiplication by ±tk. The Seifert determinant is the knot Alexander polynomial

[F5]

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 (ACω) and The countable-choice principle used in the foliation pair hold. The Axiom of Choice

[F6]

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 S3 bounds a Seifert surface

[F7]

For a connected compact oriented surface with one boundary component and genus g, the fundamental group is free of rank 2g. Finite surface normal forms, Jordan disks, and torsion control

[F8]

A connected smooth surface F is locally path-connected, so its path components are open and it is path-connected. The first Hurewicz map identifies H1(F;Z) with the abelianization of π1(F); for the genus-g surface in [F7], this gives H1(F;Z)≅Z2g and an ordered integral basis. The first Hurewicz map is abelianization

Proof

Given: The data in the Statement and Facts & Assumptions. By [F5]--[F8], choose a connected compact smooth oriented Seifert surface F with oriented boundary K and an ordered integral basis of H1(F;Z). Let V be its positive-push Seifert matrix as defined in Seifert pairing and matrix of an oriented knot, and put D(t)=det⁡(V−tVT). [A1, F5, F6, F7, F8, given, choose]

1.1A1F1F2givenalgebra

By [F1], the double-cover homology is presented by the square integer matrix V+VT=V−(−1)VT. Its determinant is D(−1). By [F2], the homology is finite exactly when D(−1)≠0, and then its order is ∣D(−1)∣. The hypothesis needed by [F1] is the Axiom of Choice in [A1].

2.1F3step 1.1algebra

By [F3], D(−1)=±(−1)kΔK(−1) for some integer k, so ∣D(−1)∣=∣ΔK(−1)∣ and the zero tests agree. This proves the finiteness criterion and order formula.

3.1F4step 1.1step 2.1algebra∎

Write ΔK(t)=∑r=mncrtr with integers cr and finitely many terms. Since (−1)r≡1(mod2) for every integer r, including negative r, [F4] gives ΔK(−1)≡∑rcr=ΔK(1)≡1(mod2). Thus ΔK(−1) is odd and nonzero; step 1.1 then gives finiteness for every knot.

Depends on

Used by

Dependency tree · two levels

79 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