Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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 2d corner data. Consequently nonnegative data remain nonnegative, the interpolant lies between the minimum and maximum corner values, and for any node arrays V,W, ∥IhV−IhW∥L∞(Tℓd)≤∥V−W∥ℓ∞. These conclusions hold at every foot, with no displacement-to-cell-size restriction.

Facts & Assumptions

Given: The periodic grid, a lifted query point x, and finite real node arrays V,W.

[F1]

Periodic tensor grids and multilinear interpolation: the coordinate fractions satisfy 0≤θj<1 and the corner weights are wϵ=∏jθjϵj(1−θj)1−ϵj, with wrapped node indices.

Proof

1.1givenF1algebra

Each factor θj and 1−θj is nonnegative, so every wϵ(x)≥0. Summing over all binary vectors factorizes as ∑ϵwϵ(x)=∏j=1d((1−θj)+θj)=1. Thus IhV(x) is a convex combination of its corner data, even when wrapping makes two corner indices coincide.

2.1step 1.1givenalgebra

If Vi≥0 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.

3.1givenF1step 1.1algebra∎

At each x, [F1] and the triangle inequality give ∣IhV(x)−IhW(x)∣≤∑ϵwϵ(x)∣Vi(ϵ)−Wi(ϵ)∣≤∥V−W∥ℓ∞∑ϵwϵ(x)=∥V−W∥ℓ∞. Taking the supremum over x proves the stated contraction; no estimate in this argument uses the displacement size.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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