Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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 Poisson residual controls the gathered particle force

Statement

Let s be a zero-mean grid source and let ϕ be the zero-mean solution of Ahϕ=s. Let ϕ~ be any approximate grid potential, and set r=s−Ahϕ~; then rˉ=0. Define γN,L=max⁡k∈KNk≠0(∑a=1dh−2sin⁡2(2πka/N))1/24h−2∑a=1dsin⁡2(πka/N). For the centered field operator D0=(Da0)a=1d, ∥D0(ϕ−ϕ~)∥h≤γN,L∥r∥h,γN,L≤h2sin⁡(π/N)≤L4. For any particle location xp and charge-to-mass ratio qp/mp with mp>0, the force gather using the weights of Periodic PIC deposition shape and gather operators obeys ∣qpmpGxp ⁣(−D0ϕ+D0ϕ~)∣≤∣qp∣mph−d/2γN,L∥r∥h. Thus the norm in the force certificate is the actual finite-grid inverse/derivative norm; the explicit h−d/2 conversion is retained when passing from grid L2 to a particle gather.

Facts & Assumptions

Given: An odd periodic grid, its centered Poisson operator and field differences, a compatible source, an approximate potential, and nonnegative normalized shape weights.

[F1]

Periodic uniform PIC grid and inner product: Ah is the centered periodic stencil and Da0 is its centered field difference.

[F2]

Periodic centered-difference Poisson solvability and zero-mean gauge: Ah has kernel the constants and range the zero-mean arrays; the Fourier characters form a basis, and on mode k≠0, Ah has eigenvalue λh(k)=4h−2∑asin⁡2(πka/N)>0. The symbol of Da0 is derived from its stencil in [F1].

[F3]

Periodic PIC deposition shape and gather operators: GxpE=∑jwj(xp)Ej with nonnegative weights of total one.

[F4]

The periodic Poisson mean-zero pseudoinverse is linear and self-adjoint: for zero-mean r, Ah†r is the unique mean-zero solution.

Proof

1.1F1F2F4givenalgebra

Let δϕ=ϕ−ϕ~. Since Ahϕ=s, Ahδϕ=r. The range statement in [F2] gives Ahϕ~‾=0, so rˉ=sˉ−Ahϕ~‾=0. By [F4], Ah†r is the mean-zero solution of Ahu=r; hence δϕ−Ah†r lies in ker⁡Ah and is constant by [F2]. Expand r in the finite orthogonal Fourier-character basis from [F2]. On each nonzero mode, Ah†r has coefficient r^k/λh(k) by [F2], while the possible constant difference is annihilated by D0.

2.1F1F2F4step 1.1algebra

For a Fourier character ek, direct substitution into the centered difference from [F1] gives (Da0ek)j=ek(j+ea)−ek(j−ea)2h=e2πika/N−e−2πika/N2hek(j)=isin⁡(2πka/N)hek(j). By [F2], Ah has eigenvalue λh(k)>0 on every nonzero mode, so [F4] implies that Ah†r has coefficient r^k/λh(k) there. Thus the vector multiplier of D0Ah† has Euclidean modulus (∑ah−2sin⁡2(2πka/N))1/2/λh(k). Parseval's identity for this finite orthogonal basis therefore gives the first bound with the displayed maximum γN,L.

3.1F2step 2.1algebra

Put S=∑asin⁡2(πka/N). For k≠0, some coordinate satisfies 1≤∣ka∣≤(N−1)/2 because N is odd and k∈KN. Hence π/N≤π∣ka∣/N<π/2; monotonicity of sine on [0,π/2] gives S≥sin⁡2(π/N)>0. Since ∣sin⁡(2θ)∣≤2∣sin⁡θ∣, the numerator in the definition of γ is at most 2h−1S, while its denominator is 4h−2S. Their ratio is at most h/(2S)≤h/(2sin⁡(π/N)). For N≥3, π/N≤π/2 and concavity of sine gives sin⁡(π/N)≥2/N, so this is at most hN/4=L/4.

4.1F3step 2.1step 3.1algebra∎

Cauchy–Schwarz gives ∣GxpE∣≤(∑jwj(xp)2)1/2(∑j∣Ej∣2)1/2. Nonnegativity and ∑jwj=1 imply ∑jwj2≤1, while ∑j∣Ej∣2=h−d∥E∥h2. Apply this to E=D0(ϕ−ϕ~) and use steps 2.1–3.1. Multiplying by ∣qp∣/mp gives the gathered-force estimate.

Depends on

Used by

Dependency tree · one level

4 results within one dependency step 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