Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Periodic cardinal-spline assignment and unitary mesh transform

Definition

Fix neutral point-source data (A,V,Λ,κk,(xi,qi)i=1n) from Neutral point sources and Fourier data on a three-dimensional torus, an Ewald parameter α>0, integers M1,M2,M3≥1, an assignment order P≥2, and write Ng=M1M2M3. Let G=∏r=13{0,…,Mr−1} and take WP from Causal cardinal spline window. Define the periodic causal assignment weights, for t∈[0,1)3 and ℓ∈G, by wℓ(t)=∏r=13∑j∈ZWP(Mrtr−ℓr−jMr). The sums are finite because WP is supported on [0,P]. They collect every support index into its grid residue; if P>Mr, distinct support indices that wrap to the same residue are added. The spread grid is gℓ=∑i=1nqiwℓ(ti),ti=A−1xi(modZ3).

Use the negative-sign unitary tensor DFT convention g^M(k)=Ng−1/2∑ℓ∈Ggℓe−2πi∑r=13krℓr/Mr, which is the product transform of The unitary discrete Fourier transform on Z/NZ. Signed frequency representatives are chosen before evaluating windows. A retained set K⊂Z3∖{0} is finite, symmetric under k↦−k, injective modulo (M1,M2,M3), and satisfies ∣kr∣<Mr/2 for each coordinate. In particular, even-grid Nyquist modes are not silently retained.

For u∈R, put sinc⁡(u)=sin⁡(u)/u when u≠0 and sinc⁡(0)=1. Define D(k)=∏r=13e−πiPkr/Mrsinc⁡(πkr/Mr)P. Only modes with D(k)≠0 are admissible for division. A computed implementation must first certify a strictly positive lower bound for ∣D(k)∣; otherwise it returns denominator-inconclusive without dividing. For k∈K, define ak(t)=e−2πik⋅t,bk(t)=∑ℓ∈Gwℓ(t)e−2πi∑rkrℓr/MrD(k)‾,ρk=∑iqiak(ti),zk=Ng g^M(k)D(k)‾. The denominator is the complex conjugate of the printed window multiplier; this sign is part of the definition. Set ck=4πV∣κk∣2e−∣κk∣2/(4α2). The exact retained reciprocal energy is EK=12∑k∈Kck∣ρk∣2, and the mesh reciprocal energy is EM=12∑k∈Kck∣zk∣2.

Let dk(t) be the declared physical mesh derivative: it is ∇xbk(t)=A−T∇tbk(t) wherever the classical derivative exists. A grid knot is a point with Mrtr∈Z for some coordinate r. At a P=2 knot, take the one-sided vector limits from all adjacent open mesh boxes. Define dk(t) to be any selected one-sided limit or the arithmetic average of all those limits. This is a procedure value and does not assert that the classical derivative exists there. The energy-gradient mesh force is FM,i=−qi∑k∈KckRe⁡ ⁣(zk‾dk(ti)). Define the diagonal mesh-self correction and corrected reciprocal energy by CM=12∑iqi2∑k∈Kck(∣bk(ti)∣2−1),EMcorr=EM−CM. Whether the declared force is the derivative of this corrected energy, and the error bound it satisfies, are proved separately.

Remarks

  • ∇x=A−T∇t is the physical derivative in the cell coordinates x=At.
  • Every reciprocal mode omitted from K, including Nyquist modes, belongs to the separately bounded reciprocal truncation error.
  • This definition makes no accuracy claim about an FFT or a floating-point implementation. The error theorem supplies those conditions separately.

Depends on

Used by

Dependency tree · two levels

20 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