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 two-vector LOBPCG block resolves a clustered pair in one finite Rayleigh-Ritz update
Example
Consider the mass-normalized vibration matrix with and preconditioner . The two wanted lowest modes are close, while the next mode is separated. Run the width- algorithm with residual tolerance and budget . Start with the orthonormal block
Verification
Given: The matrix, metric, preconditioner, and two starting vectors above.
[F1] Finite-budget block LOBPCG for a Hermitian-definite pencil with explicit rank-loss status: LOBPCG forms , , uses the trial span of , and selects its q smallest Ritz values after Rayleigh-Ritz.
[F2] A successful LOBPCG Rayleigh-Ritz update cannot increase the selected Ritz values: on a successful update retaining , each selected Ritz value cannot increase.
[F3] A principal-angle bound encloses the largest selected generalized Ritz value across a spectral gap: if the first q generalized eigenvalues are separated and is the maximum principal angle, then .
The vectors are orthonormal and have disjoint coordinate supports. Their initial Rayleigh quotients are and . Each has two nonzero coordinates associated with distinct diagonal entries of , so ; also , and lies in the same two-coordinate plane as . Thus are independent in that plane, and the disjoint planes make rank four.
Since , and the first trial space is all of . Its Rayleigh-Ritz values are exactly , and the selected block is . The update is successful because the trial rank is four; the returned residuals are zero, so the algorithm returns converged. In particular, and , as required by [F2].
For , every unit vector in has squared norm in , so . The strict gap holds, and [F3] gives , attained by the computed . The block captures both clustered modes; a one-dimensional trial space cannot contain this two-dimensional invariant subspace.
Depends on
- Finite-budget block LOBPCG for a Hermitian-definite pencil with explicit rank-loss status
- Generalized Ritz values obey min-max bounds and are monotone under trial-space inclusion
- A principal-angle bound encloses the largest selected generalized Ritz value across a spectral gap
- A successful LOBPCG Rayleigh-Ritz update cannot increase the selected Ritz values
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Peter Arbenz, Lecture Notes on Solving Large Scale Eigenvalue Problems, §13.6 (standard reference, not scraped)
- Andrew Knyazev, Recent implementations, applications, and extensions of LOBPCG, §1 (standard reference, not scraped)