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.

Smooth periodic PIC assignment weights have bounded derivatives

Statement

For fixed ε>0 and periodic grid, the smooth-branch weights wjε,h of Periodic PIC deposition shape and gather operators are C∞ on TLd. For every multi-index β, max⁡j∥∂βwjε,h∥∞<∞. They are nonnegative and sum to one at every point.

Facts & Assumptions

Given: The explicit smooth periodic kernel ηε, its sampled normalizer Zε,h, and the displayed weights.

[F1]

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

[F2]

Periodic PIC regularization gives a smooth compatible Poisson solution: ηε is strictly positive and C∞ on the compact torus.

Proof

1.1F1F2algebra

By [F2], each numerator in [F1] is a smooth periodic function. The finite sum defining Zε,h is smooth and strictly positive; compactness gives a positive minimum. The reciprocal of a positive smooth function is smooth, so every ratio wjε,h is C∞. Each derivative is continuous on the compact torus and hence bounded; there are finitely many indices j, so their maximum is finite.

2.1F1step 1.1algebra∎

Each weight is nonnegative by [F1] and positivity of ηε. Summing [F1] over j gives ∑jwjε,h(x)=Zε,h(x)/Zε,h(x)=1.

Depends on

Used by

Dependency tree · two levels

3 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