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 , let with , and let be an integer. Let be the lower shift partitioned after its first row and column. Suppose where , , and . Let be the scalar-pivot Schur complement. Define Then Thus the updated displacement rank is at most , although it can decrease. This is an exact identity conditional on the nonzero pivot ; it makes no conditioning or growth claim.
Facts & Assumptions
Given: The block matrix , nonzero scalar pivot , lower shifts, and a width- generator for .
The lower shift and displacement are and . Lower-shift displacement rank and generator pairs
Eliminating an invertible leading block uses the Schur complement . Block LU factorisation and the associated Schur complement
Matrix products are evaluated by their finite entry sums. Rectangular matrix multiplication and the identity matrix , including zero-sized shapes Here denotes the conjugate transpose, .
Proof
Write and . Direct block multiplication using [F3] gives Therefore the first row and column of are and , while its lower-right block is
Comparing the four blocks of in step 1.1 gives , , , and
From the definitions of and , Here and . Expand them separately: The non-fractional terms combine to , and the common fractional numerator simplifies by distributivity: Thus as required. Substituting [F2] and step 2.1 now yields
The factors each have columns, so their product has rank at most . 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
- Daniel Kressner and Robert Luce, Fast computation of the matrix exponential for a Toeplitz matrix, Lemma 3.1 (standard reference, not scraped)