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 be the stabilizing DARE solution, , and Then The pencil 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 is singular, and is its stable deflating graph.
Facts & Assumptions
Given: The DARE data and stabilizing solution from Stabilizability and detectability give the unique stabilizing positive-semidefinite DARE solution.
Stabilizability and detectability give the unique stabilizing positive-semidefinite DARE solution: , , and is Schur stable.
Standard CARE and DARE data, equations, and conventions: and the DARE residual is .
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.
Regular matrix pencils and homogeneous generalized eigenvalues: a square pencil is regular when its homogeneous determinant is not the zero polynomial.
For same-sized finite square matrices over a commutative ring, : determinants multiply under finite square matrix products, so the determinant is unchanged by the determinant-one shears used below.
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.
The homogeneous determinant factors across a block upper triangular pencil: the homogeneous determinant of a block upper-triangular pencil factors across its diagonal blocks.
For every finite-dimensional space, is exactly the set of roots in of : finite eigenvalues of a matrix are exactly the roots of its characteristic polynomial.
Every nonconstant polynomial in splits into linear factors: each complex characteristic polynomial of degree has roots counted with algebraic multiplicity.
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
The matrix is invertible. Indeed, if , multiplication by gives Both summands are nonnegative. By [F3], implies , and the original equation then gives . Also by [F1]. The identity is verified by multiplying the right side by : the extra term is , since . Therefore .
The DARE and the identity in step 1.1 imply . Consequently, This proves the deflating graph identity.
Put and . By [F6] both are block triangular with identity diagonal and determinant one. For arbitrary homogeneous coordinates , The lower-left block vanishes by ; the lower-right block uses and . Taking determinants and using [F5] and [F7] gives The first homogeneous factor has roots, counted with multiplicity; all are finite and equal to eigenvalues of , hence strictly inside the disk by [F1] and [F8]. The roots of are the conjugates of those of , since ; hence each nonzero eigenvalue of has modulus less than one. The second factor has roots, counted with multiplicity: each finite root is the reciprocal of a nonzero eigenvalue of and therefore has modulus greater than one, while every zero eigenvalue of contributes a root at , 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, is invertible by step 1.1, so has full column rank. A Jordan basis of from [F10], together with from step 2.1, shows that the graph carries all stable finite root chains; the determinant factorization shows there are exactly stable roots in total, so this is the stable deflating graph. This uses no inverse of .
Depends on
- Stabilizability and detectability give the unique stabilizing positive-semidefinite DARE solution
- Standard CARE and DARE data, equations, and conventions
- Regular matrix pencils and homogeneous generalized eigenvalues
- A non-negative operator has a unique non-negative square root
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- The determinant of a triangular matrix is the product of its diagonal entries
- The homogeneous determinant factors across a block upper triangular pencil
- For every finite-dimensional space, $\sigma_F(T)$ is exactly the set of roots in $F$ of $\chi_T$
- Every nonconstant polynomial in $\mathbb C[x]$ splits into linear factors
- Every finite-dimensional endomorphism over an algebraically closed field has Jordan form
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
- Federico Poloni, Lecture notes on Riccati-type matrix equations (standard reference, not scraped)
- A.A. Stoorvogel and A. Saberi, The discrete algebraic Riccati equation and linear matrix inequality, Memorandum COSOR 94-16 (standard reference, not scraped)