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

Uniform Boundedness Principle

Research Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
383prerequisites beneath it
See this on the map →
Banach Spaces→→Open Mapping Theorem
functional-analysis

Core Idea

The uniform boundedness principle (Banach-Steinhaus) states that if a family of bounded linear operators {Tᵢ : X → Y} between Banach spaces is pointwise bounded, then the operators are uniformly bounded in norm. This powerful tool controls infinite families of operators.

Explainer

Imagine a family of linear operators {Tᵢ}. You observe that for every fixed vector x, the outputs Tᵢ(x) are bounded — no single input can be stretched arbitrarily far by any Tᵢ. The question is: does this pointwise control imply global control? Could the operator norms ‖Tᵢ‖ themselves be unbounded, with each operator Tᵢ having a very large norm, just not realized on the particular vector x you tested? The uniform boundedness principle (also called the Banach-Steinhaus theorem) answers: no. Pointwise boundedness forces uniform boundedness — there exists a single constant C such that ‖Tᵢ‖ ≤ C for all i.

This is a genuinely surprising fact. The hypothesis is weak: you only know that for each fixed x, the numbers {‖Tᵢ(x)‖} form a bounded set (depending on x). The conclusion is strong: there is one bound that works simultaneously for all operators and all unit vectors. The proof uses the Baire category theorem, a key property of complete metric spaces (Banach spaces are complete by definition). The completeness of X prevents the "bad" scenario where the operator norms blow up, because that blowup would require the input space to be covered by a countable union of closed nowhere-dense sets — which the Baire theorem forbids.

Why does this matter? The principle provides a powerful sanity check for infinite families of operators. In Fourier analysis, for instance, the partial sums Sₙ(f) of a Fourier series define a family of linear operators on function spaces. If these operators were pointwise bounded for every f, uniform boundedness would follow automatically. Conversely, the failure of uniform boundedness implies there must exist some input x (in fact a "generic" one in a Baire category sense) for which pointwise boundedness fails — the Fourier series diverges at that point. The theorem converts information about operator norms into information about function behavior.

The key role of completeness in the Banach space assumption should not be overlooked. If X were only a normed space (not complete), the theorem fails: you can construct pointwise bounded families whose norms are unbounded on an incomplete space. Completeness is the structural feature that forces the global bound to exist. This is typical of Banach space theory — the theorems are finely tuned to the complete setting, and the payoff for insisting on completeness is access to powerful tools like this one, the open mapping theorem, and the closed graph theorem.

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 → Uniform Boundedness Principle

Longest path: 80 steps · 383 total prerequisite topics

Prerequisites (1)

Leads To (1)