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.
Seifert pairing and matrix of an oriented link
Definition
Assume full AC. Let be a nonempty smooth oriented link, let be a connected compact smooth oriented embedded surface whose oriented boundary is , and let be its genus. The compact-surface normal form gives . Orient the normal line of by requiring to be a positive ambient frame whenever is a positive tangent frame of . For an ordered integral basis , with , choose circle-cycle representatives on and let be a sufficiently small copy in the positive normal direction. For disjoint oriented embedded circles , define by in , where is the positive meridian whose oriented normal disk follows the positive tangent to in the ambient orientation; extend linking bilinearly to finite sums of such circles. Define the positive-push Seifert matrix by . The link-surface pairing lemma proves this matrix is independent of the chosen cycle representatives and push-off level. The surface and basis remain part of the data; this definition asserts no link-only matrix invariance.
Depends on
- Oriented links in the three-sphere and ambient isotopy
- Finite surface normal forms, Jordan disks, and torsion control
- The one-variable Alexander module of an oriented link
- The positive-push Seifert pairing is well-defined for a link surface
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC implies DC implies countable choice
- The Axiom of Choice
Used by
Dependency tree · two levels
63 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
- W. B. Raymond Lickorish, An Introduction to Knot Theory, Graduate Texts in Mathematics 175, Springer (1997) (standard reference, not scraped)