Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources