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.

Jones–Wenzl projectors exist up to the first zero quantum integer

Statement

Let p≥4 be even, let A be a primitive 2p-th root of unity, and use the quantum integers and Temperley–Lieb loop value δ=−A2−A−2 specified above. Write r=p/2. The standard Jones–Wenzl recursion defines nonzero idempotents pn for 0≤n≤r−1; their unnormalized closure traces are [n+1]. In particular, pr−1 has trace zero and is negligible, while the next standard recursive formula for pr is undefined because its denominator is [r]=0. This statement concerns that recursion and does not assert that no differently constructed normalized idempotent can exist at rank r.

Facts & Assumptions

Given: An even integer p≥4, a primitive 2p-th root A, the BHMV loop value δ=−A2−A−2, and the standard recursive idempotents.

[F1]

The BHMV root-of-unity skein parameter: q=−A2, q2=A4 has order r=p/2, [j]=(qj−q−j)/(q−q−1), and δ=q+q−1.

[F2]

Jones–Wenzl recursion over unit quantum integers: the recursive element pn is defined only when every denominator [2],…,[n] is a unit; the recursion for pn+1 uses [n+1]−1.

[F3]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure: if [2],…,[n] are units, then pn is a nonzero idempotent, pnTLnpn=Cpn, and its unnormalized closure trace is [n+1].

[F4]

Diagram closure trace is cyclic and satisfies the tower rules: Tr⁡n(xy)=Tr⁡n(yx), including when δ=0.

[F5]

Negligible morphisms in the Temperley–Lieb category: an endomorphism f:n→n is negligible when Tr⁡n(g∘f)=0 for every g:n→n.

Proof

Given: The data and hypotheses in the Statement.

1.1givenF1algebra

Since q2 has exact order r, for 1≤j<r one has q2j≠1. Also q−q−1≠0, because q2≠1. Thus qj−q−j≠0 and [j]≠0 for every 1≤j<r. At j=r, q2r=1, so qr=q−r and [r]=0.

2.1givenF1F2F3step 1.1cases

For p≥6, one has r≥3, so every denominator [2],…,[r−1] is nonzero and therefore invertible in C. By [F2] and [F3], the recursion defines nonzero idempotents through pr−1 and gives Tr⁡r−1(pr−1)=[r]=0. For p=4, r=2 and pr−1=p1=11 is the initial projector; its closure is δ=[2]=0, so the same conclusion holds without using a rank-two denominator.

3.1F3F4F5step 2.1algebra

For any g∈TLr−1, [F3] gives pr−1gpr−1=λpr−1 for some λ∈C. Cyclicity [F4] gives Tr⁡(gpr−1)=Tr⁡(pr−1gpr−1)=λTr⁡(pr−1)=0. Thus pr−1 is negligible by [F5].

4.1F1F2step 1.1algebra∎

The recursive formula for pr requires the inverse of [r], which does not exist because [r]=0. Therefore that formula has no value at this step; in particular, assigning a value by cancelling a zero denominator is not part of the recursion. This leaves open the separate existence question for normalized idempotents constructed by other methods.

Depends on

Used by

Dependency tree · two levels

12 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