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.
For a Hermitian simple eigenvalue, one may take and the first-order formulas simplify accordingly
Statement
If is a differentiable Hermitian matrix path, and is a differentiable simple eigenpair branch with , then one may choose the phase locally so that . With that choice,
Facts & Assumptions
Given: A differentiable Hermitian matrix path and a differentiable simple unit eigenvector branch .
For a simple eigenpair, the eigenvalue derivative is , and in a fixed gauge the eigenvector derivative is (Along a differentiable matrix path, a simple eigenvalue satisfies under the normalization , In a fixed gauge, the derivative of a simple right eigenvector is obtained by applying the reduced resolvent to the perturbation).
Proof
If and , then taking adjoints shows . Thus the same unit eigenvector can serve as both left and right eigenvector. Multiplying by a unit complex phase if necessary imposes the gauge .
Substitute into the formulas summarized in [L1]. This gives and, in the chosen gauge, .
Depends on
- Along a differentiable matrix path, a simple eigenvalue satisfies $\lambda'=y^*A'x$ under the normalization $y^*x=1$
- In a fixed gauge, the derivative of a simple right eigenvector is obtained by applying the reduced resolvent to the perturbation
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
Used by
Dependency tree · two levels
7 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
- Alan Edelman and Steven G. Johnson, Matrix Calculus for Machine Learning and Beyond (standard reference, not scraped)