Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

The Open Mapping Theorem

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 Lx=yLx = y 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 YY can jump to distant points in XX.

The quantitative content is that there is a uniform lower bound Bδ(0)L(B1(0))B_\delta(0) \subset L(B_1(0)) on how much volume survives. In the bijective case, δ=1/L1op\delta = 1/\|L^{-1}\|_{\mathrm{op}}. By the linearity of LL this extends to all open sets: LL maps every open set to an open set, i.e. LL 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 T:RnRmT : \mathbb{R}^n \to \mathbb{R}^m is automatically an open map. The argument is almost purely geometric:

  1. Surjectivity gives absorbing. The image T(B)T(B) of the open unit ball is convex, balanced (symmetric about 0), and absorbing: for every yRmy \in \mathbb{R}^m, some scalar multiple λy\lambda y lies in T(B)T(B). This follows immediately from surjectivity: given yy, pick xx with Tx=yTx = y, then y/x=T(x/x)T(B)y/\|x\| = T(x/\|x\|) \in T(B).

  2. Absorbing + convex + balanced     \implies nonempty interior (in finite dimensions). Pick a basis e1,,eme_1, \dots, e_m of Rm\mathbb{R}^m. Since T(B)T(B) is absorbing, for each ii there exists λi>0\lambda_i > 0 with λieiT(B)\lambda_i e_i \in T(B). By convexity and symmetry, T(B)T(B) contains the convex hull of {±λ1e1,,±λmem}\{\pm \lambda_1 e_1, \dots, \pm \lambda_m e_m\}. This is a cross-polytope (a “diamond”), a solid body in Rm\mathbb{R}^m with nonempty interior.

  3. Nonempty interior at the origin     \implies openness. Once T(B)T(B) contains an open ball around 0, linearity propagates this to all open sets: TT maps every open set to an open set.

The deeper reason this works is compactness of the unit ball (Heine–Borel). Compact \to continuous images are compact \to 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 λn0\lambda_n \to 0 can crush the image to a set with empty interior, even though every finite-dimensional projection still looks fine.

A concrete example

Let c00c_{00} be the space of real sequences with only finitely many nonzero terms, equipped with the sup-norm x=supkxk\|x\|_\infty = \sup_k |x_k|. As we saw in the Banach-Steinhaus discussion, c00c_{00} is not complete.

Define T:c00c00T : c_{00} \to c_{00} by

T({xn})={xnn}.T\left(\{x_n\}\right) = \left\{\frac{x_n}{n}\right\}.

This is bounded (Txx\|Tx\|_\infty \leq \|x\|_\infty). It compresses each coordinate direction by a different factor: the nn-th direction is scaled by λn=1/n\lambda_n = 1/n, so the compressions tend to zero as nn \to \infty.

Bijective on c00c_{00}: Injectivity is immediate: if Tx=0Tx = 0 then xn/n=0x_n/n = 0 for all nn, so x=0x = 0. For surjectivity, given yc00y \in c_{00}, set xn=nynx_n = ny_n. Since yy has finite support, so does xx, hence xc00x \in c_{00} and Tx=yTx = y.

Not open: For any ε>0\varepsilon > 0, the vector ε2ek\frac{\varepsilon}{2} e_k lies in Bε(0)B_\varepsilon(0). Its unique preimage under TT is kε2ek\frac{k\varepsilon}{2} e_k, which has norm kε/2k\varepsilon/2 \to \infty as kk \to \infty. So no matter how small ε\varepsilon is, Bε(0)B_\varepsilon(0) contains points whose preimages escape any fixed ball. Equivalently, T(B)T(B) is the set {yc00:yk<1/k}\{y \in c_{00} : |y_k| < 1/k\}, an “infinite-dimensional box” that gets narrower in each successive direction. No sup-norm ball fits inside it.

What happens on the completion? On c0c_0, the map TT is no longer surjective: y={1/n}c0y = \{1/n\} \in c_0 requires xn=1x_n = 1 for all nn, but the constant sequence {1,1,1,}c0\{1, 1, 1, \ldots\} \notin c_0. 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 CC such that every yy has a preimage xx with xCy\|x\| \leq C\|y\|. The Bounded Inverse Theorem sharpens this further when LL is also injective: the preimage is unique and xL1opy\|x\| \leq \|L^{-1}\|_{\mathrm{op}} \|y\|.

In finite dimensions, a bijective linear map is automatically invertible with a bounded inverse. In infinite dimensions this fails: the c00c_{00} counterexample above is a bounded bijection whose inverse is unbounded. “Invertible” should really mean stably invertible, i.e. L1L^{-1} 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 Lu=fLu = f has a solution. You need to know uCf\|u\| \leq C\|f\|, 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)     \iff (3): by the definition of surjectiveness.

(2)     \implies (1): If LL is open, then L(BX(0,1))L(B_X(0, 1)) is an open set in YY containing L(0)=0L(0) = 0. Thus there exists r>0r > 0 such that BY(0,r)L(BX(0,1))B_Y(0, r) \subset L(B_X(0, 1)). Now pick any yYy \in Y and any scalar t>0t > 0, we can use the linearity of LL in the following way, L(BX(0,t))=L(tBX(0,1))=tL(BX(0,1))L(B_X(0, t)) = L(t B_X(0, 1)) = t L(B_X(0, 1)).

Now since BY(0,r)L(BX(0,1))B_Y(0, r) \subset L(B_X(0, 1)) we also have that BY(0,tr)=tBY(0,r)L(BX(0,t))B_Y(0, tr) = t B_Y(0, r) \subset L(B_X(0, t)). Now set t=2y/rt = 2 ||y|| / r then yBY(0,2y)L(BX(0,2y/r))y \in B_Y(0, 2 ||y||) \subset L(B_X(0, 2 ||y||/r)), which means that there exists an xBX(0,2y/r)x \in B_X(0, 2||y||/r) such that Lx=yLx = y, further note that we have x<2y/r||x|| < 2||y|| / r.

(2)     \implies (4): If LL is open, then BY(0,r)L(BX(0,1))B_Y(0, r) \subset L(B_X(0, 1)) for some r>0r > 0. Pick yYy \in Y then y~:=yyr2BY(0,r)\tilde{y} := \frac{y}{||y||}\frac{r}{2} \in B_Y(0, r), so there exists zBX(0,1)z \in B_X(0, 1) such that Lz=y~Lz = \tilde{y}. Define x=2yrzx = \frac{2||y||}{r} z, which by linearity gives us Lx=yLx = y. Now since z<1||z|| < 1 we have x<2yr||x|| < \frac{2||y||}{r}. Now define C:=2rC := \frac{2}{r} and we have xCy||x|| \leq C ||y|| for any yYy \in Y.

(4)     \implies (2): Assume that for every yYy\in Y there exists xXx \in X such that Lx=yLx = y and uCy||u||\leq C||y||. We begin by showing that LL maps the unit ball to an open set. Let yYy \in Y with y<1C||y|| < \frac{1}{C}, then there exists xXx \in X such that Lx=yLx = y and x<Cy<1||x|| < C ||y|| < 1. This means that yL(BX(0,1))y \in L(B_X(0,1)). Thus we have shown that BY(0,1C)L(BX(0,1))B_Y(0, \frac{1}{C})\subset L(B_X(0, 1)), making L(BX(0,1))L(B_X(0, 1)) an open set. By linearity of LL this means that LL maps all open sets to open sets, therefore LL is open.

(4)     \implies (5): If it holds everywhere it will hold for a dense set.

(5)     \implies (4): Let EYE \subset Y be the dense set, and let yYy \in Y then want to approximate yy using elements in EE.

  • Step 1: Set the initial residual r0=yr_0 = y, then find y1Ey_1 \in E so that y1r0<ε=12y||y_1 - r_0|| < \varepsilon = \frac{1}{2} ||y||.

  • Step 2: Set the second residual r1=r0y1=yy1r_1 = r_0 - y_1 = y - y_1, and find y2Ey_2 \in E so that

y2r1<12r1<14y||y_2 - r_1|| < \frac{1}{2}||r_1|| < \frac{1}{4}||y||
  • Step 3: At the jj-the step we define rj=rj1yjr_j = r_{j-1} - y_j where yjEy_j \in E with

yjrj1<12rj1<2jy||y_j - r_{j-1}|| < \frac{1}{2} ||r_{j-1}|| < 2^{-j} ||y||

Note that the sequence of residuals has rj0||r_j|| \to 0 and thus rj0r_j \to 0, and note that yj=rj1rjy_j = r_{j-1} - r_j so if we sum the yjy_js we find a telescoping series i.e.

j=1yj=limNj=1Nrj1rj=r0limNrN=y.\sum_{j=1}^{\infty} y_j = \lim_{N \to \infty} \sum_{j=1}^{N} r_{j-1} - r_j = r_0 - \lim_{N\to\infty} r_N = y.

Finally we show that we can life the inequality from the dense set to everywhere. Since yjEy_j \in E we have there exists xj:Lxj=yjx_j : Lx_j = y_j with xjCyj||x_j|| \leq C ||y_j||. Then

yj=yj+rj1rj12jy+2(i1)y42iy.||y_j|| = ||y_j + r_{j-1} - r_{j-1}|| \leq 2^{-j} ||y|| + 2^{-(i-1)} ||y|| \leq 4 \cdot 2^{-i} ||y||.

Since yjEy_j\in E we have that

xjCyj4C2jy    j=1xj<4Cy.||x_j|| \leq C ||y_j|| \leq 4C \cdot 2^{-j} ||y|| \quad\implies\quad \sum_{j=1}^{\infty} ||x_j|| < 4C||y||.

Hence we can define x:=j=1xjx:= \sum_{j=1}^{\infty} x_j. Finally

Lx=L[j=1xj]=j=1Lxj=j=1yj=y.Lx = L[\sum_{j=1}^{\infty} x_j] = \sum_{j=1}^{\infty} Lx_j = \sum_{j=1}^{\infty} y_j = y.

Thus we have that Lx=yLx = y and similarly find that x4Cy||x|| \leq 4C ||y||.

(3)     \implies (4): The strategy is to apply the Theorem 1. Since by assumption yY\forall y \in Y there exists xXx \in X such that Lx=yLx = y the following EnE_n form a cover of YY.

En={yY:xny such that Lx=y} and nEn=Y.E_n = \{ y \in Y : ||x|| \leq n ||y||\ \mathrm{such\ that}\ Lx = y \}\ \mathrm{and}\ \bigcup_n E_n = Y.

Since YY is complete, Baire’s theorem implies that at least one of the EnE_n’s is not nowhere dense. Say EmE_m is the not nowhere dense set, meaning EmE_m is dense in some ball B(y0,r)B(y_0, r) i.e. EmB(y0,r)=B(y0,r)\overline{E_m \cap B(y_0, r)} = B(y_0, r). We take advantage of this twice to find solution approximations in EmE_m.

Construct approximate solution: Let ε>0\varepsilon > 0 then for any yB(y0,r)y\in B(y_0, r) there exists y^Em\hat{y} \in E_m such that yy^<ε||y - \hat{y}|| < \varepsilon, and there exists x^\hat{x} such that Lx^=y^L\hat{x} = \hat{y} with x^my^||\hat{x}|| \leq m ||\hat{y}|| and yLx^<ε||y - L\hat{x}|| < \varepsilon (in other words x^\hat{x} is solution approximation of Lx=yLx = y), and we have

x^my^m(ε+r+y0).||\hat{x}|| \leq m ||\hat{y}|| \leq m (\varepsilon + r + ||y_0||).

Map ball of right hand sides to the origin. Pick another yB(y0,r)y' \in B(y_0, r) then we can find another solution approximation x~\tilde{x} with the same properties above. Then note that yyB(0,2r)y - y' \in B(0, 2r) and that x=x^x~x = \hat{x} - \tilde{x} is a solution approximation with Lx(yy)<2ε||Lx - (y - y')|| < 2\varepsilon and x2n(y0+r+ε)||x|| \leq 2n(||y_0| + r + \varepsilon).

Scaling argument. Next pick any nonzero yYy \in Y, define λ=ry\lambda = \frac{r}{||y||} then λyB(0,2r)\lambda y \in B(0, 2r) and there is an approximate solution uXu' \in X. Define u=λuu = \lambda u' and pick ε=r/4\varepsilon = r / 4, then uu satisfies Luy<12y||Lu - y|| < \frac{1}{2} ||y|| and u<Ky||u|| < K ||y|| where K:=2n(5r/4+y0)/rK:= 2n(5r/4 + ||y_0||) / r a constant.

Iterate. Pick y0Yy_0 \in Y, find u1Xu_1 \in X by the previous step, then iterate by defining the residual y1=y0Lu1y_1 = y_0 - Lu_1, and solve for u2Xu_2 \in X such that Lu2y1<12y1||Lu_2 - y_1|| < \frac{1}{2}||y_1||. 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.

  1. The frequent dilations and translations in the above are allowed by linearity.

  2. 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.

  3. Completeness enters twice. Completeness of YY feeds Baire’s theorem: surjectivity gives Y=nT(nBX)Y = \bigcup_n \overline{T(nB_X)}, and Baire forces at least one of these closed sets to have nonempty interior, so T(BX)\overline{T(B_X)} contains a ball. Completeness of XX 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 c00c_{00} counterexample, each T(nB)={y:ykn/k}\overline{T(nB)} = \{y : |y_k| \leq n/k\} is nowhere dense (perturb the kk-th coordinate for large kk to escape), so c00c_{00} is covered by nowhere dense sets. Baire forbids this in a complete space, but c00c_{00} is incomplete, so the argument has no traction.

Remark 3 (Condition numbers)

In numerical linear algebra, the central quantity controlling stability of solving Lx=yLx = y is the condition number κ(L)=LL1\kappa(L) = \|L\| \cdot \|L^{-1}\|. If the right-hand side yy is perturbed by relative error ε\varepsilon, the solution can be perturbed by up to κ(L)ε\kappa(L) \cdot \varepsilon. For finite-dimensional invertible matrices, κ(A)<\kappa(A) < \infty automatically, and the whole game is about how large κ\kappa is. In infinite dimensions, the Bounded Inverse Theorem is what guarantees L1op<\|L^{-1}\|_{\mathrm{op}} < \infty (and hence κ(L)<\kappa(L) < \infty) 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 Lu=fLu = f by a sequence of finite-rank operators LnL_n and solve Lnun=fnL_n u_n = f_n, 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     \iff stability), and the Neumann series controls condition numbers of the discrete problems. We will return to these connections in the applications.

References
  1. 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/