Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor

Statement

Assume AC (The Axiom of Choice). Let H be a complex Hilbert space and M⊆B(H) a concrete von Neumann algebra (Von Neumann algebras and commutants). If H={0}, part 1 is the trivial zero-operator decomposition and part 2 has no nonzero projection inputs; assume H≠{0} for the remaining clauses. A projection means a self-adjoint idempotent in M; for projections r,p, r≤p means rp=pr=r. Projections r,s∈M are called equivalent when there is a partial isometry w∈M with w∗w=r and ww∗=s. Write pMq:={pmq:m∈M}. Then:

  1. Every x∈M has a polar decomposition x=v∣x∣, where ∣x∣:=(x∗x)1/2∈M and v∈M is a partial isometry (Isometry coisometry and partial isometry) with v∗v the orthogonal projection onto (ker⁡x)⊥ and vv∗ the orthogonal projection onto ran⁡x‾.
  2. If M is a factor, meaning M∩M′=CI, and p,q∈M are nonzero projections, then pMq≠{0}. In particular, a nonzero partial isometry v∈M exists with v∗v≤p and vv∗≤q; equivalently, a nonzero subprojection of p is equivalent to a nonzero subprojection of q.

Facts & Assumptions

Given: AC, a concrete von Neumann algebra M⊆B(H), and the factor condition where used.

[F1]

AC is the hypothesis of the bicommutant, continuous-calculus and positive-square-root suppliers; it supplies Countable Choice for the Hilbert projection, orthogonal-decomposition, adjoint, range-orthogonality, partial-isometry, positive-spectrum and generated-C*-algebra interfaces (The Axiom of Choice).

[F2]

A concrete von Neumann algebra is a unital ∗-subalgebra closed in WOT (Von Neumann algebras and commutants).

[F3]

The reciprocal Archimedean bound gives 1/(n+1)→0 for n∈N (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε). For bounded self-adjoint b, continuous functional calculus is isometric, sends the coordinate function to b, and has range C∗(I,b); in particular ∥b∥=max⁡t∈σ(b)∣t∣. If b is positive, then σ(b)⊆[0,+∞) (Continuous functional calculus for bounded self adjoint operators, Spectrum of a positive operator is nonnegative).

[F4]

Every closed subspace K has a Hilbert orthogonal projection (The Hilbert orthogonal projection onto a closed subspace).

[F5]

A partial isometry is isometric on the orthogonal complement of its kernel and zero on its kernel (Isometry coisometry and partial isometry).

[F6]

For x∈B(H), x∗x is positive because the adjoint identity gives ⟨x∗xξ,ξ⟩=∥xξ∥2≥0; every bounded positive operator has a unique positive square root (The Hilbert-space adjoint of a bounded operator, Real and complex inner-product spaces and their induced length, Self-adjoint, positive, unitary and normal operators, Positive square root).

[F7]

Norm convergence implies strong-operator convergence by ∥Tξ∥≤∥T∥∥ξ∥, and M is strongly closed by the double-commutant theorem (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Strong and weak operator topologies, The double commutant theorem for concrete von Neumann algebras).

[F8]

C∗(I,b) is the norm closure of the unital ∗-polynomials in b (C star algebra generated by a normal operator).

[F9]

Every closed subspace K gives an orthogonal decomposition H=K⊕K⊥ (Orthogonal decomposition by a closed subspace).

[F10]

For bounded T, ran⁡T‾=(ker⁡T∗)⊥ (Kernel–range orthogonality for Hilbert adjoints).

[F11]

The double-commutant theorem gives M′′=M (The double commutant theorem for concrete von Neumann algebras).

[F12]

The Hilbert adjoint satisfies ⟨Tξ,η⟩=⟨ξ,T∗η⟩ (The Hilbert-space adjoint of a bounded operator).

Proof

technique · direct

Given: AC, M, and x and p,q where the corresponding clauses apply.

1.1given

If H={0} then M={0}, and the unique operator has the stated zero decomposition; there are no nonzero projections for part 2. Assume H≠{0} below.

1.2F1F2F4F11

For the factor clause, fix a nonzero projection q∈M and set L=span⁡‾{mqξ:m∈M,ξ∈H}. Since q≠0, some ξ has qξ≠0, and I∈M puts qξ in the generating set, so L≠{0}. This closed subspace is invariant under M and its adjoints, hence reducing for M. It is also invariant under M′ and its adjoints, since for c∈M′ and m∈M, cmqξ=mcqξ=mqcξ, hence reducing for M′. Thus its orthogonal projection PL commutes with both M and M′. By [F11], PL∈M′∩M′′=M′∩M, the center of M.

1.3givenF2F6F7F8F12

For arbitrary x∈M, put b:=x∗x∈M. By [F6], b is positive and has a positive square root a:=b1/2. Positivity makes ⟨aξ,ξ⟩ real, and [F12] gives ⟨(a−a∗)ξ,ξ⟩=0 for every ξ. For B(u,v):=⟨(a−a∗)u,v⟩, the four-term expansion 4B(u,v)=B(u+v,u+v)−B(u−v,u−v)+iB(u+iv,u+iv)−iB(u−iv,u−iv) therefore gives B(u,v)=0 for all u,v, hence a=a∗. The theorem puts a in C∗(I,b), which is contained in M by [F2, F7, F8] because its generating ∗-polynomials lie in M. For every ξ∈H, ∥aξ∥2=⟨a2ξ,ξ⟩=⟨x∗xξ,ξ⟩=∥xξ∥2, so ker⁡a=ker⁡x.

2.1step 1.2given

Since q≠0, qH⊆L is nonzero, so PL≠0. If M is a factor, its center is CI; the only nonzero scalar projection is I. Hence PL=I and L=H.

2.2F4F5F9F10F12step 1.3

Define v0 on ran⁡a by v0(aξ)=xξ. The equality of norms in step 1.3 makes this well-defined and isometric. By [F10], ran⁡a‾=(ker⁡a∗)⊥=(ker⁡a)⊥=(ker⁡x)⊥=:K. It extends to an isometry from K onto F:=ran⁡x‾; extend it by zero on ker⁡a=K⊥. Since v is isometric on K and zero on K⊥, ker⁡v=K⊥ and v is a partial isometry. Also x=va. For ξ∈K and any η=ηK+ηK⊥, [F12] gives ⟨v∗vξ,η⟩=⟨vξ,vηK⟩=⟨ξ,ηK⟩=⟨ξ,η⟩, while v∗v vanishes on K⊥; hence v∗v=PK. If ζ∈F⊥, then ⟨v∗ζ,ξ⟩=⟨ζ,vξ⟩=0 for every ξ, so v∗ζ=0; on F=vK, vv∗ is the identity because v∗v=PK. Thus vv∗=PF.

3.1step 2.1

If pMq={0}, then p annihilates every mqξ and hence their closed span L=H from step 2.1. This forces p=0, a contradiction. Therefore pMq≠{0}.

3.2F1F2F3F7F8step 1.3step 2.2

Let gn(t)=t/(t+1/(n+1)) on σ(a)⊆[0,∥a∥], using [F3]. By [F3], ∥gn(a)∥≤1 and (a+1/(n+1)I)−1∈C∗(I,a)⊆M by [F2, F7, F8]. On ran⁡a, (I−gn(a))a=(1/(n+1))a(a+1/(n+1)I)−1 has norm at most 1/(n+1); on ker⁡a, gn(a)=0. Since ran⁡a‾=(ker⁡a)⊥ and ∥gn(a)∥≤1, convergence on the dense subspace ran⁡a+ker⁡a extends to gn(a)→P(ker⁡a)⊥=v∗v strongly. Therefore x(a+1/(n+1)I)−1=vgn(a)→v(v∗v)=v strongly. Each approximant lies in M, so its strong closedness [F7] gives v∈M.

4.1F5step 2.2step 3.1step 3.2∎

Apply step 3.1 with p and q interchanged to obtain a nonzero x∈qMp. Its polar partial isometry from steps 2.2 and 3.2 lies in M. Because x=xp, (I−p)H⊆ker⁡x, so the initial space (ker⁡x)⊥ is contained in pH and v∗v≤p; the containment gives p(v∗v)=(v∗v)p=v∗v. Because x=qx, ran⁡x⊆qH, so vv∗≤q; likewise q(vv∗)=(vv∗)q=vv∗. Since v≠0 by x=va≠0, its initial and final projections are nonzero. Thus v∗v and vv∗ are nonzero equivalent subprojections of p and q, respectively.

Source notes

Blackadar I.5.2.1–I.5.2.2, printed pp. 23–24, gives the support-projection and polar-decomposition construction and the strong-limit regularizer. The local proof supplies the positive-square-root membership in M and verifies the strong limit used to place the partial isometry in M. Blackadar III.1.3.10, printed p. 244, concerns abelian projections and their central supports; it does not establish pMq≠0 for arbitrary nonzero p,q, which is proved locally here. Bekka–de la Harpe Appendix A.K, printed pp. 423–424, gives factor-center and support terminology only. The scaffold's locator to pp. 434–440 points to bibliography and index pages, not Appendix A.K.

Depends on

Used by

Dependency tree · two levels

64 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