For a square linear operator or matrix A, the polynomial p_A(λ) = det(A - λI) whose roots are the scalar parameters for which A - λI is singular.

Principle

Encode spectral information of a linear operator into a single polynomial whose coefficients are invariant algebraic combinations (traces, principal minors) of A.

Demonstration

If A = [[a,b],[c,d]], then p_A(λ) = λ^2 - (a+d)λ + (ad-bc); the constant term equals det A and the linear coefficient equals minus the trace of A.

Misapplication

Assuming two matrices with identical characteristic polynomials are conjugate (similar) in all cases; similarity requires matching of additional structure such as Jordan block sizes or invariant factors.

Consequence

Roots of the characteristic polynomial determine the spectral parameters governing the solvability of linear systems (A - λI)x = 0; coefficients give algebraic invariants usable in stability and control criteria.

Reversal

The minimal polynomial of A is the monic polynomial of least degree annihilating A; it divides the characteristic polynomial and may have lower multiplicities, carrying finer algebraic constraints.

Boundary

Defined only for endomorphisms of finite-dimensional vector spaces or square matrices; does not directly generalize to arbitrary infinite-dimensional operators without additional spectral regularity.

Semantic Tension

Close to the minimal polynomial and to matrix invariants like the rational canonical form; the characteristic polynomial captures global spectral multiplicities but not the full similarity class in defective cases.

Synthesis

The characteristic polynomial is the determinant-based polynomial invariant of a square linear map that packages its spectral parameters into coefficients accessible by algebraic manipulation.