Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · Advanced undergraduate

Advanced linear algebra

Name: ______________________

Date: ______________________

You will learn to

  • Prove the spectral theorem for self-adjoint operators (real symmetric and complex Hermitian matrices) and for complex normal operators, and orthogonally diagonalise symmetric matrices
  • Prove the Cayley–Hamilton theorem, compute minimal polynomials, and decide diagonalisability from them
  • Compute Jordan normal forms from the ranks of powers of A−λIA - \lambda I, and prove existence and uniqueness of the Jordan form
  • Define dual spaces and dual maps, and explain why V≅V∗∗V \cong V^{**} is natural while V≅V∗V \cong V^* depends on a choice
  • Define the tensor product by its universal property, compute with the basis ei⊗fje_i \otimes f_j, and show that not every tensor is a pure tensor
  1. 1.

    The symmetric matrix A=(5222)A = \begin{pmatrix} 5 & 2 \\ 2 & 2 \end{pmatrix} is the matrix of q(x,y)=5x2+4xy+2y2q(x, y) = 5x^2 + 4xy + 2y^2. What is the largest eigenvalue of AA, that is, the maximum of qq on the unit circle?

  2. 2.

    Which of these matrices are unitarily (or, for real ones, orthogonally) diagonalisable over C\mathbb{C}? (Choose all that apply.)

    • A.(2112)\begin{pmatrix} 2 & 1 \\ 1 & 2 \end{pmatrix}
    • B.(0−110)\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}
    • C.(1101)\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}
    • D.(1ii−1)\begin{pmatrix} 1 & i \\ i & -1 \end{pmatrix}
    • E.(11002)\begin{pmatrix} 1 & 10 \\ 0 & 2 \end{pmatrix}
  3. 3.

    In the proof of the spectral theorem, v1v_1 is an eigenvector of the self-adjoint operator TT and W=v1⊥W = v_1^{\perp}. Why does TT map WW into WW?

    • A.For w∈Ww \in W: ⟨v1,Tw⟩=⟨Tv1,w⟩=λ1⟨v1,w⟩=0\langle v_1, Tw \rangle = \langle Tv_1, w \rangle = \lambda_1 \langle v_1, w \rangle = 0.
    • B.Because TT is invertible, so it maps a hyperplane onto a hyperplane.
    • C.Because WW is an eigenspace of TT.
    • D.Because the eigenvalues of TT are real.
  4. 4.

    A nilpotent operator NN on a 55-dimensional space has rank⁡N=3\operatorname{rank} N = 3, rank⁡N2=1\operatorname{rank} N^2 = 1 and N3=0N^3 = 0. What is the degree of its minimal polynomial?

  5. 5.

    Let VV and WW be finite-dimensional. Which statements about V⊗WV \otimes W are true? (Choose all that apply.)

    • A.dim⁡(V⊗W)=dim⁡V⋅dim⁡W\dim(V \otimes W) = \dim V \cdot \dim W.
    • B.Every element is a finite sum of pure tensors v⊗wv \otimes w.
    • C.Every element is a pure tensor v⊗wv \otimes w.
    • D.v⊗w=0v \otimes w = 0 if and only if v=0v = 0 or w=0w = 0.
    • E.(v1+v2)⊗(w1+w2)=v1⊗w1+v2⊗w2(v_1 + v_2) \otimes (w_1 + w_2) = v_1 \otimes w_1 + v_2 \otimes w_2.
  6. 6.

    Let V=W=RV = W = \mathbb{R} and let η:R→R∗\eta : \mathbb{R} \to \mathbb{R}^* be the 'basis' isomorphism sending 11 to the functional 1∗1^* with 1∗(t)=t1^*(t) = t. Let f:R→Rf : \mathbb{R} \to \mathbb{R} be f(t)=2tf(t) = 2t. Compute the number (f∗(η(f(1))))(1)\big(f^*(\eta(f(1)))\big)(1). (Naturality would require it to equal η(1)(1)=1\eta(1)(1) = 1.)

  7. 7.

    Which Lean statement correctly formalises Lemma 2 (eigenvectors of a symmetric operator for distinct eigenvalues are orthogonal)? In each, T : E →ₗ[ℝ] E on a real inner product space E.

    • A.(hT : T.IsSymmetric) (hv : T v = a • v) (hw : T w = b • w) (hab : a ≠ b) : inner ℝ v w = 0
    • B.(hT : T.IsSymmetric) (hv : T v = a • v) (hw : T w = b • w) : inner ℝ v w = 0
    • C.(hv : T v = a • v) (hw : T w = b • w) (hab : a ≠ b) : inner ℝ v w = 0
    • D.(hT : T.IsSymmetric) (h : inner ℝ v w = 0) : ∃ a b, a ≠ b ∧ T v = a • v ∧ T w = b • w
  8. 8.

    What is dim⁡(R3⊗R4⊗R2)\dim\big(\mathbb{R}^3 \otimes \mathbb{R}^4 \otimes \mathbb{R}^2\big)?

  9. 9.

    Implement the uniqueness part of Theorem 12. Write block_sizes(ranks) where ranks = [r0, r1, r2, ...] lists rank⁡(A−λI)k\operatorname{rank}(A - \lambda I)^k for k=0,1,2,…k = 0, 1, 2, \dots, ending once the ranks stop changing. Return the list of Jordan block sizes for λ\lambda, largest first. (Blocks of size ≥k\geq k number rk−1−rkr_{k-1} - r_k.)

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0