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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computed Schur decompositions and nonnormal spectra
- Computed singular values and rank revealing factorizations
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalue Iterations and the QR Algorithm
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops the equation 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 , the continuous Lyapunov equation 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
Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum
Statement
Let be or , let , let , , and let . Define by stacking the columns . For compatible matrices, define as the block matrix whose block is . Then
Facts & Assumptions
Given: The dimensions and matrices in the statement.
Proof
By the definition of column stacking, by [F1]. Both sides are nonnegative, so taking square roots proves the isometry claim.
The th block of is , which is the th column of . Hence .
The th column of is . The th block of is the same sum because its block is . Thus .
Adding the identities in steps 1.2 and 1.3 gives the displayed Sylvester-map representation, completing both claims.
A determinant and Frobenius norm give a certified lower bound for small-block separation
Statement
Let , , and . Define
With the empty product convention when , .
Facts & Assumptions
Given: A finite square matrix over or .
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 , with zeros appended to length , giving for unitary .
For same-sized finite square matrices over a commutative ring, : for square matrices over a commutative ring.
Orthogonal and unitary operators form groups, and their determinants have modulus one: every unitary matrix has determinant modulus one.
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
If , then by the definition and the singular values in [F1].
Suppose and choose singular values from [F1], with for unitary . By [F3], ; [F4] gives , and [F5] gives . Thus . By [F2], every ; hence .
Since and , divide the inequality in step 1.2 by to obtain . The lower bound follows from its definition.
Hurwitz matrices and the continuous Lyapunov equation
Definition
Let , , and . The matrix is Hurwitz if, when its eigenvalues are considered over , every eigenvalue has strictly negative real part. For with , the continuous Lyapunov equation with coefficient and forcing is
Here is transpose for real matrices and conjugate transpose for complex matrices. The notations and mean that is non-negative or positive as a self-adjoint operator in the sense of Non-negative and positive operators: respectively for all , or for every nonzero .
The adjugate gives an explicit inverse formula over a field
Statement
Let be a field, , and . Let 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
Consequently, when , ; when , is singular.
Facts & Assumptions
Given: A field , positive integer , and matrix .
Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring: Rows and columns are indexed by ; and , with the determinant equal to when .
Laplace expansion computes the determinant along every row and every column over a commutative ring: With zero-based indices, expanding along row gives .
The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring: A determinant with two equal columns is zero. By For every square matrix over a commutative ring, , a determinant with two equal rows is also zero.
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
For , [F1] makes the entry of equal to .
If , this sum is by [F2]. If , let be obtained by replacing row of with row . Deleting row leaves each cofactor unchanged, so expansion of along row gives the sum in step 1.1. The matrix has equal rows and , so [F3] makes that determinant zero. Thus every diagonal entry of is and every off-diagonal entry is zero.
If , [F4] gives , and multiplying the identity in step 2.1 on the left by gives . If , [F4] says is not invertible, which is exactly singularity for a square matrix.
Sylvester operator and Frobenius separation number
Definition
For , , with , define the Sylvester operator by
Equip with the Frobenius norm of The Frobenius norm 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 . Define
Here 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 is part of the conventional label: the operator being measured is .
A Hurwitz matrix exponential has a polynomial-exponential decay bound
Statement
Let be Hurwitz, let , and write . If is a unitary Schur triangularization and with diagonal and strictly upper triangular, then for every ,
For real Hurwitz , 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 whose eigenvalues all have negative real part.
Hurwitz matrices and the continuous Lyapunov equation: Hurwitz means every complex eigenvalue has strictly negative real part.
If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular: Over , a finite-dimensional endomorphism has an orthonormal basis in which it is upper triangular.
The exponential series of a bounded operator: In a Banach space, the norm-convergent exponential series satisfies .
Every finite-dimensional normed space is Banach: Every finite-dimensional normed space is complete.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: A unitary operator preserves the norm of every vector.
The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: For compatible finite-dimensional maps, .
The complex numbers are algebraically closed: Every nonconstant complex polynomial splits over .
Proof
For complex , its characteristic polynomial splits by [F7], so [F2] gives with upper triangular. For real , regard its same real-entry matrix as acting on ; its characteristic polynomial also splits by [F7], so [F2] gives a unitary Schur triangularization there. If with real , then , so the real and complex operator norms agree.
Write , where contains its diagonal and is strictly upper triangular. By [F3] and [F4], the exponential series is differentiable in operator norm for each finite matrix. The identity in each series term gives ; [F5] gives . Each diagonal exponential satisfies for .
Differentiate with respect to and integrate from to . Since , this gives . Iterating this identity produces ordered-integral terms with factors and diagonal exponentials between them. The remainder after iterations contains 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 times in an matrix, so this remainder is zero.
The ordered simplex for integration variables has volume . By [F6], each th term has norm at most . Summing the terms proves the bound for ; [F5] and step 2.1 transfer it to .
A negative-real-part shift of a Hurwitz matrix is invertible
Statement
If is Hurwitz and has , then is invertible over .
Facts & Assumptions
Given: A Hurwitz matrix and a scalar with negative real part.
Hurwitz matrices and the continuous Lyapunov equation: Every eigenvalue of a Hurwitz matrix has negative real part.
For an matrix , : For a square matrix, its rank plus the dimension of its kernel is the dimension of its domain.
Proof
If 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 in this kernel. Then , so and would be an eigenvalue of .
Since , this contradicts [F1], which requires every eigenvalue of to have negative real part. Therefore is invertible.
Positive Sylvester separation bounds the inverse operator norm
Statement
For the Sylvester operator of Sylvester operator and Frobenius separation number, if , then every satisfies
Facts & Assumptions
Given: , , , and .
Proof
If , the claimed inequality is equality. If , set , so and by linearity.
By [F1], . Positivity of the separation permits multiplication and division by it, giving the desired bound.
A Sylvester equation is uniquely solvable exactly when the spectra are disjoint
Statement
Let , , and . Spectra of real matrices are taken over . The map of Sylvester operator and Frobenius separation number is invertible if and only if
Equivalently, for every , the equation has a unique solution if and only if this spectral condition holds. The same condition is equivalent to .
Facts & Assumptions
Given: The fields, dimensions and matrices in the statement.
Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum: , and preserves the Frobenius norm.
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.
Sylvester operator and Frobenius separation number: is the smallest singular value of under the Frobenius inner product.
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.
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.
For , the characteristic polynomial is when , with for the unique matrix: for a finite square matrix .
For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix: The determinant is the signed Leibniz sum, so for a matrix , .
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.
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.
The complex numbers are algebraically closed: Every nonconstant complex polynomial splits over .
Proof
First let . The characteristic polynomials of and split by [F10], so [F2] gives unitary and upper triangular with and . Set and ; multiplying on the left by and right by gives , and this change of variables is invertible.
By [F1], the vectorized map for is . Viewed in -entry column blocks, is block lower triangular because is lower triangular; its th diagonal block is , which is upper triangular with diagonal entries . Recursively applying [F5] to the first diagonal block and the remaining block gives . At , [F6] and [F7] give , so . By [F8], is invertible exactly when every is invertible. Each is triangular, so [F9] and [F8] show it is invertible exactly when every diagonal entry is nonzero.
Since and with unitary, and ; these factors are invertible exactly when the corresponding middle factor is, so and . By [F9], and ; [F8] therefore gives and . Thus step 1.2 says that is invertible exactly when .
For real , the matrix has real entries, and its real determinant is nonzero exactly when it is nonzero over . Applying the complex criterion from step 2.1 to this same real matrix viewed over therefore gives the same spectral condition for invertibility over .
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.
The Hurwitz Lyapunov integral is the unique solution and has the stated positivity
Statement
Let be Hurwitz and let . Then the improper matrix integral
converges and is the unique solution of . If , then . If , then . For , if and only if there is no nonzero for which for every .
Facts & Assumptions
Given: A Hurwitz matrix , a self-adjoint matrix , and the definitions of and from Hurwitz matrices and the continuous Lyapunov equation.
The exponential series of a bounded operator: , and the same formula applies to .
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 with .
The Frobenius norm on real or complex matrices: is the sum of squared absolute values of the entries of .
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.
The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector: The operator norm of a finite-dimensional map is its largest singular value.
Proof
Put . For finite matrices , by the operator-norm definition and [F4]. The entry formula in [F4] gives . The SVD in [F5] gives the same positive singular values for and ; [F6] therefore gives . Applying the left-multiplication estimate to adjoints yields . Applying these inequalities successively gives .
For , [F2] and the product rule give . Integrating this identity yields .
By [F1], the right side in step 1.1 is bounded by a finite sum of polynomial multiples of . Each such term is integrable on by repeated integration by parts. Every entry of the integrand is therefore absolutely integrable; define by the finitely many scalar improper entry integrals. The entrywise tails tend to zero, so in Frobenius norm and the matrix integral converges absolutely in that norm. The integrand is self-adjoint because .
By [F1], as , and by step 2.1, . Taking limits in step 1.2 gives .
Suppose . By [F3], exists and is self-adjoint, so . Hence for every , . Thus . If and , the integrand at is and is continuous, so it stays positive on an interval of positive length; therefore and .
If is another solution, satisfies . The derivative of is therefore zero by [F2], so it is constant and equals at . By [F1] it tends to zero as , hence and the solution is unique.
For and nonzero , the continuous integrand in step 3.2 has integral zero exactly when it vanishes for all : if it were positive at one time, continuity would make its integral over a neighboring interval positive. It vanishes at time exactly when . Hence for every nonzero exactly when no nonzero trajectory remains in that kernel for all .
Low-rank ADI for a continuous Lyapunov equation
Definition
Let be Hurwitz, let , and let be a finite shift list. The target equation is . Inputs also include the shift list and exact linear-solve operations. For real , 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 , let have zero columns, and set . For :
- If , return
invalid-shift. If is singular, returnsingular-shift. - Set and solve
- Set
Return completed with the low-rank factor , approximation , and residual factor . A finite shift list may stop before convergence; this procedure does not select shifts or assert unconditional convergence.
Sylvester separation converts a residual into a forward error bound
Statement
Let be the unique solution of , and let be any approximation. Define its equation residual by . If , then
Facts & Assumptions
Given: Compatible matrices , the unique solution , the approximation , and positive .
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
Put . By linearity of and the two equations, .
Apply [F2] to and substitute step 1.1 to obtain . The unique solution used here is guaranteed by [F3].
Low-rank ADI has an exact residual factor identity
Statement
For every completed iterate of Low-rank ADI for a continuous Lyapunov equation, with and ,
Facts & Assumptions
Given: A completed ADI run with admissible shifts, factors , coefficients , and iterates from the algorithm.
For induction at a fixed , assume .
Proof
At , by the initialization.
Fix , write , , , and . The shifted solve gives , and taking adjoints gives .
Using and [F1], expand the new Lyapunov residual as . Substituting step 1.2 and [A1] yields .
The expression in step 2.1 factors as by [F1]. Together with base step 1.1, the induction step in 1.2–2.1 proves the identity for every completed iterate.
A proved rational shift bound implies low-rank ADI convergence
Statement
Let be Hurwitz, let , and let be admissible shifts for Low-rank ADI for a continuous Lyapunov equation. Define
Suppose a proved rational shift estimate gives for a sequence . Then the ADI iterates converge in Frobenius norm to the unique integral solution , with
No convergence assertion is made without this rational operator bound.
Facts & Assumptions
Given: A Hurwitz matrix, a forcing factor , admissible shifts, and the stated proved rational estimate.
A Sylvester equation is uniquely solvable exactly when the spectra are disjoint: The operator is invertible exactly when , equivalently when .
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.
The Hurwitz Lyapunov integral is the unique solution and has the stated positivity: For Hurwitz , the integral exists uniquely and satisfies .
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.
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.
For every square matrix over a commutative ring, : Transposition preserves the determinant.
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: Complex conjugation is a field automorphism.
For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix: The determinant is given by the signed Leibniz formula.
For every , the chosen shifts satisfy the operator rational estimate , with .
Proof
From [F1], , since . All factors are rational functions of and commute, so iterating gives .
In the standard orthonormal basis, [F7] represents by . For , [F8] and [F10] give , and [F9] applied to the Leibniz formula gives . Hence , so both and have spectrum in the open left half-plane; therefore . By [F3], . Subtracting the equation for in [F2] from the exact equation in [F5] gives .
Applying the operator bound in [A1] to each column of and summing squared column norms gives .
Apply [F4] to step 1.2. If is an SVD, then , so unitary invariance and [F6] give . Therefore . Since and the separation is positive, the right side tends to zero.
Finite-budget Bartels-Stewart solve for a Sylvester equation
Definition
Let , , , and . Inputs also include a pivot threshold , Schur controls for each matrix, a fixed constant , and nonnegative integer sweep budgets satisfying , . 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 , 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 . 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 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 . This richer mode retains finite termination but has the additional work in its cost bound. In the cubic-cost branch 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.
-
Run Finite-budget computed Francis Schur reduction with explicit statuses on and with their supplied controls and budgets. If either call does not return
Schur-computed, returnschur-failurewith the underlying status. -
Treat the returned factors as candidates and verify the exact certificates. In the complex branch check , , and upper triangularity of ; in the real branch check , , and the real block upper-triangular form of Real and complex Schur forms. Perform the corresponding checks for . If any check fails, return
schur-certificate-failure. -
Set . Use the column-vectorization and Kronecker convention of Column vectorization is an isometry and represents the Sylvester map by a Kronecker sum. Partition into diagonal blocks and into diagonal blocks as in the exact real or complex Schur form. Traverse from left to right and, for each , traverse from bottom to top. Form
The terms on the right have already been computed in this traversal order. Define and its matrix representation on column-vectorized blocks, where are the block sizes. Let and compute from A determinant and Frobenius norm give a certified lower bound for small-block separation. If , return singular-pivot; if and , 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 and store . The local dimension is at most four in the real block case and one in the complex triangular case.
- After all blocks are solved, return
successand , together with the exact residual . No computed Schur candidate is accepted as an exact factorization unless step 2 verifies its defining equalities.
Successful certified Bartels-Stewart substitution returns the exact Sylvester solution
Statement
Suppose Finite-budget Bartels-Stewart solve for a Sylvester equation returns success for . Then its returned satisfies . If , this is the unique solution.
Facts & Assumptions
Given: A successful output 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.
Finite-budget Bartels-Stewart solve for a Sylvester equation: Success requires exact Schur certificates, and the block traversal solves for every block pair.
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
By [F1], , , and hold exactly. Multiplying on the left by and on the right by gives .
In the block, equals . The successful local solve from [F1] makes this block equal , so every block of equals the corresponding block of .
Therefore . Multiplying by on the left and on the right yields . By [F2], this is for the returned .
Under the stated spectral-disjointness condition, [F3] gives uniqueness for this right-hand side; hence the returned exact solution is the unique one.
Linearly budgeted dense Bartels-Stewart work with explicit controller costs
Statement
For square dense inputs of order , fix and use in Finite-budget Bartels-Stewart solve for a Sylvester equation. In bounded-controller mode with per-call budget , the total scalar arithmetic/comparison and controller-instruction work, including failure branches, is . In particular, for fixed independent of and the fixed-cost default sign/representation controllers, it is . In arbitrary-terminating-controller mode the corresponding bound is , where 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.
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.
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 initial/chase bounded-support reflector updates per sweep, with explicit finite sweep caps.
Proof
Hessenberg reduction uses at most reflector steps. For , forming one reflector costs scalar operations, and applying its two-sided similarity to the remaining dense submatrix costs ; summing over at most steps gives . Any full initialization zero-pattern checks also cost at most per stage, hence at most in total. For , there are no such reflector stages and no below-subdiagonal entries.
For an active block of size , a Francis sweep has at most initial/chase reflectors of length two or three. Each acts on a bounded number of rows and columns across at most entries. For a processed interval of length , 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 in its rows and in its columns, plus the row-loop visits. It is therefore equivalent to the full Hessenberg check and costs , since every active interval has . The disjoint active lengths sum to at most , so all these checks cost 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 ; for there is no active sweep. Thus a full sweep, including all non-controller status work, costs . The linear sweep budgets therefore give 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 and each bounded-support chase factor updates only a bounded number of dense-factor columns, at cost .
Each exact Schur-certificate matrix product, the transform , and the final transform cost . The block substitution has at most block pairs; each pair sums at most earlier blocks of bounded size and solves a system of dimension at most four, so all substitution work is .
Each sweep checks at most active blocks, and initialization and final checks add at most such calls. With sweeps there are at most sign/representation-controller calls. A bounded call executes at most instructions, giving 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 .
The backward-error accumulator starts with one outward Frobenius norm of the input, costing 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 scalar operations on active dimension : their dimension-dependent powers can be formed by repeated multiplication and a square root for a half-integer exponent. Thus the at most initialization coefficients cost in total, while each length-two/three chase coefficient costs . There are 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 scalar work; at most such writes occur per sweep, hence 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 and fits inside the cubic matrix-work bound, including failure branches.
The reductions, sweeps, exact certificates, transforms, block sums and fixed-size solves contribute , and step 1.4 supplies the complete control contribution. Adding them gives and the fixed- cubic consequence, or for the richer terminating route. No bound on integer bit length or bit-operation cost is used.
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 updates and a finite scan of the shifts. For every admissible shift with , its exact shifted solve exists uniquely. On completed, has at most columns and with the recorded residual factor . 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.
Low-rank ADI for a continuous Lyapunov equation defines the pair-consuming validation scan, individual-shift updates and statuses.
A negative-real-part shift of a Hurwitz matrix is invertible: Hurwitz and imply is invertible.
Proof
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 checks, including the empty list. For a pair the second entry is consumed by the validation scan, not incorrectly tested for a third partner. The update loop still visits both indices.
Each valid update has . 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 or an earlier return, so the procedure terminates.
Initialization has zero factor columns and . Each successful update appends columns and sets and by its explicit recurrence. Hence completion has at most columns and exactly the recorded output relations, also for . No contraction or limiting shift property was used.
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 has exactly one solution, namely the returned , 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.
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 , dimension at most four, and its specified adjugate solve.
The adjugate gives an explicit inverse formula over a field: nonzero determinant gives the two-sided inverse .
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.
Successful certified Bartels-Stewart substitution returns the exact Sylvester solution: a successful substitution returns an exact solution after checking its exact Schur factors.
Proof
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.
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 , so [F2] gives a unique exact local solution. Thus the whole traversal and final finite transforms terminate.
On success consider a homogeneous transformed equation . In the algorithm's traversal order, its first block satisfies , hence by step 2.1. Inductively, all earlier blocks entering the current right-hand side are zero, so its unique invertible pivot again forces . Every block therefore vanishes. Exact unitary Schur factors are invertible, so the original homogeneous operator also has zero kernel.
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
- Valeria Simoncini, Computational Methods for Linear Matrix Equations, SIAM Review 58(3), 2016
- Elias Jarlebring, Numerical Methods for Lyapunov Equations, lecture notes in numerical linear algebra, 2017
- MA1111 Linear Algebra I, Lecture 10: Determinants by Laplace Expansion and Inverses by Adjoint Matrices, Trinity College Dublin, Michaelmas 2016