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.
Total deterministic Ewald and particle-mesh error certificate
Statement
Assume Countable Choice and a neutral finite point-source configuration on from Neutral point sources and Fourier data on a three-dimensional torus. Fix , real and reciprocal cutoffs , a mesh with integers and order , and a finite symmetric retained set that is injective modulo and has and for every . Put and let This in-ball omitted set is finite. Write , , , and for the shell constants in Uniform lattice-shell counts and explicit Gaussian tail controllers. Choose integers , such that and . Let be that supplier's finite upper controller for , and put
For , define the finite real-space potential at an off-source point by and the finite real energy by where the prime omits exactly . Let The cutoff index set is held fixed in this force sum; the cutoff indicator is not differentiated. Set where uses the uncorrected energy and force of Deterministic reciprocal particle-mesh Ewald potential, energy, and force bounds, and uses its optional diagonal self-corrected branch. For the uncorrected branch suppose the derivative/gather residuals are ; the corrected branch uses the energy-gradient gather, so .
Suppose the computed finite outputs have certified arithmetic radii relative to , respectively. Define Then, for every off-source and each particle , Here are the exact mean-zero periodic Ewald potential, renormalized energy, and particle force. The finite omitted-mode sums explicitly charge every mode in the radial ball that the mesh did not retain, including Nyquist modes. Missing arithmetic radii do not produce a certificate; no RMS estimate is substituted for these deterministic bounds.
For the formal exact-constant work count, let be the total number of candidate real-image indices inspected in the finite potential, energy, and force loops, and let be the total number of mode and finite controller entries inspected in constructing the omitted-mode ledger and error certificate. Count each such outer-loop inspection as one work unit and count the transform arithmetic in the formal exact-constant model of Mixed-radix and Bluestein reductions compute every finite DFT in O(N log N) arithmetic. For fixed , the finite evaluation uses work units, with at most three tensor transforms before optional mesh-self correction. The correction adds when its cyclic kernel is precomputed. These counts do not include interval precision, elementary-function evaluation, memory traffic, bit complexity, or the transform subroutine's integer factor search and phase evaluation; no operation count is used as an accuracy bound.
Facts & Assumptions
Given: Countable Choice; a neutral finite source configuration on a full-rank cell; , , a finite admissible retained mode set ; integer mesh dimensions and ; valid finite Gaussian tail-controller indices ; and actual arithmetic radii for the finite computations.
Countable Choice is required by the Gaussian periodization and mean-zero periodic Poisson theorem (The Axiom of Countable Choice ()).
, , , the data are neutral, and source positions are distinct (Neutral point sources and Fourier data on a three-dimensional torus).
The exact off-source potential and renormalized energy are the absolutely convergent Ewald formulas with reciprocal coefficient and self term ; the exact particle force differentiates the real and reciprocal Ewald terms under the collision-free convention (The alpha-independent Ewald potential and renormalized energy, Explicit real and reciprocal Ewald potential, energy, and force tail bounds).
The finite real/reciprocal Ewald omissions are bounded by the displayed formulas, and replacing each by gives a finite certified upper bound (Explicit real and reciprocal Ewald potential, energy, and force tail bounds).
The reciprocal particle-mesh potential, energy, and force aliases have the deterministic pointwise/per-particle bounds in Deterministic reciprocal particle-mesh Ewald potential, energy, and force bounds; the optional self-corrected energy/force branch has its corresponding improved retained-mode bounds there.
A full-rank lattice has only finitely many points in a bounded ball; equivalently implies (Full-rank lattices, covolume, and the dual lattice).
The radii bound the actual finite arithmetic outputs' differences from the exact-real finite truncated expressions defined in the Statement (given arithmetic enclosure interface).
Differentiating the finite source coefficient gives by the chain rule and sine/cosine derivatives (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , The derivatives of sine and cosine are cosine and minus sine, Neutral point sources and Fourier data on a three-dimensional torus).
In the formal exact-constant model, an arbitrary-length one-dimensional DFT is exact and costs arithmetic operations at length ; integer factor search and interval/phase evaluation are excluded (Arbitrary-length mixed-radix and Bluestein DFT, Mixed-radix and Bluestein reductions compute every finite DFT in O(N log N) arithmetic).
Proof
From [F1], , so implies . Only finitely many integer vectors lie in that bounded ball by [F5]. Therefore and are finite, and all missing in-ball sums in the Statement are finite.
Choose as in the Statement. The finite Gaussian controllers bound the exact real and reciprocal shell tails by [F3], giving .
For each omitted in-ball mode , and give potential magnitude at most . Its energy term is . By [F7], differentiating its finite reciprocal energy term gives exact force , whose magnitude is at most . Summing these inequalities over the finite omitted set accounts for every in-ball mode, including modes excluded by Nyquist restrictions.
The retained-mode mesh errors are bounded by [F4]. In the uncorrected energy branch this is ; in the corrected branch it is . The force contributions are the corresponding and sums in [F4], and the retained potential contribution is .
The exact Ewald series is the sum of the full real-space term, all retained reciprocal modes, all in-ball omitted reciprocal modes, and the reciprocal tail beyond , with the exact self constant in the energy. The finite approximations include the real terms through , the selected mesh approximation on , and that same self constant. Thus their exact-real differences split into the real cutoff tail, the reciprocal shell tail, the finite omitted in-ball terms, and the retained mesh alias/differentiation error. Step 1.2 bounds the real and reciprocal cutoff tails, step 1.3 accounts for every omitted in-ball mode, and step 1.4 bounds the retained mesh error. By [F3], [F4], and the triangle inequality, the absolute values or norms of these parts sum to the first terms displayed in each .
The arithmetic assumptions [F6] give , , and . Applying the triangle inequality to step 2.1 yields the three stated certificates. If an arithmetic radius is unavailable, the corresponding inequality has no supplied numerical right-hand side and no certificate is returned.
For fixed , the finite support enclosure gives at most candidates per coordinate. Thus each particle's spread and potential/force gathers use support tuples; grid initialization costs and is absorbed by the transform count. A tensor transform along coordinate consists of one-dimensional transforms of length . By [F8] this costs , and summing over the three coordinates gives . The uncorrected computation uses one forward transform and at most two inverse/gather transforms. The finite real-image and mode/controller loops contribute by definition, proving the stated total count. The optional correction adds one transform to form its cyclic kernel and at most support-pair products per particle, which gives its stated cost. The arithmetic radii are certified separately and do not follow from this operation count.
Depends on
- Arbitrary-length mixed-radix and Bluestein DFT
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Periodic cardinal-spline assignment and unitary mesh transform
- Neutral point sources and Fourier data on a three-dimensional torus
- Full-rank lattices, covolume, and the dual lattice
- Uniform lattice-shell counts and explicit Gaussian tail controllers
- Gaussian screened Coulomb kernel and its self limit
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- The alpha-independent Ewald potential and renormalized energy
- Deterministic reciprocal particle-mesh Ewald potential, energy, and force bounds
- Explicit real and reciprocal Ewald potential, energy, and force tail bounds
- Mixed-radix and Bluestein reductions compute every finite DFT in O(N log N) arithmetic
- The derivatives of sine and cosine are cosine and minus sine
Used by
Dependency tree · two levels
84 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
- Hark Lee and Wei Cai, Ewald Summation for Coulomb Interactions in a Periodic Supercell (2009 lecture notes) (standard reference, not scraped)
- Markus Deserno and Christian Holm, How to mesh up Ewald sums (I): A theoretical and numerical comparison of various particle mesh routines (1998) (standard reference, not scraped)