Alphabeta Math
Pipeline-generated
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

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

Companion: temperley-lieb-semisimplicity-and-generic-structure.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

At q squared of order three, TL2 is semisimple with a degenerate Jones trace

Example

Take q=eiπ/3, so q2 has order ℓ=3, δ=q+q−1=1, and n=2=ℓ−1. The algebra TL2(C,1) 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 u=d1. The right panel adds the exterior closure arcs in dashed blue; each joins top point i to bottom point i. Thus the four arcs form one closed component, so c(u)=1 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 u=d1 and loop parameter δ=1.

[F2]

The closure trace satisfies τ2(u)=δ−1τ1(1) (The normalized closure trace is cyclic and satisfies the Markov rules).

Verification

Given: q=eiπ/3, δ=1, and the basis {1,u}.

1.1F1givenalgebra

The elements u and 1−u are nonzero idempotents: u2=u, (1−u)2=1−u, and u(1−u)=(1−u)u=0 by [F1]. They sum to 1 and are linearly independent, so the two-dimensional algebra is Cu⊕C(1−u)≅C×C, hence semisimple.

2.1F1F2step 1.1algebra∎

By [F2], τ2(u)=1, while τ2(1)=1. The trace-pairing matrix in the basis {1,u} is therefore (τ2(1)τ2(u)τ2(u)τ2(u2))=(1111), whose nonzero vector 1−u pairs to zero with both basis vectors. Thus the trace form is degenerate although the algebra is semisimple.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

At zero loop value, rank three and rank four have opposite semisimplicity

Example

Take q=i, so δ=0 and q2 has order two. Then TL3(C,0) is semisimple, whereas TL4(C,0) is not.

Facts & Assumptions

Given: The quantum integers at q=i and the link-state Gram determinants.

[F1]

For q=i, [2k]q=0 and [2k+1]q=(−1)k; 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: q=i, ℓ=2, and ranks n=3,4.

1.1F1givenalgebra

For n=3, the allowed arc counts are p=0,1. The empty product gives det⁡G3,0=1, while the determinant formula gives det⁡G3,1=[3]q/[1]q=−1. Both link-state forms are nondegenerate, so Temperley–Lieb cell forms detect semisimplicity over the complex numbers implies TL3(C,0) is semisimple.

2.1F1givenstep 1.1algebra∎

For n=4, choose p=1. Then det⁡G4,1=[4]q/[1]q=0, so one cell form is degenerate. The reverse implication of Temperley–Lieb cell forms detect semisimplicity over the complex numbers gives that TL4(C,0) is not semisimple.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The rank-two Jones–Wenzl idempotent at loop value two

Example

Let q=1, so δ=2 and [r]q=r. In rank two the recursion gives p2=1−12d1, an idempotent annihilated by d1, with normalized closure trace τ2(p2)=3/4.

Facts & Assumptions

Given: q=1, δ=2, [r]q=r, and the rank-two generator d1.

[F2]

The recursion is p2=1−[1][2]d1, and its trace formula is τ2(p2)=[3]/22 (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.

1.1F1F2givenalgebra

Since [1]=1 and [2]=2, the recursion gives p2=1−12d1. By [F1], p22=1−d1+14d12=1−12d1=p2,d1p2=p2d1=0. The identity coefficient is 1, so p2≠0.

2.1F1F2step 1.1∎

The trace formula in [F2] gives τ2(p2)=[3]/22=3/4. This calculation uses the closure trace normalization τ2(1)=1, not the unnormalized categorical trace.

Sources