CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)

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 series of real-valued functions converges uniformly if and only if its tails are uniformly small

Statement

Let $X$ be a set and let $f_{k} : X \to R$ . The function series $\sum f_{k}$ converges uniformly on $X$ if and only if, for every real $ε > 0$ , there is $N \in N$ such that

$∣ \sum_{k = m + 1}^{n} f_{k} (x) ∣ < ε$

for every $n > m \geq N$ and every $x \in X$ .

Facts & Assumptions

Given: A set $X$ , functions $f_{k} : X \to R$ , and partial-sum functions $S_{r} (x) = \sum_{k < r} f_{k} (x)$ .

[L1]

The series $\sum f_{k}$ converges uniformly exactly when its partial-sum sequence $(S_{r})$ converges uniformly (A series of real-valued functions and its pointwise and uniform convergence through its partial sums).

[L2]

A sequence of real-valued functions converges uniformly exactly when it is uniformly Cauchy (A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy).

[L3]

For $n > m$ , $\sum_{k = m + 1}^{n} f_{k} (x) = S_{n + 1} (x) - S_{m + 1} (x)$ , and $∣ - u ∣ = ∣ u ∣$ for every real $u$ (A series of real-valued functions and its pointwise and uniform convergence through its partial sums, Basic properties of the absolute value).

Proof

technique · direct

1.1L1

Suppose first that $\sum f_{k}$ converges uniformly, and let $ε > 0$ be real.

1.2given

Conversely, suppose the displayed tail condition holds, and fix a real $ε > 0$ and a corresponding index $N$ .

2.1step 1.1L1L2choose

By [L1] and [L2], choose $K$ such that $∣ S_{p} (x) - S_{q} (x) ∣ < ε$ for every $p, q \geq K$ and every $x \in X$ .

2.2step 1.2L3algebra

Put $K : = N + 1$ . If $p, q \geq K$ and $x \in X$ , then the difference is $0$ when $p = q$ ; if $p > q$ , set $m = q - 1 \geq N$ and $n = p - 1 > m$ , so the tail condition and [L3] give $∣ S_{p} (x) - S_{q} (x) ∣ < ε$ ; the case $q > p$ follows by symmetry of absolute value.

3.1step 2.1L3

For $n > m \geq K$ and $x \in X$ , the indices $n + 1, m + 1$ are at least $K$ , so [L3] and step 2.1 give $∣ \sum_{k = m + 1}^{n} f_{k} (x) ∣ < ε$ .

3.2step 2.2L1L2

Thus $(S_{r})$ is uniformly Cauchy, hence converges uniformly by [L2], and therefore $\sum f_{k}$ converges uniformly by [L1].

A series of real-valued functions converges uniformly if and only if its tails are uniformly small

Statement

Facts & Assumptions

Proof

Depends on

Dependency tree · 2 levels

Sources