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.

Satellite pattern, companion, and winding number

Definition

Let V=S1×D2 be the standard oriented solid torus, with oriented core S1×{0}. A pattern is a smooth oriented knot P contained in the interior of V, together with a chosen closed tubular neighbourhood N(P) contained in the interior of V. Its winding number w(P) is the integer by which the homology class [P] maps to H1(V;Z)≅Z under the isomorphism that sends the oriented core to 1. The pattern exterior is XP=V∖int⁡N(P); its outer torus is ∂V and its inner torus is ∂N(P). A companion is a smooth oriented knot K⊂S3 with a specified orientation-preserving tubular embedding e:V→S3 that sends the core to K and identifies the solid-torus meridian and product longitude with the positive meridian and preferred longitude of K. The satellite knot P(K) is e(P), with chosen exterior EP(K)=S3∖int⁡e(N(P)); the image e(∂V) is its companion torus. The outer torus is incompressible when it bounds no properly embedded disk in XP with essential boundary on ∂V. It is product-parallel to the inner torus when XP is a product T2×[0,1] with those tori as its ends. This definition alone asserts neither incompressibility nor essentiality of the companion torus.

Depends on

Used by

Dependency tree · two levels

7 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