Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

The Hilbert orthogonal projection onto a closed subspace

Definition

Assume the Axiom of Countable Choice. Let M be a closed linear subspace of a real or complex Hilbert space H (Linear subspace of a vector space). By the orthogonal-decomposition theorem (Orthogonal decomposition by a closed subspace) every xH has a unique representation

x=PMx+(xPMx),PMxM,xPMxM,

and the Hilbert orthogonal projection onto M is the map

PM:HMH,xPMx,

assigning to x its unique M-component. Its defining properties are therefore

PMxM,xPMxM(xH),

which characterise PM uniquely: a map with these defining properties must agree with the M-component of the unique decomposition of each x.

Agreement with the finite-dimensional projection. If V is a finite-dimensional inner-product space and WV a subspace, then For a subspace W of a finite-dimensional inner product space, V=WW writes V=WW and The orthogonal projection PWv is the W-component in V=WW defines PWv as the unique W-component of v; the defining properties displayed above are the same, so they define the same map on a finite-dimensional Hilbert space.

Range and kernel. PMxM for every x, and PMm=m for mM because m=m+0 with 0M; conversely PMx=0 says exactly that x=x0M. Hence the range of PM is M and its kernel is M, and PM is the identity on M and zero on M.

Depends on

Used by

Dependency tree · two levels

22 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