Alphabeta Math
Pipeline-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.

Sylvester and lyapunov matrix equations

1 · Prerequisites

2 · Summary

This page develops the equation AX+XB=C over the real and complex fields, its Kronecker representation, the spectral criterion for unique solvability, and the Frobenius separation that controls solution error. The finite-budget Bartels-Stewart procedure applies Schur reduction and block back substitution, reports pivot or Schur-certificate failures explicitly, and has a cubic dense arithmetic bound when its sweep budgets grow at most linearly with dimension and per-call sign/representation-controller work is bounded independently of dimension. Arbitrary terminating custom controls retain their actual additional work term.

For Hurwitz A, the continuous Lyapunov equation AX+XA∗+Q=0 has its exponential-integral solution. The page proves convergence, uniqueness, positive-semidefinite and strict-positivity conditions, and the low-rank ADI residual identity. ADI convergence is concluded only under a proved rational shift bound. The Bartels-Stewart exact-correctness claim is conditional on exact Schur certificates and successful separated block solves; the finite computed Schur routine does not itself promise unconditional convergence or an unconditional backward-error certificate.

Separate property results prove finite ADI shift-list processing and Bartels–Stewart status termination. Successful exact local pivot checks imply uniqueness by homogeneous block substitution, supplying the Schur–Parlett recurrence without an unestablished spectral premise. Real-data nonreal ADI shifts are validated as consecutive conjugate pairs while every individual recurrence is preserved.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum

Statement

Let F be R or C, let m,n≥1, let A∈Fm×m, B∈Fn×n, and let X=[x1 ⋯ xn]∈Fm×n. Define vec⁡(X) by stacking the columns x1,…,xn. For compatible matrices, define P⊗Q as the block matrix whose (i,j) block is pijQ. Then

∥vec⁡(X)∥2=∥X∥F,vec⁡(AX+XB)=(In⊗A+BT⊗Im)vec⁡(X).

Facts & Assumptions

Given: The dimensions and matrices in the statement.

[F1]

The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices: ∥X∥F2=∑i=1m∑j=1n∣xij∣2.

Proof

1.1givenF1algebra

By the definition of column stacking, ∥vec⁡(X)∥22=∑j=1n∑i=1m∣xij∣2=∥X∥F2 by [F1]. Both sides are nonnegative, so taking square roots proves the isometry claim.

1.2givenalgebra

The jth block of (In⊗A)vec⁡(X) is Axj, which is the jth column of AX. Hence vec⁡(AX)=(In⊗A)vec⁡(X).

1.3givenalgebra

The jth column of XB is ∑ℓ=1nbℓjxℓ. The jth block of (BT⊗Im)vec⁡(X) is the same sum because its (j,ℓ) block is bℓjIm. Thus vec⁡(XB)=(BT⊗Im)vec⁡(X).

2.1step 1.2step 1.3algebra∎

Adding the identities in steps 1.2 and 1.3 gives the displayed Sylvester-map representation, completing both claims.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A determinant and Frobenius norm give a certified lower bound for small-block separation

Statement

Let F∈{R,C}, q≥1, and M∈Fq×q. Define

δ(M)={0,∥M∥F=0,∣det⁡M∣∥M∥Fq−1,∥M∥F>0.

With the empty product convention when q=1, 0≤δ(M)≤σmin⁡(M).

Facts & Assumptions

Given: A finite square matrix M over R or C.

[F1]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: There are orthonormal bases on the domain and codomain and singular values s1≥⋯≥sr>0, with zeros appended to length q, giving M=Udiag⁡(s1,…,sq)V∗ for unitary U,V.

[F3]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): det⁡(AB)=det⁡(A)det⁡(B) for square matrices over a commutative ring.

[F5]

The determinant of a triangular matrix is the product of its diagonal entries: the determinant of a diagonal matrix is the product of its diagonal entries.

Proof

1.1givenF1

If M=0, then δ(M)=0=σmin⁡(M) by the definition and the singular values in [F1].

1.2F1F2F3F4F5choosealgebra

Suppose M≠0 and choose singular values s1≥⋯≥sq≥0 from [F1], with M=Udiag⁡(s1,…,sq)V∗ for unitary U,V. By [F3], det⁡(M)=det⁡(U)det⁡(diag⁡(s1,…,sq))det⁡(V∗); [F4] gives ∣det⁡(U)∣=∣det⁡(V∗)∣=1, and [F5] gives det⁡(diag⁡(s1,…,sq))=∏i=1qsi. Thus ∣det⁡M∣=∏i=1qsi. By [F2], every si≤∥M∥F; hence ∣det⁡M∣≤sq∥M∥Fq−1.

2.1step 1.2algebra∎

Since sq=σmin⁡(M) and ∥M∥F>0, divide the inequality in step 1.2 by ∥M∥Fq−1 to obtain δ(M)≤σmin⁡(M). The lower bound δ(M)≥0 follows from its definition.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Hurwitz matrices and the continuous Lyapunov equation

Definition

Let F∈{R,C}, n≥1, and A∈Fn×n. The matrix A is Hurwitz if, when its eigenvalues are considered over C, every eigenvalue has strictly negative real part. For Q,X∈Fn×n with Q=Q∗, the continuous Lyapunov equation with coefficient A and forcing Q is

AX+XA∗+Q=0.

Here ∗ is transpose for real matrices and conjugate transpose for complex matrices. The notations Q⪰0 and Q≻0 mean that Q is non-negative or positive as a self-adjoint operator in the sense of Non-negative and positive operators: respectively v∗Qv≥0 for all v, or v∗Qv>0 for every nonzero v.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The adjugate gives an explicit inverse formula over a field

Statement

Let F be a field, q≥1, and M∈Fq×q. Let adj⁡(M) be the adjugate defined by the cofactors of Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring. Then

Madj⁡(M)=det⁡(M)Iq.

Consequently, when det⁡(M)≠0, M−1=adj⁡(M)/det⁡(M); when det⁡(M)=0, M is singular.

Facts & Assumptions

Given: A field F, positive integer q, and matrix M∈Fq×q.

[F1]

Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring: Rows and columns are indexed by 0,…,q−1; Cjk(M)=(−1)j+kdet⁡(M(j,k)) and adj⁡(M)=cof⁡(M)T, with the 0×0 determinant equal to 1 when q=1.

[F2]

Laplace expansion computes the determinant along every row and every column over a commutative ring: With zero-based indices, expanding along row j gives det⁡(M)=∑k=0q−1mjkCjk(M).

[F4]

A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero: A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero.

Proof

1.1F1algebra

For 0≤i,j<q, [F1] makes the (i,j) entry of Madj⁡(M) equal to ∑k=0q−1mikCjk(M).

2.1F2F3step 1.1algebra

If i=j, this sum is det⁡(M) by [F2]. If i≠j, let M′ be obtained by replacing row j of M with row i. Deleting row j leaves each cofactor unchanged, so expansion of det⁡(M′) along row j gives the sum in step 1.1. The matrix M′ has equal rows i and j, so [F3] makes that determinant zero. Thus every diagonal entry of Madj⁡(M) is det⁡(M) and every off-diagonal entry is zero.

3.1F4step 2.1algebra∎

If det⁡(M)≠0, [F4] gives M−1, and multiplying the identity in step 2.1 on the left by M−1/det⁡(M) gives adj⁡(M)/det⁡(M)=M−1. If det⁡(M)=0, [F4] says M is not invertible, which is exactly singularity for a square matrix.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Sylvester operator and Frobenius separation number

Definition

For F∈{R,C}, A∈Fm×m, B∈Fn×n with m,n≥1, define the Sylvester operator SA,B:Fm×n→Fm×n by

SA,B(X)=AX+XB.

Equip Fm×n with the Frobenius norm of The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices. The column-vectorization isometry of Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum identifies this norm with the Euclidean norm on Fmn. Define

sep⁡(A,−B):=σmin⁡(SA,B)=min⁡∥X∥F=1∥AX+XB∥F.

Here σmin⁡ denotes the smallest singular value of the finite-dimensional linear map under these inner products. The finite-dimensional singular value decomposition Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition ensures this minimum is well-defined. The argument −B is part of the conventional label: the operator being measured is X↦AX+XB.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A Hurwitz matrix exponential has a polynomial-exponential decay bound

Statement

Let A∈Cn×n be Hurwitz, let α=−max⁡{Re⁡λ:λ∈σ(A)}>0, and write etA=∑k=0∞tkAk/k!. If A=UTU∗ is a unitary Schur triangularization and T=D+N with D diagonal and N strictly upper triangular, then for every t≥0,

∥etA∥2≤e−αt∑k=0n−1(t∥N∥2)kk!.

For real Hurwitz A, the same bound holds for its real matrix exponential, with the complex operator norm of its realification equal to the real one.

Facts & Assumptions

Given: A finite-dimensional real or complex matrix A whose eigenvalues all have negative real part.

[F1]

Hurwitz matrices and the continuous Lyapunov equation: Hurwitz means every complex eigenvalue has strictly negative real part.

[F2]

If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular: Over C, a finite-dimensional endomorphism has an orthonormal basis in which it is upper triangular.

[F3]

The exponential series of a bounded operator: In a Banach space, the norm-convergent exponential series satisfies (etM)′=MetM=etMM.

[F4]

Every finite-dimensional normed space is Banach: Every finite-dimensional normed space is complete.

[F6]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: For compatible finite-dimensional maps, ∥ST∥2≤∥S∥2∥T∥2.

[F7]

The complex numbers are algebraically closed: Every nonconstant complex polynomial splits over C.

Proof

1.1F2F7algebra

For complex A, its characteristic polynomial splits by [F7], so [F2] gives A=UTU∗ with T upper triangular. For real A, regard its same real-entry matrix as acting on Cn; its characteristic polynomial also splits by [F7], so [F2] gives a unitary Schur triangularization there. If z=x+iy with real x,y, then ∥Az∥22=∥Ax∥22+∥Ay∥22, so the real and complex operator norms agree.

2.1F1F3F4F5step 1.1algebra

Write T=D+N, where D contains its diagonal and N is strictly upper triangular. By [F3] and [F4], the exponential series is differentiable in operator norm for each finite matrix. The identity (UTU∗)k=UTkU∗ in each series term gives etA=UetTU∗; [F5] gives ∥U∥2=∥U∗∥2=1. Each diagonal exponential satisfies ∥esD∥2≤e−αs for s≥0.

3.1F3step 2.1algebra

Differentiate e(t−s)DesT with respect to s and integrate from 0 to t. Since T−D=N, this gives etT=etD+∫0te(t−s)DNesT ds. Iterating this identity produces ordered-integral terms with k factors N and diagonal exponentials between them. The remainder after n iterations contains n strictly upper-triangular factors, with diagonal factors between them and an upper-triangular exponential at the end; every nonzero matrix-entry path would have to increase its index at least n times in an n×n matrix, so this remainder is zero.

4.1F5F6step 2.1step 3.1algebra∎

The ordered simplex for k integration variables has volume tk/k!. By [F6], each kth term has norm at most e−αt∥N∥2ktk/k!. Summing the terms 0≤k<n proves the bound for etT; [F5] and step 2.1 transfer it to etA.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A negative-real-part shift of a Hurwitz matrix is invertible

Statement

If A is Hurwitz and p∈C has Re⁡p<0, then A+pI is invertible over C.

Facts & Assumptions

Given: A Hurwitz matrix A and a scalar p with negative real part.

[F1]

Hurwitz matrices and the continuous Lyapunov equation: Every eigenvalue of a Hurwitz matrix has negative real part.

[F2]

For an m×n matrix A, rank⁡(A)+dim⁡N(A)=n: For a square matrix, its rank plus the dimension of its kernel is the dimension of its domain.

Proof

1.1F2assume-contrachoosealgebra

If A+pI were singular, its kernel would be nonzero: by [F2], a zero kernel would give full rank, hence a surjective and therefore invertible endomorphism of the finite-dimensional space. Choose nonzero v in this kernel. Then (A+pI)v=0, so Av=−pv and −p would be an eigenvalue of A.

2.1F1step 1.1discharge-contradiction∎

Since Re⁡(−p)>0, this contradicts [F1], which requires every eigenvalue of A to have negative real part. Therefore A+pI is invertible.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Positive Sylvester separation bounds the inverse operator norm

Statement

For the Sylvester operator SA,B of Sylvester operator and Frobenius separation number, if sep⁡(A,−B)>0, then every X∈Fm×n satisfies

∥X∥F≤∥AX+XB∥Fsep⁡(A,−B).

Facts & Assumptions

Given: F∈{R,C}, A∈Fm×m, B∈Fn×n, and sep⁡(A,−B)>0.

[F1]

Sylvester operator and Frobenius separation number: sep⁡(A,−B)=min⁡∥Y∥F=1∥AY+YB∥F.

Proof

1.1givenchoosealgebra

If X=0, the claimed inequality is equality. If X≠0, set Y=X/∥X∥F, so ∥Y∥F=1 and SA,B(Y)=SA,B(X)/∥X∥F by linearity.

2.1F1step 1.1algebra∎

By [F1], sep⁡(A,−B)≤∥SA,B(Y)∥F=∥SA,B(X)∥F/∥X∥F. Positivity of the separation permits multiplication and division by it, giving the desired bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A Sylvester equation is uniquely solvable exactly when the spectra are disjoint

Statement

Let F∈{R,C}, m,n≥1, A∈Fm×m and B∈Fn×n. Spectra of real matrices are taken over C. The map SA,B of Sylvester operator and Frobenius separation number is invertible if and only if

σ(A)∩(−σ(B))=∅.

Equivalently, for every C∈Fm×n, the equation AX+XB=C has a unique solution if and only if this spectral condition holds. The same condition is equivalent to sep⁡(A,−B)>0.

Facts & Assumptions

Given: The fields, dimensions and matrices in the statement.

[F1]

Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum: vec⁡(AX+XB)=(In⊗A+BT⊗Im)vec⁡(X), and vec⁡ preserves the Frobenius norm.

[F2]

If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular: If a finite-dimensional complex endomorphism has a characteristic polynomial that splits, an orthonormal basis makes its matrix upper triangular.

[F3]

Sylvester operator and Frobenius separation number: sep⁡(A,−B) is the smallest singular value of SA,B under the Frobenius inner product.

[F4]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: A linear map between finite-dimensional inner product spaces has orthonormal singular directions; its smallest singular value is positive exactly when its kernel is zero.

[F5]

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 the characteristic polynomials of its diagonal blocks.

[F7]

For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix: The determinant is the signed Leibniz sum, so for a d×d matrix L, det⁡(−L)=(−1)ddet⁡(L).

[F8]

A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero: A finite-dimensional square operator is invertible exactly when its determinant is nonzero.

[F9]

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.

[F10]

The complex numbers are algebraically closed: Every nonconstant complex polynomial splits over C.

Proof

1.1givenF2F10constructalgebra

First let F=C. The characteristic polynomials of A and B split by [F10], so [F2] gives unitary U,V and upper triangular T,S with A=UTU∗ and B=VSV∗. Set Y=U∗XV and D=U∗CV; multiplying AX+XB=C on the left by U∗ and right by V gives TY+YS=D, and this change of variables is invertible.

1.2F1F5F6F7F8F9algebra

By [F1], the vectorized map for Y↦TY+YS is K=In⊗T+ST⊗Im. Viewed in m-entry column blocks, K is block lower triangular because ST is lower triangular; its jth diagonal block is Kj=T+sjjIm, which is upper triangular with diagonal entries tii+sjj. Recursively applying [F5] to the first diagonal block and the remaining block gives χK(x)=∏j=1nχKj(x). At x=0, [F6] and [F7] give (−1)mndet⁡K=∏j=1n((−1)mdet⁡Kj), so det⁡K=∏j=1ndet⁡Kj. By [F8], K is invertible exactly when every Kj is invertible. Each Kj is triangular, so [F9] and [F8] show it is invertible exactly when every diagonal entry tii+sjj is nonzero.

2.1F8F9step 1.2algebra

Since A=UTU∗ and B=VSV∗ with U,V unitary, A−λI=U(T−λI)U∗ and B−λI=V(S−λI)V∗; these factors are invertible exactly when the corresponding middle factor is, so σ(A)=σ(T) and σ(B)=σ(S). By [F9], det⁡(T−λI)=∏i(tii−λ) and det⁡(S−λI)=∏j(sjj−λ); [F8] therefore gives σ(A)={tii} and σ(B)={sjj}. Thus step 1.2 says that SA,B is invertible exactly when σ(A)∩(−σ(B))=∅.

3.1F1step 2.1algebra

For real A,B, the matrix K=In⊗A+BT⊗Im has real entries, and its real determinant is nonzero exactly when it is nonzero over C. Applying the complex criterion from step 2.1 to this same real matrix viewed over C therefore gives the same spectral condition for invertibility over R.

4.1F3F4step 2.1step 3.1algebra∎

A square finite-dimensional linear map is bijective exactly when every right-hand side has one solution. By [F3] and [F4], its smallest singular value is positive exactly when it is invertible. This proves all equivalences.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Low-rank ADI for a continuous Lyapunov equation

Definition

Let A∈Fn×n be Hurwitz, let B∈Fn×r, and let p1,…,pk∈C be a finite shift list. The target equation is AX+XA∗+BB∗=0. Inputs also include the shift list and exact linear-solve operations. For real A,B, nonreal shifts must occur in consecutive complex-conjugate pairs; the procedure may use complex arithmetic for these paired shifts.

Before starting matrix updates, validate the real-data shift pairing by scanning the shift list once: at a real shift advance the scan index by one; at a nonreal shift require the next list entry to equal its complex conjugate, then advance the scan index by two. A missing or unequal partner returns unpaired-complex-shift. For complex data no pairing restriction is imposed. This validation scan consumes pairs; the update loop below still processes every individual shift in order.

Initialize R0=B, let Z0 have zero columns, and set X0=0. For j=1,…,k:

  1. If Re⁡pj≥0, return invalid-shift. If A+pjI is singular, return singular-shift.
  2. Set cj=−2Re⁡pj>0 and solve Vj=(A+pjI)−1Rj−1.
  3. Set Zj=[Zj−1,cjVj],Xj=ZjZj∗=Xj−1+cjVjVj∗,Rj=Rj−1+cjVj.

Return completed with the low-rank factor Zk, approximation Xk, and residual factor Rk. A finite shift list may stop before convergence; this procedure does not select shifts or assert unconditional convergence.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Sylvester separation converts a residual into a forward error bound

Statement

Let X be the unique solution of AX+XB=C, and let X^∈Fm×n be any approximation. Define its equation residual by R=C−(AX^+X^B). If sep⁡(A,−B)>0, then

∥X−X^∥F≤∥R∥Fsep⁡(A,−B).

Facts & Assumptions

Given: Compatible matrices A,B,C, the unique solution X, the approximation X^, and positive sep⁡(A,−B).

[F1]

Sylvester operator and Frobenius separation number: SA,B(Y)=AY+YB and sep⁡(A,−B)=σmin⁡(SA,B).

[F2]

Positive Sylvester separation bounds the inverse operator norm: ∥Y∥F≤∥SA,B(Y)∥F/sep⁡(A,−B).

[F3]

A Sylvester equation is uniquely solvable exactly when the spectra are disjoint: Positive separation implies that every right-hand side has a unique solution.

Proof

1.1givenF1algebra

Put E=X−X^. By linearity of SA,B and the two equations, SA,B(E)=SA,B(X)−SA,B(X^)=C−(AX^+X^B)=R.

2.1F2F3step 1.1algebra∎

Apply [F2] to E and substitute step 1.1 to obtain ∥X−X^∥F=∥E∥F≤∥R∥F/sep⁡(A,−B). The unique solution used here is guaranteed by [F3].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Low-rank ADI has an exact residual factor identity

Statement

For every completed iterate j of Low-rank ADI for a continuous Lyapunov equation, with X0=0 and R0=B,

AXj+XjA∗+BB∗=RjRj∗.

Facts & Assumptions

Given: A completed ADI run with admissible shifts, factors Vj, coefficients cj=−2Re⁡pj, and iterates from the algorithm.

[F1]

Low-rank ADI for a continuous Lyapunov equation: Vj=(A+pjI)−1Rj−1, Xj=Xj−1+cjVjVj∗, and Rj=Rj−1+cjVj.

[A1]

For induction at a fixed j≥1, assume AXj−1+Xj−1A∗+BB∗=Rj−1Rj−1∗.

Proof

1.1F1basealgebra

At j=0, AX0+X0A∗+BB∗=BB∗=R0R0∗ by the initialization.

1.2A1ihF1algebra

Fix j≥1, write p=pj, c=cj, V=Vj, and R=Rj−1. The shifted solve gives AV=R−pV, and taking adjoints gives V∗A∗=R∗−p‾V∗.

2.1A1F1step 1.2algebra

Using c=−(p+p‾) and [F1], expand the new Lyapunov residual as AXj+XjA∗+BB∗=AXj−1+Xj−1A∗+BB∗+c((AV)V∗+V(V∗A∗)). Substituting step 1.2 and [A1] yields RR∗+c(RV∗+VR∗)+c2VV∗.

3.1F1step 1.1step 1.2step 2.1discharge-inductionalgebra∎

The expression in step 2.1 factors as (R+cV)(R+cV)∗=RjRj∗ by [F1]. Together with base step 1.1, the induction step in 1.2–2.1 proves the identity for every completed iterate.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A proved rational shift bound implies low-rank ADI convergence

Statement

Let A be Hurwitz, let B∈Fn×r, and let p1,p2,… be admissible shifts for Low-rank ADI for a continuous Lyapunov equation. Define

ρj(z)=∏i=1jz−pi‾z+pi.

Suppose a proved rational shift estimate gives ∥ρj(A)∥2≤ηj for a sequence ηj→0. Then the ADI iterates converge in Frobenius norm to the unique integral solution X=∫0∞etABB∗etA∗ dt, with

∥X−Xj∥F≤ηj2∥B∥F2sep⁡(A,−A∗).

No convergence assertion is made without this rational operator bound.

Facts & Assumptions

Given: A Hurwitz matrix, a forcing factor B, admissible shifts, and the stated proved rational estimate.

[F1]

Low-rank ADI for a continuous Lyapunov equation: R0=B, Rj=Rj−1−2Re⁡(pj)(A+pjI)−1Rj−1.

[F2]

Low-rank ADI has an exact residual factor identity: AXj+XjA∗+BB∗=RjRj∗.

[F3]

A Sylvester equation is uniquely solvable exactly when the spectra are disjoint: The operator X↦AX+XB is invertible exactly when σ(A)∩(−σ(B))=∅, equivalently when sep⁡(A,−B)>0.

[F4]

Sylvester separation converts a residual into a forward error bound: For a unique Sylvester solution, the Frobenius forward error is at most the Frobenius equation residual divided by separation.

[F5]

The Hurwitz Lyapunov integral is the unique solution and has the stated positivity: For Hurwitz A, the integral X exists uniquely and satisfies AX+XA∗+BB∗=0.

[F6]

Spectral and Frobenius norms are unitarily invariant, are given by singular values, and satisfy the sharp rank comparison: The Frobenius norm is unitarily invariant and its square is the sum of squared singular values.

[F7]

In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix: In the standard orthonormal basis, the matrix of the adjoint is the conjugate transpose.

[A1]

For every j, the chosen shifts satisfy the operator rational estimate ∥ρj(A)∥2≤ηj, with ηj→0.

Proof

1.1F1algebra

From [F1], Rj=(I−2Re⁡(pj)(A+pjI)−1)Rj−1=(A−pj‾I)(A+pjI)−1Rj−1, since −2Re⁡(pj)=−(pj+pj‾). All factors are rational functions of A and commute, so iterating gives Rj=ρj(A)B.

1.2F2F3F5F7F8F9F10algebra

In the standard orthonormal basis, [F7] represents A∗ by A‾T. For z∈C, [F8] and [F10] give det⁡(zI−A∗)=det⁡((zI−A‾)T)=det⁡(zI−A‾), and [F9] applied to the Leibniz formula gives det⁡(zI−A‾)=det⁡(z‾I−A)‾. Hence σ(A∗)=σ(A)‾, so both A and A∗ have spectrum in the open left half-plane; therefore σ(A)∩(−σ(A∗))=∅. By [F3], sep⁡(A,−A∗)>0. Subtracting the equation for Xj in [F2] from the exact equation in [F5] gives SA,A∗(X−Xj)=−RjRj∗.

2.1A1step 1.1algebra

Applying the operator bound in [A1] to each column of B and summing squared column norms gives ∥Rj∥F≤ηj∥B∥F.

3.1F4F5F6step 2.1step 1.2algebra∎

Apply [F4] to step 1.2. If Rj=UΣV∗ is an SVD, then RjRj∗=UΣΣ∗U∗, so unitary invariance and [F6] give ∥RjRj∗∥F2=∑isi(Rj)4≤(∑isi(Rj)2)2=∥Rj∥F4. Therefore ∥X−Xj∥F≤∥RjRj∗∥F/sep⁡(A,−A∗)≤ηj2∥B∥F2/sep⁡(A,−A∗). Since ηj→0 and the separation is positive, the right side tends to zero.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Finite-budget Bartels-Stewart solve for a Sylvester equation

Definition

Let F∈{R,C}, m,n≥1, A∈Fm×m, B∈Fn×n and C∈Fm×n. Inputs also include a pivot threshold τ≥0, Schur controls for each matrix, a fixed constant c0>0, and nonnegative integer sweep budgets NA,NB satisfying NA≤c0m, NB≤c0n. The local transforms, certificate checks and block substitution use exact scalar arithmetic and comparisons. The delegated Schur calls retain their specified rounded arithmetic, admissible input representations, range conditions and statuses; their returned factors remain candidates until the exact checks below succeed.

The default real-block sign controller is the fixed exact real-arithmetic expression tree s=(a−d)2+4bc, followed by its sign comparisons, for Exact sign predicate for a real 2x2 characteristic discriminant. This uses five exact arithmetic operations and at most two sign comparisons in the declared exact local arithmetic model. For rational/dyadic encoded stored values, Rational or dyadic stored real blocks have a finite exact discriminant-sign evaluator gives the finite exact integer realization; a fixed-format decoder, when used, is included in the control cost. These exact controller operations are separate from the rounded Schur matrix updates. No bit-complexity bound for integer/rational arithmetic is claimed.

Choose either bounded-controller mode, the default, or arbitrary-terminating-controller mode. In bounded mode supply a nonnegative integer per-call budget K. Custom sign or decoding routines are finite instruction programs over exact scalar real/integer arithmetic, comparisons, register operations and branches; no opaque callback is a unit instruction. The interpreter charges one unit per executed instruction, including decoding, the built-in tree and any custom-result verification within the same per-call K budget; it checks instruction/operation validity when encountered and returns undecided on exhaustion or invalid execution. An undecided sign is propagated as the Schur type-undecided status and then outer schur-failure. The fixed built-in sign tree or integer recipe has a fixed finite instruction count independent of matrix dimension. Any custom reported sign must agree with the built-in exact discriminant tree before acceptance. In arbitrary-terminating mode custom programs must terminate on every supplied input; record their total executed controller work as Caux. This richer mode retains finite termination but has the additional work in its cost bound. In the cubic-cost branch K and representation-control instruction costs are fixed independently of matrix dimension. Programs are executed by instruction lookup without an up-front scan of unused code.

  1. Run Finite-budget computed Francis Schur reduction with explicit statuses on A and B with their supplied controls and budgets. If either call does not return Schur-computed, return schur-failure with the underlying status.

  2. Treat the returned factors as candidates and verify the exact certificates. In the complex branch check U∗U=I, A=UTU∗, and upper triangularity of T; in the real branch check UTU=I, A=UTUT, and the real block upper-triangular form of Real and complex Schur forms. Perform the corresponding checks for B=VSV∗. If any check fails, return schur-certificate-failure.

  3. Set D=U∗CV. Use the column-vectorization and Kronecker convention of Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum. Partition T into diagonal blocks Tii and S into diagonal blocks Sjj as in the exact real or complex Schur form. Traverse j from left to right and, for each j, traverse i from bottom to top. Form

Fij=Dij−∑k>iTikYkj−∑ℓ<jYiℓSℓj.

The terms on the right have already been computed in this traversal order. Define Φij(Z)=TiiZ+ZSjj and its matrix representation Mij=Isj⊗Tii+SjjT⊗Iri on column-vectorized blocks, where ri,sj∈{1,2} are the block sizes. Let q=risj≤4 and compute δ(Mij) from A determinant and Frobenius norm give a certified lower bound for small-block separation. If det⁡(Mij)=0, return singular-pivot; if det⁡(Mij)≠0 and δ(Mij)≤τ, return pivot-separation-failure because the requested pivot bound is not certified. Otherwise use the cofactor adjugate formula of The adjugate gives an explicit inverse formula over a field to set vec⁡(Yij)=adj⁡(Mij)vec⁡(Fij)/det⁡(Mij) and store Yij. The local dimension is at most four in the real block case and one in the complex triangular case.

  1. After all blocks are solved, return success and X=UYV∗, together with the exact residual C−(AX+XB). No computed Schur candidate is accepted as an exact factorization unless step 2 verifies its defining equalities.
TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Successful certified Bartels-Stewart substitution returns the exact Sylvester solution

Statement

Suppose Finite-budget Bartels-Stewart solve for a Sylvester equation returns success for A,B,C. Then its returned X satisfies AX+XB=C. If σ(A)∩(−σ(B))=∅, this X is the unique solution.

Facts & Assumptions

Given: A successful output X=UYV∗ from the algorithm, with its verified exact Schur identities and exact local block solves; the delegated rounded Schur calls were accepted only after those checks.

[F1]

Finite-budget Bartels-Stewart solve for a Sylvester equation: Success requires exact Schur certificates, and the block traversal solves TiiYij+YijSjj=Dij−∑k>iTikYkj−∑ℓ<jYiℓSℓj for every block pair.

[F2]
[F3]

A Sylvester equation is uniquely solvable exactly when the spectra are disjoint: The spectral-disjointness condition is equivalent to unique solvability for every right-hand side.

Proof

1.1F1algebra

By [F1], A=UTU∗, B=VSV∗, and D=U∗CV hold exactly. Multiplying AX+XB on the left by U∗ and on the right by V gives TY+YS.

2.1F1step 1.1algebra

In the (i,j) block, TY+YS equals TiiYij+YijSjj+∑k>iTikYkj+∑ℓ<jYiℓSℓj. The successful local solve from [F1] makes this block equal Dij, so every block of TY+YS equals the corresponding block of D.

3.1F2step 1.1step 2.1algebra

Therefore TY+YS=D=U∗CV. Multiplying by U on the left and V∗ on the right yields A(UYV∗)+(UYV∗)B=C. By [F2], this is SA,B(X)=C for the returned X=UYV∗.

4.1F3step 3.1∎

Under the stated spectral-disjointness condition, [F3] gives uniqueness for this right-hand side; hence the returned exact solution is the unique one.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Linearly budgeted dense Bartels-Stewart work with explicit controller costs

Statement

For square dense inputs of order n, fix c0>0 and use NA,NB≤c0n in Finite-budget Bartels-Stewart solve for a Sylvester equation. In bounded-controller mode with per-call budget K, the total scalar arithmetic/comparison and controller-instruction work, including failure branches, is O(n3+Kn2). In particular, for fixed K independent of n and the fixed-cost default sign/representation controllers, it is O(n3). In arbitrary-terminating-controller mode the corresponding bound is O(n3+Caux), where Caux is the actual total control work. Exact integer/rational operations are counted as scalar operations; this is not a bit-complexity bound.

Facts & Assumptions

Given: Square dense inputs, linearly bounded sweep budgets, and either the per-call controller budget or explicit total controller work from the statement.

[F1]

Finite-budget Bartels-Stewart solve for a Sylvester equation: Each Schur candidate is obtained by Finite-budget computed Francis Schur reduction with explicit statuses; the procedure then checks exact Schur identities, forms two dense transforms, traverses block pairs, and solves local systems of dimension at most four.

[F2]

Finite-budget computed Francis Schur reduction with explicit statuses: Its initialization reduces a dense matrix to Hessenberg form with Householder similarities; each active block has at most max⁡(n−2,0)+1 initial/chase bounded-support reflector updates per sweep, with explicit finite sweep caps.

Proof

1.1F2algebra

Hessenberg reduction uses at most max⁡(n−2,0) reflector steps. For n≥3, forming one reflector costs O(n) scalar operations, and applying its two-sided similarity to the remaining dense submatrix costs O(n2); summing over at most n steps gives O(n3). Any full initialization zero-pattern checks also cost at most O(n2) per stage, hence at most O(n3) in total. For n=1,2, there are no such reflector stages and no below-subdiagonal entries.

1.2F1F2givenalgebra

For an active block of size r≥2, a Francis sweep has at most max⁡(r−2,0)+1 initial/chase reflectors of length two or three. Each acts on a bounded number of rows and columns across at most n entries. For a processed interval [a,b] of length r, every matrix write has a row or column in that interval. Before the chase, initialization or the preceding accepted check has established that the complementary below-subdiagonal positions are zero. The prescribed post-block check enumerates only the positions touching this interval: at most nr in its rows and nr in its columns, plus the n row-loop visits. It is therefore equivalent to the full Hessenberg check and costs O(nr), since every active interval has r≥2. The disjoint active lengths sum to at most n, so all these checks cost O(n2) per sweep, even if every polynomial vector is zero and all factors are identities. The explicit partition/deflation passes and direct shift-table lookups also fit within O(n2); for n=1 there is no active sweep. Thus a full sweep, including all non-controller status work, costs O(n2). The linear sweep budgets therefore give O(n3) matrix work for the two Schur calls. A range, breakdown, invariant, budget, missing-shift or unavailable-sign failure stops within these bounded loops and adds only its partial-output work; it cannot increase their worst-case count. The same bound covers materializing the recorded factor products: initialization contributes O(n3) and each bounded-support chase factor updates only a bounded number of dense-factor columns, at cost O(n).

1.3F1algebra

Each exact Schur-certificate matrix product, the transform U∗CV, and the final transform UYV∗ cost O(n3). The block substitution has at most n2 block pairs; each pair sums at most O(n) earlier blocks of bounded size and solves a system of dimension at most four, so all substitution work is O(n3).

1.4F1F2givenalgebra

Each sweep checks at most O(n) active blocks, and initialization and final checks add at most O(n) such calls. With O(n) sweeps there are at most O(n2) sign/representation-controller calls. A bounded call executes at most K instructions, giving O(Kn2) work; the fixed built-in exact polynomial tree and rational/dyadic recipe are constant-size special cases. In arbitrary-terminating mode their actual total work is precisely the additional Caux.

2.1F1F2step 1.1step 1.2givenalgebra

The backward-error accumulator starts with one outward Frobenius norm of the input, costing O(n2) by the declared entrywise evaluator model. Each similarity uses a fixed number of scalar upper-bound calls once its local coefficient is evaluated. The explicit real/complex coefficient formulas require O(m) scalar operations on active dimension m: their dimension-dependent powers can be formed by repeated multiplication and a square root for a half-integer exponent. Thus the at most n initialization coefficients cost O(n2) in total, while each length-two/three chase coefficient costs O(1). There are O(n2) chase similarities over the linear number of sweeps. Each recorded one-entry deflation has Frobenius norm equal to the modulus of its signed stored value, evaluated from that one-entry list with O(1) scalar work; at most O(n) such writes occur per sweep, hence O(n2) in total. Each stage then makes a fixed number of recurrence calls. Unavailable coefficient/evaluator results only stop certificate bookkeeping. Consequently this entire ancillary accumulation costs O(n2) and fits inside the cubic matrix-work bound, including failure branches.

3.1step 1.1step 1.2step 2.1step 1.3step 1.4algebra∎

The reductions, sweeps, exact certificates, transforms, block sums and fixed-size solves contribute O(n3), and step 1.4 supplies the complete control contribution. Adding them gives O(n3+Kn2) and the fixed-K cubic consequence, or O(n3+Caux) for the richer terminating route. No bound on integer bit length or bit-operation cost is used.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite ADI shifts have well-defined solves and explicit statuses

Statement

For admitted inputs of Low-rank ADI for a continuous Lyapunov equation, the shift-pair validation and update procedure terminate with a declared status after at most k updates and a finite scan of the k shifts. For every admissible shift with Re⁡pj<0, its exact shifted solve exists uniquely. On completed, Zk has at most kr columns and Xk=ZkZk∗ with the recorded residual factor Rk. This is not a convergence or real-factor assertion; paired real-data shifts may be processed in complex arithmetic.

Facts & Assumptions

Given: A Hurwitz matrix, a finite forcing factor and a finite shift list with the algorithm's exact finite linear-solve operations.

[F1]

Low-rank ADI for a continuous Lyapunov equation defines the pair-consuming validation scan, individual-shift updates and statuses.

[F2]

A negative-real-part shift of a Hurwitz matrix is invertible: Hurwitz A and Re⁡p<0 imply A+pI is invertible.

Proof

1.1F1givenalgebra

In the pairing scan, each accepted real entry advances the index by one and each accepted nonreal pair advances it by two; an unpaired entry returns immediately. Thus the scan has at most k checks, including the empty list. For a pair (p,p‾) the second entry is consumed by the validation scan, not incorrectly tested for a third partner. The update loop still visits both indices.

2.1F1F2step 1.1givenalgebra

Each valid update has cj=−2Re⁡pj>0. By [F2] its exact linear system has a unique solution. Other shift checks return their declared status. Each matrix operation and positive scalar square root is finite, and the update index increases until k or an earlier return, so the procedure terminates.

3.1F1step 2.1givenalgebra∎

Initialization has zero factor columns and X0=0. Each successful update appends r columns and sets Xj=ZjZj∗ and Rj by its explicit recurrence. Hence completion has at most kr columns and exactly the recorded output relations, also for k=0. No contraction or limiting shift property was used.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Finite Bartels–Stewart statuses and successful-pivot uniqueness

Statement

For admitted inputs of Finite-budget Bartels-Stewart solve for a Sylvester equation, the procedure terminates with a declared status, using its finite Schur controls and bounded controller programs or the stated arbitrary-terminating controller mode. Every stored local solve is unique. On success, the full equation AX+XB=C has exactly one solution, namely the returned X, without an additional spectral-disjointness assumption: successful exact local pivot checks themselves imply invertibility of the full block operator. Failure or a positive threshold rejection proves neither singularity nor nonexistence unless its exact tests explicitly do so.

Facts & Assumptions

Given: The algorithm's actual finite controls, exact local arithmetic, delegated rounded Schur semantics and terminating supplied evaluator contracts.

[F1]

Finite-budget Bartels-Stewart solve for a Sylvester equation verifies exact Schur identities and traverses block pairs in column-increasing, row-decreasing order. A stored pivot has det⁡Mij≠0, dimension at most four, and its specified adjugate solve.

[F2]

The adjugate gives an explicit inverse formula over a field: nonzero determinant gives the two-sided inverse M−1=adj⁡(M)/det⁡M.

[F3]

Finite Francis procedure terminates with explicit statuses and verifies its Schur pattern on success: the actual delegated Schur procedure terminates on its admitted finite controls and terminating evaluators, possibly with failure.

[F4]

Successful certified Bartels-Stewart substitution returns the exact Sylvester solution: a successful substitution returns an exact solution after checking its exact Schur factors.

Proof

1.1F1F3givenalgebra

The default sign program is a fixed finite expression tree or its finite encoded-integer recipe. A bounded custom interpreter takes at most its per-call instruction budget, while every arbitrary-terminating program ends by its input contract; invalid/undecided outcomes propagate as failure. The two delegated Schur calls terminate by [F3], and failed calls return immediately. Exact matrix-entry/pattern certificate tests are finite.

2.1F1F2step 1.1givenalgebra

There are finitely many block pairs and finitely many terms in each substitution sum. Each local determinant, separation-bound expression and adjugate formula is a finite expression on a matrix of dimension at most four. A rejected test returns its declared failure. Otherwise det⁡Mij≠0, so [F2] gives a unique exact local solution. Thus the whole traversal and final finite transforms terminate.

3.1F1F2step 2.1giveninductionalgebra

On success consider a homogeneous transformed equation TY+YS=0. In the algorithm's traversal order, its first block satisfies Mijvec⁡Yij=0, hence Yij=0 by step 2.1. Inductively, all earlier blocks entering the current right-hand side are zero, so its unique invertible pivot again forces Yij=0. Every block therefore vanishes. Exact unitary Schur factors are invertible, so the original homogeneous operator AX+XB also has zero kernel.

4.1F1F4step 3.1algebra∎

By [F4] the successful output is a solution. If two solutions existed, their difference would be in the homogeneous kernel, which is zero by step 3.1. Thus the output is unique without needing to assume a spectral premise not established by the caller. The positive threshold test may reject an invertible small pivot, so no converse failure conclusion is made.

5 · Examples, counterexamples and false statements

None yet.

Sources