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.

✓ 6 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Stable special function recurrences and certified evaluation — Examples

1 · Prerequisites

2 · Summary

Objective

These examples test the certified branches at the points where domain restrictions, cancellation, scaling, or relative error matter. The proofs include the Gauss series versus its logarithmic continuation, conditioning in 1−operatornameerf(x), least-term truncation for the signed erfcx asymptotic expansion, absolute versus relative accuracy near an Airy zero, a Bessel recurrence sign error under an arbitrarily small seed perturbation, and growth of unscaled I0(x) alongside the bounded scaled value.

Every example uses the exact branch and error contract from the A page. No example turns a finite recurrence heuristic or a limiting asymptotic series into an unproved convergence claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

The Gauss series disk and a continued logarithmic branch have different domains

Statement

For a=b=1 and c=2, the Gauss-series branch in Fresnel, error, and Gauss hypergeometric series is defined for ∣z∣<1 and there equals 2F1(1,1;2;z)=∑k=0∞zkk+1=−Log⁡(1−z)z, with value 1 at z=0. The right side has a principal analytic continuation to C∖[1,∞), which includes z=−2; the series evaluator correctly returns domain at z=−2 because this input lies outside the defined power-series branch. This example distinguishes the series branch's disk from the continuation branch's slit domain.

Facts & Assumptions

Given: The exact parameters a=b=1, c=2.

[F1]

Fresnel, error, and Gauss hypergeometric series: the Gauss branch is the stated power series on ∣z∣<1 with c not a nonpositive integer.

[F2]

The principal logarithm is the normalised holomorphic branch on the slit plane: Log⁡′(w)=1/w away from the nonpositive real axis.

[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): a continuously differentiable complex path satisfies the fundamental theorem of calculus by applying the real theorem to its real and imaginary parts.

[F4]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion and Inside its radius a real power series may be integrated term by term on every closed subinterval: a continuous integrand on [0,1] is integrable and a real power series may be integrated termwise strictly inside its radius; apply the latter to both real and imaginary component power series along the segment.

[F5]

Finite certified power-series evaluation for Fresnel, erf, and Gauss functions: its Gauss-series branch returns domain unless c avoids the excluded integers and ∣z∣<1.

Proof

1.1F1F2F3F4algebra

For a=b=1,c=2, the Pochhammer products give (1)k=k! and (2)k=(k+1)!, so each coefficient is 1/(k+1). For ∣z∣<1, the geometric series converges uniformly along the segment sz (0≤s≤1). Parameterizing the path and integrating the real and imaginary component power series termwise by [F4] gives ∑k=0∞zk+1k+1=∫01z1−sz ds=−Log⁡(1−z), where [F2], [F3], and [F4] justify the path integral identity since Re⁡(1−sz)>0 along the segment. Dividing by z gives the formula, and the series gives value 1 at z=0.

2.1F2step 1.1algebra

The principal logarithm is holomorphic when 1−z avoids the nonpositive real axis, that is, when z∉[1,∞). The quotient has a removable value at z=0 by step 1.1, so it defines the stated continuation domain, which contains −2.

3.1F1F5step 2.1∎

Since ∣−2∣>1, the defined Gauss-series branch fails its domain check and [F5] returns domain; this does not contradict the continued formula in step 2.1, which is a separately declared branch.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

Subtracting erf from one amplifies absolute input errors in the tail

Statement

For x>0, suppose the inputs to the subtraction 1−erf⁡(x) are approximations 1+δ1 and erf⁡(x)+δ2, where δ1,δ2 are signed errors. Its output error is exactly δ1−δ2, so its relative error is at most ∣δ1∣+∣δ2∣erfc⁡(x). For fixed nonzero input error bounds, this conditioning factor grows without bound as x→∞, because erfc⁡(x)>0 and tends to zero. The identity erfc⁡(x)=e−x2erfcx⁡(x) and a certified direct erfcx⁡ enclosure avoid this particular subtraction.

Facts & Assumptions

Given: A real x>0 and approximations 1^=1+δ1, erf⁡^=erf⁡(x)+δ2.

[F1]

Fresnel, error, and Gauss hypergeometric series and Scaled complementary error function and its moments: erfc⁡(x)=1−erf⁡(x) and erfcx⁡(x)=ex2erfc⁡(x).

[F2]

Error-function series geometric tail bound: for real x, erf⁡(x)=2π−1/2∫0xe−t2 dt.

[F3]

The Gaussian integral ∫−∞∞e−x2 dx=π: ∫−∞∞e−t2 dt=π.

[F4]

Soundness of finite erfcx enclosures: a successful direct erfcx⁡ evaluation supplies a containing absolute enclosure.

[F5]

Certified real elementary-function evaluations enclose their ranges: every finite successful real elementary-range output encloses its exact value or range on an admissible dyadic input interval; this applies to e−x2 for exact dyadic x.

Proof

1.1F1F2F3algebra

By [F1], the exact output is erfc⁡(x). Subtracting the perturbed inputs gives 1^−erf⁡^=erfc⁡(x)+δ1−δ2. Since [F2] and [F3] give erfc⁡(x)=2π−1/2∫x∞e−t2dt>0, division by the exact value and the triangle inequality yield the stated relative-error bound.

2.1F1F3F4F5step 1.1∎

The same tail integral tends to zero as x→∞, because the nonnegative Gaussian is integrable by [F3]. If ∣δ1∣,∣δ2∣≤η with fixed η>0, the choice δ1=η, δ2=−η attains error 2η, so the relative error is 2η/erfc⁡(x) and is unbounded. By [F1], multiplying containing intervals for erfcx⁡(x) and e−x2 with outward rounding encloses erfc⁡(x) and avoids the subtraction. For exact dyadic x>0, [F4] and [F5] supply those factors whenever their finite evaluations succeed; this asserts no finite-cap success for arbitrary real x.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Least-term truncation of the erfcx asymptotic expansion

Statement

For x≥1, let N≥1 be an integer nearest to x2, so N−12≤x2≤N+12. In the expansion from Signed finite remainder for the erfcx asymptotic expansion, the magnitudes of the terms are ak(x)=(1/2)kx2k+1π. The term aN(x) is minimal (ties are possible), and the signed remainder after N terms is bounded by exactly aN(x). For example, at x=3 the least-term truncation is N=9. This describes optimal truncation by term size; it does not assert convergence of the asymptotic series.

Facts & Assumptions

Given: Real x≥1 and integer N≥1 with N−12≤x2≤N+12.

[F1]

Signed finite remainder for the erfcx asymptotic expansion: after N terms, erfcx⁡(x)−SN(x)=(−1)NRN(x) with 0≤RN(x)≤(1/2)N/(x2N+1π).

Proof

1.1givenalgebra

The positive term ratio is ak+1(x)ak(x)=k+1/2x2. For 0≤k<N, this ratio is at most (N−1/2)/x2≤1, so the terms do not increase up to aN. For k≥N, the ratio is at least (N+1/2)/x2≥1, so terms do not decrease after aN. Hence aN is a least term.

2.1F1step 1.1algebra∎

The upper bound in [F1] equals (1/2)N/(x2N+1π)=aN(x), and its sign is fixed by (−1)N. Thus the first omitted least-sized term also bounds the signed asymptotic remainder. At x=3, N=9 satisfies 8.5≤9≤9.5; the same finite certificate applies.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An arbitrarily small seed perturbation flips a later Bessel sign

Statement

At x=1, every Jn(1) is positive and tends to zero as n→∞, whereas the complementary recurrence solution Dn(1) defined in Complementary solution for the integer Bessel recurrence is positive and unbounded for n≥1. Hence, for every ε>0, the perturbed seed pair J~0=J0(1)−εD0(1),J~1=J1(1)−εD1(1) can be arbitrarily close to the exact seeds, yet its forward recurrence solution J~n=Jn(1)−εDn(1) is negative for some index where the exact Jn(1) is positive. This is a recurrence-sensitivity example, not a claim that every floating-point implementation follows this particular error direction.

Facts & Assumptions

Given: The Bessel series at x=1, the order recurrence, and the complementary solution D.

[F1]

Integer-order Bessel series: at x=1, Jn(1)=∑k≥0(−1)k(1/2)2k+n/(k!(k+n)!).

[F2]

Convergence and geometric tails for integer-order Bessel series: these series converge absolutely, and their successive absolute term ratio is 1/[4(k+1)(k+n+1)] at x=1.

[F3]

Bessel differential equations and order recurrences from the series: Jn+1(1)=2nJn(1)−Jn−1(1) for n≥1.

[F4]

Complementary solution for the integer Bessel recurrence: D0=−J1, D1=J0, and Dn+1=2nDn−Dn−1 at x=1.

Proof

1.1F1F2algebra

Let ak=(1/2)2k+n/(k!(k+n)!). By [F2], the positive terms ak decrease strictly to zero. Grouping the alternating series in consecutive pairs gives Jn(1)=(a0−a1)+(a2−a3)+⋯>0. Also (k+n)!≥n!, so 0<Jn(1)≤∑k≥0ak≤2−nn!∑k≥0(1/4)kk!=2−ne1/4n!⟶0. In particular, J0(1)≥1−1/4=3/4 and J1(1)≥1/2−1/16=7/16.

2.1F1F3F4step 1.1induction

By [F4], D0(1)=−J1(1)<0 and D1(1)=J0(1)>0; hence D2=2D1−D0>D1>0. If n≥2 and Dn≥Dn−1>0, then Dn+1=2nDn−Dn−1≥(2n−1)Dn≥3Dn. Induction gives Dn≥3n−2D2 for n≥2, so Dn→∞.

3.1F1F3F4step 1.1step 2.1algebra∎

The exact sequence Jn−εDn obeys the same linear recurrence by [F3] and [F4], so it is the forward-recurrence solution from the displayed perturbed seeds. Since Jn→0 and Dn→∞ by steps 1.1 and 2.1, some finite n satisfies εDn>Jn. At that index J~n<0<Jn. The seed differences have magnitudes ε∣D0∣ and ε∣D1∣, which tend to zero with ε.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Relative error becomes unavailable at an Airy zero

Statement

There is a real ξ<0 with Ai⁡(ξ)=0. An absolute enclosure remains meaningful there, but the relative certificate in Certified special-function enclosure result cannot be reported by an enclosure containing zero. Near ξ, relative certification requires a radius proportional to the small value ∣Ai⁡(x)∣ and therefore requires increasingly fine absolute enclosures.

Facts & Assumptions

Given: A negative real Airy zero ξ and a real input x near ξ.

[F1]

The Airy Ai function has a negative real zero: some ξ<0 satisfies Ai⁡(ξ)=0.

[F2]

Airy coefficient recurrence and geometric tail bounds: Ai⁡ is entire, hence continuous on the real axis.

[F3]

Certified special-function enclosure result: relative certification requires 0∉B and rad⁡(B)/d(B,0)≤εr.

[F4]

Soundness of finite Airy enclosures: successful Airy evaluations provide absolute enclosures even when no relative certificate is available.

Proof

1.1F1F3F4

At x=ξ, every enclosure containing the exact value also contains 0. Therefore the zero-exclusion condition in [F3] fails, while [F4] still permits an absolute-radius success enclosure.

2.1F1F2F3∎

For any η>0, continuity in [F2] at the zero [F1] gives a neighborhood of ξ on which ∣Ai⁡(x)∣<η. Whenever a relative certificate succeeds for an enclosure B of such a value, [F3] implies rad⁡(B)≤εrd(B,0)≤εr∣Ai⁡(x)∣<εrη. Thus the required absolute radius tends to zero as the input approaches ξ.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Scaling keeps the modified Bessel value bounded as the unscaled value grows

Statement

For n=0 and x≥0, the scaled value e−xI0(x) lies in [0,1], while I0(x)→∞ as x→∞. Thus any fixed finite output range for unscaled values is eventually exceeded, whereas the scaled value remains bounded and can be evaluated directly from its scaled integral.

Facts & Assumptions

Given: Real x≥0.

[F1]

Integral representations and a range bound for integer Bessel functions: I0(x)=1π∫0πexcos⁡θ dθ,0≤e−xI0(x)≤1.

[F2]

The derivatives of sine and cosine are cosine and minus sine: sin⁡′t=cos⁡t, cos⁡′t=−sin⁡t, sin⁡0=0, and cos⁡0=1.

[F3]

Proof

1.1F2F3F4algebra

Let h(t)=t−sin⁡t. By [F2], h(0)=0 and h′(t)=1−cos⁡t≥0 for t≥0 by [F3], so sin⁡t≤t. Again by [F2] and [F4], 1−cos⁡θ=∫0θsin⁡t dt≤∫0θt dt=θ2/2(0≤θ≤1).

2.1F1step 1.1algebra

For x≥1 and 0≤θ≤1/x, step 1.1 gives xcos⁡θ≥x−1/2. Restricting the integral in [F1] to this interval therefore yields I0(x)≥ex−1/2πx. The exponential series gives ex≥x2/2 for x≥0, so this lower bound is at least e−1/2x3/2/(2π) and tends to infinity.

3.1F1step 2.1∎

The scaled range in [F1] holds for every x≥0, while step 2.1 shows the unscaled value exceeds any fixed finite range for sufficiently large x. The scaled integral method of Composite midpoint enclosure for the scaled modified Bessel integral evaluates the bounded scaled quantity directly.

Sources