Skip to content

LaSalle's Invariance Principle

Conclude that trajectories approach the largest invariant subset of the region where a nonincreasing Lyapunov function stops decreasing, extending asymptotic-stability proofs beyond strictly negative derivatives.

Version
v2 · 2026-09-06 · History
Domain-specific #
2163
Origin domain
mathematics
Subdomain
dynamical systems
Aliases
LaSalle invariance principle, Krasovskii–LaSalle principle, Barbashin–Krasovskii–LaSalle principle

Core Idea

LaSalle's invariance principle analyzes an autonomous dynamical system with a continuously differentiable scalar function V whose derivative along trajectories is nonpositive on an appropriate compact positively invariant region. V cannot increase, so limit behavior is confined to the largest invariant subset M of E={x:V̇(x)=0}. Trajectories approach M, not necessarily every point of E.

The principle strengthens the direct Lyapunov method when V̇ is negative semidefinite rather than negative definite. If the largest invariant subset of E is only the target equilibrium, convergence to that equilibrium follows under the theorem's conditions. If E contains another complete trajectory, continuum of equilibria, or periodic orbit, LaSalle supports convergence only to that invariant set. Compactness, forward completeness, invariance, and the local/global domain must therefore be explicit.

Scope of Application

The principle is literal in nonlinear dynamics and control wherever a monotone scalar and invariant-set analysis can characterize limit behavior.

  • Nonlinear control. Proving closed-loop convergence with semidefinite energy decay.
  • Mechanical systems. Showing damped energy approaches the equilibrium invariant set.
  • Adaptive control. Establishing convergence of error-related trajectories under boundedness conditions.
  • Power and network dynamics. Analyzing synchronization or equilibrium sets.
  • Population and reaction models. Restricting omega-limit behavior through conserved or dissipated functions.
  • Optimization dynamics. Studying continuous-time descent with flat directions and invariant sets.

Clarity

State the dynamical system, regularity, domain, compact or precompact positively invariant set, function V, and calculation of V̇. Write E and then solve the separate problem of finding its largest invariant subset M. Specify whether the theorem proves stability, attractivity, asymptotic stability, or only approach to M, and whether the claim is local or global.

Manages Complexity

A scalar monotonicity certificate replaces direct solution of nonlinear trajectories and reduces possible long-run behavior to invariant dynamics inside one level condition. This can turn a difficult asymptotic proof into algebra plus set analysis. The compression is incomplete until M is identified; treating E as M is the characteristic mistake and can convert a valid boundedness argument into a false convergence claim.

Abstract Reasoning

  1. Define the autonomous dynamics and forward domain.
  2. Construct a scalar V with the required regularity and lower bound.
  3. Compute its orbital derivative and prove nonpositivity.
  4. Establish positive invariance and compactness or precompactness.
  5. Form E where the derivative vanishes.
  6. Find the largest invariant subset M contained in E.
  7. Apply the principle to conclude approach to M.
  8. Add stability conditions and identify M with the target to prove asymptotic stability.

Knowledge Transfer

The theorem remains a dynamical-systems instrument. Its strict parent is Stability: it certifies long-run return or approach after perturbation without solving trajectories. Invariance and Convergence are essential related primes, but stability is the theorem's principal use and taxonomic home.

Stability is the strict parent because the principle converts a nonincreasing scalar certificate into an asymptotic statement about invariant behavior. The transferable pattern is monotone quantity → zero-change region → largest invariant residual → approach. It appears in optimization and dissipative systems, but transfer requires a trajectory concept, forward invariance, and compactness or precompactness.

Relationships to Other Abstractions

Local relationship map for LaSalle's Invariance PrincipleParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.LaSalle'sInvariance PrincipleDOMAINPrime abstraction: Stability — is a kind ofStabilityPRIME

Current abstraction LaSalle's Invariance Principle Domain-specific

Parents (1) — more general patterns this builds on

  • LaSalle's Invariance Principle is a kind of Stability Prime

    Stability is the strict parent because the principle is a certificate for attraction and asymptotic stability of dynamical behavior.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

LaSalle's Invariance Principle sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08