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.
Divergence to and to
Definition
Let be a sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences), with ordered as in Order on the reals and Complete ordered field (least-upper-bound property).
- diverges to , written , when for every there is such that for all .
- diverges to , written , when for every there is such that for all .
Equivalently, in the language of Sequences of reals: bounded, eventually, frequently, tails, subsequences: when the property holds eventually, for every real .
Remarks
-
This is divergence, not convergence. The symbols and are not real numbers: is the complete ordered field (Complete ordered field (least-upper-bound property)) and contains no element larger than every element of itself. Nothing above claims that has a limit in the sense of Limits and Cauchy sequences of reals, and nothing above defines an object named . The whole phrase "" is a single abbreviation for the displayed condition, exactly as " is Cauchy" is an abbreviation for a condition and not a claim that some object called a Cauchy value exists.
-
A sequence diverging to really does diverge. Suppose . Given any real , there is with for all ; in particular , so no real satisfies for all . Since always (Basic properties of the absolute value), a bound valid for all would give for all , which has just been excluded, so no such exists either. Thus is unbounded, and an unbounded sequence cannot converge, since convergent sequences are bounded (Every convergent sequence is bounded). The same argument applies to . So the two notions never overlap: a sequence that diverges to has no limit whatever.
-
Consequently is not written here. Many texts write . This library does not, for the reason recorded in Conventions: , unbounded sets, and the extended reals about : writing an equation whose right-hand side is not an element of silently moves the discussion into the extended real line, a structure that is not a field, and every subsequent algebraic step then needs its own justification. In particular none of the rules of Algebra of limits: sums, scalar multiples, products and quotients may be applied to a divergence to ; the familiar slogans "" and "" are separate statements about this definition and would need separate proofs.
-
Testing against naturals suffices. Since is Archimedean (Every complete ordered field is Archimedean), every real is below some canonical natural , so the condition "for every real " may equivalently be read as "for every natural "; the two formulations of agree.
-
Divergence to is much stronger than divergence. A sequence alternating between and diverges (FALSE: every bounded sequence converges) but goes to neither nor , since it is bounded. Divergence is the negation of convergence; divergence to is a positive statement about growth.
Depends on
Used by
- For a series of real numbers, unconditional convergence and absolute convergence are the same property Corollary
- The limit inferior is the least subsequential limit in overlineℝ Corollary
- A sequence with limsup = +∞: the greatest subsequential limit exists only in overlineℝ Counterexample
- Null times divergent has no rule: xₖ = 1/k with yₖ = ck gives product limit c, and with yₖ = k² gives divergence Counterexample
- xₖ = √k has xₖ₊₁ - xₖ → 0 and is not Cauchy Counterexample
- xₖ₊₁ = xₖ + 1/xₖ from x₁ = 1 has strictly decreasing consecutive gaps and diverges, so no uniform c < 1 exists Counterexample
- Convergence in overlineℝ and the extended subsequential limit set: L ∈ overlineℝ is an extended subsequential limit when some subsequence converges to L, or diverges to L = ±∞ Definition
- Limits at +∞ and -∞, and infinite limits at a point Definition
- The extended real line overlineℝ = ℝ ∪ {-∞, +∞}, its order, and the arithmetic that is left undefined Definition
- A positive sequence making all three inequalities of the ratio-to-root chain strict Example
- The block sequence 1/1; 1/2, 2/2; 1/3, 2/3, 3/3; … has subsequential limit set exactly [0,1] Example
- FALSE: ∏ (1 + pₖ) converges whenever pₖ → 0 False statement
- FALSE: every rearrangement of a convergent series converges, and to the same sum False statement
- FALSE: there is a divergent series of positive terms that diverges more slowly than every other, hence a universal comparison test False statement
- A nondecreasing sequence that is not bounded above diverges to +∞ Lemma
- For |r| < 1 the sequence rᵏ is null, and for |r| > 1 the sequence |r|ᵏ diverges to +∞ Lemma
- For positive terms, null and divergence to +∞ are reciprocal Lemma
- Positive and negative parts: aₖ = aₖ⁺ - aₖ⁻ and |aₖ| = aₖ⁺ + aₖ⁻; a series converges absolutely iff both ∑ aₖ⁺ and ∑ aₖ⁻ converge, and for a conditionally convergent series both diverge to +∞ Lemma
- Conventions for sequences: indexing, eventually, lim, and rational ε Remark
- A real sequence converges to L ∈ ℝ iff liminf xₖ = limsup xₖ = L, and diverges to ±∞ iff both equal ±∞ Theorem
- A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum Theorem
- For a divergent series of positive terms with partial sums sₖ, the series ∑ aₖ/sₖ diverges and ∑ aₖ/sₖ² converges Theorem
- For aₖ > 0: liminf aₖ₊₁/aₖ ≤ liminf aₖ^1/k ≤ limsup aₖ^1/k ≤ limsup aₖ₊₁/aₖ Theorem
- For aₖ, bₖ > 0 with aₖ/bₖ → L: if L ∈ (0,∞) the two series share their behaviour, while L = 0 and L = ∞ give one implication each Theorem
- For pₖ ≥ 0 the product ∏ (1 + pₖ) converges iff ∑ pₖ converges, with 1 + ∑_k<n pₖ ≤ ∏_k<n(1+pₖ) ≤ 1/(1 - ∑_k<n pₖ) when ∑_k<n pₖ < 1; for 0 ≤ pₖ < 1 the product ∏ (1 - pₖ) converges iff ∑ pₖ converges and its partial products tend to 0 otherwise; and ∑ |pₖ| convergent implies ∏ (1+pₖ) convergent Theorem
- limsup(xₖ + yₖ) ≤ limsup xₖ + limsup yₖ whenever the right-hand side is defined in overlineℝ, and dually for liminf Theorem
- Stolz-Cesaro, ∞/∞ form: if bₖ is strictly increasing and unbounded and (aₖ₊₁-aₖ)/(bₖ₊₁-bₖ) → L then aₖ/bₖ → L Theorem
- The limit superior is itself a subsequential limit in overlineℝ and is the greatest one Theorem
- The Riemann series theorem: a conditionally convergent real series has, for every c ∈ ℝ, a rearrangement with sum c, and rearrangements diverging to +∞, to -∞, and oscillating with any prescribed liminf ≤ limsup in overlineℝ Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 51 results over 18 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
- J. K. Hunter, An Introduction to Real Analysis, Ch. 3 (standard reference, not scraped)
- Limit of a sequence (Wikipedia) (standard reference, not scraped)
- Extended real number line (Wikipedia) (standard reference, not scraped)
- T. Tao, Analysis I, 3rd ed., §6.1 (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)