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.
For the sequence is null, and for the sequence diverges to
Statement
Let and let be the integer power (Integer powers ).
- If then is null, that is (Limits and Cauchy sequences of reals).
- If then diverges to (Divergence to and to ).
Claim 2 is stated for and not for on purpose: for the terms alternate in sign and are unbounded, so they neither converge nor diverge to ; what is true of them is the statement about their absolute values.
Both claims come from Bernoulli's inequality (Bernoulli's inequality ) and the Archimedean property. Nothing here needs the least-upper-bound property except through Every complete ordered field is Archimedean and For every in a complete ordered field there is a natural with .
Facts & Assumptions
Given: A real , with integer powers as in Integer powers ; for , the symbol also denotes the canonical natural where it occurs in an arithmetic expression.
Absolute value: ; exactly when ; ; and when , so in particular because (Basic properties of the absolute value, Absolute value in an ordered field, The multiplicative identity is positive).
Induction principle (The principle of mathematical induction), and the recursion clauses , defining integer powers (Integer powers ).
Bernoulli's inequality: for and (Bernoulli's inequality ).
Power laws: , and when (Laws of integer exponents).
Powers and order: gives and gives ; for every (Monotonicity of and of ).
Reciprocals: gives ; gives (Inverses of positives are positive, and reciprocation reverses order); and exactly when (Reciprocals and order: against ).
Archimedean property: for every there is a natural with (Every complete ordered field is Archimedean); and for every there is a natural with (For every in a complete ordered field there is a natural with ).
Canonical naturals: for , and in gives in (Canonical naturals are positive and strictly increasing).
Multiplying inequalities of nonnegatives: and give (Multiplying inequalities of positives).
Trichotomy of the order on (Complete ordered field (least-upper-bound property), Ordered field).
Convergence to and divergence to for a sequence of reals; a rational test value is in particular a real one (Limits and Cauchy sequences of reals, Divergence to and to , Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Proof
First, for every , by induction: at both sides are , and if then .
Case zero. Assume .
Case small. Assume .
Case large. Assume .
In case zero, for every : indeed , and if then , so induction gives the claim from on.
In case small, put , which is defined since , and . Then and .
In case large, put , so and .
In case zero, for every rational and every we have , so and claim 1 holds.
In case small, , so , and .
In case small, Bernoulli applied to gives for every , using and .
In case large, Bernoulli applied to gives for every .
In case large, let be arbitrary and use [L7] to fix a natural with ; then , since multiplying by preserves the inequality.
In case small, let be rational; then , so [L7] supplies a natural with , whence on multiplying by .
In case small, combining steps 3.2 and 3.3: gives for every .
In case large, for every we have , so , the last step because .
In case small, for every we have , hence , and therefore .
In case large, an index has been produced for an arbitrary real with for all , which is exactly divergence to : claim 2 holds.
In case small, the rational was arbitrary and the index was produced from it, so and claim 1 holds.
The hypothesis of claim 1 is exhausted by cases zero and small, since with exactly when , so trichotomy leaves only ; the hypothesis of claim 2 is case large. Both claims are therefore established.
Remarks
-
The two claims are not one claim in disguise. For the sequence itself has no limiting behaviour to record when is negative: its terms alternate in sign and grow, so it neither converges nor diverges to nor to . Stating claim 2 for is what makes it true as written.
-
The boundary is excluded and is genuinely different. For the sequence is constant ; for it is the alternating sequence (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ), which is bounded and divergent (FALSE: every bounded sequence converges). So neither claim extends to , and the two cases at the boundary do not even agree with each other.
-
Where this is used. Claim 1 supplies the null sequence that makes a contractive sequence Cauchy (Every contractive sequence is Cauchy, hence converges, with error bound for ) and the null sequence that identifies the limit of the decimal truncations of (The truncated decimal approximations of form a Cauchy sequence of rationals with no rational limit ↗).
Depends on
- Integer powers $a^m$
- Laws of integer exponents
- Bernoulli's inequality $(1+x)^n \ge 1 + nx$
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- Limits and Cauchy sequences of reals
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Divergence to $+\infty$ and to $-\infty$
- Inverses of positives are positive, and reciprocation reverses order
- Basic properties of the absolute value
- Absolute value in an ordered field
- The multiplicative identity is positive
- Reciprocals and order: $1/r$ against $1$
- The principle of mathematical induction
- Multiplying inequalities of positives
- Canonical naturals are positive and strictly increasing
- Complete ordered field (least-upper-bound property)
- Ordered field
Used by
- 1/4 lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it Counterexample
- fₖ(x)=xᵏ⁺¹ converges pointwise but not uniformly on [0,1] Counterexample
- ℝ is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions Counterexample
- The truncated decimal approximations of √2 form a Cauchy sequence of rationals with no rational limit Counterexample
- A positive sequence making all three inequalities of the ratio-to-root chain strict Example
- aₖ = 2^-k + (-1)ᵏ has liminf aₖ₊₁/aₖ = 1/8, limsup aₖ₊₁/aₖ = 2 and lim aₖ^1/k = 1/2 Example
- The Cantor function is continuous and of bounded variation but not absolutely continuous Example
- The complex geometric power series has radius 1 and sums to 1/(1-z) for |z|<1 Example
- A normal sequence of entourages yields a uniformly continuous pseudometric with controlled dyadic balls Lemma
- For every real x, xᵏ/k! → 0 Lemma
- The jumps of a variation function equal the absolute jumps of the original function Lemma
- Under choice, every open cover of a metric space has a point-finite open refinement Lemma
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point Theorem
- Every contractive sequence is Cauchy, hence converges, with error bound |x - xₖ| ≤ cᵏ⁻¹|x₂ - x₁|/(1-c) for k ≥ 1 Theorem
- For |r| < 1, ∑_k ≥ 0 rᵏ = 1/(1-r), and for |r| ≥ 1 the series diverges Theorem
- Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line Theorem
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b) Theorem
- Landau's root limit: log x is the limit of 2ⁿ times (x^(1/2ⁿ) minus 1) Theorem
- The Cantor function is well defined, satisfies c(x) ≤ c(y) whenever x ≤ y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set Theorem
- The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points Theorem
- The Cantor set is exactly the set of ∑_k ≥ 1 aₖ 3⁻ᵏ with every aₖ ∈ {0,2}, and this gives a bijection with {0,1}^ℕ Theorem
- The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero Theorem
- Tietze's extension theorem, under dependent choice: a continuous map from a closed subspace of a normal space into [a,b] extends continuously to the whole space, and this property characterises normality Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 81 results over 25 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
- Geometric progression (Wikipedia) (standard reference, not scraped)
- Bernoulli's inequality (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (Thm 3.20(b)) (standard reference, not scraped)
- T. Tao, Analysis I, 3rd ed., §6.5 (Lem 6.5.2) (standard reference, not scraped)