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.

Fixed-regularization periodic PIC kernels are globally Lipschitz

Statement

For fixed ε>0, odd grid size N, and Q,M as in Fixed-regularization periodic PIC pair kernel, define Mxε,h=sup⁡x,y∈TLd∥Dx(cQEε,h)(x,y)∥op,Myε,h=sup⁡x,y∈TLd∥Dy(cQEε,h)(x,y)∥op and Lε,h=max⁡{1,Mxε,h,Myε,h}. These are finite mesh- and regularization-dependent constants. The phase kernel Kε,h is globally Lipschitz in the two-variable convention ∣Kε,h(z,z′)−Kε,h(z~,z~′)∣≤Lε,h(∣z−z~∣+∣z′−z~′∣). The continuum kernel Kε is also globally Lipschitz with the explicit admissible constant Lε=max⁡{1,∣cQ∣Ld∑k∈Zd∖{0}∏a=1dαε2∣ka∣}.

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.

[F1]

Fixed-regularization periodic PIC pair kernel: Eε,h(x,y) is a finite weighted sum of entries of the fixed matrix −D0Ah†; Eε is the displayed absolutely convergent Fourier series.

[F2]

Smooth periodic PIC assignment weights have bounded derivatives: every fixed-grid weight is C∞ with all derivatives bounded on the compact torus.

[F3]

The periodic Poisson mean-zero pseudoinverse is linear and self-adjoint: Ah† 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 −D0Ah†.

Proof

1.1F1F2F3givenalgebra

By [F2], each grid weight is smooth and has bounded derivatives of every finite order. By [F1], Eε,h is a finite sum of products of such weights and fixed matrix entries, so it is C∞ and all its derivatives are bounded. In particular, both derivative suprema Mxε,h,Myε,h are finite. More explicitly, if Bjk are the vector entries of −D0Ah† and Cw=max⁡j∥∇wj∥∞, then Mxε,h≤∣cQ∣h−dCw∑j,k∣Bjk∣∥wk∥∞,Myε,h≤∣cQ∣h−dCw∑j,k∣Bjk∣∥wj∥∞, which are finite explicit bounds for the defining suprema.

1.2F1algebra

Any finite-order derivative of the continuum series multiplies each coefficient by finitely many components of κk. The coefficient already has one factor ∣κk∣−1; after r additional derivatives, its magnitude is bounded by a constant times (1+∣k∣)r∏aαε2∣ka∣. 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 ∣κk∣ cancels the denominator ∣κk∣2, so its norm is bounded by the displayed sum times ∣cQ∣/Ld. Periodicity permits the same bounds on Euclidean lifts.

2.1givenstep 1.1step 1.2algebra∎

First change z=(x,v) while holding z′=(y,w) fixed. The output difference has components (v−v~,cQ(Eε,h(x,y)−Eε,h(x~,y))). Its squared Euclidean norm is at most ∣v−v~∣2+(Mxε,h)2∣x−x~∣2, hence its norm is at most max⁡{1,Mxε,h}∣z−z~∣. Next change z′ while holding z~ fixed; this changes only the field component, by at most Myε,h∣z′−z~′∣. Adding these bounds gives the stated two-variable estimate with Lε,h. The same block-norm calculation using the continuum derivative bounds from step 1.2 gives the estimate with Lε.

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