Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Certified QZ residuals give a backward error bound for both pencil matrices

Statement

Suppose Finite-budget QZ iteration with homogeneous status and residual output returns exact unitary factor products Q,Z, factors S,T, and exact local arithmetic and deflation residuals as specified there. If each local residual pair has a certified bound, then the accumulated theorem Two-sided unitary errors in a matrix pencil accumulate as a backward perturbation pair gives perturbations ΔA,ΔB such that Q∗(A+ΔA)Z=S,Q∗(B+ΔB)Z=T, with combined Frobenius error bounded by the sum of the certified local pair errors and deflation errors. This implication is conditional: it does not assert such a bound for an arbitrary unspecified rotation implementation. For the specified successful canonical Givens implementation, Common computed Givens actions certify both pencil matrices and factor residuals supplies ℓj=η for actual matrix annihilations and ℓj=v for external-vector/raw actions. With structural writes included there and only separate tolerance writes Dtol,j, it gives the concrete bound P(ΔA,ΔB)≤∑jℓjP(Aj−1,Bj−1)+∑jP(Dtol,jA,Dtol,jB), where P(C,D)=(∥C∥F2+∥D∥F2)1/2. Tolerance deflations need not be O(u).

Independently, if the exact raw residuals are RA=Q∗AZ−S,RB=Q∗BZ−T, then the choices ΔA=−QRAZ∗ and ΔB=−QRBZ∗ satisfy the same equations and ∥ΔA∥F2+∥ΔB∥F2=∥RA∥F2+∥RB∥F2. Certified upper bounds on the two residual norms therefore give an a-posteriori backward-error certificate for the pair.

Facts & Assumptions

Given: A run with exact unitary factor records, computed factors (S,T), local arithmetic/deflation residuals, and any claimed certified residual norm upper bounds.

[F1]

Every finite-budget QZ run returns a status and records unitary transforms and explicit deflations: the completed run has the stated accumulated perturbation representation whenever all local residual certificates are available.

[F2]

Two-sided unitary errors in a matrix pencil accumulate as a backward perturbation pair: the global pair perturbation is bounded by the sum of the local pair and deflation norms.

[F4]

Common computed Givens actions certify both pencil matrices and factor residuals proves the actual common real/complex Givens pair update and target-write coefficients, and a stored factor-action residual evaluation with explicit norm/controller allowances.

[A1]

For the generic implication, local residual certificates remain hypotheses. The specified canonical implementation instantiates them by [F4] whenever its successful-operation hypotheses hold; alternative implementations require their own certificates.

Proof

1.1givenF1F2A1

Under [A1], apply [F1] and [F2] to the finite list of left/right QZ updates, keeping each explicit deflation as its own local perturbation. This gives Q∗(A+ΔA)Z=S and Q∗(B+ΔB)Z=T with the asserted sum of local pair error bounds. This step claims no size bound beyond the supplied certificates.

1.2givenF3algebraconstruct

From the definitions of RA,RB, set ΔA=−QRAZ∗ and ΔB=−QRBZ∗. Exact unitarity gives Q∗ΔAZ=−RA and Q∗ΔBZ=−RB, so adding the residuals proves both displayed backward equations. By [F3], ∥ΔA∥F=∥RA∥F and ∥ΔB∥F=∥RB∥F; squaring and adding proves the exact pair equality.

2.1F2F4step 1.1algebra

For the specified implementation, [F4] gives P(EjA,EjB)≤ℓjP(Aj−1,Bj−1). Put each pure tolerance deflation at its own identity stage, and pull back any post-action write before using [F2]. Structural writes are already counted in Ej, so summing proves the concrete displayed bound without double counting.

3.1F4step 1.2algebra∎

Under the independent residual route's successful-operation hypotheses, [F4] bounds each exact residual column by its computed diagnostic norm plus the propagated factor, stored-input matvec and subtraction allowances. Summing these column bounds gives certified residual upper bounds bA,bB, hence step 1.2 gives pair error at most bA2+bB2 (or conservatively bA+bB). If that route fails, no certificate is claimed from its diagnostic; the local-accumulation route remains available on its own hypotheses.

Depends on

Used by

Dependency tree · two levels

25 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