Why is it called the characteristic polynomial?
Because it is a fingerprint that survives a change of basis. Two matrices that describe the same transformation in different coordinate systems produce the identical polynomial, so its coefficients describe the transformation rather than the numbers you happened to write down.
Does row reducing A first make the calculation easier?
No, it breaks it. Row operations change eigenvalues, so the polynomial you get afterwards belongs to a different matrix. Expand det(A − λI) directly, or use the trace-and-determinant shortcut for a 2×2.
Is the 2×2 shortcut worth memorising?
Yes, it turns a determinant expansion into two glances. Sum the diagonal for the trace, cross-multiply for the determinant, and write λ² − (trace)λ + det. The 3×3 version exists too but involves the sum of the three 2×2 minors.
Can two different matrices have the same characteristic polynomial?
Yes. [[2, 0], [0, 2]] and [[1, 1], [0, 1]] are genuinely different transformations, yet the table above shows both give a polynomial with a single repeated root. The polynomial pins down eigenvalues but not the full behaviour.