Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 AZ3 from Neutral point sources and Fourier data on a three-dimensional torus. Fix α>0, real and reciprocal cutoffs R,Kc≥1, a mesh with integers Mr≥1 and order P≥2, and a finite symmetric retained set K⊆{k∈Z3∖{0}:∣κk∣≤Kc} that is injective modulo (M1,M2,M3) and has ∣kr∣<Mr/2 and D(k)≠0 for every k∈K. Put Q=∑i∣qi∣ and let BKc={k∈Z3∖{0}:∣κk∣≤Kc},MKc=BKc∖K. This in-ball omitted set is finite. Write MR=⌊R⌋, MK=⌊Kc⌋, CR=CA, and CK=C2πA−T for the shell constants in Uniform lattice-shell counts and explicit Gaussian tail controllers. Choose integers JR≥MR, JK≥MK such that 2α2JR(JR+1)≥3 and 12α2JK(JK+1)≥3. Let U3(β,M,J) be that supplier's finite upper controller for ∑m=M∞(m+1)3e−βm2, and put B‾RU=QCRπαU3(α2,MR,JR),B‾RE=Q2CR2παU3(α2,MR,JR),B‾RF,i=∣qi∣QCRπ(2α+α−1)U3(α2,MR,JR),B‾KU=4πQCKVU3((4α2)−1,MK,JK),B‾KE=2πQ2CKVU3((4α2)−1,MK,JK),B‾KF,i=4π∣qi∣QCKVU3((4α2)−1,MK,JK).

For ϕs(r)=erfc⁡(αr)/r, define the finite real-space potential at an off-source point by SR(x)=∑iqi∑λ∈Λ∣x−xi+λ∣≤Rϕs(∣x−xi+λ∣), and the finite real energy by ER=12∑i∑j∑λ∈Λ∣xi−xj+λ∣≤R′qiqjϕs(∣xi−xj+λ∣), where the prime omits exactly (j,λ)=(i,0). Let FR,i=−qi∑1≤j≤n, λ∈Λ(j,λ)≠(i,0),∣xi−xj+λ∣≤Rqj ϕs′(∣xi−xj+λ∣)xi−xj+λ∣xi−xj+λ∣. The cutoff index set is held fixed in this force sum; the cutoff indicator is not differentiated. Set U~(x)=SR(x)+UM,K(x), E~χ=ER+EM,Kχ−απ∑iqi2,F~iχ=FR,i+FM,iχ, where χ=uncorr uses the uncorrected energy and force of Deterministic reciprocal particle-mesh Ewald potential, energy, and force bounds, and χ=corr uses its optional diagonal self-corrected branch. For the uncorrected branch suppose the derivative/gather residuals are Hk; the corrected branch uses the energy-gradient gather, so Hk=0.

Suppose the computed finite outputs U^(x),E^χ,F^iχ have certified arithmetic radii εU,εE,εF,i≥0 relative to U~,E~χ,F~iχ, respectively. Define ηU=B‾RU+B‾KU+Q∑m∈MKccm+Q∑k∈KckAk(2+Ak)+εU,ηEuncorr=B‾RE+B‾KE+Q22∑m∈MKccm+Q22∑k∈KckAk(2+Ak)+εE,ηEcorr=B‾RE+B‾KE+Q22∑m∈MKccm+Q2−∑iqi22∑k∈KckAk(2+Ak)+εE,ηF,iuncorr=B‾RF,i+B‾KF,i+∣qi∣Q∑m∈MKccm∣κm∣+∣qi∣Q∑k∈Kck[∣κk∣Ak+(1+Ak)Bk+(1+Ak)Hk]+εF,i,ηF,icorr=B‾RF,i+B‾KF,i+∣qi∣Q∑m∈MKccm∣κm∣+∣qi∣(Q−∣qi∣)∑k∈Kck[∣κk∣Ak+(1+Ak)Bk]+εF,i. Then, for every off-source x and each particle i, ∣U^(x)−Uα(x)∣≤ηU,∣E^χ−E∣≤ηEχ,∥F^iχ−Fi∥2≤ηF,iχ. Here Uα,E,Fi are the exact mean-zero periodic Ewald potential, renormalized energy, and particle force. The finite omitted-mode sums MKc 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 Nimg be the total number of candidate real-image indices inspected in the finite potential, energy, and force loops, and let Ncert 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 P, the finite evaluation uses O ⁣(Nglog⁡(2Ng)+nP3+Nimg+Ncert) work units, with at most three tensor transforms before optional mesh-self correction. The correction adds O ⁣(Nglog⁡(2Ng)+nP6) 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; α>0, R,Kc≥1, a finite admissible retained mode set K; integer mesh dimensions and P≥2; valid finite Gaussian tail-controller indices JR,JK; and actual arithmetic radii for the finite computations.

[A1]

Countable Choice is required by the Gaussian periodization and mean-zero periodic Poisson theorem (The Axiom of Countable Choice (ACω)).

[F1]

Λ=AZ3, V=∣det⁡A∣, κk=2πA−Tk, the data are neutral, and source positions are distinct (Neutral point sources and Fourier data on a three-dimensional torus).

[F2]

The exact off-source potential and renormalized energy are the absolutely convergent Ewald formulas with reciprocal coefficient ck and self term −α∑iqi2/π; 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).

[F3]

The finite real/reciprocal Ewald omissions are bounded by the displayed BRU,BRE,BRF,i,BKU,BKE,BKF,i formulas, and replacing each T3 by U3 gives a finite certified upper bound (Explicit real and reciprocal Ewald potential, energy, and force tail bounds).

[F4]

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.

[F5]

A full-rank lattice has only finitely many points in a bounded ball; equivalently ∣κk∣≤Kc implies ∣k∣≤∥AT∥2Kc/(2π) (Full-rank lattices, covolume, and the dual lattice).

[F6]

The radii εU,εE,εF,i bound the actual finite arithmetic outputs' differences from the exact-real finite truncated expressions defined in the Statement (given arithmetic enclosure interface).

[F8]

In the formal exact-constant model, an arbitrary-length one-dimensional DFT is exact and costs O(Mlog⁡(2M)) arithmetic operations at length M; 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

technique · direct
1.1F1F5algebra

From [F1], κk=2πA−Tk, so ∣κk∣≤Kc implies ∣k∣≤∥AT∥2Kc/(2π). Only finitely many integer vectors lie in that bounded ball by [F5]. Therefore BKc and MKc are finite, and all missing in-ball sums in the Statement are finite.

1.2givenF3

Choose JR,JK as in the Statement. The finite Gaussian controllers U3 bound the exact real and reciprocal shell tails by [F3], giving B‾RU,B‾RE,B‾RF,i,B‾KU,B‾KE,B‾KF,i.

1.3A1F1F2F5F7algebra

For each omitted in-ball mode m∈MKc, ∣ρm∣≤Q and ∣eiκm⋅x∣=1 give potential magnitude at most cmQ. Its energy term is 12cm∣ρm∣2≤12cmQ2. By [F7], differentiating its finite reciprocal energy term gives exact force −qicmRe⁡(ρm‾∇xam(ti)), whose magnitude is at most ∣qi∣cm∣ρm∣∣κm∣≤∣qi∣Qcm∣κm∣. Summing these inequalities over the finite omitted set accounts for every in-ball mode, including modes excluded by Nyquist restrictions.

1.4F4

The retained-mode mesh errors are bounded by [F4]. In the uncorrected energy branch this is 12Q2∑k∈KckAk(2+Ak); in the corrected branch it is 12(Q2−∑iqi2)∑k∈KckAk(2+Ak). The force contributions are the corresponding ∣qi∣Q and ∣qi∣(Q−∣qi∣) sums in [F4], and the retained potential contribution is Q∑k∈KckAk(2+Ak).

2.1A1F2F3F4step 1.2step 1.3step 1.4algebra

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 Kc, with the exact self constant in the energy. The finite approximations include the real terms through R, the selected mesh approximation on K, 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 η.

3.1F6step 2.1algebra

The arithmetic assumptions [F6] give ∣U^−U~∣≤εU, ∣E^χ−E~χ∣≤εE, and ∥F^iχ−F~iχ∥2≤εF,i. 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.

4.1F8algebra∎

For fixed P≥2, the finite support enclosure gives at most P+2≤2P candidates per coordinate. Thus each particle's spread and potential/force gathers use O(P3) support tuples; grid initialization costs O(Ng) and is absorbed by the transform count. A tensor transform along coordinate r consists of Ng/Mr one-dimensional transforms of length Mr. By [F8] this costs O(Nglog⁡(2Mr)), and summing over the three coordinates gives O(Nglog⁡(2Ng)). The uncorrected computation uses one forward transform and at most two inverse/gather transforms. The finite real-image and mode/controller loops contribute Nimg+Ncert by definition, proving the stated total count. The optional correction adds one transform to form its cyclic kernel and at most (P+2)6=O(P6) 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

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