NETMaths
Part BCSIR NET June 2023char-vs-min-polynomial

Char vs min polynomial

Let T be a linear operator on . Let denote its characteristic polynomial. Consider the following statements. (a) Suppose T is non-zero and 0 is an eigenvalue of T. If we write f(X) = X·g(X) in , then the linear operator g(T) is zero. (b) Suppose 0 is an eigenvalue of T with at least two linearly independent eigenvectors. If we write f(X) = X·g(X) in , then the linear operator g(T) is zero. Which of the following is true?

  1. A.Both (a) and (b) are true.
  2. B.Both (a) and (b) are false.
  3. C.(a) is true and (b) is false.
  4. D.(a) is false and (b) is true.

Solution

(a) fails: for the nilpotent Jordan block on , and If 0 has geometric multiplicity ≥ 2 in dimension 3, the 0-Jordan blocks all have size 1, so the minimal polynomial is X(X − c) (or X if T = 0), which divides g(X) = X(X − c); hence g(T) = 0.

The trap it tests

Invariants don't determine

Two objects sharing an invariant were treated as the same object.

Drill statements like this

Related counterexample: Same characteristic polynomial ⇒ similar

More on this topic

From Eigenvalues and Canonical FormsEigenvalues, characteristic & minimal polynomials, Cayley–Hamilton

ShareWhatsAppTelegram