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.

Root-product test for cyclic branched-cover homology

Statement

Assume the Axiom of Choice. Let K be a smooth oriented knot, let F be a connected compact oriented Seifert surface of genus g, and let V be its positive-push Seifert matrix in an ordered integral basis of H1(F;Z). Write ΔK(t) for the Alexander polynomial normalized up to multiplication by ±tk, and let q≥2 with ζq a primitive q-th root of unity. Then H1(Σq(K);Z) is finite if and only if ΔK(ζqj)≠0 for every 1≤j<q, and, when it is finite,

∣H1(Σq(K);Z)∣=∏j=1q−1∣ΔK(ζqj)∣.

The same criterion and order hold when ΔK(t) is replaced by det⁡(V−tVT).

Facts & Assumptions

Given: Full AC, K,F,V,q, and the primitive root ζq in the Statement.

[A1]

Full AC is the choice-function axiom required by the cyclic-cover definition and coinvariant lemma. The Axiom of Choice

[F1]

H1(Σq(K);Z)≅AK/(tq−1)AK, where AK is the infinite-cyclic-cover Alexander module with positive-meridian deck action t. Homology of a cyclic branched cover as Alexander-module coinvariants

[F2]

AK has presentation coker⁡(V−tVT) over Z[t,t−1]. A Seifert matrix presents the one-variable Alexander module

[F3]

V−VT is the matrix of the integral intersection form on F, hence has determinant ±1. The skew part of a Seifert matrix is the surface intersection form

[F4]

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

[F5]

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

Proof

Given: The data in the Statement and Facts & Assumptions. Put D(t)=det⁡(V−tVT) and Rq=Z[t]/(tq−1).

1.1A1F1F2givenalgebra

Quotienting the module presentation in [F2] by (tq−1)AK gives AK/(tq−1)AK≅coker⁡(V−tVT:Rq2g→Rq2g) as abelian groups. The group Rq2g is free abelian of rank 2gq on tkai for 0≤k<q and 1≤i≤2g, so this map is represented by a square integer matrix Qq.

2.1F3step 1.1algebra

After tensoring with C, multiplication by t on Rq⊗C is diagonalizable: its eigenvalues are the q distinct roots ζqj for 0≤j<q, each with one-dimensional eigenspace. On the corresponding 2g-dimensional summand, Qq acts by V−ζqjVT. Therefore det⁡Qq=∏j=0q−1det⁡(V−ζqjVT). The j=0 factor is det⁡(V−VT)=±1 by [F3]. Thus det⁡Qq≠0 exactly when every factor with 1≤j<q is nonzero, and its absolute value is the product of the absolute values of those factors.

3.1F1F5step 2.1algebra

By [F1], the group in question is coker⁡(Qq). Applying [F5] shows it is finite exactly when det⁡Qq≠0, with order ∣det⁡Qq∣; if any nontrivial-root factor vanishes, the square integer cokernel has positive free rank and is infinite.

4.1F4step 2.1step 3.1algebra∎

By [F4], D(t)=±tkΔK(t) for some integer k. At every root of unity, ∣±(ζqj)k∣=1, so ∣D(ζqj)∣=∣ΔK(ζqj)∣. Hence the determinant-root criterion and product from step 3.1 give exactly the Alexander-polynomial criterion and order in the Statement, including the empty-matrix case g=0.

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