LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Composite midpoint enclosure for the integer Bessel integral

Statement

Let $n \geq 0$ be an integer, $x \in R$ , $m \geq 1$ , and $h = π / m$ . Put $ϕ (θ) = \cos (n θ - x \sin θ)$ and $Q_{m} = h \sum_{j = 0}^{m - 1} ϕ ((j + 1 / 2) h)$ . Then

$∣ J_{n} (x) - \frac{Q_{m}}{π} ∣ \leq \frac{h^{2}}{24} ((n + ∣ x ∣)^{2} + ∣ x ∣) .$

This is the local composite-midpoint certificate for the Bessel integral; it does not certify floating-point summation unless each operation is enclosed.

Facts & Assumptions

Given: Integer $n \geq 0$ , real $x$ , and positive integer $m$ .

[F1]

Integral representations and a range bound for integer Bessel functions: $J_{n} (x) = π^{- 1} \int_{0}^{π} ϕ (θ) d θ$ .

[F2]

Taylor's Lagrange remainder follows from repeated Rolle steps: for a $C^{2}$ function, the first-order Taylor remainder at $c$ is $f^{''} (ξ) u^{2} / 2$ for some point $ξ$ between $c$ and $c + u$ .

[L9]

Sum, product, quotient, and chain rules from difference quotients, The derivatives of sine and cosine are cosine and minus sine: the displayed real functions are smooth on their stated domains, and their derivatives follow by the product, power and chain rules; iterate these rules for the finite higher derivatives used below.

Proof

1.1givenL9algebra

Write $g (θ) = n θ - x \sin θ$ , so $∣ g^{'} (θ) ∣ \leq n + ∣ x ∣$ and $∣ g^{''} (θ) ∣ \leq ∣ x ∣$ . Differentiating $ϕ = \cos g$ gives $∣ ϕ^{''} (θ) ∣ \leq ∣ g^{'} (θ) ∣^{2} + ∣ g^{''} (θ) ∣ \leq (n + ∣ x ∣)^{2} + ∣ x ∣ = : M$ .

2.1step 1.1F2algebra

On a panel centered at $c$ with half-width $h / 2$ , [F2] gives $∣ ϕ (c + u) - ϕ (c) - u ϕ^{'} (c) ∣ \leq M u^{2} / 2$ . Integrating over $- h / 2 \leq u \leq h / 2$ cancels the odd term and bounds the panel error by $M h^{3} / 24$ .

3.1F1step 2.1algebra∎

Summing the $m$ panel errors gives $∣ \int_{0}^{π} ϕ - Q_{m} ∣ \leq m M h^{3} / 24 = π M h^{2} / 24$ . Divide by $π$ and use [F1] to obtain the stated bound.

Depends on

Used by

Dependency tree · two levels

23 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

DLMF, Chapter 3, §3.5, quadrature (standard reference, not scraped)
DLMF, §10.74(iii) and Chapter 3, §3.5 (standard reference, not scraped)
N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2 and 4 (standard reference, not scraped)