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.
Semi-Lagrangian characteristic transport — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Curved geometry, mesh generation and conservative transfer
- Determinants of Matrices over a Commutative Ring
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partial Differential Equations and Characteristics
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semi-Lagrangian characteristic transport
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples separate the method's properties: a convex update remains bounded when a foot crosses several cells, time refinement on a fixed mesh can retain interpolation diffusion, pointwise interpolation can change the grid-sum mass diagnostic, and an exact overlap remap handles a smooth deforming flow with positive cell averages and conserved total mass.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A constant-speed foot can cross many cells in one stable update
Example
Take the one-dimensional torus of length , uniform cells of width , constant velocity , one step , and arrival node . The Courant displacement is , so the backtracked foot crosses more than four cells. Give the two grid nodes bracketing that foot values and .
Facts & Assumptions
Given: The grid and velocity in the Example and the explicit Euler/multilinear update of Explicit Euler characteristic backtracking with multilinear interpolation.
Periodic tensor grids and multilinear interpolation: with , a lifted query has cell index , fraction , and weights at indices modulo .
Periodic multilinear interpolation is convex and L-infinity contractive: the two weights are nonnegative and sum to one.
Proof
Since , the explicit Euler foot at is , which wraps to on the unit torus. On the lift, , so the lower index is , the upper index is , and .
The update is therefore . By [F2] this value lies in , despite the 4.8-cell displacement. The example uses no displacement CFL restriction.
Refining time alone leaves interpolation diffusion on a fixed grid
Example
Fix an integer , the unit torus, and . Let and use final time , but split it into steps of length . The smooth periodic initial function has grid samples and for . Exact transport over shifts those samples by exactly one node. The semi-Lagrangian method, however, performs fractional linear interpolations on the same fixed spatial grid.
Facts & Assumptions
Given: The unit grid, constant velocity, smooth initial function, and update rule in the Example.
Explicit Euler characteristic backtracking with multilinear interpolation: for a positive constant velocity and a one-cell-or-smaller backward displacement , the update is .
For every real , : for real , as integers .
Proof
Each denominator in is nonzero because , each factor is smooth and -periodic, and at node every factor equals . At node with , the factor with vanishes. Thus the grid samples are exactly the stated unit vector. The exact characteristic is , so at the exact grid vector has value at node and at node .
For , put . Repeated application of [F1] is convolution with the two coefficients ; induction using Pascal's identity shows that after steps the contribution from exactly two one-node shifts at node is . Periodic wrap can add other nonnegative contributions, so .
Since and by [F2], we have , whereas the exact value at node is zero. Thus reducing at fixed does not remove this interpolation error. The sufficient condition in the global error theorem cannot be dropped from that bound: here .
Remarks
This is a fixed-grid time-refinement example, not a failure of convergence under simultaneous refinement. It exhibits the per-step interpolation effect that the term controls in Periodic semi-Lagrangian error is controlled by local foot and interpolation defects.
Variable-foot pointwise interpolation can change the grid sum
Example
Use the period- one-dimensional grid with nodes , , and one time step . Set This is a smooth periodic velocity. Start with grid values , which are samples of the smooth nonnegative period- function
Facts & Assumptions
Given: The grid, time step, velocity, data, and explicit Euler/multilinear update in the Example.
Periodic tensor grids and multilinear interpolation: a foot at fraction between consecutive nodes has weights , with node indices wrapped modulo .
Explicit Euler characteristic backtracking with multilinear interpolation: at arrival node the lifted foot is and the new value is the previous grid data interpolated there.
Proof
The squared-sine factors are smooth and period ; the value is zero at nodes and and equals at node . Direct substitution into gives . Therefore the three lifted feet are . Their interpolation rows, in node order , are , , and .
Applying those rows to gives the new grid values . The grid sum changes from to . This is a pointwise interpolation update, so the grid sum is a diagnostic only; the result shows why pointwise interpolation is not itself a conservative remap.
A smooth deforming flow remaps two cell averages conservatively
Example
Assume Countable Choice. On the unit torus take the smooth autonomous velocity and any fixed time . Its exact flow is an orientation-preserving diffeomorphism. Use source and arrival cells and in a fundamental interval, with initial cell averages . The flow fixes and ; on it moves points strictly to the right. Define .
Facts & Assumptions
Given: Countable Choice, the velocity, flow, two-cell partition, initial averages, and remapping formula of Characteristic-cell overlap remapping for a conservative density.
The Axiom of Countable Choice (): countable choice is assumed in the Lebesgue-measurable-volume definition of the remap.
A periodic C1 velocity has a global characteristic flow on a finite horizon: the smooth periodic velocity has a unique global flow, and constant solutions at zeros of remain fixed.
A periodic C1 characteristic map is an orientation-preserving diffeomorphism: is an increasing diffeomorphism of the periodic lift and has an increasing inverse.
Characteristic departure cells are measurable and have positive finite volume: under Countable Choice, the departure cells and their Lebesgue volumes are well defined and positive.
Proof
Since on , the forward trajectory from strictly increases and cannot reach the equilibrium at finite time by uniqueness in [F1]. Thus , while and . Monotonicity in [F2] gives . With representatives in the open fundamental interval , and , so , , and the nonzero overlaps with the occupied source cell are and .
Formula [F3] gives and . Since and , the arrival averages are and . Their total mass is , equal to the initial mass .
Sources
- European Centre for Medium-Range Weather Forecasts, Numerical Methods, Meteorological Training Course Lecture Series, 2002
- Lukas Einkemmer and Alexander Ostermann, On the error propagation of semi-Lagrange and Fourier methods for advection problems, Computers & Mathematics with Applications 69 (2015), 170–179