5.5  Duality for Subspaces and Quotients

A subspace U of V gives two new vector spaces: U itself, and the quotient V/U of Chapter 4. Each has a dual space, and so far U∗ and (V/U)∗ have nothing to do with V∗. This section connects them. The answer is a swap: the dual of the quotient is a subspace of V∗, namely the annihilator U0, and the dual of the subspace is a quotient of V∗, namely V∗/U0. Both identifications come from the First Isomorphism Theorem, and neither needs a basis. At the end we use them to describe hyperplanes, the subspaces cut out by a single equation, in any dimension.

5.5.1. Restricting functionals to a subspace

Let U be a subspace of V. A functional φ∈V∗ measures every vector of V, so in particular it measures the vectors of U. Forgetting the rest gives the restriction φ|U:U→F, u↦φ(u), which is a functional on U. This defines the restriction map ρ:V∗→U∗,ρ(φ)=φ|U. It is not a new kind of map. Let ι:U→V, ι(u)=u, be the inclusion. Its dual map (Definition 5.4.1) sends φ to φ∘ι, and (φ∘ι)(u)=φ(u). So ρ=ι′, and in particular ρ is linear.

Two questions decide what ρ does. Which functionals restrict to zero? By Definition 5.2.1, exactly those in U0. And does every functional on U come from one on V? That is an extension problem, and it has a positive answer in every dimension.

Theorem 5.5.1 (Dual of a Subspace)

Let V be a vector space over F, of any dimension, and let U be a subspace of V. The restriction map ρ:V∗→U∗, ρ(φ)=φ|U, is linear and surjective, and kerρ=U0. Hence V∗/U0→U∗,φ+U0↦φ|U is a well-defined isomorphism, and U∗≅V∗/U0.

Idea. The kernel is the definition of U0 read aloud. The real content is surjectivity: given ψ on U, we must extend it to all of V. A basis tells us how. Extend a basis of U to a basis of V; a linear map may be prescribed freely on a basis, so declare the extension to agree with ψ on the basis of U and to be 0 on the new basis vectors. Then the First Isomorphism Theorem turns “surjective with kernel U0” into the isomorphism.

Proof. We saw above that ρ=ι′ is linear. For φ∈V∗, ρ(φ)=0 means φ(u)=0 for every u∈U, which is φ∈U0 by Definition 5.2.1. So kerρ=U0.

Surjective. Let ψ∈U∗. By Theorem 1.8.3, U has a basis BU. It is a linearly independent subset of V, so by Theorem 1.8.2 there is a basis B of V with BU⊆B. By Theorem 2.1.6 there is a linear map φ:V→F with φ(b)=ψ(b)for b∈BU,φ(b)=0for b∈B∖BU. Then φ|U and ψ are linear maps U→F that agree on the basis BU of U, so φ|U=ψ by the uniqueness part of Theorem 2.1.6. Thus ρ(φ)=ψ, and ρ is surjective. (If V is finite-dimensional, the finite versions Corollary 1.5.5, Theorem 1.6.5 and Theorem 2.1.5 suffice, and no choice principle is needed.)

By the First Isomorphism Theorem (Theorem 4.4.7), φ+kerρ↦ρ(φ) is a well-defined isomorphism V∗/kerρ→imρ. Since kerρ=U0 and imρ=U∗, this is the claimed isomorphism.

In words: a functional on U is a functional on V, up to adding something that vanishes on U. Two extensions of the same ψ differ by an element of U0, and every element of U0 can be added.

When V is finite-dimensional, taking dimensions recovers the count of this chapter. By Corollary 5.1.4, dim⁡U∗=dim⁡U and dim⁡V∗=dim⁡V, and by Theorem 4.4.5, dim⁡(V∗/U0)=dim⁡V−dim⁡U0. So the isomorphism says dim⁡U=dim⁡V−dim⁡U0, which is Theorem 5.2.2 again.

5.5.2. Functionals on a quotient

Now the other space. A functional ψ on V/U measures cosets. Composing with the quotient map π:V→V/U, π(v)=v+U, turns it into a measurement of vectors, v↦ψ(v+U). This functional on V cannot tell apart two vectors in the same coset, so in particular it is zero on U. The theorem says that nothing is lost and nothing else appears: the functionals on V/U are exactly the functionals on V that vanish on U.

Theorem 5.5.2 (Dual of a Quotient)

Let V be a vector space over F, of any dimension, let U be a subspace, and let π:V→V/U be the quotient map. Then the dual map π′:(V/U)∗→V∗,π′(ψ)=ψ∘π, is injective, and its image is U0. Hence π′ is an isomorphism from (V/U)∗ onto U0, and (V/U)∗≅U0.

Idea. Injectivity uses only that π is surjective: if ψ∘π is zero, then ψ is zero on every coset. For the image, one inclusion is “π kills U”. The other inclusion asks us to build a functional on V/U from a functional on V that vanishes on U, and that is exactly what the universal property of the quotient does.

Proof. The map π′ is linear by Definition 5.4.1.

Injective. Suppose π′(ψ)=ψ∘π=0. Every element of V/U is π(v) for some v∈V, because π is surjective (Theorem 4.4.4 (c)). Then ψ(π(v))=0 for every v, so ψ=0. By Theorem 2.2.3, π′ is injective.

imπ′⊆U0. For u∈U, π(u)=U is the zero vector of V/U, so (ψ∘π)(u)=ψ(0)=0. Hence ψ∘π∈U0.

U0⊆imπ′. Let φ∈U0. Then U⊆kerφ, so by Theorem 4.4.10 (a) there is a linear map ψ:V/U→F with ψ∘π=φ. This ψ lies in (V/U)∗, and π′(ψ)=φ.

So π′ is an injective linear map with image U0; regarded as a map onto U0 it is a linear bijection, hence an isomorphism.

Concretely, the inverse isomorphism U0→(V/U)∗ is φ↦φ¯, where φ¯(v+U)=φ(v). The formula is well defined precisely because φ vanishes on U: if v−v′∈U, then φ(v)−φ(v′)=φ(v−v′)=0.

The two theorems fit together as a mirror:

subspace U⊆V quotient V/U
its dual is a quotient of V∗: U∗≅V∗/U0 a subspace of V∗: (V/U)∗≅U0
the map ι′: restrict π′: compose with π
the map is surjective injective

The last row is no accident: ι is injective and π is surjective, and dualizing swaps the two properties.

Alternatively, in finite dimension both theorems follow from Theorem 5.4.3, which says kerT′=(imT)0 and imT′=(kerT)0. For T=π: imπ=V/U, whose annihilator is {0}, and kerπ=U, so π′ is injective with image U0. For T=ι: imι=U, so kerι′=U0, and kerι={0}, whose annihilator is all of U∗, so ι′ is surjective. The proofs above avoid dimension counts, which is why they work in every dimension.

Quick check. Let V be a vector space of dimension 6 and U a subspace of dimension 2. Find dim⁡U0, dim⁡(V/U)∗, dim⁡U∗, and dim⁡(V∗/U0), and check that the two theorems are consistent with these numbers.

Solution. By Theorem 5.2.2, dim⁡U0=6−2=4. By Theorem 4.4.5 and Corollary 5.1.4, dim⁡(V/U)∗=dim⁡(V/U)=4, matching (V/U)∗≅U0. Next, dim⁡U∗=dim⁡U=2, and dim⁡(V∗/U0)=6−4=2, matching U∗≅V∗/U0.

5.5.3. A line in R3, in coordinates

The theorems name their isomorphisms without choosing anything. To see them act, we now choose bases and compute. Recall that a functional on R3 is determined by its values on e1,e2,e3 (Theorem 5.1.1). So every φ∈(R3)∗ has the form φ(x,y,z)=ax+by+cz, with (a,b,c)=(φ(e1),φ(e2),φ(e3)). We write such a functional simply as ax+by+cz.

Example (Both isomorphisms for a line)

Let u=(1,2,−1) and U=span(u)⊆R3.

  • (a) Find a basis of U0.
  • (b) Find a basis of R3/U, its dual basis (ψ1,ψ2) of (R3/U)∗, and the images π′(ψ1),π′(ψ2).
  • (c) Describe the restriction map ρ:(R3)∗→U∗ and the isomorphism (R3)∗/U0→U∗.

Solution.

  • (a) By Theorem 5.2.3 (b), U0={u}0, so ax+by+cz∈U0 exactly when a+2b−c=0, that is, c=a+2b. Taking (a,b)=(1,0) and (0,1) gives φ1=x+z,φ2=y+2z. They are independent (look at the coefficients of x and y), and dim⁡U0=3−1=2 by Theorem 5.2.2, so (φ1,φ2) is a basis of U0 (Theorem 1.6.4).

  • (b) The list (u,e1,e2) is independent: in au+be1+ce2=(a+b,2a+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, and by Theorem 4.4.5 (e1+U,e2+U) is a basis of R3/U. Its dual basis consists of the ψi with ψi(ej+U)=δij (Theorem 5.1.3).

    The functional π′(ψ1)=ψ1∘π on R3 takes the values ψ1(e1+U)=1 at e1, ψ1(e2+U)=0 at e2, and ψ1(U)=0 at u. Writing it as ax+by+cz, this says a=1, b=0, and a+2b−c=0, so c=1. Similarly π′(ψ2) has a=0, b=1, c=2. Hence π′(ψ1)=x+z=φ1,π′(ψ2)=y+2z=φ2. So π′ carries the dual basis of (R3/U)∗ onto the basis of U0 found in (a), as Theorem 5.5.2 predicts. Read backwards: ψ1((x,y,z)+U)=x+z and ψ2((x,y,z)+U)=y+2z. These are well defined, since adding tu=(t,2t,−t) changes x+z by t−t=0 and y+2z by 2t−2t=0.

  • (c) The space U∗ is one-dimensional, with basis the functional ξ determined by ξ(u)=1 (the dual basis of (u)). A functional φ=ax+by+cz restricts to φ|U=φ(u)ξ=(a+2b−c)ξ, since both sides take the value a+2b−c at u. So ρ is “evaluate at u”. Its kernel is {a+2b−c=0}=U0, and it is surjective, since ρ(x)=ξ. The isomorphism of Theorem 5.5.1 is (ax+by+cz)+U0 ↦ (a+2b−c)ξ. For instance x+U0=−z+U0, because x−(−z)=φ1∈U0; both restrict to ξ.

5.5.4. Why “natural” matters here

In the example, bases entered only when we wanted numbers. The maps ρ and π′ were defined before any basis was chosen: restrict a functional, or compose it with π. That is what makes the two isomorphisms natural, in the sense of the discussion of the double dual. They are part of the structure of V and U, not of a coordinate system.

There is a tempting shortcut that is not natural. Since U∗ is a quotient of V∗, one might try to find a copy of U∗ inside V∗, as a subspace. This can be done, but only by making a choice. Pick a complement W of U, so V=U⊕W. A functional that vanishes on W is determined by its values on U, so the restriction ρ maps W0 isomorphically onto U∗ (Exercise (C2: Complements and a choice of copy of U∗)). But different complements give different subspaces W0.

Warning. U∗ is not a subspace of V∗. Its elements are functionals on U, which cannot be evaluated at vectors outside U. To place U∗ inside V∗ one must extend each functional, and extensions are not unique. In the example above, the complement W1=span(e1,e2) of U gives W10=span(z), while W2=span(e1,e3) gives W20=span(y). These are different lines in (R3)∗, and both restrict isomorphically onto U∗: z|U=−ξ and y|U=2ξ. The choice-free statement is U∗≅V∗/U0, a quotient.

The same caution applies on the other side, in reverse. (V/U)∗ is naturally a subspace of V∗, namely U0, but V/U itself is not a subspace of V. Duality turns the quotient, which has no natural home inside V, into a subspace, which does.

5.5.5. Codimension and hyperplanes

The quotient measures how far a subspace is from filling the whole space. In R3 a plane through the origin misses “one direction” and a line misses “two directions”. For finite-dimensional V the number of missing directions is dim⁡V−dim⁡U. But this formula is useless in F[x], where dim⁡V and dim⁡U may both be infinite, although U={p:p(0)=0} misses only one direction: every polynomial is a constant plus an element of U. The quotient gives the right number in every case.

The codimension of U counts the directions in V that U is missing.

Definition 5.5.1 (Codimension)

Let U be a subspace of a vector space V over F. If V/U is finite-dimensional, the codimension of U in V is codimU:=dim⁡(V/U). If V/U is infinite-dimensional, we say that U has infinite codimension.

In words: we do not compare the sizes of U and V. We collapse U to zero and measure what is left. The codimension depends on the ambient space, so when that is unclear we write “codimension of U in V”.

Definition 5.5.2 (Hyperplane)

A hyperplane in V is a subspace H of V of codimension exactly 1, that is, with dim⁡(V/H)=1.

Examples.

  • Finite dimension. If V is finite-dimensional, then codimU=dim⁡V−dim⁡U by Theorem 4.4.5. The hyperplanes of Fn are its subspaces of dimension n−1: the lines through 0 in F2 and the planes through 0 in F3.
  • Trace. In Mn(F) with n≥1, the trace-zero matrices are the kernel of tr:Mn(F)→F. This map is linear and surjective, since tr(cE11)=c, so Mn(F)/kertr≅F by Theorem 4.4.7, and the trace-zero matrices form a hyperplane.
  • Polynomials. In F[x], let U={p:p(0)=0}. Evaluation at 0 is a linear map F[x]→F with kernel U, and it is surjective because the constant c maps to c. By Theorem 4.4.7, F[x]/U≅F, so U is a hyperplane in the infinite-dimensional space F[x]. In the same way {p:p(0)=p(1)=0} has codimension 2 (Exercise (B3: Dimension computations)).
  • Degenerate cases. codimV=0, since V/V is the zero space, and codim{0}=dim⁡V when V is finite-dimensional. In particular V itself is not a hyperplane, and the only hyperplane of a one-dimensional space is {0}. The zero space {0} has no hyperplanes at all.

Nonexample by minimal change. In R3, the plane {x+y+z=0} is a hyperplane. Replace it by the line {x+y+z=0, x−y=0}=span((1,1,−2)). It is still a subspace, but its codimension is 3−1=2, so the clause “codimension exactly 1” fails. Replace it instead by {x+y+z=1}: now it is not a subspace at all, so it has no codimension. It is a coset of a hyperplane, an object we return to in the next section.

Why this definition. Codimension is the dual notion of dimension, and the duality theorems make this precise. If U has finite codimension, then by Theorem 5.5.2, Corollary 5.1.4, and Theorem 2.5.4, codimU=dim⁡(V/U)=dim⁡(V/U)∗=dim⁡U0, and this holds even when V is infinite-dimensional. So dimension counts vectors, and codimension counts independent equations. For finite-dimensional V this is Theorem 5.2.2 again: dim⁡U0=dim⁡V−dim⁡U.

Warning. In infinite dimension a hyperplane need not be “smaller” than the whole space. In F[x], the hyperplane U={p:p(0)=0}={xq:q∈F[x]} is isomorphic to F[x] itself, via q↦xq: this map is linear, injective (if xq=0 then q=0), and onto U. So you cannot detect codimension by comparing U with V up to isomorphism, and the formula codimU=dim⁡V−dim⁡U must never be used outside finite dimension. Always compute dim⁡(V/U), or count equations.

Hyperplanes are exactly the subspaces cut out by one nontrivial linear equation. In Fn this is familiar: a1x1+⋯+anxn=0 with the ai not all zero defines a subspace of dimension n−1. The quotient makes the statement true in every dimension.

Theorem 5.5.3 (Hyperplanes Are Kernels of Functionals)

Let V be a vector space over F, of any dimension, and let H be a subspace of V. Then H is a hyperplane if and only if H=kerφ for some nonzero φ∈V∗.

Idea. A nonzero functional maps onto the one-dimensional space F, so the First Isomorphism Theorem makes V/kerφ one-dimensional. Conversely, if V/H is one-dimensional, it “is” F after choosing an isomorphism, and composing that isomorphism with π gives a functional whose kernel is H.

Proof. (⇐) Suppose φ∈V∗ is nonzero. Then imφ is a subspace of F (Theorem 2.2.2) containing a nonzero scalar, so dim⁡imφ=1=dim⁡F, and imφ=F by Theorem 1.6.8. By Theorem 4.4.7, V/kerφ≅F, so dim⁡(V/kerφ)=1, and kerφ is a hyperplane.

(⇒) Suppose dim⁡(V/H)=1. By Theorem 2.5.4 there is an isomorphism θ:V/H→F. Let φ=θ∘π, where π:V→V/H is the quotient map. It is linear as a composition of linear maps (Theorem 2.4.2), so φ∈V∗. For v∈V, φ(v)=0 means θ(v+H)=0, which holds exactly when v+H is the zero coset, since θ is injective; and v+H=H means v∈H by Lemma 4.4.3 (b). So kerφ=H. Finally φ≠0: since V/H≠{0}, we have H≠V, so some v∉H=kerφ.

The functional is not unique, but almost: two functionals with the same kernel are scalar multiples of each other (Exercise (C1: Functionals with the same kernel); Exercise (B2: Functionals with the same kernel) gives a second proof). So hyperplanes of V correspond to nonzero functionals up to a nonzero scalar, just as the plane x+y+z=0 is also 2x+2y+2z=0.

A hyperplane together with any one vector outside it fills the space.

Remark. Let H=kerφ be a hyperplane and v0∉H. Then V=H⊕span(v0). Indeed φ(v0)≠0, and every v∈V splits as v=(v−φ(v)φ(v0)v0)+φ(v)φ(v0)v0, where the first bracket lies in kerφ because φ of it is φ(v)−φ(v)=0. And H∩span(v0)={0}, since φ(cv0)=cφ(v0)=0 forces c=0.

Quick check. Decide which of the following are hyperplanes, and for each hyperplane give a nonzero functional with that kernel.

  • (a) The symmetric matrices in M2(F).
  • (b) The symmetric matrices in M3(F).
  • (c) {p∈F[x]:p(1)=0} in F[x].

Solution.

  • (a) Yes. A is symmetric exactly when a12−a21=0, so the symmetric matrices are the kernel of A↦a12−a21, which is linear and nonzero (it takes the value 1 at E12). By Theorem 5.5.3 this is a hyperplane.

  • (b) No. The symmetric 3×3 matrices form a subspace of dimension 6 (choose the entries on and above the diagonal freely), so the codimension is 9−6=3≠1.

  • (c) Yes. It is the kernel of p↦p(1), which is linear (Theorem 0.8.5) and nonzero (it sends the constant 1 to 1).

5.5.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State the theorem identifying (V/U)∗ with a subspace of V∗, including the map.
  • (b) Define the codimension of a subspace, and define a hyperplane.
  • (c) True or false: U∗ is a subspace of V∗. Justify your answer.
  • (d) Let U be a subspace of dimension 2 in F5. Find dim⁡(F5/U)∗ and codimU.
  • (e) Is {(x1,x2,x3,x4)∈R4:x1=x2=0} a hyperplane in R4? Justify your answer.
  • (f) True or false: every nonzero linear functional φ:V→F is surjective. Justify your answer.

Solution.

  • (a) For a subspace U of V with quotient map π, the dual map π′:(V/U)∗→V∗, ψ↦ψ∘π, is injective with image U0; so (V/U)∗≅U0 (Theorem 5.5.2).

  • (b) If V/U is finite-dimensional, codimU=dim⁡(V/U); otherwise U has infinite codimension. A hyperplane is a subspace of codimension exactly 1.

  • (c) False. Elements of U∗ are defined only on U, so they are not elements of V∗. What is true is U∗≅V∗/U0, a quotient (Theorem 5.5.1).

  • (d) dim⁡(F5/U)∗=dim⁡(F5/U)=5−2=3, by Corollary 5.1.4 and Theorem 4.4.5. So codimU=3.

  • (e) No. The subspace is span(e3,e4), of dimension 2, so its codimension is 4−2=2.

  • (f) True, in any dimension. This is Proposition 5.1.2: imφ is a subspace of the one-dimensional space F containing a nonzero element, so it is F.

B. Practice

Exercise (B1: The dual of a quotient of R4)

Let U=span((1,−1,0,2),(0,1,1,−1))⊆R4, and write functionals on R4 as a1x1+a2x2+a3x3+a4x4.

  • (a) Find a basis (φ1,φ2) of U0.
  • (b) Let ψ1,ψ2∈(R4/U)∗ be the functionals with π′(ψi)=φi. Compute ψ1 and ψ2 at the coset (2,0,1,3)+U.
  • (c) Find a basis of R4/U whose dual basis is (ψ1,ψ2).

Solution.

  • (a) A functional lies in U0 exactly when it vanishes at both spanning vectors (Theorem 5.2.3 (b)), that is, a1−a2+2a4=0,a2+a3−a4=0. The second gives a3=a4−a2, and the first gives a1=a2−2a4. Taking (a2,a4)=(1,0) and (−1,−1) gives (1,1,−1,0) and (1,−1,0,−1), that is, φ1=x1+x2−x3,φ2=x1−x2−x4. Check: φ1(1,−1,0,2)=0, φ1(0,1,1,−1)=0, φ2(1,−1,0,2)=1+1−2=0, φ2(0,1,1,−1)=−1+1=0. They are independent (compare the coefficients of x3 and x4). The spanning vectors of U are independent (compare first entries, then second), so dim⁡U0=4−2=2 by Theorem 5.2.2, and (φ1,φ2) is a basis by Theorem 1.6.4.

  • (b) By Theorem 5.5.2, ψi(v+U)=φi(v). So ψ1((2,0,1,3)+U)=2+0−1=1 and ψ2((2,0,1,3)+U)=2−0−3=−1.

  • (c) We need cosets c1,c2 with ψi(cj)=δij. The vector −e3 has φ1(−e3)=1 and φ2(−e3)=0, and −e4 has φ1(−e4)=0, φ2(−e4)=1. Put c1=−e3+U and c2=−e4+U. If ac1+bc2=0, applying ψ1 and ψ2 gives a=0 and b=0; so (c1,c2) is independent, and since dim⁡(R4/U)=2 it is a basis (Theorem 1.6.4). By construction ψi(cj)=δij, so (ψ1,ψ2) is its dual basis (Theorem 5.1.3).

Exercise (B2: Functionals with the same kernel)

Let V be a vector space over F, of any dimension, and let φ,ψ∈V∗ be nonzero. Prove that kerφ=kerψ if and only if ψ=cφ for some nonzero c∈F. (Exercise (C1: Functionals with the same kernel) proved (⇒) by a different route; here use the hyperplane decomposition.)

Hint: the remark after Theorem 5.5.3.

Solution. (⇐) If ψ=cφ with c≠0, then ψ(v)=0 if and only if cφ(v)=0, if and only if φ(v)=0, since c is invertible. So kerψ=kerφ.

(⇒) Suppose kerφ=kerψ=H. Since φ≠0, choose v0 with φ(v0)≠0; then v0∉H, so also ψ(v0)≠0. Put c=ψ(v0)/φ(v0), which is nonzero, and χ=ψ−cφ∈V∗. Then χ vanishes on H, because both ψ and φ do, and χ(v0)=ψ(v0)−cφ(v0)=0. By Theorem 5.5.3 H is a hyperplane, and by the remark after it V=H⊕span(v0). A linear map vanishing on H and on v0 vanishes on every h+av0, hence on V. So χ=0, that is, ψ=cφ.

Exercise (B3: Dimension computations)
  • (a) Let dim⁡V=7 and dim⁡U=3. Find dim⁡U∗, dim⁡(V∗/U0), dim⁡(V/U)∗, and codimU.
  • (b) In V=F[x]≤3, let U={p:p(0)=p(1)=0}. Using the map T:V→F2, T(p)=(p(0),p(1)), find codimU and dim⁡U, and write U as an intersection of two hyperplanes.
  • (c) Hence find a basis of U0 consisting of evaluation functionals.

Solution.

  • (a) dim⁡U∗=3 by Corollary 5.1.4. dim⁡U0=7−3=4 by Theorem 5.2.2, so dim⁡(V∗/U0)=7−4=3 (Theorem 4.4.5), consistent with Theorem 5.5.1. dim⁡(V/U)∗=dim⁡(V/U)=4, consistent with Theorem 5.5.2, and codimU=4.

  • (b) T is linear because evaluation is (Theorem 0.8.5), and kerT=U. It is surjective: T(1)=(1,1) and T(x)=(0,1) span F2. By Theorem 4.4.7, V/U≅F2, so codimU=2, and dim⁡U=4−2=2 by Theorem 4.4.5. Writing ε0(p)=p(0) and ε1(p)=p(1), we have U=kerε0∩kerε1, and both kernels are hyperplanes by Theorem 5.5.3, since both functionals send 1 to 1.

  • (c) Both ε0 and ε1 lie in U0. They are independent: if aε0+bε1=0, evaluating at x gives b=0, and then evaluating at 1 gives a=0. Since dim⁡U0=4−2=2, (ε0,ε1) is a basis of U0 (Theorem 1.6.4).

C. Going deeper

Exercise (C1: Subspaces of finite codimension are intersections of hyperplanes)

Let V be a vector space over F, of any dimension, and let U be a subspace of finite codimension k≥1.

  • (a) Prove that there are nonzero φ1,…,φk∈U0 with U=kerφ1∩⋯∩kerφk. Deduce that U is an intersection of k hyperplanes.
  • (b) Prove that U is not an intersection of fewer than k hyperplanes.

Hint: for (a), take a dual basis of (V/U)∗; for (b), consider the map V→Fm, v↦(φ1(v),…,φm(v)).

Solution.

  • (a) Let π:V→V/U be the quotient map. Since dim⁡(V/U)=k, choose a basis (c1,…,ck) of V/U and let (ψ1,…,ψk) be its dual basis (Theorem 5.1.3). Put φi=ψi∘π. By Theorem 5.5.2, φi∈U0, and φi≠0 because π′ is injective and ψi≠0.

    Since each φi lies in U0, U⊆kerφi for each i. Conversely, let v∈kerφ1∩⋯∩kerφk, and write v+U=∑jajcj. Applying ψi gives ai=ψi(v+U)=φi(v)=0 for every i. So v+U is the zero coset, and v∈U by Lemma 4.4.3 (b). This proves U=⋂ikerφi. Each kerφi is a hyperplane by Theorem 5.5.3.

  • (b) Suppose U=H1∩⋯∩Hm with hyperplanes Hi. By Theorem 5.5.3, Hi=kerφi for nonzero φi∈V∗. The map S:V→Fm, S(v)=(φ1(v),…,φm(v)), is linear, since each entry is, and kerS=⋂ikerφi=U. By Theorem 4.4.7, V/U≅imS, a subspace of Fm. Hence k=dim⁡(V/U)=dim⁡imS≤m by Theorem 1.6.7. So at least k hyperplanes are needed.
Exercise (C2: Complements and a choice of copy of U∗)

Let V be finite-dimensional, and let U,W be subspaces with V=U⊕W.

  • (a) Prove that V∗=U0⊕W0 without using Theorem 5.2.3 (d). (This is Exercise (C3: Dual of a direct sum decomposition) (a), which used it.)
  • (b) Deduce that the restriction map ρ:V∗→U∗ restricts to an isomorphism W0→U∗.
  • (c) In R2, let U=span(e1), W1=span(e2), and W2=span((1,1)). Find W10 and W20, and find the element of each that restricts to the functional ξ∈U∗ with ξ(e1)=1. Conclude that the copy of U∗ inside V∗ depends on the complement.

Solution.

  • (a) Let n=dim⁡V. If φ∈U0∩W0, then φ vanishes on U and on W, hence on every u+w, that is, on U+W=V; so φ=0. By Theorem 5.2.2, dim⁡U0+dim⁡W0=(n−dim⁡U)+(n−dim⁡W)=2n−n=n, using dim⁡U+dim⁡W=n for a direct sum (Theorem 1.7.4). By Theorem 1.7.3, dim⁡(U0+W0)=n−0=n=dim⁡V∗, so U0+W0=V∗ (Theorem 1.6.8), and the sum is direct because the intersection is {0}.

  • (b) The restriction of ρ to W0 is linear. Its kernel is W0∩kerρ=W0∩U0={0} by Theorem 5.5.1 and (a), so it is injective. Its domain has dimension n−dim⁡W=dim⁡U=dim⁡U∗. An injective linear map between spaces of the same finite dimension is an isomorphism (Corollary 2.3.2 (e)).

  • (c) Write functionals on R2 as ax+by. W10 consists of those with b=0, so W10=span(x). W20 consists of those with a+b=0, so W20=span(x−y). Restricting to U: x|U and (x−y)|U both take the value 1 at e1, so both equal ξ. The elements x and x−y are different, so the subspaces W10≠W20 of V∗ are two different copies of U∗, one for each complement.

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.