A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Orthonormal Bases in Hilbert Spaces

Research Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
428prerequisites beneath it
See this on the map →
Riesz Representation Theorem for Hilbert Spaces→→Bessel's Inequality and Parseval's Identity
hilbert-spaces orthonormal-bases

Core Idea

An orthonormal system {eᵢ}ᵢ∈ᴵ is orthonormal if ⟨eᵢ, eⱼ⟩ = δᵢⱼ. A maximal orthonormal system (orthonormal basis) has dense span in H. Every separable Hilbert space has a countable orthonormal basis.

Explainer

From finite-dimensional linear algebra, you know the power of an orthonormal basis: every vector can be written as a linear combination of basis vectors, and the coefficients are simply inner products with each basis element. In a Hilbert space — which may be infinite-dimensional — this idea extends, but "basis" now means an infinite collection of vectors and "linear combination" becomes an infinite series that converges in the norm of H.

A set {eᵢ}ᵢ∈ᴵ is an orthonormal system if ⟨eᵢ, eⱼ⟩ = δᵢⱼ — each vector has unit length and any two distinct vectors are perpendicular. An orthonormal system is an orthonormal basis (or complete orthonormal system) when it is *maximal*: no unit vector exists in H that is perpendicular to every element of the set. Equivalently, the span of {eᵢ} is dense in H — every element of H can be approximated arbitrarily well by finite linear combinations of basis elements, even if it cannot be written as a *finite* combination.

The expansion formula f = Σᵢ ⟨f, eᵢ⟩ eᵢ holds for every f ∈ H, where the coefficients ĉᵢ = ⟨f, eᵢ⟩ are the Fourier coefficients of f with respect to the basis. This is identical in form to coordinate representations in ℝⁿ, except the sum is infinite and its convergence is in the H-norm (not pointwise). The Riesz representation theorem, which you've already studied, is the key tool that makes this work: it guarantees that every continuous linear functional on H is realized as an inner product, and that structure underlies why the basis expansion recovers f exactly.

The statement that every separable Hilbert space has a *countable* orthonormal basis is proven in two steps: existence of a maximal orthonormal set (via Zorn's lemma) and countability (from separability — the space has a countable dense subset, so the basis cannot be uncountably large). L²([0,1]) is separable because trigonometric polynomials with rational coefficients are dense; its countable orthonormal basis is the Fourier basis {1, cos(2πnx), sin(2πnx) : n = 1, 2, 3, ...}. This is why Fourier analysis works: the Fourier basis is literally an orthonormal basis for L², and the Fourier expansion is the basis representation.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Metric Topology → Completeness in Metric Spaces → Banach Spaces → Hilbert Spaces → Orthogonality and Orthogonal Projections → Riesz Representation Theorem for Hilbert Spaces → Orthonormal Bases in Hilbert Spaces

Longest path: 83 steps · 428 total prerequisite topics

Prerequisites (1)

Leads To (1)