4.4  Products and Quotient Spaces

So far every new vector space in this book has been found inside an old one, as a subspace. This section builds new spaces in two other ways. The first glues spaces together side by side, making a product; it is the “external” direct sum promised in Chapter 1. The second, the quotient space V/U, is subtler and more important: it collapses a subspace U to a single point and keeps only what V knows beyond U. Quotients let us state precisely what a linear map remembers and what it forgets, in the three Isomorphism Theorems.

4.4.1. Products of vector spaces

In Chapter 1 we wrote V=U⊕W for subspaces U and W of one space V (Definition 1.7.2). The two pieces already lived in a common space, and “direct” was a property of how they sat there. But often we want to combine two spaces that have nothing to do with each other, such as R2 and R[x]≤1, into one space in which each keeps its identity. There is no common space to add inside, so we build one.

The model is F2. A vector of F2 is a pair (a,b) of scalars, and we add and scale pairs entry by entry. Nothing in that recipe needs the entries to be scalars: the entries could be vectors, taken from any vector spaces over F.

The product of vector spaces is the space of lists with one entry from each space, added and scaled entry by entry.

Definition 4.4.1 (Product of vector spaces)

Let V1,…,Vk be vector spaces over the same field F. Their product (or external direct sum) is the Cartesian product (Definition 0.3.10) V1×⋯×Vk={(v1,…,vk):vi∈Vi for each i}, with addition and scalar multiplication defined entrywise: for a∈F, (v1,…,vk)+(w1,…,wk):=(v1+w1,…,vk+wk),a(v1,…,vk):=(av1,…,avk).

In words: the i-th entry of a sum is the sum of the i-th entries, computed in Vi, and similarly for scalar multiples. Two elements are equal exactly when all their entries are equal. Every operation happens inside one Vi at a time, which is why all the Vi must share the field F: the same scalar a has to act on every entry.

It is a vector space. Both operations land in V1×⋯×Vk, since vi+wi∈Vi and avi∈Vi. Each axiom of Definition 1.1.1 is an equation between lists, so it holds when it holds in each entry, and in each entry it is the same axiom in Vi. For example, (VS6) reads (a+b)(v1,…,vk)=((a+b)v1,…,(a+b)vk)=(av1+bv1,…,avk+bvk)=a(v1,…,vk)+b(v1,…,vk), using (VS6) in each Vi. The zero vector is (0,…,0), with the zero of Vi in the i-th entry, and the additive inverse of (v1,…,vk) is (−v1,…,−vk). The other axioms are checked in exactly the same way.

Examples.

  • The standard example. F×⋯×F (n factors) is Fn with its usual operations.
  • Unrelated spaces. An element of R2×R[x]≤1 is a pair ((a,b),c+dx), and ((1,0),x)+((2,5),3−x)=((3,5),3).
  • Augmented data. A linear system Ax=b with m equations in n unknowns is a single element (A,b) of Mm×n(F)×Fm.
  • Degenerate cases. For k=1 the product is V1 itself, with entries written in parentheses. And V×{0} consists of the pairs (v,0); the map v↦(v,0) is a linear bijection V→V×{0}, so a zero factor adds nothing.

Non-example by minimal change. Take V1=C as a vector space over C and V2=R over R. The set C×R is fine, but the entrywise rule i⋅(z,t)=(iz,it) fails: it∉R for t≠0. The clause that fails is “over the same field”. Restricting the scalars of C to R (Definition 1.9.1) repairs it, and C×R over R is a vector space of dimension 3.

Bases of the factors combine into a basis of the product. For v∈Vi, write ιi(v) for the list with v in the i-th entry and 0 in every other entry. The map ιi:Vi→V1×⋯×Vk is linear, because the operations are entrywise.

Theorem 4.4.1 (Dimension of a Product)

Let V1,…,Vk be finite-dimensional vector spaces over F, and let (bi1,…,bini) be a basis of Vi for each i. Then the list of all vectors ιi(bij), for i=1,…,k and j=1,…,ni, is a basis of V1×⋯×Vk. In particular, dim⁡(V1×⋯×Vk)=dim⁡V1+⋯+dim⁡Vk.

Proof. Spanning. Let (v1,…,vk) be in the product. Since the operations are entrywise, (v1,…,vk)=ι1(v1)+⋯+ιk(vk). Each vi is a combination ∑jcijbij, and ιi is linear, so ιi(vi)=∑jcijιi(bij) (Theorem 2.1.4). Hence (v1,…,vk) is a combination of the vectors ιi(bij).

Independence. Let ∑i=1k∑j=1nicijιi(bij)=0. The i-th entry of the left side is ∑jcijbij, because every ιi′(bi′j) with i′≠i has 0 there. So ∑jcijbij=0 in Vi for each i, and the independence of the basis of Vi gives cij=0 for all j.

The list has n1+⋯+nk vectors, which gives the dimension (Definition 1.6.1).

For instance, dim⁡(R2×R[x]≤1)=2+2=4, so this product is isomorphic to R4 by Theorem 2.5.4.

How does the external product relate to the internal direct sum of Chapter 1? If U1,…,Uk are subspaces of V, there is a natural linear map from the product to V: add up the entries. The sum is direct exactly when this map loses no information.

Theorem 4.4.2 (Internal and External Direct Sums)
  • (a) Let U1,…,Uk be subspaces of a vector space V, and let S:U1×⋯×Uk→V,S(u1,…,uk)=u1+⋯+uk. Then S is linear with imS=U1+⋯+Uk. It is injective if and only if the sum U1+⋯+Uk is direct. In that case S is an isomorphism from U1×⋯×Uk onto U1⊕⋯⊕Uk.
  • (b) Conversely, let V1,…,Vk be vector spaces over F. Then the images ιi(Vi) are subspaces of V1×⋯×Vk, each isomorphic to Vi via ιi, and V1×⋯×Vk=ι1(V1)⊕⋯⊕ιk(Vk).

Proof.

  • (a) For lists (ui), (ui′) and a∈F, regrouping the finite sums gives S((ui)+(ui′))=∑i(ui+ui′)=S((ui))+S((ui′)) and S(a(ui))=∑iaui=aS((ui)), so S is linear. Its image is {u1+⋯+uk:ui∈Ui}, which is U1+⋯+Uk by Definition 1.7.1. Its kernel consists of the lists with u1+⋯+uk=0. By Theorem 2.2.3, S is injective if and only if the only such list is (0,…,0), which is condition (b) of Theorem 1.7.5, equivalent to the sum being direct. In that case S, viewed as a map onto its image, is a linear bijection, hence an isomorphism (Definition 2.5.2).

  • (b) Each ιi is linear and injective (its kernel is {0}, since ιi(v) has v as its i-th entry), so ιi(Vi) is a subspace (Theorem 2.2.2) and ιi is a bijection onto it. Every list satisfies (v1,…,vk)=ι1(v1)+⋯+ιk(vk), so the product is the sum of the subspaces ιi(Vi). If ι1(v1)+⋯+ιk(vk)=0, then (v1,…,vk)=(0,…,0), so every piece ιi(vi) is 0. By Theorem 1.7.5 ((b) ⇒ (a)) the sum is direct.

So internal and external direct sums are the same thing seen from two sides. An internal direct sum is a product that happens to live inside V; a product is an internal direct sum of copies of its factors. Many books write ⊕ for both. This book keeps × for the external construction, so that U⊕W always refers to subspaces of one space.

Quick check. Use Theorem 4.4.2 (a) and Rank–Nullity to explain why, for finite-dimensional subspaces U,W of V, the sum U+W is direct if and only if dim⁡(U+W)=dim⁡U+dim⁡W.

Solution. The addition map S:U×W→V has image U+W, and dim⁡(U×W)=dim⁡U+dim⁡W by Theorem 4.4.1. By Theorem 2.3.1, dim⁡U+dim⁡W=dim⁡(U+W)+dim⁡kerS. So dim⁡(U+W)=dim⁡U+dim⁡W exactly when kerS={0}, that is, when S is injective, which by the theorem means the sum is direct. This recovers Theorem 1.7.4 (a) ⇔ (c).

4.4.2. Cosets

The second construction starts from a picture you have already seen. In Chapter 1 we compared the line U={x+2y=0} through the origin with the parallel line L={x+2y=3}, which is not a subspace. In Chapter 3 we found that the solutions of a consistent system Ax=b form a set p+nul(A), a subspace shifted by one particular solution (Theorem 3.1.3). Both are translates of a subspace. They deserve a name.

Definition 4.4.2 (Coset)

Let U be a subspace of a vector space V, and let v∈V. The coset of U through v is the subset v+U:={v+u:u∈U}⊆V. Any w∈v+U is called a representative of the coset.

In R2, with U={x+2y=0}=span((2,−1)), the coset through (3,0) is the line {x+2y=3}: a point (3,0)+t(2,−1)=(3+2t,−t) satisfies x+2y=3, and every solution of x+2y=3 is of this form with t=−y. In general (a,b)+U={x+2y=a+2b}, so the cosets of U are exactly the lines parallel to U.

Diagram. Labels: x, y, mathbf 0, v = (1, 1), v ' = (3, 0), U = \x + 2y = 0\, v + U = \x + 2y = 3\, \x + 2y = -2\, +\,(2, -1)

The picture shows three cosets of U: U itself (solid), the line through v=(1,1) (dashed), and another parallel line (dotted). The points v=(1,1) and v′=(3,0) lie on the same dashed line, because v′−v=(2,−1)∈U; so they are two representatives of one coset. That observation is the whole theory of cosets.

Lemma 4.4.3 (When two cosets are equal)

Let U be a subspace of V. For v,w∈V, write v∼w if v−w∈U.

  • (a) ∼ is an equivalence relation on V, and the equivalence class of v is the coset v+U.
  • (b) v+U=w+U if and only if v−w∈U.
  • (c) Two cosets of U are either equal or disjoint, and every vector of V lies in exactly one coset.

Proof.

  • (a) We check Definition 0.5.2. (E1) v−v=0∈U. (E2) If v−w∈U, then w−v=(−1)(v−w)∈U by Theorem 1.1.7 and closure under scalar multiplication. (E3) If v−w∈U and w−x∈U, then v−x=(v−w)+(w−x)∈U by closure under addition. For the class, w∼v means w−v=u for some u∈U, that is, w=v+u∈v+U; so the class [v] of Definition 0.5.3 is v+U.

  • (b) By (a) and Lemma 0.5.1 (a), v+U=w+U if and only if v∼w, that is, v−w∈U.

  • (c) This is Lemma 0.5.1 (b), together with v∈v+U (take u=0).

More examples.

  • Vertical lines. In R3, let U=span(e3), the z-axis. The coset (a,b,c)+U is the vertical line through (a,b,0), and (a,b,c)+U=(a′,b′,c′)+U exactly when a=a′ and b=b′. A coset is determined by the shadow of any of its points on the xy-plane.
  • Polynomials with a prescribed value. In F[x]≤n, let U={p:p(0)=0}, a subspace (the kernel of evaluation at 0). Then p+U=q+U exactly when (p−q)(0)=0, that is, p(0)=q(0). So p+U is the set of all polynomials with the same constant term as p.
  • Degenerate cases. If U={0}, each coset v+U={v} is a single vector. If U=V, there is only one coset, v+V=V, because v−w∈V always.

Non-example by minimal change. Try to use the line L={x+2y=3}, which is not a subspace, in place of U. The rule “v∼w if v−w∈L” is not even reflexive: v−v=0∉L. What fails is the hypothesis that U is a subspace, which (E1), (E2) and (E3) each used.

Warning. A coset has many names, and it is usually not a subspace. In the example above, (1,1)+U and (3,0)+U are the same set, although (1,1)≠(3,0). Never conclude v=w from v+U=w+U; conclude only v−w∈U. And v+U is a subspace only when it contains 0, that is, when v∈U and so v+U=U. The dashed line above is not a subspace.

4.4.3. The quotient space

Now we want to treat each coset as a single point. The motivation is a kind of deliberate forgetting. Suppose we only care about vectors of R2 “up to” adding something from U, for instance because we only ever measure the quantity x+2y. Then (1,1) and (3,0) carry the same information, and the space of all the information we keep is the set of lines parallel to U. We would like this set to be a vector space, so that we can add and scale lines.

The recipe is the one used for Z/nZ in Chapter 0 (Example (Addition modulo n is well defined)): define the operations through representatives, then check that the choice of representatives does not matter.

The quotient space V/U is V with everything in U declared to be zero.

Definition 4.4.3 (Quotient space)

Let U be a subspace of a vector space V over F. The quotient space V/U (read “V modulo U”) is the set of all cosets of U, V/U:={v+U:v∈V}, with the operations (v+U)+(w+U):=(v+w)+U,a(v+U):=av+U(v,w∈V, a∈F). The quotient map is π:V→V/U, π(v)=v+U.

In words: an element of V/U is a whole coset, a subset of V. By Lemma 4.4.3 (a), V/U is the quotient set of V by the relation v∼w⇔v−w∈U (Definition 0.5.5), and π is its quotient map. To add two cosets, pick a representative of each, add them in V, and take the coset of the result. To scale a coset, scale a representative. The operations are written with representatives, so before anything else we must check that they are well defined.

The danger is real. By Lemma 4.4.3, (1,1)+U and (3,0)+U are one element of R2/U. If the sum ((1,1)+U)+(w+U) depended on which of the two names we used, the “definition” would assign two values to one pair of cosets, and it would not define a function at all (Definition 0.4.1). The theorem below rules this out, and then shows that the operations make V/U a vector space.

Theorem 4.4.4 (The Quotient Space Is a Vector Space)

Let U be a subspace of a vector space V over F.

  • (a) The addition and scalar multiplication in Definition 4.4.3 are well defined: the right-hand sides depend only on the cosets v+U and w+U, not on the representatives v and w.
  • (b) With these operations V/U is a vector space over F. Its zero vector is 0+U=U, and the additive inverse of v+U is (−v)+U.
  • (c) The quotient map π:V→V/U is linear and surjective, and kerπ=U.

Idea. Chapter 0’s Theorem 0.5.3 turns a function on V that is constant on classes into a function on V/U. It is stated for functions of one variable, so we use it one variable at a time. ① For scalar multiplication by a fixed a: if v−v′∈U, then av−av′=a(v−v′)∈U. ② For addition, first freeze the second summand w and vary the first; then show that the resulting function on cosets does not change when w is replaced by an equivalent w′. Each check is one line and uses exactly one closure property of U. Once the operations exist, every axiom for cosets is the same axiom in V, passed through π.

Proof. Throughout, v∼v′ means v−v′∈U, and by Lemma 4.4.3 (b), v∼v′ exactly when v+U=v′+U.

  • (a) Scalar multiplication. Fix a∈F, and let ga:V→V/U, ga(v)=av+U. If v∼v′, then av−av′=a(v−v′)∈U by (VS5) and closure of U under scalar multiplication, so ga(v)=ga(v′). By Theorem 0.5.3 (a), there is exactly one function g¯a:V/U→V/U with g¯a(v+U)=av+U for every v∈V. We define a(v+U):=g¯a(v+U).

    Addition, first variable. Fix w∈V, and let fw:V→V/U, fw(v)=(v+w)+U. If v∼v′, then (v+w)−(v′+w)=v−v′∈U, so fw(v)=fw(v′). By Theorem 0.5.3 (a), there is exactly one function f¯w:V/U→V/U with f¯w(v+U)=(v+w)+U for every v.

    Addition, second variable. Let F be the set of all functions V/U→V/U, and let h:V→F, h(w)=f¯w. Suppose w∼w′. For every v∈V, (v+w)−(v+w′)=w−w′∈U, so f¯w(v+U)=(v+w)+U=(v+w′)+U=f¯w′(v+U). Since every element of V/U has the form v+U, the functions f¯w and f¯w′ are equal, that is, h(w)=h(w′). By Theorem 0.5.3 (a) again, there is exactly one function h¯:V/U→F with h¯(w+U)=f¯w. We define X+Y:=h¯(Y)(X) for X,Y∈V/U. Then (v+U)+(w+U)=h¯(w+U)(v+U)=f¯w(v+U)=(v+w)+U, which is the formula of Definition 4.4.3, and its value depends only on the two cosets.

  • (b) Every element of V/U is π(v)=v+U for some v, and by (a) we have π(v)+π(w)=π(v+w) and aπ(v)=π(av). Let X=π(x), Y=π(y), Z=π(z) be in V/U, and a,b∈F. Each axiom follows by moving π outside, using the axiom in V, and moving π back:
    • (VS1) X+Y=π(x+y)=π(y+x)=Y+X.
    • (VS2) (X+Y)+Z=π((x+y)+z)=π(x+(y+z))=X+(Y+Z).
    • (VS3) X+π(0)=π(x+0)=π(x)=X, so π(0)=0+U=U is a zero vector.
    • (VS4) X+π(−x)=π(x+(−x))=π(0), so π(−x)=(−x)+U is an additive inverse of X.
    • (VS5) a(X+Y)=π(a(x+y))=π(ax+ay)=aX+aY.
    • (VS6) (a+b)X=π((a+b)x)=π(ax+bx)=aX+bX.
    • (VS7) a(bX)=π(a(bx))=π((ab)x)=(ab)X.
    • (VS8) 1X=π(1x)=π(x)=X.

    Hence V/U is a vector space over F.

  • (c) The identities π(v+w)=π(v)+π(w) and π(av)=aπ(v) from (b) say that π is linear. It is surjective by the definition of V/U. Finally, v∈kerπ means v+U=0+U, which by Lemma 4.4.3 (b) means v=v−0∈U. So kerπ=U.

Part (c) has a pleasant reading: every subspace is a kernel. Given U⊆V, the quotient map is a linear map whose kernel is exactly U.

Examples.

  • Parallel lines. In R2/U with U={x+2y=0}, write ℓc for the line {x+2y=c}. Since (a,b)∈ℓa+2b, the definition gives ℓc+ℓd=ℓc+d and tℓc=ℓtc: to add two parallel lines, add their “heights” c and d. The zero vector is ℓ0=U.
  • Constant terms. In F[x]≤n/U with U={p:p(0)=0}, the coset p+U is determined by p(0), and (p+U)+(q+U)=(p+q)+U is determined by p(0)+q(0). All that survives of a polynomial is its constant term.
  • Degenerate cases. V/{0} has the cosets {v}, added exactly as in V: nothing is forgotten. V/V has the single element V, so it is the zero space: everything is forgotten.

Non-example by minimal change. Replace the line U by the union of the two axes, S=span(e1)∪span(e2)⊆R2. It still contains 0 and is still closed under scalar multiplication, but it is not closed under addition. Then “v−w∈S” is not transitive: (1,1)−(0,1)=(1,0)∈S and (0,1)−(0,0)=(0,1)∈S, but (1,1)−(0,0)=(1,1)∉S. Concretely, the “cosets” (1,1)+S and (0,0)+S=S both contain (0,1)=(1,1)+(−1,0), yet they are different sets, since 0∈S but (1,1)+s=0 would need s=(−1,−1)∉S. The sets v+S do not split R2 into disjoint pieces, so there is no set “R2/S” of the kind the definition needs. The clause that fails is “U is a subspace”, specifically closure under addition.

Why this definition. Each part of the hypothesis that U is a subspace has a job: 0∈U makes ∼ reflexive; closure under scalar multiplication makes ∼ symmetric and scaling of cosets well defined; closure under addition makes ∼ transitive and addition of cosets well defined. The non-example shows what goes wrong when one of them is missing. The notation V/U and the phrase “modulo U” come from Z/nZ, where integers are identified when their difference lies in nZ.

Warning. V/U is not a subspace of V. Its elements are subsets of V, not vectors of V, and its addition is a new operation. For example, R3/span(e3) is not the xy-plane: its elements are vertical lines. The xy-plane is a complement of the z-axis, one of many (Chapter 1), whereas V/U involves no choice at all. The two are isomorphic, as we show below, but they are different objects.

In finite dimension the size of a quotient is exactly what one would guess from the picture: we lose dim⁡U dimensions.

Theorem 4.4.5 (Dimension of a Quotient)

Let V be finite-dimensional and U a subspace of V. Then V/U is finite-dimensional and dim⁡(V/U)=dim⁡V−dim⁡U. More precisely, if (u1,…,um,w1,…,ws) is a basis of V such that (u1,…,um) is a basis of U, then (w1+U,…,ws+U) is a basis of V/U.

Proof. By Theorem 4.4.4 (c), π:V→V/U is linear, surjective and has kernel U. By the Rank–Nullity Theorem (Theorem 2.3.1), imπ=V/U is finite-dimensional and dim⁡V=dim⁡U+dim⁡(V/U), which is the formula.

For the basis, let v+U∈V/U and write v=∑iaiui+∑jbjwj. Since π is linear and π(ui)=U is the zero vector, Theorem 2.1.4 gives v+U=∑jbj(wj+U). So the list (w1+U,…,ws+U) spans V/U. Its length is s=dim⁡V−dim⁡U=dim⁡(V/U), so it is a basis by Theorem 1.6.4 (b).

Such a basis always exists: take a basis of U and extend it (Theorem 1.6.5). So to find a basis of a quotient, extend a basis of U to one of V and keep the cosets of the new vectors.

Example (A basis of a quotient of R3)

Let U=span((1,1,1))⊆R3. Find a basis of R3/U, and write (2,5,−1)+U in it.

Solution. Extend (1,1,1) by e1 and e2. The list ((1,1,1),e1,e2) is independent: in a(1,1,1)+be1+ce2=(a+b,a+c,a)=0, the third entry gives a=0, and then b=c=0. It has length 3, so it is a basis of R3 (Theorem 1.6.4). By Theorem 4.4.5, (e1+U,e2+U) is a basis of R3/U, which has dimension 3−1=2.

To write (2,5,−1)+U, solve (2,5,−1)=a(1,1,1)+be1+ce2: the third entry gives a=−1, then b=3 and c=6. Hence (2,5,−1)+U=3(e1+U)+6(e2+U), and indeed (2,5,−1)−(3,6,0)=(−1,−1,−1)∈U. The coordinates (3,6) are (x−z,y−z) evaluated at (2,5,−1): they are exactly the quantities that do not change when a multiple of (1,1,1) is added.

The warning above said that a quotient is not a complement. The next result says how they are related: any complement is a concrete model of the quotient.

Proposition 4.4.6 (A complement is a model of the quotient)

Let U be a subspace of V, and let W be a subspace with V=U⊕W. Then the restriction of the quotient map, W→V/U, w↦w+U, is an isomorphism.

Proof. The restriction of the linear map π to W is linear. Injective: if w+U=U with w∈W, then w∈U by Lemma 4.4.3 (b), so w∈U∩W={0} (Theorem 1.7.4); by Theorem 2.2.3 the restriction is injective. Surjective: given v+U, write v=u+w with u∈U, w∈W; then v−w=u∈U, so v+U=w+U. A linear bijection is an isomorphism (Definition 2.5.2).

So every complement of U is isomorphic to V/U, which gives a second proof that all complements have the same dimension. The quotient is the choice-free object that all the complements imitate.

Quick check. In R2/U with U=span((1,1)), is (2,3)+U=(0,1)+U? Is (1,0)+U=(0,1)+U? What is dim⁡(R2/U)?

Solution. By Lemma 4.4.3 (b): (2,3)−(0,1)=(2,2)∈U, so the first two cosets are equal. (1,0)−(0,1)=(1,−1)∉U, so the second pair are different cosets. By Theorem 4.4.5, dim⁡(R2/U)=2−1=1.

4.4.4. The First Isomorphism Theorem

A linear map T:V→W forgets exactly the information in its kernel: Tv=Tv′ if and only if T(v−v′)=0, that is, v−v′∈kerT. In the language of this section, T takes the same value at two vectors exactly when they lie in the same coset of kerT. So T is really a function of the coset, and on cosets it forgets nothing.

Theorem 4.4.7 (First Isomorphism Theorem)

Let T:V→W be a linear map, and let K=kerT. Then the rule T¯:V/K→W,T¯(v+K)=Tv defines a linear map, which is injective with imT¯=imT, and satisfies T¯∘π=T. Hence V/kerT≅imT.

Proof. Well defined. K is a subspace by Theorem 2.2.1, so V/K is a vector space. If v+K=v′+K, then v−v′∈K by Lemma 4.4.3 (b), so Tv−Tv′=T(v−v′)=0. Hence T is constant on each coset of K, and by Theorem 0.5.3 (a) there is exactly one function T¯:V/K→W with T¯(v+K)=Tv, that is, T¯∘π=T.

Linear. For v,w∈V and a∈F, by Definition 4.4.3 and the linearity of T, T¯((v+K)+(w+K))=T¯((v+w)+K)=T(v+w)=Tv+Tw=T¯(v+K)+T¯(w+K), and similarly T¯(a(v+K))=T¯(av+K)=T(av)=aT¯(v+K).

Injective. If T¯(v+K)=0, then Tv=0, so v∈K and v+K=K, the zero of V/K. By Theorem 2.2.3, T¯ is injective.

Image. The values of T¯ are the vectors Tv, v∈V, so imT¯=imT. Regarded as a map V/K→imT, T¯ is a linear bijection, hence an isomorphism (Definition 2.5.2).

So every linear map factors as “collapse the kernel, then embed”: T=T¯∘π, with π surjective and T¯ injective. When V is finite-dimensional, taking dimensions with Theorem 4.4.5 gives dim⁡V−dim⁡kerT=dim⁡imT, which is Rank–Nullity again. The theorem is stronger than the count, because it names the isomorphism, and it holds in infinite dimension too.

The practical use runs the other way: to identify a quotient V/U, find a surjective linear map out of V whose kernel is exactly U.

Example (Identifying quotients)

Use the First Isomorphism Theorem to show:

  • (a) R3/L≅R2, where L=span((1,1,1));
  • (b) R[x]≤n/U≅R, where U={p:p(0)=0}.

Solution.

  • (a) Let T:R3→R2, T(x,y,z)=(x−z, y−z), which is linear because each entry is a linear expression. It is surjective, since T(a,b,0)=(a,b). Its kernel is {x=z, y=z}={(t,t,t)}=L. By Theorem 4.4.7, (x,y,z)+L↦(x−z,y−z) is an isomorphism R3/L→R2. This explains the coordinates found in Example (A basis of a quotient of R3). The check that it is well defined is visible: adding (t,t,t) to (x,y,z) does not change x−z or y−z.

  • (b) Let ev0:R[x]≤n→R, p↦p(0). It is linear by Theorem 0.8.5, surjective because the constant polynomial c maps to c, and its kernel is U by definition. By Theorem 4.4.7, p+U↦p(0) is an isomorphism R[x]≤n/U→R. In particular dim⁡(R[x]≤n/U)=1 by Theorem 2.5.4, so dim⁡U=(n+1)−1=n by Theorem 4.4.5.

4.4.5. The Second and Third Isomorphism Theorems

Two more identifications come from the same method: write down a surjective map, compute its kernel, and apply the First Isomorphism Theorem. The first compares a sum of subspaces with an intersection.

Theorem 4.4.8 (Second Isomorphism Theorem)

Let U and W be subspaces of a vector space V. Then U∩W is a subspace of U, W is a subspace of U+W, and U/(U∩W)→(U+W)/W,u+(U∩W)↦u+W is a well-defined isomorphism. Hence (U+W)/W≅U/(U∩W).

Idea. Picture two planes U and W in R3 meeting in a line. Modulo W, a vector of U+W is represented by its U-part alone, since the W-part is forgotten. The only vectors of U that become zero are those already in W. So the map “u↦u+W” from U is onto, with kernel U∩W.

Proof. U∩W is a subspace (Theorem 1.2.2) contained in U, and W is a subspace contained in U+W (Theorem 1.7.1), so both quotients exist. Let πW:U+W→(U+W)/W be the quotient map, and let S:U→(U+W)/W, Su=u+W, be its restriction to U; S is linear because πW is (Theorem 4.4.4).

S is surjective. An element of (U+W)/W is (u+w)+W with u∈U, w∈W. Since (u+w)−u=w∈W, Lemma 4.4.3 (b) gives (u+w)+W=u+W=Su.

kerS=U∩W. For u∈U, Su=W means u∈W (Lemma 4.4.3 (b)), that is, u∈U∩W.

By Theorem 4.4.7 applied to S, the rule u+(U∩W)↦Su=u+W is a well-defined injective linear map with image imS=(U+W)/W, hence an isomorphism. (Directly: if u−u′∈U∩W, then u−u′∈W, so u+W=u′+W, and the value does not depend on the representative.)

If U and W are finite-dimensional, then so is U+W (it is spanned by the union of bases, Proposition 1.7.2), and Theorem 4.4.5 turns the theorem into dim⁡(U+W)−dim⁡W=dim⁡U−dim⁡(U∩W). That is the dimension formula for sums (Theorem 1.7.3), now as a consequence of an isomorphism rather than of a basis computation. An exercise below asks for the details.

The third theorem says that quotients can be taken in stages.

Theorem 4.4.9 (Third Isomorphism Theorem)

Let U⊆W⊆V be subspaces. Then W/U={w+U:w∈W} is a subspace of V/U, and (V/U)/(W/U)→V/W,(v+U)+W/U↦v+W is a well-defined isomorphism. Hence (V/U)/(W/U)≅V/W.

Proof. Let S:V/U→V/W, S(v+U)=v+W.

Well defined. If v+U=v′+U, then v−v′∈U⊆W, so v+W=v′+W by Lemma 4.4.3 (b). By Theorem 0.5.3 (a), applied to V→V/W, v↦v+W, the rule defines a function on V/U.

Linear and surjective. S((v+U)+(w+U))=S((v+w)+U)=(v+w)+W=S(v+U)+S(w+U), and similarly for scalars, by Definition 4.4.3 in both quotients. Every v+W equals S(v+U).

Kernel. S(v+U)=W means v∈W. If v∈W, then v+U∈W/U. Conversely, if v+U=w+U with w∈W, then v−w∈U⊆W, so v∈W. Hence kerS=W/U. In particular W/U is a subspace of V/U, by Theorem 2.2.1.

By Theorem 4.4.7 applied to S, (V/U)/(W/U)≅imS=V/W, via (v+U)+W/U↦S(v+U)=v+W.

The notation W/U is used with two meanings, and they agree: the quotient space of W by U, and the set of cosets w+U with w∈W, sitting inside V/U. The coset w+U is the same subset of V in both readings, and the operations agree because both are computed with representatives. For example, with V=R3, U the z-axis and W the xz-plane, V/W≅R through the y-coordinate, and the theorem says that first forgetting z and then forgetting x leaves the same thing as forgetting both at once.

4.4.6. The universal property of the quotient

The proofs of the three theorems repeated one move: a linear map that vanishes on U passes to V/U. We record that move once, in its general form. It is the standard way to define linear maps out of a quotient.

Theorem 4.4.10 (Universal Property of the Quotient)

Let U be a subspace of V, π:V→V/U the quotient map, and T:V→W a linear map.

  • (a) If U⊆kerT, then there is exactly one linear map T¯:V/U→W with T¯∘π=T, namely T¯(v+U)=Tv. Its image is imT, and it is injective if and only if U=kerT.
  • (b) Conversely, if some function T¯:V/U→W satisfies T¯∘π=T, then U⊆kerT.

Proof.

  • (a) If v−v′∈U⊆kerT, then Tv=Tv′. By Theorem 0.5.3 (a) there is exactly one function T¯ with T¯(v+U)=Tv, and it is linear by the computation in the proof of Theorem 4.4.7, which used only this formula. Any linear T¯ with T¯∘π=T satisfies this formula, so it is this one. The image is {Tv}=imT. The kernel of T¯ is {v+U:v∈kerT}; it is {U}, the zero subspace, exactly when every v∈kerT lies in U, that is, when kerT⊆U, which together with U⊆kerT means U=kerT. Apply Theorem 2.2.3.

  • (b) Let u∈U. Then π(u)=U=π(0), so Tu=T¯(π(u))=T¯(π(0))=T(0)=0 by Theorem 2.1.1. Hence U⊆kerT.

In words: linear maps out of V/U are the same as linear maps out of V that kill U. The First Isomorphism Theorem is the case U=kerT. For example, the map T:R3→R, T(x,y,z)=x, kills the z-axis U, so it induces T¯:R3/U→R, (x,y,z)+U↦x. Since kerT is the yz-plane, strictly larger than U, this T¯ is not injective: it also kills the coset e2+U.

Quotients will return in Chapter 9, where an operator T with T(U)⊆U induces an operator on V/U, and this is the engine of induction arguments on the dimension.

4.4.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the quotient space V/U and its two operations.
  • (b) State the condition, in terms of v−w, for v+U=w+U.
  • (c) True or false: V/U is a subspace of V. Justify your answer.
  • (d) State the First Isomorphism Theorem.
  • (e) If U is a 2-dimensional subspace of R5, what is dim⁡(R5/U)? What is dim⁡(R5×U)?
  • (f) What must be checked before the formula (v+U)+(w+U)=(v+w)+U can be used as a definition, and which property of U makes the check work?

Solution.

  • (a) For a subspace U of V, V/U={v+U:v∈V}, with (v+U)+(w+U)=(v+w)+U and a(v+U)=av+U (Definition 4.4.3).

  • (b) v+U=w+U if and only if v−w∈U (Lemma 4.4.3).

  • (c) False. The elements of V/U are cosets, which are subsets of V, not vectors of V.

  • (d) If T:V→W is linear, then v+kerT↦Tv is a well-defined isomorphism V/kerT→imT (Theorem 4.4.7).

  • (e) 5−2=3 by Theorem 4.4.5, and 5+2=7 by Theorem 4.4.1.

  • (f) That the right-hand side does not depend on the representatives: if v−v′∈U and w−w′∈U, then (v+w)+U=(v′+w′)+U. This works because (v+w)−(v′+w′)=(v−v′)+(w−w′) and U is closed under addition.

B. Practice

Exercise (B1: A basis of a quotient of R4)

Let U=span((1,0,1,0),(0,1,0,1))⊆R4.

  • (a) Find dim⁡(R4/U) and a basis of R4/U.
  • (b) Write (3,1,4,1)+U in your basis.
  • (c) Decide whether (1,2,3,4)+U=(3,4,1,2)+U.

Solution.

  • (a) The two spanning vectors are independent (look at the first two entries), so dim⁡U=2 and dim⁡(R4/U)=4−2=2 by Theorem 4.4.5. Extend by e1,e2. If a(1,0,1,0)+b(0,1,0,1)+ce1+de2=(a+c,b+d,a,b)=0, then a=b=0 from the last two entries and c=d=0 from the first two. So the four vectors are independent, hence a basis of R4 (Theorem 1.6.4), and by Theorem 4.4.5 (e1+U,e2+U) is a basis of R4/U.

  • (b) Solve (3,1,4,1)=(a+c,b+d,a,b): a=4, b=1, c=−1, d=0. Since the U-part becomes zero in the quotient, (3,1,4,1)+U=−1(e1+U)+0(e2+U). Check: (3,1,4,1)+e1=(4,1,4,1)=4(1,0,1,0)+(0,1,0,1)∈U.

  • (c) The difference is (1,2,3,4)−(3,4,1,2)=(−2,−2,2,2). A vector (a,b,a,b) of U has equal first and third entries, but −2≠2. So the difference is not in U, and the cosets are different by Lemma 4.4.3.

Exercise (B2: A map that factors through a quotient)

Let T:R[x]≤2→R2, T(p)=(p(1),p′(1)), and U=span((x−1)2).

  • (a) Show that U⊆kerT, so that T induces a linear map T¯:R[x]≤2/U→R2 with T¯(p+U)=T(p).
  • (b) Prove that T¯ is an isomorphism.
  • (c) Compute T¯(x2+U), and find the coset T¯−1(0,1).

Solution.

  • (a) T is linear, since evaluation and differentiation are. For q=(x−1)2, q(1)=0 and q′(1)=2(1−1)=0, so T(q)=0, and hence T(cq)=0 for all c. So U⊆kerT, and Theorem 4.4.10 (a) gives the linear map T¯.

  • (b) T(1)=(1,0) and T(x−1)=(0,1), so T is surjective and rankT=2. By Theorem 2.3.1, dim⁡kerT=3−2=1=dim⁡U, so kerT=U by Theorem 1.6.8. By Theorem 4.4.10 (a), T¯ is injective with image imT=R2. Hence T¯ is a linear bijection, an isomorphism.

  • (c) T¯(x2+U)=T(x2)=(1,2). Since T(x−1)=(0,1), T¯−1(0,1)=(x−1)+U, the set of all x−1+c(x−1)2.

Exercise (B3: Matrices modulo scalars)

Let n≥1 and S={cIn:c∈F}⊆Mn(F).

  • (a) Show that S is a subspace and find dim⁡(Mn(F)/S).
  • (b) For n=2, find a basis of M2(F)/S.
  • (c) Show that A+S=B+S if and only if A−B is a scalar matrix, and decide whether (3105)+S=(1103)+S.

Solution.

  • (a) S=span(In) is a subspace by Theorem 1.3.1, of dimension 1 since In≠0. By Theorem 4.4.5, dim⁡(Mn(F)/S)=n2−1.

  • (b) Extend (I2) by E11,E12,E21. If aI2+bE11+cE12+dE21=(a+bcda)=0, then a=c=d=0 and then b=0. So the four matrices are independent, hence a basis of M2(F) (Theorem 1.6.4), and (E11+S,E12+S,E21+S) is a basis of M2(F)/S by Theorem 4.4.5.

  • (c) This is Lemma 4.4.3 (b) for the subspace S. Here the difference is (2002)=2I2∈S, so the two cosets are equal.

C. Going deeper

Exercise (C1: The dimension formula from isomorphisms)

Let U and W be finite-dimensional subspaces of a vector space V.

  • (a) Using Theorem 4.4.8 and Theorem 4.4.5, prove that dim⁡(U+W)=dim⁡U+dim⁡W−dim⁡(U∩W).
  • (b) Give a second proof: apply Rank–Nullity to the addition map S:U×W→V, S(u,w)=u+w, after showing that u↦(u,−u) is an isomorphism from U∩W onto kerS.

Solution.

  • (a) U+W is finite-dimensional, being spanned by a basis of U followed by a basis of W (Proposition 1.7.2), and U∩W⊆U is finite-dimensional (Theorem 1.6.7). By Theorem 4.4.8, (U+W)/W≅U/(U∩W), and isomorphic finite-dimensional spaces have equal dimension (Theorem 2.5.4). Applying Theorem 4.4.5 to both sides, dim⁡(U+W)−dim⁡W=dim⁡U−dim⁡(U∩W), which rearranges to the formula.

  • (b) The map S is linear with image U+W by Theorem 4.4.2 (a). Let J:U∩W→U×W, Ju=(u,−u); it is well defined because u∈U and −u∈W, and linear because the operations are entrywise. It is injective, since (u,−u)=(0,0) forces u=0. Its image lies in kerS, since u+(−u)=0. Conversely, if (u,w)∈kerS, then w=−u; so u=−w∈W, hence u∈U∩W and (u,w)=Ju. Thus J is an isomorphism onto kerS, and dim⁡kerS=dim⁡(U∩W). By Theorem 4.4.1 and Theorem 2.3.1, dim⁡U+dim⁡W=dim⁡(U×W)=dim⁡(U+W)+dim⁡(U∩W).

Exercise (C2: The operator induced on a quotient)

Let V be finite-dimensional, T∈L(V), and U a subspace with Tu∈U for every u∈U.

  • (a) Prove that T¯(v+U):=Tv+U is a well-defined linear operator on V/U.
  • (b) Let (u1,…,um) be a basis of U, extended to a basis B=(u1,…,um,w1,…,ws) of V. Show that [T]BB=(AB0D), where A∈Mm(F) is the matrix of the restriction T|U:U→U in (u1,…,um), D∈Ms(F) is the matrix of T¯ in (w1+U,…,ws+U), and 0 is the s×m zero matrix.
  • (c) Check (b) when T is differentiation on R[x]≤2, with U=R[x]≤1 and B=(1,x,x2).

Hint: for (a), apply Theorem 4.4.10 to π∘T.

Solution.

  • (a) The map π∘T:V→V/U, v↦Tv+U, is linear as a composition of linear maps (Theorem 2.4.2). For u∈U, Tu∈U, so (π∘T)(u)=U, the zero of V/U; thus U⊆ker(π∘T). By Theorem 4.4.10 (a) there is exactly one linear map T¯:V/U→V/U with T¯(v+U)=Tv+U.

  • (b) For j≤m, Tuj∈U, so it is a combination of u1,…,um only, and its B-coordinates are 0 in the last s places. These first m columns, restricted to their first m entries, are the columns of the matrix A of T|U (which maps U to U by hypothesis and is linear). For the remaining columns, write Twk=∑ibikui+∑ldlkwl. Passing to V/U, where ui+U=U is zero, gives T¯(wk+U)=∑ldlk(wl+U). So the s×s matrix (dlk) is the matrix D of T¯ in the basis (w1+U,…,ws+U) of Theorem 4.4.5, and the bottom-right block of [T]BB is D.

  • (c) T(1)=0, T(x)=1, T(x2)=2x, so [T]BB=(010002000). Differentiation maps U=R[x]≤1 into itself. The block A=(0100) is the matrix of T on U in (1,x), the lower-left block is (00), and the block D is the 1×1 matrix (0): indeed T¯(x2+U)=2x+U=U, the zero coset, since 2x∈U.

Exercise (C3: Counting cosets over a finite field)

Let F=Fq be a finite field with q elements, V a vector space over F of dimension n, and U a subspace of dimension m.

  • (a) Show that |V|=qn.
  • (b) Show that every coset v+U has exactly |U| elements, and deduce |V/U|=qn−m by counting.
  • (c) Check that (b) agrees with Theorem 4.4.5.

Solution.

  • (a) Choose a basis (v1,…,vn). By Theorem 1.5.1, (a1,…,an)↦a1v1+⋯+anvn is a bijection Fn→V, and Fn has qn elements.

  • (b) The map U→v+U, u↦v+u, is surjective by Definition 4.4.2 and injective because v+u=v+u′ implies u=u′. So |v+U|=|U|=qm by (a) applied to U. By Lemma 4.4.3 (c), the cosets partition V into |V/U| disjoint sets of size qm, so qn=|V/U|⋅qm, and |V/U|=qn−m.

  • (c) By Theorem 4.4.5, V/U is a vector space over Fq of dimension n−m, so by (a) it has qn−m elements, in agreement with (b). For example, F23 modulo a line has 8/2=4 cosets.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.