Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 H be complex L2(μ) or a closed linear subspace of it, and let M be a closed linear subspace of H. There is a unique linear contraction PM:HH such that, for every fH, PMfM and fPMfM. Moreover, fPMf=infgMfg,H=MM. Here the orthogonal complement is taken inside H.

Facts & Assumptions

[F1]

The complex pairing is positive definite and sesquilinear, with norm f2 and Cauchy–Schwarz The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz.

[F2]

Complex L2 is complete under countable choice Complex Lp completeness and almost-everywhere subsequences.

[F3]

AC supplies a choice function on a family of nonempty sets The Axiom of Choice.

[F4]

Orthogonality and contraction use the local operator conventions L two operator conventions for weak mixing.

Proof

Given: AC, H, M and f as in the statement.

1.1

Since 0M, d=infgMfg exists in [0,f]. For every nN the set {gM:fg2<d2+1/(n+1)} is nonempty by the defining property of the infimum. AC selects gn in these sets, including g0. It also supplies the countable choice assumed in complex completeness.

F3given
2.1

Expanding the pairing gives u+v2+uv2=2u2+2v2: the two cross terms cancel. Apply this to u=fgn, v=fgm. Since (gn+gm)/2M, it follows that gngm22fgn2+2fgm24d2<2/(n+1)+2/(m+1). Thus (gn)nN is Cauchy.

F1step 1.1
3.1

Completeness gives a norm limit in L2. Closedness of H, then of M in H, puts this limit g in M. The triangle inequality implies fgnfggng, so fg=d. This reasoning applies equally when H is the full space.

F2step 2.1given
4.1

Set z=fg. For hM and real t, minimality gives 0zth2z2=2tRez,h+t2h2. Dividing separately for positive and negative t and letting t0 makes the real part zero. Replacing h by ihM makes the imaginary part zero because z,ih=iz,h. Hence zM.

F1F4step 3.1
5.1

If g also lies in M with fgM, then ggMM; its squared norm is zero, so g=g. Define PMf=g. Conversely any such orthogonal decomposition minimizes distance: for hM, expansion yields fh2=fg2+gh2fg2. Thus it has exactly the required distance property.

F1step 4.1
6.1

For a,bC and f1,f2H, the vector aPMf1+bPMf2 lies in M, and its difference from af1+bf2 is orthogonal to M by sesquilinearity. Uniqueness gives linearity. Orthogonal expansion gives f2=PMf2+fPMf2, proving contraction. Pairing with each fixed hM is continuous by Cauchy–Schwarz, so M is closed; it is a subspace by linearity. Each f has the displayed decomposition, and its uniqueness follows from MM={0}. When M={0} this gives PM=0, and when M=H it gives PM=I, including the zero-space case.

F1F4step 5.1

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