Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

One-dimensional P1 interpolation has an L2 error bound

Statement

Let 0=x0<⋯<xN=1 be a finite interval partition with maximum cell length h, and let u∈C2([0,1]). Let Ihu be the continuous piecewise-linear interpolant with the same nodal values as u. Then ∥u−Ihu∥L2(0,1)≤h2∥u′′∥L∞(0,1).

Facts & Assumptions

Given: A finite interval partition of [0,1], its maximum cell length h, and u∈C2([0,1]).

[F1]

By the definition of Ihu in the Statement, on each interval cell it is affine and agrees with u at both endpoints.

Proof

1.1F1givenconstruct

Fix a cell K=[a,b] of length hK, and let sK=(u(b)−u(a))/hK be the slope of Ihu on K. By the fundamental theorem of calculus, sK=hK−1∫abu′(t) dt. For every x∈K, the same theorem gives ∣u′(x)−u′(t)∣≤hK∥u′′∥∞, so averaging in t yields ∣(u−Ihu)′(x)∣=∣u′(x)−sK∣≤hK∥u′′∥∞.

2.1step 1.1givenalgebra

Since (u−Ihu)(a)=0, integrating the derivative bound from step 1.1 over [a,x] gives ∣u(x)−Ihu(x)∣≤hK2∥u′′∥∞ for every x∈K. Therefore ∥u−Ihu∥L2(K)2≤hK5∥u′′∥∞2.

3.1step 2.1givenalgebra∎

The cell interiors are disjoint, their lengths sum to 1, and hK≤h, so ∑KhK5≤h4∑KhK=h4. Summing step 2.1 over the cells and taking nonnegative square roots proves the estimate.

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