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 be even, let be a primitive -th root of unity, and use the quantum integers and Temperley–Lieb loop value specified above. Write . The standard Jones–Wenzl recursion defines nonzero idempotents for ; their unnormalized closure traces are . In particular, has trace zero and is negligible, while the next standard recursive formula for is undefined because its denominator is . This statement concerns that recursion and does not assert that no differently constructed normalized idempotent can exist at rank .
Statement references
Facts & Assumptions
Given: An even integer , a primitive -th root , the BHMV loop value , and the standard recursive idempotents.
The BHMV root-of-unity skein parameter: , has order , , and .
Jones–Wenzl recursion over unit quantum integers: the recursive element is defined only when every denominator is a unit; the recursion for uses .
Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure: if are units, then is a nonzero idempotent, , and its unnormalized closure trace is .
Diagram closure trace is cyclic and satisfies the tower rules: , including when .
Negligible morphisms in the Temperley–Lieb category: an endomorphism is negligible when for every .
Proof
Given: The data and hypotheses in the Statement.
Since has exact order , for one has . Also , because . Thus and for every . At , , so and .
For , one has , so every denominator is nonzero and therefore invertible in . By [F2] and [F3], the recursion defines nonzero idempotents through and gives . For , and is the initial projector; its closure is , so the same conclusion holds without using a rank-two denominator.
For any , [F3] gives for some . Cyclicity [F4] gives . Thus is negligible by [F5].
The recursive formula for requires the inverse of , which does not exist because . 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
- Louis H. Kauffman and Sostenes L. Lins, Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds, Chapter 3 (standard reference, not scraped)
- C. Blanchet, N. Habegger, G. Masbaum, and P. Vogel, Topological Quantum Field Theories Derived from the Kauffman Bracket, §3 (standard reference, not scraped)
- Joshua Chen, The Temperley-Lieb Categories and Skein Modules, §5.3 (standard reference, not scraped)