Alphabeta Math
LemmaStatement: 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 Conway knot has normalized Alexander polynomial one

Statement

Assume the Axiom of Choice. Let ΔC#(t) be the unique unit associate of the knot Alexander generator that is symmetric under t↦t−1 and has ΔC#(1)=1. Then ΔC#(t)=1.

Facts & Assumptions

Given: Full AC and the fixed Conway diagram and Alexander-polynomial normalization.

[A1]

The Axiom of Choice, written AC, is The Axiom of Choice. It supplies countable choice through AC implies DC implies countable choice.

[F1]

Seifert-matrix certificate for the Conway diagram constructs the actual embedded disk-and-band surface and an integral homology basis for the selected Conway diagram with the displayed matrix V, by a direct diagram transcription, local push-off counts and an explicit unimodular basis change.

[F2]

The Seifert determinant is the knot Alexander polynomial identifies the normalized Alexander polynomial with the determinant of a Seifert matrix up to a unit ±tm in Z[t,t−1].

[F3]

Knot Alexander normalization, symmetry, and genus bound: every knot Alexander generator has a unique symmetric unit associate taking value 1 at t=1.

Proof

technique · direct
1.1F1algebra

Let V be the matrix in [F1] and form A(t)=V−tVT. Fraction-free Bareiss elimination uses, at stage k, the update aij(k+1)=akk(k)aij(k)−aik(k)akj(k)ak−1,k−1(k−1)(i,j>k), with initial divisor 1. The successive pivots are t−1,1−t+t2,−t+t2,t2,t−t2+t3−t4,t−2t2+3t3−2t4+t5. At the seventh pivot exchange rows 7 and 8 once; the pivot is t2−t3+t4 and the final Bareiss entry is −t4. The one row exchange reverses the determinant sign, so det⁡A(t)=t4. The recurrence has exact polynomial divisions at every stage; the finite pivot and exact-division certificate is recorded in the batch contract.

2.1A1F2F3step 1.1algebra∎

The monomial t4 is a unit in Z[t,t−1]. By [F2], the Alexander generator is associated to 1. The polynomial 1 is symmetric and takes value 1 at t=1, so uniqueness in [F3] gives ΔC#(t)=1.

Depends on

Used by

Dependency tree · two levels

36 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