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 and periodic grid, the smooth-branch weights of Periodic PIC deposition shape and gather operators are on . For every multi-index , . They are nonnegative and sum to one at every point.
Facts & Assumptions
Given: The explicit smooth periodic kernel , its sampled normalizer , and the displayed weights.
Periodic PIC deposition shape and gather operators: and , where .
Periodic PIC regularization gives a smooth compatible Poisson solution: is strictly positive and on the compact torus.
Proof
By [F2], each numerator in [F1] is a smooth periodic function. The finite sum defining is smooth and strictly positive; compactness gives a positive minimum. The reciprocal of a positive smooth function is smooth, so every ratio is . Each derivative is continuous on the compact torus and hence bounded; there are finitely many indices , so their maximum is finite.
Each weight is nonnegative by [F1] and positivity of . Summing [F1] over gives .
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
- R. W. Hockney and J. W. Eastwood, Computer Simulation Using Particles, Sections 2-2-3 and 5-2 (standard reference, not scraped)