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.
Uniform periodic, infinite, and Dirichlet grid conventions
Definition
Use for the natural-number index set (including zero) (The natural numbers (von Neumann)), for the real scalar field (The real numbers), and with its real embedding and modulus (The complex numbers as , with the real embedding and imaginary unit , Real and imaginary parts, complex conjugation, and modulus).
Let , , , and . For the finite periodic grid put and reduce every shifted index modulo . A periodic grid function is a map , with weighted norm The infinite uniform grid has indices and positions . On the periodic and infinite grids define Use the inner product linear in its first entry, where the indices in are reduced periodically, and set . The same definitions apply to real-valued grid functions.
For a finite interval of length , use physical nodes with indices . On its edges define , and on interior nodes use . At the right endpoint define . For interior-node arrays indexed by and edge arrays indexed by , define Set . For nodal grid functions, interior pairings and norms mean restriction to the interior nodes. Thus is a norm on the zero-endpoint subspace, but only a seminorm on the full nodal space. Dirichlet grid functions have prescribed endpoint values; when they are zero, the interior norm and edge inner product above are the ones used for the wave energy.
All statements below distinguish these periodic, infinite, and finite-interval index sets. Periodic Fourier calculations are not boundary estimates for the finite-interval grid.
Depends on
Used by
- Finite-volume upwind scheme for age renewal transport Algorithm
- Centered leapfrog wave recurrence with Dirichlet and periodic rows Definition
- Periodic advection schemes and the finite-interval upwind row Definition
- The Nyquist mode at and beyond the leapfrog CFL endpoint Example
- A finite-grid Poincare inequality for zero endpoint values Lemma
- Amplification symbols for periodic scalar advection stencils Lemma
- One-dimensional discrete summation by parts with boundary terms Lemma
- Periodic leapfrog amplification, finite-time bounds, and the Nyquist endpoint Theorem
- The nearest-neighbor CFL condition is necessary but not sufficient Theorem
Dependency tree · two levels
17 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
- Endre Süli, B6.1 Numerical Solution of Partial Differential Equations (standard reference, not scraped)
- Benjamin Seibold, MIT 18.336 Lecture 15, Finite Difference Methods for the One-Way Wave Equation (standard reference, not scraped)