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.

Rack colorings are framed Reidemeister invariants

Statement

Assume ACω for the smooth framing statements. Let R be a rack and let π(x)=x∗x be its kink map. Rack-coloring sets are in bijection across every oriented R2 or R3 move and planar isotopy. Across a single oriented R1 curl, the label transported along the affected strand changes by π or π−1 according to the curl orientation. Consequently, an opposite-kink pair on the same component whose two signed framing changes cancel induces a bijection on colorings. A single unframed R1 move has a unique extension for every boundary color exactly when π is the identity, which is the quandle idempotency axiom. Thus finite rack coloring counts are invariant under R2, R3, planar isotopy, and framing-preserving opposite-kink compensation; the unframed R1 move is covered when the rack is a quandle.

Facts & Assumptions

Given: A rack R, its kink map π, the positive-normal crossing convention, and ACω when smooth framings are used.

[F1]

Racks, diagram fundamental quandles, and adjoint groups: every right translation is bijective, right self-distributivity holds, and the coloring relation uses the overarc action.

[F2]

The rack kink map is bijective: the map π(x)=x∗x is bijective with inverse π−1(z)=Rz−1(z).

[F3]

Oriented Reidemeister moves: oriented R2 and R3 moves have all local orientation and height-order variants.

[F4]

The crossing sign is sgn⁡det⁡P(vover,vunder); blackboard self-linking equals self-writhe. Therefore an R1 creation with sign ϵ changes blackboard self-linking by ϵ. Oriented crossing signs, diagram writhe, and blackboard framing, Blackboard self-linking equals diagram self-writhe

[A1]

ACω is used only for the supplied smooth-framing/self-linking results. The Axiom of Countable Choice (ACω)

Proof

1.1F1F3

At an R2 move, hold the overarc color y fixed. The underarc label is changed by Ry at one crossing and by Ry−1 at the other, so the two boundary colorings determine one another uniquely. Reversing the move gives the inverse correspondence.

1.2F1F3algebra

For a braid-like R3 move, use the crossing map B(x,y)=(y,x∗y). Its inverse is B−1(u,v)=(v∗ˉu,u) by right invertibility. The two sides send (x,y,z) respectively to (z,y∗z,(x∗y)∗z) and (z,y∗z,(x∗z)∗(y∗z)); the last coordinates agree by rack self-distributivity. For every z, Rz(x∗y)=(x∗y)∗z=(x∗z)∗(y∗z), so Rz preserves ∗. If u=a∗ˉb, then u∗b=a; applying Rz gives Rz(u)∗Rz(b)=Rz(a), and uniqueness of right division yields Rz(u)=Rz(a)∗ˉRz(b). Thus Rz and its inverse preserve both operations. For either operation ⋆1,⋆2∈{∗,∗ˉ}, this gives (x⋆1y)⋆2z=(x⋆2z)⋆1(y⋆2z), the corresponding mixed R3 equation. The bijective crossing maps then give the extension bijection for every orientation variant. A planar isotopy transports arc labels.

1.3F1F2F4algebra

Write the under-tangent as avover+bno. Its determinant sign is the sign of b, so at a positive crossing the oriented underpass goes from source to target. In a positive curl with incoming label x and outgoing label y, either the overarc is the incoming arc and y=x∗x, or it is the outgoing arc and y=x∗y. In the latter case self-distributivity gives RyRx=Rx∗yRy=RyRy, hence Rx=Ry; therefore y=x∗y=x∗x=π(x). Conversely y=π(x) solves the equation since Rπ(x)=Rx by the kink-map proof. Thus both positive curl shapes have unique transport y=π(x). In a negative curl the same equations are read backwards and give y=π−1(x). This checks both choices of which boundary arc is the overarc, independently of a picture.

1.4F1F2F3

For a single unframed curl with boundary color x, extension requires x=π(x); if π is the identity, this condition holds uniquely for every x. Conversely, if every boundary color extends uniquely, every x is fixed by π, so x∗x=x for all x and the rack is a quandle.

1.5F1F2algebra

The kink shift propagates through any crossing. Self-distributivity gives π(x∗y)=(x∗y)∗(x∗y)=(x∗x)∗y, hence πRy=Ryπ. It also gives (x∗y)∗y=(x∗y)∗(y∗y) for every x. Since Ry is surjective, this implies Rπ(y)=Ry. By [F2], π is bijective, so these identities hold for its inverse as well: πkRyδ=Ryδπk and Rπℓ(y)δ=Ryδ for all k,ℓ∈Z and δ∈{1,−1}. In particular, if a crossing obeys xt=Ry(xs), independently shifting its two under-colors by the same πk and its over-color by πℓ preserves it, because Rπℓ(y)(πkxs)=πkRy(xs)=πkxt. The reversed crossing relation is preserved by the same calculation with Ry−1.

2.1A1F2F4step 1.3construct

A compensated pair creates two curls on the same oriented component, or removes their inverse configuration. If its blackboard framing is preserved, [F4] forces the two created crossing signs to sum to zero; the same holds when opposite signed framing changes are specified directly. Choose either of the two component intervals between the sites and traverse it in the component orientation, writing ϵ∈{1,−1} for the sign of its first curl; the second has sign −ϵ. Starting from an old coloring, retain every color off this interval and replace every old color on it by πϵ of that color, splitting an old under-arc at the two sites if needed. Insert the unique local curl labels from step1.3. At the first site the transport changes the old incoming label to its πϵ-shift; at the second the transport π−ϵ restores the old outgoing label. Thus the prescribed labels agree along every new maximal under-arc.

3.1F1F2step 1.3step 1.5step 2.1constructalgebra

At any old crossing, the selected component interval contains both local halves of the underpassing branch or neither, since its endpoints are away from crossings. Thus the source and target under-colors have the same shift exponent k∈{0,ϵ}. Independently the overpassing branch has shift exponent ℓ∈{0,ϵ}. Step1.5 preserves the crossing relation for all four possibilities, including a self-crossing at which the interval contains exactly one of the two visits. The old crossing relations therefore all hold after the recoloring. Conversely, start with any coloring of the twice-curled diagram, undo the πϵ shift on that same marked component interval, and remove the two uniquely determined curl portions using step1.3; step1.5 again preserves every intervening relation. The endpoint transports now cancel in the inverse order. These constructions are inverse on every arc label, so give the required bijection for arbitrarily separated opposite curls, not only adjacent curls. The removal move uses the inverse bijection.

4.1A1step 1.1step 1.2step 1.4step 2.1step 3.1∎

Steps 1.1–1.2 give the R2, R3 and planar-isotopy bijections; steps 2.1, 3.1 give the compensation bijection. A finite rack admits only finitely many assignments on a finite diagram, so the cardinalities are preserved. Step 1.4 proves exactly when the individual unframed R1 bijection is available. The algebraic assertions use no choice; only the smooth framing interpretation uses [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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