Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 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.

Depends on

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