Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Self consistent projector iterations and certified mixing

1 · Prerequisites

2 · Summary

This page defines the self-consistent occupied-projector map only where a strict occupied/unoccupied spectral gap makes the rank-r 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 q<1; 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

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Capped DIIS coefficients have a unique minimum-norm least-squares selection

Statement

Let s≥1, let R1,…,Rs be complex matrices of one fixed shape, and let C≥1. Define Cs,C:={c∈Rs:∑i=1sci=1, ∑i=1s∣ci∣≤C} and J(c):=∥∑i=1sciRi∥F2. Then J attains a minimum on Cs,C. 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 s, matrices Ri of the same finite shape, and a real cap C≥1.

[F3]

Real absolute values satisfy ∣a+b∣≤∣a∣+∣b∣ and ∣ab∣=∣a∣∣b∣ (The triangle inequality, Basic properties of the absolute value).

Proof

1.1givenF2F3

The vector e1=(1,0,…,0) belongs to Cs,C because its entries sum to 1 and its ℓ1 norm is 1≤C. Thus the coefficient set is nonempty. For c,d∈Rs, each ∣ci−di∣≤∥c−d∥2, and [F3] gives ∣∣ci∣−∣di∣∣≤∣ci−di∣; hence both c↦∑ici and c↦∑i∣ci∣ are continuous. Their closed level sets show that Cs,C is closed. It is bounded because ∥c∥12=∑ici2+2∑i<j∣ci∣∣cj∣≥∥c∥22 and ∥c∥1≤C. Therefore [F2] makes Cs,C compact.

2.1step 1.1F1F2

Put T(c)=∑iciRi. By the triangle inequality and homogeneity of the Frobenius norm, ∥T(c)−T(d)∥F≤∑i∣ci−di∣∥Ri∥F≤∥c−d∥2∑i∥Ri∥F, so T is continuous; the reverse triangle inequality then makes c↦J(c)=∥T(c)∥F2 continuous. By [F2], J attains a minimum m on the nonempty compact set Cs,C. The set M=Cs,C∩J−1({m}) is closed and bounded in Rs, hence compact by [F2], and it is nonempty by attainment.

3.1step 2.1F1F3algebra

For c,d∈Cs,C and 0≤t≤1, the coefficients e=(1−t)c+td satisfy ∑iei=(1−t)∑ici+t∑idi=1. By [F3], ∑i∣ei∣≤(1−t)∑i∣ci∣+t∑i∣di∣≤C, so Cs,C is convex. Expanding each complex matrix entry gives ∥(1−t)A+tB∥F2=(1−t)∥A∥F2+t∥B∥F2−t(1−t)∥A−B∥F2 for real t. Applying this identity to A=T(c) and B=T(d) shows J((1−t)c+td)≤(1−t)J(c)+tJ(d)=m when c,d∈M; since the combination is feasible and m is the minimum, it also lies in M. Thus M is convex. The function c↦∥c∥22=∑ici2 is continuous, so compactness of M gives a minimizer c∗∈M.

4.1step 3.1algebra∎

If distinct c,d∈M both had minimum Euclidean norm, their midpoint would lie in M and satisfy ∥c+d2∥22=∥c∥22+∥d∥222−∥c−d∥224<∥c∥22+∥d∥222, contradicting minimality. Thus c∗ is the unique minimum-norm least-squares minimizer. No nonsingularity of the Gram matrix is needed for existence or tie-breaking.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The occupied-projector response map on its strict-gap domain

Definition

Let n≥2, 1≤r<n, and use the real Hermitian matrix space Hn and projector set Pr of Rank-r orthogonal projector domain. Let U⊆Hn be open and let F:U→Hn be a specified map. For a Hermitian matrix H, write its eigenvalues with multiplicity in ascending order as λ1(H)≤⋯≤λn(H). Write σ(H):={λj(H):1≤j≤n} for its finite spectrum, with multiplicity omitted in this set notation. For any Hermitian H with λr(H)<λr+1(H), write Πr(H) for the orthogonal projector onto the sum of eigenspaces belonging to its r lowest eigenvalues. At a point X∈U where λr(F(X))<λr+1(F(X)), define Φ(X):=Πr(F(X)). 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 Pr is proved in A strict occupied gap defines a unique rank-r spectral projector ↗.

A set K⊆U has a uniform occupied/unoccupied gap g>0 when the displayed gap is at least g for every X∈K. A self-consistent fixed point is a point X∗ with Φ(X∗)=X∗. Its fixed-point residual is ρ(X):=∥X−Φ(X)∥F whenever Φ(X) is defined. The map is not asserted to be contractive merely because its gap is positive.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The fixed-particle admissible Hermitian density domain

Definition

For n≥2 and 1≤r<n, let Hn and Pr be as in Rank-r orthogonal projector domain. The admissible fixed-particle density domain is Dr:={D∈Hn:0⪯D⪯In, tr⁡D=r}, where D⪰0 means x∗Dx≥0 for every x∈Cn, and D⪯In means In−D⪰0. A member of Dr need not be idempotent. The matrix norm and metric used below are the Frobenius norm and its induced metric. Every rank-r orthogonal projector is in Dr by Every rank-r orthogonal projector is an admissible density ↗.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

A spectral gap persists on a computable matrix ball with a uniform resolvent bound

Statement

Let H0∈Hn have eigenvalues with multiplicity λ1(H0)≤⋯≤λn(H0) and gap g=λr+1(H0)−λr(H0)>0. Put c=λ1(H0),R=λr(H0)+λr+1(H0)2−c, and let Γ={c+Reit:0≤t≤2π} be positively oriented. For Hermitian H, write σ(H)={λj(H):1≤j≤n}. Then R≥g/2. For every Hermitian H with ∥H−H0∥op≤g/4, exactly the r lowest eigenvalues of H, counted with multiplicity, lie inside Γ; the gap is at least g/2, and dist⁡(Γ,σ(H))≥g/4,∥(zI−H)−1∥op≤4/g(z∈Γ).

Facts & Assumptions

Given: A Hermitian H0∈Hn, integers n≥2 and 1≤r<n, and g=λr+1(H0)−λr(H0)>0.

[F1]

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.

[F2]
[F3]

The operator norm is the supremum of ∥Tv∥2 over unit vectors v (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

Proof

1.1givenF1algebra

Since λr+1(H0)=λr(H0)+g, we have R=λr(H0)−λ1(H0)+g/2≥g/2>0. Reversing the descending-index convention in [F1] gives the same perturbation bound for the ascending eigenvalues used here. Thus if ∥H−H0∥op≤g/4, then λ1(H)≥c−g/4 and λr(H)≤c+R−g/4. Since R−g/4≥g/4, every first-r eigenvalue therefore satisfies ∣λj(H)−c∣≤R−g/4, so it lies at least g/4 inside the circle centered at c.

2.1step 1.1F1algebra

The same eigenvalue estimate gives λr+1(H)≥c+R+g/4, so all remaining eigenvalues satisfy ∣λj(H)−c∣≥R+g/4 and lie at least g/4 outside the circle. Also λr+1(H)−λr(H)≥g−2(g/4)=g/2. Thus the contour separates exactly the occupied cluster and the stated gap persists.

3.1step 1.1step 2.1F2F3algebra∎

By [F2], the spectrum of H is real and H diagonalizes unitarily. For every z∈Γ, reverse triangle gives ∣z−λj(H)∣≥∣∣z−c∣−∣λj(H)−c∣∣≥g/4 by steps 1.1 and 2.1. In the unitary eigenbasis, (zI−H)−1 is diagonal with entries of modulus at most 4/g. Applying [F3] to a unit vector in this basis gives ∥(zI−H)−1∥op≤4/g.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

A strict occupied gap defines a unique rank-r spectral projector

Statement

For every X∈U at which the response map of The occupied-projector response map on its strict-gap domain has a strict rth gap, Φ(X) is a uniquely defined member of Pr. Degeneracies among the first r eigenvalues or among the remaining eigenvalues do not affect it.

Facts & Assumptions

Given: A Hermitian matrix F(X) with ordered eigenvalues λ1≤⋯≤λn and λr<λr+1.

[F2]

The response-map definition selects the sum of eigenspaces belonging to the r lowest eigenvalues (The occupied-projector response map on its strict-gap domain).

[L1]

Pr={P=P∗:P2=P,tr⁡P=r} (Rank-r orthogonal projector domain).

[F3]

The trace of a square matrix is the sum of its diagonal entries (The trace tr⁡(A) as the sum of the diagonal entries).

Proof

1.1givenF1algebra

By [F1], choose an orthonormal eigenbasis (u1,…,un) of F(X) with the eigenvalues in the given order. The strict gap prevents an eigenspace for one eigenvalue from straddling positions r and r+1, so the sum of the first r eigenspaces is the span of exactly the first r basis vectors.

2.1step 1.1F1F2F3L1algebra

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 P=∑j=1rujuj∗, which satisfies P=P∗ and P2=P by orthonormality. By [F3], tr⁡P=∑a=1nPaa=∑a=1n∑j=1r(uj)a(uj)a‾=∑j=1r∑a=1n∣(uj)a∣2=∑j=1r1=r, since each uj is a unit vector.

3.1step 2.1F2L1∎

The operator in step 2.1 is independent of all allowed basis choices, lies in Pr by [L1], and is exactly the map specified by [F2]. Hence it is the unique rank-r occupied spectral projector.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Every rank-r orthogonal projector is an admissible density

Statement

Every P∈Pr belongs to the admissible density domain Dr.

Facts & Assumptions

Given: P∈Hn satisfies P=P∗, P2=P, and tr⁡P=r, where 1≤r<n.

[F1]

The rank-r projector set is Pr={P=P∗:P2=P,tr⁡P=r} (Rank-r orthogonal projector domain).

[F3]

The admissible domain consists of Hermitian positive contractions of trace r (The fixed-particle admissible Hermitian density domain).

Proof

1.1givenF1F2algebra

By [F2], choose a unitary eigenbasis of P with real eigenvalues μj. From P2=P, each satisfies μj2=μj, hence μj∈{0,1}. Therefore every eigenvalue lies between 0 and 1, so for each x the quadratic forms x∗Px and x∗(I−P)x are nonnegative.

2.1step 1.1F1F3∎

The matrix P is Hermitian and has trace r by [F1]; step 1.1 gives 0⪯P⪯I. These are exactly the conditions in [F3], so P∈Dr.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

The admissible Hermitian density domain is closed, convex, and complete

Statement

For n≥2 and 1≤r<n, the set Dr of The fixed-particle admissible Hermitian density domain is nonempty, closed, and convex in Hn, and complete in the Frobenius metric.

Facts & Assumptions

Given: Integers n≥2, 1≤r<n, the real vector space Hn with Frobenius norm, and Dr={D=D∗:0⪯D⪯In,tr⁡D=r}.

[F1]

The domain and its order conditions are as in The fixed-particle admissible Hermitian density domain.

[F2]

Every Euclidean Cauchy sequence in a finite-dimensional real coordinate space converges (R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R).

Proof

1.1givenF1construct

The diagonal matrix D0=diag⁡(1,…,1,0,…,0) with r ones is Hermitian, satisfies 0⪯D0⪯In, and has trace r. Thus D0∈Dr, so the domain is nonempty.

1.2givenF2constructalgebra

Identify Hn with Rn2 by listing the real diagonal entries and, for each i<j, the coordinates 2 Re⁡Dij and 2 Im⁡Dij. This real-linear map is bijective, since the lower-triangular entries are recovered by conjugation, and its squared Euclidean norm is ∑iDii2+2∑i<j∣Dij∣2=∥D∥F2. Thus it is an isometry. If (Dk) is Frobenius-Cauchy, its image is Cauchy in Rn2, so [F2] gives a limit whose inverse image D∈Hn satisfies Dk→D in Frobenius norm.

2.1step 1.2F1algebra

For each fixed x∈Cn, ∣x∗(Dk−D)x∣≤(∑i∣xi∣)2∥Dk−D∥F, since each matrix entry is bounded by the Frobenius norm. The same estimate applies to x∗((In−Dk)−(In−D))x. Both quadratic forms therefore converge; their terms are nonnegative, so their limits are nonnegative and 0⪯D⪯In. Also ∣tr⁡(Dk−D)∣≤n∥Dk−D∥F, so tr⁡D=lim⁡ktr⁡Dk=r. Hence D∈Dr.

3.1step 1.2step 2.1F1algebra

Steps 1.2 and 2.1 show that every Frobenius-Cauchy sequence in Dr converges to a member of Dr, so the domain is complete. To prove closedness directly, for each fixed x∈Cn the real-valued maps D↦x∗Dx and D↦x∗(In−D)x are continuous, since their differences at D,E have modulus at most (∑i∣xi∣)2∥D−E∥F. The trace is continuous as ∣tr⁡(D−E)∣≤n∥D−E∥F. Thus Dr is the intersection of the closed preimages of [0,∞) under these quadratic-form maps and of {r} under the trace map. An arbitrary intersection of closed sets is closed.

4.1F1algebra∎

If D1,D2∈Dr and t∈[0,1], then tD1+(1−t)D2 is Hermitian; its quadratic form and that of In−tD1−(1−t)D2 are convex combinations of nonnegative quadratic forms, and its trace is ttr⁡D1+(1−t)tr⁡D2=tr+(1−t)r=r. Hence it lies in Dr, proving convexity.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

A separated block spectral projector is Frechet differentiable with a resolvent bound

Statement

Let H0∈Hn have an occupied/unoccupied gap g=λr+1(H0)−λr(H0)>0, and let c,R,Γ be the circle from A spectral gap persists on a computable matrix ball with a uniform resolvent bound. For Hermitian H in the open operator-norm ball ∥H−H0∥op<g/4, let Πr(H) be its projector onto the r lowest eigenvalues. Then H↦Πr(H) is real Frechet C1 in the Frobenius norm and DΠr(H)[E]=12πi∫Γ(zI−H)−1E(zI−H)−1 dz for each Hermitian direction E. With ℓ(Γ)=2πR, ∥DΠr(H)[E]∥F≤16Rg2∥E∥F. This is a block/cluster statement: no gap between eigenvalues inside either cluster is required.

Facts & Assumptions

Given: H0∈Hn, 1≤r<n, a gap g>0, and a Hermitian H in the stated ball; write RH(z)=(zI−H)−1.

[F1]

The fixed circle Γ separates the first r eigenvalues from the rest by distance at least g/4, and ∥RH(z)∥op≤4/g on Γ (A spectral gap persists on a computable matrix ball with a uniform resolvent bound).

[F3]

On a positively oriented circle, Cauchy's formula gives 12πi∫Γ(z−λ)−1dz=1 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).

[F4]

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).

[F5]

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).

[F7]

A real-coordinate map is C1 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

1.1F1F2F6

Since ∥A∥op≤∥A∥F 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 H=Udiag⁡(μ1,…,μn)U∗ with μ1≤⋯≤μn by [F2]. Since [F1] places exactly μ1,…,μr inside Γ, the resolvent is Udiag⁡((z−μj)−1)U∗ on the contour.

1.2F1algebra

For a sufficiently small Hermitian perturbation E with H+E still in the ball, the inverse identity gives RH+E=RH+RHERH+E. Subtracting RH+RHERH yields RH+E−RH−RHERH=RHERHERH+E. The identity follows by multiplying the two inverse equations for zI−H and zI−H−E; all inverses exist by [F1].

2.1step 1.1F3F4algebra

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 12πi∫ΓRH(z) dz=Udiag⁡(1,…,1,0,…,0)U∗=Πr(H). Thus the contour expression represents the full occupied cluster projector, including repeated eigenvalues within that cluster.

3.1step 2.1F1F4F5F6algebra

For any matrix A and matrix X with columns xj, the operator-norm definition gives ∥AX∥F2=∑j∥Axj∥22≤∥A∥op2∥X∥F2. Applying this also to adjoints gives the right-multiplication bound ∥XB∥F≤∥X∥F∥B∥op. Iterating these inequalities, then using [F1] and [F6], bounds the Frobenius norm of the right side by (4/g)3∥E∥F2, uniformly for z∈Γ. The matrix-valued integral estimate in step 2.1 bounds the integrated remainder by ℓ(Γ)(4/g)3∥E∥F2/(2π). Dividing by ∥E∥F 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 E by entrywise linearity. Each directional derivative is a limit of Hermitian difference quotients, so it is Hermitian-valued because Hn is closed.

4.1F1F4F5F6F7algebra∎

The same left/right multiplication inequalities give ∥RH(z)ERH(z)∥F≤(4/g)2∥E∥F by [F1] and [F6]. Integrating over length 2πR yields ∥DΠr(H)[E]∥F≤R(4/g)2∥E∥F=16R∥E∥F/g2. For nearby H′ in the ball, the resolvent identity and [F1] give uniformly on Γ ∥RH′−RH∥op≤(4/g)2∥H′−H∥op. Subtracting the two derivative integrands gives RH′E(RH′−RH)+(RH′−RH)ERH. Each summand has Frobenius norm at most (4/g)3∥H′−H∥F∥E∥F 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 2R(4/g)3∥H′−H∥F∥E∥F. Taking the supremum over ∥E∥F=1 shows that the derivative varies continuously in operator norm, which by [F7] proves the claimed C1 regularity; the bound was proved above.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

A contractive self-consistent map converges and admits residual and inexact-solve bounds

Statement

Let (K,d) be a nonempty complete metric space and let Φ:K→K be a contraction with constant 0≤q<1. In the SCF application, K is a complete invariant subset of the response-map domain from The occupied-projector response map on its strict-gap domain, with d(X,Y)=∥X−Y∥F. Then Φ has a unique fixed point X∗ and exact iterates Xk+1=Φ(Xk) satisfy d(Xk,X∗)≤qkd(X0,X∗). For every X∈K, d(X,X∗)≤d(X,Φ(X))1−q. If computed updates Xk+1∈K obey d(Xk+1,Φ(Xk))≤ηk, then ek+1≤qek+ηk,ek≤qke0+∑j=0k−1qk−1−jηj, where ek=d(Xk,X∗) and X0 is the supplied initial point. Use the convention q0=1, including when q=0.

Facts & Assumptions

Given: A nonempty complete metric space (K,d), a self-map Φ:K→K with d(Φ(X),Φ(Y))≤qd(X,Y) for 0≤q<1, an initial point X0, and inexact updates with errors ηk≥0.

[F1]

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).

[F2]

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.

[L1]

At every strict occupied gap, that response map selects a unique rank-r projector (A strict occupied gap defines a unique rank-r spectral projector).

[F3]

A contraction with factor q means d(Φ(X),Φ(Y))≤qd(X,Y) for all X,Y∈K (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction).

Proof

1.1givenF1L1

By [F1], there is a unique X∗ with Φ(X∗)=X∗. In the projector application, [L1] supplies the stated map wherever the strict gap hypothesis holds.

2.1step 1.1givenF3induction

For exact iterates, [F3] gives d(Xk+1,X∗)=d(Φ(Xk),Φ(X∗))≤qd(Xk,X∗). Induction from k=0 yields d(Xk,X∗)≤qkd(X0,X∗).

2.2givenstep 1.1F2F3algebra

For any X∈K, [F2] identifies the SCF metric residual with d(X,Φ(X)). The triangle inequality and contraction property give d(X,X∗)≤d(X,Φ(X))+d(Φ(X),Φ(X∗))≤d(X,Φ(X))+qd(X,X∗). Since 1−q>0, rearrangement proves the residual error bound.

2.3givenstep 1.1F3algebra

For an inexact update, the triangle inequality gives ek+1=d(Xk+1,X∗)≤d(Xk+1,Φ(Xk))+d(Φ(Xk),Φ(X∗))≤ηk+qek. This is the one-step recurrence.

3.1step 2.3inductionalgebra∎

Repeated substitution in the recurrence yields ek≤qke0+∑j<kqk−1−jηj: it holds at k=0 with an empty sum, and substituting its kth bound into ek+1≤qek+ηk gives the formula at k+1.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

A level shift preserves a fixed occupied projector exactly under block ordering

Statement

Let U and F:U→Hn be as in The occupied-projector response map on its strict-gap domain, and take P∈Pr∩U so that F(P) is defined and Hermitian. Define the level-shifted matrix Fs=F+s(I−P) for real s, and define the Hermitian compressions Focc:=(PFP)∣ran⁡P,Fvir:=((I−P)F(I−P))∣ran⁡(I−P). For either finite-dimensional Hermitian block, σ denotes its finite eigenvalue set. When PF=FP, these compressions are the restrictions of F to the two invariant subspaces. Then Πr(Fs)=P if and only if PF=FP and max⁡σ(Focc)<min⁡σ(Fvir)+s. 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-r orthogonal projector P∈U, a Hermitian matrix F=F(P), and Fs=F+s(I−P).

[F1]

A rank-r orthogonal projector satisfies P=P∗=P2 (Rank-r orthogonal projector domain).

[F2]

A Hermitian matrix admits an orthonormal eigenbasis, and its spectral projector onto an isolated lowest-r 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).

[L1]

A strict occupied gap gives the unique rank-r projector selected by the response-map convention (A strict occupied gap defines a unique rank-r spectral projector).

Proof

1.1givenF1algebra

Assume PF=FP. Then both ran⁡P and ran⁡(I−P) are invariant under F: if x=Px, then P(Fx)=F(Px)=Fx, and the analogous identity holds when Px=0. Relative to their orthogonal direct sum, F is block diagonal and Fs leaves the occupied block unchanged while adding sI on the virtual block.

2.1step 1.1F2L1

By [F2], the eigenvalues of Fs are exactly those of Focc together with those of Fvir shifted by s. If max⁡σ(Focc)<min⁡σ(Fvir)+s, the lowest r eigenvalues are precisely the occupied block and the gap is strict; [L1] gives Πr(Fs)=P.

3.1givenstep 1.1F1F2L1∎

Conversely, if Πr(Fs)=P, its defining strict gap makes P the sum of the eigenspace projectors of Fs for the lowest r eigenvalues, so P commutes with Fs. Since [s(I−P),P]=0, this gives [F,P]=0, and the two restrictions are the occupied and virtual blocks of F. Their eigenvalues in Fs are respectively σ(Focc) and σ(Fvir)+s. Because P is exactly the lowest-r spectral projector with a strict gap, the largest occupied eigenvalue is strictly smaller than the smallest shifted virtual eigenvalue; hence the displayed ordering holds.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget undamped self-consistent projector iteration

Definition

Input: n,r, a response matrix map F:U→Hn and its occupied projector map Φ from The occupied-projector response map on its strict-gap domain, an invariant set K⊆U, an initial projector P0∈K∩Pr, a required gap gmin>0, residual tolerance ε≥0, update budget N∈N0, and a Hermitian eigensolver. On each input F(Pk) the eigensolver must return either a certified ascending eigenvalue list and, when the gap is strict, the corresponding occupied projector Φ(Pk), or a failure to certify the spectrum; assume Φ(P)∈K whenever P∈K and its gap is at least gmin. Use the Frobenius metric and the fixed-point interface of Fixed-point iteration with a residual stop and finite budget.

For k=0,1,…,N:

  1. Call the eigensolver on F(Pk). If it fails to certify the ordered spectrum, return (Pk,eigensolve-failure,∅,k). If the certified gap satisfies λr+1(F(Pk))−λr(F(Pk))<gmin, return (Pk,gap-loss,∅,k).
  2. Set Pk+1raw to the returned occupied projector Φ(Pk) and compute ρk=∥Pk−Pk+1raw∥F. If ρk≤ε, return (Pk,residual-tolerance-met,ρk,k).
  3. If k=N, return (Pk,iteration-budget-exhausted,ρk,k). Otherwise set Pk+1=Pk+1raw∈K 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.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-memory capped DIIS projector proposal with fallback

Definition

Input: the current pair (Pk,F(Pk)) with Pk∈Pr and F(Pk) Hermitian; up to m−1 earlier pairs (Pi,F(Pi)), in chronological order, with Pi∈Pr and F(Pi) Hermitian; memory cap m≥1; coefficient cap C≥1; 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 rth gap is strict, its occupied projector, or reports failure. The procedure is one proposal step:

  1. Form each commutator residual Ri=[F(Pi),Pi]:=F(Pi)Pi−PiF(Pi) for the earlier pairs followed by the current pair. This gives at most m residuals.
  2. Call the constrained solver on these residuals with c∈Rs, ∑ici=1, and ∥c∥1≤C. If it reports failure, including a singular Gram-system failure, return (Pk,singular-or-uncertified-ls); 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.
  3. If the returned coefficients fail either constraint or their feasibility certificate, return (Pk,coefficient-cap-failure); the caller then performs the baseline update. Otherwise form Fmix=∑iciF(Pi) and call the eigensolver on it. If the eigensolver fails or does not certify a strict rth gap, return (Pk,candidate-gap-failure); the caller then performs the baseline update.
  4. If the eigensolver certifies a strict gap, return (Y,candidate), where Y is its occupied projector Πr(Fmix).

The commutator least-squares objective defines a proposal; it is not a fixed-point error certificate. The outer safeguarded procedure checks ∥Y−Φ(Y)∥F separately before accepting a candidate. This algorithm makes no bare DIIS convergence claim.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Density mixing preserves admissibility but need not preserve idempotence

Statement

If D∈Dr and the gapped map Φ(D) of The occupied-projector response map on its strict-gap domain is defined, then for every α∈[0,1], D+=(1−α)D+αΦ(D) belongs to Dr. The conclusion does not assert D+∈Pr.

Facts & Assumptions

Given: D∈Dr, a defined occupied projector Φ(D) of rank r, and 0≤α≤1.

[F1]

Dr is the set of Hermitian positive contractions of trace r (The fixed-particle admissible Hermitian density domain).

[F2]

The gapped response construction gives a unique orthogonal projector Φ(D)∈Pr (The occupied-projector response map on its strict-gap domain, A strict occupied gap defines a unique rank-r spectral projector).

[F4]

Every rank-r orthogonal projector is an admissible density (Every rank-r orthogonal projector is an admissible density).

Proof

1.1F1F2F4givenalgebra

Since D and Φ(D) are Hermitian, D+ is Hermitian. For every x, x∗D+x=(1−α)x∗Dx+αx∗Φ(D)x≥0. Likewise x∗(I−D+)x=(1−α)x∗(I−D)x+αx∗(I−Φ(D))x≥0, since D∈Dr and Φ(D)∈Dr by [F1], [F2], [F4].

2.1step 1.1F1F2algebra

The trace is linear, so tr⁡D+=(1−α)r+αr=r. The two positive-semidefinite inequalities and this trace identity give D+∈Dr.

3.1step 2.1F2givenalgebra∎

To verify that idempotence need not be preserved, take n=2, r=1, the constant Hermitian response F(X)=diag⁡(0,1) on U=H2, D=diag⁡(0,1), and α=1/2. Directly, D is Hermitian, lies between 0 and I2, and has trace 1, so D∈D1. The response matrix has gap 1, so [F2] gives Φ(D)=diag⁡(1,0). Then D+=12I2 and (D+)2=14I2≠D+. Thus the update belongs to D1 by step 2.1 but is not an orthogonal projector.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

A common separating resolvent contour certifies a Lipschitz response map

Statement

Let K⊆U be a set of Hermitian inputs and suppose F:K→Hn is LF-Lipschitz in Frobenius norm. Assume that for some Hermitian H0 with occupied gap g>0, every F(X) lies in the open operator-norm ball of radius g/4 about H0. Use the common circle Γ of A spectral gap persists on a computable matrix ball with a uniform resolvent bound, with R=(λr(H0)+λr+1(H0))/2−λ1(H0). Then ∥Φ(X)−Φ(Y)∥F≤q∥X−Y∥F,q:=16Rg2LF. Thus q<1 is a checkable contraction certificate when also Φ(K)⊆K; a positive gap by itself does not establish that inequality.

Facts & Assumptions

Given: A set K⊆U, a map F:K→Hn, a Lipschitz constant LF≥0, and a Hermitian reference matrix H0 with gap g>0 such that ∥F(X)−H0∥op<g/4 for every X∈K.

[F1]

The occupied projector Φ(X) is the rank-r spectral projector of F(X) (The occupied-projector response map on its strict-gap domain).

[F2]

The same contour separates all matrices in the stated ball and has resolvent bound 4/g (A spectral gap persists on a computable matrix ball with a uniform resolvent bound).

[F3]

On the open operator-norm ball of radius g/4 about H0, the occupied block projector Πr is real Frechet C1 and ∥DΠr(H)[E]∥F≤(16R/g2)∥E∥F for every Hermitian E (A separated block spectral projector is Frechet differentiable with a resolvent bound).

[F5]

A continuous path h:[0,1]→Rm that is differentiable on (0,1) with ∥h′(t)∥2≤M satisfies ∥h(1)−h(0)∥2≤M (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[L1]

A strict gap makes the rank-r occupied projector unique (A strict occupied gap defines a unique rank-r spectral projector).

Proof

1.1givenF1F2F3L1algebra

For X,Y∈K, set HX=F(X), HY=F(Y), Δ=HX−HY, and H(t)=(1−t)HY+tHX. For 0≤t≤1, the operator-norm triangle inequality gives ∥H(t)−H0∥op≤(1−t)∥HY−H0∥op+t∥HX−H0∥op<g/4. Thus the whole matrix segment lies in the open ball of [F3], even when K is not convex. By [F2] and [L1] its occupied projector is well-defined, and by [F1] the path h(t)=Πr(H(t)) has endpoints h(0)=Φ(Y) and h(1)=Φ(X).

2.1step 1.1F3F4F5algebra

The path h is continuous on [0,1] by [F3]. At each t∈(0,1), the Frechet expansion in the direction Δ gives h(t+s)−h(t)=sDΠr(H(t))[Δ]+o(∣s∣), so h′(t)=DΠr(H(t))[Δ]; if Δ=0, the path is constant and this identity still holds. By [F3], ∥h′(t)∥F≤(16R/g2)∥F(X)−F(Y)∥F. Listing the real and imaginary parts of all matrix entries identifies the Frobenius norm with the Euclidean norm on R2n2 by [F4], so [F5] applies to this path with precisely that bound.

3.1step 1.1step 2.1F5givenalgebra∎

By [F5] and the endpoint identities from step 1.1, ∥Φ(X)−Φ(Y)∥F≤(16R/g2)∥F(X)−F(Y)∥F≤(16RLF/g2)∥X−Y∥F. This is the asserted estimate with q=16RLF/g2. If q<1 and Φ(K)⊆K, it is exactly the contraction condition on K.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck pendingOpen item page →

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 F(P)=h+G(P)+∇Exc(P) is C1 on the model's open domain. At every P0 with an occupied/unoccupied gap, the occupied-projector map Φ(P)=Πr(F(P)) is C1 on a sufficiently small neighborhood of P0 where that gap persists.

Facts & Assumptions

Given: A finite-basis model with Hermitian h, real-linear G:Hn→Hn, and real C2 functional Exc on an open neighborhood; a point P0 at which F(P0) has a strict r-th spectral gap.

[F1]

The model defines F(P)=h+G(P)+∇Exc(P), with G real-linear and Exc of class C2 (Finite-basis projector energy model).

[F2]

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).

[F3]

A gapped block projector is C1 on a neighborhood with a common separating contour (A separated block spectral projector is Frechet differentiable with a resolvent bound).

[F4]

The derivative of a composition is the composition of the derivatives (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[F5]

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).

[L1]

The gapped response map is the unique rank-r occupied projector (A strict occupied gap defines a unique rank-r spectral projector).

[F7]

The C2 convention in finite-dimensional real coordinates gives continuous partial derivatives through order two (Ck maps and multi-index derivative notation in Euclidean space).

[F8]

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).

[F9]

A real-linear map between finite-dimensional Euclidean spaces is bounded and continuous (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0).

Proof

1.1givenF1F2F7F8F9algebra

Identify the real Hermitian space with its finite coordinate space. The constant map P↦h has derivative zero. The real-linear map G is continuous by [F9] and has derivative G at every point because G(P+H)−G(P)−G(H)=0. By [F7] the first partials of Exc are C1: each has first partials given by the continuous second partials of Exc, and [F8] makes each component of ∇Exc total differentiable with continuous derivative. Thus all three summands in [F1] are C1, so F is C1 and Hermitian-valued on the model's open domain.

2.1step 1.1F3F4F5F6L1choose∎

Continuity of F gives a neighborhood V of P0 on which ∥F(P)−F(P0)∥F<g/4, where g is the gap at P0. By [F6], the operator-norm difference is also less than g/4. By [F5] this image lies in a common gap-preserving ball; [F3] makes its block projector C1 there and [L1] identifies it with the defined occupied projector. By [F4], Φ=Πr∘F is C1 on V.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

A uniform derivative bound certifies contraction of relaxed density mixing

Statement

Let K⊆Dr be nonempty, closed, and convex in Frobenius norm. Suppose F is C1 on an open neighborhood of K, every matrix F(D) there has a strict rth gap so the gapped projector map Φ is defined, and for a fixed α∈[0,1] the relaxed map Tα(D)=(1−α)D+αΦ(D) satisfies Tα(K)⊆K. If a certified induced-norm bound ∥DTα(D)∥F→F≤q(D∈K),0≤q<1, holds, where ∥A∥F→F:=sup⁡∥H∥F=1∥A[H]∥F, then Tα is a contraction on K and its iterates converge to a unique fixed point. The derivative is DTα(D)=(1−α)I+αDΦ(D). The derivative bound is a separate hypothesis; α>0 alone does not imply contraction.

Facts & Assumptions

Given: A nonempty closed convex K⊆Dr, a C1 map Φ defined on a neighborhood of K with Φ(K)⊆Pr, a fixed α∈[0,1], invariance Tα(K)⊆K, and sup⁡D∈K∥DTα(D)∥F→F≤q<1.

[F1]

The response map is Φ(D)=Πr(F(D)) wherever F(D) has a strict rth gap (The occupied-projector response map on its strict-gap domain).

[L1]

At a strict gap, the response map has a unique rank-r projector value (A strict occupied gap defines a unique rank-r spectral projector).

[F2]

The gapped block projector is C1 and has the contour derivative on its common-gap neighborhood (A separated block spectral projector is Frechet differentiable with a resolvent bound).

[F3]

A continuously differentiable vector-valued map with derivative norm bounded by q on an interval is q-Lipschitz (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[F4]

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).

[F6]

A C1 map has a continuous Frechet derivative on its open domain (Continuously differentiable maps, local inverses, and local diffeomorphisms).

[F7]

The admissible density domain is complete in Frobenius norm (The admissible Hermitian density domain is closed, convex, and complete).

Proof

1.1givenF1L1F2F5F6algebra

For D,E∈K, convexity puts the segment Z(t)=E+t(D−E) in K for t∈[0,1]. By [F1] and [L1], Φ is defined along this segment; [F2] gives its local C1 regularity. For an increment H, Tα(D+H)−Tα(D)=(1−α)H+α(Φ(D+H)−Φ(D)), so Frechet differentiability of Φ gives DTα(D)=(1−α)I+αDΦ(D). The chain rule [F5] on the segment gives ddtTα(Z(t))=DTα(Z(t))[D−E]. Its norm is at most q∥D−E∥F by the assumed induced-norm bound; continuity follows from [F2] and [F6].

2.1step 1.1F3

Apply [F3] on [0,1] to this path. It yields ∥Tα(D)−Tα(E)∥F≤q∥D−E∥F, so Tα is a contraction on K.

3.1givenstep 2.1F4F7∎

Any Frobenius-Cauchy sequence in K is Cauchy in Dr, so [F7] gives a limit in Dr; closedness of K places that limit in K. Thus K is complete. Invariance and step 2.1 allow [F4] to give a unique fixed point and convergence of all iterates from K.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget certified SCF with safeguarded DIIS and a contractive fallback

Definition

Input: an open domain U, a Hermitian response matrix map F:U→Hn, and its gapped occupied-projector map Φ from The occupied-projector response map on its strict-gap domain; a nonempty complete invariant set K⊆U∩Pr with Φ(K)⊆K and certified contraction factor 0≤q<1; an initial projector P0∈K; a certified initial error bound E0≥∥P0−P∗∥F for the unique fixed point P∗; residual tolerance ε≥0; finite update budget N∈N0; memory m≥1; coefficient cap C≥1; a Hermitian eigensolver that, for a matrix M, returns a certified ordered spectrum and occupied projector when the rth gap is strict, a certified no-gap result, or a failure to certify the spectrum; an approximate response evaluator that at X∈K returns Φ~(X)∈K and η(X)≥0 with ∥Φ~(X)−Φ(X)∥F≤η(X), 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 C, or reports failure. Every called solver returns one of its specified results.

The terminal output is (Pk,status,b,k), where Pk is the current projector and b is its certified error bound. The current budget Ek remains valid at gap, eigensolver, response-evaluation, or invariance-certificate failure statuses.

For k=0,…,N:

  1. If no certified response evaluation is cached for Pk, compute F(Pk) and call the eigensolver on it. If the eigensolver certifies no strict gap, return (Pk,gap-loss,Ek,k); if it fails to certify the spectrum, return (Pk,eigensolve-failure,Ek,k). With a certified strict gap, call the approximate response evaluator. If it fails, return (Pk,response-evaluation-failure,Ek,k). Cache (F(Pk),Φ~(Pk),η(Pk)) at exactly Pk. Whether this evaluation is new or cached, check that the certified baseline output belongs to K; if not, return (Pk,invariance-certificate-failure,Ek,k). Retain the current pair (Pk,F(Pk)) for this proposal step. Set ρˉk=∥Pk−Φ~(Pk)∥F+η(Pk). If ρˉk≤ε, return (Pk,residual-tolerance-met,ρˉk/(1−q),k).
  2. If k=N, return (Pk,iteration-budget-exhausted,Ek,k).
  3. Call Finite-memory capped DIIS projector proposal with fallback with the up-to-m−1 preceding stored pairs, the current pair (Pk,F(Pk)), the constrained least-squares solver, the eigensolver, m, and C. For a candidate Y, certify Y∈K, compute F(Y), certify its strict gap with the eigensolver, and obtain one approximate response evaluation Φ~(Y) with error η(Y). Accept Y only if all certificates succeed and ∥Y−Φ~(Y)∥F+η(Y)1−q≤qEk. If accepted, set Pk+1=Y and Ek+1=qEk.
  4. 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 K-membership, failed candidate gap, failed candidate response-error certificate, or failed candidate fixed-point residual test. Set Pk+1=Φ~(Pk) and Ek+1=qEk+η(Pk).
  5. Append the current pair (Pk,F(Pk)) to the preceding-iterate history, retaining at most the newest m−1 preceding pairs. If step 3 accepted Y, cache its certified evaluation (F(Y),Φ~(Y),η(Y)) 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 ∥Y−Φ(Y)∥F with its additive eigensolver error certificate. The algorithm makes no unconditional success claim: finite budget exhaustion and each certificate failure are explicit outcomes.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

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 q-contraction on the complete invariant set K, its fixed point is P∗, the starting error is at most E0, and every baseline response error is at most ηk. Let Ek be updated by that algorithm. Then every produced iterate obeys ∥Pk−P∗∥F≤Ek≤qkE0+∑j=0k−1qk−1−jηj. An accepted DIIS candidate has certified error at most qEk; 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 ηk→0, then Pk→P∗. A finite execution of the stated algorithm may still return budget exhaustion. Use the convention q0=1, including when q=0.

Facts & Assumptions

Given: The certified algorithm's hypotheses, starting error bound E0, contraction factor 0≤q<1, and nonnegative baseline error budgets ηk.

[F1]

For every X∈K, ∥X−P∗∥F≤∥X−Φ(X)∥F/(1−q) (A contractive self-consistent map converges and admits residual and inexact-solve bounds).

[F2]

A DIIS candidate is accepted only when its certified residual bound divided by 1−q is at most qEk; otherwise the baseline update is used and its error bound is added to qEk (Finite-budget certified SCF with safeguarded DIIS and a contractive fallback).

Proof

1.1givenF1F2

Initially ∥P0−P∗∥F≤E0 by input. Suppose ∥Pk−P∗∥F≤Ek. If the algorithm accepts candidate Y=Pk+1, [F2] gives a certified upper bound ρˉ(Y) for ∥Y−Φ(Y)∥F with ρˉ(Y)/(1−q)≤qEk. Applying [F1] at Y proves ∥Pk+1−P∗∥F≤qEk=Ek+1.

2.1givenstep 1.1F2algebra

If the baseline is used, its evaluator certifies ∥Pk+1−Φ(Pk)∥F≤ηk. The triangle inequality and contraction give ∥Pk+1−P∗∥F≤ηk+∥Φ(Pk)−Φ(P∗)∥F≤ηk+q∥Pk−P∗∥F≤qEk+ηk=Ek+1. Thus induction proves ∥Pk−P∗∥F≤Ek at every step.

3.1step 2.1F2inductionalgebra

By [F2], both update branches obey Ek+1≤qEk+ηk (accepted DIIS uses ηk=0 for this upper estimate). Iterating this scalar recurrence by induction gives Ek≤qkE0+∑j<kqk−1−jηj.

4.1givenstep 2.1step 3.1algebra∎

For any infinite sequence generated by the stated update rules with ηj→0, the scalar recurrence from step 3.1 has convolution tending to zero: for 0<q<1 and any ϵ>0, choose J so ηj≤(1−q)ϵ/2 for j≥J. The tail sum is at most ϵ/2, while the finite head and qkE0 tend to zero as k→∞. If q=0, the recurrence gives Ek+1≤ηk→0 directly. Thus Ek→0 and step 2.1 gives Pk→P∗. This is a conditional statement about an infinite sequence; it does not assert that a finite-budget run must meet its stopping tolerance.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget relaxed density-matrix mixing

Definition

Input: D0∈Dr from The fixed-particle admissible Hermitian density domain, a Hermitian response matrix map F:U→Hn whose domain contains every entered density iterate, and its occupied-projector map Φ, defined at the strict-gap points of U as in The occupied-projector response map on its strict-gap domain, a Hermitian eigensolver that for each F(Dk) 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 α∈[0,1], a fixed-point residual tolerance ε≥0, and a finite update budget N∈N0. For k=0,…,N, first call the eigensolver on F(Dk). If it fails, return (Dk,eigensolve-failure,∅,k); if the gap is absent, return (Dk,gap-loss,∅,k). Otherwise use the returned occupied projector as Φ(Dk) and compute rk=∥Dk−((1−α)Dk+αΦ(Dk))∥F. If rk≤ε, return (Dk,residual-tolerance-met,rk,k). If k=N, return (Dk,iteration-budget-exhausted,rk,k). Otherwise update Dk+1=(1−α)Dk+αΦ(Dk) and continue.

By Density mixing preserves admissibility but need not preserve idempotence, each successful update stays in Dr; 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 α=0, then the relaxed residual is identically zero and the update does not move; that stop status alone says nothing about the unmixed response residual.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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 N, there are at most N updates. The undamped and relaxed procedures use at most N+1 fixed-point residual tests; the certified DIIS procedure uses at most 2N+1, 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.

[F1]

Finite-budget undamped self-consistent projector iteration checks the spectrum/gap, then its residual, then the budget, and updates only at indices below N.

[F2]

Finite-budget relaxed density-matrix mixing uses the same index and stopping order for its relaxed residual, with earlier gap/eigensolver returns allowed.

[F3]

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 N.

Proof

technique · induction
1.1givenF1F2F3base

At the initial entered index 0, 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 0<N, at most one candidate residual test.

1.2IH

Before an entered index k≤N, its preceding entered indices are exactly 0,…,k−1, with at most k preceding updates, at most k residual tests for either baseline procedure, and at most 2k residual tests for the certified DIIS procedure.

2.1givenF1F2F3step 1.2algebra

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 k<N and makes at most one update before entering k+1. 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.

3.1givenF1F2F3step 1.1step 1.2step 2.1discharge-induction∎

The base and induction step show that entered indices form an initial segment of 0,…,N, with at most N+1 residual tests for either baseline procedure and at most 2N+1 for certified DIIS, since index N checks the current response and returns before a candidate attempt or update. All three make at most N updates. Every entered pass has finitely many returning primitives, so each procedure terminates with a stated status, including when N=0. These are only outer-work and status bounds.

5 · Examples, counterexamples and false statements

None yet.

Sources