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.
A common separating resolvent contour certifies a Lipschitz response map
Statement
Let be a set of Hermitian inputs and suppose is -Lipschitz in Frobenius norm. Assume that for some Hermitian with occupied gap , every lies in the open operator-norm ball of radius about . Use the common circle of A spectral gap persists on a computable matrix ball with a uniform resolvent bound, with . Then Thus is a checkable contraction certificate when also ; a positive gap by itself does not establish that inequality.
Facts & Assumptions
Given: A set , a map , a Lipschitz constant , and a Hermitian reference matrix with gap such that for every .
The occupied projector is the rank- spectral projector of (The occupied-projector response map on its strict-gap domain).
The same contour separates all matrices in the stated ball and has resolvent bound (A spectral gap persists on a computable matrix ball with a uniform resolvent bound).
On the open operator-norm ball of radius about , the occupied block projector is real Frechet and for every Hermitian (A separated block spectral projector is Frechet differentiable with a resolvent bound).
The operator norm is bounded by the Frobenius norm; both norms are defined on finite matrices (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, The Frobenius norm on real or complex matrices, Spectral and Frobenius norms are unitarily invariant, are given by singular values, and satisfy the sharp rank comparison).
A continuous path that is differentiable on with satisfies (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz).
A strict gap makes the rank- occupied projector unique (A strict occupied gap defines a unique rank-r spectral projector).
Proof
For , set , , , and . For , the operator-norm triangle inequality gives . Thus the whole matrix segment lies in the open ball of [F3], even when is not convex. By [F2] and [L1] its occupied projector is well-defined, and by [F1] the path has endpoints and .
The path is continuous on by [F3]. At each , the Frechet expansion in the direction gives , so ; if , the path is constant and this identity still holds. By [F3], . Listing the real and imaginary parts of all matrix entries identifies the Frobenius norm with the Euclidean norm on by [F4], so [F5] applies to this path with precisely that bound.
By [F5] and the endpoint identities from step 1.1, . This is the asserted estimate with . If and , it is exactly the contraction condition on .
Depends on
- The occupied-projector response map on its strict-gap domain
- A strict occupied gap defines a unique rank-r spectral projector
- A spectral gap persists on a computable matrix ball with a uniform resolvent bound
- A separated block spectral projector is Frechet differentiable with a resolvent bound
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The Frobenius norm $\lVert A\rVert_F=(\sum_{i,j}|a_{ij}|^2)^{1/2}$ on real or complex matrices
- Spectral and Frobenius norms are unitarily invariant, are given by singular values, and satisfy the sharp rank comparison
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
51 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
- Tosio Kato, Perturbation Theory for Linear Operators, 2nd ed., Chapter II §1.3–§1.4 (standard reference, not scraped)
- Eric Cancès, Gaspard Kemlin, and Antoine Levitt, Convergence analysis of direct minimization and self-consistent iterations, §3.2 (standard reference, not scraped)