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.
Closed l two subspaces have orthogonal projections
Statement
Assume AC. Let be complex or a closed linear subspace of it, and let be a closed linear subspace of . There is a unique linear contraction such that, for every , and . Moreover, Here the orthogonal complement is taken inside .
Facts & Assumptions
The complex pairing is positive definite and sesquilinear, with norm and Cauchy–Schwarz The complex pairing is well-defined and satisfies Cauchy–Schwarz.
Complex is complete under countable choice Complex Lp completeness and almost-everywhere subsequences.
AC supplies a choice function on a family of nonempty sets The Axiom of Choice.
Orthogonality and contraction use the local operator conventions L two operator conventions for weak mixing.
Proof
Given: AC, , and as in the statement.
Since , exists in . For every the set is nonempty by the defining property of the infimum. AC selects in these sets, including . It also supplies the countable choice assumed in complex completeness.
Expanding the pairing gives : the two cross terms cancel. Apply this to , . Since , it follows that . Thus is Cauchy.
Completeness gives a norm limit in . Closedness of , then of in , puts this limit in . The triangle inequality implies , so . This reasoning applies equally when is the full space.
Set . For and real , minimality gives . Dividing separately for positive and negative and letting makes the real part zero. Replacing by makes the imaginary part zero because . Hence .
If also lies in with , then ; its squared norm is zero, so . Define . Conversely any such orthogonal decomposition minimizes distance: for , expansion yields . Thus it has exactly the required distance property.
For and , the vector lies in , and its difference from is orthogonal to by sesquilinearity. Uniqueness gives linearity. Orthogonal expansion gives , proving contraction. Pairing with each fixed is continuous by Cauchy–Schwarz, so is closed; it is a subspace by linearity. Each has the displayed decomposition, and its uniqueness follows from . When this gives , and when it gives , including the zero-space case.
Depends on
Used by
Dependency tree · two levels
16 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
- Axler 8.28 p.226, 8.37–8.40 pp.228–229 (standard reference, not scraped)