Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Elementary factorial and geometric series converge uniformly

Statement

For every real R≥0, the factorial series ∑n=0∞Rn/n! converges. If N≥0 and q=R/(N+2)<1, its tail after index N satisfies ∑n=N+1∞Rnn!≤RN+1(N+1)!(1−q). Consequently the series defining exp⁡x, sin⁡x, cos⁡x and each of their formal derivative series converge absolutely and uniformly on every bounded interval ∣x∣≤R. For 0≤r<1, the geometric series and the odd power series ∑k≥0x2k+1/(2k+1), with their formal derivative series, converge absolutely and uniformly on ∣x∣≤r.

Facts & Assumptions

Given: A Dedekind-complete ordered field, a real R≥0, and the Archimedean property derived from completeness.

[F1]

Dedekind-complete ordered real field: every nonempty bounded-above set has a least upper bound.

[L1]

Dedekind completeness implies the Archimedean property: the natural numbers are unbounded above.

[L2]

Real and complex modulus product and triangle inequalities: ∣xy∣=∣x∣∣y∣ and the real absolute value is nonnegative.

Proof

1.1givenL1algebrainduction

Let 0≤q<1. For every integer m≥0, (1−q)∑k=0mqk=1−qm+1. If q=0, its powers after the zeroth are zero. If 0<q<1, then 1/q=1+d for d>0, and induction gives (1+d)m≥1+md. By [L1], 1+md is unbounded, so 0≤qm≤1/(1+md)→0. Thus the geometric partial sums converge to 1/(1−q), with tail qm+1/(1−q).

2.1givenF1L1step 1.1algebra

For R=0 the factorial series is 1. For R>0, choose N with q=R/(N+2)<1 by [L1]. If un=Rn/n!, then for n≥N+1, un+1/un=R/(n+1)≤q. Every finite tail after N is therefore at most uN+1∑j≥0qj=uN+1/(1−q) by step 1.1. The positive partial sums are increasing and bounded, so [F1] gives their supremum S. For every ε>0, some partial sum exceeds S−ε, since otherwise S−ε would be an upper bound; monotonicity then puts all later partial sums between S−ε and S. The finite-tail geometric bound passes to this limit and proves the stated estimate.

3.1L2step 2.1algebra

For ∣x∣≤R, [L2] gives ∣xn/n!∣≤Rn/n!. Thus the exponential series is uniformly Cauchy by the tail bound in step 2.1. The sine and cosine series are subseries of this same nonnegative majorant, so their absolute tails are uniform as well. For the formal derivative series, the exponential terms are bounded by Rn−1/(n−1)!; sine derivatives are bounded by R2k/(2k)!, and nonconstant cosine derivatives by R2k−1/(2k−1)!. Each is a subseries of a factorial series from step 2.1. The same tail comparison proves absolute and uniform convergence of all stated series.

4.1L1L2step 1.1algebrachoose∎

For 0≤r<1, the geometric series is uniformly absolutely convergent on ∣x∣≤r by step 1.1. Its formal derivative terms are bounded by vn=nrn−1 for n≥1. If r=0, only the first derivative term is nonzero. If 0<r<1, choose q with r<q<1 and an integer n0 large enough that r(1+1/n)≤q for n≥n0, using [L1]. Then vn+1/vn=r(1+1/n)≤q, so the derivative majorant has tails bounded by a constant times geometric tails from step 1.1. This proves absolute and uniform convergence of the geometric derivative series. The absolute terms of ∑k≥0x2k+1/(2k+1) are bounded by r2k+1 and the derivative terms by r2k. Their tails converge uniformly by step 1.1 applied to q=r2; multiplication by the fixed factor r or 2 does not affect convergence. This proves the assertions for the odd power series and its formal derivative series.

Depends on

Used by

Dependency tree · two levels

5 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