Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Kauffman bracket R2 and R3 identities

Statement

Let A be an indeterminate and n≥2. In a vertical n-strand braid box whose longitudinal parameter increases from bottom to top, let I be the straight tangle and, for 1≤i<n, let ei be the cup-cap tangle with a cap at the top and a cup at the bottom on strands i,i+1, and straight strands elsewhere. Each closed loop has value δ=−A2−A−2. For the positive crossing, use positive projection coordinates (t,x), with t longitudinal and x transverse, and over and under tangent vectors (1,−2h) and (1,2h) for h>0. Transport the source chart by (t,x)=(v,−2hu): its A-smoothing is the left/right pairing with coefficient A, giving I, and its B-smoothing is the top/bottom pairing with coefficient A−1, giving ei. Set Ci:=AI+A−1ei. For the opposite crossing, the smoothings exchange their through and cup-cap pairings; set Ci−:=A−1I+Aei. Then CiCi−=Ci−Ci=I, and for adjacent strands CiCi+1Ci=Ci+1CiCi+1. Consequently the bracket is unchanged by every local Reidemeister II or III replacement; arbitrary strand orientations do not change these unoriented tangle identities.

t1t2t3b1b2b3e1

The picture names the cap, cup, and through strand that define e1; the algebraic equalities above are proved below without using the picture as an inference.

Facts & Assumptions

Given: A regular link diagram with one of the local R2 or R3 replacements described in the statement.

[F1]

In the source crossing chart, the A-smoothing has weight A, the B-smoothing has weight A−1, and a closed trivial loop has value δ=−A2−A−2 (Kauffman bracket smoothing and loop value).

[F2]

The identity I is the vertical through tangle; ei is the cap on top and cup on bottom, stacking removes loops with coefficient δ, and the stacking product is associative and bilinear (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

[F3]

The generators satisfy ei2=δei, eiei+1ei=ei, ei+1eiei+1=ei+1, and distant generators commute (The elementary diagram generators satisfy the local Temperley–Lieb relations).

[F4]

R2 creates or deletes two opposite crossings, and every allowed R3 has a strict height order with the cyclic over/under pattern excluded (Oriented Reidemeister moves).

Proof

1.1F1F2F3algebra

Use source coordinates (u,v) with their standard positive orientation and positive projection coordinates (t,x) on the braid box. For h>0, the map (t,x)=(v,−2hu) has determinant 2h>0. It sends the source over direction (1,1) to (1,−2h) and the source under direction (−1,1) to (1,2h), whose determinant is 4h>0. The source left/right pairs have constant u, hence constant braid position x and give the through pairing I; the source top/bottom pairs have constant v, hence constant braid time t and give the cup-cap ei. The displayed page coordinates (x,t) reverse the positive projection orientation; their visual quarter-turn is not the orientation comparison. For the opposite crossing, rotating the source chart by a positive quarter-turn exchanges the two endpoint pairings, so its A/B smoothings are respectively ei and I. By [F1] these expansions are Ci=AI+A−1ei and Ci−=A−1I+Aei. Using [F2] and [F3], CiCi−=(AI+A−1ei)(A−1I+Aei)=I+(A2+A−2+δ)ei=I. The same multiplication in the other order gives Ci−Ci=I, since both factors are polynomials in ei. Thus the two opposite crossings in an R2 pair cancel in either order.

1.2F1F3algebra

Put x=ei and y=ei+1. Expanding and using [F3] gives CiCi+1Ci=A3I+A(2x+y)+A−1(xy+yx+δx)+A−3x, while interchanging x and y gives Ci+1CiCi+1=A3I+A(2y+x)+A−1(yx+xy+δy)+A−3y. Their difference is A−1(A2+δ+A−2)(x−y)=0. Hence the two sides of the braid-like R3 move have equal bracket operators.

2.1F1F2F4step 1.1step 1.2algebra∎

Near the three-strand event, choose a linear longitudinal coordinate nonzero on each of the three tangent lines, shrink the event disk, and orient the unoriented local tracks in its increasing direction. All three tracks are then monotone; these temporary arrows do not affect the bracket. Label the tracks 1,2,3 at the incoming end. The two R3 sides meet their pairs in orders (12,13,23) and (23,13,12), and a strict height order permits exactly the exponent triples +++,−−−,++−,−++,+−−,−−+. The triples +−+ and −+− would require a cyclic height order. Put a=Ci and b=Ci+1. Besides aba=bab from step 1.2 and its inverse from step 1.1, the four needed identities are aba−1=b−1ab,a−1ba=bab−1,ab−1a−1=b−1a−1b,a−1b−1a=ba−1b−1. The first follows by multiplying aba=bab on the left by b−1 and on the right by a−1; the second follows by multiplying on the left by a−1 and on the right by b−1; the last two are their inverses. Thus each of the six height orders gives equality with exactly its actual over/under choices. For R2, choose a longitudinal coordinate along the common tangent at the bigon event, shrink the disk, and temporarily orient both tracks increasingly; the two local crossings have opposite types and cancel by step 1.1. Reversing any original strand arrow leaves all smoothing weights unchanged. Adjoining the unchanged exterior tangle and closing its boundary preserves these equalities: expand each crossing into its two smoothings, use bilinearity, and evaluate each resulting crossingless closed diagram with one factor δ per circle as in [F2]. This gives equal sums ∑SAa(S)−b(S)δ∣S∣ on the two sides. Every complete smoothing of the nonempty diagram has ∣S∣≥1, and δ=−A2−A−2 is nonzero in the integral domain Z[A±1]; hence these sums are δ⟨D⟩ and δ⟨D′⟩. Cancelling δ proves ⟨D⟩=⟨D′⟩, so every R2/R3 variant preserves the bracket.

Depends on

Used by

Dependency tree · two levels

17 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