Alphabeta Math
PropositionStatement: 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.

The stabilizing CARE solution is the Hamiltonian stable invariant graph

Statement

Let X⪰0 be the stabilizing CARE solution from Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution, let G=BR−1B∗, and define H=[A−G−Q−A∗],Ac=A−GX. Then H[IX]=[IX]Ac. Moreover, H has exactly n eigenvalues in the open left half-plane and n in the open right half-plane, none on the imaginary axis, and Ran⁡[IX] is its stable invariant subspace.

Facts & Assumptions

Given: The standard CARE data and the Hermitian positive-semidefinite stabilizing solution X.

[F1]

Stabilizability and detectability give the unique stabilizing positive-semidefinite CARE solution: Ac=A−GX is Hurwitz and A∗X+XA−XGX+Q=0.

[F2]

Standard CARE and DARE data, equations, and conventions: G=BR−1B∗ is Hermitian positive semidefinite and ∗ is the adjoint.

[F3]

The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks: the characteristic polynomial of a block-triangular matrix is the product of those of its diagonal blocks.

[F4]

For every finite-dimensional space, σF(T) is exactly the set of roots in F of χT: over C, eigenvalues are precisely the roots of the characteristic polynomial.

[F5]

Every nonconstant polynomial in C[x] splits into linear factors: each degree-n complex characteristic polynomial has n roots counted with algebraic multiplicity.

[F6]

Every finite-dimensional endomorphism over an algebraically closed field has Jordan form: generalized eigenspaces span the complex space and their dimensions equal the corresponding algebraic multiplicities.

Proof

1.1F1F2algebra

Block multiplication gives H[IX]=[A−GX−Q−A∗X]. By [F1], −Q−A∗X=XA−XGX=X(A−GX), proving the graph identity.

2.1F1F3F4F5F6step 1.1algebra∎

Set TX=[I0XI], whose inverse is [I0−XI]. Using [F1], TX−1HTX=[A−GX−G0−(A−GX)∗]. The eigenvalues of the first diagonal block lie in the open left half-plane by [F1]. If λ is a root of its characteristic polynomial, then −λ‾ is a root of the characteristic polynomial of −(A−GX)∗, since det⁡(−λ‾I+(A−GX)∗)=det⁡(−λI+(A−GX))‾=0; these reflected roots lie in the open right half-plane. By [F5] each diagonal characteristic polynomial has degree n and splits into n roots counted with algebraic multiplicity. The characteristic polynomial factorization [F3] and root/eigenvalue connection [F4] therefore give exactly n eigenvalues of H in each open half-plane and none on the imaginary axis. The first coordinate subspace is invariant and its restriction has the stable spectrum of A−GX. Any generalized eigenvector of the displayed triangular matrix for a stable eigenvalue has trailing component in the kernel of a power of (−(A−GX)∗−λI); that matrix is invertible because the trailing spectrum is in the open right half-plane, so the trailing component is zero. By [F6] these generalized eigenspaces have total dimension equal to the stable algebraic multiplicity n from [F5], so they fill the first coordinate subspace, which is therefore the stable invariant subspace. Applying TX maps it to Ran⁡[IX].

Depends on

Used by

Dependency tree · two levels

24 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