Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

S-equivalence and Conway normalization

Definition

Assume full AC. For an even-order integral matrix V that is the Seifert matrix of a knot, S-equivalence means the equivalence relation generated by integral unimodular congruences V↦PTVP with det⁡P=±1 and the following two enlargements, for column vectors x,y∈Zn and z∈Z:

E0(V;x,y,z)=(Vx0yTz00T10),E1(V;x,y,z)=(Vx0yTz10T00), and their reverses. For an assignment P of an integer polynomial in z to each ambient-isotopy class of oriented links, call P Conway-normalized when P∅(z)=0 for the empty link, PU(z)=1 for the unknot U, and PL+(z)−PL−(z)=z PL0(z) whenever the three oriented links agree outside one crossing ball and inside it are respectively the positive crossing, negative crossing, and orientation-compatible smoothing; positive means det⁡P(vover,vunder)>0, where vover,vunder are the projected oriented tangent vectors and P is oriented so the viewing normal followed by a positive basis of P is ambient-positive. The smoothing reconnects the four oriented half-arcs in the unique noncrossing way compatible with their directions. No existence of such an assignment is presupposed: the Seifert-determinant lemma constructs the unique assignment on nonempty links; extending it by ∇∅(z)=0 gives the unique assignment on this full domain, denoted by ∇L(z). For a knot, let ΔK#(t) be the unique associate of its Alexander polynomial satisfying ΔK#(1)=1 and ΔK#(t−1)=ΔK#(t); existence and uniqueness follow from the Alexander-normalization corollary. Set z=t1/2−t−1/2, with t1/2 a formal Laurent variable, then ΔK#(t)=∇K(z), as justified by the centered determinant below.

Facts & Assumptions

Given: Full AC, an oriented link and, in the knot case, a symmetric normalized Alexander polynomial.

[A1]

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

[F1]

The integral congruence and enlargement operations are the declared S-equivalence generators. S-equivalence of integral Seifert matrices

[F2]

For every nonempty oriented link, the dependent lemma constructs a connected Seifert surface and proves the determinant formula and skein uniqueness. The empty link occurs in no crossing-ball skein triple, so its separately prescribed value extends that unique assignment without a new compatibility condition. Seifert determinant constructs the normalized Conway polynomial ↗

[F3]

For a genus-g knot surface put p(t)=det⁡(V−tVT). The determinant theorem identifies p with the Alexander generator up to a Laurent unit. The skew-part lemma gives det⁡(V−VT)=1 in a handle basis and hence every integral basis. Transposition gives p(t)=t2gp(t−1), so t−gp(t) is symmetric and has value 1 at t=1. The normalization corollary therefore identifies it with ΔK#(t). With u2=t, the dependent Conway lemma gives ∇K(u−u−1)=det⁡(u−1V−uVT)=t−gp(t), proving the claimed equality rather than imposing it as a convention. The Seifert determinant is the knot Alexander polynomial, The skew part of a Seifert matrix is the surface intersection form, Knot Alexander normalization, symmetry, and genus bound, Seifert determinant constructs the normalized Conway polynomial ↗

Depends on

Used by

Dependency tree · two levels

45 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