Translation is a bijection from nilpotent matrices to unipotent matrices. We can count the former without requiring a further partition identity. Let be their number, with .
Every linear operator has a unique decomposition from the Fitting lemma
on which it is respectively nilpotent and invertible. To justify the decomposition, kernels and images stabilize by step ; if , then , so . The dimensions then show the sum is all of , and stabilization makes invertible on the image. These two summands are determined by , so there is no overcounting.
For a nilpotent summand of dimension , the number of ordered complementary subspaces is , by transporting two fixed bases. The restrictions of have and choices. Summing all matrices gives
Write , so . Subtract the same equation for :
Thus counting nilpotent matrices by the Fitting decomposition proves
The supplied product identity is consistent with the resulting mass series: taking its variables to be , gives .
For the nilpotent matrix , define the polynomial . Because , differentiating gives . The derivative of the preserved bilinear form matrix is therefore
It is a constant matrix polynomial, equal to at . Evaluation at one proves
Also is the inverse of by the finite exponential product identity, so this really is an invertible isometry, even when is degenerate.
Put . At a nonzero equilibrium point the two equations form the homogeneous linear system
Its determinant must vanish, giving . Thus
Each positive real polynomial root gives an antipodal equilibrium point pair; a negative polynomial root does not describe a real equilibrium point. A direction is specified by , , where , . This is the polar form of the cubic confinement model. The origin is always an equilibrium point.
The origin's eigenvalues are . A simple zero eigenvalue occurs on , except at . The symmetry of an odd function makes the generic steady bifurcation a pitchfork bifurcation. At a point on this circle with , vary . Expanding the radius equation gives . In a signed, unit-eigenvector centre manifold coordinate, the cubic coefficient therefore has sign .
On the lower semicircle the transverse eigenvalue is negative: the pitchfork bifurcation is supercritical for and subcritical for . On the upper semicircle it is supercritical for and subcritical for in the centre manifold direction, but its transverse eigenvalue is positive, so the bifurcating equilibrium points are not fully attracting. At the cubic vanishes. The radius equation instead gives , a nonzero quintic degeneracy with amplitude proportional to : these are degenerate pitchforks in the cubic confinement model.
A Hopf bifurcation occurs at , , with frequency . To determine its direction, first note that the divergence is . The Bendixson-Dulac criterion excludes every nonconstant periodic orbit for , since this divergence is negative except possibly at the origin. We can also calculate a nonzero saturation coefficient. Set , and . At the linear orbits are ellipses of constant . Direct differentiation gives
On a linear ellipse, write , . The angular speed is constant; the averages of and vanish, while . Averaging the cubic terms, or removing their oscillatory parts by a periodic change of coordinates in its normal form, gives for
The cubic coefficient is strictly negative. Hence a small attracting limit cycle exists for , and
Finally have a nonzero nilpotent matrix as their linearization with two zero eigenvalues. They are reflection-symmetric double-zero bifurcations where the Hopf bifurcation and steady thresholds meet; an ordinary nonzero-frequency Hopf bifurcation calculation does not apply there. These, the two degenerate pitchfork bifurcation points, and the generic pitchfork bifurcation/Hopf bifurcation loci above exhaust the origin's local loss-of-hyperbolicity possibilities.
An -point means a unital algebra homomorphism over a field , as in points of a noncommutative algebra. It is specified by and satisfying . For and not a root of unity, , so scalar commutativity gives . Hence the scalar points are the union of the two coordinate axes:
For matrix-valued points of a noncommutative algebra, put and let be a generalized eigenspace. From ,
Therefore , interpreting a missing eigenvalue as the zero space. In particular the linear subspaces and are invariant under both matrices. If , the numbers are distinct. A nonzero vector with would force all intervening generalized eigenspaces to be nonzero, impossible in dimension . Thus : is nilpotent on , although is invertible there.
Apply the same argument with exchanged, using . The sum of the nonzero generalized eigenspaces is invariant under both matrices, and is nilpotent on it. Consequently . Conversely, since is nilpotent on , its nonzero generalized eigenspaces all lie in . Decompose the restriction of to that invariant space into its nonzero and zero generalized eigenspaces:
The zero generalized eigenspace of is -invariant by the scaling identity, so is invariant under both matrices. On , both matrices have only zero eigenvalues, hence are nilpotent matrices. This proves the spectral decomposition of a quantum-plane point:
Here mean sums of generalized eigenspaces, not merely ordinary eigenspaces; that distinction is necessary for non-diagonalizable points.
Put and extend the system by . At the zero equilibrium with zero parameters, the block is the nilpotent matrix , while the eigenvalues are . Since , these are stable. The extended centre manifold is a graph , tangent to the four-dimensional centre space containing the two parameter directions. Its invariance equations are
For the quadratic jets in the ordinary total degree, the coefficient multiplying has no linear part. Hence and . With , comparison gives , , . The second graph is obtained in the same way. Terms involving parameters at quadratic order have zero forcing and vanish. Thus the quadratic centre manifold for a pair of linear filters is
Substitution into the centre equations gives the cubic terms
The last displayed cubic term is absent from the proposed second-order approximation, so its omission needs the weighted scaling rather than an ordinary-degree truncation.
Under the hinted scaling , , , , one has and . The invariance equations at weighted orders two and three give and . In particular no additional parameter-dependent weighted-order-three graph terms appear. Therefore the term and the omitted manifold corrections affect the reduced acceleration only at order , whereas has order and order . After division by , the slow equation is
This proves why the stated approximation retains the leading nonlinear restoring force and its first nonlinear damping correction. The centre manifold theorem removes the exponentially decaying transverse directions, while the retained generic coefficients determine the nearby reduced bifurcations. It is a local asymptotic description, not an exact global reduction. If either relevant coefficient vanishes, higher-order terms may be needed to resolve that degeneracy; the two extreme cases in part (b), with , avoid it.
Set and use the method of multiple scales:
Since , the first correction satisfies
The resonant cosine and sine coefficients must vanish to avoid secular terms. Using the product-to-sum formulas gives
The remaining forcing has frequency and permits the bounded particular correction . The two slow amplitudes carry the two arbitrary constants of the original equation.
For an explicit general leading solution, put
The matrix exponential gives
The error is uniform on bounded intervals of , for bounded initial data. When is imaginary this expression uses ordinary sine and cosine; at its continuous limit is .
The primary instability tongue of a weak Mathieu oscillator has a positive slow eigenvalue precisely when
These are the leading edges, rather than an exact finite- interval. At the leading endpoints the amplitude matrix is a nilpotent matrix, so the leading solution can grow linearly in and does not decide the exact exponential instability. For completeness, set . The periodic or antiperiodic edge calculation uses a pure cosine when and a pure sine when , with the third-harmonic correction just found. The next resonant coefficient is , so
Thus the exact growing interval is between these shifted edges. In particular, for positive small the fixed leading value lies just inside it, whereas lies just outside. Interior detunings bounded away from the edges are already resolved by the leading method of multiple scales.
If is a strictly upper triangular matrix, then unless . We prove by mathematical induction that
The assertion for is the definition. In the matrix multiplication formula
a nonzero summand would require and , hence . This proves the induction step. Since for all entries, . In particular, every strictly upper triangular matrix is a nilpotent matrix.
Let . The finite matrix geometric series telescopes to . By the assumed convergence, its terms tend to zero, so the limit satisfies . Consequently . This is the finite-dimensional Neumann series argument; invertibility by itself would not imply convergence.
For the stated nilpotent matrix, and only the first three terms remain:
Nilpotence and eigenvalues. If with , then . Thus forces for every eigenvalue. Conversely, if all complex eigenvalues, counted with algebraic multiplicity, vanish, the monic characteristic polynomial is . The Cayley-Hamilton theorem then gives . Hence
This is the criterion for a nilpotent matrix.
Symmetric case. Here a symmetric matrix is understood to be real. The spectral theorem gives with orthogonal and real diagonal. The previous result makes every diagonal entry zero, so . Alternatively, choose , so . For every real vector ,
It follows that . Repeat until . This uses positivity of the quadratic form . The restriction to real symmetric, or complex Hermitian matrices, matters: a complex matrix satisfying only need not have this positivity.
The parameters and powers. The first two columns of coincide, so for all . The sum of its principal two-by-two determinants, each a minor of a matrix, is
Together with , this gives
For every eigenvalue to vanish both remaining coefficients must be zero. Therefore
Direct multiplication at these values gives
Indeed the first row of multiplied by is , and the second row is its negative.
Geometry of repeated application. For any parameters the image of a linear map lies in the span of and , since . Thus it lies in a fixed plane through the origin, independently of the input. When are independent its normal is ; if they coincide, the image is a line and is still contained in a plane.
For , put and . Then
The columns span this entire plane, so has rank two. The next two steps are
Thus the image of a linear map contracts from a plane to a line and then to the origin under successive applications. The line from is precisely the kernel of .
Taking determinants of gives , so is singular and has the eigenvalue zero. More strongly, if with , then , so every eigenvalue is zero.
If the nilpotent matrix were diagonalizable, write . Then , hence each diagonal entry of has zero th power and is zero. Thus and . Conversely the zero matrix is diagonal. Therefore
The conclusion is valid over and also over .
Use the full matrix in the original PDF; the transcription has dropped its middle column. For either matrix, the three-dimensional characteristic polynomial is . Both have zero trace and zero determinant, while and . Consequently
For , a useful check is
for every value of . Thus is a nonzero nilpotent matrix for all ; for example its second column never vanishes. By the preceding result, .
For , the three eigenvalues are distinct and real, so their eigenvectors are linearly independent. An explicit eigenbasis is
With , and . Hence .
A repeated root of the characteristic polynomial alone would not settle diagonalizability; for it is the nonzero nilpotence that completes the argument.
For every vector , the Hermitian inner product gives
The norm vanishes only on the zero vector, so for every and . In contrast,
is a nonzero nilpotent matrix. Multiplying a matrix by its conjugate transpose detects column norms; multiplying it by itself has no corresponding positivity property.
The order- equation is
Using and , its resonance coefficients are
secular term are removed by setting these to zero:
The eigenvalues of this two-by-two system satisfy
They are real with opposite signs for . Generic initial amplitudes then contain an exponentially growing slow-time component. At either leading endpoint the matrix is nonzero nilpotent matrix, so suitable initial amplitudes give linear slow-time growth; higher-order detuning decides the precise corrected boundary. Outside this interval the leading eigenvalues are purely imaginary and the slow amplitudes remain oscillatory.
Substitution into gives the requested leading instability interval
“Can become unbounded” permits special initial amplitudes without growth. The calculation identifies the second instability tongue of a weak Mathieu oscillator and its slow amplitudes for the second Mathieu instability tongue; it is not an assertion that every solution grows throughout the closed interval.
Take the linear map
Its kernel of a linear map consists of all , and its image of a linear map is the same line:
Their set intersection is nonzero and their sum is only one-dimensional. In particular, cannot be written as a sum of one vector from each of these vector subspaces. The nonzero set intersection also prevents an internal direct sum of vector spaces. Thus
The matrix is a nonzero nilpotent matrix; its failure of diagonalizability explains why the preceding result does not apply.
For , take
They are commuting operators because every matrix commutes with the identity matrix. However has only the eigenvalue zero, and has dimension one. It has no eigenbasis, so it cannot appear in any simultaneous diagonalization. Equivalently, a diagonal matrix similar to this nonzero nilpotent matrix would have to be zero, an impossibility. For any prescribed , use and ; its zero eigenspace has dimension . For no such example exists.
If with , put . The matrix geometric series telescopes on both sides:
Thus is nonsingular, and
This is a finite polynomial identity for a nilpotent matrix; no convergence argument or bound is required.
The binomial theorem for the commuting matrices proves the formula for nonnegative integers: every term containing vanishes. Since , the matrix inverse is ; applying the same argument to its powers gives the negative integers as well. The same identity shows that is invertible even when the nilpotent matrix is nonzero. In dimension two, the example describes repeated shear mappings, whose displacement parameters add under composition.
Take a different real matrix,
Its only eigenvalue is , with algebraic multiplicity two. However, the polynomial , which vanishes at that eigenvalue, gives . Merely checking values at eigenvalues cannot prove a matrix identity. The full characteristic polynomial does work:
The matrix is a Jordan block, and its minimal polynomial is also .
The binomial theorem gives, for positive integers ,
Terms containing or a higher matrix power vanish. After removing the common growth factor , the remaining linear map is the shear mapping . It moves to . The single eigenvalue controls the exponential scale, while the nilpotent matrix adds a factor growing linearly in .
Figure 1.
Normalized powers of a Jordan block retain a growing shear despite having only one eigenvalue; equal axes scales show the top edge moving by n/2
. Details.
In terms of polynomial interpolation, reduction modulo retains both a value and a derivative:
Indeed, polynomial division gives . This is a simple Hermite interpolation condition. For , it gives exactly the displayed matrix power. Repeated eigenvalues retain information about how a polynomial changes, not just where it vanishes.
On a finite-dimensional positive inner-product space, a skew-adjoint nilpotent operator is zero. In an orthonormal basis, , since a nilpotent matrix has zero trace and so does its square. The Frobenius norm therefore vanishes. In particular, a nonzero nilpotent adjoint map rules out a compact Lie algebra.
Square-zero criterion for a two-by-two matrix Created 2026-10-14 Updated 2026-10-18
For a real or complex two-by-two matrix , the Cayley-Hamilton theorem reads . Hence exactly when . Conversely, if for any positive integer , every eigenvalue is zero and the same identity gives . Thus a nonzero nilpotent matrix of this size has nilpotency index two.