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.
Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution
Statement
Let , , , , , and . Assume is continuously stabilizable and is continuously detectable, using Stabilizability and detectability for continuous and discrete linear systems. Then the CARE of Standard CARE and DARE data, equations, and conventions has exactly one Hermitian positive-semidefinite solution . Its closed-loop matrix is Hurwitz, and for every initial state the infinite-horizon value is attained by . Controls are locally square-integrable and states are locally absolutely continuous solutions of . A finite value also forces the terminal term to tend to zero; this transversality is proved below.
Facts & Assumptions
Given: The finite matrices in the statement, continuous stabilizability/detectability, , , and locally square-integrable controls.
Stabilizability and detectability for continuous and discrete linear systems: stabilizability/detectability mean existence of a Hurwitz state-feedback or output-injection matrix.
Standard CARE and DARE data, equations, and conventions: and the CARE residual is .
Picard-Lindelöf local existence and uniqueness for first-order systems: a locally Lipschitz finite-dimensional ODE vector field has a unique local IVP solution.
Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: the local solution has a unique maximal interval; any solution through the same data is its restriction.
A Hurwitz matrix exponential has a polynomial-exponential decay bound: if is Hurwitz then has a bound by a polynomial times for some .
Linear matrix ODEs have unique global solutions on a fixed interval: for a continuous real matrix coefficient on a compact interval, every homogeneous linear matrix IVP has a unique solution throughout that interval.
Proof
By [F3], exists and , since . Regard the Hermitian matrices as a finite-dimensional real vector space and solve the initial-value problem Its polynomial vector field is locally Lipschitz: on each bounded matrix ball, expanding the quadratic difference gives , which is bounded linearly in . Thus [F4] and [F5] give a unique maximal solution. The adjoint satisfies the same IVP, so uniqueness makes on its interval.
Fix in this interval and let follow any admissible control on . Put . Differentiating and substituting the ODE gives Integrating, using , yields The candidate feedback makes , whose coefficient is continuous on . If , [F7] gives its unique solution on the interval. If , write in real and imaginary parts and replace the coefficient by ; [F7] applies to this continuous real system, and its solution is exactly the complex feedback trajectory. Thus is admissible and makes the last integral zero, so is the finite-horizon value and .
By stabilizability [F1], choose with Hurwitz. Under , [F6] bounds by a square-integrable polynomial-exponential multiple of . The control has the same property, so its cost on is at most for one finite independent of . Step 2.1 therefore gives . If the maximal interval ended at finite , the polynomial ODE field would be bounded on this bounded range, so would be bounded and every entry of would have a finite limit as . Applying [F4] at that limiting matrix extends the solution past , contradicting maximality [F5]. Hence exists for every .
For , every control on has nonnegative cost after ; its restriction to costs at least by step 2.1. Taking infima gives . Together with the bound in step 3.1, each quadratic form increases to a finite limit. Applying this to the coordinate vectors and their pairwise sums shows every matrix entry converges to a Hermitian limit .
Let . By step 4.1 and continuity, . If , polarization gives a vector with . Then the derivative of the convergent scalar function tends to a nonzero real number, so it is eventually bounded away from zero with constant sign; integration contradicts its convergence. Thus , so solves the CARE.
Set and . The CARE gives . Along , integration over gives The Cholesky factor is invertible by [F3], so controls by the finite operator norm of . Hence .
By detectability [F1], choose with Hurwitz. Then , where . Since is locally absolutely continuous, is locally integrable and the product rule gives almost everywhere. Integrating this identity from to and multiplying by proves . From [F6], there are with after absorbing the finite polynomial factor into a smaller exponential rate. The initial term tends to zero. For the integral, split at a fixed : the portion tends to zero as ; by Cauchy–Schwarz the tail is at most , which tends to zero as . Thus . Since this holds for every initial state, no eigenvalue of can have nonnegative real part: an eigenvector for such an eigenvalue would not decay. Therefore is Hurwitz.
For any admissible control of finite infinite-horizon cost, . Repeating the stable-convolution argument in step 7.1 gives . The same square-completion identity as step 2.1, now with constant , yields Taking gives . The feedback in step 6.1 has and , hence attains equality.
Let be any other CARE solution. Repeating steps 6.1–7.1 with proves is Hurwitz. Subtracting the CAREs and using gives . Hence the derivative of is zero, so this matrix equals for every . Both exponential factors tend to zero by [F6], forcing . Thus is the unique positive-semidefinite solution, and in particular the unique stabilizing one.
Depends on
- Stabilizability and detectability for continuous and discrete linear systems
- Standard CARE and DARE data, equations, and conventions
- A Hurwitz matrix exponential has a polynomial-exponential decay bound
- 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
- A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique
- Linear matrix ODEs have unique global solutions on a fixed interval
Used by
- Unstabilizable and undetectable unstable modes break the CARE conclusion Example
- Riccati residual sensitivity and invariant graph conditioning retain spectral separation Proposition
- The stabilizing CARE solution is the Hamiltonian stable invariant graph Proposition
- A CARE residual and Lyapunov margin certify a unique stabilizing root in a matrix ball Theorem
- Exact Newton-Kleinman iteration preserves stability, decreases cost matrices, and converges quadratically locally Theorem
Dependency tree · two levels
35 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
- Daniel Liberzon, Calculus of Variations and Optimal Control Theory: A Concise Introduction, Chapter 6 (standard reference, not scraped)
- Peter Benner and Lihong Feng, Model Reduction for Dynamical Systems, Lecture 8 (standard reference, not scraped)