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 reported singular DIIS Gram system triggers the baseline fallback
Example
Let , , and . In the finite-basis model choose , , , and the real-linear map At and the commutator residuals are equal and nonzero, making the two-vector Gram matrix singular. A solver that reports this singular system uses the specified baseline fallback, even though the exact capped minimizer exists.
Facts & Assumptions
Given: The finite-basis model and DIIS proposal algorithm, with memory cap , current pair , preceding pair , coefficient cap , a configured bordered-Gram solver, and an exact Hermitian eigensolver for the mixed Fock matrix.
A finite-basis model accepts a real-linear self-adjoint and defines (Finite-basis projector energy model).
The capped least-squares problem has a unique minimum-norm minimizer even when its Gram matrix is singular (Capped DIIS coefficients have a unique minimum-norm least-squares selection).
A singular/uncertified configured least-squares solve requests the baseline SCF update (Finite-memory capped DIIS projector proposal with fallback).
Verification
The matrices are mutually Frobenius-orthogonal and . Put , so the displayed map is . Since this is a real-linear map into the Hermitian span of , symmetry of the Frobenius inner product gives for Hermitian . Thus the model data satisfy [F1].
Substitution gives and . The matrices and have eigenvalues , so both iterates have gap . Direct multiplication gives
Writing the common residual as , the Gram matrix is which is singular. The equality-constrained bordered system has matrix , whose first two rows coincide, so a solver that reports singularity takes the prescribed fallback. With , is feasible and minimizes the objective; the objective is constant on , so [F2] selects this unique minimum-norm minimizer. If a rank-revealing solver returns it instead of reporting singularity, then has no strict gap, and the proposal algorithm again falls back by its candidate-gap branch. Thus either outcome of this configured solve uses the baseline.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- Thorsten Rohwedder, An analysis for some methods and algorithms of quantum chemistry, Chapter 4 §4.1 (standard reference, not scraped)
- Homer F. Walker and Peng Ni, Anderson Acceleration for Fixed-Point Iterations, §1 (standard reference, not scraped)