Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-07-31
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.

The Weierstrass M-test gives absolute pointwise convergence and uniform convergence of a function series

Statement

Let XX be a set and let fk:XRf_k:X\to\mathbb{R}. Suppose there is a sequence of nonnegative reals (Mk)(M_k) such that

fk(x)Mk(kN, xX)|f_k(x)|\le M_k\qquad(k\in\mathbb{N},\ x\in X)

and the scalar series Mk\sum M_k converges. Then fk(x)\sum f_k(x) converges absolutely for every xXx\in X, and the function series fk\sum f_k converges uniformly on XX.

Facts & Assumptions

Given: Functions fk:XRf_k:X\to\mathbb{R} and nonnegative reals MkM_k with fk(x)Mk|f_k(x)|\le M_k for all k,xk,x, such that Mk\sum M_k converges.

[L2]

A convergent real series has uniformly small scalar tails: for every real ε>0\varepsilon>0 there is NN such that k=m+1nak<ε\left|\sum_{k=m+1}^{n}a_k\right|<\varepsilon whenever n>mNn>m\ge N (A series converges iff for every ε>0\varepsilon > 0 there is NN with am+1++an<ε|a_{m+1} + \dots + a_n| < \varepsilon for all n>mNn > m \ge N).

[L3]

Repeated triangle inequalities for finite sums give k=pqukk=pquk\left|\sum_{k=p}^{q}u_k\right|\le\sum_{k=p}^{q}|u_k|, and finite sums preserve termwise inequalities (The triangle inequality, Basic properties of the absolute value, Finite sums and finite products, by recursion, Laws of finite sums and finite products).

Proof

technique · direct
1.1

Fix xXx\in X. Since 0fk(x)Mk0\le |f_k(x)|\le M_k for every kk, [L1] shows that fk(x)\sum |f_k(x)| converges.

givenL1
1.2

Let ε>0\varepsilon>0. By [L2] choose NN such that k=m+1nMk<ε\sum_{k=m+1}^{n}M_k<\varepsilon whenever n>mNn>m\ge N, the absolute value being unnecessary because the terms are nonnegative.

L2choose
2.1

For n>mNn>m\ge N and xXx\in X, one has k=m+1nfk(x)k=m+1nfk(x)k=m+1nMk<ε\left|\sum_{k=m+1}^{n}f_k(x)\right|\le\sum_{k=m+1}^{n}|f_k(x)|\le\sum_{k=m+1}^{n}M_k<\varepsilon.

step 1.2L3
3.1

Step 1.1 gives absolute pointwise convergence, while step 2.1 and [L4] give uniform convergence of fk\sum f_k.

step 1.1step 2.1L4

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 66 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources