Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Semi-Lagrangian characteristic transport — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A constant-speed foot can cross many cells in one stable update

Example

Take the one-dimensional torus of length 1, 16 uniform cells of width h=1/16, constant velocity b=1, one step Δt=3/10, and arrival node x0=0. The Courant displacement is bΔt/h=4.8, so the backtracked foot crosses more than four cells. Give the two grid nodes bracketing that foot values 2 and 10.

Facts & Assumptions

Given: The grid and velocity in the Example and the explicit Euler/multilinear update of Explicit Euler characteristic backtracking with multilinear interpolation.

[F1]

Periodic tensor grids and multilinear interpolation: with h=1/16, a lifted query y has cell index q=⌊y/h⌋, fraction θ=y/h−q, and weights 1−θ,θ at indices q,q+1 modulo 16.

[F2]

Periodic multilinear interpolation is convex and L-infinity contractive: the two weights are nonnegative and sum to one.

Proof

1.1givenF1algebra

Since b=1, the explicit Euler foot at x0=0 is −3/10, which wraps to 7/10 on the unit torus. On the lift, (−3/10)/h=−24/5=−5+1/5, so the lower index is −5≡11(mod16), the upper index is 12, and θ=1/5.

2.1givenF2step 1.1algebra∎

The update is therefore (1−θ)2+θ10=(4/5)2+(1/5)10=18/5. By [F2] this value lies in [2,10], despite the 4.8-cell displacement. The example uses no displacement CFL restriction.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Refining time alone leaves interpolation diffusion on a fixed grid

Example

Fix an integer N≥4, the unit torus, and h=1/N. Let b=1 and use final time T=h, but split it into K steps of length Δt=h/K. The smooth periodic initial function u0(x):=∏j=1N−1sin⁡2(π(x−j/N))sin⁡2(−πj/N) has grid samples U00=1 and Uj0=0 for 1≤j<N. Exact transport over T=h shifts those samples by exactly one node. The semi-Lagrangian method, however, performs K 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.

[F1]

Explicit Euler characteristic backtracking with multilinear interpolation: for a positive constant velocity and a one-cell-or-smaller backward displacement αh, the update is Ujn+1=(1−α)Ujn+αUj−1n.

[F2]

For every real x, (1+x/n)n→exp⁡x: for real x, (1+x/K)K→ex as integers K→∞.

Proof

1.1givenF1algebra

Each denominator in u0 is nonzero because j/N∉Z, each factor is smooth and 1-periodic, and at node x0=0 every factor equals 1. At node xm=m/N with 1≤m<N, the factor with j=m vanishes. Thus the grid samples are exactly the stated unit vector. The exact characteristic is X(t;s,x)=x+(t−s), so at T=h the exact grid vector has value 1 at node 1 and 0 at node 2.

1.2givenF1inductionalgebra

For K≥2, put α=Δt/h=1/K. Repeated application of [F1] is convolution with the two coefficients (1−1/K,1/K); induction using Pascal's identity shows that after K steps the contribution from exactly two one-node shifts at node 2 is (K2)K−2(1−1/K)K−2. Periodic wrap can add other nonnegative contributions, so U2K≥(K2)K−2(1−1/K)K−2.

2.1givenF2step 1.1step 1.2algebra∎

Since (K2)K−2→1/2 and (1−1/K)K−2=(1−1/K)K/(1−1/K)2→e−1 by [F2], we have lim inf⁡K→∞U2K≥e−1/2>0, whereas the exact value at node 2 is zero. Thus reducing Δt at fixed h does not remove this interpolation error. The sufficient condition h2/Δt→0 in the global error theorem cannot be dropped from that bound: here h2/Δt=hK→∞.

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 h2/Δt term controls in Periodic semi-Lagrangian error is controlled by local foot and interpolation defects.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Variable-foot pointwise interpolation can change the grid sum

Example

Use the period-3 one-dimensional grid with nodes 0,1,2, h=1, and one time step Δt=1. Set b(x)=512−16cos⁡ ⁣(2πx3)−123sin⁡ ⁣(2πx3). This is a smooth periodic velocity. Start with grid values (U0,U1,U2)=(0,0,1), which are samples of the smooth nonnegative period-3 function u0(x)=169sin⁡2 ⁣(πx3)sin⁡2 ⁣(π(x−1)3).

Facts & Assumptions

Given: The grid, time step, velocity, data, and explicit Euler/multilinear update in the Example.

[F1]

Periodic tensor grids and multilinear interpolation: a foot at fraction θ between consecutive nodes has weights 1−θ,θ, with node indices wrapped modulo 3.

[F2]

Explicit Euler characteristic backtracking with multilinear interpolation: at arrival node xi the lifted foot is xi−Δt b(xi) and the new value is the previous grid data interpolated there.

Proof

1.1givenF1F2algebra

The squared-sine factors are smooth and period 3; the value is zero at nodes 0 and 1 and equals 1 at node 2. Direct substitution into b gives (b(0),b(1),b(2))=(1/4,1/4,3/4). Therefore the three lifted feet are −1/4,3/4,5/4. Their interpolation rows, in node order 0,1,2, are (3/4,0,1/4), (1/4,3/4,0), and (0,3/4,1/4).

2.1givenstep 1.1algebra∎

Applying those rows to (0,0,1) gives the new grid values (1/4,0,1/4). The grid sum changes from 1 to 1/2. 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A smooth deforming flow remaps two cell averages conservatively

Example

Assume Countable Choice. On the unit torus take the smooth autonomous velocity b(x)=sin⁡(2πx) and any fixed time T>0. Its exact flow Φ=ΦT,0 is an orientation-preserving diffeomorphism. Use source and arrival cells C1=A1=[0,1/4) and C2=A2=[1/4,1) in a fundamental interval, with initial cell averages (ρ10,ρ20)=(1,0). The flow fixes 0 and 1/2; on (0,1/2) it moves points strictly to the right. Define r:=Φ−1(1/4).

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.

[A1]

The Axiom of Countable Choice (ACω): countable choice is assumed in the Lebesgue-measurable-volume definition of the remap.

[F1]

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 b remain fixed.

[F2]

A periodic C1 characteristic map is an orientation-preserving diffeomorphism: Φ is an increasing diffeomorphism of the periodic lift and has an increasing inverse.

[F3]

Characteristic-cell overlap remapping for a conservative density: Di=Φ−1(Ai), ρ‾i=∣Di∣−1∑j∣Di∩Cj∣ρj0, and ρi1=(∣Di∣/∣Ai∣)ρ‾i.

[F4]

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

1.1givenA1F1F2F4algebra

Since b(x)>0 on (0,1/2), the forward trajectory from 1/4 strictly increases and cannot reach the equilibrium 1/2 at finite time by uniqueness in [F1]. Thus Φ(1/4)>1/4, while Φ(0)=0 and Φ(1/2)=1/2. Monotonicity in [F2] gives 0<r<1/4. With representatives in the open fundamental interval (0,1), D1=(0,r) and D2=[r,1), so ∣D1∣=r, ∣D2∣=1−r, and the nonzero overlaps with the occupied source cell C1∩(0,1) are ∣D1∩C1∣=r and ∣D2∩C1∣=1/4−r.

2.1givenA1F3F4step 1.1algebra∎

Formula [F3] gives ρ‾1=1 and ρ‾2=(1/4−r)/(1−r). Since ∣A1∣=1/4 and ∣A2∣=3/4, the arrival averages are ρ11=4r>0 and ρ21=43(1/4−r)>0. Their total mass is 14ρ11+34ρ21=r+(1/4−r)=1/4, equal to the initial mass 14⋅1+34⋅0.

Sources