Example 4: In Example $2$, the operator $T$ also had the characteristic polynomial $f=(x-1)(x-2)^2$. But, this $T$ is not diagonalizable, so we don’t know that the minimal polynomial is $(x-1)(x-2)$. What do we know about the minimal polynomial in this case? From Theorem 3 we know that its roots are $1$ and $2$, with some multiplicities allowed. Thus we search for $p$ among polynomials of the form $(x-l)^k(x-2)^l$, $k\geq 1$, $l\geq 1$. Try $(x-1) (x-2)$: $$(A-I)(A-2I)=\begin{bmatrix} 2&0&-1 \\ 2&0&-1 \\ 4&0&-2\\ \end{bmatrix}$$ Thus, the minimal polynomial has degree at least $3$. So, next we should try either $(x-1)^2(x-2)$ or $(x-1)(x-2)^2$. The second, being the characteristic polynomial, would seem a less random choice. One can readily compute that $(A - I)(A - 2I)^2 = 0$. Thus the minimal polynomial for $T$ is its characteristic polynomial.
Que: Why didn’t author consider possibility of minimal polynomial may have irreducible (over $\Bbb{R}$) factor, let say $x^2+1$?
Also we can’t use minimal polynomial divides characteristic polynomial results to confine minimal polynomial possibility to $(x-2)^2$, $(x-1)(x-2)$ and $(x-1)(x-2)^2$, because Cayley-Hamilton theorem is not yet proved in book.