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.
Temperley–Lieb Semisimplicity and Generic Structure: Examples
1 · Prerequisites
- Adjunctions Units and Counits
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bruhat Decomposition and Flags over Finite Fields
- Categories, Functors and Natural Transformations
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Modular Representations and Projective Covers
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monoidal Categories and Monoidal Functors
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinary Hecke Specht Polytabloids and Signed Murphy Comparison
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Temperley–Lieb Diagram Algebra and Catalan Basis
- Temperley–Lieb Link-State Modules and Cellularity
- Temperley–Lieb Semisimplicity and Generic Structure
- Tensor Coherence and Algebraic Descent
- Tensor Products of Modules
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The Hook Length Formula and Rsk Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Type-A Hecke Specht Modules and Cellular Bases
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
These examples keep algebra semisimplicity, trace nondegeneracy, and projector recursion as separate calculations. At order three, rank two is semisimple even though the normalized Jones trace is degenerate. At zero loop value, rank three and rank four have different semisimplicity behavior. At loop value two, the rank-two Jones–Wenzl recursion and its normalized trace can be checked directly.
Each example uses only the definitions and proved complex results on temperley-lieb-semisimplicity-and-generic-structure. The examples are not theorem suppliers. The arbitrary-characteristic projector criterion is proved separately on the A page; none of these three complex examples uses it.
Examples
- At q squared of order three, TL2 is semisimple with a degenerate Jones trace computes the rank-two semisimple algebra and its degenerate trace form at .
- At zero loop value, rank three and rank four have opposite semisimplicity evaluates the odd/even split at zero loop value in ranks three and four.
- The rank-two Jones–Wenzl idempotent at loop value two verifies the projector and trace at .
Companion: temperley-lieb-semisimplicity-and-generic-structure.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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.
At zero loop value, rank three and rank four have opposite semisimplicity
Example
Take , so and has order two. Then is semisimple, whereas is not.
Facts & Assumptions
Given: The quantum integers at and the link-state Gram determinants.
For , and ; the determinants and semisimplicity test are given by The Temperley–Lieb link-state Gram determinant and Temperley–Lieb cell forms detect semisimplicity over the complex numbers.
Verification
Given: , , and ranks .
For , the allowed arc counts are . The empty product gives , while the determinant formula gives . Both link-state forms are nondegenerate, so Temperley–Lieb cell forms detect semisimplicity over the complex numbers implies is semisimple.
For , choose . Then , so one cell form is degenerate. The reverse implication of Temperley–Lieb cell forms detect semisimplicity over the complex numbers gives that is not semisimple.
The rank-two Jones–Wenzl idempotent at loop value two
Example
Let , so and . In rank two the recursion gives , an idempotent annihilated by , with normalized closure trace .
Facts & Assumptions
Given: , , , and the rank-two generator .
The recursion is , and its trace formula is (Jones–Wenzl recursion in the nonvanishing-denominator range, The Jones–Wenzl recursion gives annihilating idempotents and their trace).
Verification
Given: The stated parameter and rank-two algebra.
Since and , the recursion gives . By [F1], The identity coefficient is , so .
The trace formula in [F2] gives . This calculation uses the closure trace normalization , not the unnormalized categorical trace.