Alphabeta Math
LemmaStatement: 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.

Hilbert projections are linear, self-adjoint and contractive

Statement

Assume the Axiom of Countable Choice. Let M be a closed linear subspace of a real or complex Hilbert space H and let PM be the Hilbert orthogonal projection onto M. Then:

  1. PM is linear and idempotent, ranPM=M and kerPM=M;
  2. PMx,y=x,PMy for all x,yH, that is PM is self-adjoint;
  3. PMxx for every x, so PM is a bounded linear operator of norm at most 1; and if M{0}, then PM=1.

Facts & Assumptions

[A1]

PMxM and xPMxM, and a vector in M is orthogonal to every vector of M (The Hilbert orthogonal projection onto a closed subspace, Orthogonality and the orthogonal complement).

[A2]

M and M are linear subspaces, so they are closed under sums and scalar multiples (Linear subspace of a vector space, Orthogonality and the orthogonal complement).

[A3]

For pairwise orthogonal vectors, u+v2=u2+v2 (Pythagoras and finite orthogonal sums).

[A4]

A bounded linear operator has finite operator norm, and T=sup{Tx:x1} with TxTx (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A5]

Countable Choice is the assumption under which the projection is defined (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: Countable Choice, a closed linear subspace M of a Hilbert space H and the projection PM.

1.1

Linearity: for scalars a,b and x,x, the vector aPMx+bPMx lies in M and (ax+bx)(aPMx+bPMx)=a(xPMx)+b(xPMx) lies in M, so by the defining property of PM it equals PM(ax+bx); idempotence follows because PMxM has zero orthogonal component, so PMPMx=PMx.

A1A2A5
2.1

Range and kernel: PMxM always, PMm=m for mM because mm=0M, and PMx=0 exactly when x=x0M; hence ranPM=M and kerPM=M.

step 1.1A1A2
3.1

Self-adjointness: writing y=PMy+(yPMy) and using additivity in the second argument together with yPMyM and PMxM gives PMx,y=PMx,PMy, and symmetrically x,PMy=PMx,PMy; hence the two pairings agree.

step 2.1A1A2
4.1

Contractivity: x=PMx+(xPMx) is a sum of orthogonal vectors, so Pythagoras gives x2=PMx2+xPMx2PMx2, hence PMxx and PM1 by the definition of the operator norm; if M{0} choose 0mM, then PMm=m gives PMPMm/m=1, so PM=1.

step 3.1A3A4algebra

Depends on

Used by

Dependency tree · two levels

26 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