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 be a set and let . Suppose there is a sequence of nonnegative reals such that
and the scalar series converges. Then converges absolutely for every , and the function series converges uniformly on .
Facts & Assumptions
Given: Functions and nonnegative reals with for all , such that converges.
If eventually and converges, then converges (If eventually, convergence of gives convergence of , and divergence of gives divergence of ).
A convergent real series has uniformly small scalar tails: for every real there is such that whenever (A series converges iff for every there is with for all ).
Repeated triangle inequalities for finite sums give , 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).
A function series converges uniformly exactly when its tails are uniformly small (A series of real-valued functions converges uniformly if and only if its tails are uniformly small, A series of real-valued functions and its pointwise and uniform convergence through its partial sums).
Proof
Fix . Since for every , [L1] shows that converges.
Let . By [L2] choose such that whenever , the absolute value being unnecessary because the terms are nonnegative.
For and , one has .
Step 1.1 gives absolute pointwise convergence, while step 2.1 and [L4] give uniform convergence of .
Depends on
- A series of real-valued functions converges uniformly if and only if its tails are uniformly small
- A series converges iff for every $\varepsilon > 0$ there is $N$ with $|a_{m+1} + \dots + a_n| < \varepsilon$ for all $n > m \ge N$
- If $0 \le a_k \le b_k$ eventually, convergence of $\sum b_k$ gives convergence of $\sum a_k$, and divergence of $\sum a_k$ gives divergence of $\sum b_k$
- A series of real-valued functions and its pointwise and uniform convergence through its partial sums
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Basic properties of the absolute value
- The triangle inequality
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
- MIT OpenCourseWare 18.100B, Real Analysis, Lectures 20–21 (standard reference, not scraped)
- University of Alberta Math 317, Infinite Series of Functions (standard reference, not scraped)