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 U∗U being the orthogonal projection onto (ker⁡U)⊥, and then UU∗ is the orthogonal projection onto ran⁡U; equivalently U∗ is a partial isometry.

Facts & Assumptions

[A1]

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

[A2]

⟨U∗x,y⟩=⟨x,Uy⟩, U∗∗=U, and U∗U 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 Ux≠0 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=ker⁡U⊕(ker⁡U)⊥ (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⁡(I−Q) (the same kernel argument applies), and x−Qx is perpendicular to its range since ⟨x−Qx,Qy⟩=⟨Q(x−Qx),y⟩=0. Thus the defining decomposition shows Q=Pran⁡Q.

[A4]

(ran⁡U)⊥=ker⁡U∗ and ran⁡U‾=(ker⁡U∗)⊥ (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 C≥0, ∥S∥≤C is equivalent to ∥Sx∥≤C∥x∥ 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(x−y,x−y)+iB(x+iy,x+iy)−iB(x−iy,x−iy); hence a form with zero diagonal is zero.

Proof

technique · direct

Given: A nonzero complex Hilbert space H and a bounded operator U∈B(H), with M:=(ker⁡U)⊥.

1.1A1A3A5algebra

If U is a partial isometry, then for x=m+n with m∈M, n∈ker⁡U one has Ux=Um and ∥Ux∥=∥Um∥=∥m∥=∥PMx∥.

1.2A2A3algebra

If U∗U=PM, then U vanishes on ker⁡U and is isometric on M: for x∈ker⁡U one has ∥Ux∥2=⟨PMx,x⟩=0, and for x∈M one has ∥Ux∥2=⟨PMx,x⟩=∥x∥2.

2.1step 1.1A2A3A6

If U is a partial isometry, put D=U∗U−PM. The adjoint and projection identities and step 1.1 give ⟨Dx,x⟩=∥Ux∥2−∥PMx∥2=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 U∗U=PM.

2.2step 1.2

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

3.1step 1.1step 2.1A2A3

If U is a partial isometry, then U=UPM=UU∗U: the first identity follows since x−PMx∈ker⁡U, and the second uses step 2.1. Let Q=UU∗. It is bounded and self-adjoint by [A2], and Q2=(UU∗U)U∗=UU∗=Q. Its range is contained in ran⁡U, while U=QU gives the reverse inclusion. By [A3], ran⁡U=ran⁡Q is closed and UU∗=Pran⁡U.

4.1step 1.1step 2.1step 3.1A1A4

If U is a partial isometry, then U∗ is a partial isometry: [A4] and step 3.1 give (ker⁡U∗)⊥=ran⁡U. On this space, write y=Ux; then ∥U∗y∥=∥U∗Ux∥=∥PMx∥=∥Ux∥=∥y∥. On its kernel U∗ vanishes by definition.

5.1step 4.1A2

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

6.1step 2.1step 2.2step 3.1step 4.1step 5.1∎

Therefore U is a partial isometry exactly when U∗U=P(ker⁡U)⊥, and exactly when U∗ is a partial isometry; whenever these conditions hold, ran⁡U is closed and UU∗=Pran⁡U.

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