Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 Hurwitz Lyapunov integral is the unique solution and has the stated positivity

Statement

Let A∈Fn×n be Hurwitz and let Q=Q∗∈Fn×n. Then the improper matrix integral

X=∫0∞etAQetA∗ dt

converges and is the unique solution of AX+XA∗+Q=0. If Q⪰0, then X⪰0. If Q≻0, then X≻0. For Q⪰0, X≻0 if and only if there is no nonzero v for which etA∗v∈ker⁡Q1/2 for every t≥0.

Facts & Assumptions

Given: A Hurwitz matrix A, a self-adjoint matrix Q, and the definitions of Q⪰0 and Q≻0 from Hurwitz matrices and the continuous Lyapunov equation.

[F1]

A Hurwitz matrix exponential has a polynomial-exponential decay bound: ∥etA∥2≤e−αt∑k=0n−1(t∥N∥2)k/k! for some α>0.

[F2]

The exponential series of a bounded operator: ddtetA=AetA=etAA, and the same formula applies to A∗.

[F3]

A non-negative operator has a unique non-negative square root: A non-negative finite-dimensional self-adjoint operator has a unique non-negative square root Q1/2 with (Q1/2)2=Q.

[F4]

The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices: ∥M∥F2 is the sum of squared absolute values of the entries of M.

[F5]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: A finite-dimensional matrix has a singular value decomposition, and its adjoint has the same positive singular values.

Proof

1.1F4F5F6algebra

Put M(t)=etA. For finite matrices P,R, ∥PR∥F2=∑j∥PRej∥22≤∥P∥22∑j∥Rej∥22=∥P∥22∥R∥F2 by the operator-norm definition and [F4]. The entry formula in [F4] gives ∥R∗∥F=∥R∥F. The SVD in [F5] gives the same positive singular values for P and P∗; [F6] therefore gives ∥P∗∥2=∥P∥2. Applying the left-multiplication estimate to adjoints yields ∥RP∥F≤∥R∥F∥P∥2. Applying these inequalities successively gives ∥M(t)QM(t)∗∥F≤∥M(t)∥22∥Q∥F.

1.2F2algebra

For XT=∫0TM(t)QM(t)∗ dt, [F2] and the product rule give ddt(M(t)QM(t)∗)=AM(t)QM(t)∗+M(t)QM(t)∗A∗. Integrating this identity yields AXT+XTA∗=M(T)QM(T)∗−Q.

2.1F1step 1.1algebra

By [F1], the right side in step 1.1 is bounded by a finite sum of polynomial multiples of e−2αt. Each such term is integrable on [0,∞) by repeated integration by parts. Every entry of the integrand is therefore absolutely integrable; define X by the finitely many scalar improper entry integrals. The entrywise tails tend to zero, so XT→X in Frobenius norm and the matrix integral converges absolutely in that norm. The integrand is self-adjoint because Q=Q∗.

3.1F1step 2.1step 1.2algebra

By [F1], M(T)QM(T)∗→0 as T→∞, and by step 2.1, XT→X. Taking limits in step 1.2 gives AX+XA∗=−Q.

3.2F3F4step 2.1algebra

Suppose Q⪰0. By [F3], Q1/2 exists and is self-adjoint, so Q=(Q1/2)∗Q1/2. Hence for every v, v∗Xv=∫0∞∥Q1/2etA∗v∥22 dt≥0. Thus X⪰0. If Q≻0 and v≠0, the integrand at t=0 is v∗Qv>0 and is continuous, so it stays positive on an interval of positive length; therefore v∗Xv>0 and X≻0.

4.1F1F2step 3.1algebra

If Y is another solution, H=Y−X satisfies AH+HA∗=0. The derivative of M(t)HM(t)∗ is therefore zero by [F2], so it is constant and equals H at t=0. By [F1] it tends to zero as t→∞, hence H=0 and the solution is unique.

5.1F3step 3.2algebra∎

For Q⪰0 and nonzero v, the continuous integrand in step 3.2 has integral zero exactly when it vanishes for all t≥0: if it were positive at one time, continuity would make its integral over a neighboring interval positive. It vanishes at time t exactly when etA∗v∈ker⁡Q1/2. Hence v∗Xv>0 for every nonzero v exactly when no nonzero trajectory remains in that kernel for all t≥0.

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