Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Partial isometry characterizations

Statement

Assume Countable Choice. For a bounded operator U on a nonzero complex Hilbert space, the partial-isometry condition is equivalent to UU being the orthogonal projection onto (kerU), and then UU is the orthogonal projection onto ranU; equivalently U is a partial isometry.

Facts & Assumptions

[A1]

U is a partial isometry when it vanishes on kerU and is isometric on the initial space (kerU); an isometry is exactly an operator with UU=I (Isometry coisometry and partial isometry).

[A2]

Ux,y=x,Uy, U=U, and UU is self-adjoint for every bounded U (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

[A3]

The kernel of a bounded operator is closed: if Ux0 and C bounds U, the ball about x of radius Ux/(2(C+1)) misses its kernel. Orthogonal complements are closed linear subspaces (Orthogonal complements are closed), so H=kerU(kerU) (Orthogonal decomposition by a closed subspace). The Hilbert orthogonal projection PM onto a closed subspace M is the linear self-adjoint idempotent with range M and kernel M (The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive). Conversely, a bounded self-adjoint idempotent Q has closed range ker(IQ) (the same kernel argument applies), and xQx is perpendicular to its range since xQx,Qy=Q(xQx),y=0. Thus the defining decomposition shows Q=PranQ.

[A4]

(ranU)=kerU and ranU=(kerU) (Kernel–range orthogonality for Hilbert adjoints).

[A5]

Countable Choice is the hypothesis of the adjoint, projection and decomposition suppliers (The Axiom of Countable Choice (ACω)).

[A6]

For a bounded operator S and C0, SC is equivalent to SxCx for all x (The operator norm as the least bound and as the unit-sphere or unit-ball supremum). The pairing is linear in its first argument and conjugate-linear in its second (Real and complex inner product spaces, with the inner product linear in the first argument). For any such sesquilinear form B, direct expansion gives 4B(x,y)=B(x+y,x+y)B(xy,xy)+iB(x+iy,x+iy)iB(xiy,xiy); hence a form with zero diagonal is zero.

Proof

technique · direct

Given: A nonzero complex Hilbert space H and a bounded operator UB(H), with M:=(kerU).

1.1

If U is a partial isometry, then for x=m+n with mM, nkerU one has Ux=Um and Ux=Um=m=PMx.

A1A3A5algebra
1.2

If UU=PM, then U vanishes on kerU and is isometric on M: for xkerU one has Ux2=PMx,x=0, and for xM one has Ux2=PMx,x=x2.

A2A3algebra
2.1

If U is a partial isometry, put D=UUPM. The adjoint and projection identities and step 1.1 give Dx,x=Ux2PMx2=0 for every x. Applying the expansion in [A6] to B(x,y)=Dx,y gives Dx,y=0 for all x,y; taking y=Dx gives Dx=0. Hence UU=PM.

step 1.1A2A3A6
2.2

Conversely, if UU=PM then U is a partial isometry, since it vanishes on kerU and is isometric on the initial space M.

step 1.2
3.1

If U is a partial isometry, then U=UPM=UUU: the first identity follows since xPMxkerU, and the second uses step 2.1. Let Q=UU. It is bounded and self-adjoint by [A2], and Q2=(UUU)U=UU=Q. Its range is contained in ranU, while U=QU gives the reverse inclusion. By [A3], ranU=ranQ is closed and UU=PranU.

step 1.1step 2.1A2A3
4.1

If U is a partial isometry, then U is a partial isometry: [A4] and step 3.1 give (kerU)=ranU. On this space, write y=Ux; then Uy=UUx=PMx=Ux=y. On its kernel U vanishes by definition.

step 1.1step 2.1step 3.1A1A4
5.1

Conversely, if U is a partial isometry, apply step 4.1 to the bounded operator U; it shows U=U is a partial isometry.

step 4.1A2
6.1

Therefore U is a partial isometry exactly when UU=P(kerU), and exactly when U is a partial isometry; whenever these conditions hold, ranU is closed and UU=PranU.

step 2.1step 2.2step 3.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

39 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