Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Rank-one resolvent update and trace bound for a positive semidefinite matrix

Statement

Let B be a real symmetric non-negative d×d matrix, let x∈Rd, and let z=u+iη with u∈R and η>0. Put R=(B−zI)−1 and Rx=(B+xxT−zI)−1. Then 1+xTRx≠0, Rx=R−RxxTR1+xTRx, and ∣tr⁡Rx−tr⁡R∣≤1η.

Statement references

Bai and Silverstein, Chapter 3, §3.3, printed pp. 53–54 (complete book PDF).

Junyi Liao, Chapter 2, §2.1.3, printed pp. 35–36 (complete lecture notes).

Facts & Assumptions

Given: The real symmetric matrix B, vector x, and non-real spectral parameter z in the Statement.

Proof

1.1givenF1algebra

By [F1], write B=Udiag⁡(λ1,…,λd)UT with λj≥0. Thus R exists, is normal, and xTRx=∑j(UTx)j2λj−z,Im⁡(xTRx)=η∑j(UTx)j2(λj−u)2+η2. If x≠0, this imaginary part is strictly positive, so 1+xTRx≠0; if x=0, the denominator is 1.

2.1step 1.1algebra

Direct multiplication verifies (B+xxT−zI)(R−RxxTR1+xTRx)=I. Since B+xxT is also real symmetric and z∉R, its resolvent exists; hence the displayed expression is Rx.

3.1F1step 2.1algebra∎

Taking traces in step 2.1 gives tr⁡(Rx−R)=−xTR2x1+xTRx. In the eigenbasis of [F1], ∣xTR2x∣≤∑j(UTx)j2(λj−u)2+η2=Im⁡(xTRx)η. Also ∣1+xTRx∣≥Im⁡(xTRx) when x≠0; for x=0 the trace difference is zero. Combining these inequalities proves the stated 1/η bound.

Depends on

Used by

Dependency tree · two levels

4 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