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.

✓ 8 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. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Temperley–Lieb Towers, Spin Chains, and Scaling Interfaces

1 · Prerequisites

2 · Summary

This draft develops four distinct interfaces: the abstract Aℓ−1 path-space tower; the full Jones tower of an ordinary finite-index II1 inclusion; the open XXZ and Potts finite-chain representations; and normalized right closure on the diagram tower. Every map, parameter, basis order and boundary range is fixed in its local definition. TikZ records the rightmost closure convention; its proof is by matching graphs.

Item order and dependencies

The path-space and subfactor data definitions, and the XXZ/Potts local conventions, precede their respective proofs. The diagram tower definition depends on the diagram category and normalized closure trace. The root quotient theorem derives the positive-root quotient/path-space identification from the completed PA-31 matrix units and radical equality, with actual prefix maps and right closure.

Claims and limits

The path-space theorem proves multiplicity-one branching on the abstract type-A tower. The diagram closure lemma proves injection, bimodularity, trace preservation, the one-generator Markov value, and positivity under the stated faithful C∗-trace hypotheses. The trace-radical lemma proves algebraic descent of inclusion and right closure; it does not identify this pairing radical with the categorical negligible ideal.

Ordinary finite Jones index supplies the bounded finite frame and complete projection model through local standard-form, dimension, comparison and pull-down proofs. The Jones theorem constructs every stage, its faithful Markov trace, an explicit dual frame of the same index, and both adjacent projection identities. Extremality uses the right-action relative-commutant trace and propagates through the tower. The finite diagram tower represents there; no surjectivity onto a von Neumann algebra or its full relative commutant is claimed.

The XXZ and Potts relation lemmas are direct finite matrix computations. Their Hamiltonians use free/open endpoints. Periodic, blob and two-boundary models have different boundary generators and relations. The continuum-limit remark records the source's conjectural/heuristic status and makes no universal spectral-gap, Bethe-completeness or scaling-theorem claim.

Cross-batch prerequisite

The page requires temperley-lieb-jones-wenzl-traces-and-quotients. The seven PA-31 carrier files for closure/partial-trace identities, specialized trace, tensor-ideal negligibility, Jones–Wenzl partial trace, root pairings and semisimple quotient are now present and their actual bodies were read. The root-fusion carrier now supplies the complete retained path matrix units, and the semisimple-quotient carrier proves radical equality and full path blocks. Their actual completed interfaces give the positive-root tower here. Its reflection becomes the usual matrix adjoint after positive path normalization; normalized right closure is the faithful positive trace expectation with the explicit neighbour weights. Exact supplier hypotheses and current excerpts are recorded in the cross-batch file.

Full-text sources

The A-page arguments use Anantharaman–Popa’s full-text II1-factor treatment for the actual standard-form, module-dimension, bounded pull-down and finite-frame arguments, the author-hosted Penneys lecture notes for module and path-tower context, Jones's full Planar Algebras I for the subfactor tower context, and Nichols's full model treatment for the finite XXZ/Potts formulas. Gainutdinov–Read–Saleur is used only for the stated heuristic/conjectural continuum status. Full locators, harvested-result dispositions and fetch stamps are in the batch coverage record.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Type-A path spaces and their matrix-unit tower

Definition

Let ℓ≥3. The path graph Aℓ−1 has vertex set {0,1,…,ℓ−2} and an edge between a and b exactly when ∣a−b∣=1. For n≥0 and a vertex a, let Pn,a be the set of sequences

p=(a0,a1,…,an)

with a0=0, an=a, each aj∈{0,1,…,ℓ−2}, and ∣aj−aj−1∣=1 for 1≤j≤n. The set is finite; it may be empty. Let Vn,a:=C(Pn,a) be the free complex vector space with basis {∣p⟩:p∈Pn,a}, and put

Kn:=⨁a=0ℓ−2End⁡C(Vn,a),

omitting zero summands. For p,q∈Pn,a, the matrix unit Ep,q(n,a) sends ∣q⟩ to ∣p⟩, sends every other path basis vector to zero, and is zero on every endpoint block other than a.

Equip each Vn,a with the Hermitian inner product for which its path basis is orthonormal, and equip each endomorphism algebra with the corresponding adjoint. Thus (Ep,q(n,a))∗=Eq,p(n,a), and Kn has the componentwise involution.

For b∼a, write pb=(a0,…,an,b) for the path obtained by appending b. Define the unital algebra map candidate ιn:Kn→Kn+1 on matrix units by

ιn(Ep,q(n,a))=∑b∼aEpb,qb(n+1,b),

and extend it linearly. The next local theorem proves that these assignments are injective unital ∗-homomorphisms and gives the corresponding branching rule. This is an abstract path-space tower definition; it does not assert that a particular quotient of a Temperley–Lieb algebra is isomorphic to Kn.

Remarks

When n=0, the sole path is (0) and K0≅C. The vertex bounds are part of the definition, so a path attempting to step below 0 or above ℓ−2 is absent rather than assigned a zero multiplicity by convention.

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

The A_(ell-1) path-space tower branches by adjacent vertices

Statement

Let ℓ≥3 and use the path sets, endpoint modules, matrix units, and maps ιn of Type-A path spaces and their matrix-unit tower. Then each ιn:Kn→Kn+1 is a unital injective ∗-algebra homomorphism. For every endpoint b, the restriction of the natural Kn+1-module Vn+1,b to Kn is

Vn+1,b ⁣↓Kn≅⨁0≤a≤ℓ−2∣a−b∣=1Vn,a,

with each summand occurring once; vertices outside {0,…,ℓ−2} contribute no summand.

Facts & Assumptions

Given: ℓ≥3, the finite graph Aℓ−1, its length-n path sets, and the matrix units and tower maps of Type-A path spaces and their matrix-unit tower.

[F1]

Pn,a consists of the vertex sequences (a0,…,an) starting at 0, ending at a, and changing by one along every edge; Kn is the direct sum of the endpoint matrix algebras, with units Ep,q(n,a). (Type-A path spaces and their matrix-unit tower)

[F2]

The tower map is ιn(Ep,q(n,a))=∑b∼aEpb,qb(n+1,b). (Type-A path spaces and their matrix-unit tower)

Proof

Given: The data of [F1]–[F2].

1.1F1construct

For any path (a0,…,an,b) ending at b, its penultimate vertex a is uniquely determined and satisfies a∼b; deleting b gives a unique prefix in Pn,a. Conversely appending b to any path in Pn,a with a∼b gives a path ending at b. Hence the set of paths ending at b is the disjoint union of the appended path sets {pb:p∈Pn,a} over all such a. The basis vectors therefore split as the asserted direct sum, and Ep,q(n,a) acts on each appended block as the same matrix unit while acting by zero on the other predecessor blocks.

1.2F1F2algebra

Take matrix units X=Ep,q(n,a) and Y=Er,s(n,c). If a≠c, then XY=0; in the product ιn(X)ιn(Y) a nonzero matrix-unit product would require the middle path qb to equal rd for some b∼a and d∼c, forcing both q=r as length-n paths and a=c, a contradiction. Thus the images multiply to zero.

2.1F1F2step 1.2algebra

If a=c, then XY=1q=rEp,s(n,a). On multiplying the two sums in [F2], the only nonzero terms have the same appended vertex b and equal middle path qb=rb, which is equivalent to q=r. The product is consequently 1q=r∑b∼aEpb,sb(n+1,b)=ιn(XY). Adjoints are preserved because ιn((Ep,q(n,a))∗)=∑b∼aEqb,pb(n+1,b)=ιn(Ep,q(n,a))∗. Bilinearity proves multiplicativity and ∗-preservation on all of Kn.

3.1F1F2step 1.1step 2.1construct∎

The identity of Kn is ∑a,pEp,p(n,a). Its image is the sum of the diagonal units indexed by every one-step extension pb of every length-n path p; by step 1.1 each length-(n+1) path occurs exactly once. This is the identity of Kn+1. For injectivity, every vertex a has at least one neighbor in Aℓ−1, since ℓ≥3. For each source unit Ep,q(n,a) choose one neighbor b; the coordinate Epb,qb(n+1,b) in its image determines the source unit uniquely by deleting the last vertex. Distinct source units therefore have disjoint image coordinates, so no nonzero linear combination maps to zero. Hence ιn is a unital injective ∗-homomorphism and step 1.1 gives the multiplicity-one branching rule.

Remarks

This proves the branching of the abstract path-space tower. Identifying a particular positive-root Temperley–Lieb quotient and its Jones–Wenzl matrix units with this tower is a separate supplier check recorded in the batch evidence.

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

Open XXZ spin-half generators and Hamiltonian convention

Definition

Fix L≥2, γ∈R, q=eiγ, and loop parameter δ=q+q−1=2cos⁡γ. Let HL=(C2)⊗L with ordered one-site basis ∣↑⟩,∣↓⟩ and two-site basis ∣↑↑⟩,∣↑↓⟩,∣↓↑⟩,∣↓↓⟩. With the standard Pauli matrices X,Y,Z, define ei=I⊗(i−1)⊗U(q)⊗I⊗(L−i−1),1≤i<L, where U(q)=(00000q−1−100−1q00000)=−12(X⊗X+Y⊗Y+cos⁡γ Z⊗Z−cos⁡γ I4+isin⁡γ (Z⊗I2−I2⊗Z)). The open-chain Temperley–Lieb Hamiltonian convention is HL=−∑i=1L−1ei. No wrap-around term couples site L to site 1. This defines local operators; the following result proves their Temperley–Lieb relations.

Remarks

The loop convention is that ei2=δei. The basis order and the sign in the off-diagonal matrix entries are fixed as displayed; changing either changes the parameter comparison.

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

Open Potts clock-shift Temperley–Lieb generators

Definition

Let Q∈{2,3,4}, L≥1, ωQ=e2πi/Q, and δ=Q. On CQ with basis ∣0⟩,…,∣Q−1⟩, define the clock and shift matrices by RQ∣a⟩=ωQa∣a⟩,MQ∣a⟩=∣a−1 ⁣(modQ)⟩. Thus the source matrices are R2=(100−1),M2=(0110);R3=(1000e2πi/3000e4πi/3),M3=(010001100). R4=(10000i0000−10000−i),M4=(0100001000011000). On HQ,L=(CQ)⊗L, put, for 1≤j≤L and 1≤j<L respectively, e2j−1=1Q∑r=0Q−1MQ,j r,e2j=1Q∑r=0Q−1RQ,j rRQ,j+1−r. where the subscript denotes the tensor factor on which the matrix acts. The Potts loop normalization is δ=q+q−1 with q={eiπ/4,Q=2,eiπ/6,Q=3,1,Q=4. The free/open-chain Hamiltonian convention is HQ,L=−∑i=12L−1ei; there is no generator joining the last site back to the first. The following result proves that these operators satisfy the stated Temperley–Lieb relations.

Remarks

The odd generators act on one site and the even generators on neighboring pairs. For Q=3, the source uses RjRj+12+Rj2Rj+1; for Q=4 it uses the powers 1,2,3 with inverse powers on the adjacent site. The displayed summation convention gives those formulas because RQQ=I.

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

Finite diagram tower inclusion and normalized right closure

Definition

Use the diagram algebra TLn(C,δ) and its stacking convention from Temperley–Lieb planar diagram data and endomorphism modules and Stacking is associative and horizontal juxtaposition is strict monoidal. For n≥1, append a rightmost vertical strand to every (n,n) diagram and extend linearly; denote this map by

ιn:TLn(C,δ)⟶TLn+1(C,δ),x⟼x⊗1.

For a basis diagram D:(n+1)→(n+1), join its rightmost top and bottom boundary points by an arc outside the rectangle, remove every resulting closed component with the factor δ, and retain the induced (n,n) matching. Extend this right closure linearly as cn. When δ∈C×, define the normalized right-closure map

En:=δ−1cn:TLn+1(C,δ)⟶TLn(C,δ).

The normalized closure traces τn are those of Normalized Temperley–Lieb trace from diagram closure. No positivity of τn is included in this definition. The next result proves the algebraic expectation identities for En and states precisely when it is a positive conditional expectation.

When δ∈R, equip each diagram algebra with the conjugate-linear involution that reflects a diagram across a horizontal line and conjugates coefficients. Reflection reverses stacking and fixes the loop weight, so (xy)∗=y∗x∗ and 1∗=1. The positivity assertion below assumes this involution and a compatible finite-dimensional C∗-algebra structure.

Remarks

For n=2, closing the rightmost strand of d2∈TL3 removes the cap and cup on the last two points and leaves the identity diagram on the first two points; the extra factor δ−1 is the normalization. The diagram below records the endpoint convention only. The proof uses the finite matching graph, not the drawing.

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

The open XXZ local 4-by-4 matrix satisfies the Temperley–Lieb relations

Statement

For every q=eiγ≠0, put δ=q+q−1 and let U(q) be the local matrix defined in Open XXZ spin-half generators and Hamiltonian convention. Its embeddings ei on (C2)⊗L satisfy ei2=δei, eiei+1ei=ei=ei+1eiei+1, and eiej=ejei when ∣i−j∣>1. Thus they define a representation of the presented open Temperley–Lieb algebra, including at values where δ=0.

Facts & Assumptions

Given: q=eiγ and the ordered spin basis and matrix U(q) from Open XXZ spin-half generators and Hamiltonian convention.

[F1]

On the two mixed-spin basis vectors, U(q) has block A=(q−1−1−1q) and is zero on ↑↑,↓↓. (Open XXZ spin-half generators and Hamiltonian convention)

[F2]

The presented Temperley–Lieb relations are the square relation with loop parameter δ, the two adjacent triple relations, and distant commutation. (The abstract Temperley–Lieb generator presentation)

Proof

Given: The matrix and relations in [F1]–[F2].

1.1F1algebra

Multiplying the nonzero block gives A2=(q−2+1−(q+q−1)−(q+q−1)q2+1)=(q+q−1)A=δA, because q−2+1=δq−1 and q2+1=δq. The zero subspace remains zero, so U(q)2=δU(q), including when δ=0.

1.2F1algebra

On the three-spin subspace with one down spin, in the ordered basis ↓↑↑,↑↓↑,↑↑↓, the two embedded operators are A1=(q−10−1q−10000) and A2=(0000q−10−1q−1). Multiplication gives A1A2=(0−q101−q−1000) and (A1A2)A1=A1; likewise A2A1=(000−q101−q−10) and (A2A1)A2=A2. The two-down-spin subspace has the same pair of matrices in reverse order, so both triple identities hold there as well. On the all-up and all-down vectors both operators vanish. These four invariant subspaces exhaust the three-spin space, proving both adjacent relations.

2.1F1F2step 1.1step 1.2algebra∎

If ∣i−j∣>1, the operators act on disjoint tensor factors. For elementary tensors, applying the two operators in either order changes separate tensor coordinates and yields the same vector; linearity gives eiej=ejei. This verifies all relations in [F2] for every chain length.

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

The XXZ generator Hamiltonian has the declared Pauli expansion and endpoint field

Statement

For L≥2, q=eiγ and the open Hamiltonian HL=−∑i=1L−1ei from Open XXZ spin-half generators and Hamiltonian convention, HL=12∑i=1L−1(XiXi+1+YiYi+1+cos⁡γ ZiZi+1−cos⁡γ I)+isin⁡γ2(Z1−ZL). The sum has L−1 bonds and contains no periodic bond from site L to site 1.

Facts & Assumptions

Given: The Pauli expansion of ei and the open-chain range in Open XXZ spin-half generators and Hamiltonian convention.

[F1]

On bond i,i+1, ei=−12(XiXi+1+YiYi+1+cos⁡γZiZi+1−cos⁡γI+isin⁡γ(Zi−Zi+1)), and HL=−∑i=1L−1ei. (Open XXZ spin-half generators and Hamiltonian convention)

Proof

Given: L≥2, real γ, and [F1].

1.1F1algebra

Negating the displayed formula for each ei changes its prefactor −1/2 to 1/2. Separating the terms gives the bulk sum in the statement and the remaining term isin⁡γ2∑i=1L−1(Zi−Zi+1).

2.1F1step 1.1algebra∎

In the endpoint sum, each interior Zj, 2≤j≤L−1, occurs once with coefficient +1 in Zj and once with coefficient −1 in −Zj, hence cancels. Only Z1−ZL remains. The original index range is 1≤i<L, so it contributes exactly the open bonds and no wrap-around term.

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

The Q = 2, 3, 4 open Potts matrices satisfy Temperley–Lieb

Statement

For each Q∈{2,3,4}, the operators ei defined in Open Potts clock-shift Temperley–Lieb generators satisfy ei2=Q ei, eiei+1ei=ei=ei+1eiei+1, and commute at distance greater than one. Their loop parameter is δ=Q=q+q−1 with the separate q values given there.

Facts & Assumptions

Given: Q∈{2,3,4} and the clock, shift, and generator definitions of Open Potts clock-shift Temperley–Lieb generators.

[F1]

RQ∣a⟩=ωQa∣a⟩, MQ∣a⟩=∣a−1(modQ)⟩, and RQQ=MQQ=I. (Open Potts clock-shift Temperley–Lieb generators)

[F2]

The presented Temperley–Lieb relations have loop parameter δ and the two adjacent triple products equal the generator. (The abstract Temperley–Lieb generator presentation)

Proof

Given: The finite clock-shift operators in [F1].

1.1F1construct

Let P=Q−1∑r=0Q−1MQr=∣+⟩⟨+∣, where ∣+⟩=Q−1/2∑a∣a⟩, and let D=∑a∣aa⟩⟨aa∣. The finite geometric sum gives P2=P; orthogonality of the RQ eigenvalues gives Q−1∑rRQ,1rRQ,2−r=D, since its action on ∣ab⟩ is Q−1∑rωQr(a−b)∣ab⟩, equal to 1 if a=b and 0 otherwise. Thus odd and even generators are QPj and QDj,j+1. Their idempotence gives ei2=Qei.

2.1F1step 1.1algebra

On three sites, P1D12P1=Q−1P1 and D12P2D12=Q−1D12. For the first identity, P∣a⟩=Q−1/2∣+⟩ and ⟨a∣P∣a⟩=Q−1, so summing P∣a⟩⟨a∣P over the second-site labels yields Q−1P1. For the second, P2∣a⟩=Q−1∑b∣b⟩ and D12 retains only the term b=a, giving coefficient Q−1 on each ∣aa⟩. Multiplying each identity by (Q)3 proves both adjacent triple relations.

3.1F1F2step 1.1step 2.1algebra∎

Odd generators on distinct sites commute because they act on disjoint factors. Every even generator is a sum of products of the diagonal matrices RQ on its two sites, so any two even generators commute, including when their bonds overlap in one site. An odd and an even generator whose indices differ by more than one have disjoint supports, so commute. Finally 2=2cos⁡(π/4), 3=2cos⁡(π/6), and 2=2cos⁡0, verifying the three declared q normalizations. These are exactly the relations in [F2].

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

Right closure is a trace-preserving diagram-tower expectation

Statement

Let n≥1, δ∈C×, and let ιn,En be as in Finite diagram tower inclusion and normalized right closure. Then ιn is an injective unital algebra homomorphism, Enιn=id, and for a,b∈TLn and x∈TLn+1,

En(ιn(a)xιn(b))=aEn(x)b,τn(En(x))=τn+1(x).

If dn is the elementary cup-cap generator on the last two strands, then

En(ιn(x)dn)=δ−1x,τn+1(ιn(x)dn)=δ−1τn(x).

When δ∈R, ιn also preserves the reflection involution. Moreover, if δ∈R×, the involution is compatible with finite-dimensional C∗-algebra structures on the tower and the Markov traces are faithful positive traces, then En is positive and hence is a positive trace-preserving conditional expectation.

Facts & Assumptions

Given: n≥1, δ≠0, the diagram tower, its stacking product, right closure, and the normalized closure trace.

[F1]

TLn is the free complex module on noncrossing (n,n) matchings; stacking identifies the middle boundary, removes each closed cycle with a factor δ, and dn is the cap-cup diagram on the last adjacent pair. (Temperley–Lieb planar diagram data and endomorphism modules)

[F2]

Stacking is associative, its identity is the vertical matching, and horizontal juxtaposition with a vertical strand respects composition. (Stacking is associative and horizontal juxtaposition is strict monoidal)

[F3]

On a basis diagram D, τn(D)=δc(D)−n, where c(D) is the number of components after closing every top point to the corresponding bottom point. (Normalized Temperley–Lieb trace from diagram closure)

[F4]

The normalized trace is cyclic and satisfies the tower and one-generator Markov rules by finite component counts. (The normalized closure trace is cyclic and satisfies the Markov rules)

[F5]

ιn appends one rightmost vertical strand and En is δ−1 times the right closure; for real δ, the involution is conjugate-linear reflection across a horizontal line. (Finite diagram tower inclusion and normalized right closure)

Proof

technique · direct
1.1F1F2F5construct

On a basis diagram, appending a rightmost vertical strand leaves all existing matching pairs unchanged. Distinct diagrams remain distinct after appending it, so freeness in [F1] makes ιn injective. Stacking two such appended diagrams creates no new closed component and is the appended version of their original stack, so ιn preserves products and the unit. When δ is real, horizontal reflection also commutes with appending, so it preserves the involution. Right-closing the newly appended vertical strand creates exactly one circle, so cn(ιn(D))=δD and Enιn(D)=D. Linearity gives Enιn=id.

2.1F1F2F5step 1.1algebra

For basis diagrams a,b on n strands and x on n+1 strands, stack the three diagrams and attach the right closure arc at the right boundary. Every path or cycle in this finite graph is unchanged if the left n-strand stacks are performed before the right closure: the closure arc meets only the two rightmost boundary endpoints, and the factors a,b attach only to the left n interfaces. The exterior matching is therefore the product acn(x)b, with the same number of removed cycles and the same powers of δ. Thus cn(ιn(a)xιn(b))=acn(x)b. Multiplication by δ−1 proves bimodularity on basis diagrams; bilinearity extends it.

3.1F3F5step 1.1step 2.1algebra

Closing all remaining strands of cn(x) produces exactly the same closed matching graph as closing all n+1 strands of x. The normalized factor for En is δ−1, so the total normalization changes from δ−n to δ−(n+1), exactly the normalization in [F3] for rank n+1. Hence τn(En(x))=τn+1(x) on basis diagrams and then on all x. The retraction identity also gives (ιnEn)2=ιnEn as endomorphisms of TLn+1.

4.1F1F4F5step 3.1algebra

Right-closing ιn(x)dn connects the last cap and cup to the exterior closure arc; the result is the diagram x on the first n strands, with no new circle. Thus cn(ιn(x)dn)=x, so En(ιn(x)dn)=δ−1x. Trace preservation and [F4] give τn+1(ιn(x)dn)=τn(En(ιn(x)dn))=δ−1τn(x).

5.1F1F5step 1.1step 2.1step 3.1algebra∎

Suppose x≥0 in the finite-dimensional C∗-algebra TLn+1 and the traces are faithful and positive. On each basis matching, reflecting before closing produces the same retained (n,n) matching and the same closed components as closing before reflecting; the scalar δ−1 is real. Hence En(x∗)=En(x)∗, so En(x) is self-adjoint. For every b∈TLn, trace preservation and bimodularity give τn(b∗En(x)b)=τn+1(ιn(b)∗xιn(b))≥0. If En(x) had a negative spectral subspace, its nonzero spectral projection p would satisfy τn(pEn(x)p)<0, since pEn(x)p is strictly negative on that subspace and τn is faithful; this contradicts the same inequality with b=p. Thus En(x)≥0. It is unital, idempotent, bimodular and trace-preserving by the preceding steps, so it is a positive conditional expectation in the stated C∗-positive regime.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Normalized right closure preserves the diagram trace radical

Statement

Let n≥1 and δ∈C×. Define the trace-pairing radical

Jn:={x∈TLn(C,δ):τn(yx)=0 for every y∈TLn(C,δ)}.

Then Jn is a two-sided ideal, ιn(Jn)⊆Jn+1, and En(Jn+1)⊆Jn. Consequently the inclusion and normalized right closure descend to the quotient tower TLn/Jn.

Facts & Assumptions

Given: δ∈C×, the trace-pairing radicals, and the maps from Finite diagram tower inclusion and normalized right closure.

[F1]

The diagram tower maps ιn and En are bimodular and trace-preserving. (Right closure is a trace-preserving diagram-tower expectation)

[F2]

τn is the normalized closure trace on the finite diagram algebra, and stacking defines its algebra products. (Temperley–Lieb planar diagram data and endomorphism modules, Normalized Temperley–Lieb trace from diagram closure)

[F3]

The closure trace is cyclic: τn(xy)=τn(yx). (The normalized closure trace is cyclic and satisfies the Markov rules)

Proof

technique · direct
1.1F2F3givenalgebra

Let x∈Jn and a,b,y∈TLn. The defining radical condition gives τn((ya)x)=0, so τn(yax)=0. By cyclicity, τn(yxb)=τn((by)x)=0, since by∈TLn. Thus both ax and xb lie in Jn, proving that Jn is a two-sided ideal.

2.1F1step 1.1algebra

If x∈Jn and z∈TLn+1, trace preservation and right bimodularity yield τn+1(zιn(x))=τn(En(zιn(x)))=τn(En(z)x)=0, because En(z)∈TLn. Hence ιn(x)∈Jn+1.

3.1F1step 1.1step 2.1algebra∎

If x∈Jn+1 and a∈TLn, then τn(aEn(x))=τn(En(ιn(a)x)) by left bimodularity, and trace preservation makes this τn+1(ιn(a)x)=0 by the definition of Jn+1. Thus En(x)∈Jn. These ideal inclusions make both quotient maps independent of representatives, so the tower and right-closure maps descend.

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

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.

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

Tracial standard form, normal functional vectors, and expectation

Statement

Assume AC. Here normality for positive functionals and positive maps means WOT continuity on every operator-norm bounded ball, agreeing with the published trace convention. For a finite tracial von Neumann algebra (A,t), left and right multiplication on L2(A,t) are faithful normal star representations of A and Aop, respectively: La(x)=ax, Ra(x)=xa, and RaRb=Rba. Their ranges satisfy L(A)′=R(A) and R(A)′=L(A). A vector ξ∈L2(A) defines a bounded map a↦ξa on L2(A) if and only if ξ is represented by an element of A. Every positive normal functional is a↦⟨aξ,ξ⟩ for some ξ∈L2(A). If D⊆A is a unital von Neumann subalgebra, there is a unique normal faithful trace-preserving conditional expectation ED:A→D; it is the restriction of the orthogonal projection onto L2(D) and is contractive and D-bimodular.

Facts & Assumptions

Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.

[F1]

AC is the global choice hypothesis. Its countable-choice, ultrafilter and Hahn–Banach consequences used below are supplied explicitly by [F12]–[F14]. (The Axiom of Choice)

[F2]

A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)

[F3]

A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)

[F4]

Under AC, the bicommutant of a unital star-algebra is its WOT and SOT closure; a concrete von Neumann algebra equals its bicommutant. (The double commutant theorem for concrete von Neumann algebras)

[F5]

Under AC, for every nondegenerate concrete C*-algebra D, the unit ball of D is strongly dense in that of D double commutant; its self-adjoint part is strongly dense in the self-adjoint part. Only clause 1 is used. (Bounded density and finite-vector transitivity for C*-representations)

[F6]

Assuming the ultrafilter lemma, the dual unit ball of every real or complex normed space is weak-star compact. [F13] supplies that hypothesis. We apply it to bounded forms, or to the trace-class predual after proving that identification. (Banach–Alaoglu)

[F7]

Under Countable Choice, every bounded linear functional on a Hilbert space has a unique representing vector, with equal norm. [F12] supplies Countable Choice. (Riesz representation for Hilbert spaces)

[F8]

Under AC, a bounded complex linear functional on any normed subspace extends to the whole normed space with equal norm. (A bounded complex linear functional on a subspace of a complex normed space extends with the same norm)

[F9]

Under HB, a point outside a nonempty closed convex subset of a normed space admits uniform strict real-part separation by a bounded functional (clause ii). [F14] supplies the real dominated-extension form of HB from AC. (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses)

[F10]

Under AC, bounded Borel functional calculus supplies spectral projections, the star-homomorphism identities, the spectral norm estimate, and strong convergence for uniformly bounded pointwise convergent functions; all operators used below are bounded. (Borel functional calculus for bounded normal operators)

[F11]

Under Countable Choice, trace class on arbitrary Hilbert spaces is a Banach operator ideal. The nuclear-series lemma supplies a nuclear representation of every trace-class operator and identifies the trace norm with the infimum of its nuclear sums; no separability of the full Hilbert space is assumed. [F12] supplies Countable Choice. (Trace class is a two sided Banach operator ideal, Nuclear series characterizes trace norm)

[F12]

AC implies Countable Choice. (AC implies DC implies countable choice)

[F13]

AC implies the ultrafilter lemma, the compactness premise of Banach–Alaoglu. (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter)

[F14]

Under AC, every real linear functional dominated by a sublinear functional has a dominated linear extension to the whole real vector space; this is the HB premise of [F9]. (Hahn-Banach dominated extension theorem for real vector spaces)

Proof

Given: The hypotheses of the Statement and the stated prerequisite contracts.

1.1F1F2F3F4F5F6F7F8F9F10F11given

We use the repository convention that scalar Hilbert inner products are linear in their first variable. Right-module-valued inner products, introduced later, are conjugate-linear in the first variable as usual.

2.1F1F2F3F4F5F6F7F8F9F10F11F12F13step 1.1

Standard commutants. Right multiplication satisfies ∥ax∥2≤∥x∥∥a∥2, and left multiplication has the analogous estimate. Their ranges are von Neumann algebras: for example the unit ball of L(A) is strongly closed: the unit ball of A is WOT compact. To obtain this directly without a predual assumption, apply Banach–Alaoglu to the unit ball of B(K) as bounded sesquilinear forms on its original carrier K; A is WOT closed. Every standard-representation coefficient a↦t(b∗ac) is normal and therefore WOT continuous on this ball; arbitrary L2 coefficients follow uniformly by approximating both vectors by A. Thus the image ball of L(A) is WOT compact and hence strongly closed. The representation is faithful and isometric (the norm can be detected by nonzero spectral projections of a∗a). Its range is a norm-closed unital C*-algebra. The published bounded-density supplier, applied to this range and its bicommutant, now promotes closedness of its unit ball to L(A)=L(A)′′, so the whole range is a von Neumann algebra. This avoids the invalid inference that every strongly convergent net is uniformly bounded. The coefficient calculation directly proves WOT continuity on bounded balls, so the representation is normal in the stated convention. On the dense subspace A, LaLb=Lab, RaRb=Rba, La∗=La∗ and Ra∗=Ra∗; these identities extend by boundedness. The antiunitary conjugation J(x)=x∗ satisfies Ra=JLa∗J, transferring faithfulness, normality and range closedness to the right action of Aop. Let LC be the bounded operators Lξ:a↦ξa associated with vectors ξ∈L2(A), and let RC be the analogous right convolvers. These operators commute with each other. Here is the limit argument, to avoid assuming that bounded vectors belong to A: choose an→ξ, bm→η in L2 with an,bm∈A. For fixed c,d∈A, the coefficients of ancbm have a joint limit, because the trace identity writes them explicitly as ⟨ancbm,d⟩=⟨cbm,an∗d⟩, an inner product of two convergent Hilbert sequences, where J(a)=a∗. Taking first the n limit or first the m limit therefore gives the same result. If Lξ and Rη are bounded, the two iterated limits are respectively the coefficients of LξRη(c) and RηLξ(c). Density of A proves commutation.

3.1F1F2F3F4F5F6F7F8F9F10F11step 2.1

If T∈R(A)′, set ξ=T1. On A, T(a)=T(Ra1)=Raξ=ξa, so T=Lξ. Thus LC=R(A)′; similarly RC=L(A)′. The preceding commutation gives LC⊆RC′=L(A)′′=L(A) by the bicommutant theorem. The reverse inclusion is immediate. This proves both commutant identities and the bounded-vector criterion. Notice that sequences approximate individual Hilbert vectors regardless of whether L2(A) is separable.

4.1F1F2F3F4F5F6F7F8F9F10F11F14step 3.1

Positive-vector realization; no unproved Radon–Nikodym input. Here are functional analytic details underlying the normal-functional approximation used next. For a concrete von Neumann algebra Q⊆B(K), its normal functionals form the quotient of the trace-class operators on K by the annihilator of Q, with dual Q. Here is the pairing and duality in detail. For trace-class h, choose the nuclear series h=∑j≥1⟨ ⋅,uj⟩vj from [F11] and let hm be its first m terms. The difference h−hm is compact, being a difference of compact operators, and its nuclear tail gives ∥h−hm∥1≤∑j>m∥uj∥∥vj∥→0 by [F11]. Thus finite-rank operators are trace-norm dense, on arbitrary K. For finite-rank h, use its finite-dimensional trace to define the pairing Tr⁡(hx). If h=∑j⟨ ⋅,uj⟩vj, it equals ∑j⟨xvj,uj⟩, so its modulus is at most ∥x∥∥h∥1 by using its finite singular-value representation from [F11]. The density just proved extends this pairing to all trace-class h. Conversely a bounded functional on trace class, evaluated at the rank-one operators, gives a bounded sesquilinear form on K; [F7] represents it by a unique x∈B(K). Equality of the functional and this pairing on finite-rank operators extends by trace-norm density, and testing rank-one operators proves equality of norms. Thus the dual of trace class is B(K). The dual of its quotient by the annihilator of Q is the double annihilator, which is Q because Q is ultraweakly closed. The double-annihilator assertion follows by applying Hahn–Banach separation to a point outside the closed linear space. A WOT-closed linear subspace Q is ultraweakly closed: if x∉Q, choose a basic WOT neighborhood x+U disjoint from Q, defined by finitely many vector coefficients ϕi. Then (ϕi(x))∉(ϕi(Q)) in their finite-dimensional coefficient space; a linear functional vanishing on the subspace (ϕi(Q)) but not on (ϕi(x)) gives a finite linear combination of vector coefficients separating x from Q. Such a combination is finite rank and trace class, hence ultraweakly continuous. For completeness, the stipulated bounded-ball WOT continuity gives approximation in norm by finite matrix coefficients. Explicitly, continuity at zero on the unit ball gives, for every ε>0, finitely many coefficients whose common kernel cuts the unit ball to a set on which the functional has modulus at most ε. Hahn–Banach, applied to restriction to that kernel, gives distance at most ε from their finite-dimensional span. Conversely, a norm limit of finite matrix coefficients is WOT continuous on each bounded ball, because norm approximation is uniform on that ball. Thus the quotient is exactly the space of normal functionals in the stipulated convention.

5.1F1F2F3F4F5F6F7F8F9F10F11F14step 4.1

The cone of finite sums of vector positive functionals is norm dense in the positive normal cone. To see this without assuming a positive extension lemma, separate a positive normal functional from its norm-closed convex cone if it were outside. By the quotient-duality just established, a separating real functional is evaluation at a self-adjoint x∈Q. Nonnegativity on all vector functionals says x≥0; positivity of the functional contradicts the strict separation. This proves the assertion. The faithful standard representation identifies the original and standard WOT unit balls homeomorphically: step 2.1 gives a continuous bijection from a compact ball to a Hausdorff image. Thus a functional normal in the original representation is normal in the standard one. Apply the cone argument to that standard representation of A. Approximate each of the finitely many vectors in such a finite sum by elements aj∈A in L2; ∥ωξ−ωη∥≤∥ξ−η∥2(∥ξ∥2+∥η∥2) controls the error. The sum becomes t(b⋅), where b=∑ajaj∗≥0, and hence the single positive vector b1/2∈A realizes that approximating functional.

6.1F1F2F3F4F5F6F7F8F9F10F11step 5.1

We give the needed completeness estimate rather than assuming square-root continuity for unbounded operators. For a,b∈A+, let p,q be the positive and negative spectral projections of a−b; then t((a2−b2)p)≥t((a−b)2p) because the difference is 2t(b1/2(a−b)pb1/2)≥0. Interchanging a,b gives t((b2−a2)q)≥t((a−b)2q). Addition yields ∥a−b∥22≤(ωa−ωb)(p−q)≤∥ωa−ωb∥. Thus positive bounded vectors realizing a norm-Cauchy sequence of positive normal functionals are Cauchy in L2. Their limit ξ realizes the desired functional by the previous upper estimate. This completes the positive normal functional realization proof. The spectral projections used here are bounded spectral calculus in A, not an unbounded-operator theorem.

7.1F1F2F3F4F5F6F7F8F9F10F11F12step 6.1

Little dominated Radon–Nikodym lemma. For any positive functional φ, positivity of φ((x+zy)∗(x+zy)) for all scalars z gives ∣φ(y∗x)∣2≤φ(x∗x)φ(y∗y). If 0≤φ≤Ct, Hilbert Riesz applied to φ gives a vector h∈L2(A) with φ(a)=⟨a,h⟩; this is bounded because ∣φ(a)∣2≤φ(1)φ(a∗a)≤Cφ(1)∥a∥22. The Cauchy–Schwarz inequality for the positive functional gives ∣φ(ab∗)∣≤C∥a∥2∥b∥2. Consequently the convolution map for h has norm at most C: the trace identity gives ⟨a,hb⟩=φ(ab∗) for a,b∈A, first for bounded approximants to h and then by Hilbert norm convergence. By the bounded-vector criterion, h∈A. Positivity of φ and Ct−φ implies 0≤h≤C1: test against positive spectral projections of the self-adjoint element h, with self-adjointness first following from φ(a∗)=φ(a)‾ and faithfulness of the pairing. Uniqueness follows by testing the difference against its adjoint.

8.1F1F2F3F4F5F6F7F8F9F10F11step 7.1∎

Expectation. For 0≤x≤C1 in A, the functional d↦t(xd) on D is between zero and Ct∣D; the dominated lemma yields the unique ED(x)∈D between zero and C1 satisfying t(ED(x)d)=t(xd) for every d∈D. Extend linearly using differences of positives; uniqueness of the pairing makes the extension well-defined. The pairing identity proves ED(d)=d, bimodularity, and trace preservation. It also proves that ED is the L2 orthogonal projection on A. Faithfulness follows from trace preservation. Normality in the stipulated topology follows directly from the pairing identity. If a bounded net xi converges WOT to x, contractivity, established immediately below, bounds ED(xi). For b,c∈D, one has t(c∗ED(xi)b)=t(bc∗xi)→t(bc∗x)=t(c∗ED(x)b). Approximate arbitrary vectors in L2(D) by D; the uniform operator bound extends convergence to every standard Hilbert matrix coefficient. The original and standard representations of D have homeomorphic unit balls: the faithful standard representation is a continuous bijection from the original WOT compact ball to its Hausdorff image, as in step 2.1. Thus this convergence is WOT convergence in the original representation as well. This proves bounded-ball WOT continuity of ED. For arbitrary x, the projection estimate applied to ED(x)∗x gives ED(x)∗ED(x)≤ED(x∗x): alternatively expand ED((x−ED(x))∗(x−ED(x)))≥0. Thus ∥ED(x)∥≤∥x∥. Uniqueness follows from the pairing identity, which every trace-preserving bimodule projection has. All these arguments work for nonseparable algebras.

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

Projection comparison and unique normalized traces in finite factors

Statement

Assume AC. In a factor Q, any two projections p,q are comparable by subequivalence. If Q has a faithful normal semifinite trace s and s(p),s(q)<∞, then p≾q if and only if s(p)≤s(q), and equality means equivalence. Every nonzero corner of a diffuse factor is again a diffuse factor. If a diffuse factor is equipped with a faithful normal normalized trace, that trace is its unique normalized tracial state. Finite matrix amplifications of a II1 factor and all their nonzero corners are II1 factors.

Facts & Assumptions

Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.

[F1]

AC is the global choice hypothesis. (The Axiom of Choice)

[F2]

A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)

[F3]

A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)

[F4]

Under AC, polar decomposition stays inside a von Neumann algebra, and any two nonzero projections in a factor have nonzero equivalent subprojections. No separability hypothesis occurs. (Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor)

[F5]

Under AC, bounded Borel functional calculus supplies spectral projections, the star-homomorphism identities, the spectral norm estimate, and strong convergence for uniformly bounded pointwise convergent functions; all operators used below are bounded. (Borel functional calculus for bounded normal operators)

[F6]

For a faithful normal semifinite trace s, traciality gives s(v∗v)=s(vv∗) for a partial isometry v when these projection traces are finite, and positivity makes s monotone on projections. (Given.)

[F7]

Under AC, every nonempty poset in which every chain has an upper bound has a maximal element. (Zorn's lemma)

Proof

Given: The hypotheses of the Statement and the stated prerequisite contracts.

1.1F1F2F3F4F5F6F7given

Use the canonical supplier: nonzero projections in a factor have nonzero equivalent subprojections, and polar decompositions stay in the algebra. By [F7], choose a maximal family of partial isometries with pairwise orthogonal initial projections under p and pairwise orthogonal final projections under q. Their strong sum v is a partial isometry. If both p−v∗v and q−vv∗ were nonzero, the supplier would give another nonzero partial isometry between them, contradicting maximality. This proves comparison. If p≾q, a witnessing partial isometry has initial projection p and final projection r≤q, so [F6] gives s(p)=s(r)≤s(q). Conversely, suppose s(p)≤s(q). If comparison gives p≾q, the conclusion already holds; otherwise q≾p. A witnessing partial isometry then has initial projection q and final projection r≤p, so s(q)=s(r)≤s(p)≤s(q). Hence s(p)=s(q) and s(p−r)=0; faithfulness gives r=p, so p and q are equivalent and in particular p≾q. If s(p)=s(q), the same argument applied to either subequivalence shows equivalence. Only finite-trace comparisons are used below; no claim is made that arbitrary infinite-trace projections in a nonseparable semifinite factor are equivalent.

2.1F1F2F3F4F5step 1.1

For a corner pQp, a nontrivial central projection r would have rQ(p−r)=r(pQp)(p−r)=0, contradicting the canonical nonzero-corner supplier. The center has no nontrivial projections, so spectral calculus makes it scalar. A minimal projection in pQp is also minimal in Q, since every subprojection of it belongs to the corner. This proves diffuseness. If Q has faithful normal normalized trace τ, every nonzero corner has faithful normal normalized trace τp(x)=τ(x)/τ(p). For a matrix amplification, commuting with all matrix units makes its center scalar when Q is a factor. It is diffuse: if it had a minimal projection r, a nonzero corner linking r to e11 supplies a nonzero subprojection of e11 equivalent to r; that would be a minimal projection in e11Mk(Q)e11≅Q, a contradiction. Its matrix trace is faithful and normal by the finite sum formula, and every nonzero corner inherits the faithful normal normalized trace by dividing by its value at the corner projection. Thus the stated nonzero corners are II1 factors.

3.1F1F2F3F4F5F6F7step 2.1∎

For uniqueness of trace, let τ be the faithful normal normalized trace supplied on the diffuse factor. First bisect every nonzero projection p into equivalent halves. A maximal orthogonal family of pairs of equivalent nonzero projections under p exhausts p: a nonzero remainder splits into two nonzero projections, between which the canonical supplier supplies another pair. The sums of the first and second members are equivalent and sum to p. Iterate to partition 1 into 2n equivalent projections. Every normalized tracial state takes value 2−n on each. For q≠0,1, choose k with k/2n≤τ(q)<(k+1)/2n and let rj be the sum of the first j pieces of this partition. The finite-trace comparison in step 1.1 gives rk≾q≾rk+1. Hence every normalized tracial state φ satisfies k/2n=φ(rk)≤φ(q)≤φ(rk+1)=(k+1)/2n. Letting n→∞ gives φ(q)=τ(q); the cases q=0,1 are immediate. Finite spectral step approximations give norm density of the linear span of projections in the self-adjoint part; positivity makes states bounded, so φ=τ everywhere. No normality of φ is required.

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

Ordinary Hilbert-module dimension and finite projection models

Statement

Assume AC. For a finite tracial algebra (N,t), every Hilbert space H with a normal unital right N action, meaning a unital star anti-homomorphism into B(H) that is WOT continuous on bounded balls, is right-unitarily isomorphic to P(ℓ2(I)⊗L2(N)), where I is an arbitrary set and P∈B(ℓ2(I))⊗ˉN is a projection. Its bounded right-linear operator algebra is the corner P(B(ℓ2(I))⊗ˉN)P. The formula Tr⁡N(T)=∑it(Tii) for positive T defines a faithful normal semifinite trace on the ambient algebra and its corner. Transport to H is independent of the model; its value at the identity defines dim⁡NH. If N is a II1 factor and this dimension is finite, H is isomorphic to pL2(N)k for some finite k and p∈Mk(N), with dim⁡NH=(Tr⁡k⊗t)(p).

Facts & Assumptions

Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.

[F1]

AC is the global choice hypothesis. It implies Countable Choice by [F6], and Zorn's lemma [F7] supplies the maximal family used in step 1.1. (The Axiom of Choice)

[F2]

A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)

[F3]

A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)

[F4]

For finite tracial algebras, the left and right standard actions are mutual commutants; right-bounded vectors of the standard module are bounded algebra elements. Positive normal functionals are vector functionals, and each unital von Neumann subalgebra has a unique faithful normal trace-preserving bimodule expectation. (Tracial standard form, normal functional vectors, and expectation)

[F5]

In a factor projections are comparable; for finite-trace projections, trace inequalities characterize subequivalence. Diffuse factor corners are diffuse factors; a diffuse factor equipped with a faithful normal normalized trace has a unique normalized tracial state. (Projection comparison and unique normalized traces in finite factors)

[F6]

AC implies Countable Choice. (AC implies DC implies countable choice)

[F7]

Under AC, every nonempty poset in which every chain has an upper bound has a maximal element. (Zorn's lemma)

Proof

Given: The hypotheses of the Statement and the stated prerequisite contracts.

1.1F1F2F3F4F5F6F7given

Choose a maximal orthogonal family of nonzero cyclic right submodules of H by [F7]; their direct sum exhausts H, since its orthogonal complement is reducing and a nonzero vector there generates another one. For a cyclic module with generator η, its vector functional on Nop is positive normal. Tracial standard form, normal functional vectors, and expectation gives a vector ξ∈L2(N) with the same functional. The map ηn↦ξn is isometric (the squared norms coincide on nn∗), and extends to a right-module unitary onto the closure of ξN. That closure is reducing, so its projection commutes with right N; by Tracial standard form, normal functional vectors, and expectation it is a projection in left N. Taking the direct sum gives a diagonal projection model over the arbitrary index set I.

2.1F1F2F3F4F5step 1.1

For an arbitrary projection model, the commutant of the right action is precisely the corner claimed: each matrix entry commutes with the right regular action, hence belongs to left N by Tracial standard form, normal functional vectors, and expectation; conversely any bounded matrix with these entries commutes with it. Passing to a reducing range compresses this commutant. This is also a concrete construction of the tensor product notation used in the statement.

3.1F1F2F3F4F5step 2.1

On positive matrices put Tr⁡N(T)=sup⁡F⊆I, F finite∑i∈Ft(Tii). Additivity follows by interchanging two directed suprema, faithfulness because zero diagonal positive entries force zero off-diagonal entries by positivity of every two-by-two compression, and normality follows by interchanging the supremum over finite F with an increasing operator net. For a bounded matrix S, Tr⁡N(S∗S)=∑i,jt(Sji∗Sji)=∑i,jt(SjiSji∗)=Tr⁡N(SS∗); strong convergence of finite coordinate sums and normality justify the nonnegative sums. This establishes the trace property. Semifiniteness: with coordinate projection fF, the positive elements T1/2fFT1/2≤T increase strongly to T and have finite trace at most ∥T∥∣F∣. For a corner, compress these approximants by P, or apply the same calculation to T∈PAP; they remain below T and have finite trace. Thus the corner trace is semifinite as well. Normality of this potentially infinite weight means preservation of bounded increasing positive nets. On a corner of finite total trace the diagonal sum is a norm-convergent sum of vector functionals: after inserting the corner projection, the sum of their norms is exactly the finite total trace. Thus its finite trace is also WOT continuous on bounded balls, in the convention of [F3].

4.1F1F2F3F4F5step 3.1

If U is a right-module unitary between two models, its zero extension to the two ambient amplifications is a rectangular partial isometry with entries in N. In the amplification by the disjoint union of their index sets, the trace identity Tr⁡N(S∗S)=Tr⁡N(SS∗), applied to S=UT1/2, shows equality of transported traces for every positive corner element T. This proves independence and also invariance of dimension. For a bounded right-linear V:L2(N)→H, the same rectangular computation gives Tr⁡H(VV∗)=t(V∗V); this identity in particular normalizes the trace of a standard embedded copy of L2(N) to one.

5.1F1F2F3F4F5step 4.1∎

Now suppose N is a II1 factor and Tr⁡N(P)=λ<∞. The ambient amplification is a factor: its center can be computed with coordinate matrix units and entries in N, exactly as for finite matrices. Enlarge I by finitely many unused coordinates if necessary, and take a finite coordinate projection f of trace k≥λ (take k>λ to avoid an endpoint). The same maximal-partial-isometry comparison proof in Projection comparison and unique normalized traces in finite factors applies in this semifinite factor. In the case of finite-trace projections, trace comparison is valid by that proof, without any separability. Consequently P≾f, giving v∗v=P, vv∗=p≤f. Multiplication by v is the required right-module unitary and preserves the trace. Since fAf≅Mk(N), this is the asserted finite model. The case λ=0 gives H=0 by faithfulness. The nonzero corners used here are diffuse factors by the proof in Projection comparison and unique normalized traces in finite factors, which applies to this amplification too: a minimal projection would link to a coordinate corner and contradict the diffuseness of N.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite-index extremal II1 subfactor data

Definition

Assume AC. A II1 factor is a von Neumann algebra A with center C1, no nonzero minimal projections, and a faithful normal normalized trace τA, with the operator and trace conventions of Von Neumann algebras and commutants and States, tracial states and faithful normal traces on a von Neumann algebra. A II1 subfactor inclusion is a unital inclusion N⊆M of II1 factors, with τN=τM∣N. Its trace-preserving normal faithful conditional expectation EN:M→N is the unique expectation constructed in Tracial standard form, normal functional vectors, and expectation; it is positive, unital, N-bimodular, and the restriction of the orthogonal projection eN:L2(M)→L2(N).

A normal right Hilbert-space N-module is a Hilbert space with a unital star representation of Nop that is WOT-continuous on the operator-norm unit ball. This is the topological normality convention of the trace definition above. Right multiplication is Ra(x)=xa, so RaRb=Rba. The amplification theorem Ordinary Hilbert-module dimension and finite projection models constructs a right-module unitary H≅P(ℓ2(I)⊗L2(N)) and its model-independent canonical semifinite trace on End⁡N(H), given in that model by Tr⁡H(T)=∑i∈IτN(Tii) for positive T. Define dim⁡NH=Tr⁡H(1); in particular dim⁡NL2(N)=1. The ordinary Jones index of the inclusion is [M:N]=dim⁡NL2(M,τM)=:λ. The inclusion has finite index when λ<∞. No finite bounded frame or complete N-valued module model is part of this hypothesis.

For finite index, put B=End⁡NL2(M) and τB=λ−1Tr⁡L2(M). Let J(x)=x∗ on L2(M), so Ra=JLa∗J. The inclusion is extremal when τB(Ra)=τM(a)(a∈N′∩M). Here N′∩M={a∈M:an=na for every n∈N}, and Ra belongs to B for these a. Equivalently, the normalized trace on the commutant of the left N action and τM agree on N′∩M, transported by J. This specifies the right-action trace: the normalized trace of B on the left action of M agrees automatically with τM and does not define extremality.

For later calculations write X=M with N-valued inner product ⟨x,y⟩N=EN(x∗y) and norm ∥x∥X=∥EN(x∗x)∥1/2. Its completeness, finite projection model X≅pNk, and bounded coordinate frame are consequences proved below from ordinary finite index; they are not additional assumptions. No separability or irreducibility hypothesis is imposed.

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

Finite Jones index gives bounded vector pull-down

Statement

Assume AC. Let N⊆M be II1 factors and let H=L2(M,τ). Define ordinary Jones index by λ=dim⁡NH<∞ using Ordinary Hilbert-module dimension and finite projection models. Let e be the orthogonal projection onto L2(N). Then B=(right N)′=W∗(M,e) is a II1 factor with canonical unnormalized trace Tr⁡B(1)=λ, Tr⁡B(e)=1, Tr⁡B(xey)=τ(yx), and Tr⁡B∣M=λτ. Its normalized trace-preserving expectation F:B→M satisfies F(xey)=λ−1xy. Every T∈B has a unique bounded x∈M such that Te=xe; necessarily x=λF(Te). In particular every right-N bounded vector in H is represented by an element of M.

Facts & Assumptions

Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.

[F1]

AC is the global choice hypothesis. Its Countable Choice and ultrafilter consequences used by the functional-analytic suppliers are stated in [F11]–[F12]. (The Axiom of Choice)

[F2]

A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)

[F3]

A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)

[F4]

For finite tracial algebras, the left and right standard actions are mutual commutants; right-bounded vectors of the standard module are bounded algebra elements. Positive normal functionals are vector functionals, and each unital von Neumann subalgebra has a unique faithful normal trace-preserving bimodule expectation. (Tracial standard form, normal functional vectors, and expectation)

[F5]

In a factor projections are comparable; for finite-trace projections, trace inequalities characterize subequivalence. Diffuse factor corners are diffuse factors; a diffuse factor equipped with a faithful normal normalized trace has a unique normalized tracial state. (Projection comparison and unique normalized traces in finite factors)

[F6]

Every normal Hilbert-space right module has an arbitrary-index projection model with invariant canonical trace. Finite dimension over a II1 factor yields a finite matrix projection model; the trace of VV* equals the base trace of V*V for right-linear maps from the standard module. (Ordinary Hilbert-module dimension and finite projection models)

[F7]

The ordinary-index contract supplies a unital II1 subfactor inclusion N⊆M, with λ=dim⁡NL2(M)<∞. Extremality is unused in this lemma; the module model is derived in the proof. (Finite-index extremal II1 subfactor data)

[F8]

Under AC, for every nondegenerate concrete C*-algebra D, the unit ball of D is strongly dense in that of D double commutant; its self-adjoint part is strongly dense in the self-adjoint part. Only clause 1 is used. (Bounded density and finite-vector transitivity for C*-representations)

[F9]

Assuming the ultrafilter lemma, the dual unit ball of every real or complex normed space is weak-star compact. [F12] supplies that hypothesis. We apply it to bounded forms, or to the trace-class predual after proving that identification. (Banach–Alaoglu)

[F10]

Under AC, the WOT-generated unital star-algebra is its bicommutant; for every set S, W*(S) equals S double commutant after adjoining adjoints and the identity. (The double commutant theorem for concrete von Neumann algebras)

[F11]

AC implies Countable Choice. (AC implies DC implies countable choice)

Proof

Given: The hypotheses of the Statement and the stated prerequisite contracts.

1.1F1F2F3F4F5F6F7F8F9F10F11given

Tracial standard form, normal functional vectors, and expectation produces EN. Orthogonal projection gives exe=EN(x)e directly on the dense subspace M, and Je=eJ since L2(N) is invariant under the conjugation J. If an element of M′ commutes with e, Tracial standard form, normal functional vectors, and expectation writes it as Ra, a∈M; applying the commutation equation to 1 says a=EN(a)∈N. Conversely right N commutes with both M and e. Bicommutants therefore give W∗(M,e)=(R(N))′=B. Ordinary Hilbert-module dimension and finite projection models makes this a finite-trace factor; it is diffuse because it has the diffuse corner eBe=Ne, or by its finite matrix corner model. To verify the corner assertion independently, restriction of T∈eBe to L2(N) commutes with right N, so is left multiplication by some n∈N by Tracial standard form, normal functional vectors, and expectation. Hence T=ne.

2.1F1F2F3F4F5F6F7F8F9step 1.1

Let Vx:L2(N)→H be n↦xn. Then VxVy∗=xey∗ and Vy∗Vx=EN(y∗x) as a left multiplier on L2(N). The rectangular trace calculation from Ordinary Hilbert-module dimension and finite projection models gives Tr⁡B(xey)=τ(yx) by polarization. In particular Tr⁡B(e)=1. Its normalized restriction λ−1Tr⁡B∣M is a tracial state, hence equals τ by Projection comparison and unique normalized traces in finite factors. Tracial standard form, normal functional vectors, and expectation applied to the finite tracial algebra (B,λ−1Tr⁡B) gives the expectation F. For a∈M, λτ(aF(e))=Tr⁡B(ae)=τ(a). Nondegeneracy of the trace pairing gives F(e)=λ−11, and bimodularity gives the displayed formula for F(xey).

3.1F1F2F3F4F5F6F7F8F9F12step 2.1

The -algebra A0=span⁡MeM is strongly dense in B. One way to see this with no frame assumption is that its WOT closure is a two-sided ideal of B and contains e. Finite trace comparison gives finitely many orthogonal projections summing to 1, each subequivalent to e: remove copies of e while the remainder has trace greater than 1, then embed the last remainder in e. If vj are the resulting partial isometries, 1=∑jvjevj∗ belongs to this ideal, so the ideal is all of B. Applying [F8] to the nondegenerate C-closure of A0 gives, for each T∈B, a net ai∈A0 converging strongly to T with a common operator bound (apply it first to the C*-closure of A0, then approximate each resulting bounded element in norm by A0, allowing a fixed arbitrarily small bound slack). Writing ai=∑xreyr gives aie=xie, where xi=∑xrEN(yr)∈M. The expectation formula shows xi=λF(aie) and ∥xi∥≤λ∥ai∥. A bounded subnet has an ultraweak limit x∈M; the matrix coefficients of left multiplication on L2(M) are normal, so xie→xe weakly. But aie→Te strongly, thus Te=xe. Applying F to this identity gives x=λF(Te); uniqueness also follows by applying xe to 1. This proof does not silently pass an unbounded inverse through a weak limit.

4.1F1F2F3F4F5F6F7F8F9step 3.1∎

If ξ is right-N bounded, its bounded map Vξ:L2(N)→H extends by zero on L2(N)⊥ to T=Vξe∈B. Pull-down gives T=xe, so ξ=T1=x. This proves equality of the right-N bounded vectors and M.

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

Ordinary finite Jones index supplies a bounded finite Parseval frame

Statement

Assume AC. Under the ordinary finite-index hypotheses of Finite Jones index gives bounded vector pull-down there are a finite integer k, elements u1,…,uk∈M and a projection p∈Mk(N) such that

  • ∑ujeuj∗=1 on L2(M);
  • x=∑ujEN(uj∗x) for all x∈M;
  • ∑τ(uj∗uj)=λ and ∑ujuj∗=λ1;
  • U:M→pNk, U(x)=(EN(uj∗x))j, is an onto right-module unitary for the N-valued inner product EN(x∗y);
  • pij=EN(ui∗uj) and (Tr⁡k⊗τN)(p)=λ.

In particular M is complete in the norm ∥EN(x∗x)∥1/2 and the bounded coordinate representatives are exactly uj=U−1(pεj). Furthermore ∥x∥≤λ∥EN(x∗x)∥1/2 for x∈M.

The map U also extends to a right-module Hilbert-space unitary L2(M)≅pL2(N)k. Consequently End⁡N(L2(M))≅pMk(N)p, every such endomorphism preserves M, and for its matrix a=(aij)∈pMk(N)p one has T(x)=∑i,juiaijEN(uj∗x) for every x∈M.

Facts & Assumptions

Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.

[F1]

AC permits Zorn maximality and implies Countable Choice and the ultrafilter lemma required by the Hilbert and compactness suppliers. (The Axiom of Choice)

[F2]

A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)

[F3]

A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)

[F4]

In a factor projections are comparable; for finite-trace projections, trace inequalities characterize subequivalence. Diffuse factor corners are diffuse factors; a diffuse factor equipped with a faithful normal normalized trace has a unique normalized tracial state. (Projection comparison and unique normalized traces in finite factors)

[F5]

For ordinary finite Jones index, the commutant of right N is the basic construction, has finite canonical trace of total mass lambda, and satisfies bounded pull-down: Te=xe for unique x in M. All right-N bounded vectors of L2(M) belong to M. (Finite Jones index gives bounded vector pull-down)

[F6]

The ordinary-index contract supplies a unital II1 subfactor inclusion N⊆M, with λ=dim⁡NL2(M)<∞. Extremality is unused in this lemma; the module model is derived in the proof. (Finite-index extremal II1 subfactor data)

[F7]

Every Hilbert right module has its matrix-entry commutant algebra; in a finite projection model this is the corner pMk(N)p. (Ordinary Hilbert-module dimension and finite projection models)

Proof

Given: The hypotheses of the Statement and the stated prerequisite contracts.

1.1F1F2F3F4F5F6given

In the finite factor B choose orthogonal projections q1,…,qk summing to 1 with qj≾e. This is a finite construction: while the remainder has trace greater than 1, comparison lets one remove a projection equivalent to e; after at most ⌊λ⌋ such removals, the remainder has trace at most 1 and hence is subequivalent to e. If λ is an integer, the final remainder can be zero and is discarded. Since Tr⁡B(e)=1≤Tr⁡B(1)=λ, this also proves λ≥1. Choose partial isometries vj with vjvj∗=qj and vj∗vj≤e; then vj=vje. Pull-down writes vj=uje with uj∈M. Thus ∑ujeuj∗=1. Applying this to x∈M proves the frame identity. Taking Tr⁡B gives ∑τ(uj∗uj)=λ; applying F to the same identity gives ∑ujuj∗=λ1.

2.1F1F2F3F4F5F6step 1.1

Let V:L2(N)k→H be V((nj))=∑ujnj; then VV∗=1 and V∗V=p=(EN(ui∗uj))ij. Hence p=p∗=p2 and U=V∗ is an isometry on Hilbert spaces with image pL2(N)k. On bounded elements, U(M)⊆pNk, and for each a∈pNk, x=∑ujaj∈M satisfies U(x)=pa=a, proving bounded-module surjectivity. Directly, ⟨U(x),U(y)⟩N=∑EN(x∗uj)EN(uj∗y)=EN(x∗y) by the frame identity. Thus this is an N-valued isometry, not merely an L2 isometry. The finite column module pNk is complete: its norm is the operator norm of its column in the C*-algebra of (k+1)-by- (k+1) matrices over N, and its range is closed because p is a bounded idempotent. This proves the required completeness. Matrix trace gives (Tr⁡k⊗τN)(p)=∑τ(uj∗uj)=λ, and V(pεj)=VV∗Vεj=uj gives the specified coordinate compatibility.

3.1F1F2F3F4F5F6step 2.1

Finally, xex∗≤∥EN(x∗x)∥1B: its norm is ∥VxVx∗∥=∥Vx∗Vx∥=∥EN(x∗x)∥, and it is positive. Applying positive F yields λ−1xx∗≤∥EN(x∗x)∥1M, proving the norm estimate. This also gives an independent completeness proof by norm equivalence, since ∥EN(x∗x)∥1/2≤∥x∥ and M is operator-norm complete.

4.1F1F2F3F4F5F6F7step 3.1∎

The scalar trace of the N-valued inner-product identity proves that U preserves the Hilbert-space norm. Its bounded range pNk is dense in pL2(N)k, so it extends to an onto Hilbert-space unitary. Under this unitary every bounded right-N endomorphism is a matrix in pMk(N)p by the matrix-entry commutant calculation of Ordinary Hilbert-module dimension and finite projection models. Such a matrix preserves pNk. Transporting it back by U−1((ai))=∑iuiai gives the asserted finite formula and preservation of M.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations

Statement

Let N⊆M be an ordinary finite-index II1 inclusion as in Finite-index extremal II1 subfactor data, with λ=[M:N]<∞ and δ=λ>0. Set M−1=N, M0=M, and recursively let ei be projection L2(Mi−1)→L2(Mi−2) and Mi=W∗(Mi−1,ei) for i≥1. Every Mi is a II1 factor; every adjacent inclusion has index λ and a bounded finite right-module Parseval frame. Its normalized trace extends the earlier trace and satisfies τi(xeiy)=λ−1τi−1(yx)(x,y∈Mi−1). If N⊆M is extremal in the specified right-action sense, every adjacent inclusion is extremal. The projections satisfy ei2=ei=ei∗,eiei+1ei=λ−1ei,ei+1eiei+1=λ−1ei+1,[ei,ej]=0(∣i−j∣≥2). Consequently Ui=δei define compatible unital ∗-representations of the finite diagram Temperley–Lieb tower TLn(C,δ)→Mn−1, whose pulled-back traces are the normalized closure traces. Neither surjectivity onto Mn−1 nor identification with its full relative commutant is asserted. These conclusions include the index-one inclusion N=M.

Facts & Assumptions

[A1]

AC is inherited from the stated tracial and Hilbert-module foundations. (Finite-index extremal II1 subfactor data)

[F1]

The ordinary index is dim⁡NL2(M), EN is the unique trace-preserving expectation, and extremality compares τM(a) with τB(Ra) for a∈N′∩M. (Finite-index extremal II1 subfactor data)

[F2]

Ordinary finite index supplies bounded u1,…,uk∈M with ∑jujeNuj∗=1, x=∑jujEN(uj∗x), ∑jτM(uj∗uj)=λ, and the complete projection model M≅pNk, whose Hilbert-space completion is L2(M)≅pL2(N)k. Every bounded right-N Hilbert-space endomorphism is a matrix in pMk(N)p and hence preserves M. (Ordinary finite Jones index supplies a bounded finite Parseval frame)

[F3]

B=End⁡NL2(M)=W∗(M,eN) is a II1 factor, its normalized module trace satisfies τB(xeNy)=λ−1τM(yx), and its trace-preserving expectation F:B→M satisfies F(xeNy)=λ−1xy. (Finite Jones index gives bounded vector pull-down)

[F4]

Every finite tracial inclusion has the unique normal faithful trace-preserving bimodule expectation; standard commutants on L2(A) are L(A)′=R(A) and R(A)′=L(A). (Tracial standard form, normal functional vectors, and expectation)

[F5]

Normalized traces on II1 factors are unique, and nonzero finite matrix corners over II1 factors are II1 factors. (Projection comparison and unique normalized traces in finite factors)

[F6]

The generator presentation has relations Ui2=δUi, UiUi±1Ui=Ui, and distant commutation, and equals the finite diagram algebra. (The abstract Temperley–Lieb generator presentation, The generator presentation is the planar diagram algebra over every commutative ring)

[F7]

Jones normal-form words span and use the highest generator at most once, so TLn+1=TLn+TLnUnTLn. The normalized diagram closure trace is cyclic, restricts compatibly, and has the Markov value δ−1. (Jones normal forms span and are counted by Catalan paths, The normalized closure trace is cyclic and satisfies the Markov rules)

Proof

Given: AC and the ordinary finite-index inclusion, with [F1]–[F7]. No bounded frame is assumed in the input.

1.1A1F1F2F3givenconstruct

On dense vectors x∈M, trace preservation gives ⟨n,EN(x)⟩L2=⟨n,x⟩L2 for n∈N, so eN is the Hilbert projection and eNxeN=EN(x)eN. By [F2], every right-module endomorphism has the finite expression T=∑jT(uj)eNuj∗, since in the finite Hilbert-space model T is a matrix with entries in N, so T(uj)∈M; its adjointable module bound also makes it bounded on L2(M). Hence the first algebra is precisely the finite corner M1=B≅pMk(N)p.

2.1F2F3F5step 1.1algebra

The corner trace is τ1=λ−1(Tr⁡k⊗τN), faithful and normal, and in the coordinate frame its unnormalized value is ∑jτN(EN(uj∗T(uj))). For T=xeNy, the adjoint of the frame identity for y∗ gives ∑jEN(yuj)uj∗=y, whence λτ1(xeNy)=τM(yx). By uniqueness [F5], τ1∣M=τM. The expectation F of [F3] is therefore for these normalized traces. Applying F to 1=∑jujeNuj∗ gives ∑jujuj∗=λ1.

3.1F2F3F4F5step 1.1step 2.1construct

Put vj=λ ujeN∈M1. For T=xeNy, [F3] gives ∑jvjF(vj∗T)=∑jujeNEN(uj∗x)y=xeNy. Every element of M1 is a finite sum of such terms by step 1.1, so this is a Parseval frame on all of M1. Its projection matrix qij=F(vi∗vj) gives an onto M-valued inner-product isometry T↦(F(vj∗T))j from M1 to qMk, with inverse (aj)↦∑jvjaj. Its Hilbert-space completion is qL2(M)k. Moreover ∑jτM(F(vj∗vj))=λ∑jτ1(eNuj∗ujeN)=∑jτM(uj∗uj)=λ. Thus the ordinary index of M⊆M1 is λ, and [F3]–[F5] apply again.

4.1F1F2F3F4step 2.1step 3.1algebra

Suppose the initial inclusion is extremal. On H=L2(M), M′∩M1=R(M)∩R(N)′={Ra:a∈N′∩M} by [F4]. For such a, EN(a)∈Z(N) by bimodularity, so trace preservation gives EN(a)=τM(a)1; hence for c=Ra one has eNceN=τM(a)eN. Let M2=End⁡ML2(M1) with the trace from the frame in step 3.1. The right-action module trace is τ2(Rc)=λ−1∑jτ1(vj∗vjc)=∑jτ1(eNuj∗ujeNc)=τM(a)∑jτ1(eNuj∗ujeN)=τM(a). In the middle equality one may insert a final eN: if A=eNAeN, traciality gives τ1(Ac)=τ1(AceN). The last sum is λ−1∑jτM(uj∗uj)=1. Initial extremality states τ1(c)=τM(a), so τ2(Rc)=τ1(c) for every c∈M′∩M1, which is exactly extremality of M⊆M1.

5.1F3F4F5step 1.1step 2.1step 3.1step 4.1construct

Iterate steps 1.1–3.1. Each new finite corner is a II1 factor by [F5], its trace restricts to the previous factor trace by uniqueness, and step 3.1 supplies a bounded finite frame of the same ordinary index λ. If extremality holds initially, step 4.1 propagates it. This constructs every finite stage of the asserted tower; no common finite frame length for all stages is required.

6.1F1F3F4step 1.1step 5.1algebra

To verify both adjacent relations independently, work first on L2(M1) and put e=eN, f=e2. The compression identity is fTf=F(T)f for T∈M1, so fef=F(e)f=λ−1f. For the reverse order evaluate on the dense vectors T=xey∈M1: efe(T)=eF(exey)=λ−1eEN(x)y=λ−1EN(x)ey=λ−1e(T). These vectors span M1 by step 1.1, and all operators are bounded; hence efe=λ−1e. Apply the same two calculations at each adjacent inclusion from step 5.1. Every ei is a self-adjoint projection by definition.

7.1F4F6step 5.1step 6.1algebra

For j≥i+2, the projection ej commutes with Mj−2 by its bimodule projection formula, and ei∈Mi⊆Mj−2; thus eiej=ejei. Setting Ui=δei, the square and both adjacent identities become the relations in [F6], since δ2=λ. Reflection is the ∗-operation on the real-parameter diagram algebra, so its presentation yields compatible unital ∗-representations TLn(C,δ)→Mn−1.

8.1F1F3F7step 2.1step 5.1step 6.1step 7.1algebra∎

The traces normalize the unit and restrict compatibly. For x in the earlier algebra the Markov formula of step 2.1 at stage i gives τi(xUi)=δλ−1τi−1(x)=δ−1τi−1(x). To compare with normalized diagram closure, use [F7]: each element at rank n+1 is a sum of an earlier-rank element and terms xUny. Restriction fixes the first term, while cyclicity forces the value on xUny to be δ−1τn(yx). Induction from rank zero therefore determines at most one compatible normalized Markov trace. Closure satisfies these same rules by [F7], so it is the pulled-back trace, which is positive because it comes from a positive trace on a II1 factor. Finally λ≥1 follows from τ1(e1)=λ−1≤1. If λ=1, faithfulness gives e1=1, so M=N and the subsequent inclusions and projections are identities; all the same formulas hold. No zero or empty frame occurs, since its rank operators sum to the identity. This proves all claims.

5 · Examples, counterexamples and false statements

None yet.

Sources