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

Open Mapping Theorem

Research Depth 83 in the knowledge graph I know this Set as goal
390prerequisites beneath it
See this on the map →
Banach SpacesClosed Graph Theorem+2 more
functional-analysis

Core Idea

The open mapping theorem states that a continuous surjective linear operator between Banach spaces is open (maps open sets to open sets). This deep result relies on the Baire category theorem and implies the bounded inverse theorem.

Explainer

An open mapping is a function that sends open sets to open sets. Continuous functions go in the other direction — they pull open sets back to open sets — so openness and continuity are distinct properties. For general nonlinear functions, there is no reason to expect both: a continuous function can easily collapse an open interval to a single point (not open). The open mapping theorem says that for continuous *linear* operators between *Banach spaces*, surjectivity alone forces the map to be open. This is a remarkable structural rigidity.

To see why this is surprising, consider the analogous finite-dimensional statement: a surjective linear map from ℝᵐ to ℝⁿ maps open sets to open sets. In finite dimensions this is almost obvious — a surjective linear map on finite-dimensional spaces has a right inverse (just pick a basis). But in infinite-dimensional Banach spaces, surjectivity does not automatically come with nice inverse properties, and "openness" is a much more delicate condition. The theorem says that completeness — the Banach space assumption — makes surjectivity strong enough to guarantee it.

The proof uses the Baire category theorem, which says a complete metric space cannot be written as a countable union of nowhere-dense sets. The argument runs roughly as follows: write the Banach space X as a union of scaled closed balls, apply T to get a union covering T(X) = Y, invoke the Baire category theorem to conclude that some image ball has nonempty interior, and then use linearity and the group structure to show the image of *every* ball around the origin has nonempty interior. This last step is the technical heart of the proof. Once you know T maps balls to sets with nonempty interior, you can show that T maps open sets to open sets.

The most important consequence is the bounded inverse theorem: if T: X → Y is a continuous bijective linear operator between Banach spaces, then T⁻¹ is also continuous. In other words, a continuous bijection between Banach spaces is automatically a homeomorphism. In finite dimensions, this is trivial — every linear bijection on ℝⁿ is a homeomorphism. But in infinite dimensions, it requires proof, and the open mapping theorem provides it. The bounded inverse theorem is the tool analysts use to conclude that two natural norms on the same space are equivalent whenever they define complete spaces.

The open mapping theorem also has a useful reformulation: T: X → Y is open if and only if there exists δ > 0 such that the open unit ball in Y is contained in the image of the open unit ball of X scaled by 1/δ. This "ball-covering" version is often the most practical way to verify openness in applications — you need to quantify how much T can shrink things, and surjectivity of a Banach space operator provides exactly that control.

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 SpacesBounded Linear OperatorsThe Operator NormDual Spaces and Bounded Linear FunctionalsHahn-Banach TheoremOpen Mapping Theorem

Longest path: 84 steps · 390 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.