Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 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 detects Arf parity near minus one

Statement

Assume full AC. Let K be a smooth oriented knot of genus g, let V be a Seifert matrix in an integral symplectic basis, and let ΔK#(t) be the unique symmetric Alexander normalization with ΔK#(1)=1. In the quotient ring F2[t,t−1]/(1+t)4, ΔK#(t)=1+Arf⁡(K)(1+t)2t.

Facts & Assumptions

Given: Full AC, an oriented knot, a genus-g Seifert surface, and its positive-push Seifert matrix V.

[A1]

Full AC is the choice-function axiom assumed by the Seifert-pairing and Alexander suppliers. The Axiom of Choice

[F1]

V−VT is the standard integral symplectic intersection matrix in a handle basis, and changes of integral symplectic basis preserve the Arf value. The skew part of a Seifert matrix is the surface intersection form, The Seifert form gives a quadratic enhancement and basis-independent Arf value

[F2]

In a symplectic basis, Arf⁡(K)=∑iv2i−1,2i−1v2i,2i(mod2), equivalently ∑x∈H1(F;F2)(−1)qF(x)=2g(−1)Arf⁡(K). Knot Arf invariant from the Seifert form, The Seifert form gives a quadratic enhancement and basis-independent Arf value

[F3]

The determinant det⁡(uV−u−1VT) is ∇K(u−u−1)=ΔK#(u2). Seifert determinant constructs the normalized Conway polynomial, S-equivalence and Conway normalization

[F4]

det⁡(V−VT)=1 in a positively oriented symplectic basis, so the centered determinant is the unique normalized symmetric Alexander generator. The Seifert determinant is the knot Alexander polynomial, Knot Alexander normalization, symmetry, and genus bound

Proof

1.1A1F1givenconstructalgebra

If g=0, the matrix and homology group are empty, ΔK#=1, and Arf⁡(K)=0, so the congruence holds. Assume g≥1. Choose a symplectic integral basis and, in each pair, arrange v2i−1,2i≡1 and v2i,2i−1≡0(mod2). This is possible because their difference is 1; if the odd entry is in the reverse position, replace (ai,bi) by (bi,−ai), which keeps ai⋅bi=1. Let A(t)=VT−tV. For indices r,s in a paired position, its entries modulo two are a2i,2i−1=1 and a2i−1,2i=t; for every other position ars=(1+t)vrs. The diagonal case is included, as (1−t)vrr=(1+t)vrr modulo two.

2.1F1F2step 1.1algebra

Let B be the symmetric matrix over F2 with B2i−1,2i=B2i,2i−1=1 and all other entries Brs=vrs. For a permutation ϕ of {1,…,2g}, let α count the indices i for which ϕ(2i)=2i−1, and let β count those for which ϕ(2i−1)=2i. Grouping the determinant expansion by these two counts gives det⁡A(t)=∑α,β=0gϵαβ(1+t)2g−α−βtβ(mod2), where ϵαβ is the sum of ∏rBr,ϕ(r) over permutations with those counts. Inversion ϕ↦ϕ−1 preserves the product because B=BT and swaps α,β, so ϵαβ=ϵβα. There is one permutation with α=β=g, the product of the g within-pair transpositions, hence ϵgg=1. There is no permutation with (α,β)=(g,g−1): if every even row occupies its paired odd column, then every odd row must occupy its paired even column; one exception would leave one even column empty. Symmetry gives ϵg−1,g=0. For (g−1,g−1), inversion pairs equal-weight terms and cancels them modulo two unless the permutation is its own inverse. The fixed permutations must have every pair transposed except one pair fixed pointwise; any cross-pair exchange would make at least two pairs exceptional. Therefore ϵg−1,g−1=∑i=1gv2i−1,2i−1v2i,2i=Arf⁡(K)(mod2) by [F2], since the diagonal entries are qF(ai) and qF(bi). The finite Gauss sum in [F2] is 2g times (−1) to this same parity, so it identifies the determinant coefficient as the Arf sign used in the Conway comparison below.

3.1F1F2F3F4step 2.1algebra∎

In the expansion of step 2.1, terms with 2g−α−β≥4 vanish modulo (1+t)4. For exponent 0, only (α,β)=(g,g) remains, giving tg. For exponent 1, the only two terms are the symmetric pair (g,g−1) and (g−1,g), whose coefficient is zero. For exponent 2, the diagonal term is Arf⁡(K)(1+t)2tg−1; the off-diagonal pair (g,g−2),(g−2,g) is divisible by (1+t)4, since t2+1=(1+t)2 modulo two. For exponent 3, symmetry pairs each term with its transpose, and ta+tb is divisible by 1+t, so each paired sum is divisible by (1+t)4. Hence det⁡(VT−tV)=tg+Arf⁡(K)(1+t)2tg−1(mod(2,(1+t)4)). By [F3], and with the normalization fixed by [F4], multiply by t−g to obtain the asserted congruence for ΔK#(t).

Depends on

Used by

Dependency tree · two levels

57 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