Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Hermitian rank-one resolvent update and trace-norm bound

Statement

Let B∈Cd×d be Hermitian positive semidefinite, let x∈Cd, and let z=u+iη with u∈R and η>0. Set R=(B−zI)−1 and Rx=(B+xx∗−zI)−1. For the trace norm ∥M∥1, defined as the sum of the singular values of M, one has 1+x∗Rx≠0, Rx=R−Rxx∗R1+x∗Rx,∥Rx−R∥1≤1η,∣tr⁡Rx−tr⁡R∣≤1η.

Statement references

Bai, Miao, and Pan, the rank-one identity in §2, printed pp. 12–13 (full paper PDF).

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

Facts & Assumptions

Given: The Hermitian positive semidefinite matrix B, vector x, and z in the Statement.

[F1]

Proof

Given: B, x, and z=u+iη with η>0.

1.1givenF1algebra

By [F1], write B=Udiag⁡(λ1,…,λd)U∗ with λj≥0. If c=U∗x, then q:=x∗Rx=∑j∣cj∣2λj−z,Im⁡q=η∑j∣cj∣2∣λj−z∣2=η∥Rx∥22. For x≠0 this is positive, so 1+q≠0; for x=0 the denominator is one.

2.1step 1.1algebra

Direct multiplication, using step 1.1, gives (B+xx∗−zI)(R−Rxx∗R1+x∗Rx)=I. The Hermitian matrix B+xx∗ has a resolvent at nonreal z, so the displayed inverse is Rx.

3.1step 1.1step 2.1algebra∎

The difference in step 2.1 is a rank-one matrix. Its trace norm equals the product of the two vector norms divided by ∣1+q∣; normality of R makes both vector norms ∥Rx∥2. Since ∣1+q∣≥Im⁡q=η∥Rx∥22, step 1.1 gives ∥Rx−R∥1≤1/η. The inequality ∣tr⁡M∣≤∥M∥1 then gives the trace bound. The case x=0 has both differences zero.

Source notes

Bai, Miao, and Pan, §2, equations (2.1)–(2.2), printed pp. 12–13 (full paper PDF).

Depends on

Used by

Dependency tree · two levels

6 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