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

Bounded Linear Operators

Research Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
57topics build on this
383prerequisites beneath it
See this on the map →
Banach SpacesVector Spaces→→Compact OperatorsLinear Functionals and Dual Spaces+2 more
functional-analysis operators

Core Idea

A linear operator T: X → Y between normed spaces is bounded if ‖T(x)‖_X ≤ C‖x‖_X for all x, or equivalently if T maps the unit ball to a bounded set. Bounded operators are continuous and form a natural subclass of linear maps.

Explainer

In finite-dimensional spaces, every linear map is automatically continuous — this is a theorem you may have encountered. But once you move to infinite-dimensional Banach spaces, linearity no longer guarantees continuity. You can construct linear maps that send a sequence of vectors with bounded norms to a sequence with unbounded output norms. A bounded linear operator is a linear map that rules out this pathology by imposing an explicit norm control: there exists a constant C such that ‖T(x)‖ ≤ C‖x‖ for every input x.

The condition ‖T(x)‖ ≤ C‖x‖ has an elegant geometric reading: T cannot stretch vectors by more than a factor of C. Equivalently, the image of the unit ball {x : ‖x‖ ≤ 1} is contained in a ball of radius C in the output space. This is precisely why bounded operators are continuous: if xₙ → x (i.e., ‖xₙ − x‖ → 0), then ‖T(xₙ) − T(x)‖ = ‖T(xₙ − x)‖ ≤ C‖xₙ − x‖ → 0. Continuity follows immediately from the norm bound — the two conditions are equivalent for linear maps.

The operator norm ‖T‖ = sup{‖T(x)‖ : ‖x‖ ≤ 1} captures the sharpest such constant C, the maximum stretch factor over all unit vectors. The space of all bounded linear operators from X to Y, written B(X, Y), inherits a norm from this definition. When Y = X, B(X, X) is not just a normed space but a Banach algebra — operators can be composed, and the operator norm satisfies ‖ST‖ ≤ ‖S‖‖T‖. This algebraic structure is the foundation for spectral theory, where you study how operators act like generalized scalars.

From your study of Banach spaces, you know completeness is what separates "nice" infinite-dimensional spaces from poorly behaved ones. Boundedness of operators reflects the same philosophy: it is the right finiteness condition for linear maps between Banach spaces. Unbounded operators do appear in mathematics — notably as differential operators in quantum mechanics — but they require careful domain restrictions and substantially more technical machinery. In functional analysis, bounded operators are the default setting, the controlled regime where the theory runs smoothly.

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

Longest path: 80 steps · 383 total prerequisite topics

Prerequisites (2)

Leads To (4)