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.
Exact Newton-Kleinman iteration preserves stability, decreases cost matrices, and converges quadratically locally
Statement
Assume the continuous stabilizability and detectability hypotheses of Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution. From a supplied stabilizing , define the infinite exact recurrence, for every , by These exact Lyapunov solutions exist uniquely. Every closed loop is Hurwitz, every exact Lyapunov matrix is positive semidefinite, and . The sequence converges to the unique stabilizing CARE solution . Once is sufficiently large, there is a finite constant such that Every successful exact update of Finite-budget exact or safeguarded inexact Newton-Kleinman policy iteration agrees with this recurrence, so a finite call returns only a prefix, possibly shortened by a solver failure. Convergence and the eventual quadratic estimate concern the infinite recurrence; no such guarantee is asserted for arbitrary inexact solves.
Facts & Assumptions
Given: Continuous CARE data, continuous stabilizability/detectability, a stabilizing , and the infinite exact Lyapunov recurrence in the Statement.
Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution: there is a unique Hermitian positive-semidefinite stabilizing solution .
The Hurwitz Lyapunov integral is the unique solution and has the stated positivity: a Hurwitz Lyapunov equation with positive-semidefinite forcing has its unique positive-semidefinite integral solution.
A Hurwitz matrix exponential has a polynomial-exponential decay bound: a Hurwitz matrix exponential is bounded by a polynomial times a decaying exponential.
Standard CARE and DARE data, equations, and conventions: and the CARE residual is .
Proof
Suppose is Hurwitz. By [F3], the exact solution of the policy Lyapunov equation is For , expansion using gives If with , the quadratic form of the left side is while the right side is nonpositive. Equality forces and , hence and , contradicting that is Hurwitz. Starting from , induction proves every Hurwitz and every .
Subtracting the Lyapunov equations for and after expressing both under gives The Lyapunov integral [F3] therefore yields . The decreasing sequence is bounded below by zero, so each quadratic form converges. Evaluating at , , and shows convergence of every matrix entry to a Hermitian limit . Since , the gains also converge. Passing to the limit in the policy Lyapunov equation gives the CARE for ; [F2] identifies this positive-semidefinite root as .
Let and . Put . Subtract the CARE identity at from the policy Lyapunov equation under to obtain By [F2], is Hurwitz. Choose using [F3], so . Since , for all large one has . Along , differentiation gives Consequently with and , uniformly for all sufficiently large . Applying the Lyapunov integral to the error equation yields The integral is finite and supplies the stated local quadratic constant.
Depends on
- Finite-budget exact or safeguarded inexact Newton-Kleinman policy iteration
- Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution
- The Hurwitz Lyapunov integral is the unique solution and has the stated positivity
- A Hurwitz matrix exponential has a polynomial-exponential decay bound
- Standard CARE and DARE data, equations, and conventions
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Peter Benner and Lihong Feng, Model Reduction for Dynamical Systems, Lecture 8 (standard reference, not scraped)
- Daniel Liberzon, Calculus of Variations and Optimal Control Theory: A Concise Introduction, Chapter 6 (standard reference, not scraped)