Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A reported singular DIIS Gram system triggers the baseline fallback

Example

Let P0=diag⁡(1,0), P1=diag⁡(0,1), and X=(0110). In the finite-basis model choose S=L=I2, h=0, Exc=0, and the real-linear map G(P)=(⟨P,P0⟩F−⟨P,P1⟩F)X+⟨P,X⟩F(P0−P1). At P0 and P1 the commutator residuals are equal and nonzero, making the two-vector Gram matrix singular. A solver that reports this singular system uses the specified baseline fallback, even though the exact capped minimizer exists.

Facts & Assumptions

Given: The finite-basis model and DIIS proposal algorithm, with memory cap m=2, current pair (P1,F(P1)), preceding pair (P0,F(P0)), coefficient cap C=2, a configured bordered-Gram solver, and an exact Hermitian eigensolver for the mixed Fock matrix.

[F1]

A finite-basis model accepts a real-linear self-adjoint G and defines F(P)=h+G(P)+∇Exc(P) (Finite-basis projector energy model).

[F2]

The capped least-squares problem has a unique minimum-norm minimizer even when its Gram matrix is singular (Capped DIIS coefficients have a unique minimum-norm least-squares selection).

[F3]

A singular/uncertified configured least-squares solve requests the baseline SCF update (Finite-memory capped DIIS projector proposal with fallback).

Verification

1.1givenF1algebra

The matrices P0,P1,X are mutually Frobenius-orthogonal and ∥P0∥F2=∥P1∥F2=1. Put Δ=P0−P1, so the displayed map is G(A)=⟨A,Δ⟩FX+⟨A,X⟩FΔ. Since this is a real-linear map into the Hermitian span of X,Δ, symmetry of the Frobenius inner product gives ⟨G(A),B⟩F=⟨A,Δ⟩F⟨X,B⟩F+⟨A,X⟩F⟨Δ,B⟩F=⟨A,G(B)⟩F for Hermitian A,B. Thus the model data satisfy [F1].

2.1step 1.1algebra

Substitution gives G(P0)=X and G(P1)=−X. The matrices X and −X have eigenvalues −1,1, so both iterates have gap 2. Direct multiplication gives [G(P0),P0]=(0−110)=[G(P1),P1]≠0.

3.1step 2.1F2F3algebra∎

Writing the common residual as J, the Gram matrix is Bij=⟨J,J⟩F=2,B=(2222), which is singular. The equality-constrained bordered system has matrix (221221110), whose first two rows coincide, so a solver that reports singularity takes the prescribed fallback. With C=2, c=(1/2,1/2) is feasible and minimizes the objective; the objective is constant on c1+c2=1, so [F2] selects this unique minimum-norm minimizer. If a rank-revealing solver returns it instead of reporting singularity, then Fmix=12X−12X=0 has no strict gap, and the proposal algorithm again falls back by its candidate-gap branch. Thus either outcome of this configured solve uses the baseline.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources