Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Isometry coisometry and partial isometry

Definition

Assume Countable Choice and let H,K be nonzero complex Hilbert spaces with U∈B(H,K) a bounded linear operator (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

  • U is an isometry when ∥Ux∥=∥x∥ for every x∈H; equivalently U∗U=IH.
  • U is a coisometry when U∗ is an isometry; equivalently UU∗=IK.
  • U is a partial isometry when U vanishes on its kernel and is isometric on the orthogonal complement of its kernel: x∈ker⁡U ⟹ Ux=0,x∈(ker⁡U)⊥ ⟹ ∥Ux∥=∥x∥. The closed subspace (ker⁡U)⊥ is the initial space of U, and the closed subspace ran⁡U is its final space.

The equivalence in the isometry clause. If U∗U=I then ∥Ux∥2=⟨U∗Ux,x⟩=⟨x,x⟩. Conversely, if ∥Ux∥=∥x∥ for every x, then S:=U∗U−I is self-adjoint and ⟨Sx,x⟩=∥Ux∥2−∥x∥2=0 for every x; the four-term expansion of the sesquilinear form (x,y)↦⟨Sx,y⟩ applied to the vanishing diagonal values gives ⟨Sx,y⟩=0 for all x,y, hence S=0, that is U∗U=I (Hilbert-adjoint identities for the adjoint identities).

Well-definedness of the subspaces. The kernel ker⁡U is a closed linear subspace because U is bounded and linear, so its orthogonal complement is a closed subspace and the orthogonal-decomposition theorem gives H=ker⁡U⊕(ker⁡U)⊥ (Orthogonal decomposition by a closed subspace, Orthogonality and the orthogonal complement). The range of a partial isometry is closed: U is isometric on the closed subspace (ker⁡U)⊥ and vanishes on its orthogonal complement, so U carries the unit sphere of (ker⁡U)⊥ to a closed set and ran⁡U=U[(ker⁡U)⊥] is closed. In the terminology of The Hilbert orthogonal projection onto a closed subspace, the orthogonal projection onto the initial space is an orthogonal projection in the sense of that item, and the partial isometry restricted to it is an isometry onto ran⁡U.

Immediate cases and conventions. Every isometry and every coisometry is a partial isometry: an isometry has ker⁡U={0} and is isometric on H=(ker⁡U)⊥, and a coisometry has (ker⁡U)⊥=ran⁡U∗ on which it is isometric (Hilbert-adjoint identities). The zero operator is a partial isometry, with ker⁡U=H and ran⁡U={0} (Hilbert space). A partial isometry need not be an isometry and need not be unitary; the unilateral shift on the companion page is an isometry that is not a coisometry.

Depends on

Used by

Dependency tree · two levels

28 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