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.
Unstabilizable and undetectable unstable modes break the CARE conclusion
Example
Two scalar cases isolate the roles of continuous stabilizability and detectability for the CARE conclusion.
Facts & Assumptions
Given: The continuous definitions and CARE theorem of Stabilizability and detectability for continuous and discrete linear systems, Standard CARE and DARE data, equations, and conventions, and Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution.
Stabilizability and detectability for continuous and discrete linear systems: stabilizability/detectability mean that some feedback/output injection makes the corresponding matrix Hurwitz.
Standard CARE and DARE data, equations, and conventions: the scalar CARE residual is and the closed loop is .
Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution: under both hypotheses the CARE has exactly one positive-semidefinite solution and its closed loop is Hurwitz.
Proof
First take and . Then ; every feedback leaves , so the pair is not stabilizable. The CARE is , whose only root is ; it is not positive semidefinite and its closed loop remains .
Next take and , so . The pair is stabilizable, since gives , but it is not detectable because for every . The CARE is , with positive-semidefinite roots and ; the first has unstable closed loop and the second stable closed loop . Since , zero control has zero cost for every initial state, so the value is zero rather than the stabilizing root . Thus without detectability uniqueness among PSD roots and the stabilizing value conclusion in [F3] fail.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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)