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.

Quotient Spaces and Codimension

When we study a linear operator T:XYT : X \to Y, its kernel ker(T)\ker(T) captures what TT “forgets.” The quotient space X/ker(T)X / \ker(T) is the space that remains after collapsing everything TT cannot distinguish.

Quotient Spaces

Definition 1 (Quotient space)

Let XX be a vector space and MXM \subset X a subspace. The quotient space X/MX / M is the set of equivalence classes

[x]=x+M={x+m:mM}[x] = x + M = \{x + m : m \in M\}

under the equivalence relation xy    xyMx \sim y \iff x - y \in M. This is a vector space with operations

[x]+[y]=[x+y],λ[x]=[λx].[x] + [y] = [x + y], \qquad \lambda [x] = [\lambda x].

The canonical projection π:XX/M\pi : X \to X/M defined by π(x)=[x]\pi(x) = [x] is a surjective linear map with ker(π)=M\ker(\pi) = M.

The elements of X/MX/M are the “cosets” or translates x+Mx + M. Two vectors xx and yy represent the same coset precisely when xyMx - y \in M — that is, when they differ by something in MM.

Example 1 (Quotient in R3\mathbb{R}^3)

Let X=R3X = \mathbb{R}^3 and M={(x,y,0):x,yR}M = \{(x,y,0) : x, y \in \mathbb{R}\} (the xyxy-plane). Then X/MRX/M \cong \mathbb{R}: each coset is a horizontal plane at height zz, and the quotient map sends (x,y,z)z(x,y,z) \mapsto z. All the xx- and yy-information is “collapsed” — only the height survives.

Example 2 (Quotient by a kernel)

Let f:R3Rf : \mathbb{R}^3 \to \mathbb{R} be defined by f(x,y,z)=2x+3yzf(x,y,z) = 2x + 3y - z. Then ker(f)={2x+3yz=0}\ker(f) = \{2x + 3y - z = 0\} is a plane through the origin. The cosets of ker(f)\ker(f) are the level sets f1(c)={2x+3yz=c}f^{-1}(c) = \{2x + 3y - z = c\} — parallel planes, each labeled by the value cc. The quotient R3/ker(f)\mathbb{R}^3 / \ker(f) is one-dimensional, reflecting the fact that ff maps onto R\mathbb{R}.

The quotient norm

When XX is a normed space and MM is a closed subspace, the quotient inherits a natural norm.

Definition 2 (Quotient norm)

Let XX be a normed space and MXM \subset X a closed subspace. The quotient norm on X/MX/M is

[x]X/M=infmMxm=dist(x,M).\|[x]\|_{X/M} = \inf_{m \in M} \|x - m\| = \operatorname{dist}(x, M).

The closedness of MM ensures this is a genuine norm (not just a seminorm): if [x]X/M=0\|[x]\|_{X/M} = 0, then dist(x,M)=0\operatorname{dist}(x, M) = 0, so xM=Mx \in \overline{M} = M, hence [x]=[0][x] = [0].

If XX is a Banach space and MXM \subset X is a closed subspace, then X/MX/M is a Banach space.

Proof 1

Let ([xn])([x_n]) be a Cauchy sequence in X/MX/M. Passing to a subsequence, we may assume [xn+1][xn]X/M<2n\|[x_{n+1}] - [x_n]\|_{X/M} < 2^{-n}. By definition of the infimum, choose representatives: pick y1=x1y_1 = x_1, and for each nn pick mnMm_n \in M such that xn+1xnmn<2n\|x_{n+1} - x_n - m_n\| < 2^{-n}. Define yn+1=xn+1(m1++mn)y_{n+1} = x_{n+1} - (m_1 + \cdots + m_n); then [yn]=[xn][y_n] = [x_n] and yn+1yn<2n\|y_{n+1} - y_n\| < 2^{-n}, so (yn)(y_n) is Cauchy in XX. Since XX is complete, ynyy_n \to y for some yXy \in X. Then [xn]=[yn][y][x_n] = [y_n] \to [y] in X/MX/M.

Codimension

Definition 3 (Codimension)

Let MM be a subspace of a vector space XX. The codimension of MM in XX is

codim(M)=dim(X/M).\operatorname{codim}(M) = \dim(X / M).

Equivalently, codim(M)=k\operatorname{codim}(M) = k means there exist vectors e1,,ekXe_1, \ldots, e_k \in X such that

X=Mspan(e1,,ek),X = M \oplus \operatorname{span}(e_1, \ldots, e_k),

and kk is the smallest number for which such a decomposition exists.

Codimension measures how many dimensions are “missing” from MM. A codimension-1 subspace is as large as possible while still being proper — it is a hyperplane through the origin.

Example 3

In Rn\mathbb{R}^n:

  • A line through the origin has codimension n1n - 1.

  • A plane through the origin in R3\mathbb{R}^3 has codimension 1.

  • The subspace {0}\{0\} has codimension nn.

The First Isomorphism Theorem

Theorem 1 (First Isomorphism Theorem)

Let T:XYT : X \to Y be a linear map. Then TT induces an isomorphism

T~:X/ker(T)    Range(T)\widetilde{T} : X / \ker(T) \xrightarrow{\;\cong\;} \operatorname{Range}(T)

defined by T~([x])=Tx\widetilde{T}([x]) = Tx. This map is well-defined, linear, injective, and surjective onto Range(T)\operatorname{Range}(T).

If XX and YY are Banach spaces, TT is bounded, and Range(T)\operatorname{Range}(T) is closed, then T~\widetilde{T} is a topological isomorphism (i.e., T~\widetilde{T} and T~1\widetilde{T}^{-1} are both bounded). This follows from the Theorem 1 applied to the bijective bounded operator T~\widetilde{T}.

Proof 2

Well-defined: If [x1]=[x2][x_1] = [x_2], then x1x2ker(T)x_1 - x_2 \in \ker(T), so Tx1=Tx2Tx_1 = Tx_2.

Linear: T~(α[x]+β[y])=T~([αx+βy])=T(αx+βy)=αTx+βTy=αT~([x])+βT~([y])\widetilde{T}(\alpha[x] + \beta[y]) = \widetilde{T}([\alpha x + \beta y]) = T(\alpha x + \beta y) = \alpha Tx + \beta Ty = \alpha \widetilde{T}([x]) + \beta \widetilde{T}([y]).

Injective: T~([x])=0    Tx=0    xker(T)    [x]=[0]\widetilde{T}([x]) = 0 \implies Tx = 0 \implies x \in \ker(T) \implies [x] = [0].

Surjective onto Range(T)\operatorname{Range}(T): For any y=TxRange(T)y = Tx \in \operatorname{Range}(T), we have T~([x])=y\widetilde{T}([x]) = y.

Bounded (when TT is bounded): For any mker(T)m \in \ker(T), Tx=T(xm)Txm\|Tx\| = \|T(x-m)\| \leq \|T\|\|x - m\|. Taking the infimum over mm: T~([x])T[x]\|\widetilde{T}([x])\| \leq \|T\| \, \|[x]\|. So T~T\|\widetilde{T}\| \leq \|T\|.

The first isomorphism theorem immediately answers the question: why does a nonzero linear functional have a codimension-1 kernel?

Let f:XRf : X \to \mathbb{R} be a nonzero linear functional. Then codim(ker(f))=1\operatorname{codim}(\ker(f)) = 1.

Proof 3

Since ff is nonzero, there exists x0Xx_0 \in X with f(x0)0f(x_0) \neq 0. For any cRc \in \mathbb{R}, we have f(cx0/f(x0))=cf(cx_0 / f(x_0)) = c, so ff is surjective. By the first isomorphism theorem (Theorem 1),

X/ker(f)Range(f)=R.X / \ker(f) \cong \operatorname{Range}(f) = \mathbb{R}.

Therefore codim(ker(f))=dim(X/ker(f))=dim(R)=1\operatorname{codim}(\ker(f)) = \dim(X / \ker(f)) = \dim(\mathbb{R}) = 1.

The key insight: the codimension equals 1 because the target is R\mathbb{R}, which is one-dimensional. The first isomorphism theorem tells us that the quotient X/ker(f)X / \ker(f) is isomorphic to the range, and since ff maps onto all of R\mathbb{R}, the quotient is one-dimensional — regardless of whether XX itself is finite- or infinite-dimensional.