Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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 positive midpoint enclosure for Boys functions on bounded arguments

Statement

For m∈N0, T≥0, and integer N≥1, let h=1/N, tj=(j−12)h for 1≤j≤N, and Qm,N(T)=h∑j=1Ntj2me−Ttj2. Then all quadrature weights and summands are positive and ∣Fm(T)−Qm,N(T)∣≤m+T2N. Consequently, for 0≤T≤Tmax⁡, the same positive rule has the uniform enclosure error (m+Tmax⁡)/(2N).

Facts & Assumptions

Given: Fm(T) as in Boys functions and lower incomplete-gamma notation, m≥0, T≥0, and N≥1.

[F1]

Boys functions and lower incomplete-gamma notation: Fm(T)=∫01f(t) dt with f(t)=t2me−Tt2.

[F2]

Mean value theorem on a closed real interval: a differentiable function whose derivative has absolute value at most L varies by at most L times the distance between two points.

[L9]

The exponential function is smooth and (exp⁡)′=exp⁡ and Sum, product, quotient, and chain rules from difference quotients: the exponential is smooth with derivative itself; finite sums, products and polynomial compositions obey the product, power and chain rules. Applying these rules one coordinate or parameter at a time justifies every displayed finite Gaussian derivative.

Proof

1.1givenF1F2algebraL9

For m=0, f′(t)=−2Tte−Tt2, so ∣f′(t)∣≤2T. For m≥1, differentiation gives f′(t)=2mt2m−1e−Tt2−2Tt2m+1e−Tt2; since 0≤t≤1 and e−Tt2≤1, ∣f′(t)∣≤2m+2T. Thus the Lipschitz constant L=2m+2T is valid in both cases by [F2].

2.1givenstep 1.1algebra

On each subinterval of length h, the mean-value bound gives ∣f(t)−f(tj)∣≤L∣t−tj∣. Integrating over that subinterval yields error at most Lh2/4, because the integral of distance from its midpoint is h2/4. Summing N subintervals gives L/(4N)=(m+T)/(2N). All midpoints and weights are positive and f(tj)>0.

3.1givenstep 2.1algebra∎

If T≤Tmax⁡, then (m+T)/(2N)≤(m+Tmax⁡)/(2N); hence the stated uniform bound follows without changing the positive weights or nodes.

Depends on

Used by

Dependency tree · two levels

17 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