Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Exact unitary equivalence of Householder bidiagonalization

Statement

For A∈Fm×n over F=R or C, the exact-arithmetic algorithm Householder bidiagonalization and its finite precision status returns unitary U,V and an upper bidiagonal B∈Fp×p, p=min⁡(m,n), such that if m≥n then U∗AV=[B0], and if m<n then U∗A∗V=[B0].

Facts & Assumptions

Given: A matrix A∈Fm×n and the exact-arithmetic Householder bidiagonalization algorithm.

[F1]

Householder bidiagonalization and its finite precision status applies a left Householder to the active column at step k and, when k<p, a right Householder to the conjugate transpose of the active row after column k. For each nonzero active vector z, it chooses ϕ=z1/∣z1∣ when z1≠0 and ϕ=1 otherwise, α=−ϕ∥z∥2, v=z−αe1, h=v/∥v∥2, and H=I−2hh∗. A zero vector uses the identity.

Proof

1.1F1F2algebra

For any nonzero active vector z, [F1] specifies N=∥z∥2, ϕ=z1/∣z1∣ if z1≠0 and ϕ=1 otherwise, α=−ϕN, v=z−αe1, and h=v/∥v∥2. Since α‾z1=−N∣z1∣, direct expansion gives v∗z=N2+N∣z1∣>0 and v∗v=2(N2+N∣z1∣). Thus v≠0, h∗h=1, and H=I−2hh∗ satisfies H∗=H and Hz=z−2v(v∗z)/(v∗v)=αe1. It is unitary by [F2]. For z=0 the specified identity has the same zero-annihilation property. This verifies the actual negative-phase construction on both the column vector and the conjugate-transposed row vector.

2.1F1step 1.1

At step k, the left reflector acts only on rows k:M. It therefore leaves all rows 1,…,k−1 unchanged and maps the active part of column k to its first coordinate, making entries below (k,k) zero. The right reflector acts only on columns k+1:p, so it preserves the zeros already made in column k and maps the active part of row k to its first coordinate, making entries beyond (k,k+1) zero.

3.1step 2.1F1induction

Inductively, before stage k, each earlier column ℓ<k has zeros in rows k:M, so the left update preserves those zeros. Each earlier row ℓ<k has zeros in columns k+1:p, so the right update preserves those zeros as well; neither update touches its earlier retained entries. Step 2.1 supplies the new column and row zeros. At the last stage, column p also has zeros below row p. Induction therefore gives an upper bidiagonal leading p×p block and zero bottom M−p rows. For p=0 the work matrix is already the empty tall matrix and both initialized factors are identities.

4.1F1F2step 3.1algebra∎

The update rules in [F1] maintain the invariant C=U∗C0V, where C0 is the initial tall-oriented matrix. Every factor is unitary by [F2], so the accumulated U,V are unitary. Combining this invariant with step 3.1 gives the asserted tall reduction. In the wide case it applies to A∗, and taking adjoints gives A=V[B∗0]U∗.

Depends on

Used by

Dependency tree · two levels

7 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