Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Givens reduction of a matrix pair to Hessenberg-triangular form

Definition

Input A,B∈Fn×n, n≥1, with F∈{R,C}. All transformations here are exact. Use zero-based matrix indices 0,…,n−1, as in Real Givens rotations and complex Givens transformations. Let Q=Z=In.

For a target pair (a,b), define the left factor L(a,b) deterministically. Use I2 if a=b=0. Otherwise put r=(∣a∣2+∣b∣2)1/2 and L=(cs−s‾c). Over R, take c=a/r, s=b/r. Over C, if a=0 take c=0, s=b‾/∣b∣; otherwise take ϕ=a/∣a∣, c=∣a∣/r, s=ϕb‾/r. Thus L(a,b)(a,b)T=(γ,0)T with ∣γ∣=r. Set J=(0110) and define the right factor R(a,b)=JL(b‾,a‾)∗J. Then (a,b)R(a,b)=(0,η) with ∣η∣=r; the zero pair again uses identity. These factors are real orthogonal over R or unitary over C, as direct multiplication shows in Householder reflectors and Givens transformations are unitary and can annihilate prescribed entries; the right identity follows by taking adjoints of the left annihilation of (b‾,a‾)T and reversing the coordinates. Use their identity embeddings on the two rows or columns specified by each step below.

  1. Triangularise B by left rotations. For j=0,…,n−1 and, in descending order, i=n−1,n−2,…,j+1, set L=L(Bi−1,j,Bi,j),A←LA,B←LB,Q←QL∗.

  2. Reduce A to upper Hessenberg form while restoring triangularity of B. For j=0,…,n−3 and, in descending order, i=n−1,n−2,…,j+2, set L=L(Ai−1,j,Ai,j),A←LA,B←LB,Q←QL∗, then set R=R(Bi,i−1,Bi,i),A←AR,B←BR,Z←ZR.

Return Q,Z,H=A,T=B, where H is upper Hessenberg and T is upper triangular in the senses of Upper Hessenberg matrices and real symmetric tridiagonal matrices and Upper triangular, lower triangular and diagonal square matrices over a commutative ring. The outputs are represented by the exact products of the recorded Givens factors; no dense rounded factor is asserted unitary.

Depends on

Used by

Dependency tree · two levels

9 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