Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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

[F1]

Stabilizability and detectability for continuous and discrete linear systems: stabilizability/detectability mean that some feedback/output injection makes the corresponding matrix Hurwitz.

[F2]

Standard CARE and DARE data, equations, and conventions: the scalar CARE residual is 2AX−GX2+Q and the closed loop is A−GX.

[F3]

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

1.1F1F2givenalgebra

First take A=C=R=1 and B=0. Then Q=1; every feedback leaves A−BK=1, so the pair is not stabilizable. The CARE is 2X+1=0, whose only root is X=−1/2; it is not positive semidefinite and its closed loop remains 1.

2.1F1F2F3step 1.1algebra∎

Next take A=B=R=1 and C=0, so Q=0. The pair is stabilizable, since K=2 gives A−BK=−1, but it is not detectable because A−LC=1 for every L. The CARE is 2X−X2=0, with positive-semidefinite roots X=0 and X=2; the first has unstable closed loop 1 and the second stable closed loop −1. Since Q=0, zero control has zero cost for every initial state, so the value is zero rather than the stabilizing root X=2. 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