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 83 in the knowledge graph ☐ I know this ☆ Set as goal
7topics build on this
387prerequisites beneath it
See this on the map →
Dual Spaces and Bounded Linear FunctionalsWeak Convergence→→Reflexive Spaces
convergence weak-topology

Core Idea

A sequence of functionals (fₙ) in X* converges weak* to f if fₙ(x) → f(x) for every x ∈ X. The weak* topology on X* enables compactness: the closed unit ball is weak* compact (Alaoglu's theorem).

Explainer

You now know two modes of convergence for sequences in a normed space: norm convergence (strong convergence), and weak convergence, where xₙ → x weakly if f(xₙ) → f(x) for every bounded linear functional f. Weak* convergence lives one level higher: instead of testing vectors against functionals, it tests functionals against vectors. A sequence (fₙ) in the dual space X* converges weak* to f if fₙ(x) → f(x) for every fixed x ∈ X. The "star" marks that the dual space X* is now the space being tested, and the original space X provides the test functions.

The distinction between weak and weak* convergence matters when X is not reflexive. Recall from your dual spaces prerequisite that the dual of X is X*, and the double dual is X. Weak convergence in X* means testing against elements of (X*)* = X — every functional on X*. Weak* convergence tests only against the elements of X sitting inside X via the canonical embedding. This is a strictly coarser topology when X is not reflexive: there are more weak* convergent sequences than weakly convergent ones in X*. In a reflexive space, X = X and the two topologies coincide.

Why does this weaker topology matter? Because it enables compactness. The Banach-Alaoglu theorem states that the closed unit ball in X* is compact in the weak* topology — for any normed space X. This is a profound statement because the unit ball in an infinite-dimensional space is never compact in the norm topology (Riesz's theorem). Weak* compactness rescues compactness arguments that would otherwise fail in infinite dimensions, and is the engine behind many existence proofs in analysis, PDEs, and optimization: extract a bounded sequence of approximate solutions, use Alaoglu to find a weak* convergent subnet or subsequence, then show the limit is an exact solution.

A concrete instance: in L^∞([0,1]), the dual of L¹, a bounded sequence of functions (gₙ) in L^∞ with ‖gₙ‖∞ ≤ 1 always has a weak* convergent subnet. Weak* convergence here means ∫gₙh → ∫gh for every h ∈ L¹. This limit g need not be pointwise limit, it need not converge in norm, but it exists and is bounded — which is enough for many applications. This "weak* limit extraction" technique appears throughout harmonic analysis, probability theory (as tightness and vague convergence of measures), and the calculus of variations.

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 → Weak* Convergence

Longest path: 84 steps · 387 total prerequisite topics

Prerequisites (2)

Leads To (1)