Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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 r<1|r| < 1 the sequence rkr^k is null, and for r>1|r| > 1 the sequence rk|r|^k diverges to ++\infty

Statement

Let rRr \in \mathbb{R} and let rkr^k be the integer power (Integer powers ama^m).

  1. If r<1|r| < 1 then (rk)(r^k) is null, that is rk0r^k \to 0 (Limits and Cauchy sequences of reals).
  2. If r>1|r| > 1 then (rk)(|r|^k) diverges to ++\infty (Divergence to ++\infty and to -\infty).

Claim 2 is stated for rk|r|^k and not for rkr^k on purpose: for r<1r < -1 the terms rkr^k alternate in sign and are unbounded, so they neither converge nor diverge to ++\infty; what is true of them is the statement about their absolute values.

Both claims come from Bernoulli's inequality (Bernoulli's inequality (1+x)n1+nx(1+x)^n \ge 1 + nx) and the Archimedean property. Nothing here needs the least-upper-bound property except through Every complete ordered field is Archimedean and For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon.

Facts & Assumptions

Given: A real rr, with integer powers as in Integer powers ama^m; for nNn \in \mathbb{N}, the symbol nn also denotes the canonical natural n1Rn \cdot 1_{\mathbb{R}} where it occurs in an arithmetic expression.

[L1]

Absolute value: x0|x| \ge 0; x=0|x| = 0 exactly when x=0x = 0; xy=xy|xy| = |x|\,|y|; and x=x|x| = x when x0x \ge 0, so in particular 1=1|1| = 1 because 1>01 > 0 (Basic properties of the absolute value, Absolute value in an ordered field, The multiplicative identity is positive).

[L2]

Induction principle (The principle of mathematical induction), and the recursion clauses a0=1a^0 = 1, ak+1=akaa^{k+1} = a^k a defining integer powers (Integer powers ama^m).

[L3]

Bernoulli's inequality: (1+x)n1+nx(1+x)^n \ge 1 + nx for x1x \ge -1 and nNn \in \mathbb{N} (Bernoulli's inequality (1+x)n1+nx(1+x)^n \ge 1 + nx).

[L4]

Power laws: (ab)n=anbn(ab)^n = a^n b^n, and an0a^n \ne 0 when a0a \ne 0 (Laws of integer exponents).

[L5]

Powers and order: a0a \ge 0 gives an0a^n \ge 0 and a>0a > 0 gives an>0a^n > 0; 1n=11^n = 1 for every nn (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n).

[L6]

Reciprocals: a>0a > 0 gives a1>0a^{-1} > 0; 0<a<b0 < a < b gives 0<b1<a10 < b^{-1} < a^{-1} (Inverses of positives are positive, and reciprocation reverses order); and 0<t<10 < t < 1 exactly when 1/t>11/t > 1 (Reciprocals and order: 1/r1/r against 11).

[L7]

Archimedean property: for every xRx \in \mathbb{R} there is a natural n1n \ge 1 with x<nx < n (Every complete ordered field is Archimedean); and for every ε>0\varepsilon > 0 there is a natural N1N \ge 1 with 1/N<ε1/N < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon).

[L8]

Canonical naturals: n>0n > 0 for n1n \ge 1, and mnm \le n in N\mathbb{N} gives mnm \le n in R\mathbb{R} (Canonical naturals are positive and strictly increasing).

[L9]

Multiplying inequalities of nonnegatives: 0ab0 \le a \le b and 0cd0 \le c \le d give acbdac \le bd (Multiplying inequalities of positives).

[L10]

Trichotomy of the order on R\mathbb{R} (Complete ordered field (least-upper-bound property), Ordered field).

[L11]

Convergence to 00 and divergence to ++\infty for a sequence of reals; a rational test value ε>0\varepsilon > 0 is in particular a real one (Limits and Cauchy sequences of reals, Divergence to ++\infty and to -\infty, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Proof

technique · cases
1.1

First, rk=rk|r^k| = |r|^k for every kNk \in \mathbb{N}, by induction: at k=0k = 0 both sides are 1=1|1| = 1, and if rk=rk|r^k| = |r|^k then rk+1=rkr=rkr=rkr=rk+1|r^{k+1}| = |r^k r| = |r^k|\,|r| = |r|^k |r| = |r|^{k+1}.

givenL1L2
1.2

Case zero. Assume r=0r = 0.

givenassume-case zero
1.3

Case small. Assume 0<r<10 < |r| < 1.

givenassume-case small
1.4

Case large. Assume r>1|r| > 1.

givenassume-case large
2.1

In case zero, rk=0r^k = 0 for every k1k \ge 1: indeed r1=r0r=10=0r^1 = r^0 r = 1 \cdot 0 = 0, and if rk=0r^k = 0 then rk+1=rkr=0r^{k+1} = r^k r = 0, so induction gives the claim from k=1k = 1 on.

step 1.2L2
2.2

In case small, put s:=1/rs := 1/|r|, which is defined since r0|r| \ne 0, and h:=s1h := s - 1. Then s>1s > 1 and h>0h > 0.

step 1.3L1L6choose
2.3

In case large, put h:=r1h' := |r| - 1, so h>0h' > 0 and r=1+h|r| = 1 + h'.

step 1.4choose
3.1

In case zero, for every rational ε>0\varepsilon > 0 and every k1k \ge 1 we have rk0=0=0<ε|r^k - 0| = |0| = 0 < \varepsilon, so rk0r^k \to 0 and claim 1 holds.

step 2.1L1L11
3.2

In case small, rksk=(rs)k=1k=1|r|^k s^k = (|r| s)^k = 1^k = 1, so rk=1/sk|r|^k = 1/s^k, and sk>0s^k > 0.

step 2.2L4L5
3.3

In case small, Bernoulli applied to h>01h > 0 \ge -1 gives sk=(1+h)k1+kh>kh>0s^k = (1+h)^k \ge 1 + kh > kh > 0 for every k1k \ge 1, using 1>01 > 0 and kh>0kh > 0.

step 2.2L3L8L9
3.4

In case large, Bernoulli applied to h>01h' > 0 \ge -1 gives rk=(1+h)k1+kh|r|^k = (1 + h')^k \ge 1 + k h' for every kNk \in \mathbb{N}.

step 2.3L3
3.5

In case large, let MRM \in \mathbb{R} be arbitrary and use [L7] to fix a natural n1n \ge 1 with M/h<nM/h' < n; then MnhM \le n h', since multiplying M/hnM/h' \le n by h>0h' > 0 preserves the inequality.

step 2.3L7L9choose
3.6

In case small, let ε>0\varepsilon > 0 be rational; then εh>0\varepsilon h > 0, so [L7] supplies a natural N1N \ge 1 with 1/N<εh1/N < \varepsilon h, whence 1/(Nh)ε1/(Nh) \le \varepsilon on multiplying by 1/h>01/h > 0.

step 2.2L6L7L9choose
4.1

In case small, combining steps 3.2 and 3.3: 0<kh<sk0 < kh < s^k gives rk=1/sk<1/(kh)|r|^k = 1/s^k < 1/(kh) for every k1k \ge 1.

step 3.2step 3.3L6
4.2

In case large, for every knk \ge n we have khnhMk h' \ge n h' \ge M, so rk1+kh1+M>M|r|^k \ge 1 + k h' \ge 1 + M > M, the last step because 1>01 > 0.

step 3.4step 3.5L1L8L9
5.1

In case small, for every kNk \ge N we have khNh>0kh \ge Nh > 0, hence 1/(kh)1/(Nh)ε1/(kh) \le 1/(Nh) \le \varepsilon, and therefore rk0=rk=rk<1/(kh)ε|r^k - 0| = |r^k| = |r|^k < 1/(kh) \le \varepsilon.

step 1.1step 4.1step 3.6L6L8L9
5.2

In case large, an index nn has been produced for an arbitrary real MM with rk>M|r|^k > M for all knk \ge n, which is exactly divergence to ++\infty: claim 2 holds.

step 4.2L11
6.1

In case small, the rational ε>0\varepsilon > 0 was arbitrary and the index NN was produced from it, so rk0r^k \to 0 and claim 1 holds.

step 5.1L11
7.1

The hypothesis r<1|r| < 1 of claim 1 is exhausted by cases zero and small, since r0|r| \ge 0 with r=0|r| = 0 exactly when r=0r = 0, so trichotomy leaves only 0<r<10 < |r| < 1; the hypothesis r>1|r| > 1 of claim 2 is case large. Both claims are therefore established.

step 3.1step 5.2step 6.1L1L10cases: zero small or largecases-exhaustive

Remarks

Depends on

Used by

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