Alphabeta Math
TheoremStatement: 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.

The Kauffman bracket skein module of S³ is rank one

Statement

Assume the Axiom of Countable Choice and let R=Z[A±1] and δ=−A2−A−2. The Kauffman bracket skein module KA(S3) is freely generated as an R-module by the empty link. In particular, a zero-framed trivial circle represents δ[∅].

Facts & Assumptions

Given: The Axiom of Countable Choice and the Kauffman bracket skein module of the oriented three-sphere.

[A1]

The Axiom of Countable Choice is the assumption ACω (The Axiom of Countable Choice (ACω)).

[F1]

The module is generated by framed-link isotopy classes modulo the crossing relation [L×]=A[LA]+A−1[LB] and the zero-framed trivial-circle relation [L⊔O]=δ[L] (Kauffman bracket skein module of a three-manifold).

[F2]

Under ACω, every framed link in S3 has a regular planar diagram, and framed isotopies are represented by finite diagram moves (Framed link diagrams and local Reidemeister moves in plane products).

[F3]

Adding one positive or negative full twist to one component multiplies its skein class by −A3 or −A−3, respectively (Full framing twists in the Kauffman bracket skein module).

[F4]

Framed bracket evaluation is well-defined on KA(S3), is R-linear, and sends [∅] to 1 (Kauffman bracket evaluation of framed links in the three-sphere).

Proof

1.1A1F1F2F3giveninductionalgebra

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 A and A−1. 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 R[∅].

2.1F4step 1.1algebra

Define ϕ:R→KA(S3) by ϕ(r)=r[∅]. Step 1.1 makes ϕ surjective. If ϕ(r)=0, R-linearity and E([∅])=1 give r=E(ϕ(r))=E(0)=0. Thus ϕ is injective as well as surjective, so the empty class is a free R-module generator.

3.1F1algebra∎

The trivial-circle relation in [F1], with L=∅, gives [O]=δ[∅], 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