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.
A high Fourier mode aliases to a different periodic PIC grid force
Statement
On , take the smooth source and solve with zero mean. Its exact electric field is . On the five-node Fourier-collocation grid , the sampled source is exactly . The mean-zero collocation solution is , and the computed field is . At every grid node, . This is a spectral-sampling aliasing example; it is not the centered finite-difference operator defined on the main PIC page.
Facts & Assumptions
Given: The period , the mode , and the five-node periodic Fourier-collocation convention.
Periodic Fourier collocation grid and even-grid Nyquist convention: the nodes are and the odd- interpolant contains modes .
Periodic Fourier modes alias modulo the grid size: if , then at every node.
Periodic Fourier collocation differentiation matrix and Periodic Fourier collocation differentiates its interpolant exactly: the differentiation matrix differentiates the unique trigonometric interpolant exactly at its nodes.
Proof
Since , [F2] gives for each . Taking real parts yields , whose unique odd-grid interpolant is by [F1]. On the five-mode space , the collocation operator multiplies mode by , so its only zero mode is the constant. Therefore is the unique zero-mean collocation solution to these sampled data.
Direct differentiation gives and . Since , exact collocation differentiation [F3], applied twice to its interpolant, gives computed field . At each node, , so .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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
- Jie Shen and Tao Tang, Spectral and High-Order Methods with Applications, Chapter 2 (standard reference, not scraped)