A diagonalizable nilpotent matrix is zero Created 2026-10-18 Updated 2026-11-05
If a diagonalizable matrix satisfies for a positive integer , write . Then every , so every eigenvalue is zero and . Diagonalizability is essential: the matrix is nonzero but its square is zero. More generally a nonzero nilpotent operator requires a nontrivial Jordan block.
Beam transfer matrix Created 2026-10-24 Updated 2026-11-05
A beam transfer matrix is a linear small-angle approximation to transverse transport between two positions along a beamline:
Here is transverse displacement and is trajectory slope. A drift of length and a focusing thin quadrupole magnet have respective matrices
Successive elements compose by matrix multiplication, with the first element acting on the right. At fixed longitudinal momentum, ideal uncoupled transport governed by Hamiltonian mechanics preserves transverse phase space area and gives . During acceleration, the slope coordinate is not a fixed multiple of canonical transverse momentum; the corresponding area in can decrease through adiabatic damping of geometric emittance.
For a real one-cell matrix with , its eigenvalues obey . Thus gives a conjugate pair of distinct unit-modulus eigenvalues and bounded repeated-cell motion. If , one real eigenvalue has magnitude greater than one, producing an unstable direction. At equality, a nontrivial Jordan block can produce linear growth, so unit-modulus eigenvalues alone do not establish boundedness. This is a map for beam optics; the transfer matrix used in combinatorics has a different application.
For a complex matrix , is the sum of the th powers of its eigenvalues, counted with algebraic multiplicity. This does not require diagonalizability: a similar upper triangular matrix has the eigenvalues on its diagonal, and taking powers raises those diagonal entries to their corresponding powers. Newton's identities therefore recover its characteristic polynomial from the first such traces.
For the Jordan block , and . Hence and , giving . The repeated eigenvalue is recovered even though this matrix is not diagonalizable.[ref]
A stationary iterative method for a linear system converges to its specified fixed point for every initial vector if and only if its iteration matrix satisfies , where the spectral radius is the largest modulus of an eigenvalue.[ref]
For a diagonalizable matrix, write . Then , so each eigenvector coefficient tends to zero exactly when its eigenvalue has modulus less than one. For a general matrix, the Jordan normal form gives the same result: a Jordan block with a nilpotent matrix of size satisfies
If , every coefficient tends to zero because exponential decay beats any fixed polynomial in ; if , the block vanishes once . Conversely, an eigenvector with provides an initial error that cannot tend to zero. For a real matrix with complex eigenvalues, the same obstruction appears in the real invariant subspace spanned by the real and imaginary parts of an eigenvector.
The words "every initial vector" matter. For example, fails the criterion, but still tends to zero. Here a generic initial error has a nonzero first coordinate and diverges; the exceptional errors lie on the second coordinate axis. With , generic errors oscillate rather than diverge in norm, while the same exceptional axis still converges. Both are valid matrix splittings with and . In general the convergent errors form the direct sum of the generalized eigenspaces for ; if , this is a proper linear subspace.
A small spectral radius describes eventual convergence, but does not imply that the Euclidean norm of the error decreases on every step for a non-normal matrix. An operator norm bound does give the stepwise estimate . For a real symmetric matrix, the matrix 2-norm equals its spectral radius, making this particularly direct.
Defective matrix Created 2026-10-14 Updated 2026-10-25
A matrix is defective when an eigenvalue has geometric multiplicity smaller than its algebraic multiplicity. Over a field in which the characteristic polynomial splits, this is precisely the obstruction to an eigenbasis: at least one Jordan block has size greater than one, and generalized eigenvectors are needed to complete a basis. The shear mapping in diagonalizable matrix is the simplest example.
Diagonalizability inherited from an invertible power Created 2026-09-24 Updated 2026-11-05
Let be invertible over an algebraically closed field. If is diagonalizable for an integer not divisible by the characteristic of a field (with no restriction on in characteristic zero), then is diagonalizable. Indeed, a nontrivial Jordan block has and
The first nonzero nilpotent term prevents this power from being diagonalizable.
Diagonalizable matrix Created 2026-09-24 Updated 2026-10-14
A finite-dimensional linear operator is diagonalizable over a specified field when it has an eigenbasis. Equivalently, its matrix admits
where is an invertible matrix whose columns are eigenvectors, and is a diagonal matrix of the corresponding eigenvalues. This change of basis reveals a linear map as independent one-dimensional scalings. The matrix may look coupled in the original coordinates, but each coordinate in the eigenbasis evolves on its own.
For the symmetric matrix computed in eigenvector, take
Then , hence . The orthonormal basis version is , an orthogonal matrix satisfying . Every real symmetric matrix has an orthonormal eigenbasis by the spectral theorem; a general diagonalizable matrix need not have orthogonal eigenvectors.
The immediate payoff is repeated application: adjacent factors cancel, giving . In this example,
The component in grows while the component in stays fixed. After division by its Euclidean norm, this particular sequence approaches . This is the mechanism behind the power method; an initial vector entirely in would stay there and never find the dominant eigenvalue .
Figure 1.
Repeated maps: eigenvalue growth, alignment, and the exceptional starting direction
. Details.
Two different obstructions deserve comparison. The planar rotation in eigenvector is diagonalizable over but not over , because its eigenvalues are and . By contrast, the shear mapping
has only , of algebraic multiplicity two, and , of geometric multiplicity one. There is no second independent eigenvector, even over . This is a defective matrix, already a two-dimensional Jordan block. Its powers are
Thus even though both eigenvalues are one, repeated application can produce growth. Eigenvalues alone miss the coupling recorded by a Jordan block. A repeated eigenvalue is harmless when it has enough independent eigenvectors, as demonstrates. More generally, a matrix is diagonalizable exactly when its characteristic polynomial splits over the chosen field and every eigenvalue has equal geometric multiplicity and algebraic multiplicity. The proof outline is to join bases of the distinct eigenspaces; their direct sum fills the space exactly under these conditions.
A physical motivation is the separation of normal modes. Consider two equal masses between three identical springs of stiffness , with the outer ends fixed. By Hooke's law and Newton's second law, the displacement vector obeys
The eigenvectors and have eigenvalues and : the masses move together in the first normal mode and oppositely in the second. Writing separates the coupled equations into two harmonic oscillators,
Their angular frequencies are and ; the eigenvalues give squared angular frequencies after multiplication by . This is the beauty of diagonalization: finding the right directions turns interacting motions into independent patterns. For a physical treatment, see Yen-Jie Lee's "Coupled Oscillators, Normal Modes" (MIT 8.03SC, 2016), and the local article normal modes of two equal masses between three springs.[ref]
Diagonalizable nilpotent matrix Created 2026-10-20 Updated 2026-11-05
The only diagonalizable nilpotent matrix is the zero matrix. Indeed, if and with , then , so . A basis of eigenvectors would make every diagonal entry zero and therefore . Nonzero nilpotent matrices require nontrivial Jordan blocks, even if their characteristic polynomial has only one distinct root.
For distinct real or complex numbers and positive integers , the vector space spanned by , , is preserved by differentiation. In each ordered basis , its matrix has on the diagonal and just above it. This follows from the product rule. Rescaling to makes each block a Jordan block. In particular, differentiation is invertible on this vector space exactly when every : the determinant is .
This generation-based compartmental model replenishes the susceptible compartment by per step and transfers individuals into the next infectious generation. Members of the current infectious compartment leave it after one step. In scaled variables , , , the update is , .
Its only fixed point is . There is no finite disease-free fixed point, since susceptible recruitment continues when . The Jacobian matrix at the fixed point is , with determinant one and trace . For , its two distinct eigenvalues have modulus one, so the linearized iterates are bounded and oscillatory. At , the repeated eigenvalue has a nontrivial Jordan block, making generic linearized iterates grow linearly. For , one eigenvalue has modulus greater than one.
Thus gives neutral linear stability, not asymptotic stability. Unit-modulus multipliers do not determine nonlinear stability. Recruitment can restore susceptibility above after a wave, allowing repeated infection growth; a closed SIR model without replenishment has a different susceptible balance.
Dominant eigenmode in a forced linear system Created 2026-09-24 Updated 2026-11-05
For a constant-coefficient linear ordinary differential equation system , the large-time response contains both homogeneous modes and modes introduced by the forcing. If is diagonalizable, an eigenbasis splits it into independent scalar equations; a Jordan block instead gives polynomial factors multiplying exponentials. Dominance compares their real exponential rates first, and polynomial powers when rates tie, after checking that the relevant coefficients are nonzero.
For , direct integration gives . The forcing creates the dominant decay rate , absent from the homogeneous equation. At resonance, gives : the polynomial enhancement still tends to zero. If a growing eigenmode has zero initial coefficient and is not forced in its direction, it contributes nothing to the solution. Thus the largest real part in the matrix spectrum alone need not describe a particular trajectory; the forcing and its modal projections matter.
Existence of a logarithm for every invertible complex matrix Created 2026-10-06 Updated 2026-10-07
An invertible complex Jordan block , with , has logarithm , where . Applying this construction blockwise and conjugating back proves surjectivity of the matrix exponential on the complex general linear group. There is no globally single-valued continuous choice of logarithm.
Stability of the partial differential equation requires a bound uniform over refining meshes and time steps on every fixed physical time interval. This is distinct from demanding an all-time bound for one fixed matrix. A fixed matrix is power bounded exactly when all eigenvalues are in the closed unit disk and its unit-modulus Jordan blocks have size one. A time-step family can nevertheless have harmless polynomial physical-time growth: with gives , uniformly bounded for despite its nontrivial unit-modulus Jordan block. Mesh dependence and the scaling of the step must therefore be kept in an eigenvalue argument.
Floquet growth rate Created 2026-10-06 Updated 2026-10-14
The Floquet growth rate measures the exponential trend of a periodic linear differential equation over many coefficient periods. A Floquet multiplier measures the factor per period ; the corresponding rate per unit time is
where is a Floquet exponent. Taking the real part removes the ambiguity in the complex logarithm.
For the scalar example under periodic solution, and the Floquet growth rate is , independently of . Indeed,
The instantaneous logarithmic derivative keeps oscillating even though its average over complete periods is exactly . Sampling at the same phase in each period removes the modulation altogether: .
Figure 1.
The multiplier gives a factor per period and its logarithm gives a rate per unit time
. Left: sampling at , , gives ; straight lines on the logarithmic scale have slopes per period. Right: the instantaneous logarithmic derivatives oscillate around the constant long-term rates . Details.
For the general finite-dimensional homogeneous linear differential equation , assume that is continuous on the real line and -periodic, with . Normalize its fundamental matrix by and set . The maximal asymptotic exponential rate, using any induced matrix norm, is
Here is the spectral radius, are the Floquet multipliers, and invertibility gives . This concerns growth of the solution operator; it does not say that every initial condition attains the maximum.[ref]
To prove the formula, write with . Periodicity and uniqueness give
Both and have uniformly bounded matrix norms on a period. Consequently differs from by at most fixed multiplicative factors. The spectral radius formula gives , proving the claimed limit without choosing a matrix logarithm.
For a particular nonzero initial condition , decompose into the generalized eigenspaces of over the complex numbers. The rate of is the largest among components that are nonzero. Generic data have a component in the dominant generalized eigenspaces and attain ; data contained in the sum of the subdominant generalized eigenspaces have a smaller rate. For example, with , the maximal rate is , while decays at rate . These invariant subspaces describe initial data at phase zero. Their transported versions can vary with time and satisfy .
A negative Floquet growth rate allows temporary amplification. For the constant non-normal matrix
the initial condition has Euclidean norm , which rises from to about at before eventually decaying. Its exponential rate is still : the Jordan block contributes a polynomial factor, whose logarithm divided by tends to zero. At a unit-modulus Floquet multiplier, such polynomial growth can even be unbounded with zero exponential rate; gives . Thus zero Floquet growth rate alone proves neither boundedness nor a periodic solution.
Floquet multiplier Created 2026-09-24 Updated 2026-10-14
A Floquet multiplier is an eigenvalue of a one-period linear evolution map. For a homogeneous linear differential equation with continuous coefficients of period , this map is the monodromy matrix of a periodic linear system . If for a nonzero eigenvector , the associated solution of a differential equation with satisfies . Its exponential rate is , the corresponding Floquet growth rate. A Floquet multiplier equal to one gives a -periodic solution in that eigenvector direction; a nontrivial Jordan block at a unit-modulus Floquet multiplier can still produce polynomial growth.
For a nonlinear periodic orbit, the Floquet multipliers are eigenvalues of the one-period map of its variational equation. A nonconstant periodic orbit of a smooth autonomous differential equation has a Floquet multiplier equal to one in its tangent direction: differentiating the solution of a differential equation with respect to its starting phase gives a periodic solution of the variational equation. The derivative of a transverse Poincaré map removes this phase direction and retains the transverse Floquet multipliers. Transverse Floquet multipliers strictly inside the unit circle give local attraction, while one outside gives instability; a transverse Floquet multiplier on the unit circle requires further analysis. For a planar periodic orbit, the transverse Floquet multiplier is given by the divergence test for a planar periodic orbit.
Floquet theory 2026-10-06
For a continuous periodic coefficient matrix , a fundamental matrix for , normalized by , obeys . The invertible matrix has a complex matrix logarithm; set and . Since commutes with , direct substitution gives and proves the factorization. A real logarithm is not required for this complex representation.
The eigenvalues of are Floquet multipliers. All solutions are bounded for forward time when every multiplier has modulus at most one and those on the unit circle have no nontrivial Jordan blocks. In a real undamped second-order scalar equation with no first-derivative term, the monodromy determinant is one. Distinct conjugate unit-modulus multipliers give bounded solutions; a nontrivial Jordan block at multiplier or gives an unbounded second solution even when one periodic or antiperiodic solution exists.
Hurwitz stable matrix 2026-10-14
A Hurwitz stable matrix has all eigenvalues strictly in the open left half-plane. For , this is equivalent to for every initial vector. Jordan blocks contribute polynomial factors times , which decay exactly when their eigenvalues have negative real part. Translating an affine equilibrium reduces its attractivity to this same condition.
Hyperbolic toral automorphism Created 2026-10-14 Updated 2026-11-05
A hyperbolic toral automorphism is a toral automorphism whose matrix has no eigenvalue on the unit circle. Here , so its determinant is . Invertibility merely over the real numbers would not suffice: multiplication by two on a circle is a many-to-one endomorphism, not an automorphism.
The real stable and unstable subspaces come from the generalized eigenspaces with eigenvalue modulus less than and greater than one. They give the same splitting at every point of the real torus. A Jordan block can add a polynomial factor to the powers of its eigenvalue; choosing a slightly weaker exponential rate absorbs that factor into a constant. Thus contraction forward on the stable subspace and backward on the unstable subspace is uniform over the whole torus, proving that the map is an Anosov diffeomorphism.
For the cat map, has eigenvalues . One is inside and the other outside the unit circle, and their product is one. The toral automorphism mixing criterion applies as well, since a root of unity would lie on that circle.
Jordan chain 2026-10-05
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.
For a nilpotent linear map with minimal polynomial , set and , with . Then
For strictness, choose with . The vector belongs to for . For the second inequality, the rank-nullity theorem gives
The first image is contained in the second because .
If the Nilpotent Jordan block sizes are , then
Thus successive increments count the Jordan blocks reaching a given size, and counts blocks of size exactly , with . The nullities determine the entire Jordan normal form. Conversely any positive nonincreasing integer increments summing to are realized by taking the corresponding numbers of each Nilpotent Jordan block.