Alphabeta Math
TheoremStatement: 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 representation and L1 error bound

Statement

Let a<b, let x1,…,xs∈[a,b] and w1,…,ws∈R define the finite quadrature Q and residual L of Peano kernel of a finite quadrature functional, and let r∈N with r≥1. Assume L vanishes on the evaluation functions of the zero polynomial and every nonzero formal polynomial of degree at most r−1, and let f∈Cr([a,b]). For the kernel Kr(t)=L(gr,t) of Peano kernel of a finite quadrature functional, L(f)=∫abKr(t)f(r)(t) dt,∣L(f)∣≤(∫ab∣Kr(t)∣ dt)∥f(r)∥∞.

Facts & Assumptions

Given: A nondegenerate interval [a,b], a finite real weighted quadrature exact on Pr−1, an integer r≥1, and f∈Cr([a,b]).

[A1]

a<b, r∈N with r≥1, L vanishes on the evaluation functions of the zero polynomial and every nonzero formal polynomial of degree at most r−1, and f has continuous derivatives through order r.

[F1]

Peano kernel of a finite quadrature functional: L(f)=∫abf−∑iwif(xi) and Kr(t)=L(gr,t), where gr,t(x)=(x−t)+r−1/(r−1)! for r≥2 and g1,t(x)=1{x>t}; the factorial image is positive and invertible.

[F2]

Higher derivatives and the classes Ck and C∞: f∈Cr([a,b]) has continuous derivatives through order r, including one-sided endpoint derivatives.

[F3]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): for a continuous derivative, integration over [a,x] equals the endpoint increment of a primitive.

[F5]

A continuous function on a closed rectangle has repeated Riemann integrals in every coordinate order, all equal to its multiple integral: a continuous function on a closed rectangle has equal repeated Riemann integrals in either coordinate order.

[F7]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: continuous functions on closed intervals are Riemann-integrable.

[F8]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous function on a compact metric rectangle is uniformly continuous.

[F9]

Changing an integrable function at finitely many points changes neither its integrability nor its integral: changing finitely many values preserves Riemann integrability and leaves the integral unchanged.

Proof

1.1givenF2F3F4inductionalgebra

We first establish Taylor's integral remainder by induction on the natural order q (The principle of mathematical induction). For r=1, [F3] gives f(x)=f(a)+∫axf′(t) dt. If the remainder formula holds at order q≥1, put u(t):=(x−t)q/q!. The product rule and FTC give ∫axu′(t)f(q)(t) dt=[u(t)f(q)(t)]ax−∫axu(t)f(q+1)(t) dt, and u′(t)=−(x−t)q−1/(q−1)!. Rearranging yields ∫ax(x−t)q−1(q−1)!f(q)(t) dt=(x−a)qq!f(q)(a)+∫ax(x−t)qq!f(q+1)(t) dt. Thus induction yields f(x)=∑j=0r−1f(j)(a)(x−a)j/j!+∫ax(x−t)r−1f(r)(t)/(r−1)! dt.

2.1givenA1F1F6step 1.1

Extend the last integral to [a,b] by setting its kernel to zero when t≥x. With Pr−1(x):=∑j=0r−1f(j)(a)(x−a)j/j!, the result is f(x)=Pr−1(x)+∫abgr,t(x)f(r)(t) dt. Since Pr−1 is zero or has degree at most r−1, [A1] gives L(Pr−1)=0.

3.1givenF1F2F5F6F7F8step 2.1

Suppose first that r≥2. The function (x,t)↦gr,t(x)f(r)(t) is continuous on [a,b]2 because r−1≥1 and f(r) is continuous. By [F5]–[F7], applying the integral part of L to step 2.1 and interchanging the two rectangle integrals gives ∫ab(∫abgr,t(x) dx)f(r)(t) dt. Each finite evaluation term of Q commutes with the t-integral by [F6]. Therefore L(f)=∫abL(gr,t)f(r)(t) dt=∫abKr(t)f(r)(t) dt. The function (x,t)↦gr,t(x) is uniformly continuous on the compact square by [F8], so its x-integral and its finite weighted evaluations vary continuously with t; hence Kr is continuous and integrable.

3.2givenF1F3F4F6F7F9F10step 2.1algebra

If r=1, exactness on constants gives ∑iwi=b−a. For t outside the finite node set, [F1] gives K1(t)=(b−t)−∑xi>twi. It is bounded and affine between consecutive nodes. Extend each affine piece continuously to its closed subinterval; the resulting pieces are integrable by [F7] and add to an integrable piecewise function by [F6]. The kernel differs from that function at only finitely many nodes, so it is integrable and has the same integral by [F9]. Since f′ is continuous, [F10] makes K1f′ integrable; changing the kernel values at the finite node set does not change that product integral by [F9]. By [F3]–[F4] and integration by parts, ∫ab(b−t)f′(t) dt=∫abf(t) dt−(b−a)f(a), while ∑iwi∫axif′(t) dt=Q(f)−(b−a)f(a). Subtracting gives ∫abK1(t)f′(t) dt=L(f).

4.1givenF2F10F11step 3.1step 3.2algebra∎

By [F2] and [F11], f(r) is bounded on [a,b], so ∥f(r)∥∞<∞. In either case, the kernel is integrable and ∣Kr∣ is integrable by [F10]. Apply monotonicity in [F10] to −∣Kr∣∥f(r)∥∞≤Krf(r)≤∣Kr∣∥f(r)∥∞, and use the representation in step 3.1 or 3.2. This gives the asserted bound.

Depends on

Used by

Dependency tree · two levels

102 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