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 be an ordinary finite-index II1 inclusion as in Finite-index extremal II1 subfactor data, with and . Set , , and recursively let be projection and for . Every 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 If is extremal in the specified right-action sense, every adjacent inclusion is extremal. The projections satisfy Consequently define compatible unital -representations of the finite diagram Temperley–Lieb tower , whose pulled-back traces are the normalized closure traces. Neither surjectivity onto nor identification with its full relative commutant is asserted. These conclusions include the index-one inclusion .
Facts & Assumptions
AC is inherited from the stated tracial and Hilbert-module foundations. (Finite-index extremal II1 subfactor data)
The ordinary index is , is the unique trace-preserving expectation, and extremality compares with for . (Finite-index extremal II1 subfactor data)
Ordinary finite index supplies bounded with , , , and the complete projection model , whose Hilbert-space completion is . Every bounded right- Hilbert-space endomorphism is a matrix in and hence preserves . (Ordinary finite Jones index supplies a bounded finite Parseval frame)
is a II1 factor, its normalized module trace satisfies , and its trace-preserving expectation satisfies . (Finite Jones index gives bounded vector pull-down)
Every finite tracial inclusion has the unique normal faithful trace-preserving bimodule expectation; standard commutants on are and . (Tracial standard form, normal functional vectors, and expectation)
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)
The generator presentation has relations , , 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)
Jones normal-form words span and use the highest generator at most once, so . The normalized diagram closure trace is cyclic, restricts compatibly, and has the Markov value . (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.
On dense vectors , trace preservation gives for , so is the Hilbert projection and . By [F2], every right-module endomorphism has the finite expression , since in the finite Hilbert-space model is a matrix with entries in , so ; its adjointable module bound also makes it bounded on . Hence the first algebra is precisely the finite corner .
The corner trace is , faithful and normal, and in the coordinate frame its unnormalized value is . For , the adjoint of the frame identity for gives , whence . By uniqueness [F5], . The expectation of [F3] is therefore for these normalized traces. Applying to gives .
Put . For , [F3] gives . Every element of is a finite sum of such terms by step 1.1, so this is a Parseval frame on all of . Its projection matrix gives an onto -valued inner-product isometry from to , with inverse . Its Hilbert-space completion is . Moreover . Thus the ordinary index of is , and [F3]–[F5] apply again.
Suppose the initial inclusion is extremal. On , by [F4]. For such , by bimodularity, so trace preservation gives ; hence for one has . Let with the trace from the frame in step 3.1. The right-action module trace is In the middle equality one may insert a final : if , traciality gives . The last sum is . Initial extremality states , so for every , which is exactly extremality of .
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.
To verify both adjacent relations independently, work first on and put , . The compression identity is for , so . For the reverse order evaluate on the dense vectors : . These vectors span by step 1.1, and all operators are bounded; hence . Apply the same two calculations at each adjacent inclusion from step 5.1. Every is a self-adjoint projection by definition.
For , the projection commutes with by its bimodule projection formula, and ; thus . Setting , the square and both adjacent identities become the relations in [F6], since . Reflection is the -operation on the real-parameter diagram algebra, so its presentation yields compatible unital -representations .
The traces normalize the unit and restrict compatibly. For in the earlier algebra the Markov formula of step 2.1 at stage gives . To compare with normalized diagram closure, use [F7]: each element at rank is a sum of an earlier-rank element and terms . Restriction fixes the first term, while cyclicity forces the value on to be . 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 follows from . If , faithfulness gives , so 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
- Finite-index extremal II1 subfactor data
- Ordinary finite Jones index supplies a bounded finite Parseval frame
- Finite Jones index gives bounded vector pull-down
- Tracial standard form, normal functional vectors, and expectation
- Projection comparison and unique normalized traces in finite factors
- The abstract Temperley–Lieb generator presentation
- The generator presentation is the planar diagram algebra over every commutative ring
- Jones normal forms span and are counted by Catalan paths
- The normalized closure trace is cyclic and satisfies the Markov rules
- The Axiom of Choice
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
- Vaughan F. R. Jones, Planar Algebras, I (standard reference, not scraped)
- David Penneys, Exercises in Quantum Algebra (standard reference, not scraped)