Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 P be a C1 map from a neighborhood of 0 in Rm to Rm with P(0)=0. If DP(0) has no eigenvalue on the unit circle, then:

  • if every eigenvalue has modulus less than one, 0 is a locally asymptotically stable fixed point;
  • if at least one eigenvalue has modulus greater than one, 0 is an unstable fixed point.

Here local asymptotic stability means Lyapunov stability and convergence of all iterates from a neighborhood to 0; instability means failure of Lyapunov stability.

Facts & Assumptions

Given: P, its fixed point, and the spectral hypothesis in the Statement.

[F1]

Jordan form over the base field exists exactly when the characteristic polynomial splits: over C, a finite-dimensional matrix whose characteristic polynomial splits has a Jordan form.

[F2]

A complex polynomial of degree n has exactly n roots counted with multiplicity: every complex characteristic polynomial splits and its roots are counted with algebraic multiplicity.

[F3]

On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2: on a convex open Euclidean domain, ∥Df(z)v∥2≤M∥v∥2 implies ∥f(x)−f(y)∥2≤M∥x−y∥2.

[F4]

Ck Euclidean maps and diffeomorphisms: C1 maps have continuous first derivatives.

Proof

Given: P(0)=0 and A:=DP(0) has no eigenvalue of modulus one.

1.1F1F2givenconstruct

If m=0, the space has only its fixed point, so local asymptotic stability is immediate. Henceforth let m≥1. Suppose first every eigenvalue of A has modulus less than one. By [F1]–[F2], put its complexification in Jordan form. On a Jordan block λI+N of size k, conjugate by the diagonal matrix with entries 1,δ,…,δk−1; 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 ∥A∥<q<1.

2.1F3F4step 1.1givenalgebra

Fix constants c,C>0 with c∥v∥2≤∥v∥≤C∥v∥2 for the adapted norm in step 1.1; the finite coordinate sums for the change of basis and its inverse give these bounds. Put R(x)=P(x)−Ax, so DR(0)=0. Choose ϵ>0 with q′:=q+(C/c)ϵ<1. By [F4], on a sufficiently small convex open Euclidean ball, ∥DR(x)∥2≤ϵ, so [F3] gives ∥R(x)−R(y)∥2≤ϵ∥x−y∥2. Consequently ∥P(x)−P(y)∥≤(q+(C/c)ϵ)∥x−y∥=q′∥x−y∥. Choose an adapted-norm ball inside that Euclidean ball. Since P(0)=0, every iterate from this smaller ball stays in it and satisfies ∥Pn(x)∥≤(q′)n∥x∥→0. Norm equivalence also transfers Lyapunov stability to the Euclidean topology, proving local asymptotic stability.

2.2F1F2step 1.1givenalgebra

Now suppose A has an eigenvalue of modulus greater than one. Its stable and unstable generalized eigenspaces give an invariant direct sum Es⊕Eu. Applying the Jordan scaling in step 1.1 to A∣Es and (A∣Eu)−1 gives equivalent norms and constants a<1<b such that ∥Ass∥≤a∥s∥ and ∥Auu∥≥b∥u∥.

3.1step 2.2F4algebra

Write P(x)=Ax+R(x), where DR(0)=0. By continuity in [F4], on a sufficiently small ball ∥R(x)∥≤ϵ∥x∥. In the cone ∥s∥≤∥u∥, the product maximum norm gives ∥x∥=∥u∥; hence ∥u′∥≥(b−ϵ)∥u∥ and ∥s′∥≤(a+ϵ)∥u∥. Choose ϵ>0 with b−ϵ>1 and a+ϵ<b−ϵ. The cone is forward invariant while the iterate remains in the ball, and its unstable component grows by the factor b−ϵ>1.

4.1step 3.1givencontradiction∎

Starting at any arbitrarily small nonzero u∈Eu with s=0, 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

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