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.
If then : convergence implies -summability to the same value
Statement
Let be a sequence of reals that converges (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals), and let be its sequence of Cesaro means (The Cesaro means and -summability). Then converges as well, and
Both limits are asserted to exist: the right-hand one by hypothesis, the left-hand one as part of the conclusion. Equivalently: a convergent sequence is -summable, to its own limit. The notation is licensed by uniqueness of limits of real sequences (A sequence has at most one limit).
The converse is false (FALSE: if the Cesaro means of a sequence converge then the sequence converges).
Facts & Assumptions
Given: A sequence of reals converging to , and its Cesaro means .
The Cesaro means and -summability (The Cesaro means and -summability); for every (Canonical naturals are positive and strictly increasing).
Finite sums (Finite sums and finite products, by recursion) and their laws: additivity, scaling with , splitting for , and monotonicity of in its terms (Laws of finite sums and finite products).
Triangle inequality for finite sums: (Triangle inequality for finite sums).
Convergence: for every rational there is with for all , and equivalently for every real , since below every positive real lies a positive rational (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences, The rationals embed densely in the reals).
Reciprocal Archimedean property: for every real there is a natural with (For every in a complete ordered field there is a natural with ).
Order arithmetic: gives and gives (Inverses of positives are positive, and reciprocation reverses order); for , gives (Sign rules for products and monotonicity of multiplication); adding a constant preserves the order and inequalities add (Order is preserved by adding a constant and by adding inequalities); the order is total and transitive (Complete ordered field (least-upper-bound property), Ordered field); (Basic properties of the absolute value); and whenever in (Canonical naturals are positive and strictly increasing). In each clause above, Sign rules for products and monotonicity of multiplication and Order is preserved by adding a constant and by adding inequalities state the STRICT forms and only those; the nonstrict forms used below are those together with the equality cases, which trichotomy settles, the order being total (Ordered field).
The order on is total, so two indices have a larger one ( is a linear order on ).
Proof
Let be an arbitrary real; choose with for every .
Put , a real with because every summand is .
For every : since , one has , hence , the last two steps using for and .
Since , choose a natural with ; then for every one has , so .
Let be the larger of and ; for every both estimates apply and .
As was arbitrary, converges to , so exists and equals .
Remarks
-
The shape of the argument is the shape of every regularity proof. The terms split into a fixed head, whose contribution is a constant divided by and therefore eventually negligible, and a tail, all of whose terms are already within of and whose weights sum to at most . A summability matrix with only finitely many nonzero entries per row is regular iff each column tends to , the row sums tend to , and the row absolute sums are uniformly bounded is exactly this argument carried out for an arbitrary weighting, and The Cesaro matrix satisfies the Silverman-Toeplitz conditions, giving a second proof of the Cesaro mean theorem recovers the theorem above from it.
-
The bound rather than in the second estimate is there only so that the divisor is positive when , which happens whenever the first terms already equal .
-
Nothing here needs boundedness of as a separate hypothesis: it follows from convergence, and in any case only the fixed head is estimated crudely, and it is finite.
Depends on
- The Cesaro means $\sigma_n = (x_0 + \dots + x_n)/(n+1)$ and $(C,1)$-summability
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Triangle inequality for finite sums
- Limits and Cauchy sequences of reals
- The rationals embed densely in the reals
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Inverses of positives are positive, and reciprocation reverses order
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
- Basic properties of the absolute value
- Canonical naturals are positive and strictly increasing
- A sequence has at most one limit
- $\le$ is a linear order on $\mathbb{N}$
- Complete ordered field (least-upper-bound property)
- Ordered field
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 67 results over 29 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
- Summation methods (Encyclopedia of Mathematics) (standard reference, not scraped)
- Cesàro summation (Wikipedia) (standard reference, not scraped)
- Silverman-Toeplitz theorem (Wikipedia) (standard reference, not scraped)
- G. H. Hardy, Divergent Series, Ch. 5 (standard reference, not scraped)