Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

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

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

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

The positive-root Jones quotient is the type-A path tower with positive right closure

Statement

Let ℓ≥3, q=eπi/ℓ, δ=q+q−1>0, k=ℓ−2, and let [a]=sin⁡(aπ/ℓ)/sin⁡(π/ℓ). For the normalized closure trace τn, let Jn be its trace-pairing radical and put Qn=TLn(C,δ)/Jn. Then Jn is exactly the endomorphism component of the negligible tensor ideal generated by the boundary Jones–Wenzl projector pℓ−1. The Qn form the actual Aℓ−1 path-space matrix tower of Type-A path spaces and their matrix-unit tower, with paths starting at 0 and staying in {0,…,k}. Their simple modules are precisely the nonzero endpoint path spaces, and restriction branches with multiplicity one over adjacent predecessor vertices.

Reflection gives a finite-dimensional C∗-structure on Qn in which the normalized closure trace is faithful positive. The strand inclusions are injective unital ∗-maps and normalized right closure descends to the positive trace-preserving conditional expectation Eˉn:Qn+1→Qn for n≥1. More explicitly, choose the normalized path matrix units Fp,q whose prefix inclusions satisfy Fp,q↦∑cFpc,qc. If pc,qc end at c, with predecessor endpoints a,b, then Eˉn(Fpc,qc)={[c+1]δ[a+1]Fp,q,a=b,0,a≠b. Here the extensions and matrix units exist only for valid adjacent retained labels. The diagonal trace is τn(Fp,p)=δ−n[a+1] when p ends at a. These assertions hold at every finite rank, including the ℓ=3 boundary; no extra quotient/path identification is assumed.

Facts & Assumptions

Given: The stated positive root parameters and the closure/reflection convention.

[F1]

Inclusion and normalized right closure preserve the trace radicals, are bimodular and trace-preserving, and satisfy Enιn=id. (Normalized right closure preserves the diagram trace radical, Right closure is a trace-preserving diagram-tower expectation)

[F2]

The retained path inclusions and retractions are recursively constructed by the JW up/down splitting, with complete path matrix units and diagonal unnormalized trace [a+1]. At endpoint a≥1 the supplier's down maps are the cup inclusion αa and cap map λa−1βa, where λa=[a+1]/[a]>0; it proves βaαa=λapa−1 but does not assert βa=αa∗. The adjoint relation and orthogonal normalization used below are proved locally. (Root fusion paths have nonzero pairings, Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure)

[F3]

The fixed embedded boundary ideal is exactly Jn, its quotient is the full retained path matrix algebra, and categorical negligibility has these exact endomorphism components. (The root negligible quotient is semisimple with truncated fusion)

[F4]

The abstract endpoint path tower uses prefix extension, and its restricted endpoint module branches once over each adjacent predecessor. (Type-A path spaces and their matrix-unit tower, The A_(ell-1) path-space tower branches by adjacent vertices)

[F5]

At this positive root, [a]>0 for 1≤a<ℓ, [ℓ]=0, and [a]+[a+2]=δ[a+1]. (Temperley–Lieb quantum integers and quantum characteristic)

[F6]

Every normal endomorphism of a finite-dimensional complex inner-product space has an orthonormal eigenbasis; applied to a self-adjoint matrix, its eigenvalues are real and its negative spectral projection is an element of that same matrix block. (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely)

[F7]

At the positive root, δ is real, the diagram involution is conjugate-linear horizontal reflection (fixing 1 and each Ui and exchanging cups with caps), and the normalized closure trace has diagram value τn(D)=δc(D)−n. Reflection preserves the number c(D) of components after closure, and cyclicity is supplied by the closure-trace argument used in [F1]. (Right closure is a trace-preserving diagram-tower expectation, Normalized right closure preserves the diagram trace radical)

Proof

Given: The hypotheses and [F1]–[F5].

1.1F2F3F5F7givenalgebra

The quantum-integer recurrence with real δ makes each [r] real, and [F5] gives [r]>0 for 1≤r<ℓ. Starting with p0=p1=1, induction in the JW recursion shows pr∗=pr through r=ℓ−1: reflection fixes Pr=pr⊗1 and Ur, while the coefficient [r]/[r+1] is real whenever this recursion is used. In particular the boundary projector pℓ−1 is self-adjoint. For n<ℓ−1, the generated ideal component In is zero and is reflection-stable; for n≥ℓ−1, its fixed embedded generator pℓ−1⊗1 is self-adjoint, so In=TLn(pℓ−1⊗1)TLn is reflection-stable because (x(pℓ−1⊗1)y)∗=y∗(pℓ−1⊗1)x∗. By [F3], these are the endomorphism components of the generated negligible tensor ideal. Also [F7] gives τn(D∗)=τn(D)‾ on diagrams and hence on all elements. If x∈Jn, then for every y cyclicity yields τn(yx∗)=τn(xy∗)‾=τn(y∗x)‾=0; thus the trace radical is reflection-stable as well. Since [F3] identifies it with In, the quotient involution is well defined.

2.1F2F3F5step 1.1constructalgebra

Fix a retained endpoint 1≤a≤k, write fa=pa⊗1, and use the supplier's maps αa=fa(1a−1⊗cup)pa−1 and βa=pa−1(1a−1⊗cap)fa. Horizontal reflection reverses composition and exchanges the cup and cap; step 1.1 fixes fa and pa−1, so αa∗=βa. The supplier identity βaαa=λapa−1 therefore gives αa∗αa=λapa−1. Set va=λa−1/2αa. Then va∗va=pa−1 and vava∗=λa−1αaβa, the down projection in the JW split. For a<k, the complementary up projection is pa+1; it is self-adjoint by step 1.1 and orthogonal to the down projection by the JW turnback relations in [F2]. At a=k, the quotient kills pk+1=pℓ−1 before normalization, so only the down projection remains. The up inclusion and retraction are adjoints, as are va and va∗. Composing these isometric branch maps along retained paths gives path maps Ip with mutually orthogonal ranges and ∑pIpIp∗=1n. Hence Fp,q=IpIq∗ are complete matrix units and Fp,q∗=Fq,p. Their diagonal units equal the supplier's path projections (the reciprocal branch normalizations cancel), so Tr⁡n(Fp,q)=δp,q[a+1] by [F2]. Thus the quotient with its inherited reflection is a direct sum of full complex matrix algebras with the usual adjoint, hence a finite-dimensional C∗-algebra. Since τn(Fp,p)=δ−n[a+1]>0, its normalized closure trace is faithful positive.

3.1F2F3F4step 2.1algebra

Tensoring an endpoint path map with a strand and resolving its endpoint identity by the same isometric up/down splitting gives Fp,q⊗1=∑cFpc,qc. The coefficients are exactly one because the inclusion and retraction at each common endpoint use reciprocal normalizations. At a=k delete pk+1 before splitting; only its down term remains, as in [F2]. Thus the actual quotient inclusions are exactly the prefix maps of [F4]; no compatibility is imposed as an additional hypothesis. Transporting the endpoint action along these matrix units and applying [F4] gives the asserted multiplicity-one branching, omitting zero path spaces and invalid boundary labels.

4.1F1F6step 2.1step 3.1algebra

[F1] defines ιˉn([x])=[ιn(x)] and Eˉn([z])=[En(z)] independently of representatives. Bimodularity, trace preservation and Eˉnιˉn=id pass to these quotients, so inclusion is injective. Its compatibility with reflection follows from real δ. Closure also commutes with reflection: the two finite matching graphs obtained by reflecting before or after closing have the same components and the real factor δ−1. Thus Eˉn is star-preserving. For z≥0 and b∈Qn, bimodularity gives τn(b∗Eˉn(z)b)=τn+1(ιˉn(b)∗zιˉn(b))≥0. If the self-adjoint Eˉn(z) had a negative spectral subspace in one of the finite matrix blocks from step 2.1, its nonzero spectral projection would contradict this inequality and faithfulness. Hence Eˉn is positive, unital, idempotent, bimodular and trace-preserving, the claimed conditional expectation.

5.1F1F4F5step 2.1step 3.1step 4.1algebra∎

Bimodularity with the endpoint central projections shows that Eˉn(Fpc,qc)=0 if the predecessor endpoints a,b differ. If they agree, bimodularity with the individual predecessor matrix units shows that its value is a single scalar ta,cFp,q independent of p,q: multiplying on the left and right by predecessor diagonal units isolates that matrix entry, and multiplying by predecessor off-diagonal units identifies their coefficients. Trace preservation on a diagonal unit now gives ta,cδ−n[a+1]=δ−(n+1)[c+1], so ta,c=[c+1]/(δ[a+1]). The coefficients are positive and sum to one over valid neighbours by [F5]; at the upper boundary the omitted term is [ℓ]=0, and at a=0 the nonexistent down term is [0]=0. For ℓ=3 every vertex has one retained neighbour and this coefficient is one. Rank zero and rank one have their unique scalar path algebra and the unital inclusion between them. This proves every assertion at the stated finite ranks.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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