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.

Hecke–bracket trace dictionary and local descent

Statement

Let A be an indeterminate, RA=Z[A±1,(A−4+1)−1], q=A−2, t=q2=A−4, δ=−(q+q−1)=−A2−A−2, and z0=−1/(t+1). For a nonempty regular diagram D, define ⟨D⟩ by summing its crossing smoothings with weights A and A−1 and the factor δk−1 for a state with k circles. Let Bn be the n-strand Artin braid group with positive geometric generators σi (label i passes below the midpoint and label i+1 passes above), drawn with braid parameter increasing from bottom to top; let e:Bn→Z be the homomorphism e(σi)=1. Let H(n) be the type-A Hecke algebra with generators Ti, quadratic relation Ti2=(v−1)Ti+v, braid relations, and distant commutation; let πn send σi to Ti. Its normalized Markov trace tr⁡n satisfies tr⁡n(1)=1, cyclicity, tower restriction, and tr⁡n+1(xTn)=ztr⁡n(x). Let TLn be the noncrossing pairing algebra with loop value δ, and let Tr⁡n(D)=δc(D) be the unnormalized trace, where c(D) is the number of circles after joining corresponding top and bottom endpoints outside the rectangle; set τn=δ−nTr⁡n. For β∈Bn, n≥1, orient its closure in the braid direction. Under the specialization v↦t, z↦z0 of the Hecke tower, one has ⟨β^⟩=δn−1(−A)e(β)tr⁡n(πn(β))∣v=t, z=z0. The identity gives bracket value 1 on the one-strand identity closure. Its positive and negative Markov stabilizations multiply the raw bracket by −A3 and −A−3, respectively.

Facts & Assumptions

Given: n≥1, an n-strand braid β, the Laurent coefficient ring RA, and the definitions and relations named below.

[F1]

A crossing in the source chart is the A-smoothing with coefficient A plus the B-smoothing with coefficient A−1, and the loop value is δ=−A2−A−2 (Kauffman bracket smoothing and loop value).

[F2]

The positive geometric half twist has the explicit diamond path with label i passing below the midpoint and label i+1 above it; the reflected path is its inverse (The elementary geometric half twist, its support disc, and its opposite).

[F3]

Bn is generated by σ1,…,σn−1 with the Artin braid and distant-commutation relations, and the closure joins corresponding top and bottom endpoints with the strand orientations respected (The braid group by Artin presentation, The closure of a geometric braid).

[F4]

The vertical identity diagram has n through strands; ei has a top cap and bottom cup at positions i,i+1; stacking removes each closed loop with coefficient δ (Temperley–Lieb planar diagram data and endomorphism modules).

[F5]

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

[F6]

The local crossing operators satisfy R2 cancellation and the R3 braid identity in the declared source chart (Kauffman bracket R2 and R3 identities).

[F7]

The unnormalized diagram closure trace is cyclic, Tr⁡n+1(x⊗1)=δTr⁡n(x), and Tr⁡n+1((x⊗1)en)=Tr⁡n(x); when δ is a unit, τn=δ−nTr⁡n (Unnormalized diagram closure and partial trace, Diagram closure trace is cyclic and satisfies the tower rules).

[F8]

The Hecke tower has quadratic relation Ti2=(v−1)Ti+v, and its Ocneanu trace satisfies the tower restriction, cyclicity, and tr⁡n+1(xTn)=ztr⁡n(x) (The Markov trace on the type-A Hecke tower, The Ocneanu Markov trace exists and is unique).

[F9]

The assignment σi↦Ti is a group homomorphism to Hecke units, and Ti−1=v−1Ti+(v−1−1) (The Hecke generators satisfy the Artin relations and are units).

[F10]

The Hecke tower has the decomposition H(n+1)=H(n)⊕H(n)TnH(n) as an H(n)-bimodule (The Hecke tower is free over the previous level).

[F11]

The exponent sum is a homomorphism e:Bn→Z with e(σi)=1 (The exponent sum of a braid).

Proof

1.1F1F2F3F4F5F6construct

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. Thus its two smoothings are I with weight A and ei with weight A−1. For the opposite crossing the pairings exchange. Hence the local operators are Ci=AI+A−1ei,Ci−=A−1I+Aei. The relations [F5] and [F6] show these operators satisfy the Artin relations and are mutual inverses; distant generators commute by [F5].

2.1F5F8F9step 1.1algebra

Define ρn(σi)=Ci and Si:=−A−1Ci=−I−qei. With t=q2 and δ=−(q+q−1), direct multiplication gives Si2=I+(2q+q2δ)ei=I+(q−q3)ei=(t−1)Si+t. The braid and distant-commutation relations for Si follow from [F5] and step 1.1. Under the coefficient map ψ:Λ→RA given by v↦t and z↦z0, the assignment Ti↦Si therefore defines a compatible homomorphism ρH from the specialized Hecke tower to the Temperley--Lieb diagram algebras. For a braid word, this map sends πn(β) to the product of the corresponding Si±1.

3.1F7F8step 2.1algebra

The element A−4+1 is a unit in RA and δ=−A2(A−4+1) is therefore a unit. Set τn=δ−nTr⁡n. By [F7], τn(1)=1, τn+1(x⊗1)=τn(x), and τn is cyclic. Since Sn=−I−qen, the last closure rule of [F7] gives τn+1((x⊗1)Sn)=−τn(x)−qδ−1τn(x)=−1q2+1τn(x)=z0τn(x). Thus τ∘ρH satisfies all specialized Markov-trace rules, where ρH(Ti)=Si.

4.1F8F10step 3.1inductionalgebra

The decomposition in [F10] is a direct sum of modules spanned by disjoint subsets of the Hecke standard basis. Under ψ, that basis remains a basis, so for Hψ(n):=H(n)⊗Λ,ψRA the specialized tower still has Hψ(n+1)=Hψ(n)⊕Hψ(n)TnHψ(n). Any specialized Markov trace is therefore determined by its restriction to Hψ(n): restriction determines the first summand, while cyclicity and the Markov rule force tr⁡n+1(xTny)=z0tr⁡n(yx) on every product in the second summand. Starting at H(1), induction proves uniqueness, without dividing by any specialized parameter. The scalar extension of the Ocneanu trace exists by [F8], so the trace in step 3.1 equals that specialized trace.

5.1F1F3F7F9F11step 4.1algebra

Expand each crossing of β by Ci or Ci− and close the resulting Temperley–Lieb diagrams. The unnormalized trace counts each closed state circle with a factor δ, whereas the bracket state sum counts it with δ∣S∣−1; hence ⟨β^⟩=δ−1Tr⁡n(ρn(β))=δn−1τn(ρn(β)). Since Ci=−ASi and Ci−=(−A)−1Si−1, multiplying along an Artin word gives ρn(β)=(−A)e(β)ρH(πn(β)). Step 4.1 now gives the displayed trace identity.

6.1F7F8F9F11step 5.1algebra∎

The closure of the identity in B1 has one circle; the state sum gives δ1−1=1, and its trace expression gives δ0(−A)0tr⁡1(1)=1. For positive stabilization, the Markov trace factor is z0=−1/(q2+1), so the bracket formula changes by (−A)δz0=−A3. For negative stabilization, [F9] and [F8] give trace factor z−:=t−1(z0+1−t)=−q2q2+1; the bracket formula changes by δ(−A)−1z−=−A−3. This proves the unknot value and both stabilization normalizations.

Depends on

Used by

Dependency tree · two levels

51 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