Unit 4, lesson 19

Adjoints and Gram Matrices

How the adjoint of a linear map comes from Riesz representation, why adjoints reverse compositions, how Gram matrices enter the adjoint's matrix, and how orthogonal complements relate its kernel and image to those of the map.

  • Video 19
  • Representation and Adjoints

A linear map T ⁣:V→WT \colon V \to W between finite-dimensional inner product spaces sends an input vv to an output TvTv, and a fixed vector ww in WW reads that output as the number ⟨Tv,w⟩\langle Tv, w \rangle. Is there one vector in VV that gives the same reading directly from the input, for every vv at once? For each ww there is exactly one such vector, and the rule that assigns it to ww is the adjoint T∗T^{*}. This lesson builds the adjoint from the Riesz representation theorem, finds its matrix in bases that are not orthonormal, and shows that its kernel and image are the orthogonal complements of the image and kernel of TT. Throughout, F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, inner products are conjugate-linear in the first argument and linear in the second, and a tuple such as (1,i)(1, i) stands for a column vector.

Key terms

Adjoint of a linear map

Definition Let VV and WW be finite-dimensional inner product spaces over F\mathbb{F} and let T ⁣:V→WT \colon V \to W be linear. The adjoint of TT is the unique map T∗ ⁣:W→VT^{*} \colon W \to V that satisfies the adjoint identity

⟨Tv,w⟩W=⟨v,T∗w⟩Vfor all v∈V and w∈W.\begin{gathered} \langle Tv, w \rangle_W = \langle v, T^{*}w \rangle_V \\[0.4em] \text{for all } v \in V \text{ and } w \in W. \end{gathered}

Such a map exists, is unique and is linear. Fix w∈Ww \in W. The rule v↦⟨w,Tv⟩Wv \mapsto \langle w, Tv \rangle_W is a linear functional on VV, because TT and the second slot are linear, so the Riesz representation theorem gives exactly one z∈Vz \in V with ⟨z,v⟩V=⟨w,Tv⟩W\langle z, v \rangle_V = \langle w, Tv \rangle_W for every vv. Set T∗w=zT^{*}w = z. Conjugating both sides gives the adjoint identity, and any map that satisfies the identity must send ww to this same representing vector, which proves uniqueness. For linearity, conjugate-linearity of the first slot gives

⟨aw1+bw2,Tv⟩=a‾ ⟨T∗w1,v⟩+b‾ ⟨T∗w2,v⟩=⟨aT∗w1+bT∗w2,v⟩,\begin{aligned} &\langle aw_1 + bw_2, Tv \rangle \\[0.4em] &\quad = \overline{a}\,\langle T^{*}w_1, v \rangle + \overline{b}\,\langle T^{*}w_2, v \rangle \\[0.4em] &\quad = \langle aT^{*}w_1 + bT^{*}w_2, v \rangle, \end{aligned}

so uniqueness of the representing vector gives T∗(aw1+bw2)=aT∗w1+bT∗w2T^{*}(aw_1 + bw_2) = aT^{*}w_1 + bT^{*}w_2. The adjoint depends on the inner products of both spaces. It is not the dual map T∨ ⁣:W∨→V∨T^{\vee} \colon W^{\vee} \to V^{\vee}, ℓ↦ℓ∘T\ell \mapsto \ell \circ T, which needs no inner product, and in general it is not an inverse. On Fn\mathbb{F}^n and Fm\mathbb{F}^m with the standard inner products, the adjoint of v↦Avv \mapsto Av is w↦A∗ww \mapsto A^{*}w, because (Av)∗w=v∗A∗w(Av)^{*}w = v^{*}A^{*}w.

In plain words The adjoint moves a measurement from the output side to the input side. Reading the output TvTv against ww gives the same number as reading the input vv against T∗wT^{*}w.

Example In C2\mathbb{C}^2 with the standard inner product, let

A=[12i01+i],A∗=[10−2i1−i].\begin{gathered} A = \begin{bmatrix} 1 & 2i \\ 0 & 1 + i \end{bmatrix}, \\[0.4em] A^{*} = \begin{bmatrix} 1 & 0 \\ -2i & 1 - i \end{bmatrix}. \end{gathered}

Take v=(1,1)v = (1, 1) and w=(i,1)w = (i, 1). Then Av=(1+2i,1+i)Av = (1 + 2i, 1 + i), and conjugating its entries gives

⟨Av,w⟩=(1−2i) i+(1−i)=3.\langle Av, w \rangle = (1 - 2i)\,i + (1 - i) = 3.

On the other side A∗w=(i,3−i)A^{*}w = (i, 3 - i) and ⟨v,A∗w⟩=i+(3−i)=3\langle v, A^{*}w \rangle = i + (3 - i) = 3, as the identity requires. The plain transpose gives ATw=(i,−1+i)A^{\mathsf{T}}w = (i, -1 + i) and the reading −1+2i-1 + 2i, so without conjugation the identity fails. The product A∗AA^{*}A has rows (1,2i)(1, 2i) and (−2i,6)(-2i, 6). It is not II, so this adjoint is not the inverse of AA.

Adjoint of a composition

Definition Let UU, VV and WW be finite-dimensional inner product spaces over F\mathbb{F}, and let T ⁣:U→VT \colon U \to V and S ⁣:V→WS \colon V \to W be linear. Then

(ST)∗=T∗S∗.(ST)^{*} = T^{*}S^{*}.

For u∈Uu \in U and w∈Ww \in W, two uses of the adjoint identity give

⟨STu,w⟩=⟨Tu,S∗w⟩=⟨u,T∗S∗w⟩,\begin{aligned} \langle STu, w \rangle &= \langle Tu, S^{*}w \rangle \\[0.4em] &= \langle u, T^{*}S^{*}w \rangle, \end{aligned}

so T∗S∗T^{*}S^{*} satisfies the defining identity of (ST)∗(ST)^{*}, and uniqueness of the adjoint gives equality. The same uniqueness argument proves the other rules. For linear maps T,T1,T2 ⁣:V→WT, T_1, T_2 \colon V \to W and a scalar a∈Fa \in \mathbb{F},

(T∗)∗=T,I∗=I,(T1+T2)∗=T1∗+T2∗,(aT)∗=a‾ T∗.\begin{gathered} (T^{*})^{*} = T, \qquad I^{*} = I, \\[0.4em] (T_1 + T_2)^{*} = T_1^{*} + T_2^{*}, \\[0.4em] (aT)^{*} = \overline{a}\,T^{*}. \end{gathered}

The first rule follows by conjugating the adjoint identity, which gives ⟨T∗w,v⟩=⟨w,Tv⟩\langle T^{*}w, v \rangle = \langle w, Tv \rangle. The scalar rule holds because a scalar comes out of the first slot conjugated, so ⟨aTv,w⟩=a‾ ⟨Tv,w⟩=⟨v,a‾ T∗w⟩\langle aTv, w \rangle = \overline{a}\,\langle Tv, w \rangle = \langle v, \overline{a}\,T^{*}w \rangle.

In plain words Adjoints reverse the order of a composition, as transposes and inverses do. Sums pass through unchanged, and a scalar comes out conjugated.

Example In C2\mathbb{C}^2 with the standard inner product, take

S=[0110],A=[1i01].S = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}, \qquad A = \begin{bmatrix} 1 & i \\ 0 & 1 \end{bmatrix}.

The product SASA has rows (0,1)(0, 1) and (1,i)(1, i), so

(SA)∗=[011−i]=A∗S∗,(SA)^{*} = \begin{bmatrix} 0 & 1 \\ 1 & -i \end{bmatrix} = A^{*}S^{*},

while S∗A∗S^{*}A^{*} has rows (−i,1)(-i, 1) and (1,0)(1, 0). Keeping the original order gives the wrong matrix. Also (iA)∗(iA)^{*} has rows (−i,0)(-i, 0) and (−1,−i)(-1, -i), which is −i A∗-i\,A^{*} and not i A∗i\,A^{*}.

Matrix of the adjoint in a general basis

Definition Let VV and WW be finite-dimensional inner product spaces over F\mathbb{F}, let T ⁣:V→WT \colon V \to W be linear, let B=(b1,…,bn)\mathcal{B} = (b_1, \dots, b_n) be a basis of VV and C=(c1,…,cm)\mathcal{C} = (c_1, \dots, c_m) a basis of WW, and let the Gram matrices be

(GV)ij=⟨bi,bj⟩V,(GW)ij=⟨ci,cj⟩W.\begin{aligned} (G_V)_{ij} &= \langle b_i, b_j \rangle_V, \\[0.4em] (G_W)_{ij} &= \langle c_i, c_j \rangle_W. \end{aligned}

In coordinates ⟨v,v′⟩V=[v]B∗ GV [v′]B\langle v, v' \rangle_V = [v]_{\mathcal{B}}^{*}\,G_V\,[v']_{\mathcal{B}}, and likewise in WW. The Gram matrix of a basis is invertible. If GVz=0G_V z = 0, then z∗GVz=0z^{*}G_V z = 0, and this number is the squared norm of ∑izibi\sum_i z_i b_i, so that vector is 00 and z=0z = 0. If A=[T]C←B∈Fm×nA = [T]_{\mathcal{C} \leftarrow \mathcal{B}} \in \mathbb{F}^{m \times n}, then

[T∗]B←C=GV−1A∗GW∈Fn×m.[T^{*}]_{\mathcal{B} \leftarrow \mathcal{C}} = G_V^{-1}A^{*}G_W \in \mathbb{F}^{n \times m}.

To derive it, write x=[v]Bx = [v]_{\mathcal{B}}, y=[w]Cy = [w]_{\mathcal{C}} and M=[T∗]B←CM = [T^{*}]_{\mathcal{B} \leftarrow \mathcal{C}}. The two sides of the adjoint identity become

⟨Tv,w⟩W=x∗A∗GW y,⟨v,T∗w⟩V=x∗GVM y.\begin{aligned} \langle Tv, w \rangle_W &= x^{*}A^{*}G_W\,y, \\[0.4em] \langle v, T^{*}w \rangle_V &= x^{*}G_V M\,y. \end{aligned}

They agree for all columns xx and yy, and standard basis columns pick out single entries, so A∗GW=GVMA^{*}G_W = G_V M. In orthonormal bases both Gram matrices are identity matrices and the matrix of the adjoint is A∗A^{*}, which is ATA^{\mathsf{T}} when F=R\mathbb{F} = \mathbb{R}. In other bases the bare conjugate transpose is generally wrong.

In plain words Coordinates forget the inner product, and the Gram matrices put it back. In orthonormal bases the adjoint’s matrix is the conjugate transpose, and in other bases it generally is not.

Example Give R2\mathbb{R}^2 the dot product and the basis b1=(1,0)b_1 = (1, 0), b2=(1,2)b_2 = (1, 2), give R\mathbb{R} the basis (1)(1), and let T(x1,x2)=x2T(x_1, x_2) = x_2. Then T(b1)=0T(b_1) = 0 and T(b2)=2T(b_2) = 2, so A=[02]A = \begin{bmatrix} 0 & 2 \end{bmatrix} and GW=1G_W = 1, while

GV=[1115],GV−1=14[5−1−11].\begin{gathered} G_V = \begin{bmatrix} 1 & 1 \\ 1 & 5 \end{bmatrix}, \\[0.4em] G_V^{-1} = \frac{1}{4}\begin{bmatrix} 5 & -1 \\ -1 & 1 \end{bmatrix}. \end{gathered}

The formula gives the coordinate column GV−1(0,2)=(−12,12)G_V^{-1}(0, 2) = (-\tfrac12, \tfrac12), which is the vector −12b1+12b2=(0,1)-\tfrac12 b_1 + \tfrac12 b_2 = (0, 1). That is right, since T(x)=(0,1)⋅xT(x) = (0, 1) \cdot x and so T∗(s)=(0,s)T^{*}(s) = (0, s). The bare transpose column (0,2)(0, 2) would stand for 2b2=(2,4)2b_2 = (2, 4), and it fails the identity at v=(1,0)v = (1, 0), where ⟨Tv,1⟩=0\langle Tv, 1 \rangle = 0 but (1,0)⋅(2,4)=2(1, 0) \cdot (2, 4) = 2.

Orthogonal complement

Definition Let UU be a subspace of an inner product space VV over F\mathbb{F}. Its orthogonal complement is

U⊥={v∈V∣⟨u,v⟩=0 ∀u∈U}.U^{\perp} = \{ v \in V \mid \langle u, v \rangle = 0 \ \forall u \in U \}.

It is a subspace, and by conjugate symmetry the order of the two slots does not matter. It meets UU only in 00, because a vector orthogonal to itself has squared norm 00. If u1,…,uru_1, \dots, u_r span UU, then v∈U⊥v \in U^{\perp} exactly when ⟨ui,v⟩=0\langle u_i, v \rangle = 0 for each ii. Now let dim⁡V=n\dim V = n and dim⁡U=k\dim U = k. Extend a basis of UU to a basis of VV and apply Gram-Schmidt in that order. Gram-Schmidt keeps the span of each initial segment, so the result is an orthonormal basis q1,…,qnq_1, \dots, q_n of VV whose first kk vectors form a basis of UU. Every vv equals ∑j⟨qj,v⟩qj\sum_j \langle q_j, v \rangle q_j, and it lies in U⊥U^{\perp} exactly when its first kk coefficients vanish. Hence

U⊥=span⁡{qk+1,…,qn},dim⁡U⊥=n−k.\begin{gathered} U^{\perp} = \operatorname{span}\{q_{k+1}, \dots, q_n\}, \\[0.4em] \dim U^{\perp} = n - k. \end{gathered}

In plain words The orthogonal complement collects every vector perpendicular to all of UU. In a finite-dimensional space it has exactly as many dimensions as UU lacks, and together with UU it spans the whole space.

Example In C3\mathbb{C}^3 with the standard inner product, let U=span⁡{(1,i,0)}U = \operatorname{span}\{(1, i, 0)\}. A vector vv lies in U⊥U^{\perp} when

⟨(1,i,0),v⟩=v1−i v2=0,\langle (1, i, 0), v \rangle = v_1 - i\,v_2 = 0,

so U⊥=span⁡{(i,1,0),(0,0,1)}U^{\perp} = \operatorname{span}\{(i, 1, 0), (0, 0, 1)\}, of dimension 3−1=23 - 1 = 2. Indeed ⟨(1,i,0),(i,1,0)⟩=i−i=0\langle (1, i, 0), (i, 1, 0) \rangle = i - i = 0. Dropping the conjugation would suggest the vector (−i,1,0)(-i, 1, 0) instead, but ⟨(1,i,0),(−i,1,0)⟩=−2i≠0\langle (1, i, 0), (-i, 1, 0) \rangle = -2i \ne 0.

Double orthogonal complement

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

(U⊥)⊥=U.(U^{\perp})^{\perp} = U.

The inclusion U⊆(U⊥)⊥U \subseteq (U^{\perp})^{\perp} holds in every inner product space, since each u∈Uu \in U is orthogonal to every vector of U⊥U^{\perp}. For the reverse inclusion, take the orthonormal basis q1,…,qnq_1, \dots, q_n from the previous card, with U=span⁡{q1,…,qk}U = \operatorname{span}\{q_1, \dots, q_k\} and U⊥=span⁡{qk+1,…,qn}U^{\perp} = \operatorname{span}\{q_{k+1}, \dots, q_n\}. A vector vv is orthogonal to U⊥U^{\perp} exactly when ⟨qj,v⟩=0\langle q_j, v \rangle = 0 for every j>kj > k, which says that vv lies in UU. Counting dimensions gives the same conclusion, because (U⊥)⊥(U^{\perp})^{\perp} contains UU and has dimension n−(n−k)=kn - (n - k) = k. For any subset SS of VV the identity becomes (S⊥)⊥=span⁡S(S^{\perp})^{\perp} = \operatorname{span} S. Finite dimension is a real hypothesis here. In infinite-dimensional inner product spaces the identity can fail.

In plain words Taking the perpendicular directions twice brings you back to the subspace you started with, provided the space is finite-dimensional.

Example Give R2\mathbb{R}^2 the inner product ⟨x,y⟩=2x1y1+x2y2\langle x, y \rangle = 2x_1y_1 + x_2y_2 and let U=span⁡{(1,1)}U = \operatorname{span}\{(1, 1)\}. A vector vv lies in U⊥U^{\perp} when 2v1+v2=02v_1 + v_2 = 0, so U⊥=span⁡{(1,−2)}U^{\perp} = \operatorname{span}\{(1, -2)\}. A vector vv is orthogonal to (1,−2)(1, -2) when 2v1−2v2=02v_1 - 2v_2 = 0, so (U⊥)⊥=span⁡{(1,1)}=U(U^{\perp})^{\perp} = \operatorname{span}\{(1, 1)\} = U. The complement itself depends on the inner product. For the dot product it would be the span of (1,−1)(1, -1), but in this inner product ⟨(1,1),(1,−1)⟩=1≠0\langle (1, 1), (1, -1) \rangle = 1 \ne 0.

Kernel and image of the adjoint

Definition Let VV and WW be finite-dimensional inner product spaces over F\mathbb{F} and let T ⁣:V→WT \colon V \to W be linear. Then

(im⁡T)⊥=ker⁡T∗,(ker⁡T)⊥=im⁡T∗.\begin{gathered} (\operatorname{im} T)^{\perp} = \ker T^{*}, \\[0.4em] (\ker T)^{\perp} = \operatorname{im} T^{*}. \end{gathered}

The first equality is between subspaces of WW, the second between subspaces of VV. For the first, w∈(im⁡T)⊥w \in (\operatorname{im} T)^{\perp} means ⟨Tv,w⟩=0\langle Tv, w \rangle = 0 for every vv, that is ⟨v,T∗w⟩=0\langle v, T^{*}w \rangle = 0 for every vv. Choosing v=T∗wv = T^{*}w gives ∥T∗w∥2=0\lVert T^{*}w \rVert^2 = 0, so T∗w=0T^{*}w = 0. Conversely, T∗w=0T^{*}w = 0 makes every such pairing zero. Applying the first identity to T∗T^{*}, whose adjoint is TT, gives (im⁡T∗)⊥=ker⁡T(\operatorname{im} T^{*})^{\perp} = \ker T, and taking orthogonal complements with the double complement identity gives the second. Consequently

W=im⁡T⊕ker⁡T∗,V=ker⁡T⊕im⁡T∗,\begin{gathered} W = \operatorname{im} T \oplus \ker T^{*}, \\[0.4em] V = \ker T \oplus \operatorname{im} T^{*}, \end{gathered}

and rank⁡T∗=rank⁡T\operatorname{rank} T^{*} = \operatorname{rank} T.

In plain words The vectors the adjoint sends to zero are exactly those perpendicular to everything TT can reach. What the adjoint can reach is exactly what is perpendicular to the kernel of TT.

Example In C2\mathbb{C}^2 with the standard inner product, let

A=[1i22i],A∗=[12−i−2i].A = \begin{bmatrix} 1 & i \\ 2 & 2i \end{bmatrix}, \qquad A^{*} = \begin{bmatrix} 1 & 2 \\ -i & -2i \end{bmatrix}.

The second column of AA is ii times the first, so im⁡A=span⁡{(1,2)}\operatorname{im} A = \operatorname{span}\{(1, 2)\} and ker⁡A=span⁡{(−i,1)}\ker A = \operatorname{span}\{(-i, 1)\}. Also A∗y=(y1+2y2)(1,−i)A^{*}y = (y_1 + 2y_2)(1, -i), so ker⁡A∗=span⁡{(2,−1)}\ker A^{*} = \operatorname{span}\{(2, -1)\} and im⁡A∗=span⁡{(1,−i)}\operatorname{im} A^{*} = \operatorname{span}\{(1, -i)\}. Both identities check out, since

⟨(1,2),(2,−1)⟩=2−2=0,⟨(−i,1),(1,−i)⟩=i−i=0.\begin{aligned} \langle (1, 2), (2, -1) \rangle &= 2 - 2 = 0, \\[0.4em] \langle (-i, 1), (1, -i) \rangle &= i - i = 0. \end{aligned}

The plain transpose has image span⁡{(1,i)}\operatorname{span}\{(1, i)\} instead, and ⟨(−i,1),(1,i)⟩=2i≠0\langle (-i, 1), (1, i) \rangle = 2i \ne 0, so that image is not (ker⁡A)⊥(\ker A)^{\perp}.

Check yourself

  1. Give C2\mathbb{C}^2 and C\mathbb{C} their standard inner products and let T(z1,z2)=z1+iz2T(z_1, z_2) = z_1 + iz_2. Find T∗T^{*}.
Show the answer

In the standard bases, which are orthonormal, the matrix of TT is the row [1i]\begin{bmatrix} 1 & i \end{bmatrix}. Its conjugate transpose is the column (1,−i)(1, -i), so T∗(s)=(s,−is)T^{*}(s) = (s, -is). Check the identity directly. Since iz2‾=−i z2‾\overline{iz_2} = -i\,\overline{z_2},

⟨z,T∗s⟩=z1‾ s−i z2‾ s=z1+iz2‾ s=⟨Tz,s⟩.\begin{aligned} \langle z, T^{*}s \rangle &= \overline{z_1}\,s - i\,\overline{z_2}\,s \\[0.4em] &= \overline{z_1 + iz_2}\,s = \langle Tz, s \rangle. \end{aligned}

The answer (s,is)(s, is) forgets the conjugation and fails this check.

  1. Let T ⁣:V→WT \colon V \to W be a linear map between inner product spaces with dim⁡V=3\dim V = 3, dim⁡W=5\dim W = 5 and rank⁡T=2\operatorname{rank} T = 2. Find the dimensions of ker⁡T∗\ker T^{*} and im⁡T∗\operatorname{im} T^{*}, and say which space each one lies in.
Show the answer

The kernel ker⁡T∗=(im⁡T)⊥\ker T^{*} = (\operatorname{im} T)^{\perp} is a subspace of WW of dimension 5−2=35 - 2 = 3. By rank-nullity, dim⁡ker⁡T=3−2=1\dim \ker T = 3 - 2 = 1, so the image im⁡T∗=(ker⁡T)⊥\operatorname{im} T^{*} = (\ker T)^{\perp} is a subspace of VV of dimension 3−1=23 - 1 = 2. The ranks agree, while the kernels of TT and T∗T^{*} have different dimensions, 11 and 33.

  1. Give R2\mathbb{R}^2 the inner product ⟨x,y⟩=3x1y1+x2y2\langle x, y \rangle = 3x_1y_1 + x_2y_2, give R\mathbb{R} the ordinary product, and let T(x)=x1+2x2T(x) = x_1 + 2x_2. Find T∗(1)T^{*}(1) and check the adjoint identity at x=(1,1)x = (1, 1) and y=2y = 2. Why is (1,2)(1, 2) the wrong answer?
Show the answer

The standard basis of R2\mathbb{R}^2 has Gram matrix G=diag⁡(3,1)G = \operatorname{diag}(3, 1), and the matrix of TT is the row [12]\begin{bmatrix} 1 & 2 \end{bmatrix}, so

T∗(1)=G−1[12]=[1/32].T^{*}(1) = G^{-1}\begin{bmatrix} 1 \\ 2 \end{bmatrix} = \begin{bmatrix} 1/3 \\ 2 \end{bmatrix}.

At the given vectors Tx=3Tx = 3 and ⟨Tx,y⟩=6\langle Tx, y \rangle = 6. On the other side T∗(2)=(23,4)T^{*}(2) = (\tfrac23, 4) and ⟨x,T∗(2)⟩=3⋅23+4=6\langle x, T^{*}(2) \rangle = 3 \cdot \tfrac23 + 4 = 6. The column (1,2)(1, 2) is the adjoint for the dot product, not for this inner product. It would give T∗(2)=(2,4)T^{*}(2) = (2, 4) and the reading 3⋅2+4=103 \cdot 2 + 4 = 10, which does not match. As a further check, ker⁡T\ker T is spanned by (2,−1)(2, -1), and ⟨(2,−1),(13,2)⟩=2−2=0\langle (2, -1), (\tfrac13, 2) \rangle = 2 - 2 = 0, as the identity (ker⁡T)⊥=im⁡T∗(\ker T)^{\perp} = \operatorname{im} T^{*} requires.

How this lesson connects