Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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 K0, define the infinite exact recurrence, for every j≥0, by Aj=A−BKj,Aj∗Xj+XjAj=−(Q+Kj∗RKj),Kj+1=R−1B∗Xj. These exact Lyapunov solutions exist uniquely. Every closed loop Aj=A−BKj is Hurwitz, every exact Lyapunov matrix Xj is positive semidefinite, and Xj+1⪯Xj. The sequence converges to the unique stabilizing CARE solution X∗. Once j is sufficiently large, there is a finite constant C such that ∥Xj+1−X∗∥F≤C∥Xj−X∗∥F2. 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 K0, and the infinite exact Lyapunov recurrence in the Statement.

[F1]

Finite-budget exact or safeguarded inexact Newton-Kleinman policy iteration: Aj=A−BKj, Aj∗Xj+XjAj=−(Q+Kj∗RKj), and Kj+1=R−1B∗Xj.

[F2]

Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution: there is a unique Hermitian positive-semidefinite stabilizing solution X∗.

[F3]

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.

[F4]

A Hurwitz matrix exponential has a polynomial-exponential decay bound: a Hurwitz matrix exponential is bounded by a polynomial times a decaying exponential.

[F5]

Standard CARE and DARE data, equations, and conventions: G=BR−1B∗ and the CARE residual is A∗X+XA−XGX+Q.

Proof

1.1F1F3F5giveninductioncontradiction

Suppose Aj is Hurwitz. By [F3], the exact solution Xj of the policy Lyapunov equation is Xj=∫0∞etAj∗(Q+Kj∗RKj)etAj dt⪰0. For Δj=Kj+1−Kj, expansion using B∗Xj=RKj+1 gives Aj+1∗Xj+XjAj+1+Q+Kj+1∗RKj+1=−Δj∗RΔj. If Aj+1v=λv with Re⁡λ≥0, the quadratic form of the left side is 2Re⁡(λ)v∗Xjv+v∗Qv+(Kj+1v)∗R(Kj+1v)≥0, while the right side is nonpositive. Equality forces Kj+1v=0 and Δjv=0, hence Kjv=0 and Ajv=Av=λv, contradicting that Aj is Hurwitz. Starting from K0, induction proves every Aj Hurwitz and every Xj⪰0.

2.1F1F2F3step 1.1algebra

Subtracting the Lyapunov equations for Xj and Xj+1 after expressing both under Aj+1 gives Aj+1∗(Xj−Xj+1)+(Xj−Xj+1)Aj+1=−Δj∗RΔj. The Lyapunov integral [F3] therefore yields Xj−Xj+1⪰0. The decreasing sequence is bounded below by zero, so each quadratic form converges. Evaluating at ei, ei+ej, and ei+iej shows convergence of every matrix entry to a Hermitian limit X∞⪰0. Since Kj+1=R−1B∗Xj, the gains also converge. Passing to the limit in the policy Lyapunov equation gives the CARE for X∞; [F2] identifies this positive-semidefinite root as X∗.

3.1F1F2F3F4step 2.1algebra∎

Let Ej=Xj−X∗ and A∗=A−BR−1B∗X∗. Put Dj=Kj+1−K∗=R−1B∗Ej. Subtract the CARE identity at X∗ from the policy Lyapunov equation under Aj+1 to obtain Aj+1∗Ej+1+Ej+1Aj+1=−Dj∗RDj. By [F2], A∗ is Hurwitz. Choose W=∫0∞etA∗∗IetA∗ dt≻0 using [F3], so A∗∗W+WA∗=−I. Since Aj+1→A∗, for all large j one has Aj+1∗W+WAj+1⪯−12I. Along x˙=Aj+1x, differentiation gives ddt(x∗Wx)≤−12∥x∥22≤−12∥W∥2x∗Wx. Consequently ∥etAj+1∥2≤Me−αt with M=(∥W∥2/λmin⁡(W))1/2 and α=1/(4∥W∥2), uniformly for all sufficiently large j. Applying the Lyapunov integral to the error equation yields ∥Ej+1∥F≤(∫0∞M2e−2αt dt)∥R∥2∥R−1B∗∥22∥Ej∥F2. The integral is finite and supplies the stated local quadratic constant.

Depends on

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