Linear-Algebra-Done-Right ยท Unit 12 ยท Video 1 ยท Interactive Practice

Upper-Triangular Matrices and Invariant Spans

IKey Formulas

FormulaNameHypotheses
Tvk=A1,kv1+โ‹ฏ+An,kvnTv_k = A_{1,k}v_1 + \cdots + A_{n,k}v_nColumn kk of M(T)\mathcal{M}(T) holds the coordinates of TvkTv_kVV finite-dimensional, TโˆˆL(V)T \in \mathcal{L}(V), v1,โ€ฆ,vnv_1, \ldots, v_n a basis of VV
Aj,k=0A_{j,k} = 0 whenever j>kj > kUpper triangular: at least n(nโˆ’1)2\frac{n(n-1)}{2} of the n2n^2 entries are 00M(T)\mathcal{M}(T) is nn-by-nn
M(T)\mathcal{M}(T) upper triangular โ€…โ€ŠโŸบโ€…โ€Š\iff span(v1,โ€ฆ,vk)\text{span}(v_1, \ldots, v_k) invariant under TT for each kk โ€…โ€ŠโŸบโ€…โ€Š\iff Tvkโˆˆspan(v1,โ€ฆ,vk)Tv_k \in \text{span}(v_1, \ldots, v_k) for each kkConditions for an upper-triangular matrixTโˆˆL(V)T \in \mathcal{L}(V), v1,โ€ฆ,vnv_1, \ldots, v_n a basis of VV, k=1,โ€ฆ,nk = 1, \ldots, n
Tv=ฮปvTv = \lambda v, basis v,v2,โ€ฆ,vnv, v_2, \ldots, v_n โ‡’\Rightarrow column 11 is (ฮป,0,โ€ฆ,0)(\lambda, 0, \ldots, 0)An eigenvector first clears column 11 below the diagonalVV finite-dimensional, vโ‰ 0v \neq 0; such vv exists when F=C\mathbf{F} = \mathbf{C} and Vโ‰ {0}V \neq \{0\}

Key Insight: Being upper triangular is a property of TT together with an ordered basis. The theorem turns it into nn vector checks: TvkTv_k may use only v1,โ€ฆ,vkv_1, \ldots, v_k.

IIAn Eigenvector First Clears Column 1

On R2\mathbf{R}^2, M(T,(v1,v2))\mathcal{M}(T, (v_1, v_2)) is upper triangular exactly when Tv1โˆˆspan(v1)Tv_1 \in \text{span}(v_1), that is, when v1v_1 is an eigenvector.

๐Ÿ’ก Challenge: find the two lines through the origin on which v1v_1 makes A2,1=0A_{2,1} = 0 for T(x,y)=(x+y,2y)T(x, y) = (x + y, 2y). For the rotation there is none: over R\mathbf{R} it has no eigenvalue.

IIIHow Many Entries Must Be Zero

Row jj of an nn-by-nn upper-triangular matrix has jโˆ’1j - 1 forced zeros, so n(nโˆ’1)2\frac{n(n-1)}{2} in all.

IVSame Vectors, Different Order

For T(x,y,z)=(2x+y,ย 5y+3z,ย 8z)T(x, y, z) = (2x + y,\ 5y + 3z,\ 8z), only one of the six orders of e1,e2,e3e_1, e_2, e_3 gives an upper-triangular matrix.

VQuiz Questions

Problem 1 ยท Differentiation, Basis Reversed

Given: DโˆˆL(P2(R))D \in \mathcal{L}(\mathcal{P}_2(\mathbf{R})) defined by Dp=pโ€ฒDp = p', and the basis x2,x,1x^2, x, 1 of P2(R)\mathcal{P}_2(\mathbf{R}) โ€” find M(D,(x2,x,1))\mathcal{M}(D, (x^2, x, 1)) and decide whether it is upper triangular.

What is the matrix?

Is it upper triangular?

โœ… Correct! Reversing the basis turns the upper-triangular M(D,(1,x,x2))\mathcal{M}(D, (1, x, x^2)) into a matrix with 22 and 11 below the diagonal: the check Dv1โˆˆspan(v1)Dv_1 \in \text{span}(v_1) already fails.
โŒ That is the matrix for the basis 1,x,x21, x, x^2. With v1=x2v_1 = x^2, column 11 holds the coordinates of Dx2=2xDx^2 = 2x in the list x2,x,1x^2, x, 1, namely (0,2,0)(0, 2, 0).
โŒ The coordinates went into rows. The coordinates of DvkDv_k fill column kk: column 11 is (0,2,0)(0, 2, 0) because Dx2=2xDx^2 = 2x.
โŒ Check the coefficients. Dx2=2xDx^2 = 2x gives a 22 in the xx-slot of column 11, and Dx=1Dx = 1 gives a 11 in the 11-slot of column 22.
โŒ Not quite. Write Dx2Dx^2, DxDx, D1D1 in terms of x2,x,1x^2, x, 1 and stand the coordinate lists side by side as columns.
โŒ The zeros must be below the diagonal. Upper triangular means Aj,k=0A_{j,k} = 0 for j>kj > k; here A2,1=2A_{2,1} = 2 and A3,2=1A_{3,2} = 1.
โŒ The basis order matters. Upper triangularity belongs to DD together with an ordered basis; in the order x2,x,1x^2, x, 1 the first check Dx2โˆˆspan(x2)Dx^2 \in \text{span}(x^2) fails.
โŒ The diagonal may be anything. Diagonal entries, including 00, are unrestricted; the matrix fails because A2,1=2โ‰ 0A_{2,1} = 2 \neq 0.
โŒ Not quite. Apply condition (3) at k=1k = 1: is Dx2Dx^2 a multiple of x2x^2?
Show solution

Write each image in the basis v1=x2v_1 = x^2, v2=xv_2 = x, v3=1v_3 = 1:

Dx2=2xย โ†’ย (0,2,0),Dx=1ย โ†’ย (0,0,1),D1=0ย โ†’ย (0,0,0).Dx^2 = 2x \ \to\ (0, 2, 0), \qquad Dx = 1 \ \to\ (0, 0, 1), \qquad D1 = 0 \ \to\ (0, 0, 0).

These are the columns:

M(D,(x2,x,1))=(000200010).\mathcal{M}\big(D, (x^2, x, 1)\big) = \begin{pmatrix} 0 & 0 & 0 \\ 2 & 0 & 0 \\ 0 & 1 & 0 \end{pmatrix}.

The entries A2,1=2A_{2,1} = 2 and A3,2=1A_{3,2} = 1 lie below the diagonal, so the matrix is not upper triangular. Condition (3) fails at k=1k = 1: Dx2=2xโˆ‰span(x2)Dx^2 = 2x \notin \text{span}(x^2), so span(x2)\text{span}(x^2) is not invariant.

In the order 1,x,x21, x, x^2 every check passes (D1=0D1 = 0, Dx=1Dx = 1, Dx2=2xDx^2 = 2x), and the invariant spans are span(1)\text{span}(1), span(1,x)\text{span}(1, x), P2(R)\mathcal{P}_2(\mathbf{R}): differentiation never raises degree.

Problem 2 ยท Choosing the Order

Given: TโˆˆL(F3)T \in \mathcal{L}(\mathbf{F}^3), T(x,y,z)=(3x,ย x+2y,ย y+z)T(x, y, z) = (3x,\ x + 2y,\ y + z) โ€” find the order of e1,e2,e3e_1, e_2, e_3 in which M(T)\mathcal{M}(T) is upper triangular.

โœ… Correct! Te3=e3Te_3 = e_3, Te2=2e2+e3Te_2 = 2e_2 + e_3, Te1=3e1+e2Te_1 = 3e_1 + e_2: each image uses only the current and earlier basis vectors.
โŒ The standard order fails at k=1k = 1. Te1=(3,1,0)=3e1+e2โˆ‰span(e1)Te_1 = (3, 1, 0) = 3e_1 + e_2 \notin \text{span}(e_1); the standard matrix has the entries 11 and 11 below its diagonal.
โŒ This fails at k=1k = 1. Te2=(0,2,1)=2e2+e3โˆ‰span(e2)Te_2 = (0, 2, 1) = 2e_2 + e_3 \notin \text{span}(e_2).
โŒ This passes k=1k = 1 but fails at k=2k = 2. Te1=3e1+e2โˆ‰span(e3,e1)Te_1 = 3e_1 + e_2 \notin \text{span}(e_3, e_1).
โŒ Not quite. Check Tvkโˆˆspan(v1,โ€ฆ,vk)Tv_k \in \text{span}(v_1, \ldots, v_k) for k=1,2,3k = 1, 2, 3.
Show solution

Compute the images of the standard basis vectors:

Te1=(3,1,0)=3e1+e2,Te2=(0,2,1)=2e2+e3,Te3=(0,0,1)=e3.Te_1 = (3, 1, 0) = 3e_1 + e_2, \qquad Te_2 = (0, 2, 1) = 2e_2 + e_3, \qquad Te_3 = (0, 0, 1) = e_3.

By condition (3), Te1Te_1 uses e2e_2, so e2e_2 must come before e1e_1; Te2Te_2 uses e3e_3, so e3e_3 must come before e2e_2. The only order satisfying both is e3,e2,e1e_3, e_2, e_1, and then

M(T,(e3,e2,e1))=(110021003).\mathcal{M}\big(T, (e_3, e_2, e_1)\big) = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 2 & 1 \\ 0 & 0 & 3 \end{pmatrix}.

The invariant spans are span(e3)\text{span}(e_3) (the zz-axis) and span(e3,e2)\text{span}(e_3, e_2) (the yy-zz plane).

Problem 3 ยท A Basis Off the Axes

Given: TโˆˆL(R3)T \in \mathcal{L}(\mathbf{R}^3), T(x,y,z)=(y,ย x,ย x+y+2z)T(x, y, z) = (y,\ x,\ x + y + 2z), and the basis v1=(1,1,0)v_1 = (1, 1, 0), v2=(1,โˆ’1,0)v_2 = (1, -1, 0), v3=(0,0,1)v_3 = (0, 0, 1) โ€” find M(T,(v1,v2,v3))\mathcal{M}(T, (v_1, v_2, v_3)) and which spans are invariant.

What is the matrix?

Which statement is true?

โœ… Correct! Tv1=v1+2v3Tv_1 = v_1 + 2v_3 leaves the plane span(v1,v2)\text{span}(v_1, v_2), so neither span is invariant, even though Tv2โˆˆspan(v1,v2)Tv_2 \in \text{span}(v_1, v_2).
โŒ The coordinates went into rows. Tv1=v1+2v3Tv_1 = v_1 + 2v_3 fills column 11 with (1,0,2)(1, 0, 2); this transposed matrix only looks upper triangular.
โŒ That is the matrix in the standard basis. In the basis v1,v2,v3v_1, v_2, v_3, column kk holds the coordinates of TvkTv_k in terms of v1,v2,v3v_1, v_2, v_3.
โŒ Check Tv2Tv_2. T(1,โˆ’1,0)=(โˆ’1,1,0)=โˆ’v2T(1, -1, 0) = (-1, 1, 0) = -v_2, so A2,2=โˆ’1A_{2,2} = -1.
โŒ Not quite. Compute Tv1Tv_1, Tv2Tv_2, Tv3Tv_3 and write each as a combination of v1,v2,v3v_1, v_2, v_3.
โŒ Check k=1k = 1. Tv1=(1,1,2)Tv_1 = (1, 1, 2) is not a multiple of v1=(1,1,0)v_1 = (1, 1, 0).
โŒ Invariance needs every vector of the span. Tv2โˆˆspan(v1,v2)Tv_2 \in \text{span}(v_1, v_2) is not enough: v1v_1 is in the span too, and Tv1=(1,1,2)Tv_1 = (1, 1, 2) has third coordinate 22, so it is not.
โŒ Check k=1k = 1. Tv1=(1,1,2)=v1+2v3Tv_1 = (1, 1, 2) = v_1 + 2v_3 is not in span(v1)\text{span}(v_1).
โŒ Not quite. A span is invariant only if TT maps every vector in it, in particular each vjv_j with jโ‰คkj \le k, back into it.
Show solution

Images of the basis vectors, written in the basis:

Tv1=(1,1,2)=v1+2v3,Tv2=(โˆ’1,1,0)=โˆ’v2,Tv3=(0,0,2)=2v3.Tv_1 = (1, 1, 2) = v_1 + 2v_3, \qquad Tv_2 = (-1, 1, 0) = -v_2, \qquad Tv_3 = (0, 0, 2) = 2v_3.

So the columns are (1,0,2)(1, 0, 2), (0,โˆ’1,0)(0, -1, 0), (0,0,2)(0, 0, 2):

M(T,(v1,v2,v3))=(1000โˆ’10202).\mathcal{M}\big(T, (v_1, v_2, v_3)\big) = \begin{pmatrix} 1 & 0 & 0 \\ 0 & -1 & 0 \\ 2 & 0 & 2 \end{pmatrix}.

The entry A3,1=2A_{3,1} = 2 lies below the diagonal, so the matrix is not upper triangular.

span(v1)\text{span}(v_1): Tv1โˆ‰span(v1)Tv_1 \notin \text{span}(v_1), so it is not invariant. span(v1,v2)\text{span}(v_1, v_2) is the plane z=0z = 0, and v1v_1 lies in it while Tv1=(1,1,2)Tv_1 = (1, 1, 2) does not, so it is not invariant either. Condition (3) holds at k=2k = 2 (since Tv2=โˆ’v2Tv_2 = -v_2), yet condition (2) fails at k=2k = 2: the two conditions agree as statements about all kk at once, not kk by kk.

Problem 4 ยท Reorder to Repair

Given: the operator T(x,y,z)=(y,ย x,ย x+y+2z)T(x, y, z) = (y,\ x,\ x + y + 2z) of Problem 3 and the same three vectors (1,1,0)(1, 1, 0), (1,โˆ’1,0)(1, -1, 0), (0,0,1)(0, 0, 1) โ€” find an order of them that makes M(T)\mathcal{M}(T) upper triangular.

โœ… Correct! (1,โˆ’1,0)(1, -1, 0) and (0,0,1)(0, 0, 1) are each sent to multiples of themselves, and T(1,1,0)=(1,1,0)+2(0,0,1)T(1, 1, 0) = (1, 1, 0) + 2(0, 0, 1) uses only itself and an earlier vector.
โŒ This fails at k=1k = 1. T(1,1,0)=(1,1,2)T(1, 1, 0) = (1, 1, 2) is not a multiple of (1,1,0)(1, 1, 0).
โŒ This passes k=1k = 1 but fails at k=2k = 2. T(1,1,0)=(1,1,0)+2(0,0,1)T(1, 1, 0) = (1, 1, 0) + 2(0, 0, 1) needs (0,0,1)(0, 0, 1), which comes later: an eigenvector first is not enough by itself.
โŒ The order is a free choice. Problem 3's order fails, but upper triangularity depends on the order: place (0,0,1)(0, 0, 1) before (1,1,0)(1, 1, 0).
โŒ Not quite. Check Tvkโˆˆspan(v1,โ€ฆ,vk)Tv_k \in \text{span}(v_1, \ldots, v_k) for each kk.
Show solution

Write a=(1,1,0)a = (1, 1, 0), b=(1,โˆ’1,0)b = (1, -1, 0), c=(0,0,1)c = (0, 0, 1). From Problem 3:

Ta=a+2c,Tb=โˆ’b,Tc=2c.Ta = a + 2c, \qquad Tb = -b, \qquad Tc = 2c.

Condition (3) holds automatically for bb and cc wherever they sit, since each image is a multiple of the vector itself. For aa, the image uses cc, so cc must come before aa. The order b,c,ab, c, a does this:

M(T,(b,c,a))=(โˆ’100022001).\mathcal{M}\big(T, (b, c, a)\big) = \begin{pmatrix} -1 & 0 & 0 \\ 0 & 2 & 2 \\ 0 & 0 & 1 \end{pmatrix}.

The orders c,a,bc, a, b and c,b,ac, b, a work as well; a,b,ca, b, c and a,c,ba, c, b fail at k=1k = 1, and b,a,cb, a, c fails at k=2k = 2.

Solved: 0 / 4