Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 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.

Seifert pairing and matrix of an oriented link

Definition

Assume full AC. Let L=K1∪⋯∪Kr⊂S3 be a nonempty smooth oriented link, let F be a connected compact smooth oriented embedded surface whose oriented boundary is L, and let g be its genus. The compact-surface normal form gives H1(F;Z)≅Z2g+r−1. Orient the normal line of F by requiring (n,u,v) to be a positive ambient frame whenever (u,v) is a positive tangent frame of F. For an ordered integral basis a1,…,am, with m=2g+r−1, choose circle-cycle representatives on F and let ai+ be a sufficiently small copy in the positive normal direction. For disjoint oriented embedded circles C,D⊂S3, define lk⁡(C,D) by [C]=lk⁡(C,D)[μD] in H1(S3∖D;Z), where μD is the positive meridian whose oriented normal disk follows the positive tangent to D in the ambient orientation; extend linking bilinearly to finite sums of such circles. Define the positive-push Seifert matrix by Vij=lk⁡(ai+,aj). 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

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