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

Weak Convergence

Research Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
8topics build on this
386prerequisites beneath it
See this on the map →
Dual Spaces and Bounded Linear Functionals→→Reflexive SpacesWeak* Convergence
convergence weak-topology

Core Idea

A sequence (xₙ) converges weakly to x if f(xₙ) → f(x) for every bounded linear functional f ∈ X*. Weak convergence is weaker than norm convergence but sufficient for many applications.

Explainer

In a finite-dimensional vector space, every kind of convergence is equivalent — a sequence converges if and only if each coordinate converges. In infinite-dimensional spaces, the situation is richer and more subtle. Norm convergence (also called strong convergence) requires ||xₙ - x|| → 0: the vectors get geometrically close. Weak convergence asks for something less: every bounded linear functional "sees" the sequence converging. If you probe the sequence with any continuous linear measurement, the measurements converge — but the vectors themselves need not be geometrically approaching x.

The definition makes precise use of the dual space X* you've studied. The dual space is the space of all bounded linear functionals f: X → ℝ (or ℂ). The sequence (xₙ) converges weakly to x, written xₙ ⇀ x, if for every f ∈ X*, the scalar sequence f(xₙ) → f(x) in ℝ. Every strongly convergent sequence converges weakly (by linearity and boundedness of f), but the converse fails in infinite dimensions. The canonical example in L²([0,1]): the sequence sin(nπt) converges weakly to 0 — every L² function's inner product with sin(nπt) tends to zero by the Riemann-Lebesgue lemma — yet ||sin(nπt)||₂ = 1/√2 for all n, so strong convergence fails completely.

The practical importance of weak convergence is that it often restores compactness. In finite dimensions, every bounded sequence has a convergent subsequence (Bolzano-Weierstrass). In infinite dimensions, this is spectacularly false for norm convergence — the unit sphere is not compact. But in a reflexive Banach space (the topic this builds toward), every bounded sequence has a weakly convergent subsequence. This is the infinite-dimensional substitute for Bolzano-Weierstrass, and it's indispensable in variational calculus and PDE theory: to find a minimum of a functional, you take a minimizing sequence, extract a weakly convergent subsequence, and show the limit is actually a minimizer.

The key intuition is that weak convergence is convergence "on average" or "as seen by every observer," where observers are bounded linear functionals. In L² this means integral convergence: ∫fₙg → ∫fg for every g ∈ L². The sequence can oscillate wildly (like sin(nπt)) while still converging weakly to zero, because the oscillations cancel out in every integral. Strong convergence demands the function approaches its limit pointwise in the L² sense; weak convergence only demands its correlations with every test function converge. The distinction separates what is geometrically close from what is merely "indistinguishable by measurement."

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 → Bounded Linear Operators → The Operator Norm → Dual Spaces and Bounded Linear Functionals → Weak Convergence

Longest path: 83 steps · 386 total prerequisite topics

Prerequisites (1)

Leads To (2)