Alphabeta Math
LemmaStatement: 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.

Exact three-dimensional spline assignment aliases and FFT normalization

Statement

Use the periodic cardinal-assignment model of Periodic cardinal-spline assignment and unitary mesh transform, with integers Mr≥1, order P≥2, grid size Ng=∏rMr, a retained signed mode k satisfying ∣kr∣<Mr/2, and D(k)≠0. Put ur=kr/Mr, ak(t)=e−2πik⋅t, and rk,n=∏r=13Dr(kr+nrMr)‾Dr(kr)‾,Dr(m)=e−πiPm/Mrsinc⁡(πm/Mr)P. Then the single-particle assignment factor and the spread-grid coefficient obey the absolutely convergent identities bk(t)=∑n∈Z3rk,nak+n⊙M(t),zk=∑n∈Z3rk,nρk+n⊙M, where (n⊙M)r=nrMr and ρj=∑iqie−2πij⋅ti. In particular zk−ρk=∑n≠0rk,nρk+n⊙M. The mesh coefficient also has the exact finite representation zk=∑iqibk(ti), so no cell-volume or grid-size factor remains after the displayed Ng conversion. The alias bound below uses only the Fourier series of the compact spline; the lattice Poisson theorem is not applied to that spline.

For ur≠0 define ar(P,ur)=∑m≠0∣urur+m∣P,ar(P,0)=0,Ak=∏r=13(1+ar(P,ur))−1. Then ∣bk(t)−ak(t)∣≤Ak, ∣bk(t)∣≤1+Ak, and ∣zk−ρk∣≤QAk for Q=∑i∣qi∣. For J≥1 and 0<∣ur∣<1/2, ar(P,ur)≤2∣ur∣P(1−∣ur∣)P∑m=1∞m−P,∑∣m∣>J∣urur+m∣P≤2∣ur∣P(1−∣ur∣)P⌊J⌋1−PP−1. Thus every alias controller has a finite p-series remainder bound. The periodic assignment also satisfies ∑ℓ∈Gwℓ(t)=1, so the spread-grid zero mode is ∑ℓgℓ=∑iqi=0 for neutral data.

Facts & Assumptions

Given: A full-rank cell, neutral finite charges, integers Mr≥1, P≥2, k∈Z3 with ∣kr∣<Mr/2, and the periodic assignment, DFT, Dr, bk, zk, and ρk definitions of Neutral point sources and Fourier data on a three-dimensional torus and Periodic cardinal-spline assignment and unitary mesh transform.

[F1]

W1=1[0,1] and, for P≥2, WP is the finite truncated-power formula supported on [0,P]; convolution is the integral operation defined in Convolution of two functions on Rn. The periodic weights, signed mode restrictions, and denominator D(k)=∏rDr(kr) have the definitions displayed on the A page (Causal cardinal spline window, Periodic cardinal-spline assignment and unitary mesh transform).

[F2]

The mesh transform has the negative-sign unitary normalization Ng−1/2 in dimension three (Periodic cardinal-spline assignment and unitary mesh transform, The unitary discrete Fourier transform on Z/NZ).

[F3]

For every real p>1, the p-series ∑m≥1m−p converges (The p-series for a real exponent p converges exactly when p is greater than one).

[F4]

Nonnegative iterated integrals may be interchanged; this justifies the convolution and periodic partition calculations (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F5]

An absolutely summable Fourier coefficient series converges uniformly by the complex Weierstrass test (Weierstrass M-test for complex-valued function series).

[F6]

The derivatives of sine and cosine are cosine and minus sine, so the real and imaginary parts of eiωx have the elementary primitives used to evaluate its finite-interval integral (The derivatives of sine and cosine are cosine and minus sine).

[F7]

Absolutely integrable products may be interchanged and factored in the convolution transform calculation (Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

technique · direct
1.1F1algebra

Define V1=1[0,1] and recursively VP(u)=∫01VP−1(u−s)ds, so VP=VP−1∗1[0,1] by the convolution definition [F1]. For P=2, the integral is the length of [0,1]∩[u−1,u], giving u on [0,1], 2−u on [1,2], and zero outside; this is the truncated-power formula. For P≥3, integrate the formula for VP−1 term by term; reindexing the second sum and applying Pascal's identity gives the stated formula for WP. Thus VP=WP for all P≥2. The recursion gives nonnegativity and support in [0,P]. The formula gives WP(0)=0, and its value at P is the Pth finite difference of the degree-(P−1) polynomial uP−1, hence is zero; therefore the zero extension is continuous at both support endpoints. Differentiating the formula on each polynomial interval and applying Pascal's identity gives WP′(u)=WP−1(u)−WP−1(u−1); for P=2 this identity holds on open intervals, with the one-sided values at integers.

1.2givenF3algebra

From the transform factor, for nr≠0 and ur=kr/Mr, ∣Dr(kr+nrMr)/Dr(kr)∣=∣ur/(ur+nr)∣P. The phase factors have modulus one; if ur=0, every shifted sinc numerator vanishes. Since ∣ur∣<1/2, ∣ur+n∣≥(1−∣ur∣)∣n∣. Summing over positive and negative n and applying [F3] gives the total bound for ar. For real J≥1 put L=⌊J⌋≥1. Since x−P decreases, n−P≤∫n−1nx−Pdx for each integer n>L. Summing and taking the limit gives ∑n>Jn−P≤∫L∞x−Pdx=L1−P/(P−1), proving the stated finite remainder, including noninteger thresholds. The tensor product has total nonzero alias mass Ak=∏r(1+ar)−1.

2.1F1F6F7step 1.1algebra

From step 1.1, WP is the convolution of P copies of 1[0,1]. Fubini [F7] factors its Fourier integral as W^P(ω)=(∫01e−iωsds)P. For ω≠0, the sine and cosine primitives from [F6] give ∫01e−iωsds=e−iω/2sinc⁡(ω/2); at ω=0 the integral is 1. Therefore W^P(ω)=e−iPω/2sinc⁡(ω/2)P and ∫WP=1. The same primitive gives ∫01e2πimvdv=1 for m=0 and 0 for nonzero integers m.

2.2F1F4step 1.1algebra

For P=2, write W2(a−ℓ)=∫01W1(a−ℓ−s)ds and interchange the nonnegative sum and integral by [F4]. Except at finitely many s for which a−s is an integer, exactly one integer ℓ has a−ℓ−s∈[0,1]; the exceptional set has integral zero, so ∑ℓ∈ZW2(a−ℓ)=1. For P>2, use WP(x)=∫01WP−1(x−s)ds and Tonelli [F4]; the inductive identity for P−1 makes the sum inside the integral equal to 1. Thus ∑ℓ∈ZWP(a−ℓ)=1 for every P≥2.

3.1F1F3F5step 2.1algebra

For one coordinate, set θ=2πk/M and H(a)=eiθa∑ℓ∈ZWP(a−ℓ)e−iθℓ. The sum is locally finite and continuous, and reindexing shows H(a+1)=H(a). Only finitely many ℓ contribute on [0,1]. Substitution s=a−ℓ and partition of R into [−ℓ,1−ℓ] give its mth Fourier coefficient as ∫RWP(s)e−i(2πm−θ)sds=W^P(2πm−θ), using step 2.1. For ∣k∣<M/2, these coefficients are O((1+∣m∣)−P), hence absolutely summable by [F3]. Their Fourier series converges uniformly by [F5] to a continuous function with the same coefficients as H.

3.2givenF1step 2.2algebra

In one coordinate, summing the periodic residue weights over ℓ=0,…,Mr−1 is the same as summing WP(Mrtr−L) over all integers L=ℓ+jMr; by step 2.2 this sum is 1. Taking the product over the three coordinates gives ∑ℓ∈Gwℓ(t)=1. Therefore ∑ℓgℓ=∑iqi∑ℓwℓ(ti)=∑iqi=0 for neutral data.

4.1step 2.1step 3.1algebra

Let h be the difference between H and the uniform Fourier sum in step 3.1. Every Fourier coefficient of h is zero. For J≥1, define KJ(v)=J−1∣∑r=0J−1e2πirv∣2. It is a finite nonnegative trigonometric polynomial with integral 1 by step 2.1; the vanishing coefficients of h therefore give KJ∗h=0. Given ε>0, uniform continuity of h gives δ∈(0,1/2) such that ∣h(a−v)−h(a)∣<ε when v is within δ of an integer. Away from those points, the geometric-sum formula gives KJ(v)≤[Jsin⁡2(πδ)]−1. Hence ∥KJ∗h−h∥∞≤ε+2∥h∥∞/(Jsin⁡2(πδ)). Letting J→∞ and then ε↓0 yields h=0. Thus the series in step 3.1 equals H.

5.1F1step 2.1step 3.1step 4.1algebra

Multiply the identity H(a)=∑mW^P(2πm−θ)e2πima established by steps 3.1 and 4.1 by e−iθa, put a=Mt, and reindex n=−m. Since WP is real, W^P(−ω)=W^P(ω)‾; step 2.1 then gives ∑ℓ∈ZWP(Mt−ℓ)e−2πikℓ/M=∑n∈ZDr(k+nM)‾e−2πi(k+nM)t. In the finite-grid periodic sum, each index ℓ+jM has the same phase as residue ℓ, since e−2πikj=1. Thus the identity holds for the periodized assignment weights.

6.1givenF2step 5.1algebra

Apply step 5.1 in each of the three coordinates and multiply the absolutely convergent series. Dividing by D(k)‾=∏rDr(kr)‾ yields bk(t)=∑n∈Z3rk,ne−2πi(k+n⊙M)⋅t. By [F2], Ngg^M(k)=∑iqi∑ℓwℓ(ti)e−2πik⋅ℓ/M. Substitute the single-particle identity, divide by D(k)‾, and interchange the absolutely convergent alias series with the finite particle sum. This gives zk=∑nrk,nρk+n⊙M with exactly the stated Ng factor and no cell-volume factor.

7.1step 6.1step 1.2algebra∎

Since ∣ak(t)∣=1, the identity for bk gives ∣bk−ak∣≤Ak and ∣bk∣≤1+Ak. Also ∣ρj∣≤∑i∣qi∣=Q for every j, so the exact identity for zk gives ∣zk−ρk∣≤QAk. These are the asserted source-assignment alias bounds.

Remarks

  • The negative-sign unitary transform produces the conjugate multiplier D(k)‾ for the causal window WP(Mt−ℓ). Dividing by D(k) would introduce a deterministic phase error.
  • Periodic wrapping accumulates all predecessor support residues, including duplicate residues when P>Mr; the proof uses that full finite sum.
  • The proof of the spline Fourier series is local and choice-free. The Countable Choice branch enters later through Gaussian Poisson summation.

Depends on

Used by

Dependency tree · two levels

50 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