Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Jones-Wenzl image gives a finite maximally mixed sector

Statement

Under the finite Hilbert representation data, let r:=rank⁡P>0 and ρ:=P/r. An orthogonal projection on H means a complex-linear endomorphism Q satisfying Q2=Q and ⟨Qx,y⟩=⟨x,Qy⟩ for all x,y∈H. Then P is an orthogonal projection, ρ is a density matrix with eigenvalue 1/r of multiplicity r and eigenvalue 0 on ker⁡P, and its entropy is s(ρ)=log⁡r in nats. Under the published closure convention, the unnormalized diagrammatic closure trace of the algebraic Jones-Wenzl element is Tr⁡n(pn)=[n+1]δ. The proposition records this separately from the ordinary Hilbert-space trace tr⁡H(P)=r and does not assert the two values agree. A sufficient additional hypothesis for equality on this element is that the representation preserve these traces, tr⁡H(π(Φn−1(X)))=Tr⁡n(X) for every X∈TLn(C,δ).

Statement references

Facts & Assumptions

Given: The data of the finite Hilbert representation definition, including n≥1, δ∈R, nonzero denominators [2]δ,…,[n]δ, a unital representation with self-adjoint generator images, and r=rank⁡P>0.

[L1]

Finite Hilbert boundary representation of Temperley-Lieb: p^n is the presentation image of the recursively defined diagram projector, P=π(p^n), every π(ui) is self-adjoint, and r=dim⁡Cim⁡P>0.

[F1]

Jones–Wenzl recursion over unit quantum integers: p1=11 and pk+1=(pk⊗11)−([k]δ/[k+1]δ)(pk⊗11)dk(pk⊗11).

[F2]

Jones–Wenzl projectors: annihilation, uniqueness, partial trace, and closure: if [2]δ,…,[n]δ are units, then pn2=pn and its unnormalized diagram closure trace is [n+1]δ.

[F3]

Unnormalized diagram closure and partial trace: Tr⁡n is the linear functional obtained by closing each top point to the corresponding bottom point and assigning a factor δ to each resulting loop.

[F4]

Direct-sum sector code entropy model: a finite density matrix is self-adjoint, has nonnegative eigenvalues, and has trace one.

[F5]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: the trace is the basis-independent sum of diagonal entries in any basis.

[F6]

Sector entropy and relative entropy identities: for a density matrix τ, s(τ)=−∑λj(τ)>0λj(τ)log⁡λj(τ), with 0log⁡0=0 and natural logarithms.

[F8]

Kernel and image of a linear map: ker⁡T={x:T(x)=0} and im⁡T={T(x):x∈H} for a linear endomorphism T of H.

Proof

technique · Induct along the Jones-Wenzl recursion index to prove self-adjointness, then use the range-kernel decomposition of an idempotent
1.1L1F2algebra

By [F2], pn2=pn. The map Φn and the representation π are algebra homomorphisms, so P2=π(p^n2)=π(p^n)=P.

1.2F2F3

The imported projector result [F2] gives the unnormalized closure value Tr⁡n(pn)=[n+1]δ, where [F3] defines Tr⁡n by closing the corresponding diagram endpoints and weighting each resulting loop by δ. This is the diagram-algebra functional recorded separately from the Hilbert-space trace.

1.3L1F1base

At recursion index 1, Q1:=π(ι1,n(p^1))=IH is self-adjoint because p^1=1 and ⟨IHx,y⟩=⟨x,IHy⟩ for all x,y∈H.

1.4L1F1ihalgebra

Suppose 1≤k<n and Qk:=π(ιk,n(p^k)) is self-adjoint. By the commuting tower identity in [L1], the diagram recursion [F1] transfers under Φn−1 and π to Qk+1=Qk−ckQkπ(uk)Qk, where ck=[k]δ/[k+1]δ∈R because δ is real and the recurrence defines real quantum integers. For all x,y∈H, self-adjointness of Qk and π(uk), together with ck∈R, gives ⟨Qk+1x,y⟩=⟨Qkx,y⟩−ck⟨Qkπ(uk)Qkx,y⟩=⟨x,Qky⟩−ck⟨x,Qkπ(uk)Qky⟩=⟨x,Qk+1y⟩. Thus Qk+1 is self-adjoint.

2.1step 1.3step 1.4inductiondischarge-induction

Applying the finite step 1.4 from base step 1.3 through k=n−1 gives Qn=P, with P self-adjoint in the stated inner-product sense; when n=1, step 1.3 already gives the conclusion.

3.1F8step 1.1step 2.1algebra

For every x∈H, x=Px+(IH−P)x, with Px∈im⁡P and P(IH−P)x=0, so (IH−P)x∈ker⁡P by [F8]. If y=Pu∈im⁡P and z∈ker⁡P, then ⟨y,z⟩=⟨Pu,z⟩=⟨u,Pz⟩=0 by step 2.1 and Pz=0. Thus the two subspaces are orthogonal and sum to H, so their intersection is zero and H=im⁡P⊕ker⁡P. The idempotent P acts as the identity on im⁡P and as zero on ker⁡P, so it is an orthogonal projection with eigenvalues 1 on its r-dimensional image and 0 on the kernel.

4.1F4F5F6F7step 1.2step 3.1step 2.1algebradischarge-induction∎

By step 3.1 and [F5], the ordinary Hilbert-space trace is tr⁡H(P)=r, while step 1.2 gives the separate diagrammatic closure value. The operator ρ=P/r is self-adjoint and has eigenvalues 1/r on im⁡P and 0 on ker⁡P. In a basis formed from bases of these subspaces its trace is r(1/r)=1, so it is a density matrix by [F4,F5]. Its entropy is −r(1/r)log⁡(1/r)=log⁡r by [F6,F7]. This concludes the proof using the self-adjointness established by induction in step 2.1.

Depends on

Dependency tree · 2 levels

Sources