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.
Fixed-regularization periodic PIC kernels are globally Lipschitz
Statement
For fixed , odd grid size , and as in Fixed-regularization periodic PIC pair kernel, define and . These are finite mesh- and regularization-dependent constants. The phase kernel is globally Lipschitz in the two-variable convention The continuum kernel is also globally Lipschitz with the explicit admissible constant
Facts & Assumptions
Given: The fixed periodic grid, smooth normalized weights, the finite grid Poisson inverse, the continuum regularized Fourier kernel, and the phase-state definition.
Fixed-regularization periodic PIC pair kernel: is a finite weighted sum of entries of the fixed matrix ; is the displayed absolutely convergent Fourier series.
Smooth periodic PIC assignment weights have bounded derivatives: every fixed-grid weight is with all derivatives bounded on the compact torus.
The periodic Poisson mean-zero pseudoinverse is linear and self-adjoint: is linear on grid sources, so the pair field is a finite sum of products of its source and gather weights with fixed entries of .
Proof
By [F2], each grid weight is smooth and has bounded derivatives of every finite order. By [F1], is a finite sum of products of such weights and fixed matrix entries, so it is and all its derivatives are bounded. In particular, both derivative suprema are finite. More explicitly, if are the vector entries of and , then which are finite explicit bounds for the defining suprema.
Any finite-order derivative of the continuum series multiplies each coefficient by finitely many components of . The coefficient already has one factor ; after additional derivatives, its magnitude is bounded by a constant times . These bounds are summable because each one-dimensional geometric series with a polynomial factor converges. Thus every differentiated series converges uniformly, and all derivatives are bounded. In particular, for a first derivative the factor cancels the denominator , so its norm is bounded by the displayed sum times . Periodicity permits the same bounds on Euclidean lifts.
First change while holding fixed. The output difference has components . Its squared Euclidean norm is at most , hence its norm is at most . Next change while holding fixed; this changes only the field component, by at most . Adding these bounds gives the stated two-variable estimate with . The same block-norm calculation using the continuum derivative bounds from step 1.2 gives the estimate with .
Depends on
Used by
Dependency tree · two levels
8 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
- François Golse, Mean-Field Limits in Statistical Dynamics, Lecture 1 (standard reference, not scraped)
- Simon Mayer, The Vlasov Equation and Mean Field Limit of a Particle System (standard reference, not scraped)