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

Orthogonality in Hilbert Spaces

Research Depth 80 in the knowledge graph I know this Set as goal
6topics build on this
426prerequisites beneath it
See this on the map →
Hilbert SpacesRiesz Representation Theorem (Hilbert)
hilbert-spaces geometry

Core Idea

Elements u, v are orthogonal if ⟨u, v⟩ = 0. The orthogonal complement M⊥ of a closed subspace M is always closed and satisfies H = M ⊕ M⊥, enabling orthogonal decompositions.

Explainer

In ℝ², two vectors are perpendicular when their dot product is zero: the x-axis and y-axis are orthogonal because (1,0)·(0,1) = 0. In a Hilbert space H, the exact same definition works in infinite dimensions: elements u and v are orthogonal if ⟨u, v⟩ = 0. This is not a metaphor — it is the literal extension of the geometric notion of perpendicularity. The inner product that defines the Hilbert space is what makes this generalization possible; in a mere Banach space, you have no inner product and hence no notion of angle.

Given a closed subspace M ⊆ H, the orthogonal complement M⊥ is the set of all elements in H that are orthogonal to every element of M: M⊥ = {v ∈ H : ⟨v, m⟩ = 0 for all m ∈ M}. Several structural facts hold. First, M⊥ is always a closed subspace, regardless of what M looks like — the condition ⟨v, m⟩ = 0 is preserved under limits because the inner product is continuous. Second, M and M⊥ have trivial intersection: the only vector orthogonal to itself is zero, since ⟨v, v⟩ = 0 implies ‖v‖ = 0. In finite dimensions, you already know this from linear algebra: the row space and null space of a matrix are orthogonal complements in ℝⁿ.

The central theorem is the orthogonal decomposition: if M is a closed subspace of H, then every element h ∈ H can be written uniquely as h = m + m⊥, where m ∈ M and m⊥ ∈ M⊥. This is written H = M ⊕ M⊥ (the direct sum). The element m is called the orthogonal projection of h onto M, and it is the closest point in M to h. This projection property is enormously useful: it gives you the best approximation of h from the subspace M, in the sense of minimizing the norm ‖h − m‖.

In L²[−π,π], Fourier series illustrate orthogonal decomposition concretely. The functions {1, cos(x), sin(x), cos(2x), sin(2x), ...} form an orthonormal basis — mutually orthogonal functions each with unit norm. Every square-integrable function decomposes uniquely into a sum of these basis elements, and each Fourier coefficient is the inner product of the function with the corresponding basis element. The decomposition theorem guarantees that this sum converges in L², making the abstract theorem the engine behind one of the most useful tools in applied mathematics.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesNeighborhoods and Open SetsOpen Sets in Topological SpacesBasis for a TopologyMetric TopologyCompleteness in Metric SpacesBanach SpacesHilbert SpacesOrthogonality in Hilbert Spaces

Longest path: 81 steps · 426 total prerequisite topics

Prerequisites (1)

Leads To (1)