For a linear operator or matrix and a given eigenvalue λ, the geometric multiplicity is the dimension of the eigenspace ker(A−λI), i.e., the number of linearly independent eigenvectors associated with λ.

Principle

Geometric multiplicity counts independent eigenvectors and is bounded above by the algebraic multiplicity; its value controls diagonalizability and the size of Jordan blocks in canonical forms.

Demonstration

For the 2×2 Jordan block matrix [[λ,1],[0,λ]] the eigenspace has dimension one so the geometric multiplicity of λ is 1 while its algebraic multiplicity is 2, preventing diagonalization.

Misapplication

Assuming algebraic and geometric multiplicities always agree: doing so leads to incorrect claims of diagonalizability; many matrices have fewer independent eigenvectors than the algebraic count suggests.

Consequence

Correct use determines whether an operator is diagonalizable (geometric multiplicities summing to the space dimension) and informs the structure of generalized eigenspaces and solutions of linear systems.

Reversal

Algebraic multiplicity (the multiplicity of λ as a root of the characteristic polynomial) measures polynomial order rather than independent eigenvectors and may exceed the geometric multiplicity.

Boundary

Definition is straightforward for finite-dimensional operators; in infinite-dimensional settings eigenspace dimension is still definable but algebraic multiplicity and Jordan structure require generalized notions (e.g., ascent, descent, root spaces).

Semantic Tension

Geometric multiplicity versus rank/defect: geometric multiplicity equals nullity of A−λI and interacts with the rank-nullity theorem, but differs conceptually from algebraic multiplicity which is spectral polynomial data.

Synthesis

Geometric multiplicity is the count of independent eigenvectors for an eigenvalue: the nullspace dimension of A−λI that determines diagonalizability and the minimal block structure needed to represent the operator.