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.

✓ 6 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 6 also cleared it.

Temperley–Lieb Root-of-Unity and Modular Representation Theory

1 · Prerequisites

2 · Summary

This page keeps three separate subjects: complex root-of-unity standard modules, Spencer’s arbitrary-characteristic decomposition theory, and the negligible quotient/TLJ category. A result in one subject is not used to fill a proof gap in another.

Companion: temperley-lieb-root-of-unity-and-modular-representation-theory-examples.

Reading prerequisite

The controlling plan requires temperley-lieb-semisimplicity-and-generic-structure. The earlier cellularity page is useful reading context, but the current plan does not declare it as a direct requires edge.

1. Complex roots of unity

Fix q∈C×, δ=q+q−1, rank n≥0, and arc count p with 0≤p≤⌊n/2⌋; the defect count is t=n−2p. The critical parameter is κ=ord⁡(q2), kept distinct from the recurrence quantum characteristic ℓ. In particular at q=±1, κ=1 but ℓ=∞. The exact critical and reflected-label conventions are Complex Temperley–Lieb critical labels and reflection.

The supplied local results establish that every critical complex standard module has nondegenerate capping form and is simple (Critical complex Temperley–Lieb standard modules are simple). This includes the κ=1 case and all critical labels at κ=2. The exceptional δ=0, n=2p>0 perfect-matching standard module has identically zero ordinary form, but its actual module is simple by a separately proved renormalized-pairing and generator argument (The zero-loop perfect-matching standard module is simple). Its zero form quotient is not used to infer its head.

The full complex classification is supplied by Complex-root standard radicals, simple heads and reflection linkage. A noncritical standard has a simple radical at the adjacent reflected label when that label is present; otherwise its radical is zero. The nonsplit radical/head sequence gives the composition factors and reflection linkage. The separate zero-loop perfect-matching result is retained: its ordinary form quotient is zero, while its actual simple module is the neighboring nonzero simple head. The proofs include κ=1,2,3, all higher finite orders, and the non-root regime.

The explicit annular central element and induced link-state basis construct the reflection maps (The annular central element constructs Temperley–Lieb reflection maps), and the regular orthogonal Gram-block calculation gives their exact kernel/image dimensions (Root Gram ranks give the reflected simple-head dimensions). All inter-standard maps are classified in All Hom spaces between complex Temperley–Lieb standards, including the exceptional reverse rank-two map at δ=0. Projective covers and their exact standard filtrations, together with their repeated-induction realization, are proved in Projective covers of complex-root Temperley–Lieb simple modules. These are complex-field results; the separate Spencer and tilting-category statements below retain their own hypotheses.

2. Arbitrary characteristic and Spencer digits

For a field K of characteristic P (with P=∞ in characteristic zero), a loop value δ∈K, and recurrence quantum characteristic ℓ, the exact digit and support-set convention is defined in Spencer quantum-characteristic digits and support set. The support calculation in The Spencer support set for rank label eleven in characteristic three is purely arithmetic.

The full Spencer composition claim is retained with its source conventions: write S(n,m)=Wn,m(K,δ), with the left/right convention converted by diagram reflection, for the standard module with m propagating strands, and let D(n,r) denote the nonzero simple cell-form quotient of Wn,r. Here m,r are admissible defect labels: 0≤m,r≤n and n−m,n−r are even. With Supp⁡ℓ,P(r) defined from the digits of r+1, the claim is that D(n,r) is a composition factor of S(n,m) exactly when m∈Supp⁡ℓ,P(r), with multiplicity one. The full arbitrary-field formula is proved in Spencer decomposition numbers over arbitrary fields, including characteristic two, the loop values δ=±2, and the zero-form standard Wn,0 when δ=0.

The separate field-level normalized Jones–Wenzl claim is also retained: over a field, index N has a normalized annihilating Jones–Wenzl idempotent exactly when N<ℓ, or when N=a si−1 for i≥1 and a finite scale si with 1≤a<P. In characteristic zero this includes every N=aℓ−1 with a≥1; when ℓ=∞, every finite N lies in the first branch. The field criterion Spencer's quantum-characteristic criterion for Jones–Wenzl existence is proved on its owning A page using a split integral diagram representation, the quantum-binomial existence test, and a complete digit reduction; this does not establish the separate full composition-factor classification. The separate coefficient-ring theorem Jones–Wenzl projectors over a coefficient ring and quantum-binomial units proves existence over every commutative ring exactly when every polynomial quantum-binomial in the row is a unit. It proves necessity by an explicit word-space kernel and unit descent through a free quadratic extension, and sufficiency by an integral linear retraction followed by coefficient projection of the normalized annihilation equations.

The decomposition proof supplies its prerequisites locally: exact diagram truncation reduces multiplicities to trivial factors, signed forest candidates and their composition give every support factor by a submodule-functional induction, and a digit-carry recurrence with Gram-determinant units gives the upper bound. The hook weights use the argument −δ to match the positive-loop diagram convention. The separate field-level Jones–Wenzl theorem remains on its owning page, and coefficient-ring descent is supplied by Jones–Wenzl projectors over a coefficient ring and quantum-binomial units.

3. Negligible quotient and root tilting centralizers

For every complex loop value δ, negligible morphisms are defined by the unnormalized closure pairing and are proved to form a two-sided composition ideal and tensor ideal (Negligible morphisms in the Temperley–Lieb category, Negligible Temperley–Lieb morphisms form a tensor ideal). At q=eπi/ℓ, ℓ≥3, the locally defined TLJℓ is the additive idempotent completion of the quotient (The Temperley–Lieb negligible quotient and TLJ completion).

The quotient completion is semisimple with simple labels 0,…,ℓ−2 represented by the retained Jones–Wenzl projectors. The complete truncated fusion rule, including both endpoints and the negligible boundary object, is proved in The root negligible quotient is semisimple with truncated fusion. Its proof identifies the full embedded boundary ideal with the trace kernel through all-rank fusion paths and their nonzero pairings. The distinction between trace radical and Jacobson radical at the first boundary is retained.

The same theorem gives the dimension generating function directly. Let A be the adjacency matrix of the finite path with vertices 0,…,ℓ−2, and let Qn be the Jones quotient. The matrix blocks give dim⁡Qn=∑a((An)0a)2=(A2n)00, since A is symmetric. In formal power series, coefficientwise multiplication proves (I−zA2)∑n≥0znA2n=I. Consequently ∑n≥0(dim⁡Qn)zn=((I−zA2)−1)00. This is rational: the constant term of the determinant is 1, and cofactor expansion gives the inverse as its adjugate divided by its determinant. No analytic convergence is assumed.

The full reduced rank-one tilting category, including all tiltings and their negligible summands, is constructed in The specified rank-one divided-power tilting category, Rank-one Weyl strings, tensor filtrations, and tilting classification, and Outside-alcove rank-one tiltings have zero pivotal dimension. Its semisimple ribbon quotient and truncated fusion are The rank-one tilting quotient is the truncated fusion category. For every ℓ≥3, including even ℓ, The rank-one tilting quotient matches the Temperley-Lieb ribbon convention identifies the positive-loop Jones quotient with the endomorphism algebra of the reduced tensor power of Δ(1) and proves the exact image and boundary kernel. The unreduced action does not kill the boundary projector.

The categorical sign convention is explicit: quantum self-duality has loop −δ, the diagram category used for the full ribbon comparison is TL(−δ) with its pivotal structure corrected by tensor parity, and its endomorphism algebras correspond to positive-loop TL by Ui=−ei. This yields the retained pivotal dimensions and twists. No equivalence with the unmodified positive-loop unoriented pivotal category is asserted. The Iohara–Lehrer–Zhang generators fi satisfy fi2=−δfi and correspond to di=−fi at the algebra level. The Jones quotient and reduced centralizer remain distinct from the unreduced TL action and generic Schur–Weyl assertions.

Scope of the results

The complex standard-module classification is over C with its stated order convention. The Spencer decomposition theorem applies over every field with the recurrence quantum characteristic; the coefficient-ring Jones–Wenzl criterion instead requires the entire polynomial quantum-binomial row to consist of units. The reduced tilting and ribbon conclusions use q=eπi/ℓ, ℓ≥3, and the signed, parity-corrected categorical convention stated above. These hypotheses are kept separate throughout the proofs.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Complex Temperley–Lieb critical labels and reflection

Definition

Let q∈C×. Define κ=ord⁡(q2) if q2 has finite multiplicative order, and κ=∞ otherwise. For integers n≥0 and p with 0≤p≤⌊n/2⌋, set the defect label t=n−2p; here p counts arcs and t counts defects. The pair (n,p) is critical at q when κ<∞ and κ∣(t+1), equivalently q2(t+1)=1. If κ=∞, no pair is critical. When κ=1 every allowed pair is critical.

For finite κ≥2 and a noncritical pair, write uniquely t+1=kκ+r,k≥0,1≤r<κ. Its reflection label across the next critical line is p♯=p+r−κ. This reflected label is called present only when p♯≥0; it then automatically satisfies p♯≤⌊n/2⌋. If p♯<0, there is no label in range on that side. A critical label is treated as a singleton under reflection. These are arithmetic label conventions; they do not by themselves assert radical, composition-factor, Hom-space, or projective-cover formulas.

The order κ is kept separate from the recurrence quantum characteristic ℓ of Temperley–Lieb quantum integers and quantum characteristic. For q=±1, κ=1 while the complex recurrence quantum characteristic is ∞.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Critical complex Temperley–Lieb standard modules are simple

Statement

Let q∈C×, δ=q+q−1, n≥0, and 0≤p≤⌊n/2⌋. Put t=n−2p, let κ=ord⁡(q2), and let ϕn,t be the link-state capping form on Wn,t(C,δ). If (n,p) is critical in the sense of Complex Temperley–Lieb critical labels and reflection, then ϕn,t is nondegenerate and Wn,t(C,δ) is simple.

Facts & Assumptions

Given: q∈C×, δ=q+q−1, an allowed (n,p), and the critical-label convention.

[F1]

The complex quantum integers satisfy [r]q=(qr−q−r)/(q−q−1) for q≠±1, and [r]q=rqr−1 for q=±1; the recurrence quantum characteristic is distinct from κ at q=±1 (Temperley–Lieb quantum integers and quantum characteristic).

[F2]

Wn,t has the link-state basis indexed by p-arc partial matchings, and ϕn,t is the reflection-and-capping form (Temperley–Lieb link-state standard modules by defect number, The link-state Gram form is symmetric and invariant).

[F3]

For dn,r=(nr)−(nr−1) with (n−1)=0, its Gram determinant is det⁡Gn,p=∏j=1p([t+1+j]q[j]q)dn,p−j, where the entire product denotes its polynomial continuation in δ; individual quotients are initially rational functions (The Temperley–Lieb link-state Gram determinant).

[F4]

The nonzero cell-form quotient is simple; when the cell form is nondegenerate its radical is zero, so the quotient is the entire standard module (Nonzero Temperley–Lieb cell forms give all simple heads).

[F5]

Criticality means κ<∞ and κ∣(t+1); at κ=1 this includes every allowed label (Complex Temperley–Lieb critical labels and reflection).

Proof

technique · Evaluate each determinant factor, including its removable root limit
1.1F1F3F5givenalgebra

If κ=1, then q=±1. By [F1], every positive quantum integer is nonzero, so each factor [t+1+j]q/[j]q in [F3] is nonzero. Therefore det⁡Gn,p≠0 in this case.

1.2F1F3F5givenalgebra

Suppose κ≥2. By [F5], there is an integer m≥1 with t+1=mκ. Fix a root q0=q and write ϵ=q0mκ∈{1,−1}. For any j not divisible by κ, [j]q0≠0 and [mκ+j]q0=ϵ[j]q0, by substituting q0mκ=q0−mκ=ϵ in the quantum-integer formula. Thus this quotient is nonzero.

2.1F1F3step 1.2algebra

If j=sκ with s≥1, the quotient in [F3] has a removable zero-over-zero. Write nearby parameters as q=eu, with u0 satisfying eκu0=ϵ0∈{1,−1}. Since κ≥2, q0≠±1 and sinh⁡u0≠0. From [aκ]eu=sinh⁡(aκu)/sinh⁡u, the ratio has limit lim⁡u→u0[(m+s)κ]eu[sκ]eu=m+ss(−1)mv≠0, where κu0=πiv for an integer v; this follows by taking the ratio of the first derivatives of the two vanishing numerators. Also d(q+q−1)/dq=1−q−2≠0 at q0, so this quotient also has a removable continuation locally in δ at the chosen root. Thus every rational factor in [F3] is regular and nonzero there, and their product equals the determinant polynomial by [F3].

3.1F2F3step 1.1step 2.1algebra

The exponents dn,p−j in [F3] are nonnegative integers, and an empty product is 1. Steps 1.1–2.1 therefore give det⁡Gn,p≠0 for every critical label, so the finite-dimensional form ϕn,t is nondegenerate.

4.1F2F4step 3.1∎

By [F4], a nondegenerate cell form has zero radical and its quotient by that radical is simple. The quotient is Wn,t itself, so this standard module is simple.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The zero-loop perfect-matching standard module is simple

Statement

Let p≥1, q∈{i,−i}, δ=q+q−1=0, and n=2p. Then the right Temperley–Lieb standard module W2p,0(C,0), whose basis consists of noncrossing perfect matchings of 2p sites, is simple. This conclusion concerns the actual module; its ordinary link-state form is identically zero and its zero form quotient is not used.

Facts & Assumptions

Given: p≥1, q=±i, δ=0, the link-state modules and the stacking right action.

[F1]

The link-state basis consists of noncrossing partial matchings with p=(n−t)/2 arcs and t defects (Temperley–Lieb link-state standard modules by defect number).

[F2]

Stacking below a link state defines its right action by the corresponding Temperley–Lieb diagram (The link-state quotient is a right Temperley–Lieb module).

[F3]

The capping form on basis states is δc when all defect paths propagate and zero otherwise (The link-state Gram form is symmetric and invariant).

[F4]

At a critical complex label the link-state capping form is nondegenerate (Critical complex Temperley–Lieb standard modules are simple).

[F5]

Criticality is κ<∞ and κ∣(t+1), with κ=ord⁡(q2) (Complex Temperley–Lieb critical labels and reflection).

[F6]

Temperley–Lieb diagrams are noncrossing matchings; stacking removes each closed component with factor δ, and the composition is associative (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

Proof

technique · Replace the identically zero perfect-matching form by its first coefficient in the loop parameter, identify that pairing with a critical one-defect form, and construct operators that generate every basis state
1.1F1F3givenconstruct

For a parameter variable b, let ϕb be the link-state form on the fixed basis of W2p,0(C,b). If a,c are perfect matchings, their overlay is a disjoint union of C(a,c)≥1 alternating cycles, counting a shared arc as a two-edge cycle; therefore ϕb(a,c)=bC(a,c). Define the bilinear form ϕ′(a,c)=ddbϕb(a,c)∣b=0. It follows that ϕ′(a,c)=1 when C(a,c)=1 and 0 when C(a,c)>1.

2.1F1F3step 1.1construct

Delete site 2p and its incident arc from a perfect matching, and declare its partner to be the single defect. This is a bijection from perfect matchings on 2p sites to the link-state basis of W2p−1,1: the inverse joins the unique defect to the appended site 2p. For a pair a,c, deleting the two arcs incident to site 2p turns exactly the overlay cycle containing that site into the open path between the defects and leaves the other C(a,c)−1 cycles unchanged. Hence the ordinary one-defect Gram value of the images is bC(a,c)−1, whose value at b=0 equals ϕ′(a,c). Thus the matrix of ϕ′ is exactly the Gram matrix of W2p−1,1(C,0).

3.1F4F5step 2.1given

For W2p−1,1 the arc count is p−1, the defect count is 1, and q2=−1 has order κ=2. Since κ∣(1+1), this is a critical label. By [F4], its Gram form is nondegenerate; step 2.1 then shows that ϕ′ is nondegenerate.

3.2F1F2F3F6step 1.1step 2.1algebra

For two link states x,y on 2p sites with two defects, define Dx,y to be the Temperley–Lieb diagram whose bottom arcs are those of x, whose top arcs are those of y, and whose two unmatched bottom sites are joined to the two unmatched top sites in left-to-right order by propagating strands. This matching is planar and is an allowed basis diagram. Let x′ and y′ be the perfect matchings obtained by joining the two defects of x and y, respectively. If z is a basis perfect matching and C(y′,z) is the number of cycles in the overlay of y′ and z, stacking z above Dx,y leaves the bottom matching x′ and removes exactly C(y′,z)−1 closed cycles. Therefore z⋅Dx,y=δC(y′,z)−1x′, where the coefficient at δ=0 is defined as 1 when C(y′,z)=1 and 0 when C(y′,z)>1. This coefficient is exactly ϕ′(y′,z), so z⋅Dx,y=ϕ′(y′,z)x′. The same equality holds for every z by linearity.

4.1F1F2step 3.1step 3.2choosealgebra∎

Let z≠0. Nondegeneracy of ϕ′ gives a nonzero functional ϕ′(−,z), so at least one perfect-matching basis vector y′ has ϕ′(y′,z)≠0. For any target basis matching x′, cut from x′ and y′ the arcs incident to site 2p to obtain two-defect link states x,y. By step 3.2, z⋅Dx,y is a nonzero scalar multiple of x′. Thus the submodule generated by z contains every basis vector and equals W2p,0. Every nonzero submodule contains such a z, so the module is simple.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The annular central element constructs Temperley–Lieb reflection maps

Statement

Work over C, with q≠0, δ=q+q−1. Write An=TLn(C,δ) and Vn,p=Wn,n−2p(C,δ). There is a central, reflection-invariant element Fn∈An acting on Vn,p by fn,p=qn−2p+1+q−(n−2p+1). When q≠±1 and (n,p) is noncritical, restriction splits as Vn,p↓=Vn−1,p⊕Vn−1,p−1. Except at (n,p,δ)=(2,1,0), induction has a natural exact sequence 0⟶Vn+1,p+1⟶Vn,p↑⟶Vn+1,p⟶0, which splits when (n,p) is noncritical. Here induction of a right module means V⊗AnAn+1.

If κ=ord⁡(q2)≥2 and p<p′ are a pair reflected in a single intervening critical line, meaning 0<p′−p<κ and p=p′+r(n,p′)−κ, then Hom⁡An(Vn,p,Vn,p′)≠0. Out-of-range standard modules are zero. Statements about a splitting omit zero summands.

Facts & Assumptions

Given: The diagram algebra, link-state bases, q,δ, and reflection conventions.

[F1]

Diagram stacking is associative, reflection is an anti-involution, the elementary diagrams di generate, and di2=δdi, didi±1di=di, didj=djdi for ∣i−j∣>1 (Stacking is associative and horizontal juxtaposition is strict monoidal, Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram, The elementary diagram generators satisfy the local Temperley–Lieb relations). The spanning Jones normal forms are Jones normal forms span and are counted by Catalan paths.

[F3]

For generic q the link-state Gram matrix is invertible, by The Temperley–Lieb link-state Gram determinant.

[F4]

Criticality and adjacent reflection labels are those of Complex Temperley–Lieb critical labels and reflection.

Proof

technique · Use an explicit partial closure of braid words, the induced link-state basis, and adjunction
1.1F1givenconstructalgebra

It suffices to perform computations for left modules: send a right module to the left module with a⋅v=v⋅a∗, where ∗ is diagram reflection. This is an exact equivalence preserving Hom direction, induction and restriction. Fix a square root of q and put gi=q1/21−q−1/2di. Expanding with [F1] gives gi−1=q−1/21−q1/2di and gigi+1gi=gi+1gigi+1. Let Tn:An+1→An close the last top endpoint to the last bottom endpoint externally on the right, removing any resulting loop with factor δ. This is an An-bimodule map by the matching rule. Define Mn=gn⋯g2g12g2⋯gn and Fn=Tn(Mn); set F0=δ. Every summand of Mn has an even total number of square-root factors, so Fn has coefficients in Z[q,q−1], independent of the chosen square root.

1.2F1F2givenconstructalgebra

For clarity give a basis proof of the induction sequence. In left-module notation put hr=drdr+1⋯dn for 1≤r≤n, and hn+1=1. A state d is r-admissible when it has no adjacent arc at an index i≥r. The tensors hr⊗d with d r-admissible, including all 1⊗d, span An+1⊗AnVn,p. First, a diagram word is a sum of hru with u∈An: reverse a spanning Jones normal form from [F1]. Its initial ascending block is either hr or contains no dn, and every later block lies in An. The surjection from the presented algebra to the diagram algebra is supplied by the local relations, so this spanning assertion applies to diagram words. Next, if d has its largest adjacent arc at s≥r, write d=dsf. For n≥3 this can be done without division: move the endpoint immediately outside that adjacent arc through the arc, so applying ds restores d and creates no loop. If s=1 use site 3; otherwise use site s−1. The outside site is either a defect or an endpoint of another arc, and reconnecting its former partner supplies the inverse state f. Now the relations give hr⊗d=hs+2⊗dr⋯ds−1d. The latter state is (s+2)-admissible: the adjacent arc at s has moved to r, all intervening endpoints shift by two, and the tail beyond s+1 still has no adjacent arc. Repetition, increasing r, proves spanning. At n=1,2 the same conclusion is checked on the at most two states, except n=2,p=1,δ=0, when the needed factorization d=d1f fails.

2.1F1step 1.1algebra

The braid relations give giMn=Mngi for i<n. To see this directly, commute gi past all gj with ∣j−i∣>1 in the descending and ascending strings; the remaining equality is gigi+1gi=gi+1gigi+1 on each side of the middle string. This proves the equality inductively in the length of the strings, starting with g1g2g12g2=g2g12g2g1. Bimodule linearity of Tn gives giFn=Fngi, hence diFn=Fndi. Thus Fn is central. Reversing the palindromic word Mn and reflecting its closure leaves it unchanged, so Fn∗=Fn.

3.1F1F2F3step 1.1step 2.1algebra

Compute Fn on the state zp with adjacent arcs (1,2),(3,4),…,(2p−1,2p) and all remaining sites defects. At a cup, expansion of the two adjacent crossings uses the identities digi+1gi=−didi+1 and gigi+1di=−di+1di; for example the first is qdi−didi+1−δdi+q−1didi+1di=−didi+1. The two minus signs on the two sides of each cup cancel. Thus each initial cup can be removed without changing the coefficient of zp. For the t=n−2p defect strands, expand the auxiliary strand successively from its first crossing. A smoothing connecting two defects vanishes in the standard quotient. There are two remaining continuations: following the auxiliary strand on its two sides gives respectively qtδ−qt−1=qt+1 and q−tδ−q−t+1=q−(t+1). The factors arise by choosing the identity smoothing at each subsequent crossing until the final cap; that cap either closes a loop or chooses the second smoothing, giving the displayed two terms on each side. Hence the coefficient of zp is fn,p. For generic q, [F3] makes the form nondegenerate. Capping z against y and then attaching x gives the rank-one diagram operator z↦ϕ(y,z)x, because lower-propagating terms vanish. Thus every nonzero vector generates the standard, which is simple. Centrality now makes Fn scalar on the entire standard: over C a central operator has an eigenvalue, whose nonzero eigenspace is the simple module. Since the action matrices and fn,p are Laurent polynomial in q, this scalar identity extends to every q≠0.

4.1F2F4step 3.1algebra

On the submodule and quotient in [F2], Fn−1 acts by fn−1,p and fn−1,p−1. Their difference is −(q−q−1)(qn−2p+1−q−(n−2p+1)). Under the noncritical and q≠±1 hypotheses it is nonzero. The operator on the restriction satisfies (Fn−1−fn−1,p)(Fn−1−fn−1,p−1)=0, because each factor kills its respective subquotient. Its two spectral projections therefore give an invariant direct sum splitting the restriction sequence.

5.1F1F2step 4.1step 1.2algebra

Append an adjacent arc at sites n+1,n+2 to d, obtaining dˉ∈Vn+2,p+1. The map Φ(u⊗d)=udˉ into Vn+2,p+1↓ is balanced and An+1-linear: elements of An act only on the first n sites. Its image of hr⊗d has its rightmost adjacent arc at r; deleting that arc recovers d. Conversely every (n+2,p+1)-state has a rightmost adjacent arc; delete it at position r, and the remaining state is r-admissible. These two operations are inverse, so the spanning tensors in step 1.2 map bijectively to the link-state basis. They are therefore a basis and Φ is an isomorphism, except in the stated exceptional case. Applying the restriction sequence [F2] to Vn+2,p+1 now gives the asserted induction sequence. Applying step 4.1 at rank n+2 splits it whenever (n,p) is noncritical, since n+2−2(p+1)+1=n−2p+1.

6.1F1F4step 1.1step 3.1step 1.2step 5.1algebra

Suppose (n,p) is critical, q≠±1, and zp is as in step 3.1. In the induced basis the coefficient of h2p+1⊗zp in Fn+1(1⊗zp) is (−1)n(δ2−4)≠0. Here is the local expansion computing it. First take p=0. To leave h1=d1⋯dn after reduction, the first pair of crossings of the closed auxiliary strand has three contributing smoothings, with weights −1,−1,δq−1; the fourth, of weight q, closes off the needed through path. This gives −2+δq−1. At each of the next n−1 pairs exactly one continuation retains the required external matching, of weight −1: the other continuation either caps the auxiliary path prematurely or makes an additional bottom arc. At the final pair the corresponding three weights are −1,−1,δq, giving −2+δq. Their product is (−1)n−1(−2+δq−1)(−2+δq)=(−1)n(δ2−4). The required exterior matching of h1 has top pair (1,2), bottom pair (n,n+1), and through paths from top j+2 to bottom j for 1≤j<n. Follow the auxiliary strand subject to these connections: a premature cap at an intermediate row would create another exterior arc instead of the required through path, so its continuation is excluded. For p>0, remove the first p cups using the two local identities in step 3.1, on both sides of the auxiliary path. This leaves the same computation on n−2p sites; n−2p>0 by criticality and κ≥2, and its parity equals that of n. The target basis tensor is h2p+1⊗zp=h1⊗zp, by successive didi+1di=di reductions. One may do the cup removal first for δ≠0 by inserting δ−1d2j−1 at each initial cup. The resulting coefficient identity extends to δ=0: the induced basis reduction in step 1.2 uses no division, so its matrices, and this coefficient, are Laurent polynomials in q. Finally δ2−4=(q−q−1)2≠0.

7.1F4step 2.1step 3.1step 5.1step 6.1construct

In the induction sequence at a critical (n,p) the two standard constituents have the same eigenvalue f=fn+1,p=fn+1,p+1. The central endomorphism Fn+1−f kills both constituents but is nonzero on the induction by step 6.1. Consequently it factors through the quotient Vn+1,p into the submodule Vn+1,p+1, giving a nonzero map between these adjacent reflected standards. Explicitly, lift a quotient vector to the induction, apply Fn+1−f, and use the inverse of the submodule injection; the result is independent of the lift because this operator kills the submodule.

8.1F4step 1.1step 3.1step 4.1step 5.1step 7.1algebra∎

Every symmetric pair has the form (n+j,p),(n+j,p+j) for a critical (n,p) and 1≤j<κ. For j≥2, induction and restriction at the noncritical labels give Hom⁡(Vn+j,p,Vn+j,p+j)≅Hom⁡(Vn+j−1,p↑,Vn+j,p+j)≅Hom⁡(Vn+j−1,p,Vn+j,p+j↓)≅Hom⁡(Vn+j−1,p,Vn+j−1,p+j−1). In the first and last isomorphisms the extra standard summand has a different F-eigenvalue: substitute q2(n−2p+1)=1 in step 3.1, and equality would force j=1 or j=κ. Thus its Hom is zero. The middle adjunction is explicit: f↦(v↦f(1⊗v)), with inverse g↦(a⊗v↦ag(v)). This works also when an extraneous summand is out of range. Reducing j to 1 and applying step 7.1 proves nonvanishing for every reflected pair. Returning along step 1.1 gives all statements for the repository's right modules.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Root Gram ranks give the reflected simple-head dimensions

Statement

Put Vn,p=Wn,n−2p(C,q+q−1), Rn,p=rad⁡ϕn,n−2p and Ln,p=Vn,p/Rn,p, allowing L2p,p=0 when δ=0. Let κ=ord⁡(q2) be finite with κ≥2. For a noncritical label write n−2p+1=kκ+r with 1≤r<κ. Then dim⁡Rn,p={dim⁡Ln,p+r−κ,p+r−κ≥0,0,p+r−κ<0. More explicitly, set the dimensions of out-of-range modules to zero. At critical labels dim⁡Rn,p=0. At noncritical labels, dim⁡Rn,p={dim⁡Rn−1,p+dim⁡Vn−1,p−1,r=κ−1,dim⁡Rn−1,p+dim⁡Rn−1,p−1,r≠κ−1. The initial condition is dim⁡Rn,0=0. These formulas include κ=2 and the zero-form perfect-matching module.

Facts & Assumptions

Given: q≠0 and finite κ≥2, the standard modules, their capping forms and the label convention.

[F1]

The central spectral projections give the split restriction for noncritical labels (The annular central element constructs Temperley–Lieb reflection maps).

[F2]

At generic q all smaller-rank Gram determinants are nonzero (The Temperley–Lieb link-state Gram determinant).

[F3]

Critical forms are nondegenerate (Critical complex Temperley–Lieb standard modules are simple). The form is symmetric and invariant (The link-state Gram form is symmetric and invariant).

[F4]

dim⁡Vn,p=dim⁡Vn−1,p+dim⁡Vn−1,p−1 (Link states are counted by a ballot-number difference). Reflection is as in Complex Temperley–Lieb critical labels and reflection.

[F5]

The quantum integers satisfy [a+1]q=δ[a]q−[a−1]q and vanish, for q≠±1, precisely when q2a=1 (Temperley–Lieb quantum integers and quantum characteristic).

Proof

technique · Specialize a regular orthogonal splitting, then compare the two dimension recursions
1.1F1F2F3F5givenalgebra

First work at generic q. The rightmost-defect submodule has nondegenerate form by [F2], so its orthogonal complement is invariant and maps isomorphically to the restriction quotient. The smaller standards are simple by their rank-one diagram operators; an invariant form on such a standard is a scalar multiple of its nondegenerate standard form, because their associated maps into the dual differ by an endomorphism, and an endomorphism of a finite-dimensional complex simple module is scalar (take any eigenvalue). Subtracting the submodule projection from quotient basis lifts gives a unitriangular Gram splitting Gn,p=UT(Gn−1,p⊕αn,pGn−1,p−1)U. Compute its scalar as follows. Group the link states into the four types: n,n−1 both defects; n a defect and n−1 on an earlier arc; (n−1,n) an arc; and n on an arc ending earlier than n−1. Put A=Gn−2,p, B=Gn−2,p−1 and write the smaller-rank matrix as Gn−1,p=(AAV0V0TAV0TAV0+αn−1,pB). In the current off-diagonal Gram block the first column block is (0,B)T: types one and three have unmatched defects, while cutting the terminal arc in types two and three removes no closed component. The type-three diagonal block is δB, since the shared terminal arc closes one loop. If (X,Y)T is the first column block of the projection coefficient matrix, multiplication by Gn−1,p gives AX+AV0Y=0 and V0TAX+(V0TAV0+αn−1,pB)Y=B. Thus X=−V0Y and Y=αn−1,p−1I. Its quadratic contribution is αn−1,p−1B after the four V0TAV0 terms cancel with coefficients 1−1−1+1. Comparing the type-three block gives αn,p=δ−αn−1,p−1. At n=2p, deleting the terminal site closes exactly one additional component, so G2p,p=δG2p−1,p−1 and α2p,p=δ. The recurrence solves to αn,p=[n−2p+2]q/[n−2p+1]q by the quantum-integer recurrence. If the A block is empty it is omitted; the same cancellation still holds. Now at a noncritical root, the two eigenvalues used for [F1] differ by −(q−q−1)(qn−2p+1−q−(n−2p+1))≠0. The spectral projector onto the rightmost-defect summand is (Fn−1−fn−1,p−1)/(fn−1,p−fn−1,p−1). Its entries are rational functions regular at the root; subtracting this projection from each standard quotient lift gives a unitriangular splitting matrix U, also regular there. Since Fn−1∗=Fn−1 and the eigenvalues differ, the two summands are orthogonal. For generic q this is exactly the orthogonal splitting just computed, since the submodule form is nondegenerate and its orthogonal complement is unique. Thus this Gram matrix identity is an identity of rational matrices regular at every noncritical root, and specializes there. This continuity argument applies to the entire matrix identity, rather than inferring a rank from a specialized determinant. If n=2p, there is only the quotient summand and direct capping gives G2p,p=δG2p−1,p−1, the same formula with α=[2]/[1]=δ.

2.1F2F3F4F5step 1.1algebra

Since κ≥2, q≠±1; hence [a]q=0 precisely when κ∣a. At a noncritical label the denominator of α is nonzero and its numerator vanishes precisely when r=κ−1. The kernel dimension of the specialized block form in step 1.1 is therefore dim⁡Rn−1,p+dim⁡Vn−1,p−1 in that case, and dim⁡Rn−1,p+dim⁡Rn−1,p−1 otherwise. Critical labels give zero by [F3]; the all-defect form is (1), giving Rn,0=0. For n≥1, subtraction from [F4] gives the companion recursion, with initial dim⁡L0,0=1: dim⁡Ln,p=dim⁡Vn,p at critical labels; at noncritical labels it is dim⁡Ln−1,p if r=κ−1, and dim⁡Ln−1,p+dim⁡Ln−1,p−1 otherwise.

3.1F4step 2.1algebra

Prove the reflected-dimension formula by induction on n, with out-of-range labels assigned dimension zero. Write a=p+r−κ. If r∉{1,κ−1}, neither predecessor is critical. Their reflection indices are respectively a−1 and a, so induction and step 2.1 give dim⁡Rn,p=dim⁡Ln−1,a−1+dim⁡Ln−1,a. The reflected label a has remainder κ−r, which is also neither 1 nor κ−1; its companion recursion gives exactly dim⁡Ln,a.

3.2F3F4step 2.1algebra

When κ=2, every noncritical label has r=1=κ−1 and both predecessors are critical. The radical recursion gives dim⁡Rn,p=dim⁡Vn−1,p−1=dim⁡Ln−1,p−1. Since a=p−1 and the companion recursion at (n,a) also has remainder 1, this is dim⁡Ln,a. The same formula holds for n=2p: it gives dim⁡R2p,p=dim⁡V2p−1,p−1=dim⁡V2p,p, as required by the identically zero form.

4.1F3F4step 2.1step 3.1algebra

If r=κ−1 and κ>2, the predecessor (n−1,p−1) is critical, while (n−1,p) has reflected index a−1. Consequently dim⁡Rn,p=dim⁡Ln−1,a−1+dim⁡Vn−1,p−1. Here a=p−1, and criticality gives Vn−1,p−1=Ln−1,a. The companion recursion at (n,a) has remainder 1≠κ−1, so this sum is dim⁡Ln,a. If r=1 and κ>2, (n−1,p) is critical and its radical is zero; the reflection of (n−1,p−1) has index a. Thus dim⁡Rn,p=dim⁡Ln−1,a. The reflected label at rank n has remainder κ−1, whose companion recursion is precisely dim⁡Ln,a=dim⁡Ln−1,a.

5.1F4step 2.1step 3.1step 4.1step 3.2algebra∎

The initial p=0 case has a<0 and zero radical. All predecessor terms whose indices leave the allowed range are zero. In particular the recursions in the preceding cases give zero when a<0; when a=0 they use the initial all-defect dimension 1. These boundary rules also cover n=0,1. The induction establishes the stated formula for present reflected labels and the zero radical for absent labels.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Complex-root standard radicals, simple heads and reflection linkage

Statement

Let q∈C×, δ=q+q−1, κ=ord⁡(q2), and abbreviate Vn,p=Wn,n−2p(C,δ), Rn,p=rad⁡ϕn,n−2p and Ln,p=Vn,p/Rn,p. At every label except δ=0,n=2p>0, Ln,p is the simple head, and all proper submodules of Vn,p are 0 or Rn,p. The nonzero Ln,p give all pairwise nonisomorphic simple modules. For κ=1 every standard is simple; for κ=∞ every standard is simple. At finite κ≥2, critical labels give Rn,p=0. At a noncritical label put n−2p+1=kκ+r, 1≤r<κ, and a=p+r−κ. Then Rn,p≅{Ln,a,a≥0,0,a<0. Thus, except for the zero-loop perfect-matching exception, a present reflected label gives the nonsplit exact sequence 0⟶Ln,a⟶Vn,p⟶Ln,p⟶0, and these are the two composition factors, each once. An absent reflected label gives a simple standard. Each critical label is a singleton linkage class; the other linkage classes are the chains of allowed labels obtained by successive adjacent reflection. Here linkage means the equivalence generated by sharing a simple composition factor among standard modules.

If δ=0 and n=2p>0, the ordinary form on V2p,p is zero, so R2p,p=V2p,p and L2p,p=0. The actual module is simple and isomorphic to L2p,p−1. The simple labels in this case are 0≤j<p. In particular this branch does not identify the actual simple head with the zero form quotient.

Facts & Assumptions

Given: The complex standards and the above arc-label notation; an allowed label has 0≤p≤⌊n/2⌋.

[F1]

Nonzero cell-form quotients are absolutely simple, pairwise distinct, exhaustive, and their form radicals are unique maximal submodules (Nonzero Temperley–Lieb cell forms give all simple heads).

[F2]

There is a nonzero map Vn,a→Vn,p for every adjacent reflected pair a<p (The annular central element constructs Temperley–Lieb reflection maps).

[F3]

The corresponding dimensions satisfy dim⁡Rn,p=dim⁡Ln,a, or zero if a is absent (Root Gram ranks give the reflected simple-head dimensions).

[F4]

Critical standards are simple with nondegenerate form; at δ=0 the positive-rank perfect-matching standard is simple despite its zero ordinary form (Critical complex Temperley–Lieb standard modules are simple, The zero-loop perfect-matching standard module is simple).

[F5]

Capping is the invariant Gram pairing, and a composite with fewer than the required propagating strands is zero in the standard module (The link-state Gram form is symmetric and invariant).

[F6]

The Gram determinant is a product of nonvanishing quantum-integer quotients when κ=∞ (The Temperley–Lieb link-state Gram determinant).

Proof

technique · Compare the kernel and image of a reflection map with the exact Gram-radical dimensions
1.1F1F5givenconstruct

The form is nonzero unless δ=0 and the positive-rank defect number is zero. Indeed, when δ≠0 a state's pairing with itself is δp≠0. When δ=0 and t=n−2p>0, take x with arcs (1,2),(3,4),…,(2p−1,2p) and y with arcs (2,3),(4,5),…,(2p,2p+1); all other sites are defects. Their overlay on sites 1,…,2p+1 is one open alternating path, with no cycle, and all remaining defect paths match. Thus ϕ(x,y)=1. If p=0 the form is (1). For t=0,n>0, every overlay has a closed component and hence value zero at δ=0. Consequently [F1] applies to exactly the stated nonexceptional labels.

2.1F5step 1.1constructalgebra

First observe the rank-one identity: form the algebra diagram whose two halves are x,y. Stacking z against its y half gives ϕ(y,z) times the identity on the defect strands; if fewer strands propagate, it is zero in the standard quotient. Therefore this diagram sends z to ϕ(y,z)x, by exactly the matching rule in [F5]. More strongly, any submodule not contained in the form radical is the entire standard. If z lies outside the radical, choose y with ϕ(y,z)=1. For any vector x, the diagram with halves x,y sends z to x by [F5]; hence z generates the standard. Also, if p>p′ and the source form is nonzero, every map between any quotients of Vn,p and Vn,p′ is zero. Choose y,z in the source with ϕ(y,z)=1. A diagram with halves x,y has n−2p<n−2p′ propagating strands and therefore acts as zero on the target and its quotients. Applying a proposed homomorphism to its action on the class of z gives zero on the class of every x, hence the map is zero.

3.1F2F4step 1.1step 2.1algebra

Consider an adjacent reflected pair a<p and a nonzero f:Vn,a→Vn,p from [F2]. Its kernel is proper and therefore lies in Rn,a by step 2.1. Its image also lies in Rn,p: otherwise step 2.1 makes f surjective, and its inverse isomorphism Vn,p→Vn,a/ker⁡f contradicts the quotient-vanishing assertion in step 2.1. The source is never the zero-form exceptional label, since a<p. If the target is the exceptional label, its simplicity in [F4] instead gives im⁡f=Vn,p=Rn,p directly. Thus in every case ker⁡f⊆Rn,a and im⁡f⊆Rn,p.

4.1F1F3step 3.1algebra

Rank-nullity and [F3] now force equality in both inclusions: dim⁡Vn,a=dim⁡ker⁡f+dim⁡im⁡f≤dim⁡Rn,a+dim⁡Rn,p=dim⁡Rn,a+dim⁡Ln,a=dim⁡Vn,a. Therefore ker⁡f=Rn,a and im⁡f=Rn,p≅Ln,a, which is simple by [F1]. For an absent reflected label [F3] gives Rn,p=0. At a critical label [F4] gives the same.

5.1F1F3F4F6step 1.1step 2.1step 4.1algebra

For a nonexceptional standard, steps 2.1 and 4.1 show every proper submodule is contained in a radical which is zero or simple. Thus its only submodules are 0,R,V and every quotient is indecomposable. When the radical is nonzero, the exact radical/head sequence cannot split: a complementary submodule would be proper and not contained in the radical, contradicting step 2.1. It has exactly the two displayed simple factors. The critical κ=1 branch is [F4]. If κ=∞, no quantum integer in the determinant vanishes, so the determinant and hence the form are nondegenerate; this is [F6]. Exhaustion and distinction of the nonzero heads are [F1].

6.1F1F3F4step 1.1step 4.1step 5.1algebra∎

At δ=0 and n=2p>0, κ=2 and the reflected arc label is p−1. Step 1.1 identifies the form radical as all of V2p,p, while step 4.1 identifies it with L2p,p−1. This agrees with the separately proved actual simplicity [F4]; its zero form quotient introduces no extra simple label. The remaining standards have nonzero forms and hence the complete simple labels are 0,…,p−1. Finally, each noncritical standard shares factors only with its adjacent reflection neighbors by step 4.1, and every present neighbor occurs. Taking the equivalence generated by these edges gives precisely the stated reflection chains. A critical head occurs only in its own simple standard, giving singleton classes.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

All Hom spaces between complex Temperley–Lieb standards

Statement

Let q∈C×, δ=q+q−1 and Vn,p=Wn,n−2p(C,δ). For allowed arc labels p,p′, the space Hom⁡TLn(Vn,p,Vn,p′) has dimension one exactly in the following cases:

  • p=p′;
  • p<p′ and (n,p),(n,p′) form an adjacent reflected pair: κ=ord⁡(q2)≥2, 1≤r<κ, n−2p′+1=kκ+r, and p=p′+r−κ;
  • n=2, δ=0, p=1, p′=0.

In every other case the dimension is zero. In the second case a nonzero map has kernel Rn,p and image Rn,p′≅Ln,p, using the ordinary form-radical notation even when the target is the zero-loop perfect-matching module. In the third case the map is an isomorphism between two one-dimensional modules. These assertions include κ=1,2,3,∞, rank zero, and absent reflected labels.

Facts & Assumptions

Given: The complex standards, their arc labels, and ordinary form radicals Rn,p.

[F1]

Each nonexceptional standard has unique simple head Ln,p and zero or simple radical; a nonzero radical is the head at its adjacent reflected label. These nonzero heads are pairwise distinct. At δ=0,n=2m>0, V2m,m=R2m,m≅L2m,m−1 is simple and L2m,m=0 (Complex-root standard radicals, simple heads and reflection linkage).

[F2]

Adjacent-reflection maps exist, and the central element is scalar on each standard (The annular central element constructs Temperley–Lieb reflection maps).

[F3]

The form is computed by capping, with lower-propagating terms zero in the standard quotient (The link-state Gram form is symmetric and invariant).

[F4]

Every nonzero endomorphism of a simple module is invertible (Schur's lemma for simple modules); the link-state dimension is the ballot number (Link states are counted by a ballot-number difference).

Proof

technique · Use the complete submodule lists and the rank-one operators
1.1F1F3F4givenchoosealgebra

Stacking a state z against the diagram with halves y,x caps z with y, giving z⋅Cy,x=ϕ(y,z)x; when propagation drops, both sides vanish in the standard quotient. If the form of Vn,p is nonzero, choose y,z with ϕ(y,z)=1. For an endomorphism h, [F3] gives h(x)=h(z⋅Cy,x)=h(z)⋅Cy,x=ϕ(y,h(z))x for every x. Thus h is scalar. In the exceptional zero-form case the module itself is simple by [F1], so every endomorphism is scalar: it has a complex eigenvalue λ, and the endomorphism h−λ1 has a nonzero kernel and must therefore be zero by [F4]. This proves every diagonal dimension is one.

1.2F1F2F4algebra

It remains to include Z=V2m,m at δ=0. Here Z≅L2m,m−1 is simple by [F1]. For a nonexceptional source V2m,p, a map to Z has simple image; if nonzero it is a simple quotient of the source, hence its head L2m,p. Distinctness of the labels forces p=m−1, in which case [F2] supplies a map and [F4] gives uniqueness. This is exactly the adjacent-reflection case.

2.1F3step 1.1algebra

Suppose both source and target have nonzero forms and p>p′. The rank-one operators for the source have n−2p<n−2p′ propagating strands and kill the target. Choosing y,z as in step 1.1, a proposed homomorphism h therefore satisfies h(x)=h(z⋅Cy,x)=h(z)⋅Cy,x=0. Hence the Hom space is zero.

3.1F1F2F4step 2.1algebra

Suppose both forms are nonzero and p<p′. A nonzero map cannot be surjective: its inverse quotient isomorphism would contradict step 2.1, whose proof also applies to quotients of the target. Thus its image lies in the simple radical Rn,p′. The kernel is a proper submodule of the source and hence is 0 or Rn,p. If it is zero, the source is simple because it embeds into the simple radical. In either case the image is isomorphic to the source head Ln,p. By [F1] and distinction of simple labels this is possible exactly when p is the adjacent reflected label of p′. Such a map exists by [F2]; it factors as the head quotient followed by an isomorphism Ln,p≅Rn,p′ and the radical inclusion. Schur's lemma makes this factorization unique up to scalar, so its Hom space has dimension one and the stated kernel and image. If the target radical is zero there is no such map.

4.1F1F4step 1.1step 2.1step 3.1step 1.2algebra∎

A nonzero map from Z to V2m,p′, p′<m, is injective. If its image is the radical, [F1] makes it L2m,p′−1; this cannot equal L2m,m−1 because p′−1<m−1. Otherwise its image is the entire target by the submodule list in [F1], so the target is simple. At κ=2 every 1≤p′<m has a present reflected label p′−1 with a nonzero head, hence is reducible; thus p′=0. That standard is one-dimensional. The exceptional module has dimension 1m+1(2mm) by [F4], which is greater than one for m≥2: there are at least the distinct matchings with initial arcs (1,2) and (1,2m). Equality therefore occurs only at m=1. In that case both V2,1 and V2,0 are one-dimensional, and d1 acts by zero on each, giving the stated isomorphism and one-dimensional Hom. These cases exhaust all labels, including rank zero.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Projective covers of complex-root Temperley–Lieb simple modules

Statement

Let q∈C×, δ=q+q−1, An=TLn(C,δ), Vn,p=Wn,n−2p(C,δ) and Ln,p=Vn,p/rad⁡ϕn,n−2p. For each nonzero Ln,p let Pn,p↠Ln,p be its projective cover. These covers exhaust the indecomposable finite-dimensional projective right modules up to isomorphism.

If κ=ord⁡(q2) is 1 or ∞, all standards are simple and projective: Pn,p=Vn,p=Ln,p up to isomorphism. For finite κ≥2, a critical label has Pn,p≅Vn,p=Ln,p. At a noncritical label write n−2p+1=kκ+r, 1≤r<κ.

If k=0, then Pn,p≅Vn,p. If k>0, there is a nonsplit exact sequence 0⟶Vn,p+r⟶Pn,p⟶Vn,p⟶0. Moreover Pn,p is the generalized Fn-eigenspace of eigenvalue fn,p=qn−2p+1+q−(n−2p+1) in the r-fold induced module Vn−r,p↑⋯↑. Thus its standard filtration has exactly the two displayed terms, each once; its composition factors are precisely the combined factors of those terms given by the radical theorem.

At δ=0, odd ranks have Pn,p=Vn,p=Ln,p. At even rank n=2m>0 there are only the covers P2m,p for 0≤p<m, and P2m,p≅V2m−1,p↑,0⟶V2m,p+1⟶P2m,p⟶V2m,p⟶0. There is no cover labeled by the zero form quotient L2m,m=0; its actual simple standard V2m,m is already isomorphic to L2m,m−1. Rank zero has its single one-dimensional simple projective.

Facts & Assumptions

Given: The complex diagram algebra, its standards and simple heads, with ordinary zero-form quotient labels retained.

[F1]

The complete standard composition factors and their exceptional zero-loop convention are Complex-root standard radicals, simple heads and reflection linkage. The nonzero heads are self-dual for the duality induced by diagram reflection: their nondegenerate quotient forms identify them with their twisted linear duals.

[F2]

The cellular diagram basis gives a filtration by two-sided ideals of diagrams with at most a given number of propagating strands. Its layer at defect label t=n−2s is the bimodule Us⊗CVn,s, where Us is the left module obtained from Vn,s by reflection (The Temperley–Lieb link-state diagram basis is cellular).

[F3]

Finite-dimensional modules over finite-dimensional algebras have projective covers, unique up to isomorphism over the target (Every finite-dimensional module has a projective cover, unique up to isomorphism over the target), applied also to the opposite algebra for right modules. A cover has a superfluous kernel.

[F4]

The central Fn, its standard eigenvalues and the induction sequences are The annular central element constructs Temperley–Lieb reflection maps.

[F5]

Every nonzero endomorphism of a simple module is invertible (Schur's lemma for simple modules).

Proof

technique · Apply a primitive projective summand to the cellular bimodule filtration, and identify the repeated-induction realization by its two extremal standard constituents
1.1F3givenchooseconstructalgebra

Fix a nonzero head L=Ln,p and its finite-dimensional projective cover π:P→L from [F3]. Since L is cyclic, choose a surjection α:An→L. Projectivity of P and of the finite free module An gives maps s:P→An and t:An→P with αs=π and πt=α. Then πts=π. Consequently P=ts(P)+ker⁡π; superfluity gives ts(P)=P, so ts is invertible by finite dimensionality. Replacing s by s(ts)−1 makes ts=1. Thus P is a direct summand eAn of the right regular module for an idempotent e (a right-module endomorphism of An is left multiplication by its value at 1). The cover is indecomposable: a nonzero decomposition would give a proper summand surjecting onto L, contrary to the superfluous kernel.

2.1F1F3F5step 1.1algebra

If S is any simple right module and h:P→S is nonzero, then its kernel is maximal. Superfluity of ker⁡π implies ker⁡π⊆ker⁡h: otherwise their sum is P and the superfluity condition would force ker⁡h=P. Thus h factors through L. On a finite-dimensional complex simple module an endomorphism u has an eigenvalue λ; since u−λ1 has a nonzero kernel, [F5] makes it zero. Thus its endomorphism space is C. By [F1], dim⁡Hom⁡An(eAn,S) is 1 for S=L and 0 otherwise. Evaluation at e identifies this Hom space with Se: the inverse sends v∈Se to the map ea↦va. Hence dim⁡Se has those same values. This also proves any finite-dimensional projective module surjecting onto L contains P as a summand, by repeating step 1.1 with that module in place of An. Finally every indecomposable projective has a simple quotient, hence is the cover of that quotient by this summand assertion.

3.1F1F2F3F5step 1.1step 2.1algebra

Left multiplication by e is an exact functor on left modules: for an exact sequence, a lift of ey can be replaced by e times that lift. The cellular basis itself identifies each ideal layer in [F2] with Us⊗Vn,s: map its basis tensor x⊗y to the class of Cx,yt. Right multiplication acts only on y by the cellular triangular rule, and left multiplication acts only on x by reflecting that rule; this proves the bimodule identification, including the zero-form layers. Applying the exact functor gives a filtration of eAn=P with layers (eUs)⊗Vn,s, hence dim⁡eUs copies of Vn,s. To compute this multiplicity, write σ(a)=a∗ for diagram reflection and convert a left module U to the right module with action u⋅a=σ(a)u. By the cellular-basis construction under reflection, this converts Us to Vn,s, so dim⁡(eUs)=dim⁡(Vn,sσ(e)). The idempotent e is primitive because eAn is an indecomposable projective cover of L=Ln,p. Evaluation at e gives Hom⁡An(eAn,L)≅Le≅C. For the contragredient dual L∨=Hom⁡C(L,C) with (φ⋅a)(x)=φ(xσ(a)), restriction to Le gives L∨σ(e)≅(Le)∗≠0. Thus the indecomposable projective σ(e)An has simple top L∨≅L, by the self-duality in [F1], and is another projective cover of L. Uniqueness of covers [F3] gives eAn≅σ(e)An, so e and σ(e) are equivalent idempotents: an isomorphism eAn→σ(e)An supplies elements x∈σ(e)Ane and y∈eAnσ(e) with xy=σ(e) and yx=e. The maps me↦my and mf↦mx identify Me with Mf for every right module M, where f=σ(e), so dim⁡(Vn,sσ(e))=dim⁡(Vn,se). The functor M↦Me is exact on right modules; Se is one-dimensional for S≅L by Schur's lemma and zero for every other simple, since eAn covers L. Therefore dim⁡(Vn,se)=[Vn,s:L]. This proves the standard filtration formula [Pn,p:Vn,s]=[Vn,s:Ln,p], without assuming semisimplicity or quasiheredity. Its layer order is increasing defect number, equivalently decreasing arc count.

4.1F1step 1.1step 3.1algebra

At a critical label, [F1] says the only standard containing Ln,p is Vn,p, once. Step 3.1 gives Pn,p≅Vn,p. The same argument applies to every label at κ=1,∞. At a finite-order noncritical nonzero head, the standards containing it are Vn,p and, when present, its neighbor on the lower-defect side, Vn,b with b=p+r. This follows by solving the adjacent-reflection relation in [F1] in the reverse direction. If k=0, n−2b+1=−r<0 and b is absent. If k>0, n−2b=kκ−r−1≥0 and it is present. Each occurrence has multiplicity one. At κ=2, even rank, the possible b=n/2 is included because the zero-form standard is the actual simple Ln,n/2−1 by [F1]. Thus step 3.1 gives either Pn,p=Vn,p or exactly the asserted two-standard filtration. Since b>p, its Vn,b layer is a submodule and its Vn,p layer the quotient, yielding the exact sequence. It is nonsplit: both standards are nonzero, whereas the cover in step 1.1 is indecomposable.

5.1F4step 2.1step 4.1algebra

For k>0, the starting label (n−r,p) has defect number kκ−1 and is critical; its standard is projective by step 4.1. Induction preserves projectivity: the adjunction in [F4] identifies maps from an induced module with maps from the original module into a restriction, and restriction preserves surjections, so the defining lifting property is preserved. The r-fold induced module Q is therefore projective. Repeatedly applying the standard induction sequences gives a filtration of Q whose layers are quotients of the standards Vn,p+j, 0≤j≤r, with multiplicities at most (rj). To justify this even though induction is only right exact, induct the existing filtration: the images of its submodules still form a filtration, and each new layer is a quotient of the induction of the old layer; the two-term sequence in [F4] refines these layers. No left-exactness is assumed. The exceptional induction input (2,1,0) is never encountered: every intermediate defect is at least kκ−1−(r−1)>0.

6.1F4step 2.1step 4.1step 5.1algebra

On the standard indexed by p+j the central eigenvalue is qkκ+r−2j+q−(kκ+r−2j). It equals fn,p exactly when j≡0 or j≡r(modκ): use x+x−1=y+y−1 if and only if (x−y)(x−y−1)=0, and q2kκ=1. Since 0≤j≤r<κ, only j=0,r qualify. Generalized eigenspaces of a central operator are submodules; the associated polynomial spectral projection is exact on finite-dimensional modules, as is seen by applying the same projection to a lift. Thus the fn,p-space Qf is projective and step 5.1 bounds its dimension by dim⁡Vn,p+dim⁡Vn,p+r. Successive standard quotient maps give a surjection Q→Vn,p→Ln,p; its restriction to Qf remains onto, because the other generalized eigenspaces have distinct eigenvalues. Step 2.1 makes Pn,p a direct summand of Qf. Step 4.1 already gives dim⁡Pn,p=dim⁡Vn,p+dim⁡Vn,p+r, so the bound is saturated and Qf≅Pn,p, proving the stated realization.

7.1F1F4step 4.1step 6.1algebra∎

At δ=0, κ=2. Odd ranks have only critical labels and are covered by step 4.1. At rank 2m, the simple labels are 0≤p<m by [F1]; each has r=1 and k>0. The repeated-induction realization in step 6.1 therefore has just one induction, from the odd-rank critical standard V2m−1,p. Its two standard constituents both have eigenvalue 0, so the entire induction is the selected generalized eigenspace. This proves the final displayed formulas and excludes a cover for the zero quotient label. At rank zero the algebra is C, whose single simple regular module is projective. All covers and all exceptional cases have now been included.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Spencer quantum-characteristic digits and support set

Definition

Let K be a field, let δ∈K, and let ℓ be the recurrence quantum characteristic of (K,δ) from Temperley–Lieb quantum integers and quantum characteristic. Put P=char⁡K when char⁡K>0, and put P=∞ when char⁡K=0. In this definition ℓ is Spencer's recurrence parameter; it is not the complex order κ=ord⁡(q2).

Suppose first that ℓ<∞. Set s0=1 and si=ℓPi−1 for each i≥1 with P<∞. If P=∞, set s1=ℓ and omit all si for i≥2. Every M∈N has a unique expansion M=∑i=0rmisi, where 0≤m0<ℓ and 0≤mi<P for i≥1 when P<∞. When P=∞, write M=m0+m1ℓ with 0≤m0<ℓ and m1≥0; if m1=0, take r=0. The highest digit mr is nonzero unless M=0, for which take r=0 and m0=0.

For a label N≥0, let ni be the digits of N+1, so N+1=∑i=0rnisi. Define the Spencer support set Supp⁡ℓ,P(N)={∑i=0rεinisi−1:εi∈{−1,1}, εr=1, ∑i=0rεinisi−1≥0}. If ℓ=∞, define Supp⁡ℓ,P(N)={N}.

This item defines the digit expansion and a finite set only. Spencer's theorem identifying these sets with decomposition multiplicities, and the separate Jones–Wenzl existence criterion, are not asserted here; both require the full field hypotheses and their own proofs.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Critical Temperley–Lieb Gram determinants in a digit unit interval

Statement

The polynomial Gram-determinant identity of The Temperley–Lieb link-state Gram determinant holds over every field, with polynomial continuation at zeros of displayed denominators. Let ℓ<∞, let n+1=Aℓ and m+1=Bℓ with 0<B≤A and n−m even. In characteristic zero, Wn,m is simple. In characteristic p>0, write B=pvb′ with p∤b′ and let b∈{1,…,p−1} be the residue of b′ modulo p. If ⌊A−B2⌋<pv(p−b), then Wn,m is simple. If ℓ=∞, every Wn,m is simple. Also Wn,n−2 is simple whenever [n]δ≠0.

Facts & Assumptions

Given: A field, a loop parameter, its recurrence quantum characteristic, and the allowed labels in the Statement.

[F1]

The complex Gram determinant is ∏j=1(n−m)/2([m+1+j]/[j])dim⁡Wn,m+2j, with polynomial continuation (The Temperley–Lieb link-state Gram determinant).

[F2]

Nondegeneracy of a cell form makes its module simple (Nonzero Temperley–Lieb cell forms give all simple heads).

[F3]

The recurrence quantum characteristic and quantum integers are defined over every field (Temperley–Lieb quantum integers and quantum characteristic), and a root of X2−δX+1 may be adjoined to the field (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenalgebra

Each Gram entry is a monomial in the loop parameter with integer coefficient, so its determinant is a polynomial D(T)∈Z[T]. Clear the quantum-integer denominators in [F1], obtaining an equality between integer polynomials for every complex loop parameter. Every complex number has the form q+q−1 for a nonzero q, and a polynomial with infinitely many distinct complex zeros is zero. Thus this is an integer polynomial identity, which reduces to an identity over every field. No division after specialization is involved in this conclusion.

2.1F1F3step 1.1constructalgebra

Adjoin q0≠0 with q0+q0−1=δ using [F3], and work in formal Laurent series over that extension. Set q(t)=q0(1+t) and δ(t)=q(t)+q(t)−1. As a rational function of t, δ(t) has a pole at t=−1, so it is nonconstant. For every nonzero polynomial P∈K[T], P(δ(t)) is a nonzero rational function: if deg⁡P=d>0, it has a pole of order d at t=−1, and if d=0 it is a nonzero constant. The Laurent expansion at t=0 of a nonzero rational function is nonzero. Thus substitution P(T)↦P(δ(t)) is injective, and every nonzero polynomial remains a nonzero series. Every quantum integer [j]δ(t) is nonzero by its Laurent expression q(t)1−j(1−q(t)2j)/(1−q(t)2), interpreted as a rational identity. We may consequently use the product in [F1] in the Laurent-series field. Its constant coefficient is D(δ).

3.1F3step 2.1algebra

Suppose the characteristic is p>0 and put c=1 for odd p and c=2 for p=2. For every positive integer j, the order of 1−(1+t)2j is cpνp(j): factor 2j=phu with p∤u, use (1+t)ph=1+tph, and the coefficient of tph is the nonzero residue of u. If q02≠1, finite ℓ is the order of q02, and it is prime to p because a field has no nonidentity element of order p. Thus [j]δ(t) has order zero for ℓ∤j and order cpνp(j/ℓ) for ℓ∣j. If q02=1, the recurrence gives [j]δ=jq0j−1 and ℓ=p; the denominator 1−q(t)2 has order c, so the order of [j]δ(t) is c(pνp(j)−1). These statements hold also in characteristic two.

4.1F1F2step 2.1step 3.1algebra

For a critical label m+1=Bℓ, the numerator and denominator of a factor in [F1] both have order zero when ℓ∤j. If j=j′ℓ, step 3.1 shows that their orders agree whenever νp(B+j′)=νp(j′), in both of its cases, including ℓ=p. Write B=pvb′ as in the Statement and suppose 0<j′<pv(p−b). If pv∤j′, then νp(j′)<v and adding B preserves that valuation. Otherwise j′=pvh with 1≤h<p−b<p, so both h and b′+h are nonzero modulo p and both valuations equal v. Thus the equality holds for every j′≤⌊(A−B)/2⌋ under the stated bound. Every factor in the determinant product is consequently a Laurent-series unit with nonzero constant term. Their product has nonzero constant term, proving D(δ)≠0. This nonvanishing descends to the original field, so [F2] proves simplicity.

5.1F1F2F3step 1.1step 2.1step 4.1algebra∎

In characteristic zero with finite ℓ, one has q02≠1. Each quantum integer whose index is a multiple of ℓ has a simple zero along q(t), because differentiating 1−q(t)2j gives nonzero coefficient −2j at t=0. All other indices give units. Therefore each numerator and denominator in the critical determinant product has the same order, either zero or one, and its quotient has nonzero constant term. The same argument as in step 4.1 proves simplicity. If ℓ=∞, every specialized numerator and denominator in [F1] is nonzero, so the determinant is nonzero directly. Finally, when m=n−2, the product consists solely of [n]δ to exponent one. Thus [n]δ≠0 implies the last simplicity assertion.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Exact Temperley–Lieb truncation reduces decomposition to trivial factors

Statement

Let K be any field, δ∈K, and let 0≤r≤n with n−r even. Assume r>0 or δ≠0 or n=r=0. Put An=TLn(K,δ), use the right modules Wn,t of Temperley–Lieb link-state standard modules by defect number, and put Dn,t=Wn,t/rad⁡ϕn,t. There are y,z:n→r with y∘z∗=1r, and for r>0 both may be chosen as basis monic diagrams. There is an idempotent e∈An with eAne≅Ar such that M↦Me is exact, sends Wn,t to Wr,t, and sends Dn,t to Dr,t, with value zero when t>r.

Consequently, for every allowed m, [Wn,m:Dn,r]=[Wr,m:Dr,r], where Wr,m=0 if m>r. The module Dr,r=Wr,r is one dimensional and every diagram generator acts by zero. Thus the decomposition problem reduces exactly to multiplicities of this trivial module. The excluded case n>r=0,δ=0 has Dn,0=0 and is not a simple label.

Facts & Assumptions

Given: The field, loop parameter, labels, diagram category and right link-state modules in the Statement.

[F2]

The coefficient-of-identity forms are symmetric and satisfy ϕ(xa,w)=ϕ(x,wa∗) (The link-state Gram form is symmetric and invariant).

[F3]

The nonzero form quotients Dn,t are a complete pairwise nonisomorphic list of absolutely simple modules (Nonzero Temperley–Lieb cell forms give all simple heads).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenconstructalgebra

We construct y,z:n→r with y∘z∗=1r. Write n=r+2k. If k=0, take identities. If r>0, take y with bottom cups (1,2),(3,4),…,(2k−1,2k) and all remaining sites propagating; take z with cups (2,3),(4,5),…,(2k,2k+1) and all remaining sites propagating. In y∘z∗, the first through strand follows the single alternating chain through sites 1,2,…,2k+1, while each remaining through strand is straight. There is no closed component, and the exterior matching is 1r. If r=0 and δ≠0, choose the same adjacent perfect matching y=z0 on n=2k sites and put z=δ−kz0. Then y∘z∗=δ−kδk10=10. This also handles n=r=0 with the empty diagram and no scalar inversion.

2.1F1step 1.1algebra

Set e=z∗∘y∈An. Step 1.1 gives e2=e. The map Ar→eAne sending a to z∗∘a∘y is multiplicative because y∘z∗=1r, and its inverse is b↦y∘b∘z∗. Indeed the first composite is identity, and the second is b↦ebe=b on the corner. Thus it is an algebra isomorphism with identity 1r mapping to e.

3.1step 2.1algebra

The functor M↦Me preserves exact sequences. If 0→M′→M→M′′→0 is exact, its injection remains injective on the subspaces obtained by multiplication by e. If x′′e∈M′′e, lift x′′ to x∈M and then xe lifts x′′e, proving surjectivity. If xe maps to zero, it belongs to M′ and satisfies (xe)e=xe, hence belongs to M′e, proving exactness in the middle. These are corner-module maps under step 2.1.

3.2F1step 1.1step 2.1algebra

For every label t, the map Wn,te→Wr,t sending xe to x∘z∗ is well-defined, since diagrams of propagation less than t remain such after composition. Its inverse sends u:r→t to u∘y, which lies in Wn,te. Their composites are identity by y∘z∗=1r and xe=x∘z∗∘y. They respect right Ar action under the corner identification in step 2.1. If t>r, every diagram r→t has propagation less than t, so both spaces vanish.

4.1F2step 1.1step 3.1step 3.2algebra

We verify compatibility with radicals without requiring e=e∗. Swapping y,z in step 3.2 identifies Wn,te∗ with Wr,t by x↦x∘y∗, whose inverse is v↦v∘z. The form pairing of u∘y and v∘z is the coefficient of 1t in u∘y∘z∗∘v∗=u∘v∗, hence is ϕr,t(u,v). Moreover, for x∈Wn,te and any w∈Wn,t, invariance gives ϕn,t(x,w)=ϕn,t(xe,w)=ϕn,t(x,we∗). Therefore x is in the full radical precisely when its pairing against Wn,te∗ vanishes. Under the two identifications this is exactly the condition that u belongs to rad⁡ϕr,t. Thus (rad⁡ϕn,t)e corresponds to rad⁡ϕr,t, and exactness in step 3.1 proves Dn,te≅Dr,t.

5.1F3step 3.1step 3.2step 4.1algebra

A finite-dimensional An-module has a composition series by induction on its vector-space dimension. Apply the exact functor of step 3.1 to such a series for Wn,m. By [F3] and step 4.1, each simple factor Dn,t contributes either zero or the simple factor Dr,t. Distinct surviving labels remain distinct by [F3]. In particular, only the factor with t=r contributes Dr,r, and it contributes once. Step 4.1 identifies the resulting filtered module with Wr,m, giving the claimed multiplicity equality.

6.1F1F2step 1.1step 5.1algebra∎

The sole basis vector of Wr,r is 1r; every generator lowers propagation and thus acts by zero, and its form value on that vector is 1. Hence Dr,r=Wr,r is the stated one-dimensional module. Finally, for n>0 even and δ=0, gluing any two perfect matchings creates at least one closed component, so ϕn,0 is identically zero and Dn,0=0. This explains the precise excluded branch and completes the assertion over every field, including characteristic two.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Spencer support signs, wall reflections, and nonzero composition scalars

Statement

When ℓ<∞, use the digits and place values in Spencer quantum-characteristic digits and support set, and write N+1=∑j=0rnjsj with nr>0. When ℓ<∞, each signed expression ∑jεjnjsj−1 with εr=1 lies in [0,N], has parity N, and determines its signs at every nonzero digit uniquely. Thus the support has 2h elements, where h is the number of nonzero digits below r.

For 0≤v≤u, the specialized quantum binomial Bu,v(δ) is nonzero exactly when each mixed-radix digit of v is at most the corresponding digit of u. In characteristic zero this uses the two digits with places 1,ℓ; if ℓ=∞, every such binomial is nonzero.

For ℓ<∞ and any 0<k≤r, changing all signs at indices less than k reflects the corresponding support element about the wall H−1, where H=∑j≥kεjnjsj is a positive multiple of sk. In particular, writing L=∑j<kεjnjsj gives the pair H+L−1,H−L−1 and ∣L∣<sk.

For ℓ<∞, let a,b,c belong to this support, and suppose their sets of negative nonzero digits satisfy A⊆B⊆C. Then a≥b≥c and the specialized quantum binomial B(a−c)/2,(a−b)/2(δ) is nonzero. Here B denotes the polynomial quantum binomial of Nonvanishing of an entire quantum-binomial row and the characteristic digits. If ℓ=∞, the same last assertion holds for the only triple a=b=c=N.

Facts & Assumptions

Given: A field, its loop parameter, recurrence quantum characteristic, and the digit data in the Statement.

[F1]

The support uses digits of N+1, with highest sign fixed positive and the place values and digit bounds stated in Spencer quantum-characteristic digits and support set.

[F2]

The polynomials Bu,v satisfy Bu,v(q+q−1)=q−v(u−v)Gu,v(q2), where G is the binary-word inversion polynomial (Nonvanishing of an entire quantum-binomial row and the characteristic digits).

[F3]

The binomial theorem and the vanishing of intermediate prime binomial coefficients hold over a field of prime characteristic (The binomial theorem over an arbitrary commutative ring, A prime p divides (pk) for 0<k<p).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenalgebra

Suppose ℓ<∞ for the digit and reflection arguments. The digit bounds give ∑j<knjsj≤sk−1 for every available k≥1: for k=1 this is n0≤ℓ−1, and adjoining a digit at place sk increases the maximum from sk−1 to (p−1)sk+sk−1=sk+1−1. In characteristic zero there is only the first such bound to check. Therefore the signed sum with positive highest digit is at least nrsr−(sr−1)−1≥0 and at most N. Flipping signs changes N by an even integer. For r=0, the only support element is N, so the same assertions hold.

1.2F1F2F3F4algebraconstruct

We prove the quantum-binomial zero test needed below, retaining scalar units. Using [F4] when necessary, adjoin a root q≠0 of X2−δX+1 if necessary and put Q=q2. If Q≠1, the recurrence gives [t]δ=q1−t(1−Qt)/(1−Q), so finite ℓ is the exact order of Q. If Q=1, the recurrence gives [t]δ=tqt−1, so finite ℓ equals the field characteristic. The extension does not change which elements of the original field vanish. Expanding by subsets gives ∏i=0u−1(1+QiX)=∑vQv(v−1)/2Gu,v(Q)Xv. In the first case, the length-ℓ factor is 1−(−X)ℓ by the distinct roots of Yℓ−1; in the second it has this same value by [F3].

2.1F1step 1.1algebra

If two sign choices differ at a nonzero digit, let j be their largest differing index. Their signed sums differ by a term of absolute value 2njsj≥2sj, whereas all smaller terms have combined absolute value at most 2(sj−1) by step 1.1. Thus their sums differ. Each of the h nonzero lower digits consequently gives an independent choice, proving the count.

2.2F1F2F3step 1.2algebra

If ℓ=∞, every quantum factorial is nonzero and [F2] proves the asserted nonvanishing directly. Suppose ℓ<∞ and write u=Uℓ+u0 and v=Vℓ+v0 with remainders in [0,ℓ−1]. Step 1.2 factors its product into (1−(−X)ℓ)U∏i=0u0−1(1+QiX). Comparing the coefficient of Xv, and using [F2], shows Bu,v(δ)≠0 precisely when v0≤u0 and (UV)≠0 in the field: the omitted factors are powers of Q and −1, and Gu0,v0 is nonzero because every quantum factorial index is less than ℓ. In positive characteristic, expand (1+X)U=∏i(1+Xpi)ui using [F3]. The coefficient at V is nonzero exactly when its base-p digits are at most the corresponding digits of U, since then it is a product of nonzero binomials with factorial indices less than p. In characteristic zero (UV) is nonzero whenever 0≤V≤U. Consequently the quantum binomial is nonzero exactly when every mixed-radix digit of v is at most that of u.

3.1F1step 1.1step 2.1algebra

For ℓ<∞ and a fixed split index k, the higher contribution H is divisible by sk and satisfies H≥nrsr−∑k≤j<rnjsj≥sk>0 by the same place-value bound. Step 1.1 gives ∣L∣<sk. Negating exactly the lower signs replaces H+L−1 by H−L−1=2(H−1)−(H+L−1), retains the highest positive sign, and hence stays in the support. This proves the reflection assertion, including the case L=0.

4.1F1F2step 2.1step 2.2algebra∎

For the nested sets in the Statement, subtracting the signed sums gives (a−c)/2=∑j∈C∖Anjsj and (a−b)/2=∑j∈B∖Anjsj. These are their actual mixed-radix expansions, because each digit is either 0 or the original allowed digit and no position is added twice. Since B∖A⊆C∖A, the second expansion is digitwise bounded by the first. Step 2.2 proves the nonzero scalar, including repeated labels and zero digits. If ℓ=∞ then the singleton support gives B0,0=1 directly from [F2].

Remarks

This is a combinatorial supplier. It neither constructs the candidate module maps nor asserts that support labels are composition factors. Those require separate proofs.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Signed forest candidates, wall homomorphisms, and their composition

Statement

Write [j]T for the polynomial recurrence [0]T=0,[1]T=1,[j+1]T=T[j]T−[j−1]T. For a monic diagram x:a→b, bend its b output points around the right edge in reverse order to form a matching on a+b points. Its nesting forest F(x) consists of its (a+b)/2 arcs, ordered by containment. For an arc e, let c(e) be the number of arcs inside it, counting itself. Define the polynomial hook weight hF(T)=[∣F∣]T!∏e∈F[c(e)]T. For a≥b of the same parity, define the nonzero vector va,b=∑x:a→b monichF(x)(−δ)x∈Wa,b. Its coefficient on the diagram whose bent forest is a chain is 1.

For a≥b≥c of the same parity, composition modulo propagation less than c satisfies va,b∘vb,c=B(a−c)/2,(a−b)/2(−δ)va,c. Composition here means attaching the indicated linear combinations of monic diagrams, in source-to-target order.

Let sk be an available finite place value of Spencer quantum-characteristic digits and support set. If b<a<b+2sk and a+b+2 is divisible by 2sk, then postcomposition by va,b induces a nonzero module homomorphism Wn,a→Wn,b for every n≥a of the same parity.

Facts & Assumptions

Given: The diagram modules, quantum integers, support place values and polynomial quantum binomials in the Statement.

[F1]

Link-state modules are diagram quotients by smaller propagation, with composition action (Temperley–Lieb link-state standard modules by defect number, The link-state quotient is a right Temperley–Lieb module).

[F2]

The quantum binomials are integer polynomials and have their factorial identity before specialization (Nonvanishing of an entire quantum-binomial row and the characteristic digits). Their zero pattern is the mixed-radix digitwise test proved in Spencer support signs, wall reflections, and nonzero composition scalars.

[F3]

Place values and their digit bounds are those of Spencer quantum-characteristic digits and support set.

[F4]

For n≥a>0 with even difference, the shifted adjacent-cup construction gives monic diagrams with a left retraction over every field (Exact Temperley–Lieb truncation reduces decomposition to trivial factors).

Proof

Given: The data and hypotheses in the Statement.

1.1F2givenconstructalgebra

The hook quotient is a polynomial by induction on its forest. Removing the root of a tree cancels its factor [∣F∣]T, leaving the quotient for its subforest. For a disjoint union of forests of sizes u,v, the quotient is Bu+v,u(T) times their two quotients, a polynomial by [F2]. The empty forest has weight 1. For a chain, numerator and denominator cancel completely, so its weight is 1. All further calculations may therefore be proved in Q(T) and then interpreted as identities in Z[T], before making any field specialization.

2.1F1step 1.1constructalgebra

We first use loop value −T. Consider matchings with a fixed finite number d of cups on a half-infinite ordered row, with all sufficiently far-left sites propagating. A diagram is encoded by the d right cup endpoints, numbered from the right starting at 1: scanning from right to left, a listed site opens a cup and the next unpaired unlisted site closes the most recent cup; unlisted sites with no open cup propagate. Thus every d-element subset of the positive integers encodes exactly one matching. Hook weights are unchanged by adding more leftmost propagating strands, because bending one more such strand adds a root above the entire old forest and cancels its new numerator factor. We may consequently form the formal series Vd of these matchings with their hook weights. Every fixed output coefficient after a local generator or cup attachment involves finitely many terms: only its finitely many cups and the nearest exposed propagating strand can be reconnected. All operations below are defined coefficient by coefficient.

3.1F1step 1.1step 2.1algebra

We prove that every local generator kills Vd. Fix an output matching D with its simple cup at sites i,i+1, and remove that cup to obtain a gap J in D−. A line is exposed to J if an arc from J to an interior point of that line can avoid all other lines. Replacing that line by two lines ending at i and i+1 is its nip at J. Exactly D itself and these nipped diagrams are the preimages contributing to the coefficient of D: a generator changes only the two lines meeting its sites, while the converse reconnection recovers each nip. A line exposed on both sides is nipped only once. Therefore the coefficient is CD=−[2]Th(D)+∑e exposed to Jh(nip⁡J(e)). This enumeration includes loops through the first term and all reconnection terms with coefficient 1.

4.1step 1.1step 3.1algebra

Here is a textual reduction verifying this coefficient identity. First contract each intervening fixed internal subforest to a weighted interval block: its total edge count is retained in the containing arc's subtree size and its own hook factors are common to all compared terms. Consecutive exposed arcs then have adjacent block endpoints; relabel these endpoints in their order without changing subtree sizes. Suppose those two arcs have endpoints (a,b),(b+1,c), with all their internal subforests retained, and the distinguished simple cup is immediately beyond them at (c+1,c+2). Replace those two arcs by (a,c),(b,b+1). If their subtree sizes are E1,E2, their merged subtree has size E1+E2. Every term in CD other than the two nips of these arcs corresponds to the replaced diagram with hook ratio [E1+E2]T/([E1]T[E2]T). Comparing the two exceptional nips with the single exceptional nip after replacement leaves a common rational factor times [E2]T[E1+E2+1]T+[E1]T−[E2+1]T[E1+E2]T=0. To verify the ratios, every unchanged arc contributes the same denominator factor; the changed arcs contribute respectively the subtree sizes E1,E2,E1+E2,E2+1,E1+E2+1. The displayed identity follows by induction on E1 from the recurrence for [j]T, with E1=0,1 as immediate base cases. Thus this replacement preserves the vanishing of CD. The reflected replacement does the same on the other side. Each replacement reduces by one the number of exposed arcs on the chosen side; repeated replacements leave at most one exposed arc on each side.

5.1step 1.1step 2.1step 3.1step 4.1algebra

In the half-infinite setting there is always a leftmost propagating strand beyond all the cups under consideration. Bend that strand and the other output strands to put the distinguished cup and the remaining exposed arcs inside one outer arc. This only adds successive roots as in step 2.1. After the reductions of step 4.1, let the sizes of the optional left and right exposed subtrees be B,C>0. Canceling the hook factors of unchanged internal subforests, the four contributions in step 3.1 have the common-factor-normalized sum −[2]T[B]T[C]T[B+C+2]T+1[B+1]T[C+1]T[B]T[C]T+1[B+1]T[C]T[B+C+2]T+1[B]T[C+1]T[B+C+2]T=0. The numerator is −[2]T[B+1]T[C+1]T+[B+C+2]T+[B]T[C+1]T+[C]T[B+1]T, zero by the same recurrence. If the left subtree is absent, the three terms reduce instead to −[2]T/([C]T[C+2]T)+1/([C+1]T[C]T)+1/([C+1]T[C+2]T), zero because [C+2]T+[C]T=[2]T[C+1]T. The case of no right subtree is its reflection. If neither is present, the sum is −[2]T/[2]T+1=0. Thus CD=0 in every case, proving the assertion of step 3.1 as a polynomial identity.

6.1step 2.1step 3.1step 5.1algebra

A formal vector killed by every generator is uniquely determined by its coefficient on the fully nested rightmost d cups. Indeed order the endpoint subsets componentwise, with minimum {1,…,d}. For any other subset J, let i>1 be its least element with i−1∉J, and replace i by i−1 to obtain K<J. In the coefficient at K after applying the generator at i−1,i, the coefficient at J occurs with coefficient 1. Every other contributing subset L satisfies L<J: nipping a line different from the one producing J moves an endpoint closer to the right boundary, and the loop term is K<J. Setting this coefficient to zero therefore determines the coefficient at J from smaller subsets. Componentwise lower sets are finite, so induction applies. This proof is valid over Z[T] and after any specialization.

6.2F1F2step 1.1step 3.1step 5.1algebra

We check when the finite candidate va,b is killed by every generator. Put d=(a−b)/2 and M=(a+b)/2+1. The cancellation of step 3.1, step 4.1, step 5.1 applies unchanged whenever an enclosing arc or a propagating strand is exposed to the left of the distinguished cup. Only the remaining case has a missing nip: the distinguished cup is not enclosed by another cup, and there is no propagating strand to its left. Number the original input sites 1,…,a and let the distinguished cup be (i,i+1). Then every site 1,…,i−1 is paired within that interval, so i is odd. Add a new leftmost input site 0 and a new first output site, joined by a propagating strand. Remove (i,i+1) and nip that new strand at its gap, producing the cup (0,i) and a strand from i+1 to the new output site. This is the unique additional contributing diagram. Its bent matching has (a+1+b+1)/2=M edges. The new cup (0,i) and the (i−1)/2 original cups inside it form a separate tree with t=(i+1)/2 edges. Since the original diagram had these t−1 cups and the distinguished cup, 1≤t≤d. Every other edge lies to its right, including the bent strand beginning at i+1, so no edge of this tree is comparable with an edge of the remaining forest. Any common roots introduced by auxiliary bending of additional strands cancel as in step 2.1 before this split is counted. By step 1.1 its hook weight consequently factors as BM,t(T) times the polynomial hook weights of those two parts. The uncanceled coefficient is the negative of this missing hook weight. For a=3,b=1,i=1, the missing matching has a one-edge component and a two-edge chain, giving B3,1(T)=[3]T, whose negative agrees with the direct coefficient 1−T2.

6.3F1step 1.1step 2.1step 3.1step 4.1step 5.1algebra

For a half-infinite basis diagram E with r cups, define its attachment with s−r additional cups to be E composed with the formal hook vector Vs−r of step 2.1; coefficientwise finiteness was established there. Write Att⁡r,s(E) for this attachment. For a generator whose two sites stay on one side of the attachment seam, associativity matches each coefficient in the generator acting on Att⁡r,s(E) with the corresponding coefficient in Att⁡r,s applied after the generator acts on E; any loop has factor −T in both diagrams. In the remaining case the generator joins two propagating strands across the seam. Fix an output matching D and delete the common unchanged arcs away from its newly formed simple cup gap J. Their hook factors are a common factor Hout. In the remaining local matching D0, the preimages contributing to its coefficient are exactly D0 and the diagrams obtained by nipping one line exposed to J; a line exposed from both sides is counted once. Thus the difference of the two coefficients is Hout times the seam coefficient CD0=−[2]ThF(D0)(T)+∑e exposed to JhF(nip⁡J(e))(T). The first term is the loop contribution, since the loop value is −T=−[2]T, and every nip contributes its reconnection with coefficient 1. All diagrams in this sum have the same number of arcs. Every arc outside the smallest region changed by a nip has the same subtree size in each term, so its hook denominator is a common factor; the factorial numerator is common as well. After cancelling these factors, the remaining coefficient is exactly the exposed-arc calculation of step 4.1, step 5.1: adjacent exposed arcs reduce to at most one on either side, and the resulting four-term expression (or its one-sided or empty version) vanishes by the displayed quantum-integer recurrence identities there. Hence CD0=0. This proves that attachment commutes with every generator, including one joining two propagating strands. By coefficientwise linearity, UiAtt⁡r,s(v)=Att⁡r,s(Uiv) for each formal input v. In particular, attachment carries an input killed by every generator to an output killed by every generator.

7.1F1F2step 1.1step 2.1step 5.1step 6.1step 6.3algebra

Composing attachments with u=(a−b)/2 and v=(b−c)/2 cups gives a formal vector with u+v cups. The first attachment applied to the zero-cup identity produces Vu, which is killed by every generator by step 5.1. Applying step 6.3 to this annihilated input makes the composite killed by every generator; by step 6.1 it is a scalar multiple of the formal vector with u+v cups. To find the scalar, take the fully nested monic diagram M:a→c, whose bent forest is a chain and whose coefficient is 1. It has a unique monic factorization M=Y∘X through b: each cap of X is a cap of M, and no cap of X can contain a through strand that Y later joins, so the u caps of X are exactly the u innermost caps of M; the remaining v caps belong to Y. After bending, F(X) consists of a common chain of v+c roots above two disjoint chains of lengths u and v, while F(Y) and F(M) are chains. Therefore hF(X)(T)=[u+2v+c]T!(∏j=u+v+1u+2v+c[j]T)[u]T![v]T!=[u+v]T![u]T![v]T!=Bu+v,u(T), and hF(Y)(T)=hF(M)(T)=1. Monic composition creates no closed component, so the coefficient of M in the composite is exactly Bu+v,u(T). This is the scalar multiplying the formal vector. Restricting to a finite row and discarding diagrams that use a site beyond its left boundary preserves composition, since further cup insertion cannot remove such a site. With the stated u,v, the finite candidate identity follows.

7.2F2F3step 1.1step 6.2algebra

Now specialize T=−δ, so the loop value −T is the required δ. The recurrence gives [j]−δ=(−1)j−1[j]δ by induction. Thus the quantum characteristic and all mixed-radix zero tests are unchanged. The hypotheses give 0<d<sk and sk∣M. For every 1≤t≤d, at least one digit of t below place k is positive, while every digit of M at those places is zero. By [F2], BM,t(−δ)=0. Step 6.2 therefore kills every finite failure coefficient. All generators annihilate the candidate. Its chain coefficient is 1 by step 1.1, so it is nonzero.

8.1F1F4step 7.1step 7.2algebra∎

Finally, if a linear combination v∈Wa,b is killed by all generators, every adjacent cap at the a inputs kills it modulo propagation less than b. This follows by factoring the generator as cup followed by cap: insertion of that cup is injective on the relevant monic diagram basis, so zero after insertion implies zero before it. Every diagram n→a of propagation less than a has a cup on its a-boundary, and an innermost such cup is adjacent; factoring it off shows that its postcomposition with v is zero modulo propagation less than b. Postcomposition consequently descends from the quotient Wn,a to Wn,b and commutes with the diagram action. Nonzeroness for every n≥a follows by choosing a monic diagram z:n→a with a left retraction, by [F4]: because a>b≥0, one has a>0, and the shifted adjacent-cup construction gives this retraction over every field without division. Composing a putative zero zv with the retraction would give v=0, a contradiction. Step 7.2 supplies precisely this annihilated nonzero v under the stated wall hypotheses. Together with step 6.3, step 7.1 and the substitution in step 7.2, this proves all conclusions.

Remarks

The sign in the hook argument is necessary. At a=3,b=1,δ=1 in characteristic zero, the two coefficients are −1,1; they give the invariant vector. Using the positive hook argument δ would give coefficients 1,1 and applying the first generator would give twice the adjacent-cup state. The sign correction affects scalar units, not their zero pattern or the decomposition support.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Support-character carry recursion has only simple extra standards

Statement

Let χj(x)=(xj+1−x−j−1)/(x−x−1) for j≥0, and set χ−1=0. These are integer Laurent polynomials. Put F0=0 and, for M>0, FM(x)=∑m∈Supp⁡(M−1)χm(x). For every n≥1, there are nonnegative integers βn,r, for the labels 0≤r≤n of parity n, with βn,n=1, such that (x+x−1)Fn(x)=∑rβn,rFr+1(x). Whenever r<n and βn,r>0, the actual module Wn,r(K,δ) is simple. If δ=0, n>0 is even, and the field is arbitrary, then βn,0=0. Equivalently, writing d(r,m)=1 for m∈Supp⁡(r) and 0 otherwise, d(n−1,m−1)+d(n−1,m+1)=∑r≥md(r,m)βn,r, with out-of-range labels interpreted as zero.

Facts & Assumptions

Given: A field and loop parameter, their recurrence quantum characteristic, the support sets, and the Laurent polynomials in the Statement.

[F1]

Support is formed from digits of M with highest sign positive (Spencer quantum-characteristic digits and support set).

[F2]

Critical standards are simple under the divided-label digit interval, all critical standards are simple in characteristic zero, all standards are simple if ℓ=∞, and Wn,n−2 is simple if [n]δ≠0 (Critical Temperley–Lieb Gram determinants in a digit unit interval).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenalgebra

Put za(x)=xa+x−a for a>0, and use z0=2 in identities involving it. Summing over the lower digit signs gives FM(x)=χnrsr−1(x)∏j<r, nj>0znjsj(x). Indeed the positive highest exponential times the sign product minus its negative counterpart, divided by x−x−1, is exactly the sum of the indicated χm. The lower signed sums cannot make the exponent negative, since their absolute sum is at most sr−1, while the highest contribution is at least sr. No zero digit contributes a factor 2, since the support is a set.

2.1step 1.1constructalgebra

In positive characteristic p, define CA(y) by the same formula as step 1.1 using ordinary base-p digits of the positive integer A, and put C0=0. If A=hp+d with h≥1 and 0≤d<p, this formula gives CA(y)=χp−1(y)Ch(yp) times zd(y) when d>0, and times 1 when d=0. When 1≤A<p, it gives CA=χA−1. For A≥2, write z1CA−1=CA+∑0<B<AγA,BCB. The coefficients are defined recursively as follows. If A−1<p, the only extra is B=A−2 with coefficient 1 when B>0. Otherwise write A−1=hp+d. If d=0, there are no extras. If 1≤d≤p−2, the only extra is B=A−2, with coefficient 2 for d=1 and 1 otherwise. If d=p−1, take the extra B=A−2 with coefficient 2 for p=2 and 1 otherwise, and add the extras B=pB′ with coefficients γh+1,B′. This recursion decreases A and proves the displayed identity: use z1χj=χj+1+χj−1 at the base, and z1zd=zd+1+zd−1 at the other stages, remembering z0=2. All coefficients are nonnegative, and every extra has B≡A(mod2). In characteristic zero define CA=χA−1 and use just the base recurrence with extra B=A−2.

3.1step 2.1algebra

In positive characteristic every extra of step 2.1 satisfies A−B2<pνp(B)(p−b),b≡B/pνp(B)(modp),1≤b<p. For an unscaled extra B=A−2, the left side is 1. In the base case 1≤B≤p−2, the right side is at least 2. In the noncarry case, either d=1 and p∣B, making the right side at least p≥2, or B mod p=d−1≤p−3, making it at least 3. In the carry case p>2 gives B mod p=p−2 and right side 2; when p=2, B is positive and even, so the right side is again at least 2. A scaled extra A=p(h+1),B=pB′ multiplies both sides of the inductive inequality for (h+1,B′) by p. This proves the assertion by induction.

4.1F1F2step 1.1step 2.1step 3.1constructalgebra

Suppose ℓ<∞. Put Sℓ(x)=χℓ−1(x). For M=hℓ+d with h≥1 and 0≤d<ℓ, step 1.1 factors FM=Sℓ(x)Ch(xℓ) times zd(x) if d>0 and times 1 otherwise. If n<ℓ, then z1Fn=Fn+1+Fn−1, omitting F0, including n=ℓ−1. If n≥ℓ, write n=hℓ+d. For d=0 one gets just Fn+1. For 1≤d≤ℓ−2 one gets Fn+1 and the extra Fn−1 with coefficient 2 if d=1 and 1 otherwise. For d=ℓ−1, put A=h+1: step 2.1 gives Fn+1, the extras FBℓ with coefficients γA,B, and Fn−1 with coefficient 2 if ℓ=2 and 1 otherwise. These are the asserted β; if two indices coincide their coefficients add. Immediate extras have r=n−2 and ℓ∤n, so [F2] makes Wn,r simple. The scaled extras have n+1=Aℓ,r+1=Bℓ and satisfy the interval of [F2] by step 3.1, so are also simple; in characteristic zero use the critical clause of [F2]. If ℓ=∞, the recurrence z1χn−1=χn+χn−2 gives the claim and [F2] gives simplicity of every extra.

5.1F1step 1.1step 4.1algebra∎

The Laurent polynomials χm are linearly independent over Z: the largest exponent of χm is m with coefficient 1, so a finite nonzero combination has nonzero coefficient at its largest index. Comparing their coefficients in step 4.1, using z1χ0=χ1 and the out-of-range convention, proves the last identity of the Statement. Finally δ=0 gives [2]δ=0 and [1]δ=1, hence ℓ=2. When n>0 is even one has n≥ℓ and d=0 in step 4.1, so its only term is Fn+1 and βn,0=0.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Spencer decomposition numbers over arbitrary fields

Statement

Let K be any field, let δ∈K, and let ℓ be its recurrence quantum characteristic. Put P=char⁡K when the characteristic is positive and P=∞ otherwise. Let n≥0, let m,r∈{0,1,…,n} have parity n, and let Dn,r=Wn,r/rad⁡ϕn,r be nonzero. Then [Wn,m:Dn,r]={1,m∈Supp⁡ℓ,P(r),0,m∉Supp⁡ℓ,P(r). Here the support is formed from the digits of r+1 as in Spencer quantum-characteristic digits and support set. In particular, every composition multiplicity is zero or one. This includes ℓ=∞, finite ℓ in characteristic zero, arbitrary positive characteristic, δ=±2, and characteristic two. When n>0 is even and δ=0, the label r=0 has zero form quotient and is excluded by the nonzero-simple hypothesis; its standard module Wn,0 remains among the modules classified by the formula. At n=0, D0,0=W0,0=K.

Facts & Assumptions

Given: The field, loop parameter, rank, labels, right standard modules and nonzero simple quotients in the Statement.

[F1]

The diagram basis is cellular, its cell form acts by the coefficient-of-identity rank-one rule, and its nonzero form quotients give all absolutely simple modules with pairwise distinct labels (The Temperley–Lieb link-state diagram basis is cellular, Nonzero Temperley–Lieb cell forms give all simple heads).

[F2]

Restriction of Wn,m to rank n−1 has factors Wn−1,m−1 and Wn−1,m+1 (Restriction of a link-state module has a two-step filtration). Exact truncation gives [Wn,m:Dn,r]=[Wr,m:Dr,r] whenever Dn,r≠0, and Dr,r is the trivial diagram module (Exact Temperley–Lieb truncation reduces decomposition to trivial factors).

[F3]

Support signs give a Boolean cube on nonzero lower digits, full-prefix sign changes give reflections in place-value walls, and candidate-composition binomials on comparable cube elements are nonzero (Spencer support signs, wall reflections, and nonzero composition scalars).

[F4]

The signed forest candidates va,b have chain coefficient 1, compose by the stated quantum binomials, and give genuine homomorphisms under the strict wall inequalities (Signed forest candidates, wall homomorphisms, and their composition).

[F5]

The support-character carry coefficients βn,r are nonnegative, have βn,n=1, satisfy the scalar restriction identity, and every extra positive coefficient belongs to a simple standard. In the zero-loop, positive even-rank case βn,0=0 (Support-character carry recursion has only simple extra standards).

Proof

Given: The data and hypotheses in the Statement.

1.1F1F2givenalgebra

We first record the triangular facts used below. Let It be the ideal spanned by diagrams of propagation at most t, with I−1=I−2=0. The action on Wn,m kills Im−2, because propagation cannot increase. On a nonzero Dn,r, the ideal Ir acts nontrivially: the cellular rule xCu,vr=ϕn,r(x,u)v gives a nonzero operator since the form is nonzero. Thus a composition factor of Wn,m cannot have label r<m. If Dn,m≠0, the same rank-one rule shows that Im kills the form radical, while Wn,m modulo this radical is Dn,m. Therefore this label has multiplicity exactly one; every other factor has larger label. If m=0,δ=0,n>0, the form is identically zero, so this label contributes no simple quotient. These are all cases because a link state has nonzero form whenever m>0 or δ≠0: at nonzero loop use its self-pairing, and at positive m use the two shifted adjacent-cup states whose gluing has no loop.

2.1F3F4step 1.1constructalgebra

Write d(N,m)=1 when m∈Supp⁡(N) and 0 otherwise. We prove the lower bound for the trivial-factor multiplicity t(N,m)=[WN,m:DN,N]. Call vN,m embodied if there are a submodule U⊆WN,m containing it and a module map q:U→DN,N with q(vN,m)≠0. This implies t(N,m)≥1. If the support is a singleton, its only label is N and the assertion is immediate. Otherwise write N+1=∑i=0rnisi with r≥1 and let μ=nrsr−∑i<rnisi−1. The pair N,μ is a reflection about the sr-wall below N, with 0<N−μ<2sr and N+μ+2=2nrsr. Thus [F4] gives a nonzero homomorphism WN,N→WN,μ carrying its basis vector to vN,μ. Its image is an actual trivial submodule, so this vector is embodied.

3.1F3F4step 2.1algebra

We propagate this property across the cube. Consider any subcube with higher signs fixed and all lower nonzero digits up to index j variable. Let h be its maximal label, with all variable signs positive, and l its minimal label, with all variable signs negative; suppose vN,l is embodied. We show all its labels are embodied by induction on the number of variable digits. If there are none, this is the assumption. Otherwise split at its largest variable index j. The minus-half has minimum l. The plus-half has minimum a, obtained by retaining the positive sign at j and making every smaller variable sign negative. Full-prefix reflections give genuine homomorphisms f:WN,h→WN,a and H:WN,h→WN,l by [F4], using the identity map for f if a=h. All three labels are comparable cube elements, so [F3]–[F4] give gf=λH with λ≠0, where g:WN,a→WN,l is the linear candidate map. This makes g a module map on I=im⁡f: for any algebra element and any preimage in WN,h, the equality with the genuine map H verifies intertwining, and f is surjective onto I. Moreover f(vN,h) is a nonzero multiple of vN,a and g(vN,a) is a nonzero multiple of vN,l, again because their candidate-composition scalars are nonzero. If Ul,ql embody vN,l, the submodule I∩g−1(Ul) and the functional qlg therefore embody vN,a. Apply induction to both smaller halves. The whole support cube starts with its embodied minimum from step 2.1, proving t(N,m)≥d(N,m) for every field and every support label.

4.1F1F2step 1.1step 3.1algebra

We now prove equality by induction on n, the case n=0 being the one-dimensional algebra. Suppose the full decomposition formula holds at smaller ranks. For each label m put tm=t(n,m) and let um be the multiplicity of the rank-(n−1) trivial module in the restriction of Wn,m. By [F2] and induction, um=d(n−1,m−1)+d(n−1,m+1). For each nonzero simple Dn,r let br be the multiplicity of that trivial module in its restriction; these are nonnegative integers, and bn=1. For r<n, [F2] and induction already give [Wn,m:Dn,r]=d(r,m). It remains only to determine the tm.

5.1F1F2F5step 1.1step 3.1step 4.1algebra

Treat labels m<n in decreasing order, assuming tr=d(n,r) and br=βn,r at all larger labels. If Dn,m≠0, step 1.1 and restriction of a composition series give um=tm+bm+∑m<r<nd(r,m)br. The carry identity [F5] gives um=d(n,m)+βn,m+∑m<r<nd(r,m)βn,r. Subtracting and using the descending assumption yields tm+bm=d(n,m)+βn,m. If βn,m=0, the lower bound of step 3.1 and bm≥0 force tm=d(n,m) and bm=0. If βn,m>0, [F5] makes Wn,m simple. Since m<n, its simple label is different from n, so tm=0; step 3.1 then forces d(n,m)=0, and the same equality gives bm=βn,m. This completes the descending step whenever the diagonal simple exists.

6.1F1F2F5step 1.1step 4.1step 5.1algebra

The only missing diagonal is m=0,δ=0,n>0 even. Here Dn,0=0 by step 1.1, so restriction of a composition series gives u0=t0+∑0<r<nd(r,0)br with no b0 term. By [F5], βn,0=0, and all larger br already equal their carry values. The carry identity consequently gives t0=d(n,0) directly. Thus the exceptional zero-form standard is classified too, and no nonexistent simple has been inserted. The case n=1 is covered by the initial top label and needs no descending step.

7.1F2step 3.1step 4.1step 5.1step 6.1algebra∎

We have proved [Wn,m:Dn,n]=d(n,m) at rank n, completing the induction by steps 4.1–6.1. Finally, for any nonzero Dn,r, exact truncation [F2] identifies its desired multiplicity with [Wr,m:Dr,r]=d(r,m), which is precisely the formula in the Statement. All arguments were over the given field or polynomial identities valid after its extension, and the zero-loop, zero-defect exception was explicitly handled. Hence the formula has every asserted field, characteristic and quantum-characteristic branch.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Jones–Wenzl projectors over a coefficient ring and quantum-binomial units

Statement

Let R be a commutative ring with identity, δ∈R, and n≥0. Write Bn,k(T)∈Z[T] for the quantum-binomial polynomial of Nonvanishing of an entire quantum-binomial row and the characteristic digits. A normalized Jones–Wenzl projector in TLn(R,δ) exists if and only if every Bn,k(δ), 0≤k≤n, is a unit in R. Here normalization means that the identity-diagram coefficient is 1 and die=0 for all 1≤i<n. Such an element is automatically idempotent, annihilated by every di on both sides, and unique. If it exists, its image under every homomorphism of coefficient rings preserving the loop parameter is the unique normalized projector over the target ring. No hypothesis of reducedness, being a domain, characteristic zero, or invertibility of all individual quantum integers is required.

Facts & Assumptions

Given: The commutative ring, loop parameter and rank in the Statement.

[F1]

Diagram modules are free in their noncrossing-diagram bases, composition is associative and cannot increase propagation, and every endomorphism diagram is a word in the elementary generators (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal, Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram).

[F2]

Over A=Z[q,q−1] the word-space representation has an A-linear left inverse that survives every base change. It preserves the number of ones and represents each generator by the symmetric middle block (q11q−1) (The integral two-letter Temperley–Lieb representation has a linear left inverse).

[F3]

For the inversion polynomial Gn,k(Q)=∑wQinv⁡(w), one has Gn,k(q2)=qk(n−k)Bn,k(q+q−1). Each of these polynomials is nonzero before specialization (Nonvanishing of an entire quantum-binomial row and the characteristic digits).

[F4]

Over a field, nonvanishing of the entire row Bn,k(δ) gives a normalized two-sided Jones–Wenzl projector (Jones–Wenzl existence over a field is detected by one quantum-binomial row).

Proof

Given: The specified R,δ,n and the identity-coefficient map ε.

1.1F1givenconstructalgebra

By propagation in [F1], the span of the nonidentity diagrams is an ideal, so ε is a ring homomorphism; that ideal is spanned by nonempty generator words. Thus the linear equations die=0, ε(e)=1 imply ae=ε(a)e for every a, and in particular e2=e. Horizontal reflection defines an anti-involution ∗ fixing generators and preserving ε. The element f=ee∗ is killed by the generators on both sides and has augmentation 1. Right annihilation gives fe=f, while left annihilation of e gives fe=e; hence e=f is two-sided. For two such elements e,e′, the same argument gives ee′=e by right annihilation of e and ee′=e′ by left annihilation of e′. They are equal. These arguments use no division and work over every commutative coefficient ring.

2.1F1F2F3step 1.1constructalgebra

First work over any commutative ring C containing a unit q with δ=q+q−1. In the weight-k word module of [F2], the equations for the common kernel are au10v=−qau01v. Successive adjacent swaps reduce each word to 0n−k1k and change its inversion number by one. Thus this kernel is exactly the free line generated by vk=∑w(−q)inv⁡(w)w, whose baseword coefficient is 1. If e is normalized, step 1.1 and symmetry in [F2] put both the columns and rows of its weight block in this line. First comparing the baseword column, and then each row, expresses the block as αkvkvkT for some αk∈C. Every nonempty generator word kills vk by its rightmost factor; consequently (e−1)vk=0. Comparing the baseword coefficient in evk=vk gives αkGn,k(q2)=1. In particular all these Gaussian values are units. This conclusion remains valid with nilpotents or zero divisors.

3.1F1F3step 2.1constructalgebra

For general R, put R′=R[q]/(q2−δq+1). Division by this monic quadratic gives a unique representative a+bq: subtract successive leading terms to prove existence, while a nonzero multiple of a monic polynomial has degree at least two, proving uniqueness. Thus R′=R⊕Rq as an R-module, R injects into R′, and q is a unit with inverse δ−q. Base-changing an existing e to R′ and applying step 2.1 makes Gn,k(q2) a unit. By [F3] the factor qk(n−k) is a unit, so B=Bn,k(δ) is a unit in R′. Write its inverse a+bq. The equality B(a+bq)=1 in the indicated free basis gives Ba=1 in R. Hence B is already a unit in R.

3.2F1F2F3F4step 2.1constructalgebra

To prove sufficiency construct a universal projector with only the named denominators. Use an indeterminate q, A=Z[q,q−1], and its fraction field L=Q(q). Facts [F3, F4] give a normalized projector p∈TLn(L,q+q−1). Step 2.1 determines each of its weight blocks as vkvkT/Gn,k(q2). Let S=A[Gn,k(q2)−1:0≤k≤n]⊂L. That matrix has entries in S. Apply the base-changed linear left inverse of [F2] to obtain a diagram-coefficient vector z∈TLn(S,q+q−1). After extension to L it equals p. Since S injects into L and the diagram module is free, the same identities already hold over S: ε(z)=1, diz=zdi=0 and z2=z. Thus no unproved assertion about the image or centralizer of a quantum-group action is needed.

4.1F1F3step 1.1step 3.1step 3.2constructalgebra

Suppose now every Bn,k(δ) is a unit in R, and form R′ as in step 3.1. Fact [F3] makes all evaluated Gn,k(q2) units in R′. Therefore evaluation defines a ring homomorphism S→R′: send a fraction a/∏Gn,kek to the evaluated numerator times the inverses of the indicated evaluated denominators; the cross-multiplied equality defining equal fractions remains true after evaluation. Specialize z from step 3.2 to get a normalized annihilator e′∈TLn(R′,δ). Let π:R′→R be the R-linear coefficient projection π(a+bq)=a and apply π to every diagram coefficient of e′, obtaining e∈TLn(R,δ). Left multiplication by each di has matrix entries in R, so it commutes with this coefficient projection. Hence die=0 and ε(e)=π(1)=1. Step 1.1 now makes e the required unique two-sided idempotent. The projection is used only on these linear equations; it need not preserve multiplication.

5.1F1step 1.1step 3.1step 4.1algebra∎

Any homomorphism R→T sends the diagram coefficients and their defining linear identities to those over T, so the image of the projector is the unique projector there by step 1.1. For n=0,1 there are no generator equations, the identity is the projector, and every binomial in the row is 1. The same argument includes the zero ring under the convention that its identity is its unique element. This establishes all stated implications and boundaries.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Negligible morphisms in the Temperley–Lieb category

Definition

Work over C with a fixed loop parameter δ. Let Tδ be the strict Temperley–Lieb diagram category of Temperley–Lieb planar diagram data and endomorphism modules: its objects are n∈N, and its morphism space Hom⁡Tδ(m,n) is the complex span of the noncrossing matching diagrams with m bottom and n top boundary points, composed by stacking and loop removal.

For a basis endomorphism D:n→n, let c(D) be the number of components after joining each top point to the corresponding bottom point outside the rectangle. Define the unnormalized closure trace by Tr⁡n(D)=δc(D), and extend linearly. This definition is valid for every δ∈C, including δ=0.

For m,n∈N, the subspace of negligible morphisms is Nδ(m,n)={f∈Hom⁡Tδ(m,n):Tr⁡m(g∘f)=0 for every g∈Hom⁡Tδ(n,m)}. This definition specifies subspaces only. Their closure under composition and tensor product, and hence the quotient category, are supplied separately.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Negligible Temperley–Lieb morphisms form a tensor ideal

Statement

Let δ∈C. The subspaces Nδ(m,n) of Negligible morphisms in the Temperley–Lieb category are closed under composition on either side by arbitrary Temperley–Lieb morphisms and under tensoring on either side by arbitrary Temperley–Lieb morphisms. Thus they form a tensor ideal.

Facts & Assumptions

Given: The complex Temperley–Lieb diagram category for arbitrary δ∈C, its unnormalized closure trace, and the subspaces Nδ(m,n).

[F1]

Morphisms are linear combinations of noncrossing matching diagrams; composition stacks diagrams, removes each closed component with factor δ, and is associative (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

[F2]

For a basis endomorphism D:m→m, the unnormalized closure trace is Tr⁡m(D)=δc(D) (Negligible morphisms in the Temperley–Lieb category).

[F3]

A morphism f:m→n is negligible exactly when Tr⁡m(g∘f)=0 for every g:n→m (Negligible morphisms in the Temperley–Lieb category).

Proof

technique · Compare the finite matching graphs and their closed components
1.1F1F2givenalgebra

Let f:m→n and g:n→m be basis diagrams. The closed matching graphs defining Tr⁡m(g∘f) and Tr⁡n(f∘g) are the same finite graph: the two stacked layers are read cyclically from opposite interfaces. They therefore have the same number of closed components and the same coefficient δc. Bilinearity gives Tr⁡m(g∘f)=Tr⁡n(f∘g) for all such rectangular morphisms.

2.1F1F3step 1.1algebra

Suppose f:m→n is negligible, take arbitrary a:r→m and b:n→s, and test b∘f∘a:r→s against any h:s→r. The composite a∘h∘b has type n→m, so [F3] gives Tr⁡m(a∘h∘b∘f)=0. By step 1.1, this equals Tr⁡r(h∘b∘f∘a). Thus b∘f∘a is negligible, proving closure under composition on both sides.

2.2F1F2F3step 1.1construct

Let u:r→s be arbitrary and let h:n+s→m+r test f⊗u:m+r→n+s. Form g:n→m by composing 1n⊗u with h and then closing the last r auxiliary input/output points; each resulting closed component contributes its factor δ. The full closed matching graph for h∘(f⊗u) has exactly the same remaining components and the same removed components as the graph obtained by first making this partial closure and then forming g∘f. Therefore Tr⁡m+r(h∘(f⊗u))=Tr⁡m(g∘f)=0, where the last equality is [F3]. This proves f⊗u negligible.

3.1F1F2F3step 1.1step 2.2construct∎

For u⊗f:r+m→s+n, let a test morphism be h:s+n→r+m. Compose u⊗1n with h and close the first r auxiliary input/output points to obtain g:n→m. The same component count gives Tr⁡r+m(h∘(u⊗f))=Tr⁡m(g∘f)=0. Thus u⊗f is negligible as well, proving tensor stability on both sides.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The Temperley–Lieb negligible quotient and TLJ completion

Definition

Let ℓ≥3 be an integer, put q=eπi/ℓ and δ=q+q−1=2cos⁡(π/ℓ)≠0, and use the category Tδ and tensor ideal Nδ from Negligible morphisms in the Temperley–Lieb category and Negligible Temperley–Lieb morphisms form a tensor ideal. The negligible quotient category Tδ/Nδ has the same objects n∈N and morphism spaces Hom⁡Tδ/Nδ(m,n)=Hom⁡Tδ(m,n)/Nδ(m,n). Composition and tensor product are induced from Tδ; the tensor-ideal result makes both operations well-defined on these quotient spaces.

For a C-linear monoidal category C, its additive envelope has finite formal direct sums of objects and matrices of morphisms, with matrix composition and tensor product distributing over direct sums. Its idempotent completion has objects (X,e) where e∈End⁡C(X) and e2=e; morphisms (X,e)→(Y,f) are morphisms a:X→Y satisfying a=fae, with inherited composition and tensor product. The Temperley–Lieb–Jones category at order ℓ in this text means the idempotent completion of the additive envelope of Tδ/Nδ.

This is a definition of the quotient and completion only. It does not assert that the quotient is semisimple, that the completion is a fusion category, or that its simple objects have labels 0,…,ℓ−2.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The specified rank-one divided-power tilting category

Definition

Fix an integer ℓ≥3 and set q=eπi/ℓ, so the multiplicative order of q2 is ℓ. Use the divided-power integral form of The Drinfeld-Jimbo quantized enveloping algebra by generators and relations from The Lusztig divided-power integral form UA, specialized by v↦q to C. In type A1, write K=Kh and E,F for the rank-one generators. The convention is

KEK−1=q2E,KFK−1=q−2F,[E,F]=K−K−1q−q−1,

Δ(K)=K⊗K,Δ(E)=E⊗K+1⊗E,Δ(F)=F⊗1+K−1⊗F.

This is the Sawin coproduct, rather than the inverse-K coproduct in The Drinfeld–Jimbo formulas define a Hopf algebra. Its counit is ε(K)=1, ε(E)=ε(F)=0 and its antipode is S(E)=−EK−1, S(F)=−KF, S(K)=K−1. The exact integral transport is from the library algebra with opposite coproduct, by Etarget=KElib, Ftarget=FlibK−1 and Ktarget=Klib. Substituting these generators gives the displayed coproduct and unchanged mixed relation. On divided powers the formulas are Etarget(r)=v−r(r−1)KrElib(r) and Ftarget(r)=vr(r−1)Flib(r)K−r; the inverse formulas also have Laurent-monomial coefficients, so the integral lattice and toral generators are preserved.

The Lusztig specialization includes all divided powers E(r),F(r) and the toral quantum binomials; this is the divided-power form, not the small quantum group. A finite-dimensional module is type 1 when it carries its integral-weight grading M=⨁m∈ZMm with K∣Mm=qm, the full toral character Tc,t∣Mm=[m+ct]qI for every c∈Z and t≥0, and E(r)Mm⊆Mm+2r, F(r)Mm⊆Mm−2r. The binomial is its Laurent-polynomial specialization, including negative upper indices. The grading is part of the data and is not collapsed when distinct weights have the same K eigenvalue. Every module intertwiner preserves it: for m<n, T−m,n−m has eigenvalues 0 and 1 on weights m and n.

For a≥0, the Weyl module Δ(a) has basis v0,…,va and actions

Kvj=qa−2jvj,E(r)vj=[a−j+rr]qvj−r,F(r)vj=[j+rr]qvj+r,

where the Gaussian binomials are the Laurent-polynomial specializations of Quantum integers, factorials, Gaussian binomials and divided powers at qi, and vj=0 outside 0≤j≤a. Its dual is the dual Weyl module ∇(a)=Δ(a)∨. A Weyl filtration (respectively dual-Weyl filtration) is a finite submodule filtration whose successive quotients are modules Δ(a) (respectively ∇(a)). A tilting module is a module with both filtrations.

Take s=eπi/(2ℓ), so s2=q. The ribbon category is the full weight-lattice extension Us†(sl2) of this Lusztig form, not its root-lattice restriction. Its toral factor is the completed function algebra on the weight lattice P=Zω, acting on each weight space by its weight character. Before specialization, the rank-one universal R-matrix is the Sawin weight-lattice expression

R=D∑r≥0qr(r+1)/2(1−q−2)r[r]q!E(r)⊗F(r),D∣Mm⊗Nn=smn.

interpreted in the completed tensor product; at the root it means the image of the integral completed form, not termwise division by a vanishing [r]q!. In ordinary powers the coefficient is qr(r−1)/2(q−q−1)r/[r]q!; changing to two divided powers multiplies that coefficient by ([r]q!)2. Thus the displayed divided-power coefficient is Laurent integral and vanishes for r≥ℓ after specialization. The toral factor is the weight pairing, fixed explicitly by D above. The pivotal map is jM(x)(φ)=φ(Kx) and the twist is θ=u−1j for the Drinfeld map u. The object class of this page is the full subcategory of finite-dimensional integrable type-1 tilting modules for this weight-lattice ribbon extension. No assertion about semisimplicity or the trace radical is part of this definition.

Remarks

The parameter dictionary is fixed: q here is the standard rank-one parameter in KEK−1=q2E and in δ=q+q−1. In Sawin's notation, type A1 has D=1, source root degree l=2ℓ, l′=ℓ, and q=s2; this is the weight-lattice/ribbon branch.

Remark

Their full tensor, duality and ribbon identities on the tilting category are proved in The corrected finite rank-one R series gives the full tilting ribbon structure. This is a forward exposition pointer, not a premise of the definition.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Unnormalized diagram closure and partial trace

Definition

Let R be a commutative ring, δ∈R, and use the noncrossing-pairing diagram category of Temperley–Lieb planar diagram data and endomorphism modules, with the left factor stacked above the right factor. For a basis diagram D:n→n, close each top endpoint to the corresponding bottom endpoint outside the rectangle and let c(D) be the number of circles in the resulting finite graph. Define

Tr⁡n(D)=δc(D)

and extend R-linearly to TLn(R,δ). This is the unnormalized closure trace. In particular, Tr⁡0(10)=1 and Tr⁡n(1n)=δn. No unit or nonzero condition on δ is required.

Let ∪:0→2 and ∩:2→0 be the standard cup and cap in the diagram category. For n≥1 define the right partial trace by

ptr⁡n(x)=(1n−1⊗∩)∘(x⊗11)∘(1n−1⊗∪),x∈TLn(R,δ).

It is a map TLn→TLn−1. If δ is a unit, define τn=δ−nTr⁡n. This agrees with the normalized trace of Normalized Temperley–Lieb trace from diagram closure over C when δ≠0.

Remarks

The partial trace closes only the rightmost strand; its cap/cup order and type are fixed by the displayed composite. The unnormalized trace remains defined at δ=0, while τn does not.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Jones–Wenzl recursion over unit quantum integers

Definition

Let R be a commutative ring with unit and let δ∈R. Use the quantum integers [0]=0, [1]=1, [r+1]=δ[r]−[r−1] of Temperley–Lieb quantum integers and quantum characteristic. Put p0=10 and p1=11. For r≥1, if pr is defined and [r+1] is a unit, put

Pr=pr⊗11∈TLr+1(R,δ),pr+1=Pr−[r][r+1]PrUrPr,

where Ur is the cap-cup generator on the final two of the r+1 strands in Temperley–Lieb planar diagram data and endomorphism modules. Thus pn is defined by this recursion only when every [2],…,[n] is a unit. The definition makes no assertion that failure of a denominator condition prevents every other normalized projector from existing.

prpr

The box labels stand for the corresponding idempotents and the right-hand cup-cap is Ur; the picture is only a convention aid. All algebraic identities are proved from the labeled matching composition and the relations of The elementary diagram generators satisfy the local Temperley–Lieb relations.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

Rank-one Weyl strings, tensor filtrations, and tilting classification

Statement

Use the full integral-weight divided-power category of The specified rank-one divided-power tilting category, with q=eπi/ℓ and every ℓ≥3. The displayed strings define Δ(a), and ∇(a)=Δ(a)∨. For all a,b≥0,

dim⁡Hom⁡(Δ(a),∇(b))=δab,Ext⁡1(Δ(a),∇(b))=0.

Here Ext vanishing means that every short exact sequence in the finite-dimensional full-weight category with those end terms splits. The tensor product Δ(a)⊗Δ(b) has one Weyl factor of each label a+b,a+b−2,…,∣a−b∣, and the analogous dual-Weyl assertion holds. Both filtration classes are closed under direct summands. Thus tiltings are closed under tensor products, duals and direct summands. For every a≥0 there is exactly one indecomposable tilting T(a) of highest weight a; its weight-a space is one-dimensional, and it occurs as a summand of V⊗a, where V=Δ(1). Every finite tilting is a finite direct sum of these T(a), so the additive idempotent-complete tensor category generated by V is the entire tilting category.

Facts & Assumptions

Given: The full toral-character convention, all ℓ≥3, and the displayed Weyl strings and duals.

[F1]

The specified rank-one divided-power tilting category fixes the coproduct, antipode, integral weights, full toral binomials, Weyl modules and filtrations.

[F2]

The Lusztig divided-power integral form UA and Divided-power commutation and the simple Uqi(sl2) string modules give the generic divided-power string and the toral product; specialization preserves every Laurent-integral matrix identity.

Proof

1.1F1F2F3givenalgebra

The generic string lattice is stable under every divided power by [F2,F3], and Tc,tvj=[a−2j+ct]qvj by the toral product. Hence it specializes to the stated full-weight module. More generally, if a full-weight module is supported on [−a,a] and w has weight a, the assignment vj↦F(j)w defines its unique map from Δ(a). Indeed the support kills every E(r)w for r>0 and every F(j)w for j>a. Divided-power straightening gives E(r)F(j)w=[a−j+rr]qF(j−r)w, while F(r)F(j)=[r+jr]qF(r+j). These are Laurent identities, obtained by commuting E past F and applying Pascal before specialization. They verify all divided actions; the full toral characters verify the remaining generators.

2.1F1F2step 1.1algebra

The contragredient action (xφ)(u)=φ(S(x)u) defines ∇(a); its weights are the negatives of the original weights and its toral character at weight m is the full character at m, by substituting K−1 in the generic toral product. Double duality is identified by K, since S2=Ad⁡K. A map Δ(a)→∇(b) vanishes for a>b because the generating weight-a vector has nowhere to go. For a<b, dualizing gives a map Δ(b)→∇(a), also zero. For a=b, step 1.1 maps onto the one-dimensional highest line of ∇(a), and every map is determined by that line. This proves the Hom formula.

3.1F1F2F3step 2.1constructalgebra

Work integrally over A=Z[v,v−1] in the quantum plane P=A⟨x,y⟩/(yx−vxy). Let x,y have weights 1,−1, Ex=0, Ey=x, Fx=y, Fy=0. The coproduct of [F1] preserves the relation: E(yx−vxy)=vx2−vx2=0 and F(yx−vxy)=vy2−vy2=0. On Pn, with basis Xj=xn−jyj, direct induction gives E(r)Xj=[jr]vXj−r and F(r)Xj=[n−jr]vXj+r. These matrices and the full toral characters are Laurent integral. This is the dual Weyl lattice: if wj=(vn−j)∗ in Δ(n)∨, then Ewj=−vn−2j+2[j]wj−1 and Fwj=−v−n+2j[n−j]wj+1. Rescale by c0=1, cj/cj−1=−v−n+2j−2; the resulting coefficients are [j] and [n−j]. The same calculation for divided powers proves the asserted integral identification.

4.1F1F3step 3.1constructalgebra

For a,b≥1, multiplication and insertion of the invariant tensor x⊗y−v−1y⊗x give a sequence 0⟶Pa−1⊗Pb−1→iPa⊗Pb→μPa+b⟶0, where i(f⊗g)=fx⊗yg−v−1fy⊗xg. Both maps are module maps by the module-algebra identities of step 3.1; invariance for higher divided powers follows from their integral matrices, or directly from their weight shifts on the two-factor tensor. Also μi=0 by yx=vxy. Here is exactness over A, before any root specialization. For fi=xa−1−iyi and gj=xb−1−jyj, i(fi⊗gj)=vi+b−1−jXi⊗Yj+1−v−1Xi+1⊗Yj. For each fixed i+j these are adjacent differences along the consecutive path of target basis pairs, with unit coefficients. Successively eliminating from its first vertex proves independence and a free rank-one quotient. Multiplication sends each target vertex to a unit multiple of the same monomial, so it identifies this quotient with that monomial line. This proves exactness and freeness in every degree. It therefore remains exact at every specialization. When a=0 or b=0, P0=A is the tensor unit and the assertion is immediate. Iterating gives the dual-Weyl factors a+b,a+b−2,…,∣a−b∣; dualizing reverses tensor order and gives the Weyl factors. Tensoring finite filtrations is exact over C, proving tensor closure of both filtration classes and hence of tiltings.

5.1step 1.1step 2.1step 4.1algebra

Consider 0→∇(b)→M→Δ(a)→0. If a≥b, its support is [−a,a]. A weight-a lift of the quotient generator is highest by support; step 1.1 supplies a map Δ(a)→M whose composite with the quotient fixes that generator and is the identity. This splits the sequence. If a<b, dualizing gives the already proved case with a,b interchanged. This proves Ext vanishing. Induction along two finite filtrations gives the same splitting/lifting property with a Weyl-filtered first end and dual-Weyl-filtered second end: at each filtration step lift across the preceding short exact sequence, whose obstruction is an extension of the displayed type; its splitting removes that obstruction. Equivalently, applying the elementary Hom-extension exact sequence at each step gives Ext⁡1(D,N)=0 for every such pair D,N.

6.1step 1.1step 2.1step 5.1inductionalgebra

Let M be Weyl-filtered with maximal label a. Its support is [−a,a]. An occurrence of a quotient Δ(a) can be moved to the bottom of the filtration: lift its weight-a generator across the preceding submodule and apply step 1.1, splitting that extension. Repeating for all occurrences gives the injective evaluation map Δ(a)⊗CMa→M, whose image is the sum of all maps from Δ(a) and whose quotient is Weyl-filtered with labels below a. It is injective because after these splittings it is precisely the direct sum of the top standard factors, each with a one-dimensional highest line. Any idempotent e on M preserves this image and acts there as 1⊗ea. Its image and kernel therefore have top submodules that are sums of Δ(a)'s, and their quotients are summands of the lower-label filtered quotient. Induction on the maximal label shows both are Weyl-filtered. Duality gives the corresponding assertion for dual-Weyl filtrations. Thus every summand of a tilting is tilting.

7.1step 3.1step 4.1step 6.1constructalgebra

The module V=Δ(1) is its own dual Weyl, as the rescaling of step 3.1 shows at n=1. Its powers are tilting by step 4.1. Recursively splitting a finite-dimensional module into nontrivial direct sums terminates by dimension, giving an indecomposable decomposition. Summand closure makes these tiltings. Exactly one summand of V⊗a has weight a, whose whole space is one-dimensional; denote it by T(a). For a finite-dimensional indecomposable module, an endomorphism h is either invertible or nilpotent: for large N, stabilized kernel and image give M=ker⁡hN⊕im⁡hN. Consequently an endomorphism nonzero on a preserved one-dimensional highest line is invertible.

8.1step 5.1step 6.1step 7.1algebra∎

Let M be any indecomposable finite tilting, of maximal label a. Step 6.1 embeds Δ(a)⊗Ma into M, with lower-label Weyl-filtered quotient. Choose a vector and linear functional on Ma pairing to 1. They define maps between the standard submodules of T(a) and M. Step 5.1 extends them to maps f:T(a)→M and g:M→T(a), because the source quotients are Weyl-filtered and the targets dual-Weyl-filtered. The composite gf fixes the highest line, hence is invertible by step 7.1. Thus T(a) is a nonzero summand of M; indecomposability forces an isomorphism. It also forces dim⁡Ma=1, proves uniqueness for each a, and distinguishes different a by their maximal integral weights. Decomposing any finite tilting proves all the asserted classification and generation claims. The choices here concern individual finite-dimensional vector spaces and terminating finite decompositions, not a choice axiom.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Negligible morphisms for a pivotal trace

Definition

Let C be an additive C-linear rigid monoidal category with End⁡C(1)=C, and fix a pivotal structure jX:X→X∨∨ as in Pivotal structure. For f:X→Y, call f negligible if

Tr⁡L(jX∘g∘f)=0for every g:Y→X,

where the left trace is The categorical trace of a morphism into the double dual. The negligible morphisms form the intersection of the kernels of these linear functionals; this definition alone does not assert tensor-ideal closure.

For the complex Temperley–Lieb diagram category, use its cup/cap pivotal structure. The resulting trace is exactly the unnormalized planar closure of Unnormalized diagram closure and partial trace. The same definition applies to the complex type-1 tilting category of The specified rank-one divided-power tilting category when its stated ribbon pivotal structure is used.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Diagram closure trace is cyclic and satisfies the tower rules

Statement

For any commutative ring R, loop value δ∈R, and n≥0, the unnormalized trace of Unnormalized diagram closure and partial trace satisfies

Tr⁡n(xy)=Tr⁡n(yx),Tr⁡n+1(x⊗1)=δTr⁡n(x)

for x,y∈TLn(R,δ). For n≥1 and x∈TLn(R,δ), it also satisfies

Tr⁡n+1((x⊗1)Un)=Tr⁡n(x),

where Un is the cup-cap generator on the last two strands of TLn+1. For n≥1, x∈TLn−1 and h∈TLn,

Tr⁡n(h(x⊗1))=Tr⁡n−1(ptr⁡n(h)x).

No division by δ occurs.

Facts & Assumptions

Given: A commutative ring R, δ∈R, the diagram algebras with their stated stacking product, and the closure and partial-trace maps.

[F1]

A basis diagram is a noncrossing matching; stacking glues the intermediate endpoints and assigns one factor δ to each removed closed component (Temperley–Lieb planar diagram data and endomorphism modules).

[F2]

Stacking is associative and identities act on both sides (Stacking is associative and horizontal juxtaposition is strict monoidal).

[F3]

The closure and partial trace are defined by the stated graph closure and cap/cup composite (Unnormalized diagram closure and partial trace).

Proof

technique · count connected components of finite glued graphs
1.1F1F3construct

For basis diagrams D,E:n→n, closing the stack DE makes a finite graph whose vertices are glued endpoints and whose components are circles. Moving the cut between the D-layer and the E-layer changes the cyclic order in which the same two layers are read but neither the component partition nor the number of circles. Hence the closed graph of DE and that of ED have the same number of circles. Definition [F3] assigns both the same power of δ, so Tr⁡n(DE)=Tr⁡n(ED). Bilinearity extends this equality to arbitrary x,y.

1.2F1F3algebra

In the closure of D⊗11, the extra vertical strand closes to one circle disjoint from every component of the closure of D. Thus the closed graph has exactly c(D)+1 circles; its value is δc(D)+1=δTr⁡n(D), an identity valid also at δ=0.

1.3F1F3F4algebra

Let n≥1. In the closure of (D⊗11)Un, the cap and cup of Un reconnect the added strand to the final old strand. Following the two arcs through the stack shows they form part of the same exterior-to-exterior path that was closed in D; they create no separate circle. Every other component is unchanged. The circle count is therefore c(D), proving Tr⁡n+1((D⊗1)Un)=Tr⁡n(D). Bilinearity gives the result for x.

2.1F1F2F3step 1.1step 1.2step 1.3algebra∎

Let n≥1. By [F3], ptr⁡n(h) is obtained by adding the rightmost cup, stacking h on the enlarged graph, and then joining the rightmost pair by the cap. Closing the remaining n−1 strands produces exactly the same finite graph as closing h(x⊗1) after the same x has been stacked on the first n−1 strands. The two closures therefore have equal circle counts and equal powers of δ for each basis pair (h,x). Bilinearity proves the partial-trace identity. Together with steps 1.1–1.3 this proves all claims.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

Outside-alcove rank-one tiltings have zero pivotal dimension

Statement

Let q=eπi/ℓ, ℓ≥3, and use the full-weight category of The specified rank-one divided-power tilting category. Write T(m) for the indecomposable tilting of highest weight m and χ(m)=∑j=0mem−2j. For a≥1 and 0≤b≤ℓ−2,

ch⁡T(aℓ+b)=χ(aℓ+b)+χ(aℓ−b−2),ch⁡T(aℓ−1)=χ(aℓ−1).

Also T(m)=Δ(m)=∇(m) for 0≤m<ℓ. With the positive K pivotal map, the dimension on a Weyl character is [m+1]q. Consequently every T(m) with m≥ℓ−1 has zero pivotal trace on every endomorphism, so its identity is negligible. In the retained range 0≤m≤ℓ−2, T(m) is simple of nonzero pivotal dimension [m+1]q.

Facts & Assumptions

Given: All ℓ≥3, the full toral characters, and the positive pivotal convention.

[F1]

The specified rank-one divided-power tilting category fixes the string, divided powers, integral weights and pivotal map jM(x)(φ)=φ(Kx).

[F2]

Rank-one Weyl strings, tensor filtrations, and tilting classification proves tensor filtrations, Hom orthogonality, summand closure and the full indecomposable tilting classification.

[F3]

Temperley–Lieb quantum integers and quantum characteristic gives [r]q=sin⁡(rπ/ℓ)/sin⁡(π/ℓ) and [aℓ+r]q=(−1)a[r]q.

[F4]

Proof

1.1F1F3algebra

We first prove the needed zero/nonzero Gaussian rule. Put z=v2; then [NJ]v=v−J(N−J)[NJ]z. The generating identity ∏r=0N−1(1+zrt)=∑JzJ(J−1)/2[NJ]ztJ follows by multiplying one factor and applying Pascal. At primitive ℓth z, a full block has product 1−(−t)ℓ. For N=Aℓ+B and J=Cℓ+D, 0≤B,D<ℓ, the product is (1−(−t)ℓ)A∏r=0B−1(1+zrt). Its degree-J coefficient is zero when D>B, and otherwise is a nonzero root-of-unity factor times (AC)[BD]z, provided 0≤C≤A. The residual Gaussian is nonzero because its numerator and denominator involve only nonzero factors of indices below ℓ. Thus [NJ]q has exactly that zero/nonzero rule; no phase convention is needed below.

2.1F1F2step 1.1algebra

The Weyl module Δ(n) is simple for 0≤n<ℓ and for n=aℓ−1, a≥1. Every nonzero submodule contains a nonzero weight vector because full toral characters separate weights. Its weight spaces are one-dimensional, so it contains some vj. The coefficient in E(j)vj=[nj]qv0 is nonzero: for n<ℓ use the product formula, and for n=aℓ−1 use step 1.1 with residual digit ℓ−1. Thus it contains v0 and every F(k)v0=vk. The dual is simple with the same highest weight; the bounded-highest-vector map in [F2] is a nonzero isomorphism Δ(n)→∇(n). These modules are therefore tilting and equal to T(n) by [F2].

3.1F1F2step 2.1constructalgebra

Fix a≥1, 0≤b≤ℓ−2, and put m=aℓ+b, m′=aℓ−b−2. The module X=Δ(aℓ−1)⊗Δ(b+1) is tilting by step 2.1 and [F2]. Its Weyl labels are nj=m−2j, 0≤j≤b+1, each once. Use the central quantum Casimir C=(q−q−1)2FE+qK+q−1K−1. Its commutator with E vanishes by substituting [F,E]=−(K−K−1)/(q−q−1) and KE=q2EK. The involution E↔F, K↔K−1 fixes C (use the mixed relation), so its commutator with F vanishes too. It commutes with every divided power and toral binomial: the generic commutators vanish in the integral subalgebra before specialization. Its scalar on Δ(n) is cn=qn+1+q−n−1, evaluated on the generating highest vector. Now cnj=(−1)a(zj+zj−1) with zj=qb+1−2j. Since 0<b+1<ℓ and −(b+1)≤b+1−2j≤b+1, equality with cm occurs exactly at j=0,b+1: equality of z+z−1 means z=qb+1 or q−b−1. The generalized cm-eigenspace Y is a module summand. Primary-decomposition polynomial projectors preserve submodules and quotients, so applying this projector to a Weyl filtration retains precisely Δ(m) and Δ(m′). Thus Y is tilting with character χ(m)+χ(m′).

4.1F1F2step 1.1step 3.1algebra

To prove Y indecomposable, first show Δ(m)≇∇(m). The vector vb+1 is highest of weight m′: for 1≤r≤b+1, its E(r) coefficient is [aℓ−1+rr]q=0, because its numerator contains [aℓ] and its denominator indices are below ℓ; larger r give zero by the string convention. Its generated submodule is spanned by F(j)vb+1. Terms with j>m′ vanish. Indeed a possibly nonzero basis term requires j≤aℓ−1; in the remaining interval write j=(a−1)ℓ+d with ℓ−b−1≤d<ℓ. The upper residual digit of b+1+j is b+1+d−ℓ<d, so step 1.1 gives [b+1+jj]q=0. The generated submodule is therefore supported on [−m′,m′]. The highest-vector property [F2] gives a nonzero map Δ(m′)→Δ(m). Hom orthogonality in [F2] forbids this if Δ(m)≅∇(m), since m′<m.

5.1F2step 2.1step 3.1step 4.1algebra

Decompose Y into indecomposable tiltings using [F2]. Its unique highest-weight-m summand is T(m). Its only two Weyl factors are those found in step 3.1, each once. If Y were decomposable, the top summand would have the sole Weyl factor Δ(m) and its complement the sole factor Δ(m′). Then T(m)=Δ(m) would be tilting. Weyl characters are triangular and linearly independent, so a dual-Weyl filtration of character χ(m) has the sole factor ∇(m), contradicting step 4.1. Hence Y=T(m), proving the two-factor character formula. Step 2.1 gives the Steinberg formula.

6.1F1F3F4step 2.1step 5.1algebra

Expanding coevaluation in a weight basis, [F4] gives dim⁡qΔ(n)=∑j=0nqn−2j=[n+1]q. The two characters in step 5.1 have dimensions [aℓ+b+1]q=(−1)a[b+1]q and [aℓ−b−1]q=(−1)a+1[b+1]q, which cancel. The Steinberg dimension is [aℓ]q=0. For retained labels [F3] gives [m+1]q>0.

7.1F1F2F4step 2.1step 6.1algebra∎

Let f be an endomorphism of an indecomposable T(m). Over C it has an eigenvalue λ. Then f−λI is not invertible and is nilpotent by the Fitting argument of [F2]. It preserves each integral weight space; on that space it has ordinary trace zero, so also weighted trace zero after multiplication by qweight. Therefore tr⁡(Kf)=λdim⁡qT(m). By step 6.1 this vanishes for every m≥ℓ−1 and every f. In particular all test composites have zero trace, so the identity is negligible. Finite sums remain negligible because trace is the sum of diagonal-block traces. For the retained labels simplicity follows from step 2.1 and nonzero dimension from step 6.1. This proves all claims, without a linkage theorem or an oddness hypothesis.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Partial-trace closure of negligible morphisms

Statement

In the pivotal setting of Negligible morphisms for a pivotal trace, negligible morphisms are closed under addition, scalar multiplication, arbitrary composition on either side, and tensor product on the right by arbitrary morphisms. They are also closed under tensor product on the left, hence form a two-sided tensor ideal, under either of these sufficient hypotheses: the two pivotal traces agree on every endomorphism, or the category admits a braiding. In particular the conclusion applies to the planar Temperley–Lieb category and to the braided full tilting category used below. No factorization of an arbitrary tensor-product intertwiner is assumed.

Facts & Assumptions

Given: A C-linear rigid monoidal category with pivotal structure j, and a negligible morphism f:X→Y.

[F1]

Negligibility means Tr⁡L(jXgf)=0 for all g:Y→X (Negligible morphisms for a pivotal trace).

[F2]

The pivotal structure is a monoidal natural isomorphism, and the categorical trace is cyclic, including the typed different-object identity (Pivotal structure, Basic properties of the categorical trace).

[F3]

Evaluation and coevaluation satisfy the two zig-zag identities (Rigid object and rigid monoidal category). Write tX(u)=Tr⁡L(jXu) and rX(u)=Tr⁡R(ujX−1) for the two pivotal traces.

[F4]

When the braided alternative is used, Braiding supplies natural isomorphisms cZ,X:Z⊗X→X⊗Z. In the other alternative assume explicitly tX(u)=rX(u) for every object and every endomorphism.

[F5]

The corrected finite rank-one R series gives the full tilting ribbon structure constructs a natural invertible braiding on the full prequotient rank-one tilting category for every ℓ≥3, including even ℓ, by the finite integral R series; its Proofs 3.1 and 4.1 extend the construction from tensor powers to all tilting summands.

[L1]

For the Temperley–Lieb specialization, the partial trace is the cap/cup closure of Unnormalized diagram closure and partial trace, and the component-counting identity is proved in Diagram closure trace is cyclic and satisfies the tower rules.

Proof

technique · direct
1.1F1F2algebra

For any a:Y→Z and any h:Z→X, the trace of h(af) is Tr⁡L(jXhaf). By the different-object cyclicity in [F2] and naturality jYf=f∨∨jX, this equals Tr⁡L(jYfha). Since ha:Y→X, [F1] makes this zero. The same argument with a map b:W→X and a test map g:Y→W gives Tr⁡L(jXbgf)=0; hence post- and pre-composition preserve negligibility. Closure under sums and scalar multiples follows from linearity of trace.

2.1F1F2F3step 1.1construct

Let Z be any object and h:Y⊗Z→X⊗Z. Write ev⁡~Z=ev⁡Z∨(jZ⊗1Z∨):Z⊗Z∨→1, the right evaluation determined by the pivotal structure, and define ptr⁡Z(h)=(1X⊗ev⁡~Z)(h⊗1Z∨)(1Y⊗coev⁡Z):Y→X. Expanding the trace of jX⊗Zh(f⊗1Z) gives ev⁡Z∨⊗X∨(((jX⊗jZ)h(f⊗1Z))⊗1Z∨⊗X∨)(1X⊗coev⁡Z⊗1X∨)coev⁡X. The tensor-evaluation formula factors ev⁡Z∨⊗X∨ by first evaluating the middle Z∨∨⊗Z∨ pair and then the outer X∨∨⊗X∨ pair; substituting ev⁡~Z leaves exactly Tr⁡L(jXptr⁡Z(h)f). This regrouping uses monoidality of j and the dual zig-zags [F2,F3]. Since ptr⁡Z(h):Y→X is an allowed test map in [F1], the value is zero, so f⊗1Z is negligible.

3.1F1F2F3F4step 2.1construct

Suppose first that the two pivotal traces agree on all endomorphisms. For h:Z⊗Y→Z⊗X set coev⁡~Z=(1Z∨⊗jZ−1)coev⁡Z∨ and q=(ev⁡Z⊗1X)(1Z∨⊗h)(coev⁡~Z⊗1Y):Y→X. Expand the right pivotal trace rZ⊗X(h(1Z⊗f)) using the tensor evaluation and coevaluation formulas. Its inner closure is the Z-closure defining q; the remaining outer closure is rX(qf). This is the mirror of the nested calculation in step 2.1 and uses only the two snakes and monoidality of j. Thus tZ⊗X(h(1Z⊗f))=rZ⊗X(h(1Z⊗f))=rX(qf)=tX(qf)=0, by the trace-agreement hypothesis and negligibility of f. This proves left tensor closure in this alternative; the two changes of trace are essential.

3.2F1F4step 1.1step 2.1algebra

Suppose instead that a braiding is given. Step 2.1 makes f⊗1Z negligible. Naturality gives 1Z⊗f=cZ,Y−1(f⊗1Z)cZ,X. The two outside factors have the displayed compatible types, and composition closure from step 1.1 therefore proves 1Z⊗f negligible. This alternative does not require equality of the two pivotal traces.

4.1F1F2F5L1step 1.1step 2.1step 3.1step 3.2algebra∎

For any g:Z→W, f⊗g=(1Y⊗g)(f⊗1Z) and g⊗f=(g⊗1Y)(1Z⊗f). Composition closure from step 1.1 and step 2.1 give right tensor closure for every pivotal category. Under either stated additional hypothesis, step 3.1 or step 3.2 also gives left tensor closure. In the Temperley–Lieb category, [L1] also verifies the partial-trace identities by counting components of the closed finite stacked graph. For the full rank-one tilting category, [F5] supplies the prequotient braiding required in step 3.2, so its negligible morphisms also form a two-sided tensor ideal for every ℓ≥3. Together with linearity this proves every stated closure assertion.

Remarks

The extra hypothesis for left tensor closure cannot simply be omitted. Consider the C-linear category of orientation-compatible noncrossing pairings of boundary words in X,X∨. Composition joins pairings; each resulting oriented circle contributes 0 in the orientation defining tX(1X) and 1 in the opposite orientation. A closed component remains closed in every further composition, so the total component decomposition proves associativity and tensor interchange. Cups and caps satisfy the snakes, rotation gives duals, and two rotations give the identity pivotal comparison. Taking the additive envelope gives the setting of the Definition, with End⁡(1)=C and End⁡(X)=C1X. Thus tX(1X)=0 makes 1X negligible. However, for a=coev⁡X∨:1→X∨⊗X and b=ev⁡X:X∨⊗X→1, cyclicity gives tX∨⊗X(ab)=ba=1. Hence 1X∨⊗1X is not negligible. This is a counterexample to the unqualified generality, not an open problem.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure

Statement

Let R be a nonzero commutative ring with unit, δ∈R, and suppose [2],…,[n] are units. The projector pn of Jones–Wenzl recursion over unit quantum integers has coefficient 1 on the identity diagram, is nonzero and idempotent, and is annihilated on both sides by each Ui for 1≤i<n. Its corner is pnTLnpn=Rpn, so it is the unique idempotent with identity coefficient 1 and those two-sided annihilation conditions. For n≥1,

ptr⁡n(pn)=[n+1][n]pn−1,Tr⁡n(pn)=[n+1].

Only the displayed denominator units are assumed; δ need not be a unit.

Facts & Assumptions

Given: A nonzero commutative ring R with unit, loop parameter δ, the recursive elements pr, and the diagram product convention.

[F1]

The initial values are p0=10, p1=11. For r≥1, the recursion is pr+1=Pr−([r]/[r+1])PrUrPr, with Pr=pr⊗1 and the stated unit conditions (Jones–Wenzl recursion over unit quantum integers).

[F2]

The generators satisfy Ui2=δUi, UiUi+1Ui=Ui, and distant commutation (The elementary diagram generators satisfy the local Temperley–Lieb relations).

[F3]

Quantum integers satisfy [r+1]=δ[r]−[r−1] (Temperley–Lieb quantum integers and quantum characteristic).

[F4]

Every basis endomorphism diagram is generated by the Ui; every nonidentity basis diagram has fewer than n through strands (Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram, Temperley–Lieb planar diagram data and endomorphism modules).

[F5]

The partial closure and unnormalized trace close the last strand and all strands, respectively (Unnormalized diagram closure and partial trace).

[F6]

For n≥1, closing a last identity strand gives a factor δ and full closure factors through the partial trace. For n≥2, closing Un−1 on its last strand gives the straight identity on the remaining strands (Diagram closure trace is cyclic and satisfies the tower rules).

Proof

technique · induction on the strand number
1.1F1F2F3baseIHgivenalgebra

At ranks 0 and 1, the initial projectors are identities and there are no generators; the diagram algebras are R, so nonzeroness, idempotence, annihilation, identity coefficient and the scalar-corner assertion hold directly. At rank 2, the recursion gives p2=1−δ−1U1 only when [2]=δ is a unit. Then p22=p2 follows from U12=δU1, U1p2=p2U1=0, and its identity coefficient is 1; it is nonzero because the identity and cup-cap diagrams are distinct basis vectors. For the strong induction step, assume the stated assertions for all projectors through pr [IH]. For r≥2, put Q=pr−1⊗1⊗1, a=Ur−1, b=Ur, and μ=[r−1]/[r]. The recursion gives Pr=Q−μQaQ. The supports of Q and b are disjoint, so they commute; using b2=δb and bab=b from [F2] gives bPrb=δQb−μQbabQ=(δ−μ)Qb=([r+1]/[r])Qb, where [F3] proves the last equality. Since QPr=Pr and Qb=bQ, this is the absorption identity needed below.

2.1F1F2IHstep 1.1algebra

Set X=PrbPr and c=[r]/[r+1]. Step 1.1 gives X2=Pr(bPrb)Pr=([r+1]/[r])X, hence pr+12=(Pr−cX)2=Pr−2cX+c2X2=Pr−cX=pr+1. Also bpr+1=bPr−cbPrbPr=0, because bPrb=([r+1]/[r])Qb and QbPr=bPr. By [IH], every earlier generator annihilates Pr on both sides. Horizontal reflection fixes the recursion and interchanges left and right, so pr+1Ur=0 too. The correction term has fewer than r+1 through strands, while Pr has identity coefficient 1; hence pr+1 has identity coefficient 1 and is nonzero.

3.1F4step 2.1algebra

If D is any nonidentity basis diagram, [F4] writes it as a nonempty word in the generators. Its rightmost letter annihilates pn on the left and its leftmost letter annihilates pn on the right, by step 2.1. Thus Dpn=pnD=0. Expanding any x∈TLn in the diagram basis gives pnxpn=λxpn for a scalar λx∈R, hence pnTLnpn=Rpn. If pn′ is another idempotent with identity coefficient 1 and the same annihilation, write pn=1+m, pn′=1+m′ with m,m′ linear combinations of nonidentity diagrams. The equalities pn′pn=pn and pn′pn=pn′ follow respectively from m′pn=0 and pn′m=0; therefore pn=pn′.

3.2F1F3F5F6step 2.1algebra

For n≥2, write pn=P−([n−1]/[n])PUn−1P with P=pn−1⊗1. Closing the last identity strand gives ptr⁡n(P)=δpn−1 by [F6]. Closing the last strand of Un−1 gives the straight identity, so ptr⁡n(PUn−1P)=pn−12=pn−1. Therefore ptr⁡n(pn)=(δ−[n−1]/[n])pn−1=([n+1]/[n])pn−1 by [F3]. For n=1, ptr⁡1(11)=δ10=[2]p0, the same formula.

4.1F3F5F6step 1.1step 3.2inductiondischarge-inductionalgebra∎

By [F6], Tr⁡0(p0)=1=[1]. Inductively, the partial-trace factorization gives Tr⁡n(pn)=Tr⁡n−1(ptr⁡n(pn))=([n+1]/[n])Tr⁡n−1(pn−1)=[n+1]. Together with steps 1.1–3.2, this completes the strong induction and proves all assertions.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The corrected finite rank-one R series gives the full tilting ribbon structure

Statement

For every ℓ≥3, the full tilting category of The specified rank-one divided-power tilting category is rigid and braided by cM,N=flip⁡∘RM,N, where

RM,N=D∑r≥0qr(r+1)/2(1−q−2)r[r]q!EM(r)⊗FN(r),D∣Mm⊗Nn=smn.

The sum is finite on every pair of objects. Its pivotal map is jM(x)(φ)=φ(Kx) and its ribbon twist is θM=uM−1jM, with u the Drinfeld map. For V=Δ(1), the self-dual cup and cap are

w=v+⊗v−−q−1v−⊗v+,b(v+⊗v−)=−q,b(v−⊗v+)=1,

with b(v±⊗v±)=0. They obey both snakes, b(w)=−δ and Frobenius–Schur sign −1 for j. Nevertheless dim⁡jV=δ. If U=−wb, then U2=δU, the adjacent TL relations hold, and

cV,V=sI−s−1U,T=qU−I=−s cV,V−1.

The Δ(2) and trivial channels have crossing eigenvalues s,−s−3 and Hecke eigenvalues −1,q2, respectively. Their twists are s8,1; θV=s3I. The Δ(2) channel is removed in the negligible quotient when ℓ=3. More generally θΔ(a)=sa(a+2)I for 0≤a≤ℓ−1. These assertions include even ℓ and use no small-quantum-group substitution.

Facts & Assumptions

Given: The full toral characters, q=s2=eπi/ℓ and the positive-K Hopf convention.

[F1]

The specified rank-one divided-power tilting category specifies the generators, coproduct, antipode, weight-pairing D and divided-power formula.

[F2]

Rank-one Weyl strings, tensor filtrations, and tilting classification proves that every finite tilting is a finite sum of summands of powers of V; Outside-alcove rank-one tiltings have zero pivotal dimension proves simplicity of Δ(a) for a<ℓ and its positive-K trace.

[F3]

The Drinfeld–Jimbo formulas define a Hopf algebra gives the generic Hopf identities, transported to [F1]'s convention as stated there; The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality gives the integral Gaussian identities.

[F4]

Rigid object and rigid monoidal category, Braiding, Pivotal structure and Twist and ribbon structure fix the snakes, hexagons, pivotal and dual-compatible twist conditions. A braided rigid category has a Drinfeld morphism gives u and its tensor defect.

Proof

1.1F1F4givenalgebra

In the basis (v+,v−), K=diag⁡(q,q−1), E12=1 and F21=1. Substitution in the coproduct shows that w and b are invariant for E,F,K. They preserve total integral weight, hence all toral binomials. Divided powers of index r≥3 vanish on V⊗2 by weight range, and the index-2 actions are ordinary squares divided by nonzero [2]; invariance therefore holds for the full divided-power algebra. The two direct contractions (1⊗b)(w⊗1) and (b⊗1)(1⊗w) each send v± to itself. Their closed composite is −q−q−1=−δ. Every invariant cup and cap is a scalar multiple of these, by solving the weight-zero E equation, and the snakes force the two scalars' product to be 1; that loop cannot become +δ by rescaling. With B=(0−q10) one has KBt=−B, or b(y,Kx)=−b(x,y). This is the exact negative pivotal symmetry sign.

1.2F1F3algebra

Work generically over Q(s) and put t=q−2. In ordinary powers the nilpotent series is f(Z)=∑r≥0arZr, where ar=qr(r−1)/2(q−q−1)r/[r]q!=(q−q−1)r/(r)!t and (r)!t=∏j=1r(1+t+⋯+tj−1). If AB=q2BA, Pascal induction gives (A+B)r=∑i+j=r[ri]tAiBj; dividing by (r)!t proves f(A+B)=f(A)f(B). On weight spaces DijEiDij−1=EiKj and DijFjDij−1=Ki−1Fj. Hence (Δ⊗1)R=D13D23f(E1K2F3)f(E2F3)=R13R23, because E1K2F3 and E2F3 q2-commute and D23−1F3D23=K2F3. Likewise (1⊗Δ)R=D12D13f(E1K2−1F3)f(E1F2)=R13R12, using K2−1F2=q2F2K2−1 and D12−1E1D12=E1K2−1. These are coefficientwise identities of finite series on any fixed tensor powers.

2.1F1F2step 1.1algebra

In the ordered tensor basis (++,+−,−+,−−), U=−wb has its nonzero middle block (q−1−1q−1). Thus U2=δU. The snakes give (wb)1(wb)2(wb)1=(wb)1, so also U1U2U1=U1; disjoint operators commute. The finite series on V⊗2 is R=D(1+(q−q−1)E⊗F), giving c=sI−s−1U and inverse s−1I−sU. It is a full-algebra intertwiner by direct E,F,K substitution and the divided-power/toral check of step 1.1. Its eigenvalues on ker⁡U and im⁡U are s and −s−3, respectively; im⁡U=Cw is the trivial channel. The complementary three-dimensional highest-weight string is Δ(2) by [F2]. Substitution gives qU−I=−sc−1 and the stated Hecke eigenvalues. The adjacent TL relations give Yang–Baxter: after expanding both triple products, the remaining coefficient is s−s−1δ+s−3=0.

3.1F1F3step 2.1step 1.2algebra

These tensor powers have explicit free integral tensor lattices. Their divided-power matrices are Laurent integral by the coproduct Gaussian expansion, and a toral binomial acts by the integral Gaussian at the total weight. All generic defining relations and associativity identities are therefore matrix identities over that lattice and remain true after specialization; this argument concerns finite matrices and needs no basis selection for an arbitrary completed algebra. Rewriting each series term as qr(r+1)/2(1−q−2)r[r]q!E(r)⊗F(r) makes its coefficient Laurent integral. Only finitely many r act by weight range, D has powers smn, and [r]! multiplies the term. Thus step 1.2 specializes at every ℓ≥3, including r≥ℓ, where the coefficient is zero. Inducting on tensor lengths identifies this finite series on V⊗m⊗V⊗n with the ordered block product of the elementary crossings of step 2.1. It is invertible and intertwines the entire specialized algebra. The block products satisfy both hexagons by partitioning their strands.

4.1F1F2F4step 3.1algebra

If g:M→M′ and h:N→N′ are module maps, they preserve integral weights and commute with every divided power. Consequently g⊗h commutes, in the typed sense, with each series term and D. This proves naturality with every full-algebra intertwiner directly. In particular the series and its inverse restrict to summands of tensor powers. By [F2], direct sums and such restrictions exhaust all tiltings, so invertibility, naturality and both hexagons hold throughout that category, not merely on tensor powers or on a small-quantum-group subcategory. Duals of tiltings are tilting by their two filtrations; evaluation and coevaluation for the antipode satisfy the vector-space snakes and are module maps. This proves rigidity and braiding.

5.1F1F2F4step 1.1step 4.1algebra

Since S2=Ad⁡K, jM(x)(φ)=φ(Kx) is a module map to the double dual. It is natural, invertible and monoidal because K is group-like. Form θ=u−1j using [F4]. On V∗ the matrices are E∗=−(EK−1)t, F∗=−(KF)t, with weights −1,1. Inserting them into the finite R and the evaluation formula for u gives uV=diag⁡(s−1,s−5): its second entry is s−1(1−(q−q−1)q−1)=s−5. Thus θV=s3I. The tensor defect in [F4] gives the balancing identity for θ. Dual compatibility holds on V, since it is self-dual and this twist is scalar. It then holds on every tensor power: duality reverses tensor order, the two dual crossings are the reversed crossings given by the evaluation snakes, and balancing on the two factors gives the same composite on either side. Naturality extends this equality to direct sums and summands. By [F2] these are all tiltings, proving the ribbon condition.

6.1F1F2step 2.1step 5.1algebra∎

The simple Δ(a) for a≤ℓ−1 occurs as a highest-weight summand in V⊗a by [F2]. Its highest vector is v+⊗a. Every elementary crossing there acts by s; balancing therefore gives twist (s3)asa(a−1)=sa(a+2). Naturality and the scalar endomorphism property make this its twist on the whole simple. The values at a=0,1,2 give 1,s3,s8. At ℓ=3, [F2] says Δ(2) has zero endomorphism trace and is removed in the negligible quotient; it is a genuine prequotient channel, not a retained one. Finally tr⁡(K∣V)=q+q−1=δ, despite the self-dual loop in step 1.1 being −δ. These prove all stated convention and boundary assertions.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Every boundary tensor-ideal component is the fixed embedded two-sided ideal

Statement

Let q=eπi/ℓ, ℓ≥3, δ=q+q−1, m=ℓ−1 and f=pm. Put Bn=TLn(C,δ) and

Jn={0,n<m,Bn(f⊗1n−m)Bn,n≥m.

If I is the categorical tensor ideal generated by f, then I(n,n)=Jn at every rank. Moreover, for n≥1, ptr⁡n(Jn)⊆Jn−1. Thus this single embedded two-sided ideal already contains every annular consequence with arbitrary external strands and cups/caps. Below the boundary its component is zero, including contractions given by a partial trace rather than an internal turnback.

Facts & Assumptions

Given: The complex diagram category and the exact boundary projector.

[F3]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives Uif=fUi=0, its one-dimensional corner and ptr⁡m(f)=([m+1]/[m])pm−1.

[F4]

Temperley–Lieb quantum integers and quantum characteristic gives [ℓ]=0, [j]>0 for 1≤j<ℓ, and δ>0.

Proof

1.1F1F2algebra

For n≥1 write En=ptr⁡n. Closing matching graphs gives Bn−1-bilinearity and En(x⊗1)=δx. For n≥2, it also gives En(Un−1)=1. In this latter range, for x∈Bn−1, Un−1(x⊗1)Un−1=(En−1(x)⊗1⊗1)Un−1. Indeed the two neighboring cups/caps close precisely the last input/output strand of x, leaving its other strands and the final cup/cap unchanged; every closed component contributes the same factor on both sides. For x=1 this gives Un−12=δUn−1, fixing the unnormalized factor. Since Bn is generated by Bn−1 and Un−1, this identity reduces every alternating word with two final generators to one with fewer such occurrences. Hence Bn is spanned by Bn−1+Bn−1Un−1Bn−1.

1.2F1F4algebraconstruct

To handle arbitrary-size morphisms we give an auxiliary diagram factorization. It does not identify a positive-loop pivotal category with the quantum ribbon category. Choose A=ieπi/(2ℓ), so δ=−A2−A−2, and put C=A 1+A−1U. Its inverse is A−11+AU because A2+A−2+δ=0. The adjacent triple expansion gives Yang–Baxter, with remaining coefficient A+A−1δ+A−3=0. Let W1=∪⊗1 and W2=1⊗∪. The snakes give U1W1=δW1, U2W1=W2 and U1W2=W1, whence C1C2W1=(A2+δ+A−2)W1+W2=W2,C2C1W2=W1. Reflection gives the two corresponding cap slides. Thus ordered block crossings Cr,t:r+t→t+r are natural with every matching, since cups, caps and identities generate those morphisms; linearity gives naturality with arbitrary diagram elements. Partitioning a block proves both block-crossing identities, and the triple relation identifies the ordered crossing words. All crossings used here are finite linear combinations of ordinary diagrams.

2.1F3F4step 1.1algebra

Every nonempty generator word kills f on its appropriate side, so Jm=Cf. The boundary partial trace is Em(f)=[ℓ][ℓ−1]pℓ−2=0. Its denominator is nonzero by [F4]. Thus Em(Jm)=0=Jm−1. This covers a seam contraction even when no two adjacent input endpoints of the projector are joined by a cap.

2.2F1F2step 1.2inductionalgebra

Denote by ϑt the planar curl of this auxiliary block crossing. Closing one strand gives ϑ1=Aδ+A−1=−A3. The cup/cap slides of step 1.2 give ϑr+t=Ct,rCr,t(ϑr⊗ϑt),ptr⁡t(Ct,t)=ϑt, where ptr⁡t closes the last t strands. To verify the second identity, close those strands from right to left, slide each cap through its block crossing by the displayed cap equations, then remove its matching cup by a snake. One remaining strand acquires the scalar curl −A3; the unclosed strands retain the two block-crossing words in the first identity. Induction, beginning with the computed one-strand value, proves both formulas. In particular ϑt is (−A3)t times a product of invertible crossings, so its inverse exists in Bt. This is a calculation inside the positive-loop diagram category, independent of any universal quantum R.

3.1step 1.1step 2.1inductionalgebra

Inclusion gives Jn⊗1⊆Jn+1. We prove En(Jn)⊆Jn−1 by induction; below m it is trivial and at m it is step 2.1. Let n>m, so the embedded generator is in Bn−1. Expand each multiplier of a generator afb by the spanning formula of step 1.1. With all ai,bi∈Bn−1 and U=Un−1, the four types are a0fb0, a1Ua2fb0, a0fb1Ub2, and a1Ua2fb1Ub2. Their partial traces are, respectively, δa0fb0,a1a2fb0,a0fb1b2,a1En−1(a2fb1)b2. The first three belong to Jn−1. In the fourth, the induction hypothesis puts the middle factor in Jn−2, whose inclusion belongs to Jn−1, or is zero at the boundary. This proves trace closure. Iterated partial traces consequently carry JN into Jn for every n≤N.

4.1F1F2step 3.1step 1.2step 2.2algebra

Fix arbitrary a:t→n, b:n→t and F=f⊗1t−m, with t≥m. Set N=n+t and form the actual element X=(a⊗b)(Fϑt−1⊗1n)Cn,t∈BN. The tensor a⊗b is an endomorphism of object N: its source has t+n strands and its target n+t strands. Its middle factor equals (f⊗1N−m)(ϑt−1⊗1n), so X∈JN. Naturality gives (1t⊗b)Cn,t=Ct,t(b⊗1t), so also X=(aFϑt−1⊗1t)Ct,t(b⊗1t). Pulling maps on the untraced wires outside the closure and using step 2.2 now gives ptr⁡t(X)=aFϑt−1ptr⁡t(Ct,t)b=aFb. By step 3.1 this belongs to Jn, even when n<m, where it is zero. This is an explicit factorization for all external strands and all seam contractions, not a claim that every low-rank diagram has an internal cap against f.

5.1step 3.1step 1.2step 4.1algebra∎

A tensor-ideal word containing f is a finite sum of composites a(1r⊗f⊗1u)b. If it contains further copies of f, expand those in their finite matching basis and absorb them into the multipliers, leaving one distinguished copy. Naturality with the auxiliary crossings moves 1r⊗f⊗1u to f⊗1r+u by an invertible conjugation, absorbed in a,b. Step 4.1 therefore puts every such consequence in Jn, proving I(n,n)⊆Jn. Conversely tensoring f with identities and composing on either side puts the generators and all their two-sided multiples in I. Hence Jn⊆I(n,n). Their equality and all partial-trace assertions follow, including the zero components below m.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

General Temperley–Lieb theta-net evaluation and its root domain

Statement

Initially let q be an indeterminate, let [j]=qj−1+qj−3+⋯+q1−j for j≥1, let [0]!=1, and set δ=q+q−1. For nonnegative integers m,n,p, put r=m+p,s=m+n,t=n+p,h=m+n+p. Equivalently, (r,s,t) satisfies the triangle inequalities and even-sum condition, with m=(r+s−t)/2, n=(s+t−r)/2, and p=(t+r−s)/2. All Jones–Wenzl projectors below have identity coefficient one and are unnormalized.

Let Wm:0→2m be m nested cups, whose outputs are two consecutive m-strand bundles: cup i joins position i of the first bundle to position m+1−i of the second. Let Bm:2m→0 be its horizontal reflection. Define A=1p⊗Wm⊗1n:t⟶r+s,B=1p⊗Bm⊗1n:r+s⟶t, α=(pr⊗ps)Apt,β=ptB(pr⊗ps),Θ(m,n,p)=Tr⁡t(βα). Thus the pairwise bundles at each trivalent vertex have sizes m,n,p: there are m strands between arms r,s, n between arms s,t, and p between arms t,r. This fixes the vertex without a further scalar normalization. The theta net has the three JW-labelled edges r,s,t, since idempotence collapses the doubled projectors. Its value is Θ(m,n,p)=[m]![n]![p]![h+1]![m+n]![n+p]![m+p]!. For p≥1 the closed-diagram strip recurrence is [m+p][n+p]Θ(m,n,p)=[p][m+n+p+1]Θ(m,n,p−1),Θ(m,n,0)=[m+n+1].

These identities specialize to every complex q≠0 for which [j]≠0 for 1≤j≤M=max⁡(r,s,t), using the Laurent-polynomial convention at q=±1. These hypotheses construct the three projectors and make every displayed denominator a unit; [h+1] need not be nonzero. In particular, if q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2, then Θ>0 when h≤ℓ−2, whereas Θ=0 when h≥ℓ−1. The latter vertex has zero trace pairing against every reverse morphism. No undefined higher root projector or 0/0 convention is used.

Facts & Assumptions

Given: The stated m,n,p,r,s,t,h, the positive-loop diagram convention, the nested cup/cap maps Wm,Bm, the unnormalized closure trace, and initially the field C(q). For the specialization conclusion, q∈C× and [1],…,[M] are nonzero. The proof uses only finite matrices and finite diagram contractions; it assumes no quantum-group ribbon or tilting theorem and no choice principle.

[F1]

Quantum integers satisfy [0]δ=0, [1]δ=1, and [j+1]δ=δ[j]δ−[j−1]δ. For δ=q+q−1 the convention at q=±1 is [j]q=jqj−1 (Temperley–Lieb quantum integers and quantum characteristic, Definition).

[F2]

The JW projector has “coefficient 1 on the identity diagram,” is nonzero and idempotent, and is annihilated on both sides by the elementary generators. Its corner is paTLapa=C(q)pa, and Tr⁡a(pa)=[a+1] (Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure, Statement). For a≥1, its defining recursion is pa+1=Pa−([a]/[a+1])PaUaPa with Pa=pa⊗1. The initial values are p0=10, p1=11; the construction uses only the stated unit denominator quantum integers (Jones–Wenzl recursion over unit quantum integers, Definition).

[F3]

A diagram is a noncrossing perfect matching. Stacking removes each closed cycle for a factor equal to the loop value and leaves the exterior matching; composition and horizontal juxtaposition extend bilinearly and form a strict monoidal category (Temperley–Lieb planar diagram data and endomorphism modules, Definition; Stacking is associative and horizontal juxtaposition is strict monoidal, Statement).

[F4]

The elementary cup-cap generators satisfy Ui2=δUi, UiUi+1Ui=Ui, Ui+1UiUi+1=Ui+1, and distant commutation (The elementary diagram generators satisfy the local Temperley–Lieb relations, Statement).

[F5]

Every basis endomorphism diagram is a finite product of elementary generators; the product can be chosen without an intermediate closed cycle (Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram, Statement).

[F6]

Closing a basis diagram with c circles has value δc, and this extends linearly. Closure is cyclic and factors through the stated cup/cap partial trace, with no division by the loop value (Unnormalized diagram closure and partial trace, Definition; Diagram closure trace is cyclic and satisfies the tower rules, Statement).

[F7]

“The homomorphism πn:Pn(R,δ)→TLn(R,δ) sending ui to di is an isomorphism.” This holds for every commutative ring, without requiring the loop value to be nonzero or invertible (The generator presentation is the planar diagram algebra over every commutative ring, Statement).

Proof

technique · evaluate the defined diagram by an explicit JW matrix contraction, prove the resulting finite q-Vandermonde sum, and then specialize only the final localization identity
1.1F3F6givenconstructalgebra

Work first over C(q). Let V have ordered basis (+,−), and define w=+−−q−1(−+) and b(+,−)=−q, b(−,+)=1, b(+,+)=b(−,−)=0. Direct evaluation on + and − gives both snakes (1⊗b)(w⊗1)=1V and (b⊗1)(1⊗w)=1V, while b(w)=−δ. Thus cup ↦w, cap ↦b evaluates every planar diagram with loop −δ: the two snake moves and deletion of a component have exactly their prescribed values, so the evaluation respects stacking and planar matching equality. This is a finite matrix evaluation of TL(−δ), with no quantum-group input.

2.1F4F7step 1.1algebra

Write e=wb and U=−e. In the two weight-zero words the nonzero block is U∣(+−,−+)=(q−1−1q−1), which is symmetric under ordinary transpose. The generators −ei satisfy the positive-loop relations by the two snakes and ei2=−δei; consequently [F7] makes Ui↦−ei an algebra isomorphism between the positive- and negative-loop diagram endomorphism algebras, with its own inverse of the same form.

3.1F1F2F5step 2.1algebra

Under loop −δ, the quantum integers are [j]−=(−1)j−1[j], by the recurrence in [F1]. Substitution in the JW recursion shows inductively that the isomorphism takes the positive projector pa to the negative-loop projector pa−. Its evaluated matrix Pa is therefore the positive-loop JW recursion matrix built from the displayed symmetric U: it is symmetric, idempotent, annihilated by every Ui, and is identity plus nonempty U-words.

4.1step 3.1constructalgebra

For a word x of length a, let j(x) count its minus signs, and let inv⁡(x) count pairs consisting of a minus before a plus. Put za,j=∑j(x)=jqinv⁡(x)x and Za,j=za,jtza,j=∑j(x)=jq2inv⁡(x). The equation Uiv=0 says that the coefficient of a word with −+ in positions i,i+1 is q times the coefficient of the otherwise identical word with +− there. Adjacent swaps connect all words with fixed j, and replacing +− by −+ increases inversion number by one. Hence the common kernel in that weight space is exactly C(q)za,j. The image of Pa lies in the common kernel; conversely its nonidentity generator words kill that kernel by their rightmost factor, so Pa acts as identity there.

5.1step 4.1algebra

A symmetric rank-one projector with image C(q)z is zzt/(ztz). Here Za,j is a nonzero polynomial with constant term one, so it is invertible in C(q). Thus the actual JW matrix, rather than a substitute projector, has entries (Pa)x,y=qinv⁡(x)+inv⁡(y)Za,jwhen j(x)=j(y)=j. This includes a=0 with the empty word and Z0,0=1.

6.1F1step 4.1algebrastep 5.1

Put Q=q2 and write (aj)Q for the Gaussian polynomial. Appending a plus to a word with j minuses creates j inversions, whereas appending a minus creates none. Therefore Za,j=QjZa−1,j+Za−1,j−1, with Za,0=Za,a=1. This is the Gaussian polynomial recurrence with the same initial values; induction gives Za,j=(aj)Q. Also [u]=q1−u(1+Q+⋯+Qu−1), so conversion of the three factorials gives Za,j=qj(a−j)[a]![j]![a−j]!. All inversions here occur in C(q); root specialization will follow only after denominators have been put in the stated unit range.

7.1F2F3F6step 1.1step 4.1algebrastep 6.1

The negative planar trace in this evaluation has pivotal matrix J=−K, where K=diag⁡(q,q−1). Indeed the bilinear matrix of b is B0=(0−q10), and the symmetric planar transpose relation JB0t=B0 gives exactly J=−K; equivalently the corresponding direct cup/cap closure of a matrix f is Tr⁡((−K)f). Tensoring this closure gives Tr⁡((−K)⊗af) on V⊗a. The basis za,j of im⁡Pa has weights a−2j, so the negative-loop trace is dim⁡−(pa)=(−1)a∑j=0aqa−2j=(−1)a[a+1]. The diagram corner ptEnd⁡(t)pt is scalar by [F2], also seen directly because an innermost turnback kills every nonidentity matching. The vector +t is fixed by Pt and detects that scalar. Thus no faithfulness claim about arbitrary diagram Hom spaces is needed to recover the scalar used below.

8.1step 1.1givenalgebrastep 7.1

Form the same A,B,α,β in the negative-loop diagram category, and denote the theta value by Θ−. For a word x of length m, let xˉ be its bitwise complement followed by reversal. The prescribed nested cups and caps give Wm(1)=∑x(−q−1)j(x)x⊗xˉ,Bm(x⊗xˉ)=(−q)m−j(x), and Bm is zero on other pairings of the two word bundles. This follows by multiplying the m fundamental coefficients: a plus in x contributes cup coefficient one and cap coefficient −q; a minus contributes cup coefficient −q−1 and cap coefficient one. The reversed order is exactly the nesting in the Statement.

9.1F2step 7.1step 8.1algebra

The negative-loop diagram βα is in the scalar pt corner, so write its evaluated matrix as LPt. On +t the outer Pt factors may be omitted: they fix this vector, all maps preserve total weight, and weight t in V⊗t is the one-dimensional space C(q)+t. Idempotence removes the doubled middle projectors. Hence L is exactly the coefficient on +t obtained by applying B(Pr⊗Ps)A to +t.

10.1step 5.1step 8.1step 9.1algebra

Let x have j minus signs and v=inv⁡(x). Its A output is (+px)⊗(xˉ+n) with coefficient (−q−1)j. The two word inversion counts are v and v+(m−j)n, since complement followed by reversal preserves inversions. Substitution in the actual projector entries of step 5.1, then summation over words with this fixed j, gives (Pr⊗Ps)A(+t)=∑j=0mCjzr,j⊗zs,m−j,Cj=(−q−1)jq(m−j)nZm,jZr,jZs,m−j. Here the sum of q2v over those words is precisely Zm,j.

11.1step 8.1step 9.1step 10.1algebra

In applying B to the jth tensor in step 10.1, only word pairs (+px,xˉ+n) can leave all of its p leftmost and n rightmost through positions plus. Their contraction coefficient on +t is (−q)m−jq(m−j)nZm,j, by the same inversion count and the cap formula in step 8.1. Therefore every contraction is accounted for in L=(−1)m∑j=0mqm−2j+2n(m−j)Zm,j2Zm+p,jZm+n,m−j. This is an evaluation of the specified bundled, projector-labelled diagram, rather than an asserted strip identity.

12.1step 6.1step 11.1algebra

Substituting step 6.1 into the quotient of Z factors in step 11.1 contributes exponent j(n−p)−mn and factorial factor [m]!2[m+p−j]![n+j]!/([m+p]![m+n]![j]![m−j]!). Consequently L=(−1)m[m]!2[m+p]![m+n]!Sm,n,p,Sm,n,p=∑j=0mqm(n+1)−j(n+p+2)[m+p−j]![n+j]![j]![m−j]!. The exponent simplification is m−2j+2n(m−j)+j(n−p)−mn=m(n+1)−j(n+p+2), so no omitted scalar or power of q enters this norm contraction.

13.1step 6.1constructalgebrastep 12.1

For N≥0 the formal power series identity ∑j≥0(N+jj)Qxj=∏i=0N(1−Qix)−1 follows coefficientwise. If hN,j denotes the right-hand coefficient, multiplying by 1−QNx gives hN,j=hN−1,j+QNhN,j−1. The Gaussian polynomial on the left has the identical recurrence, since (N+jj)Q=(N+j−1j)Q+QN(N+j−1j−1)Q, and the initial values are h0,j=1 and hN,0=1. This Pascal identity follows by clearing the ordinary Q-factorial denominators, or by the inversion-word recurrence of step 6.1. Induction thus proves the displayed formal identity; there is no analytic convergence premise.

14.1step 13.1algebra

Apply step 13.1 to the adjacent exponent intervals [−n−1,−1] and [0,p]. Their geometric-series products multiply to the product for the whole interval [−n−1,p]. The coefficient of xm is therefore ∑j=0mQ−j(n+1)(n+jn)Q(p+m−jp)Q=Q−m(n+1)(m+n+p+1m)Q. The summand uses degree j from the negative interval and degree m−j from the nonnegative interval. Shifting all exponents of the combined interval up by n+1 and applying step 13.1 with N=n+p+1 gives the right side. This proves the finite q-Vandermonde identity used here.

15.1step 6.1step 12.1step 14.1algebra

Divide a summand of Sm,n,p by [n]![p]!. Its factorial part is the product of the symmetric quantum binomials [m+p−jp]q[n+jn]q. Converting these to Gaussian polynomials by step 6.1 changes their combined prefactor to qm(n+1−p)Q−j(n+1). Thus step 14.1 gives the symmetric binomial q−m(n+p+1)(h+1m)Q=[h+1m]q after this same conversion, and hence Sm,n,p=[n]![p]![h+1]![m]![n+p+1]!. Substitution into step 12.1 proves L=(−1)m[m]![n]![p]![h+1]![m+p]![m+n]![n+p+1]!. Every sum and exponent in this evaluation has therefore been derived independently of a theta formula or recoupling coefficient.

16.1F3F5F6step 3.1step 7.1algebrastep 15.1

The negative diagram satisfies Θ−=(−1)t[t+1]L by step 7.1. To compare it with the desired positive-loop theta, expand all three projectors as generator words. Under Ui↦−ei, a term with a total of v generator insertions gains coefficient sign (−1)v, by step 3.1. With no insertions its closed matching has exactly h=m+t circles: m cup/cap circles and t through-strand closures. One cup-cap insertion reconnects two edges of a closed planar one-manifold and merges two components or splits one; thus it changes the circle count by ±1. Consequently the total count c for a term with v insertions satisfies c≡h+v(mod2), including components removed during stacking. Evaluating its loops at −δ gives sign (−1)c, so its combined sign is always (−1)v+c=(−1)h. Summing the terms proves the diagrammatic identity Θ−=(−1)hΘ, without presupposing a factorial evaluation.

17.1step 15.1step 16.1algebra

Since h+t≡m(mod2), steps 15.1 and 16.1 give Θ=(−1)m[t+1]L=[m]![n]![p]![h+1]![m+n]![n+p]![m+p]!. At p=0 this is [m+n+1], which checks the stated normalization: there is no extra sign, dimension, or scalar at a vertex.

18.1step 17.1algebra

The proved scalar expression gives the cross-multiplied closed-diagram strip identity [m+p][n+p]Θ(m,n,p)=[p][m+n+p+1]Θ(m,n,p−1) for p≥1. This is an identity of the specifically defined diagrams' evaluations because steps 1.1–17.1 derived their JW entries, nested cup/cap contractions, exponent factors, and finite sum. A pictorial strip manipulation or the theta recurrence has not been assumed as a premise. Over C(q) its unit factors can be divided to give Θ(m,n,p)/Θ(m,n,p−1)=[p][m+n+p+1]/([m+p][n+p]). Starting with Θ(m,n,0)=[m+n+1], the product telescopes as [m+n+1]∏j=1p[j][m+n+j+1][m+j][n+j]=[m]![n]![p]![h+1]![m+n]![m+p]![n+p]!. The analogous strip recurrence in m or n follows by relabelling the three bundles or by the proved symmetric expression.

19.1F1F2step 17.1step 18.1algebra

Each JW recursion coefficient is a rational Laurent function with denominators products of [j] for j≤M=max⁡(r,s,t), by [F2]. The actual theta diagram therefore belongs to the localization Z[q,q−1,[1]−1,…,[M]−1]. The right side of step 17.1 is in the same localization, since its only denominators are [r]![s]![t]!. Their equality over C(q) is consequently an equality in that localization and specializes at every point where these quantum integers are units, even if an intermediate norm formula or a quotient of two theta values has a zero denominator there. This specializes the final identity, rather than dividing a zero theta value at the root. The Laurent-polynomial convention of [F1] also covers q=±1.

20.1F1step 19.1algebra

Now let q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2. Every denominator index is at most ℓ−2, so its quantum integer is nonzero. If h≤ℓ−2, all numerator indices are at most ℓ−1, and [j]=sin⁡(jπ/ℓ)/sin⁡(π/ℓ)>0 in this range, so Θ>0. If h≥ℓ−1, then [h+1]! contains [ℓ]=0, while the denominator remains nonzero, so Θ=0. This uses no division by [ℓ] and no 0/0 limit, and covers even ℓ and ℓ=3. Labels outside a domain in which their required JW projectors exist are not unqualified root diagrams.

21.1F2F3F6step 17.1step 18.1step 19.1step 20.1algebra∎

Finally sandwich any matching t→r+s by pt and pr⊗ps. If an arc joins two points on the same labelled arm, its innermost turnback is killed by that arm's projector. The only remaining noncrossing matching is the stated m,n,p-bundled vertex. Thus its projected Hom space is spanned by α, and the reverse space by β, over the root field as well as generically. Their entire trace pairing is scalar multiplication by Θ. Nonzero Θ makes that vertex pairing nondegenerate; zero Θ makes the vertex have zero trace pairing against every reverse morphism, including an arbitrary reverse map after inserting the projectors and using cyclicity. This proves the stated root pairing conclusions without dividing by a forbidden-level theta value. Together with steps 17.1 and 18.1–20.1, it proves all claims.

Remarks

Chen's Theorem 3.2.3 explicitly states the theta formula and refers to Kauffman–Lins, Chapter 6, for a proof. The finite projector contraction and geometric-series summation above supply an independent local proof. The generic proof temporarily inverts the nonzero polynomials Za,j; root specialization uses only the final identity in the JW localization. It does not specialize those intermediate norm denominators or normalize a forbidden-level vertex by a vanishing theta value.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

Root fusion paths have nonzero pairings

Statement

For generic q, or whenever the quantum integers needed for pr,ps,pt are units, the unnormalized trivalent theta pairing satisfies

Θ(r,s,t)=[m]![n′]![p]![m+n′+p+1]![m+n′]![n′+p]![m+p]!,

where m=(r+s−t)/2, n′=(s+t−r)/2, p=(t+r−s)/2 are nonnegative integers. The vertices and exact unit domain are those of General Temperley–Lieb theta-net evaluation and its root domain. At q=eπi/ℓ, ℓ≥3, and 0≤r,s,t≤ℓ−2, the pairing is positive when the triangle/parity conditions hold and r+s+t≤2ℓ−4; it is zero for a triangle/parity triple above that level. A triple requiring an undefined root JW projector is not implicitly included.

Put k=ℓ−2 and quotient the diagram category by the tensor ideal generated by pk+1. A retained path of length n is a=(a0,…,an) with a0=0, 0≤ai≤k and ∣ai−ai−1∣=1. There are inclusions ia:pan→n and retractions ra:n→pan such that raib=0 for distinct paths, raia=pan, and ∑aiara=1n. Consequently the Ea,b=iarb at a common endpoint form complete matrix units, with

Ea,bEc,d=δb,cEa,d,Tr⁡n(Ea,b)=δa,b[an+1]q.

Their pairing is nondegenerate. The endpoint pk+1 is deleted before normalization; no denominator [ℓ] is used.

Facts & Assumptions

Given: All ℓ≥3, the positive-loop diagram convention and its unnormalized trace.

[F1]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives idempotence, absorption, turnback annihilation and ptr⁡a(pa)=([a+1]/[a])pa−1.

[F2]
[F3]

Temperley–Lieb quantum integers and quantum characteristic gives [j]>0 for 1≤j<ℓ and [ℓ]=0.

[F4]

General Temperley–Lieb theta-net evaluation and its root domain proves the full theta formula, its generic unit domain and its retained-root nonzero/zero level alternatives.

[F5]

Every boundary tensor-ideal component is the fixed embedded two-sided ideal identifies every tensor-ideal endomorphism component with the fixed embedded two-sided ideal. Partial-trace closure of negligible morphisms proves tensor-ideal closure when the two pivotal traces agree on all endomorphisms. Here either closure of any basis endomorphism counts exactly the same finite matching components with the same factor δ per component; linearity therefore verifies that hypothesis.

Proof

1.1F3F4givenalgebra

The theta formula and exact vertex convention are [F4]. At a retained triangle/parity triple, its denominator indices are r,s,t≤ℓ−2. If h=(r+s+t)/2≤ℓ−2, every numerator index is at most ℓ−1 and [F3] makes the ratio positive. If h≥ℓ−1, its numerator factorial [h+1]! contains [ℓ], whereas the denominator stays nonzero; its value is zero. These conclusions specialize the generic localization identity, not a ratio of theta values at the root.

1.2F1F2F3constructalgebra

For 1≤a≤k set fa=pa⊗1, Xa=faUafa and λa=[a+1]/[a]. Define αa=fa(1a−1⊗∪)pa−1,βa=pa−1(1a−1⊗∩)fa. Absorption of pa−1 next to pa gives αaβa=Xa: insert the cup/cap and remove the absorbed lower projector. Closing the other composite is exactly the right partial trace of pa in its lower corner, so [F1] gives βaαa=λapa−1. Thus Xa2=λaXa. The JW recursion gives fa=pa+1+λa−1αaβa. The two terms are orthogonal because pa+1 kills the joining turnback. The down maps are inclusion αa and retraction λa−1βa; the up maps are the tautological inclusion/retraction of pa+1. For a=0 there is only p1. Every denominator here has index at most ℓ−1 and is nonzero.

1.3F1F2F3F5algebra

For retained endpoints, Hom⁡(pa,pb)=0 if a≠b and is Cpa if a=b. Indeed any matching between unequal boundaries has an innermost adjacent cap or cup at the larger boundary and is killed by its JW projector. Between equal boundaries, every nonidentity matching has such a turnback. The identity corner survives in the quotient: its trace is [a+1]>0, while the boundary tensor ideal is negligible. For the latter assertion, pk+1 has one-dimensional endomorphism corner and trace [ℓ]=0, so every test trace vanishes; tensor-ideal closure in [F5] gives the assertion at all objects. Thus the quotient introduces no extra identification in the retained scalar corners.

2.1F3F5step 1.2algebra

At a=k, pass to the categorical quotient and delete pk+1 from the decomposition before taking any further normalization. The identity becomes pk⊗1=λk−1αkβk with λk=[ℓ−1]/[ℓ−2]≠0. It therefore has only its down summand. In particular at ℓ=3, k=1, this says that the quotient tensor square is its trivial channel; no retained highest-weight-2 summand is asserted. The endomorphism ideal being killed is exactly [F5]'s embedded one.

3.1F1F2step 1.2step 2.1inductionconstructalgebra

Start with the single rank-zero path and tensor its identity decomposition by 1. Inductively split each endpoint summand pa⊗1 by steps 1.2 and 2.1 and compose its up/down maps with the preceding path maps. Cross-composites of the new up/down terms vanish by turnback annihilation; the equal down composite is λa−1βaαa=pa−1 and the up composite is pa+1. Different preceding paths have zero composite by induction. Their new projections sum to the old projection tensored with 1, because the split is complete; at the boundary only the down term remains. This proves simultaneously raib=0 for distinct paths, raia=pan and ∑aiara=1n for every rank.

4.1F1F2F3step 1.1step 3.1step 1.3algebra∎

For paths with equal endpoint put Ea,b=iarb. The composites in step 3.1 give their matrix-unit multiplication. Insert the complete path identity on each side of any morphism and use the corners of step 1.3: these units span all endomorphisms, and the same argument describes unequal-degree Hom spaces. They are independent because multiplying a putative relation by ra and ib isolates its coefficient times the nonzero endpoint projector. Closing iarb has the same finite component graph as closing rbia, even though the cut occurs at a different object. Thus the trace is zero off the diagonal and [an+1] on it. Each matrix block has nonzero weighted ordinary trace pairing, detected by its transposed matrix units. This proves completeness and nondegeneracy at every rank. Together with step 1.1 it proves all assertions without a recoupling division at the boundary.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

The rank-one tilting quotient is the truncated fusion category

Statement

For every ℓ≥3, let Tℓ be the full finite-dimensional integrable type-1 tilting category of The specified rank-one divided-power tilting category, and Nℓ its negligible ideal. The quotient with the same objects and morphism spaces Hom⁡Tℓ(X,Y)/Nℓ(X,Y) is a finite semisimple ribbon category. Its simple objects are exactly T(0),…,T(ℓ−2), of pivotal dimensions [a+1]q, and

[T(a)][T(b)]=∑∣a−b∣≤c≤min⁡(a+b,2ℓ−4−a−b)c≡a+b (2)[T(c)](0≤a,b≤ℓ−2).

Here a fusion category means a C-linear rigid semisimple monoidal category with simple unit and finitely many simple isomorphism classes. The quotient is spherical with the specified positive pivotal dimensions and inherits the full ribbon structure, including even ℓ.

Facts & Assumptions

Given: The full toral-character tilting category, all ℓ≥3, and the pivotal negligible pairing.

[F1]

The specified rank-one divided-power tilting category specifies the category. Rank-one Weyl strings, tensor filtrations, and tilting classification proves its tensor stability, full indecomposable classification, tensor Weyl factors and Ext orthogonality.

[F2]

Outside-alcove rank-one tiltings have zero pivotal dimension proves retained simplicity, positive dimensions and zero trace for every endomorphism of each outside indecomposable.

[F3]

Negligible morphisms for a pivotal trace defines the pairing. The full tilting category is braided by [F4], so the braided alternative of Partial-trace closure of negligible morphisms proves its tensor-ideal property before taking any quotient. No sphericality of the quotient is assumed to construct it.

[F4]

The corrected finite rank-one R series gives the full tilting ribbon structure proves the full braiding, duality, positive-K pivotal map and ribbon twist on all tiltings.

[F5]

Basic properties of the categorical trace gives cyclicity and additivity of the pivotal trace.

Proof

1.1F1F2F3F5givenalgebra

By [F1] every object decomposes into finitely many indecomposable T(m). By [F2], all T(m) with m≥ℓ−1 have negligible identities and become zero. For retained a, T(a)=Δ(a)=∇(a) is simple; Hom orthogonality in [F1] gives Hom⁡(T(a),T(b))=δabC. Thus the subcategory of retained sums has rectangular matrix Hom spaces. Its trace on each endomorphism block is [a+1] times the ordinary matrix trace, by [F2,F5]. These nonzero weights make the pairing with the reverse Hom space nondegenerate. Consequently a morphism is negligible exactly when its retained-to-retained block vanishes; all its other blocks factor through negligible summands and are negligible by [F3]. Hence the quotient is precisely the semisimple category of retained sums, with the asserted complete simple list.

2.1F1F2F3F4F5step 1.1algebra

The tensor product and composition descend by the tensor-ideal property [F3]. The unit T(0) has scalar endomorphisms and dimension 1, so is simple and survives. The dual of T(m) is an indecomposable tilting of the same highest weight: its character is symmetric, duality preserves indecomposability, and [F1] classifies it as T(m). Thus duality preserves both the retained and negligible parts of step 1.1; it descends, and the evaluation/coevaluation snakes remain identities in the quotient. The invertible braidings, pivotal maps and dual-compatible twist of [F4] descend by naturality and [F3]. The quotient is therefore rigid and ribbon. Left and right pivotal traces on retained simples are respectively the sums of their K and K−1 weight eigenvalues; symmetric strings make them equal to [a+1]. Additivity and the matrix-block description prove equality on all endomorphisms, so the quotient is spherical.

3.1F1F2step 1.1step 2.1algebra

Put k=ℓ−2, Sa=[T(a)] for 0≤a≤k, and x=S1. The tensor filtration [F1] for V⊗Δ(a) has factors Δ(a+1),Δ(a−1), omitting the negative label at a=0. For a≤k these factors are simple tiltings, including Δ(ℓ−1) at the boundary, by [F2]. Their extensions split by [F1]'s Ext orthogonality, since each is both Weyl and dual Weyl. Hence in the quotient xSa=Sa−1+Sa+1 with S−1=Sk+1=0, S0=1. For k=1 this says x2=1. Define integer polynomials P0=1, P1=x, Pa+1=xPa−Pa−1. Then Sa=Pa(x) and Pk+1(x)=0.

4.1F1step 1.1step 3.1inductionalgebra∎

Induction with this recurrence gives the polynomial identity PaPb=∑c=∣a−b∣, ∣a−b∣+2,…,a+bPc: for b=0 it is immediate, and subtracting the preceding b−1 identity from x times the b identity cancels its two interior shifted sums and leaves the b+1 endpoints. Modulo Pk+1=0, the same recurrence gives Pk+1+j=−Pk+1−j. The terms above k in the product sum therefore cancel the retained terms from 2k+2−a−b upwards, with matching parity; a possible term Pk+1 is zero. The remaining indices are precisely ∣a−b∣≤c≤min⁡(a+b,2k−a−b) of parity a+b. The simple classes are independent by step 1.1, so this class identity is the actual direct-sum multiplicity rule, not merely a character prediction. Since 2k=2ℓ−4, it is the displayed formula. All arguments preserve every ℓ≥3 and complete the theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck escalatedjudge pass (gpt-6-luna)Open item page →

The rank-one tilting quotient matches the Temperley-Lieb ribbon convention

Statement

Use all ℓ≥3, q=eπi/ℓ, s=eπi/(2ℓ), δ=q+q−1 and the full tilting category of The specified rank-one divided-power tilting category. Put V=Δ(1) and let P0 be its trivial-channel projector in V⊗V=Δ(2)⊕Δ(0). The maps

ρn:TLn(C,δ)⟶End⁡Tℓ(V⊗n),Ui⟼δP0,i,i+1

are well defined. Their composite with the negligible quotient has kernel exactly the embedded boundary ideal In=(pℓ−1) and induces

TLn(C,δ)/In ≅ End⁡Tℓ/Nℓ(V⊗n).

Equivalently the target is the full centralizer on a chosen sum of the retained tilting summands. The unreduced map does not kill pℓ−1: its image is the nonzero simple Δ(ℓ−1).

The precise categorical comparison is with the additive Karoubi negligible quotient of TL(−δ), equipped with its ordinary diagram braiding c=s1+s−1e and with planar pivotal structure multiplied by tensor parity (−1)n. This is ribbon-equivalent to Tℓ/Nℓ. Its endomorphism algebras are identified with positive-loop TL algebras by Ui=−ei. Its pivotal dimensions are [a+1]q, and its twists on retained labels are sa(a+2). The quantum self-duality cup/cap have loop −δ and Frobenius–Schur sign −1, whereas the parity-corrected pivotal closure has value +δ on V. Thus no equivalence of the unmodified positive-loop unoriented pivotal TL category is asserted.

On the highest-weight-2 and trivial prequotient channels, the quantum crossing eigenvalues are s,−s−3; the Hecke element Ti=qUi−1=−sci−1 has eigenvalues −1,q2. The highest-weight-2 channel is retained only when ℓ≥4. Pivotal traces, twists and all framed ribbon closures agree under the stated corrected comparison. Assume countable choice only when invoking the cited free framed-tangle evaluation theorem; the local matrix and path arguments use no choice axiom.

Facts & Assumptions

Given: The exact full-weight category, both loop conventions and the specified square root.

[F1]

The specified rank-one divided-power tilting category and The corrected finite rank-one R series gives the full tilting ribbon structure give the actual Hopf convention, full finite R, invariant cup w, cap b, U=−wb, negative Frobenius–Schur sign, positive pivotal dimension, channel eigenvalues, twists and tensor identities.

[F2]

Root fusion paths have nonzero pairings gives complete retained path matrix units. The root negligible quotient is semisimple with truncated fusion identifies their exact embedded kernel and trace radical.

[F3]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure gives JW recursion, turnback annihilation, partial trace and nonzero identity coefficient.

Proof

1.1F1givenalgebra

By [F1], the genuine full-algebra intertwiners w,b satisfy both snakes, b(w)=−δ and KBt=−B for their bilinear form. Thus the self-duality sign is −1, independently of rescaling. Put e=wb and U=−e=δP0. The snakes give Ui2=δUi, UiUi+1Ui=Ui and distant commutation, so they give every ρn. The two channels and their twists/crossings are exactly [F1]. In particular T=qU−1=−sc−1, so q2 belongs to the trivial channel, not to the highest-weight-2 channel.

2.1F1F3F4step 1.1algebra

The rigid tensor functor from TL(−δ) sends cup to w, cap to b, and ei to wibi. The two snakes and negative loop verify its defining matching relations. The algebra identification Ui↦−ei preserves the JW projectors: the recursion quantum integers for loop −δ are (−1)j−1[j], and these signs cancel against the generator sign in each recursive correction. Thus the evaluated projector pa is annihilated by the matrices Ui. For a≤ℓ−1, their common kernel in each weight space is one-dimensional: Ui imposes that the coefficient of −+ is q times that of +−, so adjacent swaps determine every coefficient from one word. The vectors F(j)v+⊗a, 0≤j≤a, belong to this kernel and are nonzero: the divided coproduct has one Laurent-monomial coefficient for every specified subset of j changed positions. The projector acts as identity on its common kernel, since its nonidentity generator words kill that kernel. Its image is therefore precisely this (a+1)-dimensional highest-weight string, equal to Δ(a) by [F4]. In particular pℓ−1 has a nonzero image of zero pivotal dimension, and cannot lie in the kernel of the unreduced map.

3.1F1F2F3F4step 2.1algebra

In the quantum negligible quotient the boundary image is zero by [F4]. Transport [F2]'s path splits to the negative-loop category. Its down normalization is −λa rather than λa=[a+1]/[a]; replacing its down cap map by its negative yields exactly the positive-algebra normalization for U=−e. The transported path units therefore have the same multiplication and positive-K trace weights [a+1]. They decompose V⊗n into all retained Δ(a) copies. Hom orthogonality in [F4] shows their rectangular blocks are the entire quantum quotient Hom spaces, not a proper subalgebra. Their positive trace weights show independence, while [F2] identifies the diagram kernel as exactly In. This proves the displayed centralizer isomorphism. On a chosen retained sum Rn, composites through discarded negligible summands are zero because its weighted matrix-trace pairing is nondegenerate. Thus projecting to Rn realizes the same algebra as End⁡U(Rn); the quotient formulation is independent of that choice.

4.1F1F2F4F5step 1.1step 3.1algebra

The same path decomposition on both ends gives fullness and faithfulness for Hom spaces between unequal tensor degrees as well. Every tilting is a sum of summands of powers of V by [F4]. Consequently the functor extends from the additive Karoubi boundary quotient of TL(−δ) to a tensor equivalence with the whole tilting negligible quotient. In the source let j0 be its planar pivotal structure. Its dimension at pa is (−1)a[a+1]. The parity map ϵn=(−1)n1n is a monoidal natural automorphism: Hom spaces between different parities are zero. It descends to summands with ϵpa=(−1)a and commutes with duality. Thus j=ϵj0 has the positive dimensions [a+1]. More precisely, the equality KBt=−B in step 1.1 says the functor's transported planar pivotal map on V is −K; multiplying it by ϵV=−1 gives exactly K. Monoidality, direct sums and summands prove equality of pivotal structures on every object, not merely equality of dimensions.

5.1F1F4F5step 4.1algebra

The source crossing c=s1+s−1e is precisely the actual finite-R crossing by [F1]. Its inverse and adjacent triple relations hold by the TL relations. Naturality with cups/caps can also be read directly: for W1=w⊗1, W2=1⊗w, the snakes give e1W1=−δW1, e2W1=W2, e1W2=W1, so c1c2W1=(s2−δ+s−2)W1+W2=W2; the reflected and reversed identities give the other three slides. Thus the functor preserves the full braiding. With j0, the generator curl is s(−s2−s−2)+s−1=−s3. Since θ=u−1j, changing j0 to ϵj0 changes this to +s3. It gives θpa=sa(a+2) by balancing on the highest tensor component, as already proved in [F1]. Parity commutes with duality, so the twist remains dual-compatible. The pivotal tensor equivalence therefore preserves braiding and twist globally, hence is a ribbon equivalence. At ℓ=3, the removed a=2 channel is treated exactly as [F1] specifies.

6.1F1F5A1step 1.1step 3.1step 4.1step 5.1algebra∎

The scalar composite of the fixed self-dual cup and cap is still −δ; re-pivotalization changes the pivotal closing map, not that composite. Its corrected ribbon unknot closure is instead tr⁡(K∣V)=+δ, and one framing twist acts by s3. Because the equivalence preserves evaluation, coevaluation, braiding and twist, it preserves every composite framed colored tangle and its closure, not just two channel scalars. The evaluation and ribbon-trace suppliers [F5,A1] apply with their stated countable-choice hypothesis only at this last universality step. The preceding steps establish all algebra, kernel, sign and ribbon assertions independently of that axiom and finish the proof.

5 · Examples, counterexamples and false statements

None yet.

Sources