Perturb each diagonal position of a Jordan normal form matrix by a different arbitrarily small scalar, avoiding the finitely many collisions between diagonal entries. The resulting upper triangular matrix has distinct eigenvalues, hence is diagonalizable. Conjugate back to approximate any complex matrix. Continuous identities proved for diagonalizable matrices can therefore extend to all matrices.
A complex two-dimensional linear operator whose two eigenvalues both equal is similar either to or to . Choose an eigenvector and complete it to a basis. The matrix becomes because its characteristic polynomial is . A nonzero can be normalized to one by rescaling the first basis vector. The two types are distinguished by eigenspace dimension.
Over an algebraically closed field, a linear operator has a unique decomposition into a commuting diagonalisable endomorphism and nilpotent endomorphism . On its generalized eigenspace for , set and . The Chinese remainder theorem makes both parts polynomials in , so they preserve every -invariant subspace. Uniqueness follows by restricting any other commuting decomposition to those generalized eigenspaces. Over a perfect field the semisimple part need only become diagonalizable after scalar extension.
The commutator action of is diagonalizable on endomorphisms: on it acts by . The action of is nilpotent by nilpotence of commutation by a nilpotent endomorphism. The two actions commute, so uniqueness of the Additive Jordan decomposition identifies them as the parts of .
For a complex semisimple Lie algebra and , both parts of its Additive Jordan decomposition lie in . The polynomial semisimple part of shows normalizes . Split by the Weyl complete reducibility theorem; the -component of centralizes . On each irreducible summand of it is scalar by the Schur lemma. Its trace is zero because is a perfect Lie algebra and the nilpotent part has zero trace, so those scalars vanish. Nonsemisimple subalgebras may fail this property: with nilpotent contains neither Jordan part of .
The algebraic multiplicity of an eigenvalue is its multiplicity as a root of the characteristic polynomial. In Jordan form it is the sum of the sizes of all blocks carrying that eigenvalue.
The geometric multiplicity of an eigenvalue is the dimension of its eigenspace. In Jordan form it equals the number of blocks carrying that eigenvalue.
A Jordan block has one eigenvalue on its diagonal and ones on its superdiagonal.
The model matrix has a defective double eigenvalue when . Its characteristic polynomial is , giving the displayed roots. For fixed nonzero the small root is and the other is . These expansions cease to be ordered at , the distinguished limit in which both roots split on a square-root scale. This is the generic leading behavior when a perturbation closes a two-dimensional Jordan block through a nonzero lower-left entry; it need not occur for a perturbation that leaves that entry zero.
A nilpotent Jordan block has zeros on its diagonal and ones on its superdiagonal. Its th power has ones on the th superdiagonal, and a block of size satisfies .
If has eigenvalues and is diagonalizable on a two-dimensional complex vector space, then
If has one size-two Jordan block, then
Over an algebraically closed field, the characteristic polynomial gives the total size of the Jordan blocks for each eigenvalue, while the minimal polynomial gives the largest block size. For total dimension at most three, these two numbers determine the partition into block sizes: a multiplicity-three eigenvalue has partition , , or according as its largest block has size , , or . Hence two matrices of size at most three with the same characteristic and minimal polynomials are similar.
A generalized eigenvector lies in the kernel of a positive power of A minus lambda I.
A Jordan chain of a linear operator for an eigenvalue is a list of nonzero vectors satisfying and for . These vectors are linearly independent: in a vanishing linear combination, applying the largest relevant power of isolates the last coefficient times , then descending induction removes all coefficients. On their span the operator has one Jordan block. This is different from a generalized eigenfunction that solves outside the original function space.
If and , the vector is a generalized eigenvector and solves . The polynomial factor distinguishes a nontrivial Jordan block from an ordinary repeated eigenvalue with a full eigenvector basis.
The generalized eigenspace of a linear operator for an eigenvalue is the union of the kernels . In finite dimension this union stabilizes for sufficiently large .
For endomorphisms of a finite-dimensional complex vector space, suppose repeated commutation with annihilates . Write the blocks of using the generalized eigenspaces of . On , the operator is plus a nilpotent endomorphism. If , it is invertible, so forces that off-diagonal block of to vanish. Thus preserves each generalized eigenspace. This allows a nilpotent Lie algebra representation to be split by generalized eigenvalues even when its acting operators do not commute.
For a linear operator , the generalized eigenspaces
belonging to distinct eigenvalues are linearly independent. On the generalized -eigenspace, is invertible for because the nilpotent part has a finite geometric-series inverse.

Ancestors (6)

  1. Linear operator theory
  2. Linear algebra
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Jordan normal form (or Jordan canonical form) is a special form of a square matrix in linear algebra that simplifies the representation of linear transformations. It is particularly useful for studying the properties of linear operators and can be used to perform calculations related to matrix exponentiation, differential equations, and more. A matrix is said to be in Jordan normal form if it is a block diagonal matrix composed of Jordan blocks.