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.
Gaussian basis integral recurrences and boys error — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Average Orders Divisor Sums and Representation Counts
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- 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
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian basis integral recurrences and boys error
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- 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
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outward rounded interval and ball arithmetic
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- 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
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Stable special function recurrences and certified evaluation
- Subspaces, Products, and Quotients
- Suprema and Infima
- 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 Exponential Function
- The Fundamental Theorems of Calculus
- The Gamma Function
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples evaluate the same-center s-orbital overlap, kinetic, attraction, and electron-repulsion integrals; exhibit the small- cancellation in the upward Boys recurrence; and attain the explicit tensor-error bounds with an aligned finite perturbation. A two-function overlap matrix shows how nearly duplicate exponents produce a small eigenvalue. The screening example accumulates every skipped-block bound and stops screening before the total budget is exceeded.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Highly contracted Gaussian coefficients amplify primitive integral error
Example
Let , , , with , and suppose every primitive four-index tensor error is while . Then the transformed four-index error is , the energy error is , and the gradient error has Frobenius norm . Both bounds in Explicit finite-dimensional contraction error bounds for energy and gradient are attained for this aligned-sign perturbation.
Facts & Assumptions
Given: The finite energy functional in Finite tensor contractions and their variational energy and gradient, with the two-dimensional coefficient vector and entrywise perturbation in the Example.
Explicit finite-dimensional contraction error bounds for energy and gradient: energy and gradient errors are bounded by the explicit formulas in its Statement.
Verification
There are primitive entries, each perturbed by , and each product of four coefficients is . Thus and . The perturbed energy is , so each gradient component is ; its two-entry Frobenius norm is .
Here and . Substitution into [F2] gives energy bound and gradient bound , equal to the errors in step 1.1.
Nearly duplicate Gaussian primitives produce an ill-conditioned overlap matrix
Example
For , define normalized s primitives . Their overlap is For the two-function overlap matrix has eigenvalues and . For distinct exponents it has eigenvalues , and as its condition number tends to infinity.
Facts & Assumptions
Given: Positive exponents , normalized Gaussian functions as defined in the Example, and the overlap integral in Cartesian Gaussian primitives, contractions, and integral conventions.
Verification
By [F1]–[F2], the unnormalized overlap is and each norm squared is or . Multiplying by the normalization constants gives .
The Gram matrix is , whose characteristic polynomial is , so its eigenvalues are . At , and the lower eigenvalue is zero. For , , hence ; continuity of the displayed formula gives as , and therefore .
Exact same-center s-orbital overlap, kinetic, attraction, and Coulomb integrals
Example
Let and for , both centered at the origin. Put . Then For , put . The same-center two-electron integral is
Facts & Assumptions
Given: Positive exponents ; the integral conventions in Cartesian Gaussian primitives, contractions, and integral conventions; and all centers equal to zero.
Cartesian Gaussian raising, lowering, and kinetic-energy recurrences: for an s primitive.
Hermite recurrence formulas for Gaussian nuclear-attraction and two-electron Coulomb integrals: the s-pair Coulomb formulas reduce to and ; an s-pair has only its coefficient.
Gaussian product theorem and finite polynomial shifts: multiplying two primitives gives the product exponent and product center , with its stated Gaussian prefactor.
Verification
For , [F5] gives , so [F1] evaluates the overlap as . For kinetic energy, substitute [F2] and use both moments in [F1]:
In [F4], set ; then the Boys argument is zero and [F3] gives . For the two-electron integral, both pair centers are zero and their only Hermite coefficient is , so [F4] with gives .
Small-argument cancellation in the upward Boys recurrence
Example
For , the upward formula for the first two Boys orders is Both subtracted quantities are close to one, while their difference is of order . If the input intervals for them have radii , the exact upward affine image has radius . If its endpoints are converted outward once with finite errors , the stored radius is . Rounding at intermediate nodes requires propagating their contributions as well. Thus fixed input radii can be strongly amplified as . The direct Taylor branch has the certified remainder for after its linear term, so it avoids this division by a small .
Facts & Assumptions
Given: , the Boys integral and recurrence, and finite certified intervals for and .
A monotone-range Taylor remainder for small Boys arguments: after , the remainder has absolute value at most for .
Upward and downward Boys recurrence error amplification bounds: the exact upward image has radius ; one finite outward conversion of each full-image endpoint adds the mean endpoint error. Intermediate-node errors must instead be propagated through all subsequent affine coefficients.
Soundness of every successful finite-budget Boys enclosure and Finite-budget certified evaluation of Boys function tables: the evaluator offers a small- Taylor enclosure and makes no success claim when a finite recurrence candidate misses tolerance.
Verification
The exact identity in [F1] divides a difference of two terms. By [F1] and [F3], with . By [F2], with for : for , , so . Therefore so for the positive difference is at least . The two terms being subtracted each tend to one as .
Applying [F4] with gives a factor on both seed radii, which diverges as for fixed nonzero radii. The stated stored-radius formula follows only for a full affine image with one finite conversion per endpoint; a primitive subtraction error must also be divided by before adding the final division error. In contrast, [F3] gives a direct Taylor enclosure with error . The algorithm [F5] can therefore select the direct small-argument branch and return only a certified interval; the example makes no claim that every requested tolerance succeeds under every finite cap.
Coulomb screening must accumulate every discarded-block bound
Example
Suppose a finite screening queue has three candidate input-basis Coulomb quartets (which may be singleton-contraction primitive quartets), each with a verified weighted energy bound , and the total discarded-energy budget is . Choose the permitted screening execution that skips a candidate whenever its cumulative bound fits the budget. With exact accumulation, the first two blocks are skipped and contribute a cumulative bound . The third would raise the cumulative bound to , so it must be evaluated or left unscreened. The reported discarded bound is ; none of the skipped integrals is claimed to be zero. This is also an execution of the outward-rounded rule when these sums are represented exactly, for example and in a format containing . Otherwise outward accumulation may conservatively prevent a skip or report a larger bound.
Facts & Assumptions
Given: A total screening tolerance , three finite candidate records with verified weighted Cauchy–Schwarz bounds , exact accumulation of these bounds, and the permitted policy that skips each candidate when the budget guard allows it. For an execution of Finite primitive and contracted Gaussian integral evaluation with certified screening, assume the displayed sums are represented exactly in its format.
Positive Coulomb bilinear form, Cauchy–Schwarz, and screening bound: each weighted discarded contribution is bounded by its certified diagonal Cauchy–Schwarz product, and total error is bounded by the sum of those terms.
Soundness and accumulated error bounds for the finite Gaussian integral evaluator: every successful reported discarded-energy bound dominates the absolute contribution of all skipped terms.
Finite primitive and contracted Gaussian integral evaluation with certified screening: a candidate is skipped only when adding its certified weighted bound keeps the running total at most the requested tolerance.
Verification
The first bound is , and the cumulative sum after two is , so [F3] permits both skips. The selected policy therefore skips both and, with the assumed exact accumulation, records .
Adding the third gives . By [F3], the screening guard therefore rejects skipping that third block and requires its evaluation or retention. By [F1]–[F2], the reported bounds only the first two omitted contributions and does not assert exact sparsity.