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.
The Kauffman bracket skein module of S³ is rank one
Statement
Assume the Axiom of Countable Choice and let and . The Kauffman bracket skein module is freely generated as an -module by the empty link. In particular, a zero-framed trivial circle represents .
Statement references
Facts & Assumptions
Given: The Axiom of Countable Choice and the Kauffman bracket skein module of the oriented three-sphere.
The Axiom of Countable Choice is the assumption (The Axiom of Countable Choice ()).
The module is generated by framed-link isotopy classes modulo the crossing relation and the zero-framed trivial-circle relation (Kauffman bracket skein module of a three-manifold).
Under , every framed link in has a regular planar diagram, and framed isotopies are represented by finite diagram moves (Framed link diagrams and local Reidemeister moves in plane products).
Adding one positive or negative full twist to one component multiplies its skein class by or , respectively (Full framing twists in the Kauffman bracket skein module).
Framed bracket evaluation is well-defined on , is -linear, and sends to (Kauffman bracket evaluation of framed links in the three-sphere).
Proof
We prove by induction on the number of crossings of a regular diagram for a blackboard-framed link that its class is a scalar multiple of . If the diagram has a crossing, the crossing relation in [F1] expresses its class as the sum of the two smoothing classes with coefficients and . The skein convention gives each smoothing its blackboard framing, and each has one fewer crossing, so the induction applies. A crossingless diagram is a finite disjoint union of planar circles. Choose an innermost circle; its planar disk has no other component in its interior and is disjoint from the remaining link. Its blackboard framing is the zero framing, so [F1] removes it with factor . Remove this component and repeat; the crossingless link reduces to a scalar multiple of the empty link. For a general framed link, [F2] supplies a diagram and [F3], applied finitely many times to its framing-correction integer, reduces its class to a scalar multiple of the corresponding blackboard-framed diagram. Hence every class lies in .
Define by . Step 1.1 makes surjective. If , -linearity and give . Thus is injective as well as surjective, so the empty class is a free -module generator.
The trivial-circle relation in [F1], with , gives , as claimed.
Depends on
Used by
Dependency tree · two levels
22 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
- Józef H. Przytycki, Fundamentals of Kauffman Bracket Skein Modules, arXiv:math/9809113 (1998), §2, Theorem 2.3(a) (standard reference, not scraped)
- Sean Pohorence, 3-manifold Invariants and TQFTs (January 2016), §3.1, pp. 11–12 (standard reference, not scraped)
- Thang T. Q. Lê, The Colored Jones Polynomial and the AJ Conjecture, §6.2, Example 6.4, printed p. 30 (standard reference, not scraped)