Unit 2, lesson 9

The First Isomorphism Theorem

Fibers of a linear map, the quotient map and the induced map, the first isomorphism theorem that identifies the quotient by the kernel with the image, and polynomial evaluation as a worked case.

  • Video 9
  • Quotient Constructions

The map T(x,y,z)=(x+y,z)T(x, y, z) = (x + y, z) from R3\mathbb{R}^3 to R2\mathbb{R}^2 sends both (3,1,2)(3, 1, 2) and (5,−1,2)(5, -1, 2) to (4,2)(4, 2). It cannot see how the sum x+yx + y is split between xx and yy. After every group of inputs with a common output is merged into one object, is any further information lost? The first isomorphism theorem says that nothing more is lost, and each of its four claims has its own short proof.

Key terms

Fiber of a linear map

Definition Let T:V→WT: V \to W be a linear map between vector spaces over F\mathbb{F}, where F\mathbb{F} is R\mathbb{R} or C\mathbb{C}. The fiber of TT over y∈Wy \in W is the set of inputs with output yy,

T−1(y)={ v∈V∣T(v)=y }.T^{-1}(y) = \{\, v \in V \mid T(v) = y \,\}.

The notation does not assume that TT has an inverse. The fiber is empty when y∉im⁡Ty \notin \operatorname{im} T. Since T(v)−T(u)=T(v−u)T(v) - T(u) = T(v - u),

T(v)=T(u)  ⟺  v−u∈ker⁡T,T(v) = T(u) \iff v - u \in \ker T,

so when T(v0)=yT(v_0) = y the fiber over yy is the coset v0+ker⁡Tv_0 + \ker T. The fiber over 00 is the kernel itself, and the nonempty fibers are exactly the cosets of ker⁡T\ker T.

In plain words A fiber collects all the inputs that the map cannot tell apart from one another. Any two of them differ by a vector of the kernel.

Example For T(x,y,z)=(x+y,z)T(x, y, z) = (x + y, z) the output is zero exactly when x+y=0x + y = 0 and z=0z = 0, so ker⁡T=span⁡{(1,−1,0)}\ker T = \operatorname{span}\{(1, -1, 0)\}. The fiber over (4,2)(4, 2) is

(3,1,2)+ker⁡T={ (3+s,1−s,2)∣s∈R },\begin{aligned} &(3, 1, 2) + \ker T \\[0.4em] &\quad = \{\, (3 + s, 1 - s, 2) \mid s \in \mathbb{R} \,\}, \end{aligned}

a line parallel to the kernel that contains (5,−1,2)(5, -1, 2) and (4,0,2)(4, 0, 2).

Quotient map

Definition For a subspace UU of a vector space VV over F\mathbb{F}, the quotient map is

q:V→V/U,q(v)=v+U.q: V \to V/U, \qquad q(v) = v + U.

It is linear, because q(av+bx)=(av+bx)+U=a(v+U)+b(x+U)q(av + bx) = (av + bx) + U = a(v + U) + b(x + U) by the definition of the quotient operations. It is onto, because every coset has a representative. Its kernel is UU, because v+Uv + U is the zero coset exactly when v∈Uv \in U. None of this needs finite dimension, an inner product or a choice of complement.

In plain words The quotient map replaces each vector by the coset it belongs to. Two vectors have the same image exactly when they differ by a vector of UU.

Example For U=span⁡{(1,−1,0)}U = \operatorname{span}\{(1, -1, 0)\} in R3\mathbb{R}^3, the quotient map sends (3,1,2)(3, 1, 2) and (5,−1,2)(5, -1, 2) to the same coset, since their difference (−2,2,0)(-2, 2, 0) lies in UU. It sends (1,−1,0)(1, -1, 0) to the zero coset UU. In this way every subspace is a kernel, namely the kernel of its own quotient map.

Induced map

Definition Let T:V→WT: V \to W be linear over F\mathbb{F} and let UU be a subspace of VV. The rule

T~(v+U)=T(v)\widetilde{T}(v + U) = T(v)

defines a function on V/UV/U exactly when U⊆ker⁡TU \subseteq \ker T. If U⊆ker⁡TU \subseteq \ker T and v+U=v′+Uv + U = v' + U, then v−v′∈Uv - v' \in U, so T(v)−T(v′)=T(v−v′)=0T(v) - T(v') = T(v - v') = 0. Conversely, if the rule is well defined, every u∈Uu \in U satisfies u+U=0+Uu + U = 0 + U, so T(u)=T(0)=0T(u) = T(0) = 0. When U⊆ker⁡TU \subseteq \ker T, the induced map T~:V/U→W\widetilde{T}: V/U \to W is linear, because

T~(a(v+U)+b(x+U))=T(av+bx)=a T(v)+b T(x)=a T~(v+U)+b T~(x+U),\begin{aligned} &\widetilde{T}\big(a(v + U) + b(x + U)\big) \\[0.4em] &\quad = T(av + bx) = a\,T(v) + b\,T(x) \\[0.4em] &\quad = a\,\widetilde{T}(v + U) + b\,\widetilde{T}(x + U), \end{aligned}

and it satisfies T=T~∘qT = \widetilde{T} \circ q. It is the only map with that property, because qq is onto.

In plain words A map can be defined on cosets only if it ignores every direction that the quotient ignores. The quotient may throw away only what the map already throws away.

Example For T(x,y,z)=(x+y,z)T(x, y, z) = (x + y, z) and U=ker⁡TU = \ker T, the induced map sends the coset (x,y,z)+U(x, y, z) + U, which consists of the vectors (x+s,y−s,z)(x + s, y - s, z) with s∈Rs \in \mathbb{R}, to (x+y,z)(x + y, z). With UU the zz-axis instead, the rule fails. The vectors 00 and e3e_3 represent the same coset UU, but T(0)=(0,0)T(0) = (0, 0) and T(e3)=(0,1)T(e_3) = (0, 1). Here UU is not contained in ker⁡T\ker T.

First isomorphism theorem

Definition Let VV and WW be vector spaces over F\mathbb{F}, where F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, and let T:V→WT: V \to W be linear with kernel K=ker⁡TK = \ker T. Then the induced map

T~:V/K→im⁡T,T~(v+K)=T(v),\begin{gathered} \widetilde{T}: V/K \to \operatorname{im} T, \\[0.4em] \widetilde{T}(v + K) = T(v), \end{gathered}

is a linear bijection, so V/ker⁡T≅im⁡TV/\ker T \cong \operatorname{im} T. The proof checks four things separately. The map is well defined because two representatives of one coset differ by a kernel vector. It is linear by the quotient operations and the linearity of TT. It is injective because T(v)=T(u)T(v) = T(u) gives v−u∈Kv - u \in K, so v+K=u+Kv + K = u + K. It is onto im⁡T\operatorname{im} T because each y∈im⁡Ty \in \operatorname{im} T equals T(v)T(v) for some vv, and then T~(v+K)=y\widetilde{T}(v + K) = y. No finite-dimensional hypothesis is needed. The original map TT factors as T=ι∘T~∘qT = \iota \circ \widetilde{T} \circ q, where q:V→V/Kq: V \to V/K is the quotient map and ι\iota is the inclusion of im⁡T\operatorname{im} T in WW. When VV is finite-dimensional, comparing dimensions gives rank-nullity, dim⁡V−dim⁡ker⁡T=dim⁡im⁡T\dim V - \dim \ker T = \dim \operatorname{im} T.

The theorem identifies the quotient with the image, not with the codomain, and the image equals the codomain only when TT is onto.

In plain words Once the inputs a map cannot tell apart are merged, nothing else is lost. Each coset of the kernel matches exactly one output in the image, and each output in the image matches exactly one coset.

Example For T(x,y,z)=(x+y,z)T(x, y, z) = (x + y, z) the image is all of R2\mathbb{R}^2. The vectors (1,−1,0)(1, -1, 0), e1e_1 and e3e_3 form a basis of R3\mathbb{R}^3, so e1+Ke_1 + K and e3+Ke_3 + K form a quotient basis, and the induced map sends them to (1,0)(1, 0) and (0,1)(0, 1). Because (3,1,2)−(4,0,2)=(−1,1,0)(3, 1, 2) - (4, 0, 2) = (-1, 1, 0) lies in KK,

(3,1,2)+K=4(e1+K)+2(e3+K),\begin{aligned} (3, 1, 2) + K &= 4(e_1 + K) \\[0.4em] &\quad + 2(e_3 + K), \end{aligned}

and T~\widetilde{T} sends this coset to (4,2)(4, 2), which is T(3,1,2)T(3, 1, 2).

Polynomial evaluation map

Definition Fix a scalar s∈Fs \in \mathbb{F} and a whole number d≥0d \ge 0, and let Pd\mathcal{P}_d be the space of polynomials over F\mathbb{F} of degree at most dd, including the zero polynomial. The evaluation map

ev⁡s:Pd→F,ev⁡s(p)=p(s),\begin{gathered} \operatorname{ev}_s: \mathcal{P}_d \to \mathbb{F}, \\[0.4em] \operatorname{ev}_s(p) = p(s), \end{gathered}

is linear, since (p+r)(s)=p(s)+r(s)(p + r)(s) = p(s) + r(s) and (ap)(s)=a p(s)(ap)(s) = a\,p(s). It is onto, because the constant polynomial with value aa is sent to aa. Its kernel, the polynomials with p(s)=0p(s) = 0, has dimension dd by rank-nullity, and for d≥1d \ge 1 it consists of the multiples (t−s) r(t)(t - s)\,r(t) with r∈Pd−1r \in \mathcal{P}_{d-1}. By the first isomorphism theorem,

Pd/ker⁡ev⁡s≅F,p+ker⁡ev⁡s↦p(s).\begin{gathered} \mathcal{P}_d / \ker \operatorname{ev}_s \cong \mathbb{F}, \\[0.4em] p + \ker \operatorname{ev}_s \mapsto p(s). \end{gathered}

In plain words Evaluating at one point remembers a single number. Polynomials with the same value at ss merge into one coset, and the quotient is a copy of the scalars.

Example Take F=R\mathbb{F} = \mathbb{R}, d=2d = 2 and s=0s = 0. For p=a+bt+ct2p = a + bt + ct^2 we get ev⁡0(p)=a\operatorname{ev}_0(p) = a, so the kernel is span⁡{t,t2}\operatorname{span}\{t, t^2\} and each coset consists of all polynomials with one fixed constant term. The coset 1+ker⁡ev⁡01 + \ker \operatorname{ev}_0 is a quotient basis, and the induced map sends (a+bt+ct2)+ker⁡ev⁡0(a + bt + ct^2) + \ker \operatorname{ev}_0 to aa. The rule that sends a coset to the coefficient of tt is not well defined. The polynomials 2+t2 + t and 2+5t+t22 + 5t + t^2 lie in one coset, since their difference 4t+t24t + t^2 is in the kernel, but their coefficients of tt are 11 and 55.

Check yourself

  1. Let T(x,y,z)=(x+y,z)T(x, y, z) = (x + y, z). Describe the fiber over (1,5)(1, 5), and decide whether (0,1,5)(0, 1, 5) and (2,−1,5)(2, -1, 5) represent the same coset of ker⁡T\ker T.
Show the answer

The vector (1,0,5)(1, 0, 5) maps to (1,5)(1, 5), so the fiber is (1,0,5)+span⁡{(1,−1,0)}(1, 0, 5) + \operatorname{span}\{(1, -1, 0)\}, the points (1+s,−s,5)(1 + s, -s, 5) with s∈Rs \in \mathbb{R}. Both given vectors map to (1,5)(1, 5), and their difference (−2,2,0)=−2(1,−1,0)(-2, 2, 0) = -2(1, -1, 0) lies in the kernel, so they represent the same coset.

  1. For P(x,y)=(x,0)P(x, y) = (x, 0) on R2\mathbb{R}^2, a student concludes from the first isomorphism theorem that R2/ker⁡P≅R2\mathbb{R}^2/\ker P \cong \mathbb{R}^2. What is wrong, and what is the correct statement?
Show the answer

The theorem gives an isomorphism onto the image, not onto the codomain. Here ker⁡P\ker P is the yy-axis and im⁡P\operatorname{im} P is the xx-axis, so the quotient has dimension 2−1=12 - 1 = 1 and cannot be isomorphic to R2\mathbb{R}^2. The correct statement is that the induced map (x,y)+ker⁡P↦(x,0)(x, y) + \ker P \mapsto (x, 0) is a linear bijection onto the xx-axis. The vector (0,1)(0, 1) is never reached.

  1. Over R\mathbb{R} let T:P2→R2T: \mathcal{P}_2 \to \mathbb{R}^2 be given by T(p)=(p(0),p(1))T(p) = (p(0), p(1)). Find ker⁡T\ker T, show that TT is onto, and state what the first isomorphism theorem gives. Is the rule p+ker⁡T↦p(2)p + \ker T \mapsto p(2) well defined?
Show the answer

Write p=a+bt+ct2p = a + bt + ct^2, so that T(p)=(a,a+b+c)T(p) = (a, a + b + c). The output is zero when a=0a = 0 and b=−cb = -c, so ker⁡T=span⁡{t2−t}\ker T = \operatorname{span}\{t^2 - t\}. Given (u,w)∈R2(u, w) \in \mathbb{R}^2, the polynomial u+(w−u)tu + (w - u)t has values uu at 00 and ww at 11, so TT is onto. The theorem gives

P2/span⁡{t2−t}≅R2\mathcal{P}_2 / \operatorname{span}\{t^2 - t\} \cong \mathbb{R}^2

through p+ker⁡T↦(p(0),p(1))p + \ker T \mapsto (p(0), p(1)), in agreement with the count 3−1=23 - 1 = 2. The rule p+ker⁡T↦p(2)p + \ker T \mapsto p(2) is not well defined. The polynomials 00 and t2−tt^2 - t lie in the same coset, but their values at 22 are 00 and 22. The kernel of TT is not contained in the kernel of evaluation at 22.

How this lesson connects