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 scaled incomplete-gamma tail bound for large Boys arguments

Statement

Let m∈N0, s=m+12, and T>max⁡{s−1,0}. Then Fm(T)=Γ(s)−Rs(T)2Ts,Rs(T)=∫T∞us−1e−u du, and 0≤Rs(T)≤Ts−1e−T1−max⁡{s−1,0}/T. Consequently a certified enclosure of Γ(s) and e−T gives the interval [Γ(s)2Ts−Ts−1e−T2Ts(1−max⁡{s−1,0}/T),Γ(s)2Ts] after intersecting its lower endpoint with zero. In the evaluator's large branch T>2m+1, the denominator is at least 1/2.

Facts & Assumptions

Given: m≥0, s=m+1/2, T>max⁡{s−1,0}, and the definitions in Boys functions and lower incomplete-gamma notation and Euler's Gamma function on the right half-plane.

[F2]

Euler's Gamma function on the right half-plane: Γ(s)=∫0∞us−1e−u du for s>0.

[F3]

Additivity of the nonnegative Lebesgue integral: splitting a nonnegative integral over adjacent intervals adds the two integrals.

Proof

1.1givenF1F2F3algebra

By [F2]–[F3], Γ(s)=γ(s,T)+Rs(T), so [F1] gives the scaled identity. The tail is nonnegative.

1.2givenalgebra

Substitute u=T+v into Rs(T). If s≥1, then (T+v)s−1=Ts−1(1+v/T)s−1≤Ts−1e(s−1)v/T because 1+w≤ew for w≥0. Hence Rs(T)≤Ts−1e−T∫0∞e−(1−(s−1)/T)vdv, whose integral is 1/(1−(s−1)/T). If 0<s<1, then (T+v)s−1≤Ts−1, yielding Rs(T)≤Ts−1e−T. These are the combined bound.

2.1givenstep 1.1step 1.2algebra∎

For s=m+1/2, max⁡{s−1,0}≤m; if T>2m+1, then max⁡{s−1,0}/T<1/2. Substitution into step 1.2 gives the evaluator's large-branch denominator bound and the interval enclosure.

Depends on

Used by

Dependency tree · two levels

19 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