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

Peano remainder bound for the eight-panel rule

Statement

If f∈C10[−1,1], then the rule Q8 of Closed Newton–Cotes rule on eight equal panels satisfies ∣∫−11f(x) dx−Q8(f)∣≤(∫−11∣K10(t)∣ dt)∥f(10)∥∞, where K10(t)=(1−t)1010!−∑j=08wj(xj−t)+99!,xj=−1+j/4, and u+:=max⁡(u,0).

Facts & Assumptions

Given: A function f∈C10[−1,1] and the nine-node quadrature Q8.

[A1]

f has continuous derivatives through order 10 on [−1,1].

[F1]

Closed Newton–Cotes rule on eight equal panels: Q8(f)=∑j=08wjf(xj) on the nodes xj=−1+j/4.

[F2]

Exact weights and degree-nine exactness of the eight-panel rule: Q8 is exact for the zero polynomial and every nonzero polynomial of degree at most 9.

[F3]

Peano kernel of a finite quadrature functional: for r=10, K10(t)=L(g10,t), where g10,t(x)=(x−t)+9/9! and L(u)=∫−11u−Q8(u).

[F4]

Peano representation and L1 error bound: exactness through degree 9 and f∈C10 imply ∣L(f)∣≤(∫−11∣K10(t)∣ dt)∥f(10)∥∞.

Proof

1.1givenF1F3algebra

By [F1] and [F3], K10(t)=∫−11(x−t)+9/9! dx−∑j=08wj(xj−t)+9/9!. For −1≤t≤1, the integral is ∫t1(x−t)9/9! dx=(1−t)10/10!, by the power antiderivative and endpoint evaluation. This gives the displayed kernel.

2.1givenA1F2F4step 1.1∎

The exactness condition of [F4] holds by [F2], and its smoothness condition is [A1]. Applying [F4] to this Q8 and substituting the kernel from step 1.1 proves the bound.

Depends on

Used by

Dependency tree · two levels

38 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