Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution

Statement

Let A∈Fn×n, B∈Fn×m, C∈Fp×n, R=R∗≻0, Q=C∗C, and G=BR−1B∗. Assume (A,B) is continuously stabilizable and (A,C) 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 X. Its closed-loop matrix Ac=A−GX is Hurwitz, and for every initial state x0 the infinite-horizon value inf⁡u∫0∞(x(t)∗Qx(t)+u(t)∗Ru(t)) dt=x0∗Xx0 is attained by u(t)=−R−1B∗Xx(t). Controls are locally square-integrable and states are locally absolutely continuous solutions of x˙=Ax+Bu. A finite value also forces the terminal term x(T)∗Xx(T) to tend to zero; this transversality is proved below.

Facts & Assumptions

Given: The finite matrices in the statement, continuous stabilizability/detectability, R≻0, Q=C∗C, and locally square-integrable controls.

[F1]

Stabilizability and detectability for continuous and discrete linear systems: stabilizability/detectability mean existence of a Hurwitz state-feedback or output-injection matrix.

[F2]

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

[F4]

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.

[F5]

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.

[F6]

A Hurwitz matrix exponential has a polynomial-exponential decay bound: if M is Hurwitz then etM has a bound by a polynomial times e−αt for some α>0.

[F7]

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

1.1F2F3F4F5algebra

By [F3], R−1 exists and G=G∗⪰0, since v∗Gv=(B∗v)∗R−1(B∗v)≥0. Regard the Hermitian matrices as a finite-dimensional real vector space and solve the initial-value problem P′(s)=A∗P(s)+P(s)A−P(s)GP(s)+Q,P(0)=0. Its polynomial vector field is locally Lipschitz: on each bounded matrix ball, expanding the quadratic difference gives PGP−HGH=(P−H)GP+HG(P−H), which is bounded linearly in ∥P−H∥F. Thus [F4] and [F5] give a unique maximal solution. The adjoint P(s)∗ satisfies the same IVP, so uniqueness makes P(s)=P(s)∗ on its interval.

2.1F2F7step 1.1algebra

Fix T in this interval and let x follow any admissible control on [0,T]. Put S(t)=P(T−t). Differentiating x(t)∗S(t)x(t) and substituting the ODE gives x∗Qx+u∗Ru+ddt(x∗Sx)=(u+R−1B∗Sx)∗R(u+R−1B∗Sx). Integrating, using P(0)=0, yields JT(u)=x0∗P(T)x0+∫0T(u+R−1B∗Sx)∗R(u+R−1B∗Sx) dt. The candidate feedback makes x˙=(A−GS(t))x, whose coefficient is continuous on [0,T]. If F=R, [F7] gives its unique solution on the interval. If F=C, write x in real and imaginary parts and replace the coefficient M by [Re⁡M−Im⁡MIm⁡MRe⁡M]; [F7] applies to this continuous real system, and its solution is exactly the complex feedback trajectory. Thus u=−R−1B∗Sx is admissible and makes the last integral zero, so x0∗P(T)x0 is the finite-horizon value and P(T)⪰0.

3.1F1F4F5F6step 2.1

By stabilizability [F1], choose K0 with A0=A−BK0 Hurwitz. Under u=−K0x, [F6] bounds x(t)=etA0x0 by a square-integrable polynomial-exponential multiple of ∥x0∥. The control K0x(t) has the same property, so its cost on [0,T] is at most c∥x0∥2 for one finite c independent of T. Step 2.1 therefore gives 0⪯P(T)⪯cI. If the maximal interval ended at finite T∗, the polynomial ODE field would be bounded on this bounded range, so P′(s) would be bounded and every entry of P(s) would have a finite limit as s↑T∗. Applying [F4] at that limiting matrix extends the solution past T∗, contradicting maximality [F5]. Hence P exists for every s≥0.

4.1step 2.1step 3.1algebra

For T2>T1, every control on [0,T2] has nonnegative cost after T1; its restriction to [0,T1] costs at least x0∗P(T1)x0 by step 2.1. Taking infima gives P(T2)⪰P(T1). Together with the bound in step 3.1, each quadratic form v∗P(T)v increases to a finite limit. Applying this to the coordinate vectors and their pairwise sums shows every matrix entry converges to a Hermitian limit X⪰0.

5.1F2step 4.1algebracontradiction

Let Φ(P)=A∗P+PA−PGP+Q. By step 4.1 and continuity, P′(T)=Φ(P(T))→Φ(X). If Φ(X)≠0, polarization gives a vector v with v∗Φ(X)v≠0. Then the derivative of the convergent scalar function v∗P(T)v tends to a nonzero real number, so it is eventually bounded away from zero with constant sign; integration contradicts its convergence. Thus Φ(X)=0, so X solves the CARE.

6.1F2F3step 5.1algebra

Set K=R−1B∗X and Ac=A−BK=A−GX. The CARE gives Ac∗X+XAc=−Q−K∗RK. Along x˙=Acx, integration over [0,T] gives ∫0T(∥Cx(t)∥22+u(t)∗Ru(t)) dt=x0∗Xx0−x(T)∗Xx(T)≤x0∗Xx0. The Cholesky factor R=LL∗ is invertible by [F3], so u∗Ru=∥L∗u∥22 controls ∥u∥22 by the finite operator norm of L−∗. Hence Cx,u∈L2(0,∞).

7.1F1F6step 6.1algebracontradiction

By detectability [F1], choose L with Ao=A−LC Hurwitz. Then x˙=Aox+w, where w=Bu+LCx∈L2. Since x is locally absolutely continuous, w is locally integrable and the product rule gives ddt(e−tAox(t))=e−tAow(t) almost everywhere. Integrating this identity from 0 to t and multiplying by etAo proves x(t)=etAox0+∫0te(t−s)Aow(s) ds. From [F6], there are M,α>0 with ∥etAo∥2≤Me−αt after absorbing the finite polynomial factor into a smaller exponential rate. The initial term tends to zero. For the integral, split at a fixed S: the portion 0≤s≤S tends to zero as t→∞; by Cauchy–Schwarz the tail is at most M(2α)−1/2∥w∥L2(S,∞), which tends to zero as S→∞. Thus x(t)→0. Since this holds for every initial state, no eigenvalue of Ac can have nonnegative real part: an eigenvector for such an eigenvalue would not decay. Therefore Ac is Hurwitz.

8.1F1F2F3step 2.1step 6.1step 7.1algebra

For any admissible control of finite infinite-horizon cost, u,Cx∈L2. Repeating the stable-convolution argument in step 7.1 gives x(T)→0. The same square-completion identity as step 2.1, now with constant S=X, yields JT(u)=x0∗Xx0−x(T)∗Xx(T)+∫0T(u+Kx)∗R(u+Kx) dt. Taking T→∞ gives J∞(u)≥x0∗Xx0. The feedback in step 6.1 has u+Kx=0 and x(T)→0, hence attains equality.

9.1F2F6step 6.1step 7.1algebra∎

Let Y⪰0 be any other CARE solution. Repeating steps 6.1–7.1 with Y proves AY=A−GY is Hurwitz. Subtracting the CAREs and using XGX−YGY=PG(X−Y)+(X−Y)GYwith P=X gives Ac∗(X−Y)+(X−Y)AY=0. Hence the derivative of etAc∗(X−Y)etAY is zero, so this matrix equals X−Y for every t≥0. Both exponential factors tend to zero by [F6], forcing X−Y=0. Thus X is the unique positive-semidefinite solution, and in particular the unique stabilizing one.

Depends on

Used by

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