Unit 2, lesson 12

Annihilators and Fundamental Subspaces

What the annihilator of a subspace is, why in finite dimensions its dimension is that of the space minus that of the subspace, and how annihilators describe a dual map's kernel and image, the row space and the left nullspace.

  • Video 12
  • Linear Measurements and Dual Maps

The map T(x,y)=(x,y,x+y)T(x, y) = (x, y, x + y) from R2\mathbb{R}^2 to R3\mathbb{R}^3 only produces outputs whose third coordinate is the sum of the first two. So the measurement ℓ(w)=w1+w2−w3\ell(w) = w_1 + w_2 - w_3 reads zero on every output, and its reading of −1-1 on (1,2,4)(1, 2, 4) proves that this vector is never an output. This lesson studies the measurements that vanish on a subspace, counts them, and uses them to describe the kernel and image of a dual map and the four fundamental subspaces of a matrix, all without any notion of perpendicular. Throughout, F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, a tuple such as (1,−1,0)(1, -1, 0) stands for a column vector, and a functional on Fn\mathbb{F}^n is written as a formula or as a row that acts on columns by matrix multiplication, with no conjugation.

Key terms

Annihilator

Definition Let VV be a vector space over F\mathbb{F} and UU a subspace of VV. The annihilator of UU is

U0={ℓ∈V∨∣ℓ(u)=0for all u∈U}.\begin{aligned} U^{0} = \{\ell \in V^{\vee} \mid {} & \ell(u) = 0 \\[0.4em] & \text{for all } u \in U\}. \end{aligned}

It is a subspace of the dual space V∨V^{\vee}, not of VV. The zero functional lies in it, and if ℓ1\ell_1 and ℓ2\ell_2 vanish on UU, then so does aℓ1+bℓ2a\ell_1 + b\ell_2 for all scalars a,ba, b. If u1,…,uku_1, \dots, u_k span UU, then ℓ∈U0\ell \in U^{0} exactly when ℓ(u1)=⋯=ℓ(uk)=0\ell(u_1) = \cdots = \ell(u_k) = 0, because a linear functional that vanishes on a spanning list vanishes on every combination of it.

In plain words The annihilator collects the measurements that cannot see UU at all. Each of them reads zero on every vector of UU, so it gives the same reading on all vectors of a coset v+Uv + U.

Example In R3\mathbb{R}^3 let UU be spanned by (1,2,0)(1, 2, 0) and (0,1,1)(0, 1, 1). A functional ℓ(x,y,z)=ax+by+cz\ell(x, y, z) = ax + by + cz lies in U0U^{0} when a+2b=0a + 2b = 0 and b+c=0b + c = 0, so a=−2ba = -2b and c=−bc = -b. Taking b=−1b = -1 shows that U0U^{0} is spanned by

ℓ(x,y,z)=2x−y+z,\ell(x, y, z) = 2x - y + z,

and indeed ℓ(1,2,0)=0\ell(1, 2, 0) = 0 and ℓ(0,1,1)=0\ell(0, 1, 1) = 0. In R2\mathbb{R}^2, the annihilator of the xx-axis consists of the multiples of the coordinate functional (x,y)↦y(x, y) \mapsto y.

Dimension of an annihilator

Definition Let VV be a finite-dimensional vector space over F\mathbb{F} and UU a subspace of VV. Then

dim⁡U0=dim⁡V−dim⁡U.\dim U^{0} = \dim V - \dim U.

To prove it, let dim⁡V=n\dim V = n and dim⁡U=k\dim U = k, extend a basis b1,…,bkb_1, \dots, b_k of UU to a basis b1,…,bnb_1, \dots, b_n of VV, and let β1,…,βn\beta_1, \dots, \beta_n be the dual basis, with βi(bj)=δij\beta_i(b_j) = \delta_{ij}. Every ℓ∈V∨\ell \in V^{\vee} equals ∑iℓ(bi)βi\sum_{i} \ell(b_i)\beta_i, and it vanishes on UU exactly when ℓ(b1)=⋯=ℓ(bk)=0\ell(b_1) = \cdots = \ell(b_k) = 0. So U0U^{0} is spanned by βk+1,…,βn\beta_{k+1}, \dots, \beta_n, and these n−kn - k functionals are independent because they are part of a basis. The extreme cases are {0}0=V∨\{0\}^{0} = V^{\vee} and V0={0}V^{0} = \{0\}. The proof extends a finite basis, and the formula is stated only for finite-dimensional VV.

In plain words A subspace of dimension kk imposes kk independent conditions on a measurement, so n−kn - k independent measurements remain that ignore it. The bigger the subspace, the fewer independent measurements vanish on it.

Example Let UU be the line in R3\mathbb{R}^3 spanned by b1=(1,1,0)b_1 = (1, 1, 0), and extend with b2=(0,1,0)b_2 = (0, 1, 0) and b3=(0,0,1)b_3 = (0, 0, 1). The dual basis is

β1(x,y,z)=x,β2(x,y,z)=y−x,β3(x,y,z)=z,\begin{gathered} \beta_1(x, y, z) = x, \quad \beta_2(x, y, z) = y - x, \\[0.4em] \beta_3(x, y, z) = z, \end{gathered}

as the checks βi(bj)=δij\beta_i(b_j) = \delta_{ij} confirm. For instance β2(b1)=1−1=0\beta_2(b_1) = 1 - 1 = 0 and β2(b2)=1\beta_2(b_2) = 1. So U0U^{0} is spanned by β2\beta_2 and β3\beta_3 and has dimension 3−1=23 - 1 = 2. Directly, ax+by+czax + by + cz vanishes at (1,1,0)(1, 1, 0) exactly when a=−ba = -b, which gives b(y−x)+czb(y - x) + cz.

Kernel of the dual map

Definition Let VV and WW be vector spaces over F\mathbb{F} and T∈Hom⁡(V,W)T \in \operatorname{Hom}(V, W), with dual map T∨(ℓ)=ℓ∘TT^{\vee}(\ell) = \ell \circ T. Then

ker⁡T∨=(im⁡T)0,\ker T^{\vee} = (\operatorname{im} T)^{0},

an equality of subspaces of W∨W^{\vee}. Indeed, ℓ∈ker⁡T∨\ell \in \ker T^{\vee} means ℓ∘T=0\ell \circ T = 0, that is, ℓ(Tv)=0\ell(Tv) = 0 for every v∈Vv \in V, and the vectors TvTv are exactly the vectors of im⁡T\operatorname{im} T. If WW is finite-dimensional and TT has rank rr, then dim⁡ker⁡T∨=dim⁡W−r\dim \ker T^{\vee} = \dim W - r, so T∨T^{\vee} is injective exactly when TT is surjective.

In plain words An output measurement pulls back to zero exactly when it reads zero on everything TT can produce. A nonzero reading of such a measurement on a vector proves that TT never produces that vector, and when WW is finite-dimensional, every vector that TT misses gets a nonzero reading from one of them.

Example For T(x,y)=(x,y,x+y)T(x, y) = (x, y, x + y) from the opening, the image is the plane w3=w1+w2w_3 = w_1 + w_2 and the rank is 22. The functional ℓ(w)=w1+w2−w3\ell(w) = w_1 + w_2 - w_3 pulls back to x+y−(x+y)=0x + y - (x + y) = 0, so ℓ∈ker⁡T∨\ell \in \ker T^{\vee}. Since dim⁡ker⁡T∨=3−2=1\dim \ker T^{\vee} = 3 - 2 = 1, the kernel of T∨T^{\vee} is spanned by ℓ\ell. Here TT is injective but T∨T^{\vee} is not, because TT misses outputs such as (1,2,4)(1, 2, 4).

Image of the dual map

Definition Let VV and WW be finite-dimensional vector spaces over F\mathbb{F} and T∈Hom⁡(V,W)T \in \operatorname{Hom}(V, W). Then

im⁡T∨=(ker⁡T)0,\operatorname{im} T^{\vee} = (\ker T)^{0},

and in particular rank⁡T∨=rank⁡T\operatorname{rank} T^{\vee} = \operatorname{rank} T. One inclusion is direct. If ℓ∈W∨\ell \in W^{\vee} and v∈ker⁡Tv \in \ker T, then (T∨ℓ)(v)=ℓ(Tv)=ℓ(0)=0(T^{\vee}\ell)(v) = \ell(Tv) = \ell(0) = 0, so im⁡T∨⊆(ker⁡T)0\operatorname{im} T^{\vee} \subseteq (\ker T)^{0}. For equality, let n=dim⁡Vn = \dim V, m=dim⁡Wm = \dim W and r=rank⁡Tr = \operatorname{rank} T. The kernel identity gives dim⁡ker⁡T∨=m−r\dim \ker T^{\vee} = m - r, so rank-nullity for T∨T^{\vee} on the mm-dimensional space W∨W^{\vee} gives dim⁡im⁡T∨=r\dim \operatorname{im} T^{\vee} = r. The annihilator formula gives dim⁡(ker⁡T)0=n−(n−r)=r\dim (\ker T)^{0} = n - (n - r) = r. A subspace contained in another of the same finite dimension equals it.

In plain words A pulled-back measurement can never see a direction that TT sends to zero. Conversely, every input measurement that ignores those directions comes from some output measurement.

Example Let T(x,y,z)=(x−z,y+2z)T(x, y, z) = (x - z, y + 2z) from R3\mathbb{R}^3 to R2\mathbb{R}^2. Its kernel is spanned by (1,−2,1)(1, -2, 1), so (ker⁡T)0(\ker T)^{0} consists of the functionals ax+by+czax + by + cz with a−2b+c=0a - 2b + c = 0, a space of dimension 22. An output functional pw1+qw2pw_1 + qw_2 pulls back to

p(x−z)+q(y+2z)=px+qy+(2q−p)z,\begin{aligned} &p(x - z) + q(y + 2z) \\[0.4em] &\quad = px + qy + (2q - p)z, \end{aligned}

and its coefficients satisfy p−2q+(2q−p)=0p - 2q + (2q - p) = 0. Conversely, a functional ax+by+czax + by + cz with c=2b−ac = 2b - a is the pullback of aw1+bw2aw_1 + bw_2. Both TT and T∨T^{\vee} have rank 22.

Row space and left nullspace

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n} have rank rr, viewed as the map x↦Axx \mapsto Ax from Fn\mathbb{F}^n to Fm\mathbb{F}^m. Functionals on Fn\mathbb{F}^n and Fm\mathbb{F}^m are rows of length nn and mm, and the dual map sends an output row yy to the input row yAyA. Its image is the row space Row⁡A\operatorname{Row} A, the span of the rows of AA, and its kernel is the left nullspace, the set of rows yy with yA=0yA = 0. The two previous cards give

Row⁡A=(Null⁡A)0,{y∣yA=0}=(Col⁡A)0.\begin{aligned} \operatorname{Row} A &= (\operatorname{Null} A)^{0}, \\[0.4em] \{y \mid yA = 0\} &= (\operatorname{Col} A)^{0}. \end{aligned}

So the column space in Fm\mathbb{F}^m has dimension rr, the nullspace in Fn\mathbb{F}^n has dimension n−rn - r, the row space, made of rows of length nn, has dimension rr, and the left nullspace, made of rows of length mm, has dimension m−rm - r. In particular the row rank of AA equals its column rank. Written as columns, the left nullspace is Null⁡AT\operatorname{Null} A^{\mathsf{T}}, since yA=0yA = 0 exactly when ATyT=0A^{\mathsf{T}}y^{\mathsf{T}} = 0. Over C\mathbb{C} this uses the plain transpose, with no conjugation.

In plain words The rows of AA are measurements on inputs, and the row space contains every input measurement obtained by pulling back an output measurement. The left nullspace contains the output measurements that are blind to every output AA produces. Each space is described by what it annihilates, with no dot product involved.

Example The real matrix

A=[121242]A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 4 & 2 \end{bmatrix}

has rank 11. Its column space is the line spanned by (1,2)(1, 2) in R2\mathbb{R}^2, and its nullspace is the plane x+2y+z=0x + 2y + z = 0 in R3\mathbb{R}^3, with basis (−2,1,0)(-2, 1, 0) and (−1,0,1)(-1, 0, 1). Every yAyA equals (y1+2y2)[121](y_1 + 2y_2)\begin{bmatrix} 1 & 2 & 1 \end{bmatrix}, so the row space is spanned by [121]\begin{bmatrix} 1 & 2 & 1 \end{bmatrix}, which reads 00 on both null basis vectors, and its dimension is 3−2=13 - 2 = 1. The left nullspace is spanned by [2−1]\begin{bmatrix} 2 & -1 \end{bmatrix}, which reads 2−2=02 - 2 = 0 on (1,2)(1, 2), and its dimension is 2−1=12 - 1 = 1. The same row reads 2−3=−12 - 3 = -1 on (1,3)(1, 3), so Ax=(1,3)Ax = (1, 3) has no solution.

Annihilator versus orthogonal complement

Definition For a subspace UU of VV, the annihilator U0U^{0} is a subspace of V∨V^{\vee} and needs no extra structure. If VV is an inner product space over F\mathbb{F}, with the inner product conjugate-linear in its first argument and linear in its second, the orthogonal complement

U⊥={v∈V∣⟨u,v⟩=0for all u∈U}\begin{aligned} U^{\perp} = \{v \in V \mid {} & \langle u, v \rangle = 0 \\[0.4em] & \text{for all } u \in U\} \end{aligned}

is a subspace of VV itself, and it depends on the inner product. When VV is finite-dimensional, the inner product matches the two. Each v∈Vv \in V gives the functional ℓv(x)=⟨v,x⟩\ell_v(x) = \langle v, x \rangle, every functional on VV arises in this way from exactly one vv, and ℓv∈U0\ell_v \in U^{0} exactly when v∈U⊥v \in U^{\perp}. The correspondence v↦ℓvv \mapsto \ell_v is linear over R\mathbb{R} and conjugate-linear over C\mathbb{C}. With the standard inner product ⟨x,z⟩=x∗z\langle x, z \rangle = x^{*}z on Fn\mathbb{F}^n, a row yy annihilates UU exactly when the column y∗y^{*} lies in U⊥U^{\perp}.

In plain words An annihilator is made of measurements, and an orthogonal complement is made of vectors. An inner product turns each vector into a measurement, and through that identification the two sets correspond. Change the inner product and U⊥U^{\perp} can move, while U0U^{0} stays where it was.

Example In C2\mathbb{C}^2 let UU be spanned by (1,i)(1, i). The row [−i1]\begin{bmatrix} -i & 1 \end{bmatrix} reads −i+i=0-i + i = 0 on it, so it spans U0U^{0}. With ⟨x,z⟩=x∗z\langle x, z \rangle = x^{*}z the orthogonal complement is spanned by (i,1)(i, 1), since ⟨(1,i),(i,1)⟩=i−i=0\langle (1, i), (i, 1) \rangle = i - i = 0, and (i,1)(i, 1) is the conjugate transpose of that row. The plain transpose (−i,1)(-i, 1) is not in U⊥U^{\perp}, because ⟨(1,i),(−i,1)⟩=−i−i=−2i\langle (1, i), (-i, 1) \rangle = -i - i = -2i. In R2\mathbb{R}^2 with UU spanned by (1,1)(1, 1), the annihilator is spanned by the functional (x,y)↦x−y(x, y) \mapsto x - y whatever the inner product. The dot product gives U⊥U^{\perp} spanned by (1,−1)(1, -1), while the inner product ⟨v,w⟩=2v1w1+v2w2\langle v, w \rangle = 2v_1w_1 + v_2w_2 gives U⊥U^{\perp} spanned by (1,−2)(1, -2), since 2⋅1⋅1+1⋅(−2)=02 \cdot 1 \cdot 1 + 1 \cdot (-2) = 0.

Check yourself

  1. Find a basis of the annihilator of the line spanned by (1,2,3)(1, 2, 3) in R3\mathbb{R}^3, and check its dimension against the formula.
Show the answer

A functional ax+by+czax + by + cz vanishes on the line exactly when a+2b+3c=0a + 2b + 3c = 0, that is, a=−2b−3ca = -2b - 3c with bb and cc free. So every such functional is b(−2x+y)+c(−3x+z)b(-2x + y) + c(-3x + z), and −2x+y-2x + y and −3x+z-3x + z form a basis. Both read zero at (1,2,3)(1, 2, 3), since −2+2=0-2 + 2 = 0 and −3+3=0-3 + 3 = 0. The dimension is 2=3−12 = 3 - 1, as the formula predicts.

  1. Let T(x,y)=(x−y,2x−2y)T(x, y) = (x - y, 2x - 2y) on R2\mathbb{R}^2. Find ker⁡T∨\ker T^{\vee} and im⁡T∨\operatorname{im} T^{\vee} directly, and compare them with (im⁡T)0(\operatorname{im} T)^{0} and (ker⁡T)0(\ker T)^{0}.
Show the answer

The output functional pw1+qw2pw_1 + qw_2 pulls back to p(x−y)+q(2x−2y)=(p+2q)(x−y)p(x - y) + q(2x - 2y) = (p + 2q)(x - y). It is zero exactly when p+2q=0p + 2q = 0, so ker⁡T∨\ker T^{\vee} is spanned by 2w1−w22w_1 - w_2, and im⁡T∨\operatorname{im} T^{\vee} is spanned by x−yx - y. The image of TT is the line spanned by (1,2)(1, 2), and cw1+dw2cw_1 + dw_2 vanishes on it when c+2d=0c + 2d = 0, so (im⁡T)0(\operatorname{im} T)^{0} is also spanned by 2w1−w22w_1 - w_2. The kernel of TT is the line spanned by (1,1)(1, 1), and ax+byax + by vanishes on it when a+b=0a + b = 0, so (ker⁡T)0(\ker T)^{0} is also spanned by x−yx - y. Both identities hold, and both TT and T∨T^{\vee} have rank 11.

  1. Let T(x,y,z)=(x,y)T(x, y, z) = (x, y) from R3\mathbb{R}^3 to R2\mathbb{R}^2. True or false? Because TT has a nonzero kernel, T∨T^{\vee} has a nonzero kernel.
Show the answer

False. The kernel of T∨T^{\vee} is the annihilator of the image, not of the kernel. The image of TT is all of R2\mathbb{R}^2, so ker⁡T∨=(R2)0={0}\ker T^{\vee} = (\mathbb{R}^2)^{0} = \{0\} and T∨T^{\vee} is injective. Directly, pw1+qw2pw_1 + qw_2 pulls back to px+qypx + qy, which is zero only when p=q=0p = q = 0. The kernel of TT, the zz-axis, constrains the image of T∨T^{\vee} instead. That image is (ker⁡T)0(\ker T)^{0}, the functionals ax+byax + by that ignore zz, of dimension 3−1=23 - 1 = 2, so T∨T^{\vee} is not surjective onto the 33-dimensional space (R3)∨(\mathbb{R}^3)^{\vee}.

How this lesson connects

It also uses the four fundamental subspaces of a matrix.