Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Scaled complex Householder and Givens steps have explicit local backward errors

Statement

Use Scaled real and complex Householder and Givens update arithmetic successfully, with 0<u<1 and (r−1)u<1 for every Householder dimension r. For a nonzero Householder column define e=(1+u)r+3−1,aϕ=1+u(1−u)4−1,aα=(1+aϕ)(1+e)(1+u)−1,dv=aα+u(2+aα), aτ=1+u(1−u)2r−1,g=1+6u1−(r−1)u−1,cU=2((1+aτ)(1+u)(1+6u)(1+g)−1), ηH(r)=max⁡{aα+8dv,(1+u)cU+3u}. For a Givens step define a2=1+u(1−u)2−1,q=max⁡{(1+u1−u)3−1,(1+a2)(1+6u)(1+u)(1−u)3−1}, ϵ=2(7u+6u2)(1+q),v=q+ϵ,ηG=2v+u+2q. Each complete left update, including its target zero write, has an exact unitary representative W and perturbation E with W(C+E)=C+,∥E∥F≤η∥C∥F, where η=ηH(r) or ηG. Identity branches have E=0. The corresponding right relation follows by conjugate transposition. For a Givens application without an annihilation overwrite use the smaller coefficient v; for a Householder separate-block application use (1+u)cU+3u. All coefficients are explicit and O(ru) or O(u) for fixed dimensions.

Facts & Assumptions

Given: The stated real/complex arithmetic realization and successful no-underflow operations.

[F1]

Scaled real and complex Householder and Givens update arithmetic fixes the scaled norm, coefficient formation, product order, zero branches and exact target writes.

[F2]

If |delta_i| <= u and n u < 1, then prod (1+delta_i) = 1 + theta_n with |theta_n| <= gamma_n bounds products of rounding factors and sequential addition expansions.

Proof

1.1givenF1F2algebra

A complex product's real/imaginary error is at most 2(2u+u2)∣z∣∣w∣≤6u∣z∣∣w∣: bound each of its four real products and then its two component additions. A sequential complex dot of length r therefore has error at most [6u+γr−1(1+6u)]∑i∣zi∣∣wi∣=g∑i∣zi∣∣wi∣. These expansions include exact zeros.

1.2F1F2algebra

A scaled norm with 2r real components has its positive squared sum multiplied termwise by between (1−u)2r+2 and (1+u)2r+2, including two scaling factors. Square root and rescaling give relative norm error at most e. The independently scaled modulus of x1 has lower/upper factors (1−u)4,(1+u)4, so the phase division error relative to x1/∣x1∣ is at most aϕ; when x1=0 it is zero. Thus for N=∥x∥, α0=−phase⁡(x1)N and v0=x−α0e1, one has ∣α^−α0∣≤aαN and ∥v−v0∥≤dvN. For exponents at least one the lower deviation is bounded by the upper by convexity, justifying these two-sided estimates.

2.1step 1.2algebra

The identity H(v)∗H(v)=I follows by multiplying I−2vv∗/(v∗v). The exact phase choice gives H(v0)x=α0e1 and ∥v0∥≥N by direct inner-product expansion. Normalization gives ∥a/∥a∥−b/∥b∥∥≤2∥a−b∥/∥b∥; expanding the difference of unit-vector projectors therefore gives ∥H(v)−H(v0)∥≤8dv. The target-column error is at most (aα+8dv)N.

2.2F1step 1.1algebra

For Givens formation at stored z,w, the norm h has relative factors between (1−u)3 and (1+u)3, since its unscaled four-component squared sum has at most four rounding factors per term. The norm nz has exponents two. Let G0 be the exact canonical Givens annihilator for (z,w), with coefficients c0=∣z∣/∥(z,w)∥ and s0=(z/∣z∣)w‾/∥(z,w)∥ when z≠0. The phase error is at most a2; the coefficient numerator, denominator, six-operation complex product and division errors therefore give ∣c−c0∣≤qc0 and ∣s−s0∣≤q∣s0∣. If z=0, c=0 and s0=w‾/∣w∣; the smaller bound (1+u)/(1−u)3−1≤q applies. Hence ∥(c,s)−(c0,s0)∥≤q.

3.1F1step 1.1step 2.1algebra

The positive real sum defining w has bounds (1−u)2r∥v∥2≤w≤(1+u)2r∥v∥2. The final division gives ∣τ^∥v∥2/2−1∣≤aτ. The dot-product error in step 1.1, the componentwise real multiplication by τ^ and the final complex multiplication bound the rank-one update error by cU∥B∥F. Final subtraction adds at most u(3+cU)∥B∥F. Combine this with step 2.1 over disjoint columns to get the Householder bound. For the zero column take the identity exactly.

3.2step 2.2algebra

Put t=c2+∣s∣2>0 and Q=T/t. Direct multiplication gives T∗T=t2I, so Q is canonical unitary, ∥T−Q∥=∣t−1∣≤q and ∥T∥≤1+q. Normalization also gives ∥Q−G0∥≤2q; differences of canonical blocks have norm equal to the Euclidean norm of their coefficient differences. Each computed output entry has error at most (7u+6u2)(∣c∣∣C1j∣+∣s∣∣C2j∣), by two products and their addition. The absolute coefficient block has norm at most 2t. Thus the raw update differs from QC by at most v∥C∥F.

4.1F1step 2.2step 3.2algebra

Scaling introduced ∥λ(z,w)−(a,b)∥≤u∥(a,b)∥. Because G0 annihilates (z,w), its exact target residual for (a,b) is at most u∥(a,b)∥; under Q it is at most (u+2q)∥(a,b)∥. Writing the rounded target to zero adds at most (u+2q+v)∥(a,b)∥ to the raw update discrepancy, so the total is at most ηG∥C∥F. No unrelated matrix entry is zeroed for a shift-vector rotation. Identity branches have zero discrepancy.

5.1step 3.1step 4.1algebraconstruct∎

In every left case choose E=W∗C+−C, with W=H(v) or Q; unitarity gives the stated equation and equal error norm. Right updates follow by conjugate transposition and invariance of Frobenius norm. All coefficients are finite explicit functions under the stated conditions, vanish at u=0, and have first derivatives bounded by a fixed multiple of the active dimension, proving the asymptotics.

Depends on

Used by

Dependency tree · two levels

8 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