advanced29 min studyLesson 781 in Mathematics

Normed spaces, completions and quotients

Track the chosen norm through completion and quotient constructions, including the closedness needed for a genuine quotient norm.

On this page

What you’ll understand

  • Distinguish completeness from finite-dimensional norm equivalence.
  • Identify the completion of finite sequences in two different norms.
  • Compute a quotient norm and explain why the subspace must be closed.

A norm measures the size of a vector without requiring an inner product. Completeness then asks whether this measurement recognizes all limits of Cauchy sequences already inside the space. Changing the norm can change those limits, so a completion belongs to a normed space rather than to its underlying algebraic vectors alone. Throughout this module, scalar fields are real or complex as stated, linear operators respect that field, and dual spaces consist of bounded linear functionals. Quotients provide a second construction whose analytic behavior depends critically on the topology of the subspace being removed.

Completeness is a statement about the chosen norm

A norm is positive definite, absolutely homogeneous and subadditive. It gives a translation-invariant metric by taking the norm of a difference. A Banach space is a normed space in which every Cauchy sequence converges in that norm. A closed linear subspace of a Banach space is Banach, while a dense proper subspace is incomplete in the inherited norm. Absolute convergence of a vector series, meaning summability of its term norms, guarantees convergence in a Banach space by the Cauchy criterion; without completeness the limit may be missing.

Two equivalent norms bound one another by fixed positive constants, so they give the same Cauchy sequences, topology and completeness. All norms on a fixed finite-dimensional space are equivalent, but the constants can depend on dimension. Infinite-dimensional analogues need not hold. On finitely supported sequences, the supremum norm is at most the summation norm, but no reverse constant works uniformly: a vector with its first N entries equal to one has supremum norm one and summation norm N. A formal similarity between two norm formulas therefore does not establish equivalent geometry.

c∥x∥a≤∥x∥b≤C∥x∥a(0<c≤C<∞),∑n∥xn∥<∞ ⟹ ∑nxn converges in a Banach spacec\|x\|_a\leq\|x\|_b\leq C\|x\|_a\quad(0<c\leq C<\infty),\qquad\sum_n\|x_n\|<\infty\ \Longrightarrow\ \sum_nx_n\text{ converges in a Banach space}
Equivalence uses constants independent of the vector. The series conclusion requires completeness of the ambient normed space.↔ Scroll wide equations horizontally.

Completion adds limits while preserving distances

A completion is a Banach space containing an isometric copy of the original normed space as a dense subspace. One constructs it from Cauchy sequences, identifying two sequences when their difference tends to zero. Addition and scalar multiplication pass to equivalence classes, and the limit of the original term norms defines the new norm. The original vector embeds as its constant sequence. Every completion is uniquely isometrically isomorphic to any other through a map fixing this embedded copy, so the construction does not depend on arbitrary choices of sequence representatives.

Let c₀₀ be the finitely supported scalar sequences. Its completion in the supremum norm is c₀, the sequences tending to zero, because truncation converges uniformly exactly when the tail supremum tends to zero. In the square-summation norm its completion is ℓ² instead. These spaces contain different vectors and have different duality behavior. A bounded linear map from a normed space into a Banach space extends uniquely to its completion by sending a Cauchy representative to the limit of its images; the operator norm remains unchanged.

Closed subspaces give Hausdorff quotient norms

For a linear subspace M of X, a coset x+M records all vectors differing from x by an element of M. Its natural size is the infimum of the norms of its representatives. This expression is always a seminorm, but it is a genuine norm precisely when M is closed. Otherwise a vector in the closure of M but outside M produces a nonzero coset of size zero. The correct normed quotient in that situation removes the closure instead. Infima need not be attained by a representative in a general Banach space.

If X is Banach and M is closed, the quotient is Banach. A useful proof takes a rapidly Cauchy subsequence of cosets and chooses representatives of successive differences with summable norms. Completeness of X sums these corrections, and the quotient map carries their limit to the desired quotient limit. This proof uses approximate minimizing representatives rather than a nearest-point projection. Orthogonal projection supplies extra structure in Hilbert spaces, but it should not be imported into arbitrary Banach quotients, where a closest representative can fail to exist.

∥x+M∥X/M=inf⁡m∈M∥x−m∥X,∥x+M∥X/M=0  ⟺  x∈M‾\|x+M\|_{X/M}=\inf_{m\in M}\|x-m\|_X,\qquad\|x+M\|_{X/M}=0\iff x\in\overline M
The seminorm distinguishes all cosets exactly when M is closed. If X is complete as well, this normed quotient is complete.↔ Scroll wide equations horizontally.

A diagonal quotient in a square norm

Equip R² with the supremum norm and quotient by M={(t,t):t∈R}. Find the norm of the coset of (a,b), then evaluate it at (3,−1).

  1. For every t, |a−b|≤|a−t|+|b−t|≤2 max(|a−t|,|b−t|). Thus every representative has supremum norm at least |a−b|/2.

  2. Taking t=(a+b)/2 makes the two absolute differences equal to |a−b|/2, so the lower bound is attained in this particular example.

  3. For (3,−1), choose t=1. The residual vector is (2,−2), of supremum norm two. The diagonal subspace is closed, so this is a genuine quotient norm.

The result

The quotient norm is |a−b|/2, and the requested coset has norm two. Attainment here follows from the explicit finite-dimensional calculation.

Explore the model

Interactive lab

Interactive lab · matrix

Equivalent finite-dimensional geometry

Pause and Reset, then set scale a=2,shear b=0. Predict singular values 2 and 1 and condition number 2. For a fresh comparison Reset and set a=1,b=0; predict both singular values and the condition number equal one. The matrix pulls a Euclidean norm into another equivalent norm on the same plane. Playback interpolates the geometry, while readouts describe the selected final matrix; this finite model cannot decide completeness of an infinite sequence space.

Equivalent finite-dimensional geometryThe 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 forA controlled change of finite-dimensional norm preserves completeness, but its comparison constants must still be tracked.

Check your understanding

When is the usual quotient seminorm on X/M a genuine norm?

Try it yourself

Let x⁽ᴺ⁾ have coordinates 2⁻ᵏ for 1≤k≤N and zero afterward. Identify its limit in the supremum and ℓ² completions of c₀₀, and compute both tail errors.

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

Give me a hint

The supremum error is the first omitted coordinate; the squared ℓ² error is a geometric tail starting at N+1.

Compare with the solution

Both completions contain the sequence x=(2⁻ᵏ)ₖ≥₁. The supremum error is 2⁻ᴺ⁻¹. The squared ℓ² error is the sum of 4⁻ᵏ for k>N, which equals 4⁻ᴺ/3, so the ℓ² error is 2⁻ᴺ/√3. The limit is absent from c₀₀ because it has infinitely many nonzero coordinates. Its membership in both completions does not identify those spaces: for example, (1/√k) lies in c₀ but not in ℓ².

Take it with you

  • Completeness depends on the specified norm.
  • A completion preserves distances and adds all Cauchy limits.
  • A quotient by a closed subspace is normed, and a Banach quotient is complete.

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.