Closed convex set 2026-10-14
A convex set that is also a closed subset in the specified topology. In a Hilbert space with its norm topology, every nonempty closed convex set has a unique nearest point to every ambient vector, by the Hilbert projection theorem.
For bounded positive operators satisfying the hypotheses, , so vanishes on the closure of the range of . The kernel of a sum of positive operators identity shows that it also vanishes on . Self-adjointness and the Hilbert projection theorem decompose the whole Hilbert space as that closed range plus that kernel. Thus . This proves the commuting case of uniqueness of a positive square root without using a spectral representation.
Hilbert space Created 2026-09-24 Updated 2026-10-14
A Hilbert space is a real or complex inner product space that is complete in the norm . Completeness means that every Cauchy sequence has a limit in the space: if its terms become arbitrarily close in this norm, they converge to an allowed vector. The inner product supplies lengths and orthogonality; completeness ensures that limiting approximation procedures do not leave the space.
Finite-dimensional Euclidean spaces are examples, but the same geometry also works for sequences and functions. In the l2 sequence space,
In the L2 space on with Lebesgue measure,
These formulas use the convention linear in the first argument. Elements of the L2 space are equivalence classes of square-integrable functions agreeing almost everywhere, so zero distance really identifies the same element. A vector can therefore be a whole function, and its squared length can measure an integrated squared error.
For example, approximating by is a nearest-point problem in this Hilbert space. The allowed approximations form the linear span of , and the orthogonal projection is the constant . Its residual is orthogonal to both allowed directions because its integral and its inner product with vanish. The geometry therefore identifies the best approximation without searching through every pair of coefficients.
This is useful whenever a complicated vector must be represented by a tractable collection of directions. Fourier series approximate functions with orthogonal oscillations; the Parseval identity relates the sum of squared coefficients to the squared norm. Least-squares solutions approximate attainable data using a linear operator. The Hilbert projection theorem explains why a nearest element exists and is unique for a nonempty closed convex set. Distinct application settings share the same geometry of useful components and orthogonal residuals. Casey Rodriguez's MIT lectures develop these connections between Hilbert spaces, Fourier series, and nearest-point problems.[ref]
A historical mathematical setting is David Hilbert's Grundzüge einer allgemeinen Theorie der linearen Integralgleichungen (1912). Its preface states that it reprints six communications published during 1904–1910 on linear integral equations. This provides a concrete source for the integral-equation setting associated with the name, while the abstract definition above incorporates later developments.[ref]
Parallelogram law Created 2026-09-28 Updated 2026-11-05
The parallelogram law for a quadratic form is
Conversely, under the usual divisibility assumptions, a function satisfying this identity and the appropriate homogeneity comes from a symmetric bilinear form by polarization.
For an inner product space, taking gives the displayed squared-norm identity by expanding and cancelling the mixed inner products. It is the geometric ingredient that makes minimizing sequences converge in the Hilbert projection theorem.
The Hilbert projection theorem states that every vector has a unique decomposition relative to a closed linear subspace , with and . The vector is the unique nearest point in .
The Riesz representation theorem states that every bounded complex-linear functional on a Hilbert space has a unique representation , with , using the convention of linearity in the first argument. If , use . Otherwise is closed. Project a vector outside to obtain with , and rescale it so . Then , so
This gives the representation. Uniqueness follows because a vector orthogonal to every is zero. The Cauchy-Schwarz inequality gives , and evaluation at gives equality when .
For the adjoint, fix . The functional is bounded with norm at most . By the Riesz representation theorem, there is a unique vector satisfying
For scalars , conjugate-linearity in the second argument shows that , by uniqueness of the representing vector. The same norm estimate gives . Thus is a unique bounded linear operator, the adjoint operator.
Commutativity and equality of squares give
Thus vanishes on , and by continuity on its closure. The preceding kernel of a sum of positive operators identity shows that it also vanishes on . Since is self-adjoint, part (i) and the Hilbert projection theorem give the orthogonal direct sum
Therefore vanishes on all of , proving
This proves commuting positive operators with equal squares are equal without assuming a square-root uniqueness theorem.