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.
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.
Depends on
Used by
- Finite-budget Bartels-Stewart solve for a Sylvester equation Algorithm
- Finite-budget exact or safeguarded inexact Newton-Kleinman policy iteration Algorithm
- Sylvester operator and Frobenius separation number Definition
- A Sylvester equation is uniquely solvable exactly when the spectra are disjoint Theorem
Dependency tree · two levels
6 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
- Valeria Simoncini, Computational Methods for Linear Matrix Equations, SIAM Review 58(3), 2016 (standard reference, not scraped)
- Elias Jarlebring, Numerical Methods for Lyapunov Equations, lecture notes in numerical linear algebra, 2017 (standard reference, not scraped)