Review : Eigenvalues & Eigenvectors — Question 7

PDF ↗

Question 7

An eigenpair satisfies Av=λvAv=\lambda v with v≠0v\ne 0. The eigenspace Eλ=ker⁡(A−λI)E_\lambda=\ker(A-\lambda I) includes zero, although zero is not an eigenvector. Algebraic multiplicity counts roots of det⁡(λI−A)\det(\lambda I-A); geometric multiplicity is dim⁡Eλ\dim E_\lambda. Work over ℝ\mathbb R unless complex scalars are explicitly requested.

For a real parameter KK, let TK=(1/2K01/4).T_K=\begin{pmatrix}1/2&K\\0&1/4\end{pmatrix}. Both eigenvalues have magnitude less than one. We compare long-term iteration with the stronger requirement ∥TKx∥≤∥x∥\|T_Kx\|\le\|x\| for every real vector xx.

Tasks

  1. Find an eigenvector basis for every KK and determine whether the matrix is diagonalizable.

  2. Derive TKmT_K^m for every nonnegative integer mm and prove that every fixed starting vector tends to zero under iteration.

  3. For the starting vector e2=(0,1)Te_2=(0,1)^T, find the first-step length. Determine exactly when that first step increases length, and explain why this does not contradict the long-term limit.

  4. Find the necessary and sufficient condition on KK for ∥TKx∥≤∥x∥\|T_Kx\|\le\|x\| to hold for every real xx. Prove it by completing a square, rather than testing only e2e_2.

Original worksheet page 1: question and worked solution for 5-3-007
Show solutionHide solution

Question 7 – Solution

Strategy. Decaying eigencomponents need not make Euclidean length decrease at every step when the eigenvectors are not orthogonal.

Step 1: Find the distinct-eigenvalue basis. The eigenvalues are 1/21/2 and 1/41/4, with eigenvectors u=(1,0)Tu=(1,0)^T and v=(−4K,1)Tv=(-4K,1)^T. These are independent for every KK, so TKT_K is always diagonalizable over ℝ\mathbb R.

Step 2: Compute all powers. For m≥1m\ge 1, the upper-right entry in the product is K∑j=0m−1(1/2)m−1−j(1/4)j=4K(2−m−4−m).K\sum_{j=0}^{m-1}(1/2)^{m-1-j}(1/4)^j=4K(2^{-m}-4^{-m}). This finite geometric sum yields TKm=(2−m4K(2−m−4−m)04−m).\boxed{T_K^m=\begin{pmatrix} 2^{-m}&4K(2^{-m}-4^{-m})\\0&4^{-m} \end{pmatrix}.} The formula is II at m=0m=0. Every entry tends to zero for each fixed KK, so TKmx→0T_K^m x\to 0 for every fixed starting vector xx.

Step 3: Exhibit a transient length increase. The first image of e2e_2 is (K,1/4)T(K,1/4)^T, of length K2+1/16\sqrt{K^2+1/16}. It exceeds 11 exactly when |K|>15/4\boxed{|K|>\sqrt{15}/4}. An early increase and eventual decay concern different times, so there is no contradiction. The plot uses K=2K=2 and shows the actual lengths at integer iteration counts; the initial increase is followed by decay.

Step 4: Test all directions, not just one. For x=(a,b)Tx=(a,b)^T, direct expansion and completion of the square give ∥TKx∥2−∥x∥2=−34(a−2K3b)2+(4K23−1516)b2.\|T_Kx\|^2-\|x\|^2 =-\frac 34\left(a-\frac{2K}{3}b\right)^2 +\left(\frac{4K^2}{3}-\frac{15}{16}\right)b^2. This is nonpositive for every a,ba,b exactly when the last coefficient is nonpositive: necessity follows by choosing a=2Kb/3a=2Kb/3 with b≠0b\ne 0. Hence the exact condition is |K|≤358.\boxed{|K|\le\frac{3\sqrt 5}{8}.} This stricter threshold cannot be recovered by checking only e2e_2 or only the eigenvalues. At equality, nonzero vectors on a=2Kb/3a=2Kb/3 retain their length in one step; outside that line they decrease.

See the diagram in the original worksheet below.

Original worksheet page 2: question and worked solution for 5-3-007

Original worksheet layout. Use Enlarge or open the PDF for a closer view.