5.2  Annihilators

Section 1 built the dual space V∗, the space of linear measurements on V. Now we connect subspaces of V with subspaces of V∗. A plane in R3 can be described by a spanning list or by an equation, and an equation is a functional. This section collects all the equations that a set of vectors satisfies into one subspace of V∗, the annihilator, counts its dimension, and shows that it turns sums into intersections and intersections into sums.

5.2.1. The equations a subspace satisfies

Every object comes with its subobjects. The dual space V∗ has subspaces of its own, and the question is which of them are attached to subspaces of V. The standard example shows the way.

Let U=span((1,0,1),(0,1,1)), a plane in R3. The functional φ(x,y,z)=x+y−z vanishes on both spanning vectors, so by linearity it vanishes on all of U: the plane satisfies the equation x+y−z=0. So do 2x+2y−2z=0 and the trivial equation 0=0. Which functionals vanish on U? By Theorem 5.1.1 a functional is ψ(x,y,z)=ax+by+cz. It vanishes on the two spanning vectors if and only if a+c=0 and b+c=0, that is, ψ=−c(x+y−z)=−cφ. So the equations of the plane form the line span(φ) in (R3)∗.

For the z-axis span((0,0,1)), the same computation gives c=0: the equations are ax+by=0, a plane in (R3)∗. A bigger subspace satisfies fewer equations, and in both cases the dimensions add up to 3. The set of equations deserves a name, and the pattern deserves a theorem.

The annihilator of a set of vectors is the space of all linear equations that every one of those vectors satisfies.

Definition 5.2.1 (Annihilator)

Let V be a vector space over F, and let S⊆V be any subset. The annihilator of S is S0:={φ∈V∗:φ(s)=0 for all s∈S}.

In words: S0 is a subset of the dual space V∗, not of V. A functional belongs to it when it vanishes at every vector of S; a single non-zero value disqualifies it. The set S needs no structure: it may be a subspace, a finite list of vectors, or even empty. The superscript 0 recalls the value that the functionals take on S.

Well-definedness. The definition makes sense for every subset. What needs checking is that the result is a subspace, which is what makes its dimension meaningful.

Proposition 5.2.1 (The Annihilator Is a Subspace)

Let V be a vector space over F, and let S⊆V. Then S0 is a subspace of V∗.

Proof. We use the subspace test (Theorem 1.2.1) in V∗. The zero functional sends every s∈S to 0, so it lies in S0. Let φ,ψ∈S0 and c∈F. For every s∈S, the pointwise operations of Definition 5.1.2 give (φ+ψ)(s)=φ(s)+ψ(s)=0+0=0,(cφ)(s)=cφ(s)=c⋅0=0. Hence φ+ψ∈S0 and cφ∈S0, and S0 is a subspace of V∗.

Example (First Annihilators)
  • (a) For any vector space V, find {0}0, ∅0 and V0.
  • (b) In M2(F), find the annihilator of the single matrix E11.
  • (c) In R[x]≤2, find the annihilator of S={1,x}.

Solution.

  • (a) Every functional sends 0 to 0 (Theorem 2.1.1), so {0}0=V∗. The condition “for all s∈∅” holds vacuously, so ∅0=V∗. A functional in V0 takes the value 0 at every vector, so it is the zero functional, and V0={0}. These degenerate cases fix the direction of everything that follows: the smallest subspace of V has the largest annihilator, and the largest has the smallest.

  • (b) Let εij(A)=aij be the dual basis of the standard basis (E11,E12,E21,E22). By Theorem 5.1.3 (c), every ψ∈M2(F)∗ is ψ=∑i,jψ(Eij)εij. Such a ψ lies in {E11}0 exactly when ψ(E11)=0. Hence {E11}0=span(ε12,ε21,ε22), the functionals A↦c12a12+c21a21+c22a22. It has dimension 3, and 3+1=4=dim⁡M2(F).

  • (c) Let (φ0,φ1,φ2) be the dual basis of (1,x,x2), so φk reads off the coefficient of xk. A functional ψ=ψ(1)φ0+ψ(x)φ1+ψ(x2)φ2 lies in S0 exactly when ψ(1)=ψ(x)=0, that is, when ψ=ψ(x2)φ2. So S0=span(φ2): the only equations satisfied by both 1 and x are the multiples of “the coefficient of x2 is 0”.

Non-example by minimal change. Shift the plane of the opening example off the origin: A={(x,y,z)∈R3:x+y−z=1}. The set is still cut out by the same left-hand side, but φ(x,y,z)=x+y−z takes the value 1, not 0, on A, so the defining clause φ(s)=0 fails and φ∉A0. In fact A0={0}: the set A contains (1,0,0), (0,1,0) and (0,0,−1), and a functional ax+by+cz vanishing at these three vectors has a=b=c=0. Annihilators record only homogeneous equations.

Why this definition. We allow any subset S, not only subspaces, because subspaces are usually handed to us by spanning lists, and we want to test a functional on the list alone. The theorem at the end of this section shows that this loses nothing: S0=(spanS)0. The name is literal. To annihilate is to reduce to nothing, and the functionals in S0 reduce every vector of S to 0.

Warning. U0 lives in V∗, and it is not a complement of U. It is tempting to turn the functional ax+by into the vector (a,b) and to picture U0 as a subspace of F2 “perpendicular” to U. Over F2 this picture fails completely. Let U=span((1,1))⊆F22. A functional ax+by vanishes on (1,1) exactly when a+b=0, that is, a=b, so U0={0, x+y}. The functional x+y corresponds to the vector (1,1), which lies in U. So the “picture” of U0 is U itself, not a complement. Perpendicularity needs an inner product, which is the orthogonal complement of Chapter 11; the annihilator needs nothing.

The payoff of the definition is the pattern we saw in the opening example. The equations of a subspace take up exactly the dimensions that the subspace leaves free.

5.2.2. Counting equations

Theorem 5.2.2 (Dimension of the Annihilator)

Let V be a finite-dimensional vector space over F, and let U be a subspace of V. Then dim⁡U+dim⁡U0=dim⁡V. More precisely, if (u1,…,um,vm+1,…,vn) is a basis of V extending a basis (u1,…,um) of U, with dual basis (φ1,…,φn), then (φm+1,…,φn) is a basis of U0.

Idea. This is a dimension formula, so we start from the smallest subspace, U, take a basis and extend it to V. The dual basis now splits in two. The last n−m functionals vanish on every ui, by the delta, so they vanish on U. The first m do not. To see that nothing else is in U0, expand a functional ψ∈U0 in the dual basis: its coefficients are its values on the basis, and the first m values are ψ(ui)=0.

Proof. Since U is a subspace of the finite-dimensional space V, it has a basis (u1,…,um) (Theorem 1.6.7, Corollary 1.5.5), and by the Basis Extension Theorem (Theorem 1.6.5) it extends to a basis B=(u1,…,um,vm+1,…,vn) of V, where n=dim⁡V. Let (φ1,…,φn) be the dual basis of B (Theorem 5.1.3).

The φj with j>m lie in U0. Let j>m and u∈U, say u=a1u1+⋯+amum. By Theorem 2.1.4, φj(u)=∑i=1maiφj(ui)=0, since φj(ui)=δji=0 for i≤m<j.

They span U0. Let ψ∈U0. By Theorem 5.1.3 (c), ψ=∑i=1mψ(ui)φi+∑j=m+1nψ(vj)φj=∑j=m+1nψ(vj)φj, because ψ(ui)=0 for ui∈U. Hence U0⊆span(φm+1,…,φn), and the reverse inclusion holds because U0 is a subspace (Proposition 5.2.1, Theorem 1.3.1).

They are independent, being part of the basis (φ1,…,φn) of V∗. Therefore (φm+1,…,φn) is a basis of U0, and dim⁡U0=n−m=dim⁡V−dim⁡U. This proves the theorem.

Alternatively, restrict functionals to U. The map R:V∗→U∗, φ↦φ|U, is linear, and its kernel is U0 by definition. It is surjective: given ξ∈U∗, Theorem 2.1.5 gives φ∈V∗ with φ(ui)=ξ(ui) and φ(vj)=0, and then φ|U=ξ because both agree on a basis of U. By the Rank–Nullity Theorem (Theorem 2.3.1) and Corollary 5.1.4, dim⁡V=dim⁡V∗=dim⁡U0+dim⁡U∗=dim⁡U0+dim⁡U. This route shows why the formula holds: a functional on V is a functional on U plus a choice of values off U, and U0 measures that choice.

The theorem is the second signature move of the chapter: pass to the dual and count. One immediate consequence: if U is a proper subspace of a finite-dimensional V, then dim⁡U0>0, so some non-zero functional vanishes on U. Equivalently, a list spans a finite-dimensional V if and only if the only functional that kills every vector of the list is 0: apply the previous sentence to the span U of the list, and note that a functional kills every vector of the list exactly when it kills U, by Theorem 2.1.4.

In Fn the whole computation becomes elimination, because functionals are rows.

Example (An Annihilator as a Null Space)

Find a basis of U0 for U=span((1,2,0),(0,1,1))⊆R3, and check the dimension formula.

Solution. By Theorem 5.1.1, every functional is φa(x)=a⊤x for a unique a=(a1,a2,a3). By linearity, φa vanishes on U if and only if it vanishes on the two spanning vectors (a combination of vectors killed by φa is killed, by Theorem 2.1.4). These two conditions are a1+2a2=0,a2+a3=0,that is,Aa=0withA=(120011), the matrix whose rows are the spanning vectors. So φa∈U0 if and only if a∈nul(A). Subtracting twice row 2 from row 1 gives the RREF (10−2011), with a3 free. By Theorem 3.5.4, nul(A)=span((2,−1,1)). Hence U0=span(ψ) with ψ(x,y,z)=2x−y+z. Check: ψ(1,2,0)=2−2+0=0 and ψ(0,1,1)=−1+1=0. The two spanning vectors are independent (neither is a multiple of the other), so dim⁡U=2, and dim⁡U+dim⁡U0=2+1=3, as Theorem 5.2.2 predicts. As a by-product, U is the plane 2x−y+z=0: U⊆kerψ, both have dimension 2 (Proposition 5.1.2), and Theorem 1.6.8 gives equality.

The same recipe works in general. For U=span(u1,…,um)⊆Fn, let A have rows u1⊤,…,um⊤. Then U0={φa:a∈nul(A)}, and the isomorphism of Theorem 5.1.1 carries a basis of nul(A) to a basis of U0.

Away from Fn, counting often replaces the computation entirely.

Example (The Equations of a Root Condition)

Let U={p∈R[x]≤2:p(1)=0}. Find U0.

Solution. Let ε1(p)=p(1), a linear functional (Example (Four Families of Functionals)). By definition U=kerε1, so ε1∈U0. Since ε1(1)=1, ε1≠0, and Proposition 5.1.2 gives dim⁡U=3−1=2. By Theorem 5.2.2, dim⁡U0=3−2=1. Now span(ε1) is a subspace of U0 (Proposition 5.2.1) of dimension 1, so U0=span(ε1) by Theorem 1.6.8.

We never found a basis of U and never solved an equation. The conclusion is concrete: a functional on R[x]≤2 vanishes on every polynomial with a root at 1 only if it is a multiple of p↦p(1).

Quick check. Let U=span((1,1,1))⊆R3. What is dim⁡U0? Name a basis of U0 without solving a system.

Solution. dim⁡U0=3−1=2 by Theorem 5.2.2. The functionals x−y and y−z vanish at (1,1,1), hence on U, and they are independent: in a(x−y)+b(y−z)=0, the coefficient of x gives a=0, and then b=0. Two independent vectors in a 2-dimensional space form a basis (Theorem 1.6.4).

5.2.3. Sums, intersections and spans

Taking annihilators reverses inclusions: more vectors satisfy fewer common equations. It also exchanges sums with intersections. In R3, let U be the xy-plane and W the xz-plane. Then U0=span(z) and W0=span(y), writing x,y,z for the coordinate functionals. The intersection U∩W is the x-axis, with annihilator span(y,z)=U0+W0. The sum U+W=R3 has annihilator {0}=U0∩W0. The theorem says this always happens.

Theorem 5.2.3 (Properties of Annihilators)

Let V be a vector space over F.

  • (a) If S⊆T⊆V, then T0⊆S0.
  • (b) For every subset S⊆V, S0=(spanS)0.
  • (c) For subspaces U,W of V, (U+W)0=U0∩W0.
  • (d) If V is finite-dimensional, then for subspaces U,W of V, (U∩W)0=U0+W0.

Idea. Parts (a)–(c) are unwinding definitions: fix a functional in one side and test it on the vectors of the other. In (d), the inclusion U0+W0⊆(U∩W)0 is also direct. The reverse inclusion is the hard half. Given φ vanishing on U∩W, we would have to split it as ψ+χ with ψ killing U and χ killing W, and nothing in sight tells us how. So we count instead: one inclusion plus equal dimensions gives equality. The plan is ① compute dim⁡(U0+W0) by the dimension formula for sums inside V∗; ② replace U0∩W0 by (U+W)0 using (c); ③ turn every annihilator dimension into a dimension in V with Theorem 5.2.2; ④ recognize the dimension formula in V. Finite dimension is spent in step ③.

Proof.

  • (a) Let φ∈T0. Every s∈S lies in T, so φ(s)=0. Hence φ∈S0.

  • (b) Since S⊆spanS (Theorem 1.3.1), part (a) gives (spanS)0⊆S0. Conversely, let φ∈S0 and v∈spanS, say v=a1s1+⋯+aksk with si∈S and k≥0. By Theorem 2.1.4, φ(v)=∑iaiφ(si)=0. Hence φ∈(spanS)0.

  • (c) Since U⊆U+W and W⊆U+W (Theorem 1.7.1), part (a) gives (U+W)0⊆U0 and (U+W)0⊆W0, so (U+W)0⊆U0∩W0. Conversely, let φ∈U0∩W0, and let u+w∈U+W with u∈U, w∈W. Then φ(u+w)=φ(u)+φ(w)=0+0=0. Hence φ∈(U+W)0.

  • (d) (⊇) Let φ=ψ+χ with ψ∈U0 and χ∈W0, and let v∈U∩W. Since v∈U and v∈W, φ(v)=ψ(v)+χ(v)=0+0=0. Hence U0+W0⊆(U∩W)0.

(⊆) Let n=dim⁡V. The subspaces U, W, U∩W (Theorem 1.2.2) and U+W (Theorem 1.7.1) of V are finite-dimensional by Theorem 1.6.7. The space V∗ has dimension n by Corollary 5.1.4, so its subspaces U0, W0 are finite-dimensional too. By the Dimension Formula for Sums (Theorem 1.7.3) in V∗, then (c), dim⁡(U0+W0)=dim⁡U0+dim⁡W0−dim⁡(U0∩W0)=dim⁡U0+dim⁡W0−dim⁡(U+W)0. By Theorem 5.2.2 applied to U, W and U+W, the right-hand side is (n−dim⁡U)+(n−dim⁡W)−(n−dim⁡(U+W))=n−(dim⁡U+dim⁡W−dim⁡(U+W))=n−dim⁡(U∩W), where the last equality is Theorem 1.7.3 in V. By Theorem 5.2.2 once more, n−dim⁡(U∩W)=dim⁡(U∩W)0. So U0+W0 is a subspace of (U∩W)0 (by (⊇) and Theorem 1.7.1) with the same finite dimension, and Theorem 1.6.8 gives U0+W0=(U∩W)0. This proves the theorem.

Part (b) is what made the computations of this section legitimate: to find the annihilator of a subspace, test functionals on a spanning list only. Parts (c) and (d) form a dictionary. A subspace given as a sum has equations obtained by intersecting equation spaces; a subspace given as an intersection has equations obtained by adding them. Later in this chapter this dictionary becomes a practical method for computing sums and intersections of subspaces.

Remark. Parts (a)–(c) and the inclusion (⊇) in (d) hold in every vector space; only the counting step used finite dimension. The equality (d) is in fact true for every V, but the proof must then construct the splitting φ=ψ+χ by hand; Exercise C1 below does this. In finite dimension, (a) also becomes strict: if U⊊W, then dim⁡U<dim⁡W (Theorem 1.6.8), so dim⁡W0<dim⁡U0 and W0⊊U0.

5.2.4. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the annihilator S0 of a subset S of a vector space V.
  • (b) True or false: U0 is a subspace of V. Justify your answer.
  • (c) Let U be a 2-dimensional subspace of R5. What is dim⁡U0?
  • (d) For a finite-dimensional V, what are {0}0 and V0?
  • (e) True or false: if U⊊W are subspaces of a finite-dimensional V, then W0⊊U0. Justify your answer.
  • (f) To compute U0 for U=span(u1,…,um)⊆Fn, which matrix do you row reduce, and why?

Solution.

B. Practice

Exercise (B1: Computing annihilators)
  • (a) Let U=span((1,2,1,0),(2,4,3,1),(1,2,2,1))⊆R4. Find a basis of U0, and verify that dim⁡U+dim⁡U0=4.
  • (b) Let U={p∈R[x]≤3:p(1)=p(−1)=0}. Show that U0=span(ε1,ε−1), where εc(p)=p(c).

Solution.

  • (a) Let A have the three spanning vectors as rows. As in Example (An Annihilator as a Null Space), φa∈U0 if and only if Aa=0. Subtracting 2 times row 1 from row 2 and row 1 from row 3 gives rows (1,2,1,0), (0,0,1,1), (0,0,1,1); subtracting row 2 from row 3 and then row 2 from row 1 gives the RREF (120−100110000). The free variables are a2 and a4, and Theorem 3.5.4 gives nul(A)=span((−2,1,0,0),(1,0,−1,1)). Hence U0 has the basis ψ1(x1,x2,x3,x4)=−2x1+x2,ψ2(x1,x2,x3,x4)=x1−x3+x4. Check on the first two spanning vectors: ψ1(1,2,1,0)=0, ψ2(1,2,1,0)=0, ψ1(2,4,3,1)=0, ψ2(2,4,3,1)=2−3+1=0; the third vector is their difference, (2,4,3,1)−(1,2,1,0). The RREF has two pivots, so dim⁡U=dim⁡row(A)=2 (Theorem 3.5.5), and 2+2=4.

  • (b) By definition ε1,ε−1∈U0. Independent: if aε1+bε−1=0, applying it to x+1 gives 2a=0 and applying it to x−1 gives −2b=0. Dimension of U: the map T:R[x]≤3→R2, p↦(p(1),p(−1)), is linear with kernel U, and its image contains T(x+1)=(2,0) and T(x−1)=(0,−2), which span R2. So rankT=2 and dim⁡U=4−2=2 by Theorem 2.3.1. By Theorem 5.2.2, dim⁡U0=2. Hence the 2-dimensional subspace span(ε1,ε−1) of U0 is all of U0 (Theorem 1.6.8).

Exercise (B2: Equations of the symmetric matrices)

Let U={A∈M2(R):A⊤=A}. Find U0, and verify the dimension formula.

Solution. Every symmetric matrix is aE11+b(E12+E21)+cE22, so U=span(E11,E12+E21,E22). Let (εij) be the dual basis of the standard basis, so that every ψ∈M2(R)∗ is ψ=∑i,jcijεij with cij=ψ(Eij) (Theorem 5.1.3 (c)). By Theorem 5.2.3 (b), ψ∈U0 if and only if ψ kills the three spanning matrices: c11=0,c12+c21=0,c22=0. So ψ=c12(ε12−ε21), and U0=span(ε12−ε21): the only equation of the symmetric matrices, up to scaling, is a12−a21=0. The three spanning matrices are independent (they involve disjoint sets of entries), so dim⁡U=3, and dim⁡U+dim⁡U0=3+1=4=dim⁡M2(R).

Exercise (B3: The equations of a hyperplane)

Let V be a finite-dimensional vector space over F, and let φ∈V∗ be non-zero. Prove that (kerφ)0=span(φ).

Solution. By definition of the kernel, φ vanishes on kerφ, so φ∈(kerφ)0, and span(φ)⊆(kerφ)0 by Proposition 5.2.1. Since φ≠0, dim⁡span(φ)=1, and Proposition 5.1.2 gives dim⁡kerφ=dim⁡V−1. By Theorem 5.2.2, dim⁡(kerφ)0=dim⁡V−(dim⁡V−1)=1. A 1-dimensional subspace of a 1-dimensional space is the whole space (Theorem 1.6.8), so (kerφ)0=span(φ).

C. Going deeper

Exercise (C1: The intersection formula without counting)

Let U,W be subspaces of a vector space V over F, and let φ∈(U∩W)0.

  • (a) Suppose V is finite-dimensional. Construct ψ∈U0 and χ∈W0 with φ=ψ+χ, without using any dimension formula.
  • (b) Explain how to modify the construction when V is infinite-dimensional. Deduce that (U∩W)0=U0+W0 holds in every vector space.

Hint: extend a basis of U∩W to a basis of U and, separately, to a basis of W.

Solution.

  • (a) Let (x1,…,xk) be a basis of U∩W (Theorem 1.2.2, Theorem 1.6.7). Extend it to a basis (x1,…,xk,u1,…,up) of U and to a basis (x1,…,xk,w1,…,wq) of W (Theorem 1.6.5).

    The combined list (x1,…,xk,u1,…,up,w1,…,wq) is independent. Let ∑aixi+∑biui+∑cjwj=0. Then ∑cjwj=−∑aixi−∑biui lies in W and in U, hence in U∩W, so ∑cjwj=∑dixi for some di∈F. Since (x,w) is a basis of W, all cj and di are 0. Then ∑aixi+∑biui=0, and since (x,u) is a basis of U, all ai and bi are 0.

    Extend the combined list to a basis of V by vectors y1,…,yr (Theorem 1.6.5). By Theorem 2.1.5 there is ψ∈V∗ with ψ(xi)=0,ψ(ui)=0,ψ(wj)=φ(wj),ψ(yl)=0. Then ψ kills a basis of U, so ψ∈U0 (Theorem 5.2.3 (b)). Put χ:=φ−ψ. Then χ(xi)=φ(xi)−0=0, because xi∈U∩W and φ∈(U∩W)0; and χ(wj)=φ(wj)−φ(wj)=0. So χ kills a basis of W, and χ∈W0. Hence φ=ψ+χ∈U0+W0.

  • (b) Replace the finite lists by sets. By Theorem 1.8.3, U∩W has a basis X, and by Theorem 1.8.2 it extends to a basis X∪P of U and to a basis X∪Q of W, with P∩X=Q∩X=∅. First, P∩Q=∅: a vector of P∩Q lies in U∩W=spanX, which contradicts the independence of X∪P. So every vector of X∪P∪Q lies in exactly one of X, P, Q. A linear relation among finitely many distinct vectors of X∪P∪Q splits into an X-part, a P-part and a Q-part, and the independence argument of (a) applies word for word; so X∪P∪Q is independent. By Theorem 1.8.2 it extends to a basis B of V. Every v∈V is a finite combination v=∑bcbb of distinct vectors of B, with unique coefficients because B is independent. Define ψ(v):=∑b∈Qcbφ(b), a finite sum over the vectors of Q that occur. Adding or scaling expansions gives expansions, so by uniqueness the coefficients add and scale, and ψ is linear. It vanishes on X∪P and agrees with φ on Q, so the rest of (a) is unchanged: ψ∈U0 and χ=φ−ψ kills the basis X∪Q of W. Together with the inclusion (⊇) of Theorem 5.2.3 (d), which used no finiteness, this gives (U∩W)0=U0+W0 in every vector space.
Exercise (C2: Equations of a double root)

Let U={p∈R[x]≤3:p(1)=0 and p′(1)=0}, and let ε1(p)=p(1) and η1(p)=p′(1). Prove that U0=span(ε1,η1). Deduce that ψ(p)=p(0)−p(2)+2p′(1) does not vanish on U.

Solution. Both ε1 and η1 are linear (evaluation, and differentiation followed by evaluation), and they vanish on U by definition. Independent: if aε1+bη1=0, applying it to 1 gives a=0, and applying it to x−1 gives b=0. Dimension of U: the linear map T:R[x]≤3→R2, p↦(p(1),p′(1)), has kernel U, and T(1)=(1,0), T(x−1)=(0,1), so T is surjective. By Theorem 2.3.1, dim⁡U=4−2=2, and by Theorem 5.2.2, dim⁡U0=2. The 2-dimensional subspace span(ε1,η1) of U0 is therefore all of U0 (Theorem 1.6.8).

For the deduction, suppose ψ∈U0. Then ψ=aε1+bη1. Applying both sides to 1 gives 1−1+0=a, so a=0; applying them to x−1 gives −1−1+2=b, so b=0. Then ψ=0. But ψ(x2)=0−4+4=0 and ψ(x3)=0−8+6=−2≠0, a contradiction. Hence ψ∉U0. Check with an explicit witness: p=x(x−1)2∈U has ψ(p)=0−2+0=−2≠0.

Exercise (C3: Dual of a direct sum decomposition)
  • (a) Let V be finite-dimensional with V=U⊕W. Prove that V∗=U0⊕W0.
  • (b) In R2, let U=span((1,0)) and W=span((1,1)). Write ψ(x,y)=x as ψU+ψW with ψU∈U0 and ψW∈W0.

Solution.

  • (a) Since the sum is direct, U∩W={0} (Theorem 1.7.4), and U+W=V. By Theorem 5.2.3 (c) and Example (First Annihilators) (a), U0∩W0=(U+W)0=V0={0}. By Theorem 5.2.3 (d), U0+W0=(U∩W)0={0}0=V∗. So V∗=U0+W0, and the sum is direct by Theorem 1.7.4.

  • (b) A functional ax+by vanishes on (1,0) if and only if a=0, so U0=span(y). It vanishes on (1,1) if and only if b=−a, so W0=span(x−y). Solving x=sy+t(x−y) gives t=1 and s−t=0, so s=1: ψ=y⏟∈U0+(x−y)⏟∈W0. By (a) this decomposition is unique.

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.