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.
Self consistent projector iterations and certified mixing
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Arc Length and Rectifiable Curves
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite basis projector energies and variational electronic structure
- Finite Counting, Factorials and Binomial Coefficients
- Finite-element eigenvalue approximation
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear equations and Newton methods
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page defines the self-consistent occupied-projector map only where a strict occupied/unoccupied spectral gap makes the rank- projector unique. It distinguishes undamped projector iteration from convex density mixing: relaxed densities remain Hermitian, positive, bounded by the identity, and fixed-trace, but need not remain idempotent. A common separating resolvent contour gives a block-projector derivative and explicit resolvent/Lipschitz bounds, including the case of repeated eigenvalues within either spectral cluster.
The undamped convergence result requires a complete invariant set and a verified contraction factor ; a positive gap or damping parameter alone does not provide one. Inexact eigensolves contribute an additive error term. DIIS is a capped finite-memory proposal with singular-solver and gap fallbacks. A candidate is accepted only when a separately certified fixed-point residual places it inside the contractive error budget; the least-squares commutator residual alone is not an error certificate. Level shifts preserve a fixed occupied projector only under commutation and strict shifted block ordering. Finite iteration caps retain explicit gap-loss, eigensolver-failure, and budget-exhaustion outcomes.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Capped DIIS coefficients have a unique minimum-norm least-squares selection
Statement
Let , let be complex matrices of one fixed shape, and let . Define and . Then attains a minimum on . Among all minimizers there is a unique vector of minimum Euclidean norm. This rule defines the exact capped DIIS coefficient vector even when the least-squares Gram matrix is singular.
Facts & Assumptions
Given: A positive integer , matrices of the same finite shape, and a real cap .
The Frobenius norm is a norm on the finite-dimensional matrix space (The Frobenius norm on real or complex matrices).
A closed bounded subset of is compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), and a continuous real function on a nonempty compact metric space attains its minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Real absolute values satisfy and (The triangle inequality, Basic properties of the absolute value).
Proof
The vector belongs to because its entries sum to and its norm is . Thus the coefficient set is nonempty. For , each , and [F3] gives ; hence both and are continuous. Their closed level sets show that is closed. It is bounded because and . Therefore [F2] makes compact.
Put . By the triangle inequality and homogeneity of the Frobenius norm, , so is continuous; the reverse triangle inequality then makes continuous. By [F2], attains a minimum on the nonempty compact set . The set is closed and bounded in , hence compact by [F2], and it is nonempty by attainment.
For and , the coefficients satisfy . By [F3], , so is convex. Expanding each complex matrix entry gives for real . Applying this identity to and shows when ; since the combination is feasible and is the minimum, it also lies in . Thus is convex. The function is continuous, so compactness of gives a minimizer .
If distinct both had minimum Euclidean norm, their midpoint would lie in and satisfy contradicting minimality. Thus is the unique minimum-norm least-squares minimizer. No nonsingularity of the Gram matrix is needed for existence or tie-breaking.
The occupied-projector response map on its strict-gap domain
Definition
Let , , and use the real Hermitian matrix space and projector set of Rank-r orthogonal projector domain. Let be open and let be a specified map. For a Hermitian matrix , write its eigenvalues with multiplicity in ascending order as Write for its finite spectrum, with multiplicity omitted in this set notation. For any Hermitian with , write for the orthogonal projector onto the sum of eigenspaces belonging to its lowest eigenvalues. At a point where define . The strict gap separates the occupied cluster from the unoccupied cluster; eigenvalue multiplicities within either cluster are allowed. The construction's well-definedness as a unique member of is proved in A strict occupied gap defines a unique rank-r spectral projector ↗.
A set has a uniform occupied/unoccupied gap when the displayed gap is at least for every . A self-consistent fixed point is a point with . Its fixed-point residual is whenever is defined. The map is not asserted to be contractive merely because its gap is positive.
The fixed-particle admissible Hermitian density domain
Definition
For and , let and be as in Rank-r orthogonal projector domain. The admissible fixed-particle density domain is where means for every , and means . A member of need not be idempotent. The matrix norm and metric used below are the Frobenius norm and its induced metric. Every rank- orthogonal projector is in by Every rank-r orthogonal projector is an admissible density ↗.
A spectral gap persists on a computable matrix ball with a uniform resolvent bound
Statement
Let have eigenvalues with multiplicity and gap . Put and let be positively oriented. For Hermitian , write . Then . For every Hermitian with , exactly the lowest eigenvalues of , counted with multiplicity, lie inside ; the gap is at least , and
Facts & Assumptions
Given: A Hermitian , integers and , and .
Descending ordered Hermitian eigenvalues change by at most the operator norm of the matrix perturbation (Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz); ascending order is obtained by reversing indices, so the same bound holds for the ascending convention used here.
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).
The operator norm is the supremum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Proof
Since , we have . Reversing the descending-index convention in [F1] gives the same perturbation bound for the ascending eigenvalues used here. Thus if , then and . Since , every first- eigenvalue therefore satisfies , so it lies at least inside the circle centered at .
The same eigenvalue estimate gives , so all remaining eigenvalues satisfy and lie at least outside the circle. Also . Thus the contour separates exactly the occupied cluster and the stated gap persists.
By [F2], the spectrum of is real and diagonalizes unitarily. For every , reverse triangle gives by steps 1.1 and 2.1. In the unitary eigenbasis, is diagonal with entries of modulus at most . Applying [F3] to a unit vector in this basis gives .
A strict occupied gap defines a unique rank-r spectral projector
Statement
For every at which the response map of The occupied-projector response map on its strict-gap domain has a strict th gap, is a uniquely defined member of . Degeneracies among the first eigenvalues or among the remaining eigenvalues do not affect it.
Facts & Assumptions
Given: A Hermitian matrix with ordered eigenvalues and .
A finite-dimensional Hermitian matrix has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The response-map definition selects the sum of eigenspaces belonging to the lowest eigenvalues (The occupied-projector response map on its strict-gap domain).
The trace of a square matrix is the sum of its diagonal entries (The trace as the sum of the diagonal entries).
Proof
By [F1], choose an orthonormal eigenbasis of with the eigenvalues in the given order. The strict gap prevents an eigenspace for one eigenvalue from straddling positions and , so the sum of the first eigenspaces is the span of exactly the first basis vectors.
Changing the orthonormal basis within a repeated eigenspace below the gap leaves that entire eigenspace in the sum; changing one within a repeated eigenspace above the gap leaves that entire eigenspace out. Thus the selected subspace does not depend on the eigenbasis chosen in step 1.1. Its orthogonal projector is , which satisfies and by orthonormality. By [F3], , since each is a unit vector.
The operator in step 2.1 is independent of all allowed basis choices, lies in by [L1], and is exactly the map specified by [F2]. Hence it is the unique rank- occupied spectral projector.
Every rank-r orthogonal projector is an admissible density
Statement
Every belongs to the admissible density domain .
Facts & Assumptions
Given: satisfies , , and , where .
The rank- projector set is (Rank-r orthogonal projector domain).
A finite-dimensional Hermitian matrix has an orthonormal eigenbasis and real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The admissible domain consists of Hermitian positive contractions of trace (The fixed-particle admissible Hermitian density domain).
Proof
By [F2], choose a unitary eigenbasis of with real eigenvalues . From , each satisfies , hence . Therefore every eigenvalue lies between and , so for each the quadratic forms and are nonnegative.
The matrix is Hermitian and has trace by [F1]; step 1.1 gives . These are exactly the conditions in [F3], so .
The admissible Hermitian density domain is closed, convex, and complete
Statement
For and , the set of The fixed-particle admissible Hermitian density domain is nonempty, closed, and convex in , and complete in the Frobenius metric.
Facts & Assumptions
Given: Integers , , the real vector space with Frobenius norm, and .
The domain and its order conditions are as in The fixed-particle admissible Hermitian density domain.
Every Euclidean Cauchy sequence in a finite-dimensional real coordinate space converges ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ).
Proof
The diagonal matrix with ones is Hermitian, satisfies , and has trace . Thus , so the domain is nonempty.
Identify with by listing the real diagonal entries and, for each , the coordinates and . This real-linear map is bijective, since the lower-triangular entries are recovered by conjugation, and its squared Euclidean norm is . Thus it is an isometry. If is Frobenius-Cauchy, its image is Cauchy in , so [F2] gives a limit whose inverse image satisfies in Frobenius norm.
For each fixed , , since each matrix entry is bounded by the Frobenius norm. The same estimate applies to . Both quadratic forms therefore converge; their terms are nonnegative, so their limits are nonnegative and . Also , so . Hence .
Steps 1.2 and 2.1 show that every Frobenius-Cauchy sequence in converges to a member of , so the domain is complete. To prove closedness directly, for each fixed the real-valued maps and are continuous, since their differences at have modulus at most . The trace is continuous as . Thus is the intersection of the closed preimages of under these quadratic-form maps and of under the trace map. An arbitrary intersection of closed sets is closed.
If and , then is Hermitian; its quadratic form and that of are convex combinations of nonnegative quadratic forms, and its trace is . Hence it lies in , proving convexity.
A separated block spectral projector is Frechet differentiable with a resolvent bound
Statement
Let have an occupied/unoccupied gap , and let be the circle from A spectral gap persists on a computable matrix ball with a uniform resolvent bound. For Hermitian in the open operator-norm ball , let be its projector onto the lowest eigenvalues. Then is real Frechet in the Frobenius norm and for each Hermitian direction . With , This is a block/cluster statement: no gap between eigenvalues inside either cluster is required.
Facts & Assumptions
Given: , , a gap , and a Hermitian in the stated ball; write .
The fixed circle separates the first eigenvalues from the rest by distance at least , and on (A spectral gap persists on a computable matrix ball with a uniform resolvent bound).
A Hermitian matrix is unitarily diagonalizable with real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
On a positively oriented circle, Cauchy's formula gives for an interior ; if is outside, the integrand is holomorphic on the disk and its integral is zero (Cauchy's integral formula on a circle compactly contained in a disc of holomorphy, A continuous function holomorphic away from one point on a star-shaped domain has a primitive and zero closed-contour integrals).
The complex line integral is linear, exists for continuous functions on a rectifiable contour, and obeys the triangle inequality by its Riemann-sum definition (The complex line integral over a rectifiable path as a componentwise Riemann–Stieltjes integral, Complex line integrals are linear in the integrand, Continuous integrands have complex and absolute line integrals along every rectifiable path).
The real Frechet derivative is the linear first-order approximation on real matrix spaces (The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).
The operator norm is bounded by the Frobenius norm, and the Frobenius norm is the Euclidean norm of the matrix entries (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 real-coordinate map is when it is Frechet differentiable everywhere on its open domain and its derivative is continuous (Continuously differentiable maps, local inverses, and local diffeomorphisms, The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).
Proof
Since by [F6], every point of the operator-norm ball has a Frobenius neighborhood contained in it; hence the stated domain is open for the real Frechet definition. Diagonalize with by [F2]. Since [F1] places exactly inside , the resolvent is on the contour.
For a sufficiently small Hermitian perturbation with still in the ball, the inverse identity gives . Subtracting yields The identity follows by multiplying the two inverse equations for and ; all inverses exist by [F1].
Interpret a matrix-valued contour integral entrywise; each entry of the resolvent and derivative integrands is continuous on , so its scalar integral exists by [F4]. Finite matrix sums and constant left and right factors commute with this integral, and the Frobenius norm of an integral is at most the contour length times the supremum Frobenius norm of its integrand, by the triangle inequality for finite-dimensional Riemann sums. Integrating each diagonal entry and using [F3], linearity in [F4], and the finite spectral expansion gives Thus the contour expression represents the full occupied cluster projector, including repeated eigenvalues within that cluster.
For any matrix and matrix with columns , the operator-norm definition gives . Applying this also to adjoints gives the right-multiplication bound . Iterating these inequalities, then using [F1] and [F6], bounds the Frobenius norm of the right side by , uniformly for . The matrix-valued integral estimate in step 2.1 bounds the integrated remainder by . Dividing by makes this tend to zero, so the contour formula in step 2.1 is Frechet differentiable in the sense of [F5], with the stated derivative; the integral is real-linear in by entrywise linearity. Each directional derivative is a limit of Hermitian difference quotients, so it is Hermitian-valued because is closed.
The same left/right multiplication inequalities give by [F1] and [F6]. Integrating over length yields . For nearby in the ball, the resolvent identity and [F1] give uniformly on . Subtracting the two derivative integrands gives . Each summand has Frobenius norm at most by the left/right multiplication bounds and [F6], so their sum is at most twice this quantity. The matrix-valued integral estimate from step 2.1 then bounds the difference of derivative values by . Taking the supremum over shows that the derivative varies continuously in operator norm, which by [F7] proves the claimed regularity; the bound was proved above.
A contractive self-consistent map converges and admits residual and inexact-solve bounds
Statement
Let be a nonempty complete metric space and let be a contraction with constant . In the SCF application, is a complete invariant subset of the response-map domain from The occupied-projector response map on its strict-gap domain, with . Then has a unique fixed point and exact iterates satisfy For every , If computed updates obey , then where and is the supplied initial point. Use the convention , including when .
Facts & Assumptions
Given: A nonempty complete metric space , a self-map with for , an initial point , and inexact updates with errors .
A contraction of a nonempty complete metric space has a unique fixed point and its iterates converge (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point).
The response map and, in the projector application, the Frobenius residual are defined as in The occupied-projector response map on its strict-gap domain.
At every strict occupied gap, that response map selects a unique rank- projector (A strict occupied gap defines a unique rank-r spectral projector).
A contraction with factor means for all (Lipschitz map, -Hölder map for rational , and contraction).
Proof
By [F1], there is a unique with . In the projector application, [L1] supplies the stated map wherever the strict gap hypothesis holds.
For exact iterates, [F3] gives . Induction from yields .
For any , [F2] identifies the SCF metric residual with . The triangle inequality and contraction property give Since , rearrangement proves the residual error bound.
For an inexact update, the triangle inequality gives This is the one-step recurrence.
Repeated substitution in the recurrence yields : it holds at with an empty sum, and substituting its th bound into gives the formula at .
A level shift preserves a fixed occupied projector exactly under block ordering
Statement
Let and be as in The occupied-projector response map on its strict-gap domain, and take so that is defined and Hermitian. Define the level-shifted matrix for real , and define the Hermitian compressions For either finite-dimensional Hermitian block, denotes its finite eigenvalue set. When , these compressions are the restrictions of to the two invariant subspaces. Then if and only if and The strict inequality is the shifted occupied/unoccupied ordering. A level shift can change the map when either commutation or this ordering fails.
Facts & Assumptions
Given: A rank- orthogonal projector , a Hermitian matrix , and .
A rank- orthogonal projector satisfies (Rank-r orthogonal projector domain).
A Hermitian matrix admits an orthonormal eigenbasis, and its spectral projector onto an isolated lowest- cluster commutes with the matrix (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, The occupied-projector response map on its strict-gap domain).
A strict occupied gap gives the unique rank- projector selected by the response-map convention (A strict occupied gap defines a unique rank-r spectral projector).
Proof
Assume . Then both and are invariant under : if , then , and the analogous identity holds when . Relative to their orthogonal direct sum, is block diagonal and leaves the occupied block unchanged while adding on the virtual block.
By [F2], the eigenvalues of are exactly those of together with those of shifted by . If , the lowest eigenvalues are precisely the occupied block and the gap is strict; [L1] gives .
Conversely, if , its defining strict gap makes the sum of the eigenspace projectors of for the lowest eigenvalues, so commutes with . Since , this gives , and the two restrictions are the occupied and virtual blocks of . Their eigenvalues in are respectively and . Because is exactly the lowest- spectral projector with a strict gap, the largest occupied eigenvalue is strictly smaller than the smallest shifted virtual eigenvalue; hence the displayed ordering holds.
Finite-budget undamped self-consistent projector iteration
Definition
Input: , a response matrix map and its occupied projector map from The occupied-projector response map on its strict-gap domain, an invariant set , an initial projector , a required gap , residual tolerance , update budget , and a Hermitian eigensolver. On each input the eigensolver must return either a certified ascending eigenvalue list and, when the gap is strict, the corresponding occupied projector , or a failure to certify the spectrum; assume whenever and its gap is at least . Use the Frobenius metric and the fixed-point interface of Fixed-point iteration with a residual stop and finite budget.
For :
- Call the eigensolver on . If it fails to certify the ordered spectrum, return . If the certified gap satisfies , return .
- Set to the returned occupied projector and compute . If , return .
- If , return . Otherwise set and continue.
It reports a residual stopping status, gap loss, eigensolver failure, or budget exhaustion separately. A finite budget does not guarantee that the residual tolerance will be met, and the definition asserts no convergence from damping or from a positive gap alone.
Finite-memory capped DIIS projector proposal with fallback
Definition
Input: the current pair with and Hermitian; up to earlier pairs , in chronological order, with and Hermitian; memory cap ; coefficient cap ; a constrained least-squares solver that either returns a globally minimizing coefficient vector selected by minimum Euclidean norm among all minimizers, with certificates for feasibility and optimality, or reports failure; and a Hermitian eigensolver for mixed Fock matrices. The eigensolver returns a certified ordered spectrum and, when the th gap is strict, its occupied projector, or reports failure. The procedure is one proposal step:
- Form each commutator residual for the earlier pairs followed by the current pair. This gives at most residuals.
- Call the constrained solver on these residuals with , , and . If it reports failure, including a singular Gram-system failure, return ; the caller then performs the baseline SCF update. The returned vector must be the certified global minimizer with the minimum-norm tie-break guaranteed to exist by Capped DIIS coefficients have a unique minimum-norm least-squares selection.
- If the returned coefficients fail either constraint or their feasibility certificate, return ; the caller then performs the baseline update. Otherwise form and call the eigensolver on it. If the eigensolver fails or does not certify a strict th gap, return ; the caller then performs the baseline update.
- If the eigensolver certifies a strict gap, return , where is its occupied projector .
The commutator least-squares objective defines a proposal; it is not a fixed-point error certificate. The outer safeguarded procedure checks separately before accepting a candidate. This algorithm makes no bare DIIS convergence claim.
Density mixing preserves admissibility but need not preserve idempotence
Statement
If and the gapped map of The occupied-projector response map on its strict-gap domain is defined, then for every , belongs to . The conclusion does not assert .
Facts & Assumptions
Given: , a defined occupied projector of rank , and .
is the set of Hermitian positive contractions of trace (The fixed-particle admissible Hermitian density domain).
The gapped response construction gives a unique orthogonal projector (The occupied-projector response map on its strict-gap domain, A strict occupied gap defines a unique rank-r spectral projector).
Every rank- orthogonal projector is an admissible density (Every rank-r orthogonal projector is an admissible density).
Proof
Since and are Hermitian, is Hermitian. For every , . Likewise , since and by [F1], [F2], [F4].
The trace is linear, so . The two positive-semidefinite inequalities and this trace identity give .
To verify that idempotence need not be preserved, take , , the constant Hermitian response on , , and . Directly, is Hermitian, lies between and , and has trace , so . The response matrix has gap , so [F2] gives . Then and . Thus the update belongs to by step 2.1 but is not an orthogonal projector.
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 .
The finite-basis projector energy model supplies a C1 Hermitian response map
Statement
For the finite-basis data on the model's open Hermitian domain in Finite-basis projector energy model, the Hermitian response is on the model's open domain. At every with an occupied/unoccupied gap, the occupied-projector map is on a sufficiently small neighborhood of where that gap persists.
Facts & Assumptions
Given: A finite-basis model with Hermitian , real-linear , and real functional on an open neighborhood; a point at which has a strict -th spectral gap.
The model defines , with real-linear and of class (Finite-basis projector energy model).
The real Frechet derivative treats complex matrix spaces as real finite-dimensional spaces (The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).
A gapped block projector is on a neighborhood with a common separating contour (A separated block spectral projector is Frechet differentiable with a resolvent bound).
The derivative of a composition is the composition of the derivatives (The chain rule for total derivatives: ).
A computable operator-norm ball around a Hermitian matrix with a strict occupied gap retains that gap (A spectral gap persists on a computable matrix ball with a uniform resolvent bound).
The operator norm is at most the Frobenius norm, and both are continuous finite-dimensional norms (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).
The gapped response map is the unique rank- occupied projector (A strict occupied gap defines a unique rank-r spectral projector).
The convention in finite-dimensional real coordinates gives continuous partial derivatives through order two ( maps and multi-index derivative notation in Euclidean space).
A map whose coordinate partial derivatives exist and are continuous is total differentiable with those derivatives (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).
A real-linear map between finite-dimensional Euclidean spaces is bounded and continuous (Every Euclidean linear map has a unique matrix and satisfies for some ).
Proof
Identify the real Hermitian space with its finite coordinate space. The constant map has derivative zero. The real-linear map is continuous by [F9] and has derivative at every point because . By [F7] the first partials of are : each has first partials given by the continuous second partials of , and [F8] makes each component of total differentiable with continuous derivative. Thus all three summands in [F1] are , so is and Hermitian-valued on the model's open domain.
Continuity of gives a neighborhood of on which , where is the gap at . By [F6], the operator-norm difference is also less than . By [F5] this image lies in a common gap-preserving ball; [F3] makes its block projector there and [L1] identifies it with the defined occupied projector. By [F4], is on .
A uniform derivative bound certifies contraction of relaxed density mixing
Statement
Let be nonempty, closed, and convex in Frobenius norm. Suppose is on an open neighborhood of , every matrix there has a strict th gap so the gapped projector map is defined, and for a fixed the relaxed map satisfies . If a certified induced-norm bound holds, where , then is a contraction on and its iterates converge to a unique fixed point. The derivative is The derivative bound is a separate hypothesis; alone does not imply contraction.
Facts & Assumptions
Given: A nonempty closed convex , a map defined on a neighborhood of with , a fixed , invariance , and .
The response map is wherever has a strict th gap (The occupied-projector response map on its strict-gap domain).
At a strict gap, the response map has a unique rank- projector value (A strict occupied gap defines a unique rank-r spectral projector).
The gapped block projector is and has the contour derivative on its common-gap neighborhood (A separated block spectral projector is Frechet differentiable with a resolvent bound).
A continuously differentiable vector-valued map with derivative norm bounded by on an interval is -Lipschitz (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz).
A contraction of a nonempty complete metric space has a unique fixed point and convergent iterates (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point).
The composition derivative is given by the chain rule (The chain rule for total derivatives: ).
A map has a continuous Frechet derivative on its open domain (Continuously differentiable maps, local inverses, and local diffeomorphisms).
The admissible density domain is complete in Frobenius norm (The admissible Hermitian density domain is closed, convex, and complete).
Proof
For , convexity puts the segment in for . By [F1] and [L1], is defined along this segment; [F2] gives its local regularity. For an increment , , so Frechet differentiability of gives . The chain rule [F5] on the segment gives . Its norm is at most by the assumed induced-norm bound; continuity follows from [F2] and [F6].
Apply [F3] on to this path. It yields , so is a contraction on .
Any Frobenius-Cauchy sequence in is Cauchy in , so [F7] gives a limit in ; closedness of places that limit in . Thus is complete. Invariance and step 2.1 allow [F4] to give a unique fixed point and convergence of all iterates from .
Finite-budget certified SCF with safeguarded DIIS and a contractive fallback
Definition
Input: an open domain , a Hermitian response matrix map , and its gapped occupied-projector map from The occupied-projector response map on its strict-gap domain; a nonempty complete invariant set with and certified contraction factor ; an initial projector ; a certified initial error bound for the unique fixed point ; residual tolerance ; finite update budget ; memory ; coefficient cap ; a Hermitian eigensolver that, for a matrix , returns a certified ordered spectrum and occupied projector when the th gap is strict, a certified no-gap result, or a failure to certify the spectrum; an approximate response evaluator that at returns and with , or a failure status; and a constrained least-squares solver that either returns the certified global minimizer with the minimum-norm tie-break for the residuals and cap , or reports failure. Every called solver returns one of its specified results.
The terminal output is , where is the current projector and is its certified error bound. The current budget remains valid at gap, eigensolver, response-evaluation, or invariance-certificate failure statuses.
For :
- If no certified response evaluation is cached for , compute and call the eigensolver on it. If the eigensolver certifies no strict gap, return ; if it fails to certify the spectrum, return . With a certified strict gap, call the approximate response evaluator. If it fails, return . Cache at exactly . Whether this evaluation is new or cached, check that the certified baseline output belongs to ; if not, return . Retain the current pair for this proposal step. Set . If , return .
- If , return .
- Call Finite-memory capped DIIS projector proposal with fallback with the up-to- preceding stored pairs, the current pair , the constrained least-squares solver, the eigensolver, , and . For a candidate , certify , compute , certify its strict gap with the eigensolver, and obtain one approximate response evaluation with error . Accept only if all certificates succeed and If accepted, set and .
- If step 3 does not accept a candidate for any reason, use the certified baseline evaluation already obtained and checked in step 1. In particular, this includes a least-squares failure, coefficient-cap or affine-constraint failure, failed candidate -membership, failed candidate gap, failed candidate response-error certificate, or failed candidate fixed-point residual test. Set and .
- Append the current pair to the preceding-iterate history, retaining at most the newest preceding pairs. If step 3 accepted , cache its certified evaluation as the next iteration's current evaluation; if the baseline branch was used, evaluate its new iterate when the next loop begins. Never attach a response matrix evaluated at one density to a different density.
The DIIS commutator objective is only a proposal score. Acceptance uses the separate fixed-point residual with its additive eigensolver error certificate. The algorithm makes no unconditional success claim: finite budget exhaustion and each certificate failure are explicit outcomes.
Residual-certified DIIS candidates inherit the contractive SCF error budget
Statement
Assume the hypotheses and certificates in Finite-budget certified SCF with safeguarded DIIS and a contractive fallback: is a -contraction on the complete invariant set , its fixed point is , the starting error is at most , and every baseline response error is at most . Let be updated by that algorithm. Then every produced iterate obeys An accepted DIIS candidate has certified error at most ; the commutator least-squares residual alone is not used as an error bound. If an infinite sequence of updates follows these rules, with a valid baseline fallback whenever a candidate is rejected and fallback error budgets , then . A finite execution of the stated algorithm may still return budget exhaustion. Use the convention , including when .
Facts & Assumptions
Given: The certified algorithm's hypotheses, starting error bound , contraction factor , and nonnegative baseline error budgets .
A DIIS candidate is accepted only when its certified residual bound divided by is at most ; otherwise the baseline update is used and its error bound is added to (Finite-budget certified SCF with safeguarded DIIS and a contractive fallback).
Proof
Initially by input. Suppose . If the algorithm accepts candidate , [F2] gives a certified upper bound for with . Applying [F1] at proves .
If the baseline is used, its evaluator certifies . The triangle inequality and contraction give Thus induction proves at every step.
By [F2], both update branches obey (accepted DIIS uses for this upper estimate). Iterating this scalar recurrence by induction gives .
For any infinite sequence generated by the stated update rules with , the scalar recurrence from step 3.1 has convolution tending to zero: for and any , choose so for . The tail sum is at most , while the finite head and tend to zero as . If , the recurrence gives directly. Thus and step 2.1 gives . This is a conditional statement about an infinite sequence; it does not assert that a finite-budget run must meet its stopping tolerance.
Finite-budget relaxed density-matrix mixing
Definition
Input: from The fixed-particle admissible Hermitian density domain, a Hermitian response matrix map whose domain contains every entered density iterate, and its occupied-projector map , defined at the strict-gap points of as in The occupied-projector response map on its strict-gap domain, a Hermitian eigensolver that for each returns a certified ordered spectrum and occupied projector when the gap is strict, a certified no-gap result, or a failure status, a fixed mixing parameter , a fixed-point residual tolerance , and a finite update budget . For , first call the eigensolver on . If it fails, return ; if the gap is absent, return . Otherwise use the returned occupied projector as and compute If , return . If , return . Otherwise update and continue.
By Density mixing preserves admissibility but need not preserve idempotence, each successful update stays in ; it need not be idempotent. This algorithm uses the residual and finite-budget update pattern of Fixed-point iteration with a residual stop and finite budget for the relaxed map, with a gap check before each response evaluation. It makes no convergence claim unless the derivative-bound and invariance hypotheses in A uniform derivative bound certifies contraction of relaxed density mixing are verified. If , then the relaxed residual is identically zero and the update does not move; that stop status alone says nothing about the unmixed response residual.
Finite-budget SCF response iterations return a status in bounded outer work
Statement
For admissible inputs of any of the three cited SCF iterations with finite budget , there are at most updates. The undamped and relaxed procedures use at most fixed-point residual tests; the certified DIIS procedure uses at most , counting one current-point test and at most one candidate test at each nonterminal pass. Under returning spectrum/eigensolver, response, constrained least-squares, metric and comparison primitives, each procedure terminates with a stated residual, gap, eigensolver, response-evaluation, invariance-certificate or budget status. This is a work/status bound and does not assert contraction, convergence or tolerance attainment.
Facts & Assumptions
Given: Any of the three algorithms' admissible inputs and returning primitives.
Finite-budget undamped self-consistent projector iteration checks the spectrum/gap, then its residual, then the budget, and updates only at indices below .
Finite-budget relaxed density-matrix mixing uses the same index and stopping order for its relaxed residual, with earlier gap/eigensolver returns allowed.
Finite-budget certified SCF with safeguarded DIIS and a contractive fallback checks one current response residual at each entered index, attempts at most one candidate residual test before any update, and stops at budget index .
Proof
At the initial entered index , no update has occurred. Each baseline procedure permits at most one residual test after its spectrum and gap checks; the certified DIIS procedure permits one current residual test and, only if , at most one candidate residual test.
Before an entered index , its preceding entered indices are exactly , with at most preceding updates, at most residual tests for either baseline procedure, and at most residual tests for the certified DIIS procedure.
A baseline pass permits at most one residual test; a certified DIIS pass permits at most two, for its current point and a candidate. A continuing pass requires and makes at most one update before entering . Thus the preceding counts increase by at most one update and, respectively, one or two residual tests, proving step 1.2 at the next index. Any earlier gap, eigensolver, response-evaluation, invariance, residual or budget return creates no further pass.
The base and induction step show that entered indices form an initial segment of , with at most residual tests for either baseline procedure and at most for certified DIIS, since index checks the current response and returns before a candidate attempt or update. All three make at most updates. Every entered pass has finitely many returning primitives, so each procedure terminates with a stated status, including when . These are only outer-work and status bounds.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Thorsten Rohwedder, An analysis for some methods and algorithms of quantum chemistry, Chapter 4 §4.1
- Tosio Kato, Perturbation Theory for Linear Operators, 2nd ed., Chapter II §§1.3–1.4
- Eric Cancès and Claude Le Bris, On the convergence of SCF algorithms for the Hartree-Fock equations, §2.1–§2.2
- Eric Cancès, Gaspard Kemlin, and Antoine Levitt, Convergence analysis of direct minimization and self-consistent iterations, §4.4 and Appendix Lemma 4.1
- Tosio Kato, Perturbation Theory for Linear Operators, 2nd ed., Chapter II §1.3–§1.4
- Benjamin Texier, Basic matrix perturbation theory, §2
- Tosio Kato, Perturbation Theory for Linear Operators, 2nd ed., Chapter II §1.4
- Eric Cancès, Gaspard Kemlin, and Antoine Levitt, Convergence analysis of direct minimization and self-consistent iterations, §2.1
- Eric Cancès and Claude Le Bris, On the convergence of SCF algorithms for the Hartree-Fock equations, §2.1
- Eric Cancès, Gaspard Kemlin, and Antoine Levitt, Convergence analysis of direct minimization and self-consistent iterations, §3.2
- Eric Cancès and Claude Le Bris, On the convergence of SCF algorithms for the Hartree-Fock equations, §2.2 and §4
- Eric Cancès and Claude Le Bris, On the convergence of SCF algorithms for the Hartree-Fock equations, §2.2
- Homer F. Walker and Peng Ni, Anderson Acceleration for Fixed-Point Iterations, §1
- Thorsten Rohwedder, An analysis for some methods and algorithms of quantum chemistry, Chapter 4 §4.4
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation