Alphabeta Math
Pipeline-generated
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.

Cm Math Dynamics

1 · Prerequisites

2 · Summary

The differential-dynamics layer of the non-relativistic classical mechanics collection, all of it mathematics: the local flow of an autonomous system and its dependence on initial data, the Poincaré return map, finite-time tangent growth rates, the hyperbolic exponential dichotomy with its Lyapunov stability and instability corollaries, the bilateral two-symbol shift as a chaotic map, the scope of Poincaré recurrence, and the quadratic normal-mode and energy-stability theory of a mechanical system in a chart. Every item on this page carries domain: mathematics and depends only on mathematical suppliers; nothing here asserts that any of these models describes nature, and the physical reading of forces, masses, energies and recurrences remains with the consuming classical-mechanics pages.

The flow layer begins with The local flow of an autonomous first-order system, which defines the maximal solutions of x′=F(x), the flow domain Ω and the partial maps Φt. The local flow is a partial one-parameter group: identity, composition and inverse-time laws proves the identity, composition and inverse-time laws Φs+t=Φs∘Φt; Continuous and Lipschitz dependence on the initial condition on a Picard-Lindelof cylinder gives the Lipschitz and Gronwall estimates on a Picard-Lindelöf cylinder; C¹ dependence of an autonomous flow on the initial condition, and the variational equation proves DaΦt(a)=Ya(t) for the solution of the variational equation, and The flow domain of a C¹ autonomous field is open and the flow is C¹ on it shows that Ω is open and Φ of class C1 on it, the tool used by A transversal return of a C¹ flow yields a local C¹ Poincaré map, with inverse given by the reversed crossing to construct a local C1 Poincaré return map with inverse given by the reversed crossing; its first-return conclusion additionally assumes that the open reference segment avoids the closure of the section, and proves persistence of that exclusion. Finite-time tangent growth rates and Lyapunov exponents of a C¹ flow records t−1log⁡(∥DxΦt(x)u∥2/∥u∥2) and defines the Lyapunov exponent only for a forward-unbounded lifetime and an existing finite limit.

The symbolic layer is The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets, The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact and The bilateral two-symbol shift is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense, which together exhibit the full two-symbol shift as a continuous self-map of a sequentially compact metric space (compact under the Countable and Dependent Choice assumptions of the companion lemma, clause 4) that is topologically mixing, has dense periodic points and is sensitive with constant 1, in the sense fixed by Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list. This is a topological example, not a smoothly realized mechanical flow. Scope of Poincaré recurrence for mechanical systems: finite invariant volume and complete return maps collects the published recurrence statements with their hypotheses made explicit: finite invariant measure, a nonzero time map defined for all iterates, and almost-everywhere conclusions only.

The hyperbolicity layer is Exponential dichotomy for a hyperbolic endomorphism: invariant stable and unstable subspaces with exponential estimates, whose invariant splitting V=Es⊕Eu with exponential estimates is obtained from the coprime factorisation of the minimal polynomial and the Jordan form, with no diagonalisability hypothesis. On it rest An equilibrium whose linearisation has all eigenvalues in the open left half-plane is locally exponentially stable, where a linearisation with all eigenvalues in the open left half-plane gives a locally exponentially stable equilibrium through the Lyapunov matrix ∫0∞etATetAdt, and A hyperbolic equilibrium whose linearisation has an eigenvalue with positive real part is unstable, where an eigenvalue with positive real part gives nonlinear instability through an indefinite quadratic form. Both are nonlinear conclusions with complete conditional proofs.

The mechanical and modal layer is The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart (the field G, its Lagrangian and energy, with an arbitrary C2 positive definite kinetic metric) and Energy is conserved along solutions of the mechanical system with a configuration-dependent kinetic metric (exact energy conservation along solutions). The modal theory is Positive definite symmetric matrices have positive definite square roots, and the congruence M^{-1/2} K M^{-1/2} preserves symmetry and positivity and Decoupling of the constant-coefficient quadratic system Mq′′+Kq=0 into normal modes, with the zero-mode and energy identities, which decouple Mq′′+Kq=0 into zi′′+λizi=0 with λi≥0 for symmetric non-negative K, including the free affine zero mode and the modal energies; A C² local minimum has vanishing gradient and positive semidefinite Hessian and A strict local minimum of the potential gives a Lyapunov stable equilibrium of the mechanical system, by energy conservation give Lyapunov stability at a strict minimum of the potential, and Linearisation of the mechanical system at an equilibrium: M(q_0) xi'' + D²U(q_0) xi = 0, and the small-oscillation quadratic model computes the linearised system M(q0)ξ′′+D2U(q0)ξ=0. Scope of the quadratic-mode and energy-stability results: exact quadratic model versus linearisation approximation separates the exact quadratic model from the linearisation approximation.

The companion page cm-math-dynamics-examples records worked examples: the flow of a linear system, two coupled oscillators, the return map of the planar oscillator, finite checks in the shift, computed dichotomy constants, and a non-hyperbolic counterexample.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The local flow of an autonomous first-order system

Definition

Let n≥1, let U⊆Rn be open, and let F:U→Rn be continuous and locally Lipschitz in the state variable in the sense of Local Lipschitz continuity in the state variable, locally uniform in time and parameters. Read the autonomous system

x′(t)=F(x(t))

as the first-order system of First-order systems, initial value problems, and solutions on intervals with domain D=R×U⊆R×Rn and right-hand side (t,x)↦F(x). Its initial value problems satisfy the Picard-Lindelöf hypotheses, so by Every Picard–Lindelöf initial value problem has one maximal solution on an open interval every a∈U has a unique maximal solution.

For a∈U denote by

x( ⋅ ;a):Ia⟶U

the unique maximal solution with x(0;a)=a, where Ia⊆R is its maximal interval of existence (Extensions, maximal solutions, maximal intervals, and global solutions); Ia is an open interval containing 0, and every solution of x′=F(x) through (0,a) is a restriction of x( ⋅ ;a).

The flow domain of F is the set

Ω:={ (t,a)∈R×U  :  t∈Ia },

and the local flow (also phase flow) of F is the map

Φ:Ω⟶U,Φ(t,a):=x(t;a).

For t∈R the time-t map is the partial map

Φt:Ωt⟶U,Ωt:={ a∈U:(t,a)∈Ω },Φt(a):=Φ(t,a).

Thus Φ0(a)=a whenever it is defined, and (t,a)∈Ω exactly when the maximal solution of x′=F(x) through a is defined at time t.

Remarks

  • The word local refers to the domain: Ω need not equal R×U. Whether Ω=R×U (completeness of the field) is a separate property of F and is not asserted by this definition. Every statement about Φ has to carry its domain condition (t,a)∈Ω explicitly.

  • The local flow is the solution family of an autonomous field. It is a different object from the stroboscopic map of a time-periodic system (The stroboscopic (time-P) map of a P-periodic first-order system), although for an autonomous field the stroboscopic map of period P>0 is the restriction of ΦP to the set of initial states whose maximal solutions exist for a full period.

  • The identities Φ0(a)=a and Φt+s(a)=Φt(Φs(a)) are not part of the definition; they are proved from maximality and uniqueness in The local flow is a partial one-parameter group: identity, composition and inverse-time laws. The definition records only the assignment of solutions, so that no uniqueness statement is smuggled into a definition.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The local flow is a partial one-parameter group: identity, composition and inverse-time laws

Statement

Let n≥1, let U⊆Rn be open, let F:U→Rn be continuous and locally Lipschitz in the state variable (Local Lipschitz continuity in the state variable, locally uniform in time and parameters), and let Φ:Ω→U be the local flow of x′=F(x) as in The local flow of an autonomous first-order system, with maximal solutions x( ⋅ ;a):Ia→U and flow domain Ω={(t,a):t∈Ia}. Then:

  1. (0,a)∈Ω and Φ(0,a)=a for every a∈U;
  2. if (s,a)∈Ω and (t,Φ(s,a))∈Ω, then (s+t,a)∈Ω and Φ(s+t,a)=Φ(t,Φ(s,a));
  3. if (t,a)∈Ω, then (−t,Φ(t,a))∈Ω and Φ(−t,Φ(t,a))=a.

Facts & Assumptions

Given: The open set U, the field F, and the local flow Φ built from the unique maximal solutions x( ⋅ ;a) through (0,a).

[F1]

For every a∈U, x( ⋅ ;a):Ia→U is a solution of x′=F(x) with x(0;a)=a on the open interval Ia containing 0, it is maximal, and every solution of that initial value problem is a restriction of it; moreover this maximal solution is unique (The local flow of an autonomous first-order system, Extensions, maximal solutions, maximal intervals, and global solutions, Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, First-order systems, initial value problems, and solutions on intervals).

[F2]

If y:J→U is a solution of x′=F(x) and s∈J, then the translate ys(σ):=y(σ+s), defined for σ∈J−s:={σ:σ+s∈J}, is again a solution of x′=F(x) on the open interval J−s, with ys(0)=y(s): this is the chain rule applied to the translation σ↦σ+s, which has derivative 1 (First-order systems, initial value problems, and solutions on intervals).

Proof

technique · direct; use uniqueness and maximality of solutions to glue translated solutions
1.1givenF1

Clause 1 is definitional: 0∈Ia because Ia is the maximal interval of the solution through (0,a), and Φ(0,a)=x(0;a)=a.

1.2givenF2

Fix (s,a)∈Ω and put b:=Φ(s,a)=x(s;a). Define J:=Ia−s and y:J→U by y(σ):=x(σ+s;a). By [F2], y solves x′=F(x) on the open interval J, and y(0)=x(s;a)=b.

2.1givenstep 1.2F1

The curve x( ⋅ ;b) is the unique maximal solution through (0,b) and y is a solution through (0,b); by [F1] y is the restriction of x( ⋅ ;b) to J, so J⊆Ib and y=x( ⋅ ;b)∣J. If J were a proper subinterval of Ib, the curve z(r):=x(r−s;b) on Ib+s would, by [F2], be a solution extending x( ⋅ ;a) from Ia=J+s to a strictly larger interval, contradicting its maximality in [F1]. Thus Ib=J. Now let t∈Ib; then t∈J, that is s+t∈Ia, and Φ(s+t,a)=x(s+t;a)=y(t)=x(t;b)=Φ(t,Φ(s,a)). This is clause 2.

3.1givenstep 2.1F1F2∎

For clause 3, fix (t,a)∈Ω and put b:=Φ(t,a)=x(t;a). Define K:=Ia−t and w:K→U by w(σ):=x(σ+t;a). By [F2] (with s=t) w solves x′=F(x) on the open interval K, and w(0)=x(t;a)=b. By [F1] w is the restriction of the unique maximal solution x( ⋅ ;b) to K; hence −t∈K⊆Ib and Φ(−t,b)=x(−t;b)=w(−t)=x(0;a)=a.

Remarks

  • Clause 2 is the cocycle or semigroup identity for the partial flow; it is proved, not assumed. Its hypothesis (t,Φ(s,a))∈Ω cannot be dropped: for a field whose solutions blow up in finite time, the solution through a may be defined at time s but not for a further time t from Φ(s,a).

  • Clause 3 says that Φt is injective on its domain with inverse Φ−t restricted to Φt(Ωt); this is a consequence of uniqueness and maximality, and it is used in Finite-time tangent growth rates and Lyapunov exponents of a C¹ flow.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Continuous and Lipschitz dependence on the initial condition on a Picard-Lindelof cylinder

Statement

Let n≥1, let U⊆Rn be open and let F:U→Rn be continuous and locally Lipschitz in the state variable (Local Lipschitz continuity in the state variable, locally uniform in time and parameters). Let a0∈U, let h>0 and R>0 satisfy B‾(a0,R)⊆U (Open ball, closed ball and sphere in a metric space), put

M:=sup⁡x∈B‾(a0,R)∥F(x)∥2,L:=a state-Lipschitz constant of F on B‾(a0,R),

so that ∥F(x)−F(y)∥2≤L∥x−y∥2 for all x,y∈B‾(a0,R) (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn), and let 0≤ρ<R satisfy

hM≤R−ρ,Lh<1.

Then for every a∈B‾(a0,ρ) the initial value problem

x′(t)=F(x(t)),x(0)=a

has exactly one solution x( ⋅ ;a) on [−h,h] whose graph lies in [−h,h]×B‾(a0,R), and for all a,b∈B‾(a0,ρ) and all s,t∈[−h,h]:

  1. ∥x(t;a)−x(t;b)∥2≤eL∣t∣∥a−b∥2;
  2. ∥x(t;a)−x(s;a)∥2≤M ∣t−s∣;
  3. ∥x(t;a)−x(s;b)∥2≤eLh∥a−b∥2+M ∣t−s∣; in particular the map (t,a)↦x(t;a) is Lipschitz, hence continuous, on the compact set [−h,h]×B‾(a0,ρ).

Facts & Assumptions

Given: The open set U, the continuous and locally Lipschitz field F, the point a0∈U, the numbers h,R>0 with B‾(a0,R)⊆U, the constants M,L and the radius ρ with hM≤R−ρ and Lh<1.

[F1]

Picard-Lindelöf: if [t0−h,t0+h]×B‾(x0,r)⊆R×U, if ∥F∥2≤M and F has state-Lipschitz constant L on that cylinder, and if hM≤r and Lh<1, then exactly one solution of x′=F(x), x(t0)=x0 exists on [t0−h,t0+h] with graph in the cylinder; any two solutions through the same initial data agree on every common subinterval containing the initial time (Picard-Lindelöf local existence and uniqueness for first-order systems, First-order systems, initial value problems, and solutions on intervals).

[F2]

F is locally Lipschitz in the state variable: every compact time-state cylinder carries a finite state-Lipschitz constant (Local Lipschitz continuity in the state variable, locally uniform in time and parameters); in particular L as chosen in the statement is finite and the inequality ∥F(x)−F(y)∥2≤L∥x−y∥2 holds on B‾(a0,R).

[F3]

For ρ=0 the notation B‾(a0,ρ) means the singleton {a0}, as follows from the inequality defining a closed ball. B‾(a0,R) is closed and bounded, hence compact in Rn (Open ball, closed ball and sphere in a metric space, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), so the continuous function ∥F∥2 attains its maximum there and M<+∞ (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F6]

Gronwall: if continuous u:[0,T]→R and constants A≥0, L≥0 satisfy u(t)≤A+L∫0tu for t∈[0,T], then u(t)≤AeLt there; the reflected form for an integral oriented as ∫t0 gives u(t)≤AeL∣t∣ for t≤0 (Gronwall's integral inequality with variable and constant coefficients).

Proof

technique · direct; construct the solutions on a common cylinder and estimate their difference with Gronwall's inequality
1.1givenF1F2F3algebra

Fix a∈B‾(a0,ρ) and put ra:=R−∥a−a0∥2, so that ra≥R−ρ>0. Then [−h,h]×B‾(a,ra)⊆[−h,h]×B‾(a0,R)⊆R×U: if ∥x−a∥2≤ra then ∥x−a0∥2≤∥x−a∥2+∥a−a0∥2≤ra+∥a−a0∥2=R. Moreover hM≤R−ρ≤ra and Lh<1, and the bounds M and L hold on the larger cylinder [−h,h]×B‾(a0,R) by [F2] and [F3]. By [F1] with t0=0, x0=a, r=ra, exactly one solution x( ⋅ ;a) on [−h,h] exists whose graph lies in [−h,h]×B‾(a,ra)⊆[−h,h]×B‾(a0,R).

2.1F4F5step 1.1algebra

For a,b∈B‾(a0,ρ) put e:=x( ⋅ ;a)−x( ⋅ ;b). By [F4], for t∈[0,h], e(t)=a−b+∫0t(F(x(r;a))−F(x(r;b)))dr. The integrand is continuous because F and the two solutions are continuous, so [F5] gives ∥e(t)∥2≤∥a−b∥2+L∫0t∥e(r)∥2 dr: the Lipschitz estimate applies on B‾(a0,R) since both graphs lie there by step 1.1.

2.2step 1.1F4F5algebra

For s,t∈[−h,h], [F4] gives x(t;a)−x(s;a)=∫stF(x(r;a)) dr, and the graph of x( ⋅ ;a) lies in B‾(a0,R) by step 1.1, where ∥F∥≤M; hence ∥x(t;a)−x(s;a)∥2≤M∣t−s∣ by [F5]. This is clause 2.

3.1step 2.1F1F4F5F6algebra

Applying [F6] with u=∥e∥2, A=∥a−b∥2 gives ∥e(t)∥2≤eLt∥a−b∥2 for t∈[0,h]. For t∈[−h,0] apply the same argument to the reflected curves x~(s):=x(−s;a), x~(s):=x(−s;b) on [0,−t]: their difference obeys the same integral inequality, so ∥e(t)∥2≤e−Lt∥a−b∥2=eL∣t∣∥a−b∥2. This is clause 1.

4.1step 3.12.2algebra∎

Combining clauses 1 and 2 with the triangle inequality, ∥x(t;a)−x(s;b)∥2≤∥x(t;a)−x(s;a)∥2+∥x(s;a)−x(s;b)∥2≤M∣t−s∣+eLh∥a−b∥2 for all (t,a),(s,b)∈[−h,h]×B‾(a0,ρ); this is clause 3. The domain of the map is a closed bounded subset of R×Rn, hence compact (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), and the displayed inequality exhibits it as Lipschitz.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

C¹ dependence of an autonomous flow on the initial condition, and the variational equation

Statement

Let n≥1, let U⊆Rn be open, let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms), let a0∈U, and let T>0, R>0 with B‾(a0,R)⊆U (Open ball, closed ball and sphere in a metric space). Put M:=sup⁡B‾(a0,R)∥F∥2 and L:=sup⁡B‾(a0,R)∥DF∥, where DF(x) is the total derivative of F at x with its operator norm (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The operator norm as the least bound and as the unit-sphere or unit-ball supremum); both are finite. Let 0<ρ<R−MT, so that in particular MT<R. Let Φ be the local flow of x′=F(x) (The local flow of an autonomous first-order system).

Then:

  1. For every a∈B‾(a0,ρ) the maximal solution x( ⋅ ;a) is defined on [0,T] and satisfies ∥x(t;a)−a0∥2≤ρ+Mt<R for t∈[0,T]; moreover

∥x(t;a)−x(t;b)∥2≤eLt∥a−b∥2(a,b∈B‾(a0,ρ), t∈[0,T]),

and (t,a)↦x(t;a) is continuous on the compact set [0,T]×B‾(a0,ρ).

  1. For every a∈B(a0,ρ) the variational equation along x( ⋅ ;a),

Y′(t)=DF(x(t;a))Y(t),Y(0)=In,

has a unique solution Ya:[0,T]→Mn(R) (The variational equation along an ODE solution), and for every t∈[0,T] the map a↦x(t;a) is differentiable on the open ball B(a0,ρ), with

Dax(t;a)h=Ya(t)h(h∈Rn).

  1. The map (t,a)↦Ya(t) is continuous on [0,T]×B(a0,ρ), and consequently (t,a)↦x(t;a) is C1 there with

∂tx(t;a)=F(x(t;a)),Dax(t;a)=Ya(t).

Facts & Assumptions

Given: The open set U, the C1 field F, the point a0∈U, the numbers T,R>0 with B‾(a0,R)⊆U, the finite constants M,L, and 0<ρ<R−MT.

[F10]

Matrix and norm convention (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): a matrix A∈Mn(R) acts on Euclidean Rn by (Av)i=∑j<nAijvj, and every matrix norm in this item is the subordinate Euclidean norm ∥A∥op:=sup⁡∥v∥2≤1∥Av∥2; the undecorated ∥DF∥ in the Statement means this norm. Rowwise Cauchy-Schwarz gives ∥Av∥2≤(∑i,j<nAij2)1/2∥v∥2, so the linear map is bounded and its operator norm is finite. Rescaling gives ∥Av∥2≤∥A∥op∥v∥2; the triangle inequality on vectors gives the triangle inequality on these operator norms. Matrix multiplication represents composition, hence ∥AB∥op≤∥A∥op∥B∥op, and ∥In∥op=1 since n≥1. Moreover ∣∥A∥op−∥B∥op∣≤∥A−B∥op≤(∑i,j<n(Aij−Bij)2)1/2, so entrywise continuity implies continuity in this norm. For a continuous matrix curve C on [r,s], its integral is entrywise; applying the vector integral estimate to C(t)v for each ∥v∥2≤1 and taking the supremum gives ∥∫rsC(t) dt∥op≤∫rs∥C(t)∥op dt when r≤s (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable).

[F1]

F is continuous (differentiability implies continuity) and locally Lipschitz in the state variable: on the compact convex cylinder [0,T]×B‾(a0,R) the derivative bound L gives ∥F(x)−F(y)∥2≤L∥x−y∥2, since F is C1 and the segment between two points of the ball lies in the ball; and ∥F∥≤M there. The same segment argument on a closed ball contained in U about any point proves the local Lipschitz hypothesis throughout U. Also B‾(a0,R) is compact, and [F10] makes ∥DF∥op continuous, so both suprema are attained and finite (Local Lipschitz continuity in the state variable, locally uniform in time and parameters, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

[F2]

Picard-Lindelöf and maximal solutions: local solutions exist uniquely through every initial point, and every initial value problem has a unique maximal solution, of which every other solution through the same data is a restriction (Picard-Lindelöf local existence and uniqueness for first-order systems, Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, Extensions, maximal solutions, maximal intervals, and global solutions, The local flow of an autonomous first-order system).

[F3]

Compact continuation: a solution of x′=F(x) whose graph approaches a compact subset of R×U at a finite endpoint extends past that endpoint; in the autonomous case it suffices that the solution values stay in a compact subset of U near the endpoint (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it).

[F5]

Norm and integral estimates: ∥∫rsg∥2≤∣∫rs∥g∥2∣, and if ∥g∥2≤c on an interval then the norm of the integral is at most c times the length; the Euclidean norm satisfies the triangle inequality, and for u≠0 the supremum sup⁡∥v∥2=1∣⟨u,v⟩2∣ equals ∥u∥2 (the value v=u/∥u∥2 gives ∥u∥2, and Cauchy-Schwarz bounds every value by ∥u∥2) (For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable, If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a), Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F6]

Gronwall: if continuous u:[0,T]→R, u≥0, satisfies u(t)≤a(t)+∫0tLu with L≥0 and nondecreasing continuous a≥0, then u(t)≤a(t)eLt; with a constant A this reads u(t)≤AeLt (Gronwall's integral inequality with variable and constant coefficients).

[F7]

F is C1, so for x,y with the segment [x,y]⊆U one has F(y)−F(x)=∫01DF(x+τ(y−x))(y−x) dτ, by the chain rule for τ↦F(x+τ(y−x)) and the fundamental theorem; on the compact ball this gives the uniform remainder bound ∥F(y)−F(x)−DF(x)(y−x)∥2≤ω(∥y−x∥2)∥y−x∥2, where ω(s):=sup⁡{∥DF(u)−DF(w)∥:u,w∈B‾(a0,R),∥u−w∥2≤s} and ω(s)→0 as s↓0 by [F10] and Heine-Cantor uniform continuity of DF on the compact ball (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a), For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F8]

The linear matrix initial value problem Y′=C(t)Y, Y(0)=In, with C:[0,T]→Mn(R) continuous, has a unique solution on all of [0,T] (Linear matrix ODEs have unique global solutions on a fixed interval).

[F9]

If the partial derivatives of a map exist on a neighbourhood of a point and are continuous there, the map is totally differentiable at that point (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).

Proof

technique · direct; first trap the solutions in a compact ball and extend them by continuation, then estimate differences with Gronwall, then compare solutions with the variational equation
1.1givenF1F2F4F5choosealgebra

Fix a∈B‾(a0,ρ) and let x=x( ⋅ ;a):[0,β)→U be the maximal forward solution, with β≤∞. Choose a fixed radius r with ρ+MT<r<R. The curve cannot reach the sphere of radius r about a0 at a time t∗<β with t∗≤T: at the first such time it has stayed in B‾(a0,r)⊆B‾(a0,R), so [F4] and [F5] give ∥x(t∗)−a0∥2≤ρ+Mt∗≤ρ+MT<r, a contradiction. Thus for every 0≤t<β with t≤T the whole curve on [0,t] stays in this fixed ball, and the same integral estimate gives ∥x(t)−a0∥2≤ρ+Mt<R.

2.1step 1.1F3

Consequently, if β≤T the graph of x stays in the compact set [0,T]×B‾(a0,ρ+MT)⊆R×U; by [F3] x extends past β, contradicting maximality of the maximal solution (Extensions, maximal solutions, maximal intervals, and global solutions). Hence β>T, so x( ⋅ ;a) is defined on [0,T], and step 1.1 gives ∥x(t;a)−a0∥2≤ρ+Mt≤ρ+MT<R there.

3.1step 1.12.1F1F4F5F6algebra

For a,b∈B‾(a0,ρ) put e(t):=x(t;a)−x(t;b). By [F4] and [F5], ∥e(t)∥2≤∥a−b∥2+L∫0t∥e(r)∥2 dr for t∈[0,T], because both graphs lie in B‾(a0,R) by step 2.1 and ∥F(x)−F(y)∥≤L∥x−y∥ there. By [F6] with A=∥a−b∥2, ∥e(t)∥2≤eLt∥a−b∥2. Adding the uniform bound ∥x(t;a)−x(s;a)∥2≤M∣t−s∣ obtained from [F4] and [F5] gives continuity of (t,a)↦x(t;a) on [0,T]×B‾(a0,ρ). This is clause 1.

4.1step 3.1F7F8algebra

Fix a∈B(a0,ρ) and let Ya be the unique solution of the variational equation on [0,T], which exists by [F8] since t↦DF(x(t;a)) is continuous (composition of the continuous map DF with the continuous curve x( ⋅ ;a)). For h∈Rn with a+h∈B‾(a0,ρ) put eh:=x( ⋅ ;a+h)−x( ⋅ ;a) and Rh(t):=F(x(t;a+h))−F(x(t;a))−DF(x(t;a))eh(t). By [F7] applied to the pair (x(t;a+h),x(t;a)), whose segment lies in B‾(a0,R) by convexity, ∥Rh(t)∥2≤ω(∥eh(t)∥2)∥eh(t)∥2, and by step 3.1 ∥eh(t)∥2≤eLT∥h∥2.

4.2step 3.1F4F5F6F7F10algebra

The map (t,a)↦Ya(t) is continuous on [0,T]×B(a0,ρ). First, ∥Ya(t)∥op≤eLt≤eLT by the entrywise Volterra equation, the matrix integral and product estimates of [F10], ∥In∥op=1 and [F6]. Second, for a,b the difference Δ:=Ya−Yb satisfies Δ′=DF(x(t;a))Δ+(DF(x(t;a))−DF(x(t;b)))Yb with Δ(0)=0, so [F4], [F5], [F6] and [F10] with ∥Yb∥op≤eLT give ∥Δ(t)∥op≤eLT⋅T⋅sup⁡r∈[0,T]∥DF(x(r;a))−DF(x(r;b))∥op⋅eLT, which tends to 0 as b→a because x(r;b)→x(r;a) uniformly in r by step 3.1 and ∥DF(u)−DF(w)∥≤ω(∥u−w∥2) with ω(s)→0. Finally, ∥Ya(t)−Ya(s)∥op≤LeLT∣t−s∣ by Ya(t)−Ya(s)=∫stDF(x(r;a))Ya(r) dr and [F10]. Combining these three estimates proves continuity.

5.1step 4.1F4F5F6F7algebra

Define δh(t):=eh(t)−Ya(t)h. Differentiating and using the definitions of eh, Rh and Ya gives δh′(t)=DF(x(t;a))δh(t)+Rh(t) with δh(0)=0; hence, by [F4] applied to the curve δh and [F5], ∥δh(t)∥2≤∫0t∥Rh(r)∥2 dr+L∫0t∥δh(r)∥2 dr. Since r↦∫0r∥Rh∥2 is nondecreasing, [F6] gives ∥δh(t)∥2≤eLt∫0t∥Rh(r)∥2 dr≤e2LTT ω(eLT∥h∥2) ∥h∥2 for ∥h∥2≤e−LT; dividing by ∥h∥2 and letting h→0 yields ∥x(t;a+h)−x(t;a)−Ya(t)h∥2/∥h∥2→0 uniformly in t∈[0,T]. Hence a↦x(t;a) is differentiable on B(a0,ρ) with Dax(t;a)h=Ya(t)h for every t. This is clause 2.

6.1step 1.13.14.25.1F2F8F9choose∎

Choose ϵ>0 so small that ρ+M(T+ϵ)<R (if M=0, any sufficiently small positive ϵ works). Steps 1.1-5.1, which did not use [F9], apply with T+ϵ in place of T and show that the positive-time flow has continuous state derivative on [0,T+ϵ]×B(a0,ρ). Apply those same steps to the C1 field −F for time length ϵ, with the same ball and bounds M,L. Its solution Ψ(s,a) gives Φ(t,a)=Ψ(−t,a) for −ϵ≤t≤0: time reversal solves the original equation and agrees with its maximal solution by [F2]. Hence the state derivative exists and is continuous also on this negative-time slab; at t=0 both state derivatives are In, and their joint continuity on the two slabs makes the state derivative continuous across 0. The time derivative exists throughout the open set (−ϵ,T+ϵ)×B(a0,ρ) and equals F(Φ(t,a)), including at 0 because the maximal solution solves the equation on its open interval. Joint continuity follows from step 3.1 on each slab and their common value Φ(0,a)=a. Thus all partial derivatives are continuous on this open set, and [F9] makes the flow C1 there. Its restriction proves clause 3 on [0,T]×B(a0,ρ), with DaΦ(t,a)=Ya(t) by step 5.1; the variational solution on the longer interval restricts to Ya by uniqueness [F8].

Remarks

  • The hypothesis ρ+MT<R is a genuine trapping condition: it keeps the whole graph of every considered solution in a compact subset of the domain, which is what lets Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it extend the maximal solution to the full interval [0,T]. The conclusion is local in the initial condition and in time, and no claim is made that Dax(t;a) is defined at the boundary of the ball or for t outside [0,T].

  • The proof actually shows more than stated: ∥x(t;a+h)−x(t;a)−Ya(t)h∥2≤e2LTTω(eLT∥h∥2)∥h∥2, an explicit first-order error bound. The nonautonomous analogue (with F=F(t,x) and the variational equation along a solution on a compact interval) is the same computation with the time variable kept, and is not needed in this batch.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The flow domain of a C¹ autonomous field is open and the flow is C¹ on it

Statement

Let n≥1, let U⊆Rn be open, let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms), and let Φ:Ω→U be the local flow of x′=F(x) with maximal solutions x( ⋅ ;a):Ia→U (The local flow of an autonomous first-order system). Then Ω is open in R×U (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), and Φ is of class C1 on Ω, with

∂tΦ(t,a)=F(Φ(t,a))((t,a)∈Ω).

Facts & Assumptions

Given: The open set U, the C1 field F and its local flow Φ.

[F1]

Throughout this proof, vector norms are Euclidean and matrix norms are the subordinate Euclidean operator norms defined, bounded and shown continuous in Facts [F10] of C¹ dependence of an autonomous flow on the initial condition, and the variational equation; in particular ∥DF∥ below means ∥DF∥op. Smooth dependence on the initial condition: if a0∈U, T>0, R>0 with B‾(a0,R)⊆U, M=sup⁡B‾(a0,R)∥F∥2, L=sup⁡B‾(a0,R)∥DF∥ and 0<ρ<R−MT, then every a∈B‾(a0,ρ) has its maximal solution defined on [0,T] with values in B‾(a0,ρ+MT)⊆B(a0,R), the estimate ∥x(t;a)−x(t;b)∥2≤eLt∥a−b∥2 holds for t∈[0,T], and (t,a)↦x(t,a) is C1 on [0,T]×B(a0,ρ) with ∂tx=F(x) and Dax(t;a)=Ya(t) (C¹ dependence of an autonomous flow on the initial condition, and the variational equation).

[F2]

Composition law: Φ(0,a)=a, and Φ(s+t,a)=Φ(t,Φ(s,a)) whenever both sides are defined (The local flow is a partial one-parameter group: identity, composition and inverse-time laws); every solution of x′=F(x) through an initial point is a restriction of the corresponding maximal solution (The local flow of an autonomous first-order system).

[F3]

Positive distance gap: if K⊆Rn is nonempty compact, C⊆Rn nonempty closed and K∩C=∅, there is δ>0 with ∥k−c∥2≥δ for all k∈K, c∈C (A compact set and a disjoint closed set have a positive norm-distance gap).

[F5]

Chain rule and C1 calculus: the composite of totally differentiable maps is totally differentiable with D(g∘f)(x)=Dg(f(x))∘Df(x); a map with continuous partial derivatives is totally differentiable; and a map that is totally differentiable everywhere with continuous total derivative is C1 (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, Ck Euclidean maps and diffeomorphisms, Open ball, closed ball and sphere in a metric space).

Proof

technique · direct; cover the reference trajectory by finitely many Picard-Lindelöf steps with radially shrinking balls and invoke the smooth dependence theorem on each step
1.1givenF1F3F4choosealgebra

Let (t0,a0)∈Ω with t0>0, and let x:=x( ⋅ ;a0) on [0,t0]. Its image K:=x([0,t0]) is nonempty compact and lies in U. If Rn∖U is nonempty, [F3] gives a separation d>0; choose 0<δ<d, so every closed δ-ball centred in K lies in U. If U=Rn, choose any δ>0. Define dK(z):=min⁡k∈K∥z−k∥2: for each fixed z, the reverse triangle inequality makes k↦∥z−k∥2 continuous, so the minimum is attained by [F4]. If kw attains the minimum for w, then dK(z)≤∥z−kw∥2≤∥z−w∥2+dK(w); interchanging z,w gives ∣dK(z)−dK(w)∣≤∥z−w∥2. Thus the fixed tube H:={z:dK(z)≤δ} is closed. Since compact K is bounded, there is B≥0 with ∥k∥2≤B for k∈K; a minimizing k for z∈H gives ∥z∥2≤B+δ, so H is bounded and hence compact by [F4]. It lies in U: if the complement of U is nonempty, every point in it has dK(z)≥d>δ by [F3]; when U=Rn inclusion is automatic. The vector norm inequalities used here are those of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation. Put M:=sup⁡H∥F∥2 and L:=sup⁡H∥DF∥, finite by [F4] and the norm continuity in [F1], before choosing any subdivision. Choose N≥1 with h:=t0/N satisfying hM≤δ/4 and hL≤1/2, and set xj:=x(jh) for 0≤j≤N. Every B‾(xj,δ) lies in H; thus its bounds Mj,Lj satisfy Mj≤M, Lj≤L. Set ρ:=δ/4.

2.1step 1.1F1algebra

Small-step claim: for every j and every y∈B‾(xj,ρ), the maximal solution through y is defined on [0,h] with values in B‾(xj,δ)⊆U, and Φ is C1 on [0,h]×B(xj,ρ) with ∥Φ(t,y)−Φ(t,xj)∥2≤eLt∥y−xj∥2. Indeed ρ+Mjh≤δ/4+δ/4<δ, so [F1] applies to a0:=xj, T:=h, R:=δ and the radius ρ: the bound on [0,h] is Mj≤M, and the stated estimates are clauses 1 and 3 of [F1].

3.1step 2.1F2F5algebra

Put ρ0:=ρe−Lt0 and, for 0≤j≤N, ρj:=ρe−L(t0−jh), so that ρN=ρ, ρj≤ρ for j<N, and ρj+1=eLhρj. I claim, by induction on j, that Φ(jh, ⋅ ) is C1 on W:=B(a0,ρ0) and Φ(jh,W)⊆B(xj,ρj). For j=0 this says Φ(0,a)=a∈B(a0,ρ0) and is [F2]. If it holds for j, then for a∈W the point y:=Φ(jh,a) lies in B(xj,ρj)⊆B(xj,ρ), so the small-step claim of step 2.1 gives that Φ(h,y) is defined and Φ((j+1)h,a)=Φ(h,Φ(jh,a)); moreover ∥Φ(h,y)−xj+1∥2=∥Φ(h,y)−Φ(h,xj)∥2≤eLh∥y−xj∥2<eLhρj=ρj+1, so Φ((j+1)h,W)⊆B(xj+1,ρj+1), and Φ((j+1)h, ⋅ ) is a composite of C1 maps on the relevant open sets by [F5]. This proves the claim; in particular Φ(t0, ⋅ ) is C1 on W.

4.1step 2.13.1F1F2F5

The endpoint regularity in [F1] means regularity of a local extension to an open time neighbourhood, as its proof establishes. For (t0,a0) choose the last step, writing t0=(N−1)h+h. By step 3.1, g(a):=Φ((N−1)h,a) is C1 on W and g(a0)=xN−1. By step 2.1 and [F1], the small-step flow is defined and C1 on an open neighbourhood V of (h,xN−1). Continuity of (t,a)↦(t−(N−1)h,g(a)) gives a product neighbourhood J×W′ of (t0,a0), with W′⊆W, whose image lies in V. On it [F2] gives Φ(t,a)=Φ(t−(N−1)h,g(a)), so the flow is defined and C1 by [F5]. This proves openness and regularity near every positive-time point without requiring any seam assertion.

5.1step 1.12.13.14.1F1F2F5choose∎

For a point (0,a0) choose R>0 with B‾(a0,R)⊆U, put M:=sup⁡B‾(a0,R)∥F∥2, and choose ρ=R/2 and h>0 with Mh<R/2. Apply [F1] to both F and −F on [0,h]×B(a0,ρ). Time reversal and uniqueness [F2] identify the second flow with Φ(−s,a), so (−h,h)×B(a0,ρ)⊆Ω. The state derivatives are continuous on both sides and equal In at 0, while the time derivative on the whole interval is F(Φ(t,a)) by the maximal-solution equation. The two continuous pieces agree at 0, so [F5] gives C1 regularity on this open product. For t0<0, apply steps 1.1-4.1 to −F at (−t0,a0) and reverse time; uniqueness identifies its maximal interval with −Ia (a proper extension would reverse to an extension of the original maximal solution). Thus every point of Ω has an open neighbourhood on which Φ is defined and C1. On all these neighbourhoods ∂tΦ(t,a)=F(Φ(t,a)), proving the statement.

Remarks

  • The proof uses only finitely many Picard-Lindelöf steps, so no countable or dependent choice is invoked; the positive gap of [F3] is the published choice-free separation statement. The corollary is the tool that lets the Poincaré return map of A transversal return of a C¹ flow yields a local C¹ Poincaré map, with inverse given by the reversed crossing be built from the implicit function theorem without extra hypotheses on the flow.

  • The conclusion is local in nature: Ω is open but need not be all of R×U, and the corollary does not assert completeness of F, boundedness of Φ, or any uniformity of the C1 estimate over all of Ω.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A transversal return of a C¹ flow yields a local C¹ Poincaré map, with inverse given by the reversed crossing

Statement

Let n≥1, let U⊆Rn be open, let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms), and let Φ:Ω→U be the local flow of x′=F(x) (The local flow of an autonomous first-order system). Let x0∈U and t0>0 satisfy (t0,x0)∈Ω, and put x1:=Φ(t0,x0). Let W⊆Rn be open with x0,x1∈W, and let h:W→R be C1 with

h(x0)=h(x1)=0,Dh(x0)F(x0)≠0,Dh(x1)F(x1)≠0;

thus the reference orbit meets the level set Σ:=h−1(0)∩W transversally at x0 (time 0) and again at x1 (time t0). Then there are open sets A⊆W with x0∈A and B⊆W with x1∈B, and C1 functions

τ:A→R,σ:B→R,τ(x0)=σ(x1)=t0,

such that:

  1. h(Φ(τ(x),x))=0 for every x∈A, and there is an open interval J∋t0 with A⊆W such that

h(Φ(t,x))=0, (t,x)∈J×A⟺t=τ(x);

  1. h(Φ(−σ(y),y))=0 for every y∈B, and the map

P:A⟶Σ,P(x):=Φ(τ(x),x),

is C1 with P(A∩Σ)⊆B, while

Q:B⟶Σ,Q(y):=Φ(−σ(y),y),

is C1 with Q(B∩Σ)⊆A, Q(P(x))=x for all x∈A∩Σ, and P(Q(y))=y for all y∈B∩Σ∩Q−1(A);

  1. P(A∩Σ)=B∩Σ∩Q−1(A) is open in the relative topology of Σ (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace), and P:A∩Σ→P(A∩Σ) is a C1 diffeomorphism with inverse Q∣P(A∩Σ). The map P is the local Poincaré return map associated with the crossing at t0. Here the portions of Σ in A and B have the embedded C1 section charts supplied below; no regularity of Σ away from these neighbourhoods is required.

  2. If, in addition, Φ(s,x0)∉Σ‾ U for every 0<s<t0, where the bar denotes closure in U (Interior, closure, boundary, exterior, derived set and isolated point in a topological space), then A,B can be chosen so that τ(x)>0 and Φ(s,x)∉Σ for x∈A∩Σ and 0<s<τ(x). In this case P is the local first-return map to Σ: τ(x) is its least positive hitting time. This explicit exclusion condition supplies persistence even when Σ is not closed in U.

Facts & Assumptions

Given: The open set U, the C1 field F, its local flow Φ, the reference data (t0,x0) with x1=Φ(t0,x0), and the transversal function h with the displayed properties.

[F1]

Ω is open in R×U and Φ:Ω→U is C1, with ∂tΦ(t,a)=F(Φ(t,a)) (The flow domain of a C¹ autonomous field is open and the flow is C¹ on it).

[F2]

Composition law and inverse time: Φ(0,a)=a; if (s,a)∈Ω and (t,Φ(s,a))∈Ω then (s+t,a)∈Ω and Φ(s+t,a)=Φ(t,Φ(s,a)); and (t,a)∈Ω implies (−t,Φ(t,a))∈Ω with Φ(−t,Φ(t,a))=a (The local flow is a partial one-parameter group: identity, composition and inverse-time laws).

[F3]

Implicit function theorem: if G is C1 on an open set, G(t0,x0)=0 and the partial derivative in the scalar variable at (t0,x0) is nonzero, then near (t0,x0) the zero set of G is the graph of a unique C1 function of the remaining variables, with the stated uniqueness for all points of a product neighbourhood (The Euclidean implicit function theorem with derivative formula).

[F4]

The chain rule gives ∂t(h(Φ(t,x)))=Dh(Φ(t,x))(∂tΦ(t,x))=Dh(Φ(t,x))F(Φ(t,x)); compositions of C1 maps are C1; differentiability conventions are those of total derivatives and Jacobians (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Ck Euclidean maps and diffeomorphisms).

Proof

technique · direct; apply the implicit function theorem to the scalar function $(t,x)\mapsto h(\Phi(t,x))$ at both crossings of the section
1.1givenF1F4algebra

By [F1] there are an open interval J0∋t0 and an open set A0⊆W with x0∈A0 with J0×A0⊆Ω and Φ(J0×A0)⊆W (shrink A0 if necessary, using that Φ(t0,x0)=x1∈W and continuity of Φ). Define G:J0×A0→R, G(t,x):=h(Φ(t,x)); it is C1 by [F1] and [F4], and G(t0,x0)=h(x1)=0,∂tG(t0,x0)=Dh(x1)F(x1)≠0.

2.1step 1.1F1F3

Apply [F3] to G at (t0,x0): there are open J1⊆J0 containing t0, open A1⊆A0 containing x0 and a unique C1 function τ:A1→J1 with τ(x0)=t0 such that for (t,x)∈J1×A1 h(Φ(t,x))=0⟺t=τ(x). In particular h(Φ(τ(x),x))=0 for x∈A1, which is the first part of clause 1.

2.2step 1.12.1F1F2F3

Reverse-time construction. The field −F is C1 on U, and Ψ(t,y):=Φ(−t,y) is its local flow on the reflected domain, because s↦Φ(−s,y) solves y′=−F(y) and every solution is a restriction of the corresponding maximal solution [F2]. Apply steps 1.1-2.1 to −F at the initial point x1 and time t0: the reversed reference solution satisfies Ψ(t0,x1)=Φ(−t0,x1)=x0 by [F2], and its crossing derivative is ∂t(h(Ψ(t,y)))∣(t0,x1)=Dh(x0)(−F(x0))≠0. Hence there are an open interval J2∋t0, an open set B0⊆W with x1∈B0 and a C1 function σ:B0→J2 with σ(x1)=t0 such that h(Φ(−t,y))=0, (t,y)∈J2×B0⟺t=σ(y). Define Q:B0→Σ, Q(y):=Φ(−σ(y),y); then Q is C1 (composition of the C1 map (t,y)↦Φ(t,y) with y↦(−σ(y),y), whose values lie in Ω because σ(y)∈J2) and h(Q(y))=0 for every y∈B0.

3.1step 2.1F1F4

Define P(x):=Φ(τ(x),x) for x∈A1. Then P is C1 as a composition of C1 maps, and P(x)∈Σ for every x∈A1 by step 2.1. Since P(x0)=x1, continuity of P gives an open set A2⊆A1 with x0∈A2 and P(A2)⊆W.

3.2step 2.13.12.2F1F2F4

Shrinking the two neighbourhoods. Choose an open set A⊆A2 with x0∈A, τ(A)⊆J2 and P(A)⊆B0; this is possible because τ(x0)=t0∈J2, P(x0)=x1∈B0 and τ,P are continuous. Define B:=B0∩σ−1(J1)∩Q−1(A). Then B is open (preimages of open sets under the continuous maps σ,Q) and contains x1: σ(x1)=t0∈J1 and Q(x1)=Φ(−t0,x1)=x0∈A by [F2]. By construction Q(B)⊆A and σ(B)⊆J1, so restricting τ to A and σ to B gives the C1 functions of clauses 1 and 2, with P:A→Σ and Q:B→Σ both C1 and mapping into Σ (steps 2.1 and 2.2).

3.3step 2.13.12.23.2F2F3

First inverse identity. Let x∈A∩Σ and put y:=P(x)∈B0 and s:=τ(x)∈J2. Since h(x)=0 and Φ(−s,y)=Φ(−τ(x),Φ(τ(x),x))=x by [F2], we have h(Φ(−s,y))=0; the equivalence of step 2.2 with the pair (s,y)∈J2×B0 therefore gives σ(y)=s=τ(x). Hence σ(y)=τ(x)∈J1, so y∈σ−1(J1), and Q(y)=Φ(−σ(y),y)=Φ(−τ(x),y)=x∈A, so y∈Q−1(A); therefore y∈B. Thus P(A∩Σ)⊆B, and Q(P(x))=Φ(−σ(y),y)=x for every x∈A∩Σ.

3.4step 2.12.23.2F2F3

Second inverse identity. Let y∈B∩Σ∩Q−1(A) and put x:=Q(y)∈A∩Σ (the value lies in Σ by step 2.2). By [F2], Φ(σ(y),x)=Φ(σ(y),Φ(−σ(y),y))=y, and h(y)=0 because y∈Σ; the equivalence of step 2.1 with the pair (σ(y),x)∈J1×A1 therefore gives σ(y)=τ(x). Hence P(Q(y))=Φ(τ(x),x)=Φ(σ(y),x)=y.

3.5givenF1F4F5step 2.1choose

Assume the additional exclusion in clause 4. Choose ε>0 with 3ε<t0 sufficiently small that the reference paths for 0≤s≤ε and t0−2ε≤s≤t0+2ε lie in W, and Dh(Φ(s,x0))F(Φ(s,x0)) has a fixed nonzero sign on each of these two intervals. Continuity and compactness give an open neighbourhood A3 of x0 such that all these paths for x∈A3 remain in W with the same respective signs. The compact middle path K={Φ(s,x0):ε≤s≤t0−ε} lies in the open set U∖Σ‾ U by the additional hypothesis. By openness of Ω, continuity of Φ and finite product-neighbourhood covers of the compact time intervals, further shrink A3 so that [0,t0+2ε]×A3⊆Ω and Φ([ε,t0−ε]×A3)⊆U∖Σ‾ U. Also shrink it so that ∣τ(x)−t0∣<ε.

4.1givenF3F4F5step 3.2

Since Dh(xi)F(xi)≠0, one has Dh(xi)≠0 at each xi (i=0,1). For n≥2, after permuting coordinates, [F3] makes Σ near xi the graph xn=fi(x1,…,xn−1) of a C1 function; its graph parametrization and coordinate projection are an embedded section chart. For n=1, continuity of h′ and h′(xi)≠0 give an interval on which h′ has a fixed nonzero sign; the mean value theorem [F5] makes h strictly monotone there, so Σ in that interval is the singleton {xi}, a zero-dimensional section chart. Shrink A into the chart near x0 and shrink B0 into the target chart near x1; by continuity of P shrink A further so P(A)⊆B0, then repeat the construction of B in step 3.2. In dimensions n≥2, the chart coordinates of P:A→Σ and Q:B→Σ are ambient coordinate projections composed with ambient C1 maps, so both are C1; for n=1 these maps are locally constant into the singleton charts. Their restrictions to the sections are therefore C1 in the same charts. The inverse identities of steps 3.3--3.4 remain valid after these neighbourhood restrictions.

5.1step 3.13.23.33.44.1F1F4

By steps 3.3 and 3.4, P(A∩Σ)=B∩Σ∩Q−1(A): if y=P(x) with x∈A∩Σ, then y∈B, y∈Σ and Q(y)=x∈A; conversely, if y∈B∩Σ∩Q−1(A), then x:=Q(y)∈A∩Σ and step 3.4 gives P(x)=y. Since B and Q−1(A) are open in Rn, the set B∩Σ∩Q−1(A) is open in the relative topology of Σ. On P(A∩Σ) the maps P and Q are inverse to each other by steps 3.3 and 3.4, and both are C1 in the charts of step 4.1, so P:A∩Σ→P(A∩Σ) is a C1 diffeomorphism with inverse Q∣P(A∩Σ). This proves clauses 2 and 3.

6.1step 3.53.23.33.45.1F4F5∎

Repeat step 3.2 with A⊆A3, retaining its inverse identities and charts. For x∈A∩Σ, the scalar function s↦h(Φ(s,x)) is strictly monotone on [0,ε] and vanishes at 0, hence has no zero for 0<s≤ε. The middle interval has no Σ-hits by step 3.5. On [t0−2ε,t0+2ε] the scalar function is strictly monotone and has its unique zero at τ(x); thus it has no zero on [t0−ε,τ(x)). These intervals cover (0,τ(x)), and τ(x)>t0−ε>0. This proves the first-return conclusion of clause 4, together with clauses 1-3 already proved.

Remarks

  • The two transversality hypotheses are exactly what the two applications of the implicit function theorem use: Dh(x1)F(x1)≠0 at the forward crossing and Dh(x0)F(x0)≠0 at the crossing of the reversed reference orbit. If only the forward crossing were transversal, the return time τ would still exist as a C1 function, but the construction of the inverse and hence of the local conjugacy of P with the reversed flow would not be available.

  • No periodicity of the reference orbit is assumed: x1 need not equal x0. When x0 is periodic of period t0 and the section is transversal at x0, the map P above is a local return map; it is a first-return map when the exclusion hypothesis of clause 4 holds, and every fixed point of P corresponds to a periodic orbit of the flow through the section in the usual way; that correspondence is not needed in this batch.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Finite-time tangent growth rates and Lyapunov exponents of a C¹ flow

Definition

Let n≥1, let U⊆Rn be open, let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms), and let Φ:Ω→U be the local flow of x′=F(x) (The local flow of an autonomous first-order system); recall that Ω is open and Φ is C1 on Ω (The flow domain of a C¹ autonomous field is open and the flow is C¹ on it).

Let x∈U and t>0 with (t,x)∈Ω, and let u∈Rn∖{0} be such that DxΦt(x)u≠0, where DxΦt(x) is the derivative of the map y↦Φ(t,y) at x (The local flow of an autonomous first-order system, Ck Euclidean maps and diffeomorphisms). The finite-time tangent growth rate of (x,u) over the time t is

r(t,x,u):=1tlog⁡ ⁣(∥DxΦt(x)u∥2∥u∥2)∈R,

the Euclidean norms being those of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and log⁡ the natural logarithm (The natural logarithm as the inverse of the exponential function). The expression is a real number because ∥u∥2>0 and ∥DxΦt(x)u∥2>0.

For the infinite-time notion require the forward lifetime Ix={t:(t,x)∈Ω} to be unbounded above. Since Ix is an interval containing 0, this means that (t,x)∈Ω for every t≥0. Under this additional condition, if the limit

λ(x,u):=lim⁡t→∞(t,x)∈Ωr(t,x,u)

exists in R, it is called the Lyapunov exponent of (x,u). If the forward lifetime is bounded above or the limit does not exist, no Lyapunov exponent is assigned; in particular no value +∞ or −∞ is named by this definition.

Remarks

  • The derivative DxΦt(x) is invertible whenever it is defined: on the open set Ω, the maps Φt and Φ−t are inverse to each other by The local flow is a partial one-parameter group: identity, composition and inverse-time laws, and the chain rule applied to Φ−t∘Φt=id gives DΦ−t(Φt(x))∘DxΦt(x)=id. Hence the admissibility condition DxΦt(x)u≠0 holds automatically for u≠0 at every point where DxΦt(x) is defined; it is recorded so that the definition does not depend on the invertibility statement.

  • The rate is homogeneous in the direction: r(t,x,cu)=r(t,x,u) for every real c≠0, since both norms scale by ∣c∣. Thus opposite directions have the same rate, and the quantity may be negative, zero or positive, and may depend on both x and the direction u.

  • For a linear field F(x)=Ax the flow is Φ(t,x)=etAx wherever it is defined, so DxΦt(x)=etA is independent of x and the finite-time rate reduces to t−1log⁡(∥etAu∥2/∥u∥2). Whether the limit exists is not claimed by this definition; it is a property of A and u.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets

Definition

Let

X:={0,1}Z={ s  :  s is a function Z→{0,1} }

be the set of bi-infinite binary sequences, with the function-set convention of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}; for s∈X write sk:=s(k) for the value at the integer k. Define

d(s,t):=∑k=0∞2−k ∣sk−tk∣  +  ∑k=1∞2−k ∣s−k−t−k∣(s,t∈X).

Both series converge by comparison with the geometric series ∑k≥02−k=2 (Series, partial sums, convergence and the sum, divergence, and the tail series, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Integer powers am, Absolute value in an ordered field), since ∣sj−tj∣∈{0,1} for every j∈Z; hence d(s,t) is a well-defined real number. That d is a metric on X is proved in the companion lemma The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact ↗ and is not part of this definition.

The (bilateral) shift is the map

σ:X⟶X,σ(s)k:=sk+1(k∈Z, s∈X).

For n≥1 the n-fold iterate is written σn, defined by σ1:=σ and σn+1:=σ∘σn; a point s∈X is periodic when σn(s)=s for some n≥1.

A cylinder is a set of the form

[w]p,q:={ s∈X  :  sk=wk for p≤k≤q },

where p≤q are integers and w=(wp,…,wq)∈{0,1}{p,…,q} is a finite binary word; the integers p,q and the word w are part of the data. When p=q this is the set of sequences with prescribed value at the single coordinate p.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact

Statement

Let X={0,1}Z, let d and σ be the metric expression and the shift map of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets, and for m≥0 let Fm:={−m,…,m} and [s]Fm:={t∈X:tk=sk for k∈Fm} be the cylinder determined by s on Fm. Then:

  1. d is a metric on X (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric);
  2. for every s∈X and every m≥0,

B(s,2−m)⊆[s]Fm⊆B‾(s,21−m);

consequently every cylinder is open in the metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and every nonempty open subset of X contains a cylinder; 3. X is sequentially compact (Countably compact, sequentially compact and limit point compact metric spaces): every sequence in X has a subsequence converging in d (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R), and the construction of that subsequence uses no choice principle; 4. granting the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), (X,d) is compact (Open cover, subcover, compact metric space, and compact subset of a metric space).

Facts & Assumptions

Given: The set X of bi-infinite binary sequences, the expression d(s,t)=∑k≥02−k∣sk−tk∣+∑k≥12−k∣s−k−t−k∣, and the cylinders [s]Fm.

[F1]

The real absolute value satisfies ∣a+b∣≤∣a∣+∣b∣ (The triangle inequality). The geometric series satisfies ∑k≥02−k=2 and ∑k=m+1∞2−k=2−m for m≥0; a series of nonnegative reals converges if and only if its partial sums are bounded, and convergent series may be added termwise and compared termwise (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Convergent series add and scale termwise, Series, partial sums, convergence and the sum, divergence, and the tail series, Lower bound, bounded below, bounded set).

[F2]

Balls and topology: B(s,ε)={t:d(s,t)<ε} and B‾(s,ε)={t:d(s,t)≤ε} for the metric d; a set is open when every point of it has a ball contained in it; a metric space carries the topology induced by its balls (Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F3]

A subset D⊆X is dense when every nonempty open subset meets D (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Proof

technique · direct; verify the metric axioms, identify cylinders with balls up to a factor two, and diagonalise a sequence of binary sequences
1.1givenF1F2algebra

The expression d(s,t) is a sum of two convergent series of nonnegative terms by [F1], since ∣sj−tj∣≤1; hence it is a nonnegative real and d(s,t)=d(t,s) because ∣sj−tj∣=∣tj−sj∣. If s≠t there is j∈Z with sj≠tj; the corresponding term of d(s,t) is positive and all terms are nonnegative, so d(s,t)>0. Finally, for s,t,u∈X the termwise inequality ∣sj−tj∣≤∣sj−uj∣+∣uj−tj∣ and [F1] give d(s,t)≤d(s,u)+d(u,t) after multiplying by 2−∣j∣ and adding the two one-sided series. Hence d is a metric, which is clause 1.

1.2givenF1F2algebra

Fix s∈X and m≥0. If t∈B(s,2−m) then 2−∣j∣≤d(s,t)<2−m for every j with ∣j∣≤m and tj≠sj; since 2−∣j∣≥2−m there, no such j exists, so t∈[s]Fm. Conversely, if t∈[s]Fm then all terms with ∣j∣≤m vanish and the remaining terms are at most 2−∣j∣; hence d(s,t)≤∑∣j∣>m2−∣j∣=2⋅2−m=21−m, that is t∈B‾(s,21−m). This proves the two inclusions of clause 2.

1.3givenF1F2

Let (xn)n≥0 be a sequence in X. Define Fm={−m,…,m} and construct subsequences (xn(m))n≥0 recursively: xn(0):=xn, and given (xn(m−1)), the map n↦xn(m−1)∣Fm takes values in the finite set {0,1}Fm, so some value rm occurs for infinitely many n (Sequences of reals: bounded, eventually, frequently, tails, subsequences); let rm be the lexicographically least such value (with respect to a fixed enumeration of Fm), and let i0(m)<i1(m)<⋯ enumerate the infinite set {n:xn(m−1)∣Fm=rm}; define xj(m):=xij(m)(m−1). This is a simultaneous recursive construction with no choice: each rm is selected by a least-element rule, and each increasing enumeration is defined by least-element recursion on an infinite subset of N. For m≥1 every term of (xn(m)) has restriction rm to Fm, and each (xn(j)) with j≥m is a termwise subsequence of (xn(m)).

2.1step 1.2F2F3algebra

Every cylinder [w]p,q is open: if t∈[w]p,q and M:=max⁡{∣p∣,∣q∣}, then any u with d(t,u)<2−M satisfies uj=tj for every ∣j∣≤M by the argument of step 1.2, hence u∈[w]p,q; thus B(t,2−M)⊆[w]p,q. Conversely, if V⊆X is nonempty and open and s∈V, choose ε>0 with B(s,ε)⊆V and m with 21−m<ε; then step 1.2 gives [s]Fm⊆B‾(s,21−m)⊆B(s,ε)⊆V. Hence cylinders are open and form a basis for the topology, as claimed in clause 2.

2.2step 1.21.3F1F2algebra

Put yj:=xj(j); the indices of the original sequence at which yj sits are strictly increasing in j, so (yj) is a subsequence. For m≥1, if j,j′≥m, then yj and yj′ both have restriction rm to Fm by step 1.3, so d(yj,yj′)≤∑∣k∣>m2−∣k∣=21−m; hence (yj) is a Cauchy sequence in (X,d). Define s∈X by sk:=rm(k) for every m≥max⁡{1,∣k∣}; this is well defined because rm+1∣Fm=rm for m≥1 (every term of (xn(m+1)) is a term of (xn(m)), so the restriction of rm+1 to Fm stabilises the same value). Then d(yj,s)≤21−m for every j≥m≥1, so yj→s by [F2]. This proves clause 3.

3.1step 2.2F4∎

Clause 4 follows from clause 3 and [F4], which turns sequential compactness into compactness under the two stated choice axioms.

Remarks

  • The metric can be written with the symmetric weight 2−∣k∣: for s,t∈X, splitting the sum at k=0 shows d(s,t)=∑k∈Z2−∣k∣∣sk−tk∣ in the sense that the two defining one-sided series are exactly the positive- and negative-index parts. The one-sided form is used here because it avoids a two-sided summation convention.

  • The diagonal construction of step 1.3 is canonical: the value rm is the least stabilised restriction, and the increasing enumeration of an infinite subset of N is produced by least-element recursion. Countable choice is used only when compactness is read off from sequential compactness in clause 4, which is why that clause is stated as a separate hypothesis.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list

Definition

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) with its metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and let f:X→X be a map. For n≥1 write fn for the n-fold iterate, f1:=f and fn+1:=f∘fn.

  1. f is topologically mixing when for all nonempty open sets U,V⊆X there is an integer N such that

fn(U)∩V≠∅for every n≥N.

  1. A point x∈X is a periodic point of f when fn(x)=x for some n≥1. The set of periodic points of f is written Per⁡(f). The periodic points are dense in X when Per⁡(f) is dense in X, that is (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) when every nonempty open subset of X meets Per⁡(f).

  2. f has sensitive dependence on initial conditions when there is a real number δ>0 such that for every x∈X and every ε>0 there are y∈X and n≥1 with

d(x,y)<εandd(fn(x),fn(y))≥δ.

Such a number δ is called a sensitivity constant for f.

Finally, say that f is chaotic in the stated sense when f is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form), topologically mixing, has dense periodic points, and has sensitive dependence on initial conditions.

Remarks

  • The list is a definition of a chosen package of properties, not a definition of the word "chaos" in all of its uses. Devaney's closely related list replaces topological mixing by topological transitivity; mixing implies transitivity, while this definition makes no converse claim. Positive topological entropy, Li-Yorke chaos, and measure-theoretic mixing are further distinct properties that this definition neither implies nor assumes.

  • Topological mixing immediately implies the open-set form of topological transitivity: for nonempty open U,V the definition supplies N with fN(U)∩V≠∅. Sensitivity is required with one constant δ uniform over all points and all radii ε; it is a statement about the family of iterates, not about a single pair of orbits.

  • The definition applies to non-invertible maps; only forward iterates are used. When f is a bijection, applying the same definitions to f−1 gives a separate statement, and nothing here asserts two-sided mixing.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The bilateral two-symbol shift is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense

Statement

Let X={0,1}Z, let d be the metric of The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact and let σ:X→X, σ(s)k=sk+1, be the bilateral shift of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets. Then:

  1. σ is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form);
  2. σ is topologically mixing;
  3. the periodic points of σ are dense in X;
  4. σ has sensitive dependence on initial conditions with sensitivity constant δ=1;

consequently σ is chaotic in the stated sense (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list).

Facts & Assumptions

Given: The shift space (X,d), the shift map σ and the cylinders [w]p,q={s:sk=wk for p≤k≤q}.

[F2]

σ is a bijection with σ(s)k=sk+1 and inverse σ−1(s)k=sk−1; for m≥1, σm(s)k=sk+m (The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets).

[F4]

A map g:X→X is continuous at s when for every ε>0 there is δ>0 with g(B(s,δ))⊆B(g(s),ε) (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Open ball, closed ball and sphere in a metric space).

[F5]

A subset D⊆X is dense when every nonempty open subset meets D (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

[F6]

The list of properties defining "chaotic in the stated sense" is in Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list: continuity, topological mixing, dense periodic points and sensitive dependence.

Proof

technique · direct; use cylinders as a basis and prescribe finitely many coordinates
1.1givenF1F2F3F4algebra

For s,t∈X and any m≥0, if sj=tj for ∣j∣≤m+1, then σ(s)j=σ(t)j for ∣j∣≤m; hence σ([s]Fm+1)⊆[σ(s)]Fm. By clause 2 of [F1], B(s,2−(m+1))⊆[s]Fm+1 and [σ(s)]Fm⊆B‾(σ(s),21−m), so d(s,t)<2−(m+1) implies d(σs,σt)≤21−m; given ε>0 choose m with 21−m<ε and δ=2−(m+1). This proves continuity at every s, which is clause 1.

1.2givenF1F2algebra

Let U,V⊆X be nonempty and open. By [F1] there are cylinders [w]p,q⊆U and [w′]p′,q′⊆V. Let n be an integer with (p,…,q)∩(p′+n,…,q′+n)=∅; this holds for every n>q−p′. Define s∈X by sk:=wk for p≤k≤q, sk:=wk−n′ for p′+n≤k≤q′+n, and sk:=0 for all remaining k; the two prescriptions are compatible because their index sets are disjoint. Then s∈[w]p,q, and for j∈[p′,q′] one has σn(s)j=sj+n=wj′, so σn(s)∈[w′]p′,q′. Hence σn(U)∩V≠∅ for every n>q−p′, which exhibits the integer N required by topological mixing.

1.3givenF1F2algebra

Let U⊆X be nonempty and open and choose a cylinder [w]p,q⊆U by [F1]; put L:=q−p+1≥1 and define s∈X by sk:=wp+((k−p) mod L), the L-periodic extension of the word w. Then sk=wk for p≤k≤q, so s∈[w]p,q⊆U, and sk+L=sk for every k; by [F2], σL(s)k=sk+L=sk for all k, so s is a periodic point of σ. Thus every nonempty open set meets Per⁡(σ), and [F5] gives clause 3.

1.4givenF2F3algebra

Let x∈X and ε>0; choose an integer k≥1 with 2−k<ε and define y∈X by yj:=xj for j≠k and yk:=1−xk. Then d(x,y)=2−k<ε because exactly one term of the defining sum is nonzero and equal to 2−k. Moreover σk(x)0=xk≠yk=σk(y)0, so in the defining sum for d(σkx,σky) the term with index 0 equals 20⋅1=1 and all terms are nonnegative; hence d(σkx,σky)≥1. Therefore δ=1 is a sensitivity constant, which is clause 4.

2.1step 1.11.21.31.4F6∎

Clauses 1-4 and [F6] give that σ is continuous, topologically mixing, has dense periodic points and is sensitive; by definition, σ is chaotic in the stated sense.

Remarks

  • Compactness of (X,d) is not used in the proof: mixing, density of periodic points and sensitivity are checked directly from cylinders. The companion lemma The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact proves that X is sequentially compact, and compact under the Axioms of Countable and Dependent Choice, so the example also matches the usual convention in which a chaotic system is a continuous self-map of a compact metric space.

  • The integer k in step 1.4 is positive, so the witness sequence y is obtained by flipping a coordinate in the future tail; flipping a coordinate at index k≤0 would instead give d(x,y)=2−∣k∣ but the displayed iterate argument uses σk with k≥1. The sensitivity constant 1 is not claimed to be optimal: any 0<δ≤1 is also a sensitivity constant, and no statement is made about the largest such constant.

RemarkRemark: AI-adaptedProof: Not applicableprecheck passOpen item page →

Scope of Poincaré recurrence for mechanical systems: finite invariant volume and complete return maps

Statement

The recurrence content attached to this page is supplied by published items and is subject to their stated hypotheses.

  1. In a measure-preserving system (X,A,μ,T) with μ(X)<∞, for every E∈A almost every point of E returns to E under Tn for infinitely many positive integers n (Poincare recurrence for finite measure-preserving systems, Measure-preserving transformations and systems). If X is second countable with a countable basis in A, then outside one null set every neighbourhood of every point is revisited infinitely often, and in the metrizable case there is a strictly increasing sequence nj with Tnjx→x (Topological recurrence on second-countable spaces). For a Hamiltonian flow, a measurable invariant region of finite symplectic volume on which a nonzero time map and all of its iterates are defined satisfies the same recurrence conclusion for that time map (Poincaré recurrence for finite-volume Hamiltonian invariant regions).

  2. The following qualifications are part of the statement and are not removable.

  • Finiteness of measure is a hypothesis. The conclusion fails in general for infinite measure: for T(x)=x+1 on R with Lebesgue measure, the set E=(0,1/2) has positive measure and no point of E returns to E at any positive integer time, so the analogue of clause 1 is false without μ(X)<∞. For a concrete mechanical contrast take the free-particle Hamiltonian H(q,p)=p2/(2m) on X=Rq×Rp with m>0, phase volume dq dp, and complete flow ϕt(q,p)=(q+tp/m,p). Its time-one map preserves this infinite volume (each fixed-p slice is a translation in q). In Efree=(0,1/2)×(m,2m) every positive integer iterate has qn=q+np/m>1, so no point returns to this positive-volume set. Thus complete, volume-preserving mechanical motion on the full unconfined phase space need not be recurrent; the finite-invariant-volume hypothesis is essential.
  • The return map must be defined for all iterates. The time-τ map of a Hamiltonian flow is a measure-preserving map only where it is defined: the invariant region must be contained in the domain of ϕτ and of every iterate ϕnτ. For a local flow in the sense of The local flow of an autonomous first-order system this is an additional hypothesis on the region, not a consequence of the flow being locally defined; on a compact energy level of a complete bounded system it must be verified from the model.
  • Recurrence is an almost-everywhere statement about a measure, not about every trajectory. The null exceptional set depends on the measurable set being revisited; a specified trajectory, or a finite-time observation, is not claimed to return. The topological corollary supplies a single null set only after a countable basis is fixed and one grants its countable-choice hypotheses.
  • No identification with the shift example. The bilateral shift of The bilateral two-symbol shift is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense is a topological example on the symbol space; no claim is made here that it arises as the return map of a smooth mechanical system, and no claim about any physical system is made by this remark.
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Exponential dichotomy for a hyperbolic endomorphism: invariant stable and unstable subspaces with exponential estimates

Statement

Let V be a real vector space of finite dimension n≥1, equipped with a symmetric positive-definite bilinear form ⟨⋅,⋅⟩:V×V→R, and set ∥v∥2:=⟨v,v⟩. Let T:V→V be linear, let VC:=C⊗RV with canonical embedding ιv:=1⊗v and complex-linear extension TC:=id⁡C⊗T (Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map), and use the exponential series etT and etTC of these bounded operators (The exponential series of a bounded operator; boundedness is justified in [F1]). Suppose that no eigenvalue of TC in the sense of Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism has real part 0.

Then there exist T-invariant linear subspaces Es,Eu⊆V and real constants C≥1, c>0 such that V=Es⊕Eu and, for every t∈R:

  1. ∥etTv∥2≤Ce−ct∥v∥2 for v∈Es and t≥0;
  2. ∥etTv∥2≤Cect∥v∥2 for v∈Eu and t≤0;
  3. ∥etTv∥2≥C−1ect∥v∥2 for v∈Eu and t≥0;
  4. Es={v∈V:etTv→0 (t→+∞)} and Eu={v∈V:etTv→0 (t→−∞)}.

Facts & Assumptions

Given: The finite-dimensional real vector space V with its symmetric positive-definite bilinear form, the linear map T, its complexification TC, and the assumption that no complex eigenvalue of TC is purely imaginary.

[F1]

The real spectral theorem applied to id⁡V supplies a real orthonormal basis of V (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis). In that basis every element of VC has a unique form x+iy:=ιx+iιy, with x,y∈V. Define ⟨x+iy,x′+iy′⟩C:=⟨x,x′⟩+⟨y,y′⟩+i(⟨y,x′⟩−⟨x,y′⟩) and ∥x+iy∥2,C:=(∥x∥22+∥y∥22)1/2; this is the induced Hermitian inner product and norm, and ι is isometric. These coordinates identify V with Rn and VC with R2n, so both spaces are complete (R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R, C is the real coordinate plane, with coordinate arithmetic). If a linear map has coordinate matrix L=(Lij), Cauchy--Schwarz row by row gives ∥Lz∥22≤(∑i,j∣Lij∣2)∥z∥22 in the corresponding real coordinates (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation); hence T and TC are bounded. Thus the exponential-series lemma applies to both; it gives absolute operator-norm convergence, E(0)=id⁡, E(s+t)=E(s)E(t), E(t)−1=E(−t) and E′(t)=TCE(t)=E(t)TC. Termwise application of TCmι=ιTm gives E(t)ι=ιetT (The exponential series of a bounded operator, Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map).

[F2]

The minimal polynomial μT∈R[x] annihilates T, the characteristic polynomial satisfies χTC=χT, and μT and χT have the same irreducible factors over C; every nonconstant complex polynomial splits into linear factors, so the eigenvalues of TC are exactly the complex roots of μT, each with a positive multiplicity eλ equal to its multiplicity as a root of μT (The annihilator set Ann⁡(T)={p∈F[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial, Complexification preserves the characteristic and minimal polynomials of a finite-dimensional real operator, The minimal and characteristic polynomials have exactly the same monic irreducible factors, Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

[F3]

Since μTC=μT splits over C, the generalised eigenspaces Gλ=ker⁡(TC−λ) eλ over the distinct eigenvalues λ of TC form a direct sum decomposition VC=⨁λGλ, each Gλ being TC-invariant (If the minimal polynomial splits, V is the direct sum of the stabilised generalised eigenspaces). On each Gλ the operator admits a Jordan basis, so TC∣Gλ=λI+Nλ with Nλ nilpotent of index at most eλ (Jordan canonical form from the elementary divisors of VT).

[F4]

Coprime polynomials satisfy a Bézout identity: if p,q∈F[x] have no common root, there are a,b∈F[x] with ap+bq=1 (Bézout identity and the Euclidean algorithm for polynomials over a field).

[F5]

The Hermitian norm ∥⋅∥2,C is the norm defined in [F1]. Any two norms on the finite-dimensional complex vector space VC are equivalent (All norms on a finite-dimensional complex normed space are equivalent, Equivalent norms, and the dictionary with equivalent metrics): there is K≥1 such that K−1∥z∥∞≤∥z∥2,C≤K∥z∥∞ for every z∈VC, where ∥⋅∥∞ is the maximum norm of the basis fixed in step 2.3. In particular, ∥ιv∥2,C=∥v∥2.

Proof

technique · direct; split the spectrum into left and right half-planes, build the corresponding real invariant subspaces from coprime factors of the minimal polynomial, and estimate each Jordan block by its exponential series
1.1givenF2F4

Let Λ be the set of eigenvalues of TC and, for λ∈Λ, let eλ≥1 be its multiplicity as a root of the real polynomial μT; by [F2] all elements of Λ have nonzero real part, and Λ is stable under conjugation with eλˉ=eλ: conjugating μT=(x−λ)eλq with q(λ)≠0 gives μT=(x−λˉ)eλqˉ with qˉ(λˉ)≠0. Define ps:=∏Re⁡λ<0(x−λ)eλ,pu:=∏Re⁡λ>0(x−λ)eλ. Conjugation invariance of Λ with equal multiplicities shows ps,pu∈R[x]; by construction μT=pspu, and ps,pu have no common complex root, hence are coprime with a Bézout identity aps+bpu=1 over R[x] [F4].

1.2F1F3algebra

Exponential on a generalised eigenspace: fix λ∈Λ and put Aλ:=λI+Nλ on Gλ with Nλ eλ=0 as in [F3]. For the partial sum through m=M, the binomial expansion and nilpotence of Nλ give the finite rearrangement ∑m=0Mtmm!Aλm=∑k=0eλ−1tkk!Nλ k∑j=0M−k(tλ)jj!, with an empty inner sum when M<k. As M→∞, the left side converges to etAλ by [F1], and each of the finitely many inner sums converges to etλ by exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0. Thus etAλ=∑k=0eλ−1tkk!Nλ k etλ.

2.1step 1.1F2F4algebra

Define Es:=ker⁡ps(T) and Eu:=ker⁡pu(T). Both are T-invariant because T commutes with ps(T) and pu(T). Every v∈V satisfies v=(aps+bpu)(T)v=a(T)ps(T)v+b(T)pu(T)v∈Eu+Es, the membership following from pu(T)a(T)ps(T)=a(T)μT(T)=0 on the first summand and ps(T)b(T)pu(T)=b(T)μT(T)=0 on the second, where μT(T)=0 (The annihilator set Ann⁡(T)={p∈F[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial). If v∈Es∩Eu, the same identity gives v=a(T)ps(T)v+b(T)pu(T)v=0. Hence V=Es⊕Eu.

2.2step 1.1F3F4algebra

Complexified description: (Es)C=ker⁡ps(TC)=⨁Re⁡λ<0Gλ and (Eu)C=ker⁡pu(TC)=⨁Re⁡λ>0Gλ. Writing z=ιx+iιy with x,y∈V, one has ps(TC)z=ι(ps(T)x)+iι(ps(T)y), so ker⁡ps(TC)=(ker⁡ps(T))C; the same holds for pu. Indeed, on a summand Gλ with Re⁡λ<0, the factor (x−λ)eλ divides ps, so ps(TC) vanishes on Gλ; on a summand with Re⁡λ>0, ps and (x−λ)eλ are coprime, and evaluating a Bézout identity on Gλ (where (TC−λ)eλ=0) shows ps(TC) is invertible there, so its kernel meets Gλ trivially. Summing over [F3] gives the claim; the same argument with pu gives the second identity.

2.3step 1.2F1algebra

Estimates on one generalised eigenspace: fix a basis of VC adapted to the decomposition VC=⨁λGλ (for instance the union of Jordan bases of the summands, whose existence is [F3]), and let ∥⋅∥∞ be the corresponding maximum norm; then every z=∑λzλ has its coordinate block in Gλ equal to the coordinate block of zλ, so ∥zλ∥∞≤∥z∥∞ for every λ. On each block use the induced operator norm ∥Nλ∥∞:=sup⁡{∥Nλz∥∞:z∈Gλ, ∥z∥∞≤1}; this is finite for a finite matrix. Put Pλ(t):=∑k=0eλ−1∣t∣kk!∥Nλ∥∞ k, so that ∥etAλz∥∞≤e(Re⁡λ)tPλ(t)∥z∥∞ for z∈Gλ and all real t by step 1.2. Choose c:=12min⁡λ∈Λ∣Re⁡λ∣>0. For u≥0 and a>0, the nonnegative exponential series gives eau≥(au)k/k!, hence uke−au≤k!a−k for every integer k≥0. Applying this to each term of Pλ(±u), with a=−Re⁡λ−c>0 on stable blocks and a=Re⁡λ−c>0 on unstable blocks, proves that the following suprema are finite: for Re⁡λ<0, Cλs:=sup⁡t≥0Pλ(t)e(Re⁡λ+c)t<+∞, and for Re⁡λ>0, Cλu:=sup⁡t≤0Pλ(t)e(Re⁡λ−c)t<+∞.

3.1step 2.22.3F1F5algebra

Constants for the two invariant subspaces. By steps 2.2 and 2.3, for z∈(Es)C and t≥0 the decomposition z=∑Re⁡λ<0zλ yields ∥etTCz∥∞≤∑Re⁡λ<0e(Re⁡λ)tPλ(t)∥zλ∥∞≤e−ct(∑Re⁡λ<0Cλs)∥z∥∞, since, in the adapted basis of step 2.3, ∥zλ∥∞≤∥z∥∞, and Re⁡λ+c≤−c for every Re⁡λ<0 (as c=12min⁡∣Re⁡λ∣). Similarly, for z∈(Eu)C and t≤0, ∥etTCz∥∞≤ect(∑Re⁡λ>0Cλu)∥z∥∞. Set C:=max⁡(1, K2∑Re⁡λ<0Cλs, K2∑Re⁡λ>0Cλu) with K as in [F5]. For v∈Es and t≥0, applying the first estimate to z=ιv and using [F5] in both directions, ∥etTv∥2=∥etTCιv∥2,C≤K∥etTCιv∥∞≤Ke−ct(∑Re⁡λ<0Cλs)∥ιv∥∞≤K2(∑Re⁡λ<0Cλs)e−ct∥v∥2≤Ce−ct∥v∥2, which is clause 1; the same computation with the second estimate gives clause 2 for v∈Eu, t≤0.

4.1step 3.1F1algebra

Clause 3: let u∈Eu and t≥0. By [F1] etT is invertible with inverse e−tT, and e−tTu∈Eu because Eu is T-invariant. Applying clause 2 with the time −t≤0 to the vector etTu gives ∥u∥2=∥e−tTetTu∥2≤Ce−ct∥etTu∥2, hence ∥etTu∥2≥C−1ect∥u∥2.

5.1step 3.14.1F1algebra∎

Clause 4: by clauses 1 and 3, every v∈Es satisfies etTv→0 as t→+∞, and by clause 2 every v∈Eu satisfies etTv→0 as t→−∞. Conversely, let v∈V satisfy etTv→0 as t→+∞ and write v=u+s with u∈Eu, s∈Es; by clauses 3 and 1, ∥etTv∥2≥∥etTu∥2−∥etTs∥2≥C−1ect∥u∥2−Ce−ct∥s∥2→+∞ unless u=0. So convergence to 0 forces u=0, that is v∈Es. The characterisation of Eu follows by the same argument with t→−∞: clause 2 gives ∥etTu∥2≤Cect∥u∥2→0 for u∈Eu, while for s≠0 the growth estimate ∥etTs∥2≥C−1e−ct∥s∥2 for t≤0, obtained from clause 1 at time −t≥0 and invertibility of etT, forces divergence.

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

An equilibrium whose linearisation has all eigenvalues in the open left half-plane is locally exponentially stable

Statement

Let n≥1, let U⊆Rn be open with 0∈U, and let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms) with F(0)=0. Put A:=DF(0) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case) and suppose that every complex eigenvalue of A (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism) has negative real part.

Then 0 is a locally exponentially stable equilibrium of z′=F(z) (Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system): there are real numbers δ>0, β≥1 and γ>0 such that every maximal solution z of z′=F(z) with ∥z(0)∥2<δ is defined for all t≥0 and satisfies

∥z(t)∥2≤βe−γt∥z(0)∥2(t≥0).

In particular 0 is Lyapunov stable and asymptotically stable in the sense of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system.

Facts & Assumptions

Given: The open set U with 0∈U, the C1 field F with F(0)=0, and the matrix A=DF(0) all of whose eigenvalues have negative real part.

[F1]

The exponential series defines the differentiable family t↦etA with ddtetA=AetA=etAA and e0=In, and exponential dichotomy gives, since no eigenvalue of A has real part 0 and all eigenvalues have negative real part, constants C≥1, c>0 with ∥etAv∥2≤Ce−ct∥v∥2 for all v∈Rn and t≥0, with no unstable part. To justify this last deduction explicitly, use the complexified subspaces constructed in the cited dichotomy proof, steps 1.1 and 2.1-2.2: (Eu)C is the direct sum of the generalised eigenspaces with Re⁡λ>0. Under the present hypothesis this is the empty direct sum {0} (equivalently the polynomial pu is 1, so Eu=ker⁡I={0}). Hence Es=Rn, and clause 1 of the dichotomy gives the stated estimate on every real vector (The exponential series of a bounded operator, Exponential dichotomy for a hyperbolic endomorphism: invariant stable and unstable subspaces with exponential estimates).

[F2]

Differentiability at 0: for every η>0 there is ρ>0 such that ∥F(z)−Az∥2≤η∥z∥2 whenever ∥z∥2<ρ (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[F3]

Improper integrals: For a>0, direct integration using The exponential function is smooth and (exp⁡)′=exp⁡ gives ∫0Te−atdt=(1−e−aT)/a→1/a by The exponential tends to +∞ at +∞ and to 0 at −∞. if a continuous f:[0,∞)→R satisfies ∣f(t)∣≤Me−λt for constants M,λ>0, then ∫0∞f(t) dt converges absolutely and lim⁡T→∞∫0Tf(t) dt=∫0∞f(t) dt (Improper integrals over unbounded intervals, Comparison tests for improper integrals); the fundamental theorem applies on compact intervals (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)).

[F4]

Compact continuation: an autonomous solution that is trapped in a compact subset of its open state domain near a finite endpoint extends past that endpoint (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it); F is locally Lipschitz because it is C1.

[F5]

The Euclidean norm is induced by ⟨⋅,⋅⟩2 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn) and satisfies Cauchy--Schwarz (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation). For a matrix Q, use the induced operator norm ∥Q∥2:=sup⁡{∥Qz∥2:∥z∥2≤1}. By the real spectral theorem, a symmetric positive definite matrix Q has an orthonormal eigenbasis with positive eigenvalues; writing λmin⁡(Q) and λmax⁡(Q) for their minimum and maximum gives λmin⁡(Q)∥z∥22≤zTQz≤λmax⁡(Q)∥z∥22 and ∥Q∥2=λmax⁡(Q) (diagonalize in that basis and use the Euclidean norm) (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis). Balls are as in Open ball, closed ball and sphere in a metric space, and the chain rule computes the derivative of a quadratic form along a curve (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · direct; build the quadratic Lyapunov function from the exponential dichotomy and compare its decay with the norm
1.1F1F3F5algebra

Define the symmetric matrix Q entrywise by Qij:=∫0∞(etATetA)ijdt. Each integrand is continuous and, for standard basis vectors ei,ej, equals ⟨etAei,etAej⟩2; Cauchy--Schwarz and [F1], [F5] bound its absolute value by C2e−2ct. Hence every entry integral converges absolutely by [F3]. The resulting matrix is symmetric because etATetA is symmetric for every t.

2.1step 1.1F1F3F5algebra

The matrix Q is positive definite and satisfies the Lyapunov equation ATQ+QA=−In. Positivity: for z≠0, zTQz=∫0∞∥etAz∥22 dt, the integrand is continuous, nonnegative, and strictly positive on a neighbourhood of t=0, so the integral is >0; for z=0 it is 0. Lyapunov equation: put QT:=∫0TetATetAdt. By [F3] and linearity of the integral on compact intervals, ATQT+QTA=∫0Tddt(etATetA)dt=eTATeTA−In, by the product rule and ddtetA=AetA=etAA from [F1]. Letting T→∞, the left side tends to ATQ+QA by [F3]. Each entry of eTATeTA equals ⟨eTAei,eTAej⟩2 for standard basis vectors ei,ej, so [F1], [F5] bound it in absolute value by C2e−2cT→0. Hence ATQ+QA=−In.

3.1step 2.1F2F5F6algebra

Fix η>0 with 2∥Q∥2η≤12 and let ρ>0 be a radius as in [F2] for this η; since U is open and 0∈U, shrink ρ if necessary so that B‾(0,ρ)⊆U (the implication of [F2] persists under shrinking ρ; balls as in Open ball, closed ball and sphere in a metric space). Define V(z):=zTQz; since Q is positive definite with smallest eigenvalue λmin⁡(Q)>0, choose 0<α<λmin⁡(Q)ρ2. Then S:={z∈U:V(z)≤α} satisfies S⊆B(0,ρ)⊆B‾(0,ρ)⊆U, so S={z∈B‾(0,ρ):V(z)≤α} is closed and bounded, hence compact by [F6].

4.1step 3.1F2F5algebra

Let z be a solution of z′=F(z). On the interval where ∥z(t)∥2<ρ, ddtV(z(t))=2z(t)TQz′(t)=zT(ATQ+QA)z+2zTQ(F(z)−Az)≤−∥z∥22+2η∥Q∥2∥z∥22≤−12∥z∥22, by step 2.1, [F2] and the choice of η; the derivative exists by the chain rule (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), [F5]). Since V(z)≤λmax⁡(Q)∥z∥22, this gives ddtV(z(t))≤−12λmax⁡(Q)V(z(t)) while the solution stays in B(0,ρ).

5.1step 3.14.1F4

A maximal solution with z(0)∈S stays in S and is defined for all t≥0. Indeed, while it stays in S⊆B(0,ρ), step 4.1 shows that t↦V(z(t)) is nonincreasing, so it cannot leave S through the level V=α; it cannot leave S through ∂U either, because S is compact in U. If its maximal forward interval were [0,b) with b<∞, the solution would be trapped in the compact set S⊆U near b, so [F4] would extend it, a contradiction. Hence it is defined for all t≥0 and stays in S; this positive invariance of S is the property used to verify the stability definition of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system.

6.1step 4.15.1algebra∎

Exponential decay: by step 4.1, ddtV(z(t))≤−γVV(z(t)) for all t≥0 whenever the solution stays in S⊆B(0,ρ), with γV:=12λmax⁡(Q)>0. A function with nonpositive derivative of t↦eγVtV(z(t)) is nonincreasing, so V(z(t))≤e−γVtV(z(0)). Combining with λmin⁡(Q)∥z∥22≤V(z)≤λmax⁡(Q)∥z∥22 gives ∥z(t)∥2≤βe−γVt/2∥z(0)∥2,β:=λmax⁡(Q)/λmin⁡(Q)≥1, for solutions with z(0)∈S. Choose δ>0 with B(0,δ)⊆S; then every maximal solution with ∥z(0)∥2<δ satisfies the displayed estimate. With γ:=γV/2>0 this proves the exponential bound, and it implies Lyapunov stability and asymptotic stability directly: given ε>0 small, choosing initial data with ∥z(0)∥2<δ′ where δ′≤δ and βδ′<ε keeps ∥z(t)∥2<ε for all t≥0, and the bound gives convergence to 0.

Remarks

  • The quadratic form Q is the classical Lyapunov matrix ∫0∞etATetA dt, positive definite exactly because all eigenvalues of A lie in the open left half-plane. The proof uses the exponential dichotomy only through the estimate of [F1]; hyperbolicity with a nonempty unstable part would require the indefinite quadratic form of A hyperbolic equilibrium whose linearisation has an eigenvalue with positive real part is unstable instead.

  • The conclusion is local: the constants δ,β,γ depend on the field F and are not uniform over an arbitrary family of systems. The theorem does not assert a global domain of attraction, an optimal rate, or any nonlinear analogue of the eigenvalue criterion when eigenvalues lie on the imaginary axis.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A hyperbolic equilibrium whose linearisation has an eigenvalue with positive real part is unstable

Statement

Let n≥1, let U⊆Rn be open with 0∈U, and let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms) with F(0)=0. Put A:=DF(0) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case) and suppose that

Then the equilibrium 0 is not Lyapunov stable (Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system): there is a real number ε0>0 such that for every δ>0 there exist z0∈U with ∥z0∥2<δ and a time t1>0 such that the maximal solution z of z′=F(z), z(0)=z0 is defined on [0,t1] and satisfies

∥z(t1)∥2=ε0.

Facts & Assumptions

Given: The open set U with 0∈U, the C1 field F with F(0)=0, and the matrix A=DF(0) with no purely imaginary eigenvalue and at least one eigenvalue of positive real part.

[F1]

The complexification of A is AC:=id⁡C⊗A on C⊗RRn (Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map). In the standard basis write a complex vector as w=p+iq with p,q∈Rn and equip it with ∥p+iq∥2,C:=(∥p∥22+∥q∥22)1/2. The real and imaginary coordinate identification makes this a complete normed space (R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R, C is the real coordinate plane, with coordinate arithmetic), and the finite real matrix of AC is bounded by Cauchy--Schwarz (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation). If λ is an eigenvalue of AC with Re⁡λ>0, choose w=p+iq≠0 with ACw=λw (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism). The exponential series gives etACw=etλw, and ∣etλ∣=etRe⁡λ→0 as t→−∞ (The exponential series of a bounded operator, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0). Since A is real, the real and imaginary parts of etACw are etAp and etAq; each tends to 0 in the Euclidean norm. At least one of p,q is nonzero. Exponential dichotomy gives A-invariant subspaces Rn=Es⊕Eu and constants C≥1, c>0 such that ∥etAv∥2≤Ce−ct∥v∥2 for v∈Es, t≥0, ∥etAv∥2≤Cect∥v∥2 for v∈Eu, t≤0, and ∥etAv∥2≥C−1ect∥v∥2 for v∈Eu, t≥0; moreover Es,Eu are characterised by convergence to 0 at +∞ and −∞ respectively (Exponential dichotomy for a hyperbolic endomorphism: invariant stable and unstable subspaces with exponential estimates). Clause 4 places a nonzero real vector among p,q that tends to 0 as t→−∞ in Eu. Thus Eu≠{0}.

[F2]

Differentiability at 0: for every η>0 there is ρ>0 with ∥F(z)−Az∥2≤η∥z∥2 for ∥z∥2<ρ (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[F3]

Let Πu,Πs be the projections onto Eu,Es along the decomposition; they are linear and satisfy ΠuA=AΠu, ΠsA=AΠs, Πu+Πs=I. For a linear map L between these Euclidean spaces, write ∥L∥2:=sup⁡{∥Lv∥2:∥v∥2≤1} for its induced operator norm. In orthonormal coordinates every linear map has a finite matrix, and Cauchy--Schwarz bounds its operator norm by the square root of the sum of squares of its entries; hence K:=max⁡(∥Πu∥2,∥Πs∥2)<∞ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation).

[F4]

Improper integrals For a>0, direct integration using The exponential function is smooth and (exp⁡)′=exp⁡ gives ∫0Te−atdt=(1−e−aT)/a→1/a by The exponential tends to +∞ at +∞ and to 0 at −∞. Improper integrals of continuous functions with exponential decay converge absolutely, by comparison (Improper integrals over unbounded intervals, Comparison tests for improper integrals); Cauchy--Schwarz bounds Euclidean inner products by the product of norms (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation).

[F5]

Compact continuation: an autonomous solution trapped in a compact subset of its open state domain near a finite endpoint extends past that endpoint; F is locally Lipschitz because it is C1 (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it). Closed Euclidean balls are compact because they are closed and bounded (Open ball, closed ball and sphere in a metric space, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

[F6]

If Q is a symmetric positive definite endomorphism of a finite-dimensional real inner product space, the real spectral theorem gives an orthonormal eigenbasis with positive eigenvalues; writing λmax⁡(Q) for the largest eigenvalue yields ⟨Qv,v⟩≤λmax⁡(Q)∥v∥22 (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

Proof

technique · direct; build an indefinite quadratic Lyapunov function that grows in the unstable directions and use exponential dichotomy estimates
1.1F1F4algebra

Choose a nonzero u0∈Eu, which is possible because Eu≠{0} by [F1]. On Eu define Qu:=∫0∞e−tAuTe−tAu dt,Au:=A∣Eu, and on Es define Qs:=∫0∞etAsTetAs dt, As:=A∣Es; the transposes are with respect to the inherited Euclidean inner products. If Es={0}, Qs is the zero endomorphism of that space and its positivity assertion is vacuous. By [F1], ∥e−tAuv∥2≤Ce−ct∥v∥2 for v∈Eu, t≥0, and ∥etAsv∥2≤Ce−ct∥v∥2 for v∈Es, t≥0. Cauchy--Schwarz [F4] bounds each matrix entry of both integrands by C2e−2ct, so [F4] gives absolute convergence entrywise. For nonzero v in either nonzero subspace, the corresponding quadratic form equals the integral of ∥e−tAuv∥22 or ∥etAsv∥22; the integrand is continuous and positive at t=0, so Qu and Qs are positive definite on their subspaces. For Qu,T:=∫0Te−tAuTe−tAu dt, differentiating the integrand and applying the fundamental theorem gives AuTQu,T+Qu,TAu=I−e−TAuTe−TAu; the terminal term tends to 0 by the decay estimate, so AuTQu+QuAu=IEu. The same calculation with Qs,T:=∫0TetAsTetAs dt gives AsTQs+QsAs=−IEs after taking T→∞.

2.1step 1.1F2F3F4algebra

Define the function V on U by V(z):=⟨QuΠuz,Πuz⟩2−⟨QsΠsz,Πsz⟩2, writing u=Πuz, s=Πsz. It is a quadratic form, hence differentiable, and for a solution z of z′=F(z) with z(t)=u(t)+s(t) one has u′=Auu+Πur(z), s′=Ass+Πsr(z) where r(z):=F(z)−Az, because Πu,Πs commute with A [F3]. Differentiating along the solution, ddtV(z(t))=∥u∥22+∥s∥22+2⟨Quu,Πur(z)⟩2−2⟨Qss,Πsr(z)⟩2≥∥u∥22+∥s∥22−2M∥r(z)∥2∥z∥2, with M:=∥Qu∥2∥Πu∥22+∥Qs∥2∥Πs∥22>0: the two scalar-product terms are estimated by Cauchy--Schwarz and ∥u∥2≤∥Πu∥2∥z∥2, ∥s∥2≤∥Πs∥2∥z∥2; no orthogonality of the splitting is assumed, and ∥z∥2=∥u+s∥2≤∥u∥2+∥s∥2 gives ∥z∥22≤2(∥u∥22+∥s∥22).

3.1step 1.12.1F2F3F6algebra

Choose η>0 with 8Mη≤1 and let ρ>0 be as in [F2] for this η; shrink ρ so that B‾(0,ρ)⊆U. For ∥z∥2<ρ, step 2.1 and [F2] give, since ∥z∥22≤2(∥u∥22+∥s∥22) and 8Mη≤1, ddtV(z(t))≥∥u∥22+∥s∥22−2Mη∥z∥22≥12(∥u∥22+∥s∥22)≥0. In particular, whenever V(z)>0 then u≠0 and ∥u∥22≥V(z)/λmax⁡(Qu) by [F6], so ddtV(z(t))≥12∥u∥22≥γV(z(t)),γ:=12λmax⁡(Qu)>0. Set ε0:=ρ.

4.1step 1.13.1

Let 0<δ be arbitrary and choose z0:=u0∈Eu with 0<∥u0∥2<min⁡(δ,ε0) (step 1.1). Then V(z0)=⟨Quu0,u0⟩2>0. Let z:[0,b)→U be the maximal forward solution through z0. As long as ∥z(t)∥2<ε0, step 3.1 gives ddtV(z(t))≥0 whenever V(z(t))≥0; since V(z(0))>0, the function V∘z stays positive and satisfies V(z(t))≥eγtV(z0) on that interval.

5.1step 4.1F5F6algebra∎

The solution must reach the sphere ∥z∥2=ε0 at some finite time. Suppose first that the solution is defined for all t≥0 and never reaches that sphere. Then ∥z(t)∥2<ε0 for all t, so step 4.1 gives V(z(t))≥eγtV(z0)→+∞, while V(z)≤λmax⁡(Qu)∥Πu∥22ε02 on B‾(0,ε0) by [F6]; this is a contradiction. Suppose next that the maximal forward interval is [0,b) with b<∞ and the solution never reaches the sphere. Then its values lie in the compact set B‾(0,ε0)⊆U near the endpoint b by [F5], so [F5] extends the solution past b, contradicting maximality. Hence in every case there is a first time t1∈(0,∞) with ∥z(t1)∥2=ε0, and the solution is defined on [0,t1]. Since δ>0 was arbitrary, the equilibrium 0 is not Lyapunov stable in the sense of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system.

Remarks

  • The proof uses the dichotomy hypothesis to obtain the invariant splitting with an exponential gap. If A has an eigenvalue with positive real part and also a purely imaginary eigenvalue, the conclusion remains true in the classical linearisation theorem, but a different argument is needed (the centre directions require separate treatment); that case is not covered here.

  • The indefinite quadratic form V is unbounded above, so V growing is not by itself a contradiction; the contradiction in step 5.1 comes from V growing while the solution stays in the bounded ball. The exit time t1 depends on z0 and δ; the theorem asserts instability, not a uniform escape rate for all small data.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart

Definition

Let n≥1, let Ω⊆Rn be open, let M:Ω→Mn(R) be of class C2 (Ck Euclidean maps and diffeomorphisms) with M(q) symmetric and positive definite for every q∈Ω, that is vTM(q)v>0 for every nonzero v∈Rn, and let U:Ω→R be of class C2. The matrix field M is the kinetic metric field and U the potential of the data in the chart Ω.

Coordinates and matrix entries are indexed by 0≤i,j,k<n, as in The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. Vectors are read as columns: for A∈Mn(R), (Av)i:=∑j=0n−1Aijvj, and vTAv:=∑i,j=0n−1viAijvj.

Define, for (q,v)∈Ω×Rn, the kinetic energy, Lagrangian and energy

T(q,v):=12vTM(q)v,L(q,v):=T(q,v)−U(q),E(q,v):=T(q,v)+U(q),

and, for q∈Ω and v∈Rn, the matrix

DqM(q)[v]:=∑k=0n−1vk ∂kM(q),(∂kM(q))ij=∂kMij(q)(0≤i,j,k<n).

The mechanical vector field of the data is the map

G:Ω×Rn⟶Rn×Rn,G(q,v)=(v, M(q)−1(12∇q(vTM(q)v)−(DqM(q)[v])v−∇U(q))),

where ∇q and ∇U are Euclidean gradients (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case) and M(q)−1 is the inverse of the positive definite matrix M(q) (Invertible matrices and the general linear group GL⁡n(F), Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes). The mechanical system in the chart is the first-order system

q′(t)=v(t),v′(t)=M(q(t))−1(12∇qf(q(t),v(t))−(DqM(q(t))[v(t)])v(t)−∇U(q(t))),f(q,v):=vTM(q)v.

A point q∗∈Ω is a mechanical equilibrium when ∇U(q∗)=0.

Remarks

  • Equilibria. If q∗∈Ω is a mechanical equilibrium, then G(q∗,0)=(0,0): the first component is 0, and in the second component ∇qf(q∗,0)=0 (a quadratic form in v evaluated at v=0), (DqM(q∗)[0])0=0 and ∇U(q∗)=0. Thus (q∗,0) is an equilibrium of G in the sense of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system.

  • Equivalence with the Euler-Lagrange equation. A C2 curve q:I→Ω with velocity v:=q′ satisfies the Euler-Lagrange equation ddt∇vL=∇qL of the Lagrangian above if and only if (q,v) solves the system q′=v, v′=G2(q,v). Indeed ∇vL=M(q)v, so

ddt(M(q)q′)=M(q)q′′+(DqM(q)[q′])q′,∇qL=12∇q(q′TM(q)q′)−∇U(q),

and multiplying the Euler-Lagrange equation by M(q)−1 gives the displayed second component. The computation is linear algebra plus the product rule for the matrix-valued curve t↦M(q(t)).

  • Regularity. Under the stated hypotheses the map G is of class C1 on Ω×Rn: M is C2, so the maps involving ∂kM, ∇qf and DqM[⋅] ⋅ are C1; ∇U is C1 because U is C2; and q↦M(q)−1 is C1 wherever det⁡M(q)≠0, since M−1=det⁡(M)−1adj(M) has entries that are polynomial in the entries of M divided by the continuous nonvanishing function det⁡M. Hence the mechanical system satisfies the Picard-Lindelöf regularity hypotheses locally.

  • Scope. This is a mathematical chart model: M is an arbitrary C2 positive definite symmetric matrix field and no physical law, identification with masses, units or empirical assertion is made by the definition. The constant case M(q)≡M reduces to Mq′′=−∇U(q), and a mechanical equilibrium is a critical point of the potential.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Energy is conserved along solutions of the mechanical system with a configuration-dependent kinetic metric

Statement

Let n≥1, let Ω⊆Rn be open, let M:Ω→Mn(R) be a C2 field of symmetric positive definite matrices, let U:Ω→R be C2, and let E(q,v)=12vTM(q)v+U(q) be the energy of The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart. If q:I→Ω is a C2 solution of the mechanical system M(q)q′′=12∇q(q′TM(q)q′)−(DqM(q)[q′])q′−∇U(q) on the interval I, then

ddtE(q(t),q′(t))=0(t∈I);

that is, the energy is constant along every solution.

Facts & Assumptions

Given: The kinetic metric field M, the potential U, and a C2 solution q of the mechanical system, with v:=q′.

[F1]

The mechanical system is equivalent to the Euler-Lagrange equation of L=T−U and reads M(q)q′′=12g(q,v)−(DqM(q)[v])v−∇U(q) with g(q,v):=∇q(vTM(q)v) and DqM(q)[v]=∑kvk∂kM(q) (The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart).

[F3]

Gradient and inner product: ∇q(vTM(q)v) has components ∂k(vTM(q)v)=vT∂kM(q)v, so that

(∇q(vTM(q)v))⋅v=∑kvk vT∂kM(q)v=vT(∑kvk∂kM(q))v=vT(DqM(q)[v])v

Proof

technique · direct; differentiate the energy along the solution and substitute the equation of motion
1.1givenF1F2

The map t↦M(q(t)) is C1 with derivative ddtM(q(t))=∑kqk′(t)∂kM(q(t))=DqM(q(t))[v(t)], by the chain rule applied to each entry and the definition of DqM[q′] [F1, F2].

1.2F2F3

Differentiating the potential: ddtU(q(t))=∇U(q(t))⋅v(t) by the chain rule.

2.1step 1.1F1F2algebra

Differentiating the kinetic energy: ddt(12v(t)TM(q(t))v(t))=vTM(q)v′+12vT(DqM(q)[v])v, using the product rule, symmetry of M(q), and step 1.1; here and below all functions are evaluated at t.

3.1step 1.12.1F1algebra

Substituting the equation of motion v′=M(q)−1(12∇q(vTM(q)v)−(DqM(q)[v])v−∇U(q)) of [F1] into step 2.1 gives ddt(12vTM(q)v)=12vT∇q(vTM(q)v)−vT(DqM(q)[v])v−vT∇U(q)+12vT(DqM(q)[v])v.

4.1step 2.11.23.1F3F4algebra∎

By [F3] the first and the last terms combine as 12vT∇q(vTM(q)v)+12vT(DqM[v])v=vT(DqM[v])v, cancelling the middle term; hence ddt(12vTM(q)v)=−vT∇U(q). Adding step 1.2, ddtE(q(t),v(t))=−vT∇U(q)+vT∇U(q)=0 on I. The continuous scalar energy is constant on the interval I by [F4].

Remarks

  • The cancellation uses exactly the two terms produced by the configuration dependence of M: the derivative of the kinetic energy along the flow produces vT(DqM[v])v, and substitution of the two configuration-dependent acceleration terms gives 12vT∇q(vTMv)−vT(DqM[v])v=−12vT(DqM[v])v, cancelling the kinetic derivative term 12vT(DqM[v])v. For constant M the statement reduces to the familiar ddt(12vTMv+U)=0.

  • The lemma is a statement about the model: it does not assert that any physical system conserves energy, nor that solutions exist globally, nor that the energy is a Liapunov function for any equilibrium; those uses are made in A strict local minimum of the potential gives a Lyapunov stable equilibrium of the mechanical system, by energy conservation under their own hypotheses.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Positive definite symmetric matrices have positive definite square roots, and the congruence M^{-1/2} K M^{-1/2} preserves symmetry and positivity

Statement

Let n≥1 and let M∈Mn(R) be symmetric and positive definite, that is vTMv>0 for every nonzero v∈Rn; identify Rn with its standard real inner product space (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). Then:

  1. M is invertible and M−1 is symmetric and positive definite;
  2. there is a unique symmetric positive definite matrix M1/2 with (M1/2)2=M;
  3. M−1/2:=(M1/2)−1 is symmetric and positive definite, satisfies (M−1/2)2=M−1, and M−1/2MM−1/2=In;
  4. for every symmetric matrix K that is non-negative, that is vTKv≥0 for all v, the matrix S:=M−1/2KM−1/2 is symmetric and non-negative, and S is positive definite if and only if K is.

Facts & Assumptions

Given: The symmetric positive definite matrix M and, in clause 4, a symmetric non-negative matrix K.

[F1]

A real matrix is symmetric if and only if the associated endomorphism of Rn is self-adjoint; positive definite (respectively non-negative) matrices in the form sense correspond exactly to positive (respectively non-negative) operators, and a positive operator is non-negative (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose, Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, Over the reals, non-negative and positive operators correspond exactly to positive semidefinite and positive definite symmetric forms, Non-negative and positive operators).

[F2]

A non-negative operator on a finite-dimensional real inner product space has a unique non-negative square root, and a non-negative operator admits an orthonormal basis of eigenvectors with non-negative eigenvalues (A non-negative operator has a unique non-negative square root, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

[F3]

Matrix algebra: composition and multiplication of matrices are associative, the identity acts as Inx=x, and (AB)T=BTAT; the inverse of an invertible square matrix is unique and two-sided (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, Invertible matrices and the general linear group GL⁡n(F), In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided).

Proof

technique · direct; transfer the positivity statement to operators and use the unique non-negative square root
1.1givenF1F2algebra

By [F1] M corresponds to a positive operator on Rn, hence to a non-negative one. By [F2] there is a unique non-negative operator R with R2=M; write M1/2 for its matrix, which is symmetric because R is self-adjoint [F1]. If Rv=0 then Mv=R2v=0, so v=0 because M is positive definite; hence R is injective, and by [F2] its eigenvalues are non-negative and none is zero, so all are positive: R is positive definite. This proves clause 2 except for uniqueness among all symmetric positive definite square roots, which follows because a symmetric positive definite square root is in particular a non-negative square root, and [F2] gives uniqueness among non-negative square roots.

2.1step 1.1F2F3algebra

In the orthonormal eigenbasis of R=M1/2 from step 1.1, write Rej=rjej with rj>0. Define Bej=rj−1ej and extend linearly. Then BR=RB=In on this basis, and B2M=MB2=In since M=R2. Thus R and M are invertible by [F3]. Since M=M1/2M1/2 [F3], we have M−1=(M1/2)−1(M1/2)−1, and M−1/2:=(M1/2)−1 is well defined and satisfies (M−1/2)2=M−1 and M−1/2MM−1/2=(M1/2)−1M1/2M1/2(M1/2)−1=In by associativity and [F3].

2.2step 1.12.1F1F3algebra

M−1 and M−1/2 are symmetric and positive definite. For M−1: for u,u′∈Rn write u=Mx, u′=Mx′; then ⟨M−1u,u′⟩=⟨x,Mx′⟩=⟨Mx,x′⟩=⟨u,M−1u′⟩ by symmetry of M, so M−1 is self-adjoint, hence symmetric [F1]; and for u≠0, ⟨M−1u,u⟩=⟨x,Mx⟩>0, so M−1 is positive definite. For M−1/2: it is the inverse of the self-adjoint invertible M1/2, and the same computation with M1/2 in place of M (which is positive definite by step 1.1) shows that its inverse is self-adjoint and positive definite. This proves clauses 1 and 3.

3.1step 2.2F1F3algebra∎

Clause 4: for symmetric K, ST=(M−1/2)TKT(M−1/2)T=M−1/2KM−1/2=S by symmetry of M−1/2 and K, so S is symmetric [F3]. For x∈Rn put y:=M−1/2x; then xTSx=yTKy, so non-negativity of K implies non-negativity of S. If K is positive definite and x≠0, then y=M−1/2x≠0 because M−1/2 is invertible, and xTSx=yTKy>0. Thus S is positive definite. Conversely, if S is positive definite and x≠0, then with y:=M1/2x≠0 one has xTKx=yTM−1/2KM−1/2y=yTSy>0, so K is positive definite.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A C² local minimum has vanishing gradient and positive semidefinite Hessian

Statement

Let n≥1, let Ω⊆Rn be open, let U:Ω→R be of class C2 (Ck Euclidean maps and diffeomorphisms), and let q0∈Ω be a local minimum of U: there is ρ>0 with B‾(q0,ρ)⊆Ω and U(q)≥U(q0) for every q∈B‾(q0,ρ). Then

∇U(q0)=0,hTD2U(q0)h≥0for every h∈Rn,

where D2U(q0) is the Hessian matrix, which is symmetric (The Hessian of a C2 scalar field is symmetric, The Hessian matrix and critical points of a scalar field).

Facts & Assumptions

Given: The C2 function U and the local minimum q0.

[F2]

Second-order Taylor expansion: for C2 f near a, f(a+h)=f(a)+∇f(a)⋅h+12⟨Hf(a)h,h⟩+o(∥h∥2), and the Hessian is symmetric (Second-order Taylor expansion f(a+h)=f(a)+∇f(a)⋅h+12hTHf(a)h+o(∥h∥2), The Hessian of a C2 scalar field is symmetric, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F3]

The Peano remainder is a limit statement: writing f(q0+th)=f(q0)+t∇f(q0)⋅h+12t2hTHf(q0)h+r(th) for small t, one has r(th)/∥th∥22→0 as t↓0; by the definition of the function limit (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A), for every ε>0 there is δ>0 with ∣r(th)∣≤εt2∥h∥22 for 0<t<δ (Second-order Taylor expansion f(a+h)=f(a)+∇f(a)⋅h+12hTHf(a)h+o(∥h∥2), The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

Proof

technique · direct; apply Fermat's theorem and expand along a line
1.1givenF1F2algebra

The restriction φh(t):=U(q0+th) is defined and differentiable for ∣t∣ small, with φh′(0)=∇U(q0)⋅h by the chain rule; it has a local minimum at t=0 because U does. By the one-variable Fermat theorem (or [F1] applied in one dimension) φh′(0)≥0 and φ−h′(0)≥0; since φ−h′(0)=−∇U(q0)⋅h, both inequalities give ∇U(q0)⋅h=0. As this holds for every h, ∇U(q0)=0.

2.1step 1.1F2F3algebra∎

Fix h∈Rn, assume h≠0 (the case h=0 is trivial), and apply [F2] at a=q0 to the vector th with t>0 small: U(q0+th)=U(q0)+t∇U(q0)⋅h+12t2 hTD2U(q0)h+o(t2). By step 1.1 the linear term vanishes, and the left side is ≥U(q0); hence, using the notation of [F3], 12t2hTD2U(q0)h+r(th)≥0 for all sufficiently small t>0. Suppose for contradiction that hTD2U(q0)h=−c<0. Choose ε:=c/(4∥h∥22) in [F3]; then for 0<t<δ, r(th)≤εt2∥h∥22=ct2/4, so the left side is at most −12ct2+14ct2=−14ct2<0, a contradiction. Hence hTD2U(q0)h≥0.

Remarks

  • The converse is false without a strictness hypothesis: a C2 function with ∇U(q0)=0 and positive semidefinite Hessian need not have a local minimum at q0. The lemma records only the necessary conditions, which is what the mechanical energy-stability theorem and the linearisation proposition use.

  • Nothing is asserted about strict positivity of the Hessian: a strict minimum may have a degenerate Hessian (for example U(q)=∣q∣4 at q0=0), and the energy-stability theorem is stated for strict minima without any Hessian hypothesis.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Decoupling of the constant-coefficient quadratic system Mq′′+Kq=0 into normal modes, with the zero-mode and energy identities

Statement

Let n≥1, let M∈Mn(R) be symmetric positive definite and let K∈Mn(R) be symmetric and non-negative, that is vTKv≥0 for all v∈Rn. Let M1/2, M−1/2 be the square roots of Positive definite symmetric matrices have positive definite square roots, and the congruence M^{-1/2} K M^{-1/2} preserves symmetry and positivity and let

S:=M−1/2KM−1/2.

By the real spectral theorem choose an orthogonal matrix O and a diagonal matrix Λ=diag⁡(λ1,…,λn) with S=OΛOT and λi≥0 for all i.

Let I⊆R contain at least two points and satisfy r,s∈I, r≤u≤s⟹u∈I for all r,s,u∈R; suppose also 0∈I. Let q:I→Rn be twice differentiable with continuous first and second domain-relative derivatives, in the sense of The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral. Put z:=OTM1/2q. Then:

  1. q satisfies the quadratic system Mq′′+Kq=0 on I if and only if z satisfies the decoupled system

zi′′+λizi=0(1≤i≤n)

on I; 2. for every i the solutions of the scalar equation in clause 1 on an interval containing 0, with prescribed initial data, are exactly as follows:

zi(t)=aicos⁡(ωit)+bisin⁡(ωit)with ωi:=λi>0 when λi>0,

equivalently zi(t)=Re⁡(Cieiωit) with Ci=ai−ibi∈C, and

zi(t)=ai+bitwhen λi=0;

the coefficients are ai=zi(0), bi=zi′(0)/ωi for λi>0 and bi=zi′(0) for λi=0, so the displayed families cover every initial datum and are the complete solution sets for the first-order system (zi,zi′)′=(zi′,−λizi); 3. consequently every solution of Mq′′+Kq=0 is q=M−1/2Oz for a unique choice of the modal solutions of clause 2, and the correspondence between initial data (q(0),q′(0))∈R2n and the coefficient tuples (ai,bi) is a bijection; 4. for every solution the modal energies Ei:=12(zi′2+λizi2) are constant on I, and so are

12q˙TMq˙+12qTKq=12∣z′∣22+12∑i=1nλizi2=∑i=1nEi.

Facts & Assumptions

Given: The symmetric positive definite M, the symmetric non-negative K, the orthogonal diagonalisation S=OΛOT with Λ=diag⁡(λ1,…,λn), λi≥0, the set I with the stated interval property, and the curve q:I→Rn with two continuous domain-relative derivatives and z=OTM1/2q.

[F1]

M1/2, M−1/2 exist, are symmetric positive definite, (M1/2)2=M, (M−1/2)2=M−1 and M−1/2MM−1/2=In; S is symmetric and non-negative (Positive definite symmetric matrices have positive definite square roots, and the congruence M^{-1/2} K M^{-1/2} preserves symmetry and positivity). A symmetric real matrix is self-adjoint, and the real spectral theorem gives an orthonormal eigenbasis, so O may be taken orthogonal with OT=O−1 and S=OΛOT (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F3]

Sine and cosine have derivatives sin⁡′=cos⁡, cos⁡′=−sin⁡ with sin⁡0=0, cos⁡0=1; and eiθ=cos⁡θ+isin⁡θ, so acos⁡θ+bsin⁡θ=Re⁡((a−ib)eiθ) (The derivatives of sine and cosine are cosine and minus sine, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F4]

Every initial value problem of the linear first-order system (zi,zi′)′=(zi′,−λizi) satisfies the Picard-Lindelöf hypotheses, so it has a unique maximal solution; a solution defined on all of R through the given data is therefore the maximal solution (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, First-order systems, initial value problems, and solutions on intervals).

Proof

technique · direct; transform the system by the square root of $M$, diagonalise the transformed stiffness and solve the scalar equations with a uniqueness argument
1.1givenF1F2algebra

Since q=M−1/2Oz (equivalently z=OTM1/2q), differentiating twice with the chain rule [F2] gives q′′=M−1/2Oz′′, hence Mq′′+Kq=M1/2Oz′′+KM−1/2Oz=M1/2O(z′′+OTM−1/2KM−1/2Oz)=M1/2O(z′′+Λz), where we used M=M1/2M1/2, OT=O−1 and S=OΛOT [F1]. As M1/2O is invertible, Mq′′+Kq=0 if and only if z′′+Λz=0, which is the decoupled system of clause 1.

1.2F2F3algebra

The scalar equation for λi>0: by [F3] and the chain rule, d2dt2(acos⁡ωit+bsin⁡ωit)=−ωi2(acos⁡ωit+bsin⁡ωit)=−λizi(t), so the displayed family solves zi′′+λizi=0 on R. For λi=0 the affine functions solve zi′′=0 by direct differentiation. In both cases the coefficients listed in clause 2 realize the initial data (zi(0),zi′(0)).

2.1step 1.2F2F4algebra

Completeness in the scalar case: let u solve u′′+λiu=0 with u(0)=u′(0)=0. For λi>0 define Φ(t):=12u′(t)2+12λiu(t)2; by [F2], Φ′=u′(u′′+λiu)=0, so Φ is constant and equal to Φ(0)=0; both summands are non-negative, so u=0. For λi=0, u′′=0 gives u′=const=0 and then u=const=0 by [F2]. Hence two solutions with the same initial data coincide on the intersection of their intervals. Now let z be any maximal solution of the scalar first-order system; the explicit solution w of clause 2 with the same initial data is defined on all of R, and by uniqueness w is the restriction of z; since w is defined on R, the maximal domain is R and z=w. Thus the displayed families are exactly the solution sets, which is clause 2.

2.2step 1.12.1F1algebra

Clause 3 follows from clauses 1 and 2 together with the identity q=M−1/2Oz: the map (q(0),q′(0))↦(z(0),z′(0)) is the linear bijection given by z(0)=OTM1/2q(0), z′(0)=OTM1/2q′(0), and the map (z(0),z′(0))↦(ai,bi) is bijective by the formulas of clause 2.

3.1step 1.1F1F2algebra∎

Clause 4: for a solution, ddtEi=zi′(zi′′+λizi)=0 by [F2], so each Ei is constant. Moreover, using q′=M−1/2Oz′ and [F1], q˙TMq˙=(M−1/2Oz′)TM(M−1/2Oz′)=∣z′∣22,qTKq=(M−1/2Oz)TK(M−1/2Oz)=zTΛz=∑iλizi2, because OTO=In and M−1/2MM−1/2=In. Adding the two identities and halving gives the displayed chain of equalities.

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A strict local minimum of the potential gives a Lyapunov stable equilibrium of the mechanical system, by energy conservation

Statement

Let n≥1, let Ω⊆Rn be open, let M:Ω→Mn(R) be a C2 field of symmetric positive definite matrices, let U:Ω→R be C2, let q0∈Ω with ∇U(q0)=0, and suppose q0 is a strict local minimum of U: there is r0>0 with B‾(q0,r0)⊆Ω and

U(q)>U(q0)(0<∥q−q0∥2<r0).

Let G be the mechanical vector field of The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart on Ω×Rn, with energy E(q,v)=12vTM(q)v+U(q). Then (q0,0) is a Lyapunov stable equilibrium of (q′,v′)=G(q,v) in the sense of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system: for every ε>0 with B‾((q0,0),ε)⊆Ω×Rn there is δ>0 such that every maximal solution (q,v) with ∥(q(0),v(0))−(q0,0)∥2<δ is defined for all t≥0 and satisfies

∥(q(t),v(t))−(q0,0)∥2<ε(t≥0).

No asymptotic stability is asserted.

Facts & Assumptions

Given: The C2 positive definite kinetic metric field M, the C2 potential U, the strict local minimum q0 and the mechanical vector field G.

[F2]

Energy conservation: for every C2 solution (q,v) of the mechanical system, t↦E(q(t),v(t)) is constant (Energy is conserved along solutions of the mechanical system with a configuration-dependent kinetic metric).

[F3]

Compact continuation: an autonomous solution trapped in a compact subset of the open state domain near a finite endpoint extends past that endpoint (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it).

Proof

technique · direct; use the energy as a Lyapunov function on the boundary of a ball and extend the trapped solution by compact continuation
1.1givenF4algebra

Fix an admissible test radius εtest>0 and choose 0<ε≤εtest with ε<r0 and B‾((q0,0),ε)⊆Ω×Rn; then the projection of the ball to the first factor lies in B‾(q0,ε)⊆B‾(q0,r0). Write E0:=E(q0,0)=U(q0). On the sphere Sε:={(q,v):∥(q,v)−(q0,0)∥2=ε} the continuous function E−E0 is strictly positive: if v≠0 then 12vTM(q)v>0, and if v=0 then 0<∥q−q0∥2=ε<r0 and U(q)>U(q0). As Sε is nonempty and compact by [F4], there is δ0:=min⁡Sε(E−E0)>0.

2.1step 1.1F4algebra

Continuity of E at (q0,0) gives δ>0 such that ∥(q,v)−(q0,0)∥2<δ implies E(q,v)−E0<δ0. Shrinking δ further, assume δ≤ε.

3.1step 1.12.1F1F2F4algebra

Let (q,v):[0,b)→Ω×Rn be the maximal forward solution with ∥(q(0),v(0))−(q0,0)∥2<δ. Then ∥(q(t),v(t))−(q0,0)∥2<ε for all t∈[0,b). Indeed, suppose not and let t1:=inf⁡{t∈(0,b):∥(q(t),v(t))−(q0,0)∥2≥ε}; since the radius function is continuous with value <ε at t=0 and ≥ε at some time, the intermediate value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b)) shows that the infimum is attained with ∥(q(t1),v(t1))−(q0,0)∥2=ε and t1>0. By [F2], E(q(t1),v(t1))=E(q(0),v(0)), so E−E0 at time t1 is <δ0 by step 2.1, contradicting the definition of δ0 on Sε.

4.1step 3.1F3

The solution is defined for all t≥0: if b<∞, then the values (q(t),v(t)) for t∈[0,b) lie in the compact set B‾((q0,0),ε)⊆Ω×Rn by step 3.1, so [F3] extends the solution past b, contradicting maximality of the maximal solution (Extensions, maximal solutions, maximal intervals, and global solutions).

5.1step 2.13.14.1∎

Therefore every maximal solution starting at distance <δ from (q0,0) is defined for all t≥0 and stays at distance <ε; the resulting bound is also <εtest, and since εtest was arbitrary, (q0,0) is Lyapunov stable. This is exactly the defining condition of Equilibria, Lyapunov stability and asymptotic stability of an autonomous first-order system: the δ produced in step 2.1 depends only on ε, not on the solution.

Remarks

  • The proof uses exact energy conservation to establish stability, but it does not prove attraction. In this strict-minimum setting, nearby non-equilibrium initial data have energy greater than E(q0,0); conservation therefore prevents their solutions from converging to (q0,0). The theorem makes no asymptotic-stability claim, in contrast with An equilibrium whose linearisation has all eigenvalues in the open left half-plane is locally exponentially stable, which uses a strict Lyapunov decrease.

  • Neither strict positivity of the Hessian nor a Taylor expansion is used: a degenerate strict minimum such as U(q)=∥q∥24 is covered. The strictness hypothesis on the ball is essential for the positivity of E−E0 on the sphere; a non-strict minimum with a flat direction, such as U≡const near q0, would give E−E0=0 at points of the sphere with v=0 and the argument would not apply.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Linearisation of the mechanical system at an equilibrium: M(q_0) xi'' + D²U(q_0) xi = 0, and the small-oscillation quadratic model

Statement

Let n≥1, let Ω⊆Rn be open, let M:Ω→Mn(R) be a C2 field of symmetric positive definite matrices, let U:Ω→R be C2, and let q0∈Ω be a mechanical equilibrium, that is ∇U(q0)=0 (The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart). Let G be the mechanical vector field on Ω×Rn. Then:

  1. G is totally differentiable at (q0,0) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder) and, writing D2U(q0) for the Hessian matrix (The Hessian matrix and critical points of a scalar field),

DG(q0,0)(δq,δv)=(δv, −M(q0)−1D2U(q0) δq)(δq,δv∈Rn);

  1. consequently the linearised equation at the equilibrium is

ξ′′=−M(q0)−1D2U(q0) ξ,equivalentlyM(q0)ξ′′+D2U(q0) ξ=0,

a constant-coefficient system whose mass matrix M(q0) is symmetric positive definite and whose stiffness matrix D2U(q0) is symmetric (The Hessian of a C2 scalar field is symmetric); 3. if in addition q0 is a strict local minimum of U, then K:=D2U(q0) is non-negative, so the hypotheses of Decoupling of the constant-coefficient quadratic system Mq′′+Kq=0 into normal modes, with the zero-mode and energy identities are satisfied by M(q0) and K, and the linearised system is exactly the constant-coefficient quadratic system of that theorem with mass matrix M(q0) and stiffness K; its modes are the normal modes of the linearisation.

Facts & Assumptions

Given: The C2 kinetic metric field M, the C2 potential U, the equilibrium q0, and the vector field G(q,v)=(v,H(q,v)) with H(q,v)=M(q)−1(12∇qf(q,v)−(DqM(q)[v])v−∇U(q)), f(q,v)=vTM(q)v.

[F1]

Regularity: under the stated hypotheses G is of class C1 on Ω×Rn (the inverse M(q)−1 has entries polynomial in the entries of M divided by the nonvanishing continuous function det⁡M(q)), hence totally differentiable at every point (The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart, If det⁡(A) is a unit, then A−1=det⁡(A)−1adj⁡(A), If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, Ck Euclidean maps and diffeomorphisms).

[F2]

At (q0,0): ∇qf(q0,0)=0 and its q-derivative vanishes, because ∂k(vTM(q)v)=vT∂kM(q)v is a quadratic form in v vanishing identically at v=0; similarly (DqM(q)[v])v=∑kvk∂kM(q)v is quadratic in v, so it and both of its first partial derivatives vanish at v=0 (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F4]

At a strict local minimum, ∇U(q0)=0 and D2U(q0) is non-negative (A C² local minimum has vanishing gradient and positive semidefinite Hessian); and the constant-coefficient system Mξ′′+Kξ=0 with M symmetric positive definite and K symmetric non-negative is decoupled by Decoupling of the constant-coefficient quadratic system Mq′′+Kq=0 into normal modes, with the zero-mode and energy identities.

Proof

technique · direct; differentiate the explicit components of $G$ at the equilibrium and substitute
1.1givenF1algebra

The linearisation of G at (q0,0) is DG(q0,0)(δq,δv)=(δv, DqH(q0,0)δq+DvH(q0,0)δv). We compute the two partial derivatives of H=M−1B with B(q,v):=12∇qf(q,v)−(DqM(q)[v])v−∇U(q).

2.1step 1.1F2F3algebra

At (q0,0), B(q0,0)=12∇qf(q0,0)−0−∇U(q0)=0 by [F2] and the equilibrium condition. Hence DqH(q0,0)δq=Dq(M−1)(q0)[δq] B(q0,0)+M(q0)−1DqB(q0,0)δq=M(q0)−1DqB(q0,0)δq, and by [F2] and [F3] the derivative of B in q at (q0,0) is −12⋅0+0−D2U(q0)=−D2U(q0). Hence DqH(q0,0)=−M(q0)−1D2U(q0).

2.2step 1.12.1F2algebra

Similarly DvH(q0,0)=M(q0)−1DvB(q0,0) because B(q0,0)=0 again kills the derivative of M−1 along v; and DvB(q0,0)=0 because both 12∇qf and (DqM(q)[v])v are quadratic in v with vanishing first v-derivative at v=0 [F2]. Therefore DG(q0,0)(δq,δv)=(δv,−M(q0)−1D2U(q0)δq), which is clause 1.

2.3step 1.12.2F3algebra

Clause 2: the linearised first-order system is ξ′=η, η′=−M(q0)−1D2U(q0)ξ; eliminating η and multiplying by the invertible matrix M(q0) gives M(q0)ξ′′+D2U(q0)ξ=0. The matrix D2U(q0) is symmetric by [F3], and M(q0) is symmetric positive definite by hypothesis; the stiffness K:=D2U(q0) need not be non-negative, and no normal-mode conclusion is drawn at this point.

3.1step 2.3F4∎

Clause 3: if q0 is a strict local minimum, [F4] shows that K=D2U(q0) is non-negative; with M=M(q0) the hypotheses of the quadratic-mode theorem are exactly satisfied (symmetric positive definite mass and symmetric non-negative stiffness), and its clauses describe the normal modes of the linearisation.

Remarks

RemarkRemark: AI-adaptedProof: Not applicableprecheck passOpen item page →

Scope of the quadratic-mode and energy-stability results: exact quadratic model versus linearisation approximation

Statement

The three results of this group establish different, and differently qualified, statements.

  1. Decoupling of the constant-coefficient quadratic system Mq′′+Kq=0 into normal modes, with the zero-mode and energy identities is an exact theorem about the constant-coefficient linear system Mq′′+Kq=0 with M symmetric positive definite and K symmetric non-negative: it diagonalises the system, gives all solutions and the modal energies. It is not an approximation statement, and it makes no claim about nonlinear systems or about configuration-dependent kinetic metrics.

  2. Linearisation of the mechanical system at an equilibrium: M(q_0) xi'' + D²U(q_0) xi = 0, and the small-oscillation quadratic model computes the derivative of the nonlinear mechanical field at an equilibrium. Its linearised equation is the exact first-order Taylor model at that point; replacing the nonlinear system by it is an approximation whose error over a time interval is not estimated by the proposition. A zero eigenvalue λi=0 of M(q0)−1/2D2U(q0)M(q0)−1/2 corresponds to an affine mode of the linearisation, not to an oscillation, and a negative eigenvalue corresponds to exponential growth of the linearisation.

  3. A strict local minimum of the potential gives a Lyapunov stable equilibrium of the mechanical system, by energy conservation is an exact Lyapunov-stability theorem for the nonlinear system at a strict minimum of the potential. It is a statement about the nonlinear field of The mechanical first-order field, Lagrangian and energy of a configuration-dependent kinetic metric in a chart, uses exact energy conservation, and therefore proves stability but not attraction: the theorem does not assert that solutions converge to the equilibrium, and in a conservative model with no dissipation they do not in general. It also does not assert that the linearisation determines the nonlinear stability in non-hyperbolic cases, and it does not require the Hessian to be positive definite.

5 · Examples, experiments and counterexamples

None yet.

Sources