When we study a linear operator T:X→Y, its kernel ker(T) captures
what T “forgets.” The quotient space X/ker(T) is the space that remains
after collapsing everything T cannot distinguish.
The canonical projectionπ:X→X/M defined by π(x)=[x] is a
surjective linear map with ker(π)=M.
The elements of X/M are the “cosets” or translates x+M. Two vectors x
and y represent the same coset precisely when x−y∈M — that is, when
they differ by something in M.
Let X=R3 and M={(x,y,0):x,y∈R} (the
xy-plane). Then X/M≅R: each coset is a horizontal plane at
height z, and the quotient map sends (x,y,z)↦z. All the
x- and y-information is “collapsed” — only the height survives.
Let f:R3→R be defined by f(x,y,z)=2x+3y−z.
Then ker(f)={2x+3y−z=0} is a plane through the origin. The cosets
of ker(f) are the level sets f−1(c)={2x+3y−z=c} — parallel
planes, each labeled by the value c. The quotient R3/ker(f) is
one-dimensional, reflecting the fact that f maps onto R.
If X is a Banach space and M⊂X is a closed subspace, then X/M is a
Banach space.
Proof 1
Let ([xn]) be a Cauchy sequence in X/M. Passing to a subsequence, we may
assume ∥[xn+1]−[xn]∥X/M<2−n. By definition of the infimum,
choose representatives: pick y1=x1, and for each n pick mn∈M such
that ∥xn+1−xn−mn∥<2−n. Define yn+1=xn+1−(m1+⋯+mn); then [yn]=[xn] and ∥yn+1−yn∥<2−n, so
(yn) is Cauchy in X. Since X is complete, yn→y for some y∈X.
Then [xn]=[yn]→[y] in X/M.
and k is the smallest number for which such a decomposition exists.
Codimension measures how many dimensions are “missing” from M. A
codimension-1 subspace is as large as possible while still being proper — it is
a hyperplane through the origin.
Example 3
In Rn:
A line through the origin has codimension n−1.
A plane through the origin in R3 has codimension 1.
defined by T([x])=Tx. This map is well-defined, linear,
injective, and surjective onto Range(T).
If X and Y are Banach spaces, T is bounded, and Range(T)
is closed, then T is a topological isomorphism (i.e., T
and T−1 are both bounded). This follows from the
Theorem 1 applied to the bijective bounded operator
T.
Proof 2
Well-defined: If [x1]=[x2], then x1−x2∈ker(T), so Tx1=Tx2.
Let f:X→R be a nonzero linear functional. Then
codim(ker(f))=1.
Proof 3
Since f is nonzero, there exists x0∈X with f(x0)=0. For any c∈R, we have f(cx0/f(x0))=c, so f is surjective. By the
first isomorphism theorem (Theorem 1),
The key insight: the codimension equals 1 because the target is
R, which is one-dimensional. The first isomorphism theorem tells us
that the quotient X/ker(f) is isomorphic to the range, and since f maps
onto all of R, the quotient is one-dimensional — regardless of
whether X itself is finite- or infinite-dimensional.