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

Partition and quadrature bounds for a periodic PIC shape

Statement

Let d,L,N,h,ηε,Zε,h, and wjε,h have the meanings in Periodic uniform PIC grid and inner product and Periodic PIC deposition shape and gather operators. For a finite signed Borel measure μ on the torus, write ∥μ∥TV=∣μ∣(TLd) and define (Phεμ)j=h−d∫TLdwjε,h(x) dμ(x). Put Cη=Ld12∑a=1d∥∂aaηε∥∞,Zmin⁡=Ldmin⁡x∈TLdηε(x)>0. Then ∑jwjε,h(x)=1 for every x, and Zε,h(x)≥Zmin⁡. The measure assignment satisfies ∣(Phεμ)j−(ηε∗μ)(xj)∣≤Cη∥ηε∥∞Zmin⁡∥μ∥TVh2. For g∈C2(TLd;Rm) with finite m≥1 (including scalar m=1), use the Euclidean norm ∣⋅∣2 and ∥g∥∞=sup⁡y∣g(y)∣2. Define the translation-uniform constant Cη,g=Ld12∑a=1dsup⁡x,y∈TLd∣∂yaya[ηε(y−x)g(y)]∣2. The gathered nodal samples satisfy the explicit bound ∣∑jwjε,h(x)g(xj)−(ηε∗g)(x)∣≤Cη,g+Cη∥g∥∞Zmin⁡h2(x∈TLd).

Facts & Assumptions

Given: The periodic grid and pairing, the strictly positive normalized smooth kernel, its sampled normalizer, and the weights defined in Periodic uniform PIC grid and inner product and Periodic PIC deposition shape and gather operators.

[F1]

Periodic uniform PIC grid and inner product: h=L/N, the grid is the uniform periodic tensor grid, and hd∑j is its volume-weighted sum.

[F2]

Periodic PIC deposition shape and gather operators: Zε,h(x)=hd∑jηε(xj−x) and wjε,h(x)=hdηε(xj−x)/Zε,h(x).

[F3]

Composite periodic trapezoidal error in a uniform tensor grid: for f∈C2(TLd), the uniform periodic tensor-grid trapezoid error is at most (Ldh2/12)∑a∥∂aaf∥∞.

Proof

1.1F1F2algebra

Strict positivity of ηε implies Zε,h(x)>0. Summing the weights in [F2] gives ∑jwjε,h(x)=Zε,h(x)/Zε,h(x)=1, and each weight is nonnegative. Since every summand in Z is at least hdmin⁡ηε, and hd∣JN∣=Ld, Zε,h(x)≥Zmin⁡.

1.2F1F3F4algebra

For fixed x, put fx(y)=ηε(y−x)g(y) and let qx=hd∑jfx(xj)−∫fx(y) dy∈Rm. For every Euclidean unit vector v, apply the scalar estimate [F3] to v⋅fx. Since ∣v⋅∂aafx∣≤∣∂aafx∣2, this gives ∣v⋅qx∣≤Cη,gh2. If qx≠0, take v=qx/∣qx∣2; if qx=0 the bound is immediate. Thus ∣qx∣2≤Cη,gh2, with no dimension factor. The integral is (ηε∗g)(x) because the kernel is even. Projecting that integral onto its unit direction in the same way, nonnegativity and the unit integral [F4] give ∣(ηε∗g)(x)∣2≤∥g∥∞. The defining supremum is over both x and y: translation of the kernel alone does not translate g.

2.1F1F2F3F4step 1.1algebra

Apply [F3] to y↦ηε(y−x); translation does not change its second-derivative suprema and its integral is 1 by [F4]. Thus ∣Zε,h(x)−1∣≤Cηh2. By [F2], (Phεμ)j=∫TLdηε(xj−x)Zε,h(x) dμ(x). Subtract (ηε∗μ)(xj), factor ηε(xj−x), and use ∣Z−1−1∣=∣Z−1∣/Z≤Cηh2/Zmin⁡. Integrating against the total variation measure gives the first bound.

3.1F2step 1.1step 1.2algebra∎

The gathered sum in the Statement is hd∑jfx(xj)/Zε,h(x) by [F2]. Subtract the integral, use the quadrature error from step 1.2 divided by Z≥Zmin⁡, and bound the Euclidean norm of the normalization correction by ∣Z−1−1∣∥g∥∞≤Cηh2∥g∥∞/Zmin⁡. This is the second bound.

Remarks

The shifted-product constant is finite and can be bounded entirely by separate derivative suprema: Cη,g≤Ld12∑a=1d(∥∂aaηε∥∞∥g∥∞+2∥∂aηε∥∞∥∂ag∥∞+∥ηε∥∞∥∂aag∥∞). This follows by differentiating the product twice and using the Euclidean triangle inequality. The unshifted product ηε(y)g(y) alone does not supply a uniform bound for all gather locations x.

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