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.
A Hilbert space with a dense sequence has a finite or countable orthonormal basis
Statement
Let be a real or complex Hilbert space, let be a sequence in whose range is dense in (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets), and let
Then is a finite or countably infinite orthonormal set whose closed linear span is ; that is, is an orthonormal basis of (Orthonormal families, complete orthonormal systems and Hilbert bases), and it is obtained from the given sequence by Gram–Schmidt elimination. The enumeration of is the canonical one by the stage at which an element appears, and no choice principle is used.
Facts & Assumptions
If is a finite orthonormal set in and , then is orthogonal to every element of ; if then has norm and is orthonormal (The finite Bessel inequality and best approximation by a finite orthonormal family, The induced length is a norm). Finite vector sums are independent of an enumeration because vector addition is a commutative monoid; the empty sum is zero (A finite sum in a commutative monoid indexed by an arbitrary finite set, Linear combination of a finite list, and the span as the smallest linear subspace containing ).
For a fixed function and initial state , recursion on produces the unique sequence with (The recursion theorem).
The span of a finite orthonormal set is a linear subspace, and with and (Linear subspace of a vector space, Linear combination of a finite list, and the span as the smallest linear subspace containing ).
An orthonormal set is complete when its closed linear span is ; and says (Orthonormal families, complete orthonormal systems and Hilbert bases, Real and complex inner-product spaces and their induced length).
The range of is dense in : its closure is (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).
Every subset of is at most countable, without choice, and an infinite subset has its canonical increasing enumeration (Every subset of an at most countable set is at most countable). A set in bijection with a finite or countably infinite set is itself finite or countably infinite (Finite, countably infinite, countable, uncountable).
Proof
Given: A dense sequence in the Hilbert space and the Gram–Schmidt sets defined by the displayed recursion.
To put the stage-dependent rule into the fixed-function form of [A2], let be the set of finite orthonormal subsets of , a subset of , and use the state space . Define , where is the displayed update computed from and the finite set . The sum exists by [A1]; in the nonzero residual branch its norm is positive and normalization is defined. The update is again finite and orthonormal by [A1], and in the zero branch it is . Thus is a total self-map of , and . Recursion from gives states and hence the required sets . By induction on , each is a finite orthonormal set with . Indeed is orthonormal, and if is finite and orthonormal then is orthogonal to every element of ; either and , or and is orthonormal.
and each difference has at most one element; hence the map assigning to every with its unique element is a bijection onto from the subset of : surjectivity follows from the union, and outputs at distinct stages are distinct because the sets are increasing and only new elements enter a difference. By [A6], and hence are finite or countably infinite. Ordering the stages increasingly gives the canonical enumeration, including the empty one when .
By induction on one has : for both sides are , and if with and , then , the case included.
Every lies in , so the span of contains the whole dense range of the sequence; hence its closure contains the closure of that range, which is , while it is itself contained in . Furthermore, any two elements of belong to one common , by taking the larger of their finite appearance stages; hence is orthonormal by step 1.1. Its closed linear span is therefore .
By steps 3.1 and 2.1 the set is a finite or countably infinite orthonormal set with closed linear span , that is, an orthonormal basis of obtained by Gram–Schmidt elimination from the given dense sequence, canonically enumerated by the stages at which its elements appear.
Depends on
- Orthonormal families, complete orthonormal systems and Hilbert bases
- The finite Bessel inequality and best approximation by a finite orthonormal family
- Hilbert space
- Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets
- Linear subspace of a vector space
- The recursion theorem
- Finite, countably infinite, countable, uncountable
- Real and complex inner-product spaces and their induced length
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- Every subset of an at most countable set is at most countable
- The induced length is a norm
Used by
Dependency tree · two levels
55 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
- Gerald Teschl, Topics in Real and Functional Analysis, version November 17, 2017 — §2.1, pp.49–50, Gram–Schmidt and Theorem 2.3 (standard reference, not scraped)
- Theo Bühler and Dietmar Salamon, Functional Analysis — Exercise 2.63, p.87 (standard reference, not scraped)