Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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 square-knot Seifert form is metabolic

Example

Assume full AC. Let T be the right-handed trefoil obtained by plumbing two positive Hopf bands, with positive-push Seifert matrix V=(−10−1−1). Let T† be its reverse mirror and set S=T#T†. Then S bounds a smooth proper disk in B4 for which the squared radial function has only index-0 and index-1 interior critical points. A Seifert matrix for S is W=diag⁡(V,−VT), the rank-2 direct summand M=⟨e1+e4,e2+e3⟩⊂Z4 is a metabolizer for W, and ΔS(t)≐(t2−t+1)2. In particular, with f(t)=t2−t+1, the determinant is a Laurent-unit multiple of f(t)f(t−1).

Facts & Assumptions

Given: Full AC, the positive Hopf-plumbed trefoil T, its reverse mirror T†, and the connected sum S=T#T†.

[A1]

Full AC is the family-of-nonempty-sets choice axiom used by the Seifert-pairing convention. The Axiom of Choice

[F1]

Full AC implies the Axiom of Countable Choice required by the ribbon-disk supplier. AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)

[F2]

In the stated positive-push basis, the trefoil matrix is V=(−10−1−1). A positive Hopf plumbing gives the trefoil Seifert matrix

[F3]

The reverse mirror is obtained by the fixed orientation-reversing reflection and reversal of the knot orientation. Reverse mirror of an oriented knot

[F4]

The connected sum uses the fixed oriented ball-gluing convention, independent of the allowed local choices. Oriented connected sum and prime knot, The oriented connected sum is independent of its local choices

[F5]

Every smooth knot K has a smooth proper disk for K#K† with only index-0 and index-1 interior radial critical points, under ACω. A knot summed with its reverse mirror bounds a ribbon disk

[F6]

The Alexander polynomial satisfies ΔS(t)≐det⁡(W−tWT) for this positive-push matrix. The Seifert determinant is the knot Alexander polynomial

Verification

1.1A1F1F5givenconstruct

By [F1], the stated full-AC hypothesis supplies ACω. Apply [F5] to T; its conclusion gives the required smooth proper disk for S=T#T† and the stated radial critical-point indices.

1.2F2F3algebra

The reverse-mirror surface is −r(F), so its positive normal is the reflected original positive normal: the ambient reflection and surface reversal cancel in the normal orientation. Thus the transported basis has matrix −V, since reflection negates linking. For this particular trefoil matrix put P=(0110); direct multiplication gives PTVP=VT. Rechoose the basis of the reverse-mirror surface by P. Its matrix is then −VT. This is a specified trefoil basis change, not a general image-basis formula for reverse mirrors.

2.1F2F4step 1.2construct

Form the boundary-connected-sum Seifert surface in the two summand balls. Cycles from different summands have zero linking because each bounds a 2-chain in its own ball, disjoint from the other summand. The combined basis therefore has matrix W=diag⁡(V,−VT).

3.1F2step 2.1algebra

Let P=(0110). Direct multiplication gives PTVTP=V. The graph M={(x,Px):x∈Z2} is spanned by e1+e4 and e2+e3; projection onto the first factor identifies it with Z2, so it is a rank-2 direct summand. For any x,y∈Z2, (x,Px)TW(y,Py)=xT(V−PTVTP)y=0. Thus M is a metabolizer.

4.1F2F6step 2.1algebra∎

The two blocks give det⁡(V−tVT)=(1−t)2+t=t2−t+1 and det⁡(−VT+tV)=(t−1)2+t=t2−t+1. Hence det⁡(W−tWT)=(t2−t+1)2. For f(t)=t2−t+1, one has f(t−1)=t−2f(t), so det⁡(W−tWT)=t2f(t)f(t−1). By [F6], this is the claimed Fox–Milnor norm factorization of ΔS.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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