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.
Finite basis projector energies and variational electronic structure — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- 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
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cw Complexes and Cellular Homology
- 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 Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite basis projector energies and variational electronic structure
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-element eigenvalue approximation
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gradient Like Vector Fields and Morse Trajectories
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- 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
- 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
- Morse Critical Points Hessians and Indices
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- 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
- Products Segre and Veronese Embeddings and Grassmannians
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Riemannian Metrics Length Distance and Volume
- Riemannian optimization on stiefel and grassmann manifolds
- 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
- Smooth Manifolds and Smooth Maps
- Smooth Vector Bundles and Sections
- 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
- Symplectic Manifolds, Moser Stability, and Darboux–Weinstein Theory
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Analytic Hahn Banach Theorem
- 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 Inverse Function Theorem Completed
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topological Vector Bundles and Grassmannian Classification
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trust region and cubic regularization methods
- Uniform Spaces: the Three Definitions
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The examples separate model properties that are easy to conflate. A stationary projector can be a strict maximum; an incomplete finite trial space can lie strictly above the exact finite Hamiltonian ground state; exact overlap whitening can preserve Ritz values while amplifying coefficient perturbations; and a residual does not label the ground-state branch. Nested subspaces give nonincreasing but not necessarily strictly decreasing minima. A cusp in a chosen exchange-correlation term falls outside the hypothesis.
The complex finite-basis PC-VAR example represents the projector energy on the Grassmann quotient and verifies its complex-polar trust-region optimization guarantee under the stated finite-dimensional model hypotheses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
An incomplete finite trial space can lie strictly above the Hamiltonian ground energy
Example
Let the finite configuration space be and the Hermitian Hamiltonian be . Its ground energy is , while the one-dimensional trial space has variational energy . This is the finite-dimensional form of the warning that an incomplete configuration-interaction space need not contain the ground state.
Facts & Assumptions
Given: The Hamiltonian on and trial space .
A 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).
Verification
The eigenvalues of are and , with corresponding unit eigenvectors by [F1]. For a unit vector , , and equality holds at , so the full-space ground energy is .
Every unit vector in is for some real , and its energy is . Thus the restricted minimum is , strictly above the full finite-dimensional ground energy.
Nested trial spaces give nonincreasing energies, sometimes with equality
Example
For on , take the nested trial spaces , , and for every . Their minimum unit-vector energies are . The sequence is nonincreasing but need not decrease strictly at every enrichment; its limit is the infimum over the union.
Facts & Assumptions
Given: and the nested subspaces displayed above.
Nested compact trial sets for a common continuous energy have nonincreasing minima and converge to the infimum over their union (Nested finite-basis infima decrease to the infimum over their union).
A 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).
Closed bounded subsets of finite-dimensional real coordinate space are 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).
A continuous real-valued function on a nonempty compact set attains its minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Verification
Each unit sphere in is closed and bounded in finite-dimensional real coordinates, hence compact by [F3]. The energy is continuous, so [F4] gives a minimum on each sphere; diagonalizing the restrictions by [F2] gives the values on , respectively, and for every .
The spaces satisfy and their infinite union is . The computed values are nonincreasing, with equality at the first enrichment, and converge to . Applying [F1] to the infinite nested sequence of their unit spheres gives this same limit.
A zero Ritz residual can belong to an excited eigenstate
Example
Under Countable Choice, take and the unit Ritz vector . Its Rayleigh quotient is and its residual norm is , yet the ground eigenvalue is . The residual certifies spectral proximity but does not identify the ground-state branch.
Facts & Assumptions
Given: Countable Choice, the finite Hermitian residual theorem, , and .
Countable Choice as stated in The Axiom of Countable Choice ().
The residual bound places the Rayleigh value near some eigenvalue; the residual alone does not identify which eigenvalue or the lowest one (A Hermitian Ritz residual certifies spectral proximity and a gap-conditioned direction).
A Hermitian matrix has real eigenvalues and an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Verification
By [F2], the eigenvalues of are and , so its ground eigenvalue is . The vector is a unit eigenvector for , whence and . Thus .
The general residual theorem [F1] therefore returns exact proximity to the spectrum, but this example's nearby eigenvalue is the excited value , not the ground value . A zero residual still cannot supply spectral ordering information.
An ill-conditioned overlap preserves exact Ritz values but amplifies coordinate errors
Example
For , take This overlap is positive definite but has spectral (2-norm) condition number . Cholesky whitening preserves exact generalized Ritz values and Rayleigh quotients, while the map from whitened coordinates back to basis coefficients has operator norm . Thus exact variational invariance does not imply good numerical conditioning.
Facts & Assumptions
Given: , the overlap matrix , a Cholesky factor , and a Hermitian pencil matrix.
Cholesky whitening gives an equivalent generalized Ritz pencil and preserves its Rayleigh quotient (Positive-definite overlap whitening preserves a generalized Ritz pencil).
Hermitian matrices have orthonormal eigenbases (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 maximum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Verification
The vectors and are orthonormal and satisfy and . Both eigenvalues are positive, and their ratio is .
Let be its Cholesky factorization. By [F1], preserves the exact generalized eigenvalues and Rayleigh quotient. For any matrix , , which equals the largest eigenvalue of the positive Hermitian matrix by [F2]. Since , its eigenvalues are and , so . For , , which is similar to ; hence as well. The operator norm is attained on a unit vector in this finite-dimensional space, so a unit perturbation in a maximizing direction is amplified by this factor when converted back to coefficient coordinates.
As , the condition number and coordinate amplification diverge, although the exact whitening identities in [F1] continue to hold for each . This is a conditioning observation; it gives no finite-precision energy-error estimate without a specified perturbation model.
A cusp in a chosen exchange-correlation term violates the C2 hypothesis
Example
With on and , consider the candidate term . Along the rank-one projectors , where , its value is and has a cusp at . This candidate is not on a neighborhood of the projector domain and so is outside the finite-basis model hypothesis.
Facts & Assumptions
Given: , , and the candidate functional .
The model's exchange-correlation term must be real and on a neighborhood of (Finite-basis projector energy model).
A rank-one projector is for a unit vector (Rank-r orthogonal projector domain).
The composition of totally differentiable maps is totally differentiable (The chain rule for total derivatives: ).
Verification
For every , , so [F2] gives . Multiplication yields .
Near , the left branch of has derivative at , while the right branch has derivative . The restriction is not differentiable there; by [F3], a ambient functional composed with the smooth curve would be differentiable. Hence the candidate cannot satisfy the requirement in [F1].
A two-level nonlinear projector model has a stationary strict maximum
Example
In with , let , , , and define on Hermitian . Then is a self-adjoint real-linear map, so it defines the allowed nonlinear projector energy . At the commutator stationarity condition holds, but is a strict local maximum, not a minimum.
Facts & Assumptions
Given: , , , , , and .
A rank-one orthogonal projector has the form for a unit vector (Rank-r orthogonal projector domain).
The energy gradient is (Finite-basis projector energy model, The finite projector energy is real and has the stated Frobenius gradient).
A projector is stationary exactly when it commutes with its model gradient (Projector-energy stationarity is equivalent to Fock commutation).
Verification
For Hermitian , and are real, and . Thus is self-adjoint and real-linear; the model's quadratic term is .
For an arbitrary unit vector , put . Then by [F1], , and . A neighborhood of is given by ; every distinct projector there has and hence . Thus is a strict local maximum in the full complex projector domain.
At , , which is diagonal and therefore commutes with . By [F3], is stationary, while step 2.1 shows it is not a local minimum.
Complex finite-basis PC-VAR optimization on Grassmann
Example
Take the complex finite-basis PC-VAR energy and Hermitian gradient from Finite-basis projector energy model and The finite projector energy is real and has the stated Frobenius gradient. The model's domain is the rank- Hermitian projector set, with . A complex orthonormal frame represents , and unitary frame changes preserve . The model-specific Grassmann gradient is
Start from any and set . Choose , , , , , and ; use an outer cap at least the bound in Riemannian trust regions reach an epsilon-gradient iterate.
Use the complex polar retraction and the finite-budget trust-region method of Finite-budget Riemannian trust-region method, with the inner subproblem routine returning failure immediately so the method uses its explicit Cauchy fallback. Since , the small-radius safeguard also selects the Cauchy step at every positive radius. The polar map preserves the projector's Hermitian, idempotent, rank- constraints at every trial; rejected trials leave the current projector unchanged. Because the finite-basis energy is on a neighborhood and the complex Grassmannian is compact, its pullback gradients are uniformly Lipschitz on every fixed bounded tangent disk. Choose the zero self-adjoint model operator, which is uniformly bounded. Thus the hypotheses of Riemannian trust regions reach an epsilon-gradient iterate hold, and its first-order target is reached within the theorem's explicit accepted and rejected outer-trial bound when the finite cap is chosen accordingly. This is a finite-dimensional optimization guarantee; no claim is made that an arbitrary selected exchange-correlation functional models exact continuum physics.
Facts & Assumptions
Given: The finite-basis PC-VAR model of Finite-basis projector energy model, its real-valued energy and Hermitian Frobenius gradient (The finite projector energy is real and has the stated Frobenius gradient), , and an initial frame defining .
The model defines on rank- Hermitian projectors (Finite-basis projector energy model).
The real-valued energy has Hermitian Frobenius gradient (The finite projector energy is real and has the stated Frobenius gradient).
The complex Grassmann tangent is represented by and projects by (Complex Stiefel and Grassmann tangent projections).
The gradient of a Hermitian projector energy with gradient is (Gradient of a unitary-invariant Hermitian projector energy).
Complex Grassmann is compact, and its polar map is defined on horizontal vectors, maps to orthonormal frames, is smooth, and has frame differential (Finite-dimensional complex Stiefel and Grassmann manifolds are compact, Polar retraction on the complex Grassmannian, The complex Grassmann polar map is a first-order retraction).
The trust-region method uses a retracted trial, leaves the current point on rejection, and has the proved first-order count under its pullback hypotheses (Finite-budget Riemannian trust-region method, Riemannian trust regions reach an epsilon-gradient iterate).
Every finite-dimensional complex inner-product subspace has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).
Closed bounded subsets of a finite-dimensional Euclidean space are compact (For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).
A continuous real-valued function on a compact metric space attains its maximum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Proof
If , then is Hermitian and , with range equal to the column space of and therefore rank . For unitary , . Thus is unitary-invariant and descends to complex Grassmann by [F1].
For every horizontal , [F2] and [F4] yield the complex Grassmann gradient . This formula uses the real derivative of the Hermitian-matrix energy, as required for a real-valued objective on complex coordinates.
Conversely, let be any rank- orthogonal projector. Choose an orthonormal basis of its -dimensional range by [F7] and collect its vectors as the columns of . Then and , so the parameterization covers exactly the model's projector domain. By [F5], the polar-retracted trial remains a complex orthonormal frame, so its projector remains Hermitian, idempotent, and rank ; rejection leaves the old projector unchanged by [F6].
Fix any finite . The set of pairs with , , and is closed and bounded in a finite-dimensional real coordinate space, hence compact by [F8]. The polar retraction is smooth on it, and [F1]–[F2] make the pullback energy along the horizontal tangent bundle. Its fiber Hessian is continuous on this compact set, so its operator norm has a finite maximum by [F9]. Integrating this Hessian along each fiber segment gives a uniform Lipschitz bound for the pullback gradient. Choose the model operator , which is self-adjoint and uniformly bounded by . Hence all regularity and model hypotheses in [F6] hold, and a finite cap at least the theorem's trial bound suffices.
Sources
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3 (2008)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication)
- Nicholas D. S. Manton, Optimization algorithms exploiting unitary constraints, IEEE Transactions on Signal Processing 50 (2002), §§IV and VI