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 DARE solution is the stable deflating graph of a regular symplectic pencil

Statement

Let X⪰0 be the stabilizing DARE solution, G=BR−1B∗, and N=[A0−QI],M=[IG0A∗],Ac=A−B(R+B∗XB)−1B∗XA. Then N[IX]=M[IX]Ac. The pencil (N,M) is regular. Its homogeneous determinant has n roots strictly inside the unit disk and n roots strictly outside the closed unit disk, with infinite roots counted in the latter group. Thus it has no unit-circle roots, even if A is singular, and Ran⁡[IX] is its stable deflating graph.

Facts & Assumptions

[F1]

Stabilizability and detectability give the unique stabilizing positive-semidefinite DARE solution: X=X∗⪰0, S=R+B∗XB≻0, and Ac=A−BS−1B∗XA is Schur stable.

[F2]

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

[F3]

A non-negative operator has a unique non-negative square root: each finite-dimensional non-negative self-adjoint matrix has a non-negative square root.

[F4]

Regular matrix pencils and homogeneous generalized eigenvalues: a square pencil is regular when its homogeneous determinant is not the zero polynomial.

[F5]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): determinants multiply under finite square matrix products, so the determinant is unchanged by the determinant-one shears used below.

[F6]

The determinant of a triangular matrix is the product of its diagonal entries: the determinant of a triangular matrix is the product of its diagonal entries; in particular, the two unit-triangular shears below have determinant one.

[F7]

The homogeneous determinant factors across a block upper triangular pencil: the homogeneous determinant of a block upper-triangular pencil factors across its diagonal blocks.

[F8]

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

[F9]

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

[F10]

Every finite-dimensional endomorphism over an algebraically closed field has Jordan form: generalized eigenvectors span a complex finite-dimensional space, with total dimension counted by algebraic multiplicity.

Proof

1.1F1F2F3algebra

The matrix I+GX is invertible. Indeed, if (I+GX)v=0, multiplication by v∗X gives v∗Xv+(Xv)∗G(Xv)=0. Both summands are nonnegative. By [F3], v∗Xv=0 implies Xv=0, and the original equation then gives v=0. Also S=R+B∗XB≻0 by [F1]. The identity (I+GX)−1=I−BS−1B∗X is verified by multiplying the right side by I+GX: the extra term is B[R−1−S−1−S−1(B∗XB)R−1]B∗X=0, since S=R+B∗XB. Therefore Ac=(I+GX)−1A.

2.1F1F2step 1.1algebra

The DARE and the identity in step 1.1 imply X−Q=A∗X(I+GX)−1A=A∗XAc. Consequently, N[IX]=[AX−Q]=[I+GXA∗X]Ac=M[IX]Ac. This proves the deflating graph identity.

3.1F1F4F5F6F7F8F9F10step 1.1step 2.1algebra∎

Put TX=[I0XI] and LX=[I0−A∗X(I+GX)−1I]. By [F6] both are block triangular with identity diagonal and determinant one. For arbitrary homogeneous coordinates [α:β], LX(βN−αM)TX=[(I+GX)(βAc−αI)−αG0βI−αAc∗]. The lower-left block vanishes by X−Q=A∗XAc; the lower-right block uses (I+GX)−1G=G(I+XG)−1 and I−X(I+GX)−1G=(I+XG)−1. Taking determinants and using [F5] and [F7] gives det⁡(βN−αM)=det⁡(I+GX)det⁡(βAc−αI)det⁡(βI−αAc∗). The first homogeneous factor has n roots, counted with multiplicity; all are finite and equal to eigenvalues of Ac, hence strictly inside the disk by [F1] and [F8]. The roots of Ac∗ are the conjugates of those of Ac, since det⁡(μI−Ac∗)=det⁡(μ‾I−Ac)‾; hence each nonzero eigenvalue of Ac∗ has modulus less than one. The second factor has n roots, counted with multiplicity: each finite root is the reciprocal of a nonzero eigenvalue of Ac∗ and therefore has modulus greater than one, while every zero eigenvalue of Ac∗ contributes a root at β=0, which is infinite. The root counts follow from [F9], with finite eigenvalues identified by [F8]. Neither factor vanishes on ∣α∣=∣β∣, so the pencil is regular with the stated root split. The homogeneous determinant is invariant under these transforms because [F5] gives multiplicativity and both shear determinants equal one by [F6]. Finally, (I+GX) is invertible by step 1.1, so M[I;X] has full column rank. A Jordan basis of Ac from [F10], together with N[I;X]=M[I;X]Ac from step 2.1, shows that the graph carries all n stable finite root chains; the determinant factorization shows there are exactly n stable roots in total, so this is the stable deflating graph. This uses no inverse of A.

Depends on

Used by

Dependency tree · two levels

31 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