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.

One exact scalar elimination step updates a displacement generator

Statement

Let n≥2, let A=(dr∗ℓM)∈Cn×n with d≠0, and let s≥1 be an integer. Let Zn=(00e0Zn−1) be the lower shift partitioned after its first row and column. Suppose A−ZnAZn∗=GH∗,G=(G^Gb),H=(H^Hb), where G,H∈Cn×s, G^,H^∈C1×s, and Gb,Hb∈C(n−1)×s. Let S:=M−ℓd−1r∗ be the scalar-pivot Schur complement. Define p:=e0+(Zn−1ℓ−ℓ)/d,q:=e0+(Zn−1r−r)/d‾,G′:=Gb+pG^,H′:=Hb+qH^. Then S−Zn−1SZn−1∗=G′H′∗. Thus the updated displacement rank is at most s, although it can decrease. This is an exact identity conditional on the nonzero pivot d; it makes no conditioning or growth claim.

Facts & Assumptions

Given: The block matrix A, nonzero scalar pivot d, lower shifts, and a width-s generator G,H for A−ZnAZn∗.

[F1]

The lower shift and displacement are Zn and A−ZnAZn∗. Lower-shift displacement rank and generator pairs

[F2]

Eliminating an invertible leading block uses the Schur complement A22−A21A11−1A12. Block LU factorisation and the associated Schur complement

[F3]

Matrix products are evaluated by their finite entry sums. Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes Here B∗ denotes the conjugate transpose, (B∗)ij:=Bji‾.

Proof

1.1F1F3algebra

Write e=e0∈Cn−1 and Z′=Zn−1. Direct block multiplication using [F3] gives ZnAZn∗=(000(ed+Z′ℓ)e∗+(er∗+Z′M)Z′∗). Therefore the first row and column of A−ZnAZn∗ are (d,r∗) and (d,ℓ)T, while its lower-right block is M−Z′MZ′∗−dee∗−Z′ℓe∗−er∗Z′∗.

2.1givenstep 1.1algebra

Comparing the four blocks of GH∗=A−ZnAZn∗ in step 1.1 gives G^H^∗=d, GbH^∗=ℓ, G^Hb∗=r∗, and GbHb∗=M−Z′MZ′∗−dee∗−Z′ℓe∗−er∗Z′∗.

3.1F2step 2.1algebra

From the definitions of G′ and H′, G′H′∗=GbHb∗+ℓq∗+pr∗+dpq∗. Here q∗=e∗+(r∗Z′∗−r∗)/d and p=e+(Z′ℓ−ℓ)/d. Expand them separately: ℓq∗=ℓe∗+(ℓr∗Z′∗−ℓr∗)/d,pr∗=er∗+(Z′ℓr∗−ℓr∗)/d, dpq∗=dee∗+er∗Z′∗−er∗+(Z′ℓ−ℓ)e∗+((Z′ℓ−ℓ)(r∗Z′∗−r∗))/d. The non-fractional terms combine to dee∗+Z′ℓe∗+er∗Z′∗, and the common fractional numerator simplifies by distributivity: ℓr∗Z′∗−ℓr∗+Z′ℓr∗−ℓr∗+(Z′ℓ−ℓ)r∗Z′∗−(Z′ℓ−ℓ)r∗=−ℓr∗+Z′ℓr∗Z′∗. Thus ℓq∗+pr∗+dpq∗=dee∗+Z′ℓe∗+er∗Z′∗−ℓr∗/d+Z′ℓr∗Z′∗/d, as required. Substituting [F2] and step 2.1 now yields G′H′∗=M−Z′MZ′∗−ℓr∗/d+Z′ℓr∗Z′∗/d=S−Z′SZ′∗.

4.1step 3.1algebra∎

The factors G′,H′ each have s columns, so their product has rank at most s. A strict rank decrease is possible when columns become dependent; no exact rank preservation or numerical growth bound is asserted.

Remarks

The source's general generator block-update lemma states the same structural fact for a block pivot. The scalar lower-shift specialization above supplies its full algebraic verification. A nonzero pivot permits this exact update; it does not guarantee a well-conditioned or small-growth elimination.

Depends on

Used by

Nothing in the library uses this result yet.

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