Alphabeta Math
Pipeline-generated
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.

Clenshaw–Curtis and extrapolation quadrature — Examples

1 · Prerequisites

2 · Summary

The examples show why endpoint smoothness matters for Romberg extrapolation, compute the three-point Clenshaw–Curtis weights and its exact quadratic evaluation, and verify the sharp sample-error amplification of the nine-point closed Newton–Cotes rule. The last example keeps deterministic Peano integration error separate from perturbations in the supplied samples.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

The square-root endpoint does not have Romberg's even-power order

Example

For f(x)=x on [0,1], let TN be the composite trapezoidal value with mesh h=1/N, and set SN:=T2N+(T2N−TN)/3=(4T2N−TN)/3, the first-column Richardson value formed from the N- and 2N-panel levels. For N=2k with k∈N, this is Rk+1,1 of Finite Romberg table from nested composite trapezoid levels whenever its level cap L satisfies L≥k+1. For every integer N≥1, 82−11144h3/2≤∫01f(x) dx−SN. The coefficient is positive, so this error is not O(h2) as N→∞.

Facts & Assumptions

Given: N≥1, h=1/N, and f(x)=x on [0,1].

[A1]

N is a positive integer and h=1/N.

[F1]

Composite trapezoidal rule: TN is the sum of panel trapezoids on the uniform mesh; its individual panel values add to TN.

[F2]

Second-derivative error bound for the composite trapezoidal rule: on a panel of width h where f∈C2, the absolute difference between its integral and its trapezoid is at most h3sup⁡∣f′′∣/12.

[F3]

Finite Romberg table from nested composite trapezoid levels: its first-column recurrence is T2N+(T2N−TN)/3 when applied to the adjacent N- and 2N-panel levels; for dyadic N this is the corresponding table entry.

[F8]

Romberg cancels a proved finite even-power expansion: the cancellation conclusion requires the finite even-power expansion hypothesis stated there; it does not assert second-order accuracy for an endpoint-singular input without that expansion.

Proof

1.1givenA1F1F4F5F6algebra

Continuity from [F4] permits the substitution [F5] on [0,1] and on the first panel [0,h]. Thus ∫01x dx=2/3 and the first-panel integral is 2hh/3, while its trapezoid is hh/2; its excess is therefore hh/6=h3/2/6. For every panel, the chord joining endpoint values lies below x: for u,v≥0 and 0≤λ≤1, the square of (1−λ)u+λv is at most (1−λ)u+λv, since the difference is λ(1−λ)(u−v)2. Thus each panel integral is at least its trapezoid and eN:=2/3−TN≥h3/2/6.

2.1givenA1F2F6F7step 1.1algebra

For panels indexed by i=1,…,N−1, [F2] and [F7] bound each nonnegative panel excess by h3/(48ihih)=h3/2/(48i3/2), using the rational-power laws in Laws of rational exponents. The finite sum satisfies ∑i=1N−1i−3/2≤3: for N=1 it is empty; for N=2 it is 1; and for N≥3, if i−1≤x≤i then x3/2≤i3/2 by Monotonicity of r↦ar and of a↦ar. If x<i, inverse order Inverses of positives are positive, and reciprocation reverses order gives x−3/2>i−3/2, and if x=i equality holds. Integral monotonicity If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a) gives i−3/2≤∫i−1ix−3/2 dx for 2≤i≤N−1. Summing and using Truncated integrals of rational powers yields ∑i=1N−1i−3/2≤1+∫1N−1x−3/2 dx≤3. Adding the first-panel excess h3/2/6 gives eN≤(1/6+3/48)h3/2=11h3/2/48. Hence h3/2/6≤eN≤11h3/2/48.

3.1givenF3F8step 2.1algebra∎

The function is not C1 at 0, because its right difference quotient is x/x=1/x and is unbounded as x↓0; in particular it does not meet the smoothness assumptions behind the finite even-power expansion used for [F8]. Nevertheless the one-step value SN is defined. Writing e2N=2/3−T2N and using the preceding bounds at mesh h/2 and h gives ∫01f−SN=4e2N−eN3≥4(h/2)3/2/6−11h3/2/483=82−11144h3/2. The constant is positive since (82)2=128>121=112. Dividing by h2 makes the lower bound grow as a positive constant times h−1/2, so the error cannot be O(h2). This illustrates why [F8] cannot be applied without its expansion hypothesis.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Three-point Clenshaw–Curtis integration of a quadratic

Example

For the three-point rule (n=2) on [−1,1], the nodes are 1,0,−1 and the quadrature weights in that order are 1/3,4/3,1/3. Hence it integrates 1, x, and x2 exactly, with respective values 2, 0, and 2/3.

Facts & Assumptions

Given: The degree n=2 Clenshaw–Curtis rule on [−1,1] and the sample data of the polynomials 1,x,x2 at its three nodes.

[F1]

Type-I cosine transform for Chebyshev–Lobatto data: for n=2, Xk=y0+(−1)ky2+2y1cos⁡(kπ/2).

[F2]

DCT-I coefficients of the Chebyshev–Lobatto interpolant: a0=X0/4, a1=X1/2, and a2=X2/4.

[F3]

Exact integrals of Chebyshev polynomials: μ0=2, μ1=0, and μ2=−2/3.

[F4]

Clenshaw–Curtis quadrature with the midpoint zero-degree case: Q2,[−1,1](f)=∑k=02akμk since d=1.

[F5]

Chebyshev polynomials of the first and second kinds by their three-term recurrences: T0(x)=1, T1(x)=x, and T2(x)=2x2−1.

Proof

1.1givenF1F2F4algebra

For sample values (y0,y1,y2) at (1,0,−1), [F1] and the exact values cos⁡(0)=1, cos⁡(π/2)=0, cos⁡(π)=−1 give X0=y0+2y1+y2, X1=y0−y2, and X2=y0−2y1+y2. Substituting [F2] into [F4] gives Q2(f)=y0+2y1+y22−y0−2y1+y26=y03+4y13+y23.

2.1givenF3F5step 1.1algebra∎

For 1, the sample vector is (1,1,1) and the rule gives 2. For x, the vector is (1,0,−1) and the rule gives 0. For x2, it is (1,0,1) and the rule gives 2/3. Direct integration gives these same values, respectively 2, 0, and [x3/3]−11=2/3. Equivalently, [F5] gives x2=(T0+T2)/2, and [F3] gives integral μ0/2+μ2/2=2/3. Thus all three evaluations agree with the exact integrals.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Negative weights amplify sample perturbations in the nine-point Newton–Cotes rule

Example

For a sample vector s=(s0,…,s8)∈R9, write Q^8(s):=∑j=08wjsj. If a perturbed sample vector is s+δ with ∣δj∣≤ε, then ∣Q^8(s+δ)−Q^8(s)∣≤137144725ε. This constant is sharp and exceeds 2, the signed sum of the weights and the total weight of any positive rule exact on constants over [−1,1]. Independently, for f∈C10[−1,1] the quadrature error satisfies the Peano bound (∫−11∣K10(t)∣ dt)∥f(10)∥∞ of Peano remainder bound for the eight-panel rule.

Facts & Assumptions

Given: A sample vector s∈R9, the nine weights of Q8, and real perturbations δ0,…,δ8 satisfying ∣δj∣≤ε.

[A1]

ε≥0 and ∣δj∣≤ε for each node.

[F1]

Closed Newton–Cotes rule on eight equal panels: the rule has weights with numerators (989,5888,−928,10496,−4540,10496,−928,5888,989) and common denominator 14175.

[F2]

Exact weights and degree-nine exactness of the eight-panel rule: these coefficients are the integrated cardinal weights and the rule is exact through degree 9.

[F3]

Peano remainder bound for the eight-panel rule: for f∈C10, its integral error is bounded by ∥K10∥1∥f(10)∥∞ with the stated explicit kernel.

Proof

1.1givenA1F1algebra

The positive weight numerators sum to 34746 and the absolute values of the negative numerators sum to 928+4540+928=6396. Thus ∑j∣wj∣=(34746+6396)/14175=41142/14175=13714/4725, while ∑jwj=2. The triangle inequality and [A1] give ∣Q^8(s+δ)−Q^8(s)∣=∣∑jwjδj∣≤ε∑j∣wj∣. Equality holds by taking δj=ε when wj>0 and δj=−ε when wj<0 (with either value when wj=0), so the bound is sharp.

2.1givenF2F3step 1.1∎

For any separately supplied f∈C10[−1,1], [F2] and [F3] bound its deterministic integration error as stated. That smooth-function bound does not remove the sample-perturbation amplification in step 1.1.

Sources