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

A sufficient monotonicity square for cubic Hermite interpolation

Statement

Let p be the single Hermite piece from Piecewise cubic Hermite interpolant on [x0,x1], with h=x1−x0>0, endpoint values y0,y1, slopes m0,m1, and secant d=(y1−y0)/h. If d≠0 and α=m0/d, β=m1/d both lie in [0,3], then p is monotone from y0 to y1 and stays between those values. If d=0 and m0=m1=0, then p is constant.

Facts & Assumptions

Given: One Hermite cell with h>0, endpoint values and slopes as in the statement.

[F1]

Piecewise cubic Hermite interpolant: the cell is P=y0H00(t)+y1H01(t)+hm0H10(t)+hm1H11(t) for t=(x−x0)/h.

[F2]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): continuity on a closed interval and differentiability in its interior give p(v)−p(u)=p′(c)(v−u) for some interior c whenever u<v.

[F3]

Sum, product, quotient, and chain rules from difference quotients: the integer power rule (xm)′=mxm−1 holds for m≥1.

Proof

1.1F1F3givenalgebra

For d≠0, differentiating [F1] by [F3], using y1−y0=hd and dt/dx=1/h, gives p′(x)/d=α+(6−4α−2β)t+(3α+3β−6)t2. Indeed, H01′=6t−6t2, H10′=1−4t+3t2, and H11′=−2t+3t2; substitution produces those coefficients. Direct substitution in [F1] also gives p(x0)=y0 and p(x1)=y1.

2.1step 1.1givenalgebra

For 0≤t≤1 put λ00=(1−α/3)(1−β/3), λ30=(α/3)(1−β/3), λ03=(1−α/3)(β/3), and λ33=(α/3)(β/3). These are nonnegative and sum to one. The polynomial in step 1.1 is affine in (α,β), so it equals the convex combination with these weights of its values at (0,0),(3,0),(0,3),(3,3), namely 6t(1−t), 3(1−t)2, 3t2, and 3(1−2t)2. Each of these four polynomials is nonnegative on [0,1].

3.1step 1.1step 2.1F1F2givenalgebra∎

step 2.1 gives p′(x)/d≥0 throughout the cell. If d>0, p′≥0; if d<0, p′≤0. For any two points u<v in the cell, [F2] transfers that derivative sign to p(v)−p(u), so p is monotone; step 1.1 gives its endpoint values y0,y1, so every value lies between them. If d=0, then y1=y0 and [F1] reduces to p=y0(H00+H01)=y0, since m0=m1=0 and H00+H01=1.

Remarks

The diagram uses horizontal coordinate α=m0/d and vertical coordinate β=m1/d; the shaded square is the sufficient region [0,3]2. Its four vertices are the four derivative polynomials listed in proof step 2.1. The argument above proves the claim independently of the picture.

®¯01230123

Depends on

Used by

Dependency tree · two levels

12 results within two dependency steps 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