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
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Adaptive ODE solvers and error estimation
- Areas of Elementary Plane Figures
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Curved geometry, mesh generation and conservative transfer
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Event location and hybrid trajectory error
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- 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
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Partial Differential Equations and Characteristics
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial interpolation and remainder
- 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
- Runge–Kutta Methods and Order
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- 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 Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- 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
This page develops periodic semi-Lagrangian transport for the scalar equation . Its concrete scheme uses explicit Euler backtracking and tensor-product multilinear interpolation. Convex interpolation weights give sup-norm stability for arbitrary foot displacement, while the proved local foot and interpolation defects yield a separate finite-time error bound. The bound requires both time and spatial refinement; the lack of an advective CFL condition does not remove the sufficient consistency condition .
The conservative density branch uses characteristic departure cells, exact overlap volumes, and the flow volume factor. This Lebesgue-volume branch assumes Countable Choice and uses finite measurable source and target partitions with positive cell volumes. Pointwise interpolation and overlap remapping are separate schemes, and the former is not asserted to conserve mass. The event item records the local error for a transverse first-hit boundary bracket only; this page makes no full global error claim for a nonperiodic boundary branch. Higher-order interpolation needs its own actual operator bound and defect estimate.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Periodic tensor grids and multilinear interpolation
Definition
Let , let , and let be integers. The periodic rectangular box is Set . Its uniform tensor grid has nodes , indexed by , with indices understood modulo .
For node data and a lift of a point on the torus, define and for define The tensor-product multilinear interpolant is where is the residue in . The formula is unchanged when a period is added to , so it defines an interpolant on . If , the two corner indices in that coordinate coincide; the formula still gives the same node value.
For a continuous periodic function , means the interpolant of its grid samples. Put .
Convention diagram
The picture shows one lifted coordinate cell. The weights are at the left endpoint and at the right endpoint; periodic wrapping only changes the node indices.
The diagram fixes the coordinate and weight convention only. The multidimensional interpolant is the product of the coordinate weights in the displayed formula.
A periodic C1 velocity has a global characteristic flow on a finite horizon
Statement
Let , , , and let be an open interval containing . Suppose is and periodic in with period for every . Choose a compact interval with , and put . For every and , there is a unique solution of on the whole interval . The lifted flow is periodic-equivariant: where . If , then Thus each characteristic stays in a compact tube .
Facts & Assumptions
Given: as in the Statement.
Linear transport equations and their characteristic flow: a characteristic solves ; a single-valued flow requires existence and uniqueness for each initial value.
Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous vector field locally Lipschitz in the state has a unique local solution; on a compact cylinder with field bound and state Lipschitz constant , it applies on a symmetric interval of radius when and for the cylinder state radius .
A first-order initial value problem is equivalent to its Volterra integral equation: a solution satisfies with the oriented integral.
For and integrable when , ; for , is integrable: for integrable vector-valued and ordered endpoints ; a reversed oriented integral is first negated and rewritten with ordered endpoints.
On a convex open set, a uniform bound implies : on a convex open set, a uniform derivative bound gives the corresponding -Lipschitz bound.
Proof
Periodicity and continuity on the compact cylinder give finite bounds and there. The same bounds hold on all spatial translates. By [F5] each time slice is globally -Lipschitz in . Since , choose small enough that every radius- time interval centered in lies in , , and . On each corresponding unit-radius state cylinder, [F2] therefore gives a unique local solution through its center.
Partition the finite interval between and any into finitely many subintervals of length at most . Apply [F2] successively at each endpoint, using the preceding endpoint value as the next initial state. The resulting curves agree on their shared endpoints and have the same derivative there, so they concatenate to a solution on . Repeated local uniqueness from [F2] proves uniqueness on the concatenated interval. This is a finite construction and selects no family of local solutions over an infinite index set.
For the constructed solution on , [F3] and [F4] give . Thus its graph lies in the stated compact tube. For a period vector , the curve solves the same IVP as by periodicity of ; uniqueness gives periodic equivariance.
A transverse backward boundary hit has a certified time and trace error bound
Statement
Let be a compact bracket, let be an exact incoming characteristic on , and let be a boundary guard that is -Lipschitz in its state argument on a tube containing the exact path and a dense reconstruction . Suppose has a root and a declared orientation with throughout . If then the matched first-hit time satisfies If the boundary value is Lipschitz in time and state with constants on the same tube and , then This is a local one-hit bound. It gives no conclusion at grazing, unresolved, or simultaneous events.
Facts & Assumptions
Given: A smooth mode characteristic, a boundary guard and orientation, a matched transverse first-hit bracket, a dense-output error bound, a reported guard residual, and the stated boundary-data Lipschitz bounds.
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a smooth mode follows its ODE until a selected guard event; the event orientation is part of the guard data.
The derivative of a guard along an ODE mode is its Lie derivative: along , the guard derivative is .
A transverse hybrid event time is stable under dense-output and root error: dense state error , guard residual , guard state-Lipschitz constant , and transverse margin imply on the matched bracket.
A first-order initial value problem is equivalent to its Volterra integral equation: a mode trajectory increment equals the oriented integral of its vector field.
For and integrable when , ; for , is integrable: for ordered endpoints , ; reversed oriented integrals must first be rewritten with ordered endpoints.
Proof
If , then , so the time error is zero and hence at most . The stated bounds give ; the state-Lipschitz bound for gives . Here from the error and residual bounds, , and the nonnegative Lipschitz constant , while . Assume below.
By [F2], the transversality hypothesis is the mode derivative condition required by [F3]. Apply [F3] to this matched bracket with the stated ; it yields the unique transverse root and the displayed bound .
By [F4], the increment is the oriented integral from to . Set and ; changing orientation only negates the vector integral, so [F5] gives . The triangle inequality with the dense-output bound gives . Apply the time and state Lipschitz inequalities for to obtain the second displayed bound.
Remarks
An inflow/exit implementation must use a certified first-hit bracket and return unresolved when the bracket or orientation is not certified. This local result does not propagate errors through resets or an event list; those require the full finite-separated-event hypotheses of Finite separated transverse events give an event-aligned hybrid trajectory error bound.
Explicit Euler characteristic backtracking with multilinear interpolation
Definition
Inputs are a periodic grid from Periodic tensor grids and multilinear interpolation, a finite horizon , a positive integer of time steps, a periodic velocity , periodic initial data , node values , and a nonnegative integer step budget . Write and . The output is either success with , or budget-exhausted with no partial final state.
- If , return
budget-exhaustedbefore changing the input data. - For and each arrival node , compute the explicit backward Euler foot lift Reduce each coordinate modulo its period when evaluating the periodic interpolant.
- Set
- After the finite updates, return
successwith all node arrays.
The finite step budget counts time updates. Every update evaluates one foot per grid node and a finite sum of interpolation terms. The procedure imposes no bound on ; the floor-and-fraction convention in the interpolation definition applies even when a foot crosses many grid cells.
Remarks
This algorithm is the periodic-box branch. It does not wrap a foot through a nonperiodic boundary. An inflow/exit implementation must instead use an explicit first-hit oracle and return an unresolved status when the first hit or its error certificate is not resolved; A transverse backward boundary hit has a certified time and trace error bound records the transverse error interface. No grazing, simultaneous, or unbounded event sequence is hidden in the periodic update.
The algorithm defines tensor-product multilinear interpolation only. A higher-order replacement needs its own operator-norm or limiter bound and its own interpolation defect estimate; high order alone does not imply contractivity.
Periodic multilinear interpolation is convex and L-infinity contractive
Statement
For the periodic tensor interpolant of Periodic tensor grids and multilinear interpolation, every value is a convex combination of the corner data. Consequently nonnegative data remain nonnegative, the interpolant lies between the minimum and maximum corner values, and for any node arrays , These conclusions hold at every foot, with no displacement-to-cell-size restriction.
Facts & Assumptions
Given: The periodic grid, a lifted query point , and finite real node arrays .
Periodic tensor grids and multilinear interpolation: the coordinate fractions satisfy and the corner weights are , with wrapped node indices.
Proof
Each factor and is nonnegative, so every . Summing over all binary vectors factorizes as . Thus is a convex combination of its corner data, even when wrapping makes two corner indices coincide.
If at every node, each summand in the interpolant is nonnegative, so its value is nonnegative; the same convex-combination identity bounds it by the minimum and maximum corner data.
At each , [F1] and the triangle inequality give . Taking the supremum over proves the stated contraction; no estimate in this argument uses the displacement size.
A periodic C1 characteristic map is an orientation-preserving diffeomorphism
Statement
Under the hypotheses of A periodic C1 velocity has a global characteristic flow on a finite horizon, fix and let on the periodic lift . Then is a diffeomorphism with inverse , and
Facts & Assumptions
Given: The periodic flow from time to time on .
A periodic C1 velocity has a global characteristic flow on a finite horizon: the lifted characteristic exists uniquely over for every initial point.
Transport characteristics depend C^1 on the initial position: for a field, the flow depends on its initial position over a common compact time interval.
The chain rule for total derivatives: : derivatives of a composition multiply in the order .
A finite square real matrix is invertible if and only if its determinant is nonzero: a finite square real matrix is invertible exactly when its determinant is nonzero.
For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries: for fixed finite dimension, determinant is a polynomial and hence a continuous function of the matrix entries.
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real function on an interval cannot pass from a positive value to a negative value without taking zero.
Proof
By [F1], both the forward flow and the reverse-time flow are defined. Uniqueness of the ODE implies that following the same characteristic first from to and then backward to returns the initial point; likewise in the opposite order. Thus and . By [F2] both maps are , so is a diffeomorphism.
Applying [F3] to gives . Hence is invertible, and [F4] gives .
For fixed , the function is continuous by [F2] and [F5], and equals at . It never vanishes by step 2.1. If it were negative at some , [F6] on the interval between and would force a zero, a contradiction. Therefore it is positive at every , including the chosen .
Tensor multilinear interpolation has a second-derivative error bound
Statement
Let and let be the coordinate mesh widths in Periodic tensor grids and multilinear interpolation. Then The estimate includes grid nodes and periodic cell endpoints.
Facts & Assumptions
Given: A periodic function , positive coordinate widths , and the tensor-product interpolant.
Periodic tensor grids and multilinear interpolation: the tensor interpolant is the product of the one-dimensional linear endpoint weights in each coordinate.
Pointwise Lagrange interpolation remainder: for two distinct interpolation nodes , the degree-one interpolant to a function satisfies at a node and otherwise for some between the nodes and query point.
Periodic multilinear interpolation is convex and L-infinity contractive: each one-coordinate linear interpolation operator is nonexpansive in the sup norm because its endpoint weights are nonnegative and sum to one.
Proof
Fix one coordinate interval of length and hold the other coordinates fixed. If is an endpoint, the linear interpolant is exact by [F2]. Otherwise [F2] gives . Writing , the product equals , hence the one-coordinate error is at most .
Write the tensor interpolant as , where interpolates only coordinate . The telescoping identity follows by cancellation of adjacent terms.
Apply the one-coordinate estimate of step 1.1 to each term before its preceding-coordinate operators. Every preceding product is sup-norm nonexpansive by [F3], so the norm of the th term is at most . Summing the bounds proves the result. Periodic endpoint cells use the periodic lift of , which has the same derivative suprema, and at every grid node the interpolation is exact by the definition.
Explicit Euler gives a second-order local backward-foot defect
Statement
Let be periodic in space, and set where the suprema are over one full periodic time-space cylinder. For , , and an arrival lift , let be the exact backward characteristic foot. The explicit Euler foot satisfies The estimate is local for every positive ; it requires no relation between displacement and grid width.
Facts & Assumptions
Given: The periodic field, its finite derivative bounds, a time interval , and an arrival point .
Explicit Euler characteristic backtracking with multilinear interpolation: the algorithm uses the lifted explicit backward foot .
A periodic C1 velocity has a global characteristic flow on a finite horizon: the exact characteristic exists on the whole interval, and on its periodic tube.
A first-order initial value problem is equivalent to its Volterra integral equation: the exact characteristic increment is the oriented integral of .
For and integrable when , ; for , is integrable: the norm of a vector integral is at most the integral of its norm.
Proof
By [F2] and [F3], for the backward characteristic satisfies . Applying [F4] and the velocity bound gives .
Subtracting the explicit Euler foot from the exact foot and using [F3] writes the difference as the integral from t_n to t_{n+1} of b(t_{n+1},x)-b(s,X(s)). The derivative bounds make its integrand norm at most L_x times the state difference plus L_t times (t_{n+1}-s); by step 1.1 the state difference is at most M(t_{n+1}-s). Integrating the resulting bound (L_x M+L_t)(t_{n+1}-s) gives one half (L_x M+L_t)(Delta t)^2.
Characteristic departure cells are measurable and have positive finite volume
Statement
Assume the Axiom of Countable Choice. Let be the bounded open fundamental box used for Lebesgue measure, and let be its half-open grid-indexing copy. Let be the periodic characteristic diffeomorphism of A periodic C1 characteristic map is an orientation-preserving diffeomorphism, and let be a Lebesgue-measurable arrival cell with . Then , interpreted on the torus and represented in , is Lebesgue measurable and satisfies This includes every finite tensor-grid cell with nonempty interior. The departure cells form a partition up to null sets whenever a finite family of arrival cells does; an exact torus partition pulls back to an exact torus partition.
Facts & Assumptions
Given: Countable Choice, a periodic characteristic diffeomorphism, the fundamental boxes , and measurable positive-volume arrival cells.
The Axiom of Countable Choice () is assumed for the Lebesgue-measure suppliers below; no additional choice is used.
A periodic C1 characteristic map is an orientation-preserving diffeomorphism gives the lifted flow and its inverse as diffeomorphisms; A periodic C1 velocity has a global characteristic flow on a finite horizon gives their equivariance under the period lattice.
A C^1 diffeomorphism maps Lebesgue measurable sets to Lebesgue measurable sets: under Countable Choice a diffeomorphism between open Euclidean sets maps measurable sets to measurable sets. Apply this also to translations and to .
A C^1 diffeomorphism maps Lebesgue null sets to Lebesgue null sets: under Countable Choice the same maps preserve null sets.
Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume and Finite and countable subadditivity of measures: measurable sets form a sigma-algebra, Lebesgue measure is complete, and a countable union of null sets is null.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: ; bounded boxes with a degenerate side are null. Thus the union of tile faces is null, by covering each face with countably many bounded degenerate boxes and applying [F4].
Measures are monotone: measurable inclusions preserve measure order.
Proof
Put and . By [F2] and [F4] this countable periodic lift is measurable, and is measurable by [F1] and [F2]. Hence is measurable. Equivariance makes periodic and makes the torus preimage independent of representatives.
If , [F3] and [F4] make null. Every point of outside lies in one open tile, so periodicity gives . By [F4] and [F5], is null; [F3] then makes null. This contradicts and by [F6]. Thus . Also , so [F5] and [F6] give .
Bijectivity on the torus preserves exact unions and disjointness. For a partition only up to null sets, lift its omitted set and pairwise overlaps periodically; these are null by [F3]–[F5]. Their inverse images are null by [F1] and [F3], so restricting to gives a departure partition up to null sets. Finally, a half-open tensor cell with nonempty interior is measurable with positive volume by [F5], so it is included in the result.
Characteristic-cell overlap remapping for a conservative density
Definition
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()) for this Lebesgue-measurable-volume branch. Work on the periodic box of Periodic tensor grids and multilinear interpolation. For measure calculations use the bounded open fundamental domain ; the period faces omitted from the half-open grid-indexing copy are Lebesgue-null by A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included. For a periodic measurable set , define , where is the -dimensional Lebesgue measure of Lebesgue measurable sets, the family , and the restricted set function . Let be a finite measurable source-cell partition and a finite measurable arrival-cell partition of up to null sets, with every cell of positive volume; their grid labels use the half-open convention in . Let be the exact characteristic map from time to . Its inverse images are the departure cells; Characteristic departure cells are measurable and have positive finite volume gives their measurability and positive finite volume, while A periodic C1 characteristic map is an orientation-preserving diffeomorphism gives the diffeomorphism and positive-Jacobian convention.
Given a source cell-average density on , set The first formula is the exact intersection-volume remap of Intersection-volume conservative remapping from the source partition to the departure partition. The second is the characteristic volume factor that converts the average on a departure cell into the transported mass per arrival-cell volume. All intersections and volumes are exact in this mathematical definition; a geometric approximation or quadrature rule would require a separate error term.
Remarks
The batch-63 PE17 definition is a draft carrier and its current body has been inspected. It defines the exact overlap weights and target-cell average for finite measurable partitions of a bounded finite-positive-measure domain; here take the open box , source cells , and target cells . Countable Choice is the axiom used locally for Borel-to-Lebesgue measurability and the finite-volume branch. The separate batch-63 theorem that proves conservation and positivity also assumes Countable Choice, as recorded in the dependent theorem.
Periodic semi-Lagrangian error is controlled by local foot and interpolation defects
Statement
Fix and a periodic box with grid width . Let solve the nonconservative linear transport equation with the periodic velocity and global flow of A periodic C1 velocity has a global characteristic flow on a finite horizon. Consider equal time steps and node updates where reconstructs a nodal array as a periodic function and is a computed backward foot. Suppose constants , , and are uniform over the refinement family and independent of . Assume for all node arrays, the pointwise interpolation defect at each computed foot is at most for the exact samples , and, for compatible lifts of the computed and exact feet, the foot error satisfies , for integers . If and , then, with In the contractive case , this becomes For the explicit Euler and tensor multilinear algorithm, Explicit Euler gives a second-order local backward-foot defect, Tensor multilinear interpolation has a second-derivative error bound, and Periodic multilinear interpolation is convex and L-infinity contractive give and . Thus convergence for this branch follows, for example, when , , and . No classical advective CFL restriction is used; the joint consistency refinement is still required by this bound.
Facts & Assumptions
Given: A smooth periodic transport solution, a finite time grid, a bounded-stability interpolation operator, a pointwise interpolation defect bound, a certified local backward-foot error, and initial grid error .
Linear transport equations and their characteristic flow: for , the spatial characteristic solves .
Explicit Euler characteristic backtracking with multilinear interpolation: the default update is obtained by evaluating the previous grid field at an approximate backward foot and applying periodic multilinear interpolation.
A periodic C1 velocity has a global characteristic flow on a finite horizon: the exact backward characteristic exists on the full time interval.
The chain rule for total derivatives: : differentiating gives .
Explicit Euler gives a second-order local backward-foot defect: for the default explicit Euler foot, the local error is at most .
Periodic multilinear interpolation is convex and L-infinity contractive: for the default multilinear interpolant, .
Tensor multilinear interpolation has a second-derivative error bound: for the default interpolant the pointwise defect is at most , so one may take and when .
Proof
Along the exact characteristic , [F1] gives . The chain rule [F4] therefore gives . Hence .
Add and subtract and . The operator bound gives a first difference at most ; the interpolation defect contributes at most ; and the spatial Lipschitz bound for plus the foot error contributes at most . Since , this is at most . Taking the maximum over nodes yields .
Induction on in the recurrence gives : at the sum is empty, and the recurrence multiplies the preceding finite sum by and adds its next term. Taking proves the first bound.
If , the sum in step 3.1 is , so substituting the definition of gives the second bound. The default Euler and tensor multilinear branch has the stated local constants by [F5]–[F7]. Therefore the displayed sufficient refinement conditions make both error terms and the initial error tend to zero. No step uses ; consistency follows from the two explicit defect terms rather than a classical advective CFL condition.
Remarks
For , the geometric sum in the first estimate is not uniformly bounded as grows. A high-order interpolation or limiter must therefore supply its actual operator bound and local defect before this theorem yields a stable convergence claim. This theorem is for the periodic branch; a nonperiodic boundary branch must separately account for first-hit and boundary-data error as in A transverse backward boundary hit has a certified time and trace error bound.
Characteristic-cell overlap remapping preserves mass and positivity
Statement
Assume Countable Choice and the finite measurable positive-volume partition hypotheses in Characteristic-cell overlap remapping for a conservative density. For nonnegative source averages , the characteristic-cell overlap remap satisfies for every arrival cell and In particular, it satisfies The proof applies Overlap remapping is an L2 projection, conservative and positive to the source partition and departure partition ; its stated Countable Choice assumption is included here.
Facts & Assumptions
Given: Countable Choice, finite measurable positive-volume source and arrival partitions of the periodic box, the exact characteristic flow, and nonnegative source averages.
Overlap remapping is an L2 projection, conservative and positive: under its stated Countable Choice and finite partition hypotheses, the overlap averages are nonnegative for nonnegative source values and satisfy .
The Axiom of Countable Choice (): every countable family of nonempty sets has a choice function; this axiom is assumed by the overlap theorem and by the local departure-volume lemma.
A periodic C1 characteristic map is an orientation-preserving diffeomorphism: the exact flow is a diffeomorphism on the periodic lift and hence a bijection on the torus.
Characteristic departure cells are measurable and have positive finite volume: under Countable Choice, the departure cells form a measurable partition and each has positive finite volume.
Proof
By [F3] the characteristic map is bijective on the torus, and [F4] makes the departure cells a measurable positive-volume partition. Thus the source and departure partitions meet the finite-partition hypotheses of [F2]. Applying [F2] to the source values in [F1] gives for every and the departure-mass identity . The Countable Choice assumption [A1] is exactly the axiom branch required by [F2] and [F4].
Since [F4] gives and each arrival cell has , [F1] scales the nonnegative by the positive ratio , so . Also term by term. Summing this equality and substituting the identity from step 1.1 proves the asserted total mass equality.
Remarks
The batch-63 definition and theorem bodies have been inspected. The theorem assumes Countable Choice and finite measurable partitions with positive cell volumes; the departure-volume lemma supplies measurability and positive volume for , while the periodic grid supplies those properties for . The cited PE17 carriers are drafts, and this Step 1 contract records mathematical and dependency readiness only; it does not claim independent approval.
5 · Examples, counterexamples and false statements
None yet.
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