Skip to content

Chapter 27. Quotient Spaces

A quotient space is a vector space obtained by identifying all vectors that differ by a vector in a fixed subspace. If UU is a subspace of VV, then the quotient space is written

V/U. V/U.

It is read as “VV modulo UU” or “VV by UU.” Informally, the construction collapses the whole subspace UU to zero and keeps track of what remains outside UU. More formally, its elements are equivalence classes, also called cosets, of the form v+Uv+U.

27.1 The Basic Idea

Let VV be a vector space over a field FF, and let UVU\subseteq V be a subspace.

Two vectors v,wVv,w\in V are regarded as equivalent modulo UU when their difference lies in UU:

vwvwU. v \sim w \quad\Longleftrightarrow\quad v-w\in U.

This means that vv and ww are considered the same after we ignore all movement inside UU.

The quotient space V/UV/U is the set of all equivalence classes under this relation.

27.2 Cosets

The equivalence class of a vector vVv\in V is

[v]={wV:wvU}. [v]=\{w\in V : w-v\in U\}.

This class is more commonly written as

v+U. v+U.

Thus

v+U={v+u:uU}. v+U=\{v+u:u\in U\}.

The set v+Uv+U is called a coset of UU in VV.

If vUv\in U, then

v+U=U. v+U=U.

So every vector in UU belongs to the same coset as 00. In the quotient space, all vectors of UU become the zero element.

27.3 The Quotient Space

The quotient space is

V/U={v+U:vV}. V/U=\{v+U:v\in V\}.

Its elements are not individual vectors of VV. Its elements are cosets.

This distinction is important. A vector vv belongs to VV. A coset v+Uv+U belongs to V/UV/U.

The zero vector of V/UV/U is

0+U=U. 0+U=U.

Thus the subspace UU itself becomes the zero element in the quotient.

27.4 Equality of Cosets

Two cosets are equal exactly when their representatives differ by an element of UU:

v+U=w+UvwU. v+U=w+U \quad\Longleftrightarrow\quad v-w\in U.

This gives the practical test for equality in a quotient space.

For example, if

V=R2 V=\mathbb{R}^2

and

U=span([10]), U=\operatorname{span} \left( \begin{bmatrix} 1\\ 0 \end{bmatrix} \right),

then two vectors

[ab],[cd] \begin{bmatrix} a\\ b \end{bmatrix}, \qquad \begin{bmatrix} c\\ d \end{bmatrix}

belong to the same coset if their difference lies in UU. That means

[acbd]U. \begin{bmatrix} a-c\\ b-d \end{bmatrix} \in U.

This happens exactly when

b=d. b=d.

So in R2/U\mathbb{R}^2/U, only the second coordinate remains relevant.

27.5 Operations on Cosets

Addition in the quotient space is defined by

(v+U)+(w+U)=(v+w)+U. (v+U)+(w+U)=(v+w)+U.

Scalar multiplication is defined by

c(v+U)=cv+U. c(v+U)=cv+U.

These definitions are natural: choose representatives, perform the operation in VV, then take the resulting coset.

The operations are well-defined because changing representatives by elements of UU does not change the final coset. This relies on UU being a subspace.

27.6 Well-Defined Addition

We must check that the definition of addition does not depend on the chosen representatives.

Suppose

v+U=v+U v+U=v'+U

and

w+U=w+U. w+U=w'+U.

Then

vvU,wwU. v-v'\in U, \qquad w-w'\in U.

Since UU is closed under addition,

(v+w)(v+w)=(vv)+(ww)U. (v+w)-(v'+w')=(v-v')+(w-w')\in U.

Therefore

(v+w)+U=(v+w)+U. (v+w)+U=(v'+w')+U.

So addition is well-defined.

27.7 Well-Defined Scalar Multiplication

Suppose

v+U=v+U. v+U=v'+U.

Then

vvU. v-v'\in U.

For any scalar cc,

cvcv=c(vv)U, cv-cv'=c(v-v')\in U,

because UU is closed under scalar multiplication.

Therefore

cv+U=cv+U. cv+U=cv'+U.

So scalar multiplication is well-defined.

27.8 Vector Space Structure

With the operations

(v+U)+(w+U)=(v+w)+U (v+U)+(w+U)=(v+w)+U

and

c(v+U)=cv+U, c(v+U)=cv+U,

the quotient V/UV/U is a vector space over FF.

Its zero element is

U. U.

The additive inverse of v+Uv+U is

(v)+U. (-v)+U.

Indeed,

(v+U)+((v)+U)=0+U=U. (v+U)+((-v)+U)=0+U=U.

The vector space axioms follow from the corresponding axioms in VV.

27.9 Geometric Picture in R2\mathbb{R}^2

Let

V=R2 V=\mathbb{R}^2

and let

U=span([10]). U=\operatorname{span} \left( \begin{bmatrix} 1\\ 0 \end{bmatrix} \right).

Then UU is the xx-axis.

For a vector

v=[ab], v= \begin{bmatrix} a\\ b \end{bmatrix},

the coset v+Uv+U is

{[a+tb]:tR}. \left\{ \begin{bmatrix} a+t\\ b \end{bmatrix} :t\in\mathbb{R} \right\}.

This is the horizontal line through height bb.

Thus R2/U\mathbb{R}^2/U can be viewed as the set of all horizontal lines. Each horizontal line is one element of the quotient space. Since only the height bb matters, this quotient is naturally isomorphic to R\mathbb{R}.

27.10 Geometric Picture in R3\mathbb{R}^3

Let

V=R3 V=\mathbb{R}^3

and let

U=span([100],[010]). U=\operatorname{span} \left( \begin{bmatrix} 1\\ 0\\ 0 \end{bmatrix}, \begin{bmatrix} 0\\ 1\\ 0 \end{bmatrix} \right).

Then UU is the xyxy-plane.

For

v=[abc], v= \begin{bmatrix} a\\ b\\ c \end{bmatrix},

the coset v+Uv+U is

{[a+sb+tc]:s,tR}. \left\{ \begin{bmatrix} a+s\\ b+t\\ c \end{bmatrix} :s,t\in\mathbb{R} \right\}.

This is the horizontal plane at height cc.

Therefore R3/U\mathbb{R}^3/U can be identified with the remaining coordinate cc. Hence

R3/UR. \mathbb{R}^3/U \cong \mathbb{R}.

The quotient collapses the entire xyxy-plane direction and keeps only the vertical direction.

27.11 Quotient by a Coordinate Subspace

Let

V=Rn V=\mathbb{R}^n

and let

U=span(e1,,em). U=\operatorname{span}(e_1,\ldots,e_m).

Then UU consists of all vectors whose last nmn-m coordinates are zero.

Two vectors in Rn\mathbb{R}^n are equivalent modulo UU exactly when their last nmn-m coordinates agree.

Thus

Rn/URnm. \mathbb{R}^n/U \cong \mathbb{R}^{n-m}.

The quotient removes the first mm coordinate directions and preserves the remaining nmn-m directions.

27.12 Dimension of a Quotient Space

If VV is finite-dimensional and UU is a subspace of VV, then

dim(V/U)=dimVdimU. \dim(V/U)=\dim V-\dim U.

This number is called the codimension of UU in VV:

codim(U)=dim(V/U). \operatorname{codim}(U)=\dim(V/U).

For example, if

dimV=5 \dim V=5

and

dimU=2, \dim U=2,

then

dim(V/U)=3. \dim(V/U)=3.

The quotient keeps the directions not already accounted for by UU.

27.13 Proof of the Dimension Formula

Let

dimU=k. \dim U=k.

Choose a basis of UU:

u1,,uk. u_1,\ldots,u_k.

Extend it to a basis of VV:

u1,,uk,v1,,vr. u_1,\ldots,u_k,v_1,\ldots,v_r.

Then

dimV=k+r. \dim V=k+r.

We claim that

v1+U,,vr+U v_1+U,\ldots,v_r+U

form a basis of V/UV/U.

First, they span V/UV/U. Any vector vVv\in V can be written as

v=a1u1++akuk+b1v1++brvr. v=a_1u_1+\cdots+a_ku_k+b_1v_1+\cdots+b_rv_r.

In the quotient, the terms from UU vanish:

v+U=b1(v1+U)++br(vr+U). v+U=b_1(v_1+U)+\cdots+b_r(v_r+U).

Second, they are linearly independent. If

b1(v1+U)++br(vr+U)=U, b_1(v_1+U)+\cdots+b_r(v_r+U)=U,

then

b1v1++brvrU. b_1v_1+\cdots+b_rv_r\in U.

So

b1v1++brvr=a1u1++akuk b_1v_1+\cdots+b_rv_r = a_1u_1+\cdots+a_ku_k

for some scalars aia_i. This gives a linear relation among the basis vectors of VV. Hence all coefficients are zero, in particular

b1==br=0. b_1=\cdots=b_r=0.

Therefore

dim(V/U)=r=dimVdimU. \dim(V/U)=r=\dim V-\dim U.

27.14 The Quotient Map

There is a natural linear map

π:VV/U \pi:V\to V/U

defined by

π(v)=v+U. \pi(v)=v+U.

This is called the quotient map or canonical projection.

It is linear because

π(v+w)=(v+w)+U=(v+U)+(w+U), \pi(v+w)=(v+w)+U=(v+U)+(w+U),

and

π(cv)=cv+U=c(v+U). \pi(cv)=cv+U=c(v+U).

It is surjective because every element of V/UV/U has the form v+Uv+U.

27.15 Kernel of the Quotient Map

The kernel of the quotient map

π:VV/U \pi:V\to V/U

is exactly UU.

Indeed,

kerπ={vV:π(v)=U}. \ker \pi=\{v\in V:\pi(v)=U\}.

But

π(v)=U \pi(v)=U

means

v+U=0+U. v+U=0+U.

This holds exactly when

vU. v\in U.

Therefore

kerπ=U. \ker \pi=U.

So quotienting by UU is precisely the operation of making UU into the zero subspace.

27.16 Quotients and Linear Maps

Let

T:VW T:V\to W

be a linear map.

If UkerTU\subseteq \ker T, then TT is constant on each coset of UU. That is, if

v+U=w+U, v+U=w+U,

then

vwUkerT, v-w\in U\subseteq \ker T,

so

T(vw)=0. T(v-w)=0.

Therefore

T(v)=T(w). T(v)=T(w).

This means TT descends to a well-defined map on the quotient:

T:V/UW \overline{T}:V/U\to W

given by

T(v+U)=T(v). \overline{T}(v+U)=T(v).

The quotient space is designed exactly to support this kind of construction.

27.17 First Isomorphism Theorem

Let

T:VW T:V\to W

be a linear map. Then

V/kerTIm(T). V/\ker T \cong \operatorname{Im}(T).

The isomorphism is

T:V/kerTIm(T) \overline{T}:V/\ker T\to \operatorname{Im}(T)

defined by

T(v+kerT)=T(v). \overline{T}(v+\ker T)=T(v).

This is well-defined, linear, one-to-one, and onto.

This theorem says that after collapsing exactly the vectors killed by TT, what remains is the image of TT.

27.18 Example: Projection onto One Coordinate

Define

T:R2R T:\mathbb{R}^2\to\mathbb{R}

by

T(x,y)=y. T(x,y)=y.

The kernel is

kerT={(x,0):xR}, \ker T=\{(x,0):x\in\mathbb{R}\},

the xx-axis.

The image is all of R\mathbb{R}.

By the first isomorphism theorem,

R2/kerTR. \mathbb{R}^2/\ker T \cong \mathbb{R}.

This matches the geometric picture: quotienting R2\mathbb{R}^2 by the xx-axis leaves only height.

27.19 Quotients and Direct Sums

Suppose

V=UW. V=U\oplus W.

Then every vector vVv\in V can be written uniquely as

v=u+w, v=u+w,

where

uU,wW. u\in U, \qquad w\in W.

In the quotient V/UV/U,

v+U=(u+w)+U=w+U. v+U=(u+w)+U=w+U.

Thus every coset has a unique representative in WW. Therefore

V/UW. V/U\cong W.

So when VV splits as a direct sum, quotienting by UU leaves the complementary part WW.

27.20 Summary

A quotient space V/UV/U is formed by identifying vectors of VV that differ by an element of the subspace UU. Its elements are cosets v+Uv+U. The whole subspace UU becomes the zero vector of the quotient.

The key ideas are:

ConceptMeaning
Equivalence modulo UUvwv\sim w when vwUv-w\in U
Cosetv+U={v+u:uU}v+U=\{v+u:u\in U\}
Quotient spaceSet of all cosets v+Uv+U
Zero cosetU=0+UU=0+U
Quotient mapπ(v)=v+U\pi(v)=v+U
Kernel of quotient mapkerπ=U\ker \pi=U
Dimension formuladim(V/U)=dimVdimU\dim(V/U)=\dim V-\dim U
First isomorphism theoremV/kerTIm(T)V/\ker T\cong\operatorname{Im}(T)

Quotient spaces express the idea of ignoring a subspace. They appear whenever a linear construction identifies several vectors as equivalent and keeps only the information that remains after that identification.