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.
A matrix amplification gives an explicit finite-index II1 inclusion
Statement
Assume AC as inherited from the II1 factor and finite-index suppliers. Let be a II1 factor with faithful normal normalized trace and let . The inclusion with trace has expectation , is extremal, has frame for , and has index . Its first basic construction has trace .
Facts & Assumptions
Given: A II1 factor , an integer , the local frame and basic-construction results, and matrix units in .
A finite-index subfactor data package defines the right-module inner product by and index as the module-frame trace. (Finite-index extremal II1 subfactor data)
A coordinate Parseval frame has index equal to the sum of the normalized traces of its inner products. (Ordinary finite Jones index supplies a bounded finite Parseval frame)
The first basic-construction trace satisfies . (Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations)
In the specified coordinate model, the unnormalized module trace of is . (Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations)
Polar decomposition of a bounded operator in a concrete von Neumann algebra has its partial isometry in that algebra. (Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor)
AC is inherited from the tracial, finite-index module and full Jones-tower suppliers. (The Axiom of Choice)
Proof
Given: , , and the normalized matrix trace .
For , . If , each diagonal compression is positive, so this sum is positive. The formula makes unital, fixes , is -bimodular, and preserves the product trace; its finite sum of normal diagonal maps is normal. If for , then , so faithfulness of gives ; hence is faithful. An element commuting with every must be , and commuting also with forces ; thus is a factor. It has no minimal projection: if were minimal, some diagonal corner would be nonzero. Its support projection in the diffuse factor is nonzero. The polar decomposition of lies in by [F5] and gives a partial isometry from onto a nonzero subprojection of . Since has no minimal projections, choose ; its image under that partial isometry is a nonzero proper subprojection of , a contradiction. Thus is a II1 factor; is one as well.
For matrix units, , so . Thus the vectors are orthonormal as a right -module frame. More generally, for , , and hence . These coordinates identify isometrically with , so it is complete with projection model ; the inner-product traces sum to , and [F2] gives index .
An element commutes with every exactly when each is central in the factor , hence when it lies in . On the right action of this relative commutant, [F4] gives unnormalized module trace . Indeed , whose normalized matrix trace is , the scalar factor in cancels the normalized matrix trace , and the sum over has terms. Dividing by gives , so the right-action module trace and agree on ; the inclusion is extremal.
Applying [F3] with gives for every . This is the claimed trace normalization.
Depends on
- Finite-index extremal II1 subfactor data
- Ordinary finite Jones index supplies a bounded finite Parseval frame
- Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations
- The Axiom of Choice
- Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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)