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.
Two-sided unitary errors in a matrix pencil accumulate as a backward perturbation pair
Statement
Let , , , and . Put , . For , suppose exact unitary/orthogonal factors and local arithmetic/deflation perturbations satisfy Then with and (empty products are ) there are perturbations such that and
Facts & Assumptions
Given: Finite sequences of square matrices and exact unitary update factors as in the statement.
Local unitary-similarity perturbations accumulate as a backward perturbation: a sequence with unitary has a global unitary similarity representation whose Frobenius perturbation is bounded by .
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: block matrix multiplication uses the usual row-by-column products.
The Frobenius norm on real or complex matrices: the Frobenius norm is the square root of the sum of squared moduli of all matrix entries.
Proof
If , take and ; the equations and bound hold. For , form the block matrix and . Put the local in the first block row of and the local in the first block row of , with all other blocks zero. Then [F2] and the stated updates give . Each is unitary/orthogonal because its diagonal blocks are unitary/orthogonal.
For , apply [F1] to the augmented sequence. Its accumulated perturbation has only the two first-row, off-diagonal blocks, because conjugation by each block diagonal preserves those block positions. Call them . By [F3], and likewise for . Therefore the global bound from [F1] is exactly the displayed pair bound, and the accumulated block products are .
Depends on
Used by
Dependency tree · two levels
12 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
- Daniel Kressner, Numerical Methods and Software for General and Structured Eigenvalue Problems (PhD dissertation, 2004), Chapter 2: The QZ Algorithm, §§2.3–3.5 (standard reference, not scraped)
- Peter Arbenz, Lecture Notes on Solving Large Scale Eigenvalue Problems, §12.8 (standard reference, not scraped)