Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

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.

Depends on

Used by

Dependency tree · two levels

48 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