Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck escalatedjudge 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.

The root negligible quotient is semisimple with truncated fusion

Statement

Let q=eπi/ℓ, ℓ≥3, δ=q+q−1 and τn=δ−nTr⁡n. Put

Rad⁡(τn)={x∈TLn:τn(xy)=0 for every y∈TLn}.

Let In be the two-sided ideal generated by pℓ−1⊗1n−ℓ+1 for n≥ℓ−1, and In=0 below that rank. Then In=Rad⁡(τn), and TLn/In is the direct sum of full matrix algebras with multiplicities given by length-n paths from 0 of heights 0,…,ℓ−2. The additive idempotent-complete negligible quotient has simple labels 0,…,ℓ−2, represented by pa, and

a⊗b≅⨁∣a−b∣≤c≤min⁡(a+b,2ℓ−4−a−b)c≡a+b (2)c.

At n=ℓ−1 the unreduced algebra is semisimple, while its trace radical is the nonzero one-dimensional block generated by pℓ−1. Trace radical and Jacobson radical are therefore distinct at this first boundary.

Facts & Assumptions

Given: The positive root parameter, unnormalized closure and the fixed embedded boundary ideals.

[F1]

Root fusion paths have nonzero pairings proves the complete retained-path decompositions and matrix units, with diagonal trace weights [a+1].

[F2]

Every boundary tensor-ideal component is the fixed embedded two-sided ideal proves that the boundary tensor ideal has exactly these endomorphism components, including zero below the boundary.

[F3]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives the projector corner, annihilation and trace formulas. Diagram closure trace is cyclic and satisfies the tower rules gives the closure trace rules.

[F4]

Partial-trace closure of negligible morphisms proves negligibility is a tensor ideal when both pivotal traces agree on every endomorphism. In this planar category the two full closures have the same component count on each basis matching, hence agree by linearity. Temperley–Lieb quantum integers and quantum characteristic gives [a+1]>0 on retained labels and [ℓ]=0.

[F5]

General Temperley–Lieb theta-net evaluation and its root domain gives the unique bundled trivalent matching, its theta pairing, exact generic/unit domain, and positive/zero root level alternatives.

Proof

1.1F2F3F4givenalgebra

Write m=ℓ−1 and p=pm. It is a nonzero idempotent with one-dimensional corner and trace [ℓ]=0 by [F3,F4]. For every x, cyclic closure gives Tr⁡(px)=Tr⁡(pxp); the latter is a scalar multiple of Tr⁡(p)=0. Thus p is negligible. By [F4], the categorical tensor ideal it generates is negligible, and [F2] identifies its endomorphism component as exactly In. Consequently In⊆Rad⁡(Tr⁡n) at every rank. The scalar δ−n exists and does not change this radical.

2.1F1F2F3F4step 1.1algebra

In the quotient by In, [F1] gives matrix units Ea,b for paths ending at each retained c, with trace Tr⁡(Ea,b)=δa,b[c+1]. If an element has a nonzero coefficient at Ea,b, multiplying by Eb,a detects it in this nonzero weighted matrix-trace pairing. The quotient trace pairing is therefore nondegenerate. Together with step 1.1 this proves In=Rad⁡(τn) and the full matrix-block description. Inserting the path decompositions on both ends describes every unequal-degree Hom space as the corresponding rectangular matrix blocks; its pairing with the reverse Hom space is also nondegenerate. Thus the categorical negligible ideal is precisely the boundary tensor ideal, not a larger ideal known only on endomorphisms. The endpoint corners are Cpc, so its additive Karoubi quotient is semisimple with exactly the stated simple labels.

3.1F1F3F5step 2.1algebra

Sandwich a basis matching from c to a+b between pc and pa⊗pb. Any arc joining two points of the same labelled arm is killed by its innermost adjacent turnback. A remaining matching must have the three bundle sizes (a+b−c)/2, (b+c−a)/2, (c+a−b)/2, so it exists only for a triangle/parity triple and is unique. Thus this projected Hom space is spanned by the vertex of [F5], and its reverse by the reflected vertex. Their trace pairing is the exact theta scalar. When the labels are retained, [F5] makes it positive exactly for a+b+c≤2ℓ−4 and zero above that level. Step 2.1 identifies quotient Hom with this pairing modulo its radical, so its dimension is respectively one or zero. In a semisimple category these are precisely the simple multiplicities in pa⊗pb. The triangle, parity and level inequalities yield the displayed truncated rule. No theta value is divided at a forbidden level.

4.1F1F3F4step 2.1algebra∎

Finally work at rank m=ℓ−1 before quotienting. The same up/down path proof as [F1] applies without deleting its final up endpoint pm: a length-m path cannot exceed height m, and every split before its final step uses only [1],…,[m], which are nonzero. All endpoint projectors up to pm are nonzero by their identity coefficient. The matching-turnback corner calculation gives full matrix units just as before, now including the endpoint m; their completeness is the unreduced JW split. Hence TLm is semisimple. The endpoint-m block has the unique all-up path and is Cpm. Its trace weight is [m+1]=0, whereas every other endpoint weight is positive. Thus precisely this one-dimensional block is the trace radical, while semisimplicity makes the Jacobson radical zero. This proves the boundary assertion directly, without assuming a later ordinary semisimplicity criterion.

Depends on

Used by

Dependency tree · two levels

20 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