How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A hyperbolic fixed point of a local map is stable exactly when all multipliers contract
Statement
Let be a map from a neighborhood of in to with . If has no eigenvalue on the unit circle, then:
- if every eigenvalue has modulus less than one, is a locally asymptotically stable fixed point;
- if at least one eigenvalue has modulus greater than one, is an unstable fixed point.
Here local asymptotic stability means Lyapunov stability and convergence of all iterates from a neighborhood to ; instability means failure of Lyapunov stability.
Facts & Assumptions
Given: , its fixed point, and the spectral hypothesis in the Statement.
Jordan form over the base field exists exactly when the characteristic polynomial splits: over , a finite-dimensional matrix whose characteristic polynomial splits has a Jordan form.
A complex polynomial of degree has exactly roots counted with multiplicity: every complex characteristic polynomial splits and its roots are counted with algebraic multiplicity.
On a convex open set, a uniform bound implies : on a convex open Euclidean domain, implies .
Euclidean maps and diffeomorphisms: maps have continuous first derivatives.
Proof
Given: and has no eigenvalue of modulus one.
If , the space has only its fixed point, so local asymptotic stability is immediate. Henceforth let . Suppose first every eigenvalue of has modulus less than one. By [F1]–[F2], put its complexification in Jordan form. On a Jordan block of size , conjugate by the diagonal matrix with entries ; the superdiagonal becomes , so the maximum row-sum norm is at most . Choose small for the finitely many blocks. Restricting the resulting equivalent norm to the real space gives an induced norm with .
Fix constants with for the adapted norm in step 1.1; the finite coordinate sums for the change of basis and its inverse give these bounds. Put , so . Choose with . By [F4], on a sufficiently small convex open Euclidean ball, , so [F3] gives . Consequently . Choose an adapted-norm ball inside that Euclidean ball. Since , every iterate from this smaller ball stays in it and satisfies . Norm equivalence also transfers Lyapunov stability to the Euclidean topology, proving local asymptotic stability.
Now suppose has an eigenvalue of modulus greater than one. Its stable and unstable generalized eigenspaces give an invariant direct sum . Applying the Jordan scaling in step 1.1 to and gives equivalent norms and constants such that and .
Write , where . By continuity in [F4], on a sufficiently small ball . In the cone , the product maximum norm gives ; hence and . Choose with and . The cone is forward invariant while the iterate remains in the ball, and its unstable component grows by the factor .
Starting at any arbitrarily small nonzero with , step 3.1 forces an iterate to leave the fixed ball; otherwise its unstable component would grow without bound while staying in that ball. Thus arbitrarily small initial data escape this one fixed neighborhood of zero, so zero is not Lyapunov stable.
Depends on
- Jordan form over the base field exists exactly when the characteristic polynomial splits
- A complex polynomial of degree $n$ has exactly $n$ roots counted with multiplicity
- On a convex open set, a uniform bound $\|Df(z)v\|_2\le M\|v\|_2$ implies $\|f(y)-f(x)\|_2\le M\|y-x\|_2$
- $C^k$ Euclidean maps and diffeomorphisms
Used by
Dependency tree · two levels
20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Yuri A. Kuznetsov, Elements of Applied Bifurcation Theory, 2nd ed., Springer (standard reference, not scraped)
- J. E. Marsden and M. McCracken, The Hopf Bifurcation and Its Applications, Springer-Verlag, 1976 (standard reference, not scraped)