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

Agreement with the concrete L-two projection

Remark

Assume the Axiom of Choice, and let H be complex L2(μ) or a closed linear subspace of it with MH a closed linear subspace (Closed l two subspaces have orthogonal projections). That published theorem constructs a linear contraction PM:HH with PMfM and fPMfM for every f, together with H=MM.

The Hilbert orthogonal projection of The Hilbert orthogonal projection onto a closed subspace is characterised by the same two properties: its value at f is the unique M-component of the unique orthogonal decomposition f=PMf+(fPMf) with fPMfM. Since the concrete construction supplies a vector of M whose residual is orthogonal to M, and the orthogonal decomposition is unique, the concrete map and the Hilbert projection agree wherever both are defined. The concrete theorem is used only to identify the two constructions: it is not a supplier for the existence, linearity, contractivity or self-adjointness of the Hilbert projection, which are proved on this page from the abstract decomposition.

The choice cost of the identification is the concrete theorem's: it assumes AC, and AC implies the Axiom of Countable Choice, under which the abstract projection exists (The Axiom of Choice). No stronger principle is claimed, and the identification is orientation only, not a load-bearing prerequisite of any theorem on this page.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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