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 be Hermitian positive semidefinite, let , and let with and . Set and . For the trace norm , defined as the sum of the singular values of , one has ,
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 , vector , and in the Statement.
A finite-dimensional Hermitian matrix has an orthonormal eigenbasis with real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Proof
Given: , , and with .
By [F1], write with . If , then For this is positive, so ; for the denominator is one.
Direct multiplication, using step 1.1, gives The Hermitian matrix has a resolvent at nonreal , so the displayed inverse is .
The difference in step 2.1 is a rank-one matrix. Its trace norm equals the product of the two vector norms divided by ; normality of makes both vector norms . Since , step 1.1 gives . The inequality then gives the trace bound. The case 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
- Z. D. Bai, B. Q. Miao, and G. M. Pan, On Asymptotics of Eigenvectors of Large Sample Covariance Matrix (standard reference, not scraped)
- Z. D. Bai and J. W. Silverstein, Spectral Analysis of Large Dimensional Random Matrices, 2nd ed. (standard reference, not scraped)