advanced30 min studyLesson 783 in Mathematics

The uniform boundedness principle

Use completeness to turn pointwise bounds into one operator-norm bound, and see exactly how the conclusion fails on an incomplete domain.

On this page

What you’ll understand

  • State the uniform boundedness principle with the complete domain hypothesis.
  • Explain its Baire-category mechanism and a pointwise-limit consequence.
  • Construct an incomplete-domain family with bounded individual orbits and unbounded operator norms.

Pointwise boundedness lets the controlling constant depend on the input vector. Uniform operator boundedness asks for one constant valid on the entire unit ball and across the whole family. The uniform boundedness principle bridges that gap when the domain is Banach. This is not a finite-dimensional compactness argument and does not assume that the family is countable. Its proof uses the impossibility of covering a complete metric space by countably many closed sets with empty interior, making completeness a structural hypothesis rather than a technical convenience.

Pointwise bounds have different quantifiers

Let X be Banach, let Y be a normed space, and let a family of bounded linear maps Tᵢ:X→Y be indexed by an arbitrary set. If for every x the values ∥Tᵢx∥ are bounded uniformly in i, then the operator norms are bounded uniformly in i. Completeness is required of X; Y need not be complete for this conclusion. Each individual map must already be bounded. A family of discontinuous linear maps cannot be smuggled into the statement merely by observing some finite values at selected test vectors.

The distinction is between one bound for each fixed x and one bound multiplying ∥x∥ for all x. Testing finitely many vectors cannot establish pointwise boundedness on an infinite-dimensional space. Conversely, the conclusion does not promise that an operator of maximum norm exists in the family, or that the operators converge. It supplies a finite common bound. The same theorem can be applied to sequences, nets or uncountable families once the pointwise hypothesis is genuinely verified over the entire Banach domain.

[∀x∈X:sup⁡i∈I∥Tix∥<∞] ⟹ sup⁡i∈I∥Ti∥<∞(X Banach, Ti∈L(X,Y))\left[\forall x\in X:\sup_{i\in I}\|T_ix\|<\infty\right]\ \Longrightarrow\ \sup_{i\in I}\|T_i\|<\infty\qquad(X\text{ Banach},\ T_i\in\mathcal L(X,Y))
The hypothesis permits a different finite bound for each x. The conclusion yields one operator-norm bound for every map in the family.↔ Scroll wide equations horizontally.

Baire produces one useful ball

For each positive integer m, collect the vectors whose images under every operator have norm at most m. Each such set is closed, because every operator is continuous, and the pointwise hypothesis says these sets cover X. Baire’s theorem gives one set containing a nonempty open ball. Comparing the images of its center and a nearby point bounds the image of their difference. Linearity then rescales this local difference bound to the entire unit ball, producing the uniform operator estimate. The proof uses a countable cover even when the operator index set is uncountable.

One immediate consequence concerns pointwise limits. If bounded operators Tₙ from Banach X into Banach Y converge at every vector, their pointwise values are bounded; uniform boundedness gives a common operator bound. Taking limits proves that the pointwise limit is linear and bounded. The convergence need not be in operator norm. The target’s completeness is useful when one starts only with pointwise Cauchy images; if actual pointwise limits in Y are already given, the bounded-limit argument itself needs no additional completeness of Y.

Em=⋂i∈I{x:∥Tix∥≤m},X=⋃m≥1Em,Tnx→Tx ⟹ ∥Tx∥≤(sup⁡n∥Tn∥)∥x∥E_m=\bigcap_{i\in I}\{x:\|T_ix\|\leq m\},\quad X=\bigcup_{m\geq1}E_m,\qquad T_nx\to Tx\ \Longrightarrow\ \|Tx\|\leq\bigl(\sup_n\|T_n\|\bigr)\|x\|
The Baire step finds interior in one closed Eₘ. The final inequality proves continuity of an everywhere pointwise limit under the complete-domain hypothesis.↔ Scroll wide equations horizontally.

Weak bounds and missing completion points

A weakly bounded subset of a normed space is norm bounded. To see this, treat each vector x in the subset as its evaluation map on X*. The dual X* is Banach even when X is incomplete, and Hahn–Banach identifies the norm of this evaluation map with ∥x∥. Pointwise boundedness of these evaluation maps is exactly weak boundedness, so the theorem applies. In particular, a weakly convergent sequence is norm bounded, because every scalar convergent sequence of evaluations is bounded.

The complete-domain assumption cannot simply be deleted from the original operator statement. On finitely supported sequences with the supremum norm, the maps x↦nxₙ have norms n, yet for each input only finitely many values are nonzero. Completion adds vectors with infinitely many small coordinates, exposing the growth that every finite-support vector missed. This example also explains why an operator family can look harmless on a dense subspace and still fail the pointwise boundedness needed on its completion. Density alone does not replace a uniform norm estimate.

An incomplete domain hides growing coordinate tests

On c₀₀ with the supremum norm, define Tₙx=nxₙ. Compute ∥Tₙ∥, show pointwise boundedness, and test the corresponding family on xₙ=1/√n in the completion c₀.

  1. The estimate |nxₙ|≤n∥x∥∞ gives ∥Tₙ∥≤n, and the nth unit vector attains n, so ∥Tₙ∥=n.

  2. For each finite-support x, the values Tₙx vanish beyond its support. Thus their supremum is finite even though the family norms grow without bound. For x=(1,−1/2,1/3,0,...) the first three values are 1,−1,1 and the rest zero.

  3. The sequence xₙ=1/√n tends to zero and belongs to c₀. Its images are √n, which are unbounded, so the pointwise hypothesis fails on the completed space.

The result

The family is a concrete counterexample when the domain is incomplete. It does not contradict uniform boundedness on c₀, where its pointwise boundedness premise is false.

Explore the model

Interactive lab

Interactive lab · matrix

One test vector does not determine an operator bound

Pause and Reset, then set scale a=1,shear b=0; predict largest singular value one. For a fresh comparison Reset and set a=1,b=2; predict largest singular value 1+√2, although the image of (1,0) is still (1,0). The second input direction reveals growth missed by that one fixed test vector. The slider contains only a bounded finite-parameter family, so it cannot demonstrate an unbounded Banach-space operator family. Readouts describe the selected final matrix throughout playback.

One test vector does not determine an operator boundThe selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Current readings: Area scale · det A: 1.4; Singular values · σmax, σmin: 1.597, 0.876; Condition number · κ₂(A): 1.823. All parameters are adjustable with the labeled controls below.Matrix A with first row 1.4, 0.6 and second row zero, one; display interpolates between identity and A while final determinant remains 1.4.−4−2024−2−1012x · equal geometric scaleyA = [ 1.4 0.6 ; 0 1 ]Display blend: 0% · final values below
Interpolated geometryOriginal unit squareSelected final transform
Area scale · det A
1.4
Singular values · σmax, σmin
1.597, 0.876
Condition number · κ₂(A)
1.823
t = 0 s

The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forPointwise testing and an operator-norm bound quantify over different collections of vectors.

Check your understanding

Which completeness assumption is essential in the uniform boundedness principle as stated?

Try it yourself

On ℓ², let fₙ(x)=xₙ. Prove that these functionals converge pointwise to zero and have uniformly bounded norms, but do not converge to zero in operator norm.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Square summability forces coordinates to vanish; test fₙ on its own coordinate unit vector to find its norm.

Compare with the solution

For each x in ℓ², its coordinates tend to zero, since otherwise infinitely many squared coordinates would exceed a fixed positive amount. Hence fₙ(x)→0. Cauchy–Schwarz gives |xₙ|≤∥x∥₂, while fₙ(eₙ)=1, so every functional has norm one. The pointwise limit is the bounded zero functional, consistent with uniform boundedness, but ∥fₙ−0∥=1 never tends to zero. Pointwise operator convergence is weaker than operator-norm convergence.

Take it with you

  • Uniform boundedness converts all pointwise bounds into one operator bound on a Banach domain.
  • Its proof uses a Baire-category ball and linear rescaling.
  • An everywhere pointwise limit can be bounded without convergence in operator norm.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.