Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Two-sided unitary errors in a matrix pencil accumulate as a backward perturbation pair

Statement

Let n≥1, m≥0, F∈{R,C}, and A,B∈Fn×n. Put A0=A, B0=B. For j=1,…,m, suppose exact unitary/orthogonal factors Qj,Zj and local arithmetic/deflation perturbations satisfy Aj=Qj∗(Aj−1+EjA+DjA)Zj, Bj=Qj∗(Bj−1+EjB+DjB)Zj. Then with Q=Q1⋯Qm and Z=Z1⋯Zm (empty products are In) there are perturbations ΔA,ΔB such that Am=Q∗(A+ΔA)Z,Bm=Q∗(B+ΔB)Z, and ∥ΔA∥F2+∥ΔB∥F2≤∑j=1m(∥EjA∥F2+∥EjB∥F2+∥DjA∥F2+∥DjB∥F2).

Facts & Assumptions

Given: Finite sequences of square matrices and exact unitary update factors as in the statement.

[F1]

Local unitary-similarity perturbations accumulate as a backward perturbation: a sequence Hj=Pj∗(Hj−1+Ej+Dj)Pj with unitary Pj has a global unitary similarity representation whose Frobenius perturbation is bounded by ∑j(∥Ej∥F+∥Dj∥F).

[F2]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes: block matrix multiplication uses the usual row-by-column products.

[F3]

The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices: the Frobenius norm is the square root of the sum of squared moduli of all matrix entries.

Proof

1.1givenF1F2constructalgebra

If m=0, take Q=Z=In and ΔA=ΔB=0; the equations and bound hold. For m≥1, form the 3n×3n block matrix Mj=(0AjBj000000) and Pj=diag⁡(Qj,Zj,Zj). Put the local EjA,EjB in the first block row of Ej and the local DjA,DjB in the first block row of Dj, with all other blocks zero. Then [F2] and the stated updates give Mj=Pj∗(Mj−1+Ej+Dj)Pj. Each Pj is unitary/orthogonal because its diagonal blocks are unitary/orthogonal.

2.1givenF1F3step 1.1algebra∎

For m≥1, apply [F1] to the augmented sequence. Its accumulated perturbation has only the two first-row, off-diagonal blocks, because conjugation by each block diagonal Pj preserves those block positions. Call them ΔA,ΔB. By [F3], ∥Ej∥F=∥EjA∥F2+∥EjB∥F2 and likewise for Dj. Therefore the global bound from [F1] is exactly the displayed pair bound, and the accumulated block products are Q,Z.

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