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.
At q squared of order three, TL2 is semisimple with a degenerate Jones trace
Example
Take , so has order , , and . The algebra is semisimple, but its normalized closure trace form is degenerate.
Diagram
In the left panel the solid top cap and bottom cup are the basis diagram . The right panel adds the exterior closure arcs in dashed blue; each joins top point to bottom point . Thus the four arcs form one closed component, so in the closure-trace definition. The drawing records the matching graph only; the algebra and trace calculations below prove the claims independently.
\begin{tikzpicture}[x=1cm,y=1cm,line width=0.8pt,baseline=(current bounding box.center)]
\fill (0,1) circle (1.5pt); \fill (1,1) circle (1.5pt);
\fill (0,-1) circle (1.5pt); \fill (1,-1) circle (1.5pt);
\draw (0,1) to[out=90,in=90] (1,1);
\draw (0,-1) to[out=-90,in=-90] (1,-1);
\node at (0.5,0) {$u$};
\node at (0.5,-1.65) {basis diagram};
\fill (3,1) circle (1.5pt); \fill (4,1) circle (1.5pt);
\fill (3,-1) circle (1.5pt); \fill (4,-1) circle (1.5pt);
\draw (3,1) to[out=90,in=90] (4,1);
\draw (3,-1) to[out=-90,in=-90] (4,-1);
\draw[dashed,blue] (3,1) to[out=180,in=180] (3,-1);
\draw[dashed,blue] (4,1) to[out=0,in=0] (4,-1);
\node at (3.5,-1.65) {closed graph: one component};
\end{tikzpicture}
Facts & Assumptions
Given: The rank-two diagram algebra with generator and loop parameter .
The diagram basis of is ; stacking gives , and the closure trace is normalized by (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal, The elementary diagram generators satisfy the local Temperley–Lieb relations, Normalized Temperley–Lieb trace from diagram closure).
The closure trace satisfies (The normalized closure trace is cyclic and satisfies the Markov rules).
Verification
Given: , , and the basis .
The elements and are nonzero idempotents: , , and by [F1]. They sum to and are linearly independent, so the two-dimensional algebra is , hence semisimple.
By [F2], , while . The trace-pairing matrix in the basis is therefore whose nonzero vector pairs to zero with both basis vectors. Thus the trace form is degenerate although the algebra is semisimple.
Depends on
- Temperley–Lieb quantum integers and quantum characteristic
- Temperley–Lieb planar diagram data and endomorphism modules
- Normalized Temperley–Lieb trace from diagram closure
- The normalized closure trace is cyclic and satisfies the Markov rules
- The elementary diagram generators satisfy the local Temperley–Lieb relations
- Stacking is associative and horizontal juxtaposition is strict monoidal
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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
- K. Iohara, G. I. Lehrer, and R. B. Zhang, The Jones Quotients of the Temperley-Lieb Algebras (standard reference, not scraped)
- David Ridout and Yvan Saint-Aubin, Standard Modules, Induction and the Structure of the Temperley-Lieb Algebra (standard reference, not scraped)