Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 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.

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