The open-mapping theorem is another of the big theorems of functional analysis. Its significance is that it equates qualitative solvability of a linear problem with quantitative solvability. We will begin by stating the qualitative version and explore its consequences on the solvability of linear operators, followed by the quantitative version.
Geometrically, openness means the image of every ball contains a ball: sets with interior keep their interior, nothing gets crushed to zero volume. A map that is not open flattens the unit ball into something with empty interior, and any attempt to invert such a map is necessarily discontinuous since small perturbations in can jump to distant points in .
The quantitative content is that there is a uniform lower bound on how much volume survives. In the bijective case, . By the linearity of this extends to all open sets: maps every open set to an open set, i.e. is an open mapping.
The previous statement is remarkable in the sense that it lifts our intuition about linear operators in finite dimensions (i.e. that bijectiveness is equivalent to invertibility) to the infinite dimensional case.
Remark 1
Normally, proving norm equivalence requires two inequalities. This corollary says that if both norms make the space complete, one inequality gives you the other for free. In particular, you cannot have two genuinely different Banach space topologies on the same space where one is strictly finer than the other: if a stronger norm and a weaker norm both give completeness, they must be equivalent.
Why Does the Open Mapping Theorem Need Completeness?¶
In finite dimensions the Open Mapping Theorem is almost trivial: compactness of the unit ball does all the work. In infinite dimensions compactness fails, and completeness must substitute via Baire’s category theorem. The details below make this precise.
The Finite-Dimensional Story
Every continuous linear surjection is automatically an open map. The argument is almost purely geometric:
Surjectivity gives absorbing. The image of the open unit ball is convex, balanced (symmetric about 0), and absorbing: for every , some scalar multiple lies in . This follows immediately from surjectivity: given , pick with , then .
Absorbing + convex + balanced nonempty interior (in finite dimensions). Pick a basis of . Since is absorbing, for each there exists with . By convexity and symmetry, contains the convex hull of . This is a cross-polytope (a “diamond”), a solid body in with nonempty interior.
Nonempty interior at the origin openness. Once contains an open ball around 0, linearity propagates this to all open sets: maps every open set to an open set.
The deeper reason this works is compactness of the unit ball (Heine–Borel). Compact continuous images are compact compact convex sets with the right spanning properties have interior. Everything closes cleanly because there are only finitely many directions to account for.
What Breaks in Infinite Dimensions
By Riesz’s lemma, the closed unit ball in an infinite-dimensional Banach space is never compact, destroying the finite-dimensional argument at its root. In finite dimensions, compressing finitely many coordinate directions by positive factors always leaves a solid body with nonempty interior; in infinite dimensions, compressions can crush the image to a set with empty interior, even though every finite-dimensional projection still looks fine.
A concrete example¶
Let be the space of real sequences with only finitely many nonzero terms, equipped with the sup-norm . As we saw in the Banach-Steinhaus discussion, is not complete.
Define by
This is bounded (). It compresses each coordinate direction by a different factor: the -th direction is scaled by , so the compressions tend to zero as .
Bijective on : Injectivity is immediate: if then for all , so . For surjectivity, given , set . Since has finite support, so does , hence and .
Not open: For any , the vector lies in . Its unique preimage under is , which has norm as . So no matter how small is, contains points whose preimages escape any fixed ball. Equivalently, is the set , an “infinite-dimensional box” that gets narrower in each successive direction. No sup-norm ball fits inside it.
What happens on the completion? On , the map is no longer surjective: requires for all , but the constant sequence . So surjectivity fails on the completion, and the OMT hypothesis is no longer met.
Quantitative Formulation¶
Surjectivity alone is qualitative: “solutions exist.” Openness adds quantitative content: “solutions exist with controlled norm,” i.e. there is a constant such that every has a preimage with . The Bounded Inverse Theorem sharpens this further when is also injective: the preimage is unique and .
In finite dimensions, a bijective linear map is automatically invertible with a bounded inverse. In infinite dimensions this fails: the counterexample above is a bounded bijection whose inverse is unbounded. “Invertible” should really mean stably invertible, i.e. is also bounded. The Open Mapping Theorem is the bridge: for Banach spaces, surjectivity + boundedness automatically yields openness, and openness + injectivity gives a bounded inverse. So the algebraic notion of invertibility (bijection) coincides with the analytic notion (bounded inverse), but only in the Banach space setting.
This is why the Open Mapping Theorem matters so much for PDEs: it is not enough to know has a solution. You need to know , that the solution depends continuously on the data. Open Mapping says surjectivity automatically gives you this stability, as long as you are working in Banach spaces.
Now to the version of the open-mapping theorem by T. Tao Tao (2009).
Proof:
(1) (3): by the definition of surjectiveness.
(2) (1): If is open, then is an open set in containing . Thus there exists such that . Now pick any and any scalar , we can use the linearity of in the following way, .
Now since we also have that . Now set then , which means that there exists an such that , further note that we have .
(2) (4): If is open, then for some . Pick then , so there exists such that . Define , which by linearity gives us . Now since we have . Now define and we have for any .
(4) (2): Assume that for every there exists such that and . We begin by showing that maps the unit ball to an open set. Let with , then there exists such that and . This means that . Thus we have shown that , making an open set. By linearity of this means that maps all open sets to open sets, therefore is open.
(4) (5): If it holds everywhere it will hold for a dense set.
(5) (4): Let be the dense set, and let then want to approximate using elements in .
Step 1: Set the initial residual , then find so that .
Step 2: Set the second residual , and find so that
Step 3: At the -the step we define where with
Note that the sequence of residuals has and thus , and note that so if we sum the s we find a telescoping series i.e.
Finally we show that we can life the inequality from the dense set to everywhere. Since we have there exists with . Then
Since we have that
Hence we can define . Finally
Thus we have that and similarly find that .
(3) (4): The strategy is to apply the Theorem 1. Since by assumption there exists such that the following form a cover of .
Since is complete, Baire’s theorem implies that at least one of the ’s is not nowhere dense. Say is the not nowhere dense set, meaning is dense in some ball i.e. . We take advantage of this twice to find solution approximations in .
Construct approximate solution: Let then for any there exists such that , and there exists such that with and (in other words is solution approximation of ), and we have
Map ball of right hand sides to the origin. Pick another then we can find another solution approximation with the same properties above. Then note that and that is a solution approximation with and .
Scaling argument. Next pick any nonzero , define then and there is an approximate solution . Define and pick , then satisfies and where a constant.
Iterate. Pick , find by the previous step, then iterate by defining the residual , and solve for such that . We again obtain a convergent series, and we can check similarly to before that its limit satisfies the required properties.
Remark 2
Make sure to take a close look at the proof of the open-mapping theorem. There are three key techniques on display: (1) linearity, (2) series approximations, and (3) the Baire category theorem.
The frequent dilations and translations in the above are allowed by linearity.
The series approximation technique has profound significance beyond proving results in functional analysis. Take a look at numerical methods such as gradient descent, conjugate gradient, or even Newton’s method. These are all examples of methods that construct solution approximations by constructing approximating series.
Completeness enters twice. Completeness of feeds Baire’s theorem: surjectivity gives , and Baire forces at least one of these closed sets to have nonempty interior, so contains a ball. Completeness of then promotes from the closure to the set itself: approximate preimages are assembled into a geometrically decreasing series whose partial sums are Cauchy, and completeness guarantees convergence to an exact preimage with controlled norm. In the counterexample, each is nowhere dense (perturb the -th coordinate for large to escape), so is covered by nowhere dense sets. Baire forbids this in a complete space, but is incomplete, so the argument has no traction.
Remark 3 (Condition numbers)
In numerical linear algebra, the central quantity controlling stability of solving is the condition number . If the right-hand side is perturbed by relative error , the solution can be perturbed by up to . For finite-dimensional invertible matrices, automatically, and the whole game is about how large is. In infinite dimensions, the Bounded Inverse Theorem is what guarantees (and hence ) at all. The Open Mapping Theorem is the qualitative floor beneath condition numbers: it says the problem is well-conditioned before you even start worrying about how well-conditioned it is.
This has far-reaching consequences for numerical methods. When we discretize by a sequence of finite-rank operators and solve , the Open Mapping Theorem guarantees well-posedness of the continuous problem, Banach-Steinhaus guarantees stability of convergent schemes (this is the content of the Lax equivalence theorem: convergence stability), and the Neumann series controls condition numbers of the discrete problems. We will return to these connections in the applications.
- Tao, T. (2009, February 1). 245B, Notes 9: The Baire category theorem and its Banach space consequences [Blog post]. https://terrytao.wordpress.com/2009/02/01/245b-notes-9-the-baire-category-theorem-and-its-banach-space-consequences/