Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

One crossing change changes a Seifert matrix by rank at most one

Statement

Assume the full Axiom of Choice. Let D+ and D− be finite regular oriented knot diagrams that agree outside one crossing neighborhood and differ inside it by switching which branch is over. Let V+ and V− be the Seifert matrices obtained from their oriented disk-and-band surfaces. There are corresponding integral bases in which either V+=V− or V+−V−=±vvT for some integral column vector v. In particular, rank⁡(V+−V−)≤1.

Facts & Assumptions

Given: Full AC, two oriented knot diagrams differing at one crossing, and their Seifert disk-and-band constructions.

[A1]

Full AC is the choice-function axiom used by the knot Seifert-pairing convention. The Axiom of Choice

[F1]

The Seifert construction smooths each crossing by the orientation-compatible pairing and adds one half-twisted band per original crossing. Seifert disk-and-band construction from an oriented knot diagram

[F2]

For a knot diagram, the resulting disk-and-band data can be realized as a connected compact oriented embedded spanning surface. Seifert disks and bands form an embedded oriented spanning surface

[F3]

In an ordered integral basis, the Seifert matrix has entries Vij=lk⁡(ai+,aj), where ai+ is the positive normal push-off. Seifert pairing and matrix of an oriented knot

Proof

Given: Full AC, the two diagrams and their prescribed crossing change.

1.1A1F1F2givenconstruct

Switching over and under does not change the oriented smoothing at the distinguished crossing. Thus [F1] gives the same Seifert circles, disk records, and bands at every other crossing. Only the distinguished band changes: its two possible half-twist directions differ by one full twist. By [F2], both disk-and-band constructions give connected embedded oriented spanning surfaces, and each surface retracts to the finite graph with one vertex per disk and one edge per band.

2.1F1step 1.1construct

Let e be the distinguished edge of that graph. If e is a bridge, every graph cycle avoids e, so choose the corresponding homology basis outside the changed band; all Seifert-pairing entries are then identical. If e is not a bridge, the graph with e removed is connected. Choose a spanning tree of that graph; its fundamental cycles, together with the fundamental cycle using e, form an integral homology basis. All basis curves except the last can be represented disjoint from the distinguished band.

3.1F2F3step 2.1algebra∎

The crossing change is supported in a ball disjoint from every other band and disk. Hence the basis curves avoiding e, and their positive push-offs, have identical linking numbers before and after the change. Their pairings with the last basis curve also remain the same, because the other curve and its push-off miss that ball. The last curve passes once through the distinguished band; changing the band by a full twist adds one signed meridional turn to its positive push-off about its core, so its self-linking in [F3] changes by exactly +1 or −1. Thus only one diagonal entry changes. The matrix difference is zero in the bridge case and is ±vvT in the non-bridge case, so its rank is at most one.

Depends on

Used by

Dependency tree · two levels

28 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