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 Space Geometry and Riesz Representation — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The companion computes the projection in elementary models: the standard inner products on coordinates, on square-summable sequences and on quotient , the Gram-matrix formula for a finite-dimensional subspace with its invertibility and basis independence, the mean as the projection onto the constants, and the distance formula with its Pythagoras identity. It exhibits boundary phenomena as well: an inner-product space that is not complete, a norm that fails the parallelogram law for every exponent other than the Hilbertian one, and a nearest-point map to a closed convex set that is neither additive nor homogeneous. Adjoint computations for the shift, for multiplication by a bounded function and for an integral operator with square integrable kernel close the page, using the complex pairing, Hölder's inequality and Fubini for the kernel case.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The standard inner products make K n, ell two and quotient L two Hilbert spaces
Example
Assume the Axiom of Countable Choice. Let be or and let be a measure space. Then the following are real or complex Hilbert spaces with the displayed first-variable-linear pairings, whose induced lengths are the standard norms:
- with , for each natural ;
- with ;
- the quotient with .
In the real case conjugation is the identity, so the pairings read and .
Facts & Assumptions
In a real or complex inner-product space the pairing is linear in the first argument and conjugate-linear and conjugate-symmetric in the second, positive definite, and the induced length is the square root of the diagonal pairing (Real and complex inner-product spaces and their induced length).
For complex scalars with exactly for , and (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive). The real field embeds in the complex field ( is a field, every element is uniquely , and every nonzero element has inverse ); for an embedded real , conjugation fixes and the complex modulus is , the real absolute value (Real and imaginary parts, complex conjugation, and modulus). Thus these same identities restrict to real scalars.
A normed space admitting a finite basis is a Banach space (Every finite-dimensional normed space is Banach), the induced length of an inner product is a norm (The induced length is a norm), and a Hilbert space is an inner-product space complete for its induced norm (Hilbert space).
On every scalar function is measurable, and the counting-measure dictionary gives ( is the space of counting measure). Applying the same nonnegative identity to the positive and negative parts of the real and imaginary parts of an integrable complex function gives its absolutely convergent series as its integral, by the defining real/complex integral formulas (Integrable real and complex functions, and their integrals). Almost-everywhere equality is equality everywhere, since only the empty set has zero counting measure ( is the space of counting measure, Counting measure on an arbitrary set).
On the quotient the pairing is representative-independent and satisfies the inner-product axioms, with (The complex pairing is well-defined and satisfies Cauchy–Schwarz).
Under countable choice, complex is complete and the complex pairing and its Cauchy–Schwarz inequality are available; the real spaces are complete for the same hypothesis (Complex completeness, density, and inner product: the consumer interface, Riesz-Fischer completeness of for , The space as the quotient by null functions).
Countable Choice is the hypothesis used by the cited completeness theorems; the complex pairing theorem [A5] itself is choice-free (The Axiom of Countable Choice ()).
Verification
Given: A scalar field , a natural and a measure space .
On the displayed pairing is linear in the first argument and conjugate symmetric by distributing each finite sum and applying the scalar conjugation identities of [A2], and positive definite because forces every and hence every by [A2]; the induced length is , a norm by [A3]. The coordinate vectors , , span by and are independent by reading each coordinate, hence form an ordered basis (the empty basis if ). The finite-basis completeness theorem [A3] therefore applies; so is a Hilbert space for this pairing.
On the pairing is the counting-measure integral of by [A4], so with absolutely convergent series, since and [A4] applies to the summable right-hand side; the complex case is [A5] and the real case is the restriction of [A5] to real-valued classes, where conjugation is the identity, so in both cases the axioms of [A1] hold and the induced length is the norm; completeness is the counting-measure instance of [A6].
On the quotient the displayed pairing is well defined on a.e. classes and satisfies the inner-product axioms with by [A5] in the complex case and by the same statement restricted to real-valued classes in the real case, and completeness is [A6].
Hence , and are inner-product spaces complete for the induced norms, that is Hilbert spaces, with the pairings displayed in the statement.
Projection onto a finite-dimensional subspace by a Gram matrix
Example
Assume the Axiom of Countable Choice. Let be a real or complex Hilbert space, let be a linearly independent finite list in , put , and for set
Then is closed, and the Hilbert projection of onto is
The result does not depend on the chosen independent spanning list: any other such list produces the same vector and its own unique coefficient vector solving the corresponding system.
Facts & Assumptions
The Gram matrix of an independent list satisfies , and a square matrix is invertible exactly when its determinant is nonzero (A Gram determinant is nonnegative and is positive exactly when the vector list is linearly independent, The Gram matrix and Gram determinant, with empty value , A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero).
A finite-dimensional subspace of a normed space is closed, and the Hilbert projection is characterised by and (A finite-dimensional normed subspace is closed, The Hilbert orthogonal projection onto a closed subspace).
and the pairing is linear in the first argument and conjugate-linear in the second (Orthogonality and the orthogonal complement, The Hilbert orthogonal projection onto a closed subspace).
Countable Choice is the hypothesis under which the Hilbert projection is defined (The Axiom of Countable Choice ()).
Verification
Given: Countable Choice, a Hilbert space , an independent list , its span and a vector .
The Gram matrix is invertible by [A1], so is invertible and is the unique solution of ; and is closed by [A2].
With one has for every , and hence for every by conjugate-linearity in the second argument.
Therefore and , so satisfies the two defining properties of the Hilbert projection and .
Basis independence and uniqueness: if is another independent list with the same span , its Gram matrix again has nonzero determinant and the same argument gives as a linear combination of the with the unique coefficient vector solving the corresponding system; since is the same vector, the two displayed formulas agree, and the coefficient vector is unique because is invertible.
Projection onto the constants is the mean
Example
Assume the Axiom of Countable Choice. Let be a measure space with , let be or , and let be the one-dimensional subspace of classes of constant functions, spanned by with . Then is closed and the Hilbert projection of onto is
the mean of ; in particular is the unique constant with .
Facts & Assumptions
with the pairing is a Hilbert space under countable choice, and the constants form a finite-dimensional, hence closed, subspace (The standard inner products make K n, ell two and quotient L two Hilbert spaces, A finite-dimensional normed subspace is closed).
Cauchy–Schwarz bounds ; in particular is finite when (Cauchy-Schwarz inequality for , The complex pairing is well-defined and satisfies Cauchy–Schwarz).
The Hilbert projection is characterised by and (The Hilbert orthogonal projection onto a closed subspace).
Countable Choice is the standing choice hypothesis (The Axiom of Countable Choice ()), while existence and uniqueness of the projection onto a closed subspace are supplied by the Hilbert-projection interface (The Hilbert orthogonal projection onto a closed subspace).
Verification
Given: Countable Choice, a measure space with , a class and the constants .
The integral is finite by [A2], the constant is finite and positive, and is a closed one-dimensional subspace by [A1].
Put and ; then and , so .
By the characterisation of the Hilbert projection, ; conversely, any constant with has , so by uniqueness of the projection, and for a probability measure the constant is the mean of .
Distance to a closed subspace
Example
Assume the Axiom of Countable Choice. Let be a closed linear subspace of a real or complex Hilbert space , let and let be the Hilbert projection. Then for every
and consequently
the infimum being attained uniquely at .
Facts & Assumptions
and , and is a linear subspace (The Hilbert orthogonal projection onto a closed subspace).
For pairwise orthogonal vectors (Pythagoras and finite orthogonal sums).
A vector of is orthogonal to every vector of , and is closed under addition (Orthogonality and the orthogonal complement).
Countable Choice is the hypothesis under which is defined (The Axiom of Countable Choice ()).
Verification
Given: Countable Choice, a closed subspace of a Hilbert space , a vector and the projection .
For write ; the first summand lies in and the second in , so the two are orthogonal and Pythagoras gives .
Since , step 1.1 gives for every , with equality exactly at ; hence the infimum of the distances is , attained uniquely there.
An inner-product space need not be complete
Statement refuted
Every inner-product space is complete for its induced norm.
Facts & Assumptions
The -series converges, and a convergent sequence of reals is Cauchy (For rational , converges iff , Every convergent sequence is Cauchy, Limits and Cauchy sequences of reals).
On counting measure the integral of is the series of the , and almost-everywhere equality is equality everywhere, so the norm of a finitely supported sequence is ( is the space of counting measure, Counting measure on an arbitrary set).
The pairing is linear in the first argument, conjugate-linear in the second and positive definite, and Cauchy–Schwarz gives (Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: , with equality exactly for dependent pairs).
A metric space is complete when every Cauchy sequence converges in it, and a Hilbert space is complete for its induced norm (Complete metric space: every Cauchy sequence converges in the space, Hilbert space).
Counterexample
Given: The space of finitely supported real or complex sequences with the pairing , a finite sum for .
The pairing is an inner product on : linearity in the first argument and conjugate symmetry are finite-sum algebra, and forces every coordinate to vanish; the induced length is the norm of the finitely supported sequence.
Let be the sequence with for and for ; each lies in , and for one has , a difference of partial sums of the convergent -series, which tends to as by [A1]; hence is Cauchy in the norm.
Suppose were a limit of in the induced norm; then for each fixed , Cauchy–Schwarz applied to and the -th coordinate vector gives , so for every , and has infinitely many nonzero coordinates, contrary to finite support.
Hence the Cauchy sequence in the inner-product space has no limit there, so is not complete for its induced norm, and the statement that every inner-product space is complete is false.
A norm need not satisfy the parallelogram law
Statement refuted
Every norm on a real vector space containing two linearly independent vectors is induced by an inner product, equivalently satisfies the parallelogram law.
Facts & Assumptions
A norm is induced by an inner product if and only if it satisfies the parallelogram law (Jordan–von Neumann: a norm is induced by an inner product exactly when it satisfies the parallelogram law).
For the space is the quotient of counting measure on , whose norm is , while ; almost-everywhere equality is equality everywhere ( is the space of counting measure, The space as the quotient by null functions, Counting measure on an arbitrary set).
Rational powers of a fixed base are strictly increasing in the exponent, and satisfy and (Monotonicity of and of , Laws of rational exponents, Rational powers of a positive base).
Every inner-product norm satisfies the parallelogram law (Real and complex inner-product spaces and their induced length, Jordan–von Neumann: a norm is induced by an inner product exactly when it satisfies the parallelogram law).
Counterexample
Given: A rational with , , and the coordinate vectors of the sequence space , together with the case of the supremum norm .
In the function has at the two indices and elsewhere, so , and likewise because at the same two indices; in the two norms are .
The parallelogram law in would therefore read , that is , which by strict monotonicity of the rational powers of base forces , that is ; for it fails, and in the two sides are and , so it fails there too.
By the Jordan–von Neumann characterisation, the norm of with , and the supremum norm of , are therefore not induced by any inner product on a space containing the two linearly independent coordinate vectors: the parallelogram law fails on , and it would hold on every pair of vectors if an inducing inner product existed.
Nearest-point maps to convex sets need not be linear
Statement refuted
The nearest-point map of a nonempty closed convex set in a Hilbert space is linear.
Facts & Assumptions
with the pairing is a real inner-product space whose induced norm is the absolute value (Real and complex inner-product spaces and their induced length, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms), and it is complete, hence a Hilbert space (Complete metric space: every Cauchy sequence converges in the space, Banach space, Hilbert space).
A set is convex when for all and , and the nearest point of a nonempty closed convex subset of a Hilbert space is the point minimising the distance (Convex sets and continuous real-hyperplane separation in a normed space, Hilbert space).
Counterexample
Given: The Hilbert space of [A1] and the closed convex set .
is closed and convex, and is nonempty with .
For the point lies in with , so ; for and any one has with equality exactly at , so .
Hence ; this map is not additive, since , and it is not homogeneous either, since .
Therefore the nearest-point map of a nonempty closed convex set in a Hilbert space need not be linear, so the statement refuted is false.
Adjoints of shifts, multiplication and integral operators
Example
Assume the Axiom of Countable Choice. Then:
- On the right shift has Hilbert adjoint the left shift .
- For the multiplication operator on complex is bounded and .
- Let and be -finite measure spaces and let represent a class in . Then defines a bounded operator independently of the representatives of and , and its adjoint is .
Facts & Assumptions
The Hilbert adjoint of is the unique operator with (The Hilbert-space adjoint of a bounded operator).
carries the first-variable-linear pairing and is a Hilbert space; the complex pairing is with Cauchy–Schwarz (The standard inner products make K n, ell two and quotient L two Hilbert spaces, Complex completeness, density, and inner product: the consumer interface, Complex Lp classes and Euclidean test-function conventions).
For and the product lies in with (Complex Holder, Minkowski, and the quotient norm).
On a -finite product, Tonelli applies to nonnegative measurable functions and Fubini to functions, with the iterated integrals equal to the product integral (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product, Finite, sigma-finite, and semifinite measures).
Countable Choice is the hypothesis under which the adjoint and the completions are available (The Axiom of Countable Choice ()).
Verification
Given: The spaces and operators of the statement.
For the series in converge absolutely by Cauchy–Schwarz, so by uniqueness of the adjoint.
The multiplication operator satisfies by [A3], and for all , so is bounded with .
For put . Wherever the section integral converges absolutely, the Cauchy–Schwarz inequality in the -variable gives ; by Tonelli [A4] applied to the nonnegative -measurable function , the function is -measurable with , so and for -almost every . Hence is defined and finite for -almost every , and it is -measurable after zero extension: Tonelli [A4] makes the section integrals of the positive and negative parts of and -measurable, and on the conull set where the integral of is finite the real and imaginary parts of are differences of these measurable functions. Since almost everywhere and , the class of lies in with . Finally, if and almost everywhere, then the function is nonnegative and measurable with vanishing product integral, so for -almost every its section vanishes -almost everywhere by Tonelli [A4], that is, -almost everywhere.
For and the function lies in : with as in step 1.3, Tonelli and Cauchy–Schwarz in give . Hence Fubini [A4] applies and with ; applying the same estimate to the conjugate kernel , which also lies in with the same norm, gives , so is a bounded operator and is the Hilbert adjoint of .
Steps 1.1, 1.2 and 2.1 exhibit the three displayed adjoints, so the claimed formulas hold, under the countable-choice hypothesis recorded in [A5].
Sources
- Theo Bühler and Dietmar Salamon, Functional Analysis, Example 1.42, p.39 and §2.3.6
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Lectures 15–16 and 22–23
- Theo Bühler and Dietmar Salamon, Functional Analysis, §1.3.3, pp.38–41
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Definition 182 and Proposition 183
- Theo Bühler and Dietmar Salamon, Functional Analysis, §1.3.3 and §5.3.1
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Lectures 15–16
- Theo Bühler and Dietmar Salamon, Functional Analysis, §1.3.3, pp.39–41
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Theorem 178
- Theo Bühler and Dietmar Salamon, Functional Analysis, §1.3.3 and §2.3.6
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Lecture 16
- Theo Bühler and Dietmar Salamon, Functional Analysis, §1.3.3, p.39 and §2.3.6
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Lecture 15
- Theo Bühler and Dietmar Salamon, Functional Analysis, Theorem 1.44, pp.40–41
- Theo Bühler and Dietmar Salamon, Functional Analysis, §5.3.1 and Example 5.35 ff.
- Andrew Lin and Casey Rodriguez, MIT 18.102 Introduction to Functional Analysis, Example 186