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.
Ewald periodic potentials and particle mesh error — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Character Groups and Elementary LCA Duals
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complexification, Realification and Real Structures
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- 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
- Equivalent Forms of Completeness
- Euclidean Surface Measure, Divergence, and Green Identities
- Ewald periodic potentials and particle mesh error
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- 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
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minkowski Theory and Number Field Class Groups
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- 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
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Poisson Summation Sampling and Lattice Duality
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- 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
- Smooth Partitions of Unity and Exhaustions
- Stone–Weierstrass in General
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tempered Distributions and the Fourier Transform
- The Ascoli–Arzelà 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 Formal Laurent Series Field ℝ((t⁻¹)): Cauchy Complete, Non-Archimedean, Not Complete
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- 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
- Uniform Spaces: the Three Definitions
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Examples
These examples compute a neutral dipole structure factor, expose the zero-mode obstruction for nonneutral data, show the local potential and field singularities at a source, compare the opposing real and reciprocal cutoff trends as changes, and verify when the declared mesh force is the gradient of the mesh energy. The knot convention and distinction between RMS estimates and deterministic bounds are retained explicitly.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A nonneutral periodic source has no periodic Poisson solution
Example
On any three-dimensional torus, a single point charge of is nonneutral and cannot be the right side of a periodic Poisson equation .
Facts & Assumptions
Given: A full-rank three-dimensional cell, a point in its torus, and the one-charge source distribution with .
and the distributional Laplacian satisfies (Neutral point sources and Fourier data on a three-dimensional torus).
Verification
Test a hypothetical periodic distribution solution against the constant smooth periodic function . Since , the left side is by [F1].
The right side would be by [F1], contradicting step 1.1. Therefore no periodic distribution solution exists for this nonneutral source.
A neutral dipole cell and its reciprocal modes
Example
Take the unit cubic torus , with charges at and at . The dipole is neutral and its Fourier structure factor vanishes on every even first-coordinate mode and is equal to on every odd first-coordinate mode.
Facts & Assumptions
Given: Countable Choice, , the unit cell, these two charges and positions, and the Fourier coefficient and reciprocal-energy conventions for neutral periodic data.
The Gaussian Ewald formula uses Countable Choice (The Axiom of Countable Choice ()).
and neutral data have zero coefficient at (Neutral point sources and Fourier data on a three-dimensional torus).
The reciprocal Ewald energy is with , and the full renormalized energy adds the real-space and self terms (The alpha-independent Ewald potential and renormalized energy).
Verification
The two positions are distinct in and . For , [F1] gives ; hence , when is even, and when is odd.
For any finite symmetric reciprocal mode set , the dipole contributes to the retained reciprocal energy. The remaining real-space and self contributions are exactly the terms in [F2], under its neutrality, positive-parameter and Countable Choice hypotheses [A1]. Thus the zero mode is absent and the reciprocal selection is precisely the odd- subset, not an assumed continuum average.
A point-source potential is singular at a source
Example
On the unit cubic torus take charges at and at . For , the exact Ewald potential and its gradient satisfy The potential and field therefore have their local Coulomb singularities, so a pointwise potential or field-error claim must exclude a source collision.
Facts & Assumptions
Given: Countable Choice, this neutral dipole configuration, and its exact mean-zero Ewald potential for any .
The Gaussian Ewald representation assumes Countable Choice (The Axiom of Countable Choice ()).
For distinct neutral sources, the Ewald potential has a finite regular part after subtracting at each source (The alpha-independent Ewald potential and renormalized energy).
, and for its derivative is ; the screened-kernel proof also gives (Gaussian screened Coulomb kernel and its self limit).
The screened kernel and its derivative have Gaussian bounds, and each translate of the full-rank lattice has the stated uniform shell count (Gaussian screened Coulomb kernel and its self limit, Uniform lattice-shell counts and explicit Gaussian tail controllers).
The reciprocal Ewald coefficient is and for this dipole; each first spatial derivative multiplies a mode by , so the shell bound makes both the reciprocal potential and its gradient series uniformly absolutely convergent, with only finitely many nonzero modes in (The alpha-independent Ewald potential and renormalized energy, Uniform lattice-shell counts and explicit Gaussian tail controllers).
Verification
The configuration is neutral, and its two torus positions are distinct. For , , while every image of relative to has first coordinate in and hence distance at least . Thus for , every real-space image except stays at distance at least from . By [F3], the finitely many nearby nonself terms and their first derivatives are uniformly bounded there, and the Gaussian shell bound makes the remaining potential and derivative tails uniformly convergent. The reciprocal series and its gradient are bounded by [F4]. Hence the nonself periodic remainder and its gradient are bounded near .
Writing , [F2] gives the self-potential expansion . Substituting the stated error-function expansion into the derivative formula in [F2] cancels the terms and gives . Since , its gradient is . Adding the bounded nonself potential and gradient from step 1.1 proves both expansions in the Example.
The magnitude of the leading gradient term is , while the remainder is bounded; the potential likewise diverges as . Neither has a finite value at the source, so uniform pointwise potential or field error claims for these point sources must exclude collisions.
Opposite real and reciprocal cutoff trends in the Ewald parameter
Example
Fix the unit cell, a neutral dipole with nonzero total absolute charge , and real and reciprocal cutoffs . The real-space potential-tail bound decreases strictly with , while the reciprocal-space potential-tail bound increases strictly with . Thus choosing at fixed cutoffs and target tolerance balances two opposing certified contributions.
Facts & Assumptions
Given: A fixed neutral configuration with , fixed cutoffs , and a positive parameter .
The Ewald formulas use Countable Choice (The Axiom of Countable Choice ()).
The real and reciprocal potential-tail bounds are and (Explicit real and reciprocal Ewald potential, energy, and force tail bounds).
is finite for , and each term is positive (Uniform lattice-shell counts and explicit Gaussian tail controllers).
Verification
For set and , where and . These are exactly the two bounds in [F1], and they are finite by [F2].
If , then for every , because both positive factors strictly decrease. The positive convergent sum therefore gives .
For every , , since makes the negative exponent less negative. Summing positive terms gives . Hence a fixed-tolerance certificate must balance the real and reciprocal tails; the theorem does not infer an optimal parameter from FFT work or RMS data.
The energy-gradient mesh force matches the differentiated mesh energy
Example
Fix and take the unit cubic cell, at and at , a mesh, order , and retained modes . The sources are neutral and lie off mesh knots. The mesh force from the energy-gradient gather is the negative gradient of the finite mesh reciprocal energy; the optional self correction has the displayed differentiated force. The theorem's deterministic bound applies.
Facts & Assumptions
Given: Countable Choice, ; the dipole configuration, , , the displayed signed modes, and the unitary mesh assignment.
The Ewald reciprocal error theorem carries Countable Choice from the periodic Gaussian construction (The Axiom of Countable Choice ()).
The DFT-deconvolved spread coefficient obeys with the stated normalization (Exact three-dimensional spline assignment aliases and FFT normalization).
The mesh energy is , and its declared force is the real-part gather; the corrected energy subtracts (Periodic cardinal-spline assignment and unitary mesh transform).
For the mesh force is the negative energy gradient; the self-corrected force and deterministic energy/force bounds are as stated in the reciprocal PME theorem (Deterministic reciprocal particle-mesh Ewald potential, energy, and force bounds).
Verification
The two positions are distinct and neutral. Each coordinate multiplied by is either or , hence no coordinate is an integer and both particles are off assignment knots. The mode set is symmetric, injective modulo , nonzero, and satisfies . Since , the required window denominators are nonzero.
By [F1], . With , the factors are differentiable. The chain rule gives . Therefore . Summing over and negating yields exactly the stated energy-gradient force.
Differentiating with respect to gives . Hence , the corrected force formula.
Since , this instance has classical derivatives at all positions. Applying [F3] to the same admissible data gives the deterministic retained-mode error certificate, including the corrected bound when the correction is selected. A spectral differentiation rule is a different force choice and does not inherit this energy-gradient identity; at knots the assignment definition supplies a branch value but no classical-gradient claim.