Alphabeta Math
Pipeline-generated
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.

Cyclic branched covers and knot determinants — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Worked cases: double branched covers of the trefoil, figure-eight knot, and unknot

Example

For the right-handed trefoil and figure-eight knot, use their standard genus-one Seifert surfaces and the ordered bases whose positive-push Seifert matrices are, respectively, VT=(−101−1),V8=(−1011). Their double branched covers have first homology Z/3Z and Z/5Z, respectively. The double branched cover of the unknot is S3.

Facts & Assumptions

Given: Full AC and the matrices and knots specified in the Example.

[A1]

Full AC is the choice-function axiom required by the double-cover 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]

A square integer matrix with nonzero determinant has finite cokernel of order the absolute determinant; unimodular row and column operations preserve the cokernel. Finiteness and order of the cokernel of a square integer matrix

Proof

1.1A1F1F2givenalgebra

For the trefoil, VT+VTT=(−211−2). Swap its columns, add twice the first row to the second, then add twice the first column to the second; the result is diag⁡(1,−3). Each operation is unimodular, so [F1]–[F2] give H1(Σ2(T))≅Z/3Z.

1.2A1F1F2givenalgebra

For the figure-eight knot, V8+V8T=(−2112). Swap its columns, subtract twice the first row from the second, then add twice the first column to the second; the result is diag⁡(1,5). Thus its cokernel is Z/5Z.

2.1F1givenconstructalgebra∎

For the unknot, the standard spanning disk has genus zero, so its Seifert matrix is empty and [F1] gives trivial first homology. To identify the whole cover, write S3={(z,w)∈C2:∣z∣2+∣w∣2=1} and define f(z,w)=(z1+∣w∣2,w2). The image lies in S3 because ∣z∣2(1+∣w∣2)+∣w∣4=1. Off w=0, each target point has exactly two preimages, corresponding to the two square roots of its second coordinate; on w=0 it has one. The involution (z,w)↦(z,−w) is the deck transformation, and in tubular coordinates about w=0 the transverse map is w↦w2. Hence f is the connected double branched cover of S3 over the unknot, so the cover is S3.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A higher cyclic branched cover can have infinite first homology

Statement refuted

Every cyclic branched cover of a smooth oriented knot has finite first homology.

Facts & Assumptions

Given: Full AC, the right-handed trefoil matrix VT=(−101−1), and the primitive sixth root ζ6=eiπ/3.

[A1]

Full AC is the choice-function axiom required by the cyclic-cover and Alexander-polynomial theorems. The Axiom of Choice

[F1]

The Seifert determinant det⁡(V−tVT) represents the Alexander polynomial up to a unit ±tk. The Seifert determinant is the knot Alexander polynomial, The Alexander polynomial from the zeroth elementary ideal

[F2]

The cyclic-cover order theorem states that a zero at any nontrivial q-th root makes the first homology infinite. Cyclic-cover homology order from the Alexander polynomial

[F3]

The Alexander normalization gives ΔK(1)=±1, and the double-cover theorem gives finiteness when ∣ΔK(−1)∣ is this nonzero odd integer. The square Seifert presentation generates the knot Alexander polynomial, Knot determinant is the order of double-cover homology

Counterexample

technique · direct
1.1F1givenalgebra

Direct calculation gives det⁡(VT−tVTT)=det⁡(t−1−t1t−1)=t2−t+1. By [F1], this represents the trefoil Alexander polynomial up to ±tk. Since ζ62−ζ6+1=0, the Alexander polynomial vanishes at this nontrivial sixth root.

2.1A1F2F3step 1.1given∎

Applying [F2] with q=6 shows that H1(Σ6(T);Z) is infinite, contradicting the refuted universal claim. For the boundary comparison, [F3] gives ΔT(−1) odd and nonzero, so H1(Σ2(T);Z) is finite. Thus the failure occurs at a higher cyclic cover even though the double-cover case is always finite. The two supplier theorems use the Axiom of Choice in [A1].

Sources