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 , and prove existence and uniqueness of the Jordan form
- Define dual spaces and dual maps, and explain why is natural while depends on a choice
- Define the tensor product by its universal property, compute with the basis , and show that not every tensor is a pure tensor
- 1.
The symmetric matrix is the matrix of . What is the largest eigenvalue of , that is, the maximum of on the unit circle?
- 2.
Which of these matrices are unitarily (or, for real ones, orthogonally) diagonalisable over ? (Choose all that apply.)
- A.
- B.
- C.
- D.
- E.
- 3.
In the proof of the spectral theorem, is an eigenvector of the self-adjoint operator and . Why does map into ?
- A.For : .
- B.Because is invertible, so it maps a hyperplane onto a hyperplane.
- C.Because is an eigenspace of .
- D.Because the eigenvalues of are real.
- 4.
A nilpotent operator on a -dimensional space has , and . What is the degree of its minimal polynomial?
- 5.
Let and be finite-dimensional. Which statements about are true? (Choose all that apply.)
- A..
- B.Every element is a finite sum of pure tensors .
- C.Every element is a pure tensor .
- D. if and only if or .
- E..
- 6.
Let and let be the 'basis' isomorphism sending to the functional with . Let be . Compute the number . (Naturality would require it to equal .)
- 7.
Which Lean statement correctly formalises Lemma 2 (eigenvectors of a symmetric operator for distinct eigenvalues are orthogonal)? In each,
T : E →ₗ[ℝ] Eon a real inner product spaceE.- 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
- A.
- 8.
What is ?
- 9.
Implement the uniqueness part of Theorem 12. Write
block_sizes(ranks)whereranks = [r0, r1, r2, ...]lists for , ending once the ranks stop changing. Return the list of Jordan block sizes for , largest first. (Blocks of size number .)Computational — Practice