LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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 every $a > 0$ , $a^{1 / n} \to 1$

Statement

Let $a \in R$ with $a > 0$ , write $ι (n) : = n \cdot 1_{R}$ for the canonical natural (Canonical naturals are positive and strictly increasing) and $a^{1 / n}$ for the $n$ -th root (Existence and uniqueness of $n$ -th roots: a unique $a^{1 / n} \geq 0$ with $(a^{1 / n})^{n} = a$ , Rational powers $a^{r}$ of a positive base), defined for naturals $n \geq 1$ . Then:

for every real $b \geq 1$ and every natural $n \geq 1$ , $1 \leq b^{1 / n} \leq 1 + \frac{b - 1}{ι (n)};$
the sequence $c_{k} : = a^{1 / (k + 1)}$ , $k \in N$ , converges to $1$ (Limits and Cauchy sequences of reals).

Index range. As for the previous lemma on this page, $a^{1 / n}$ requires $n \geq 1$ , so the sequence indexed by $N$ (Sequences of reals: bounded, eventually, frequently, tails, subsequences) is the shifted family $a^{1 / (k + 1)}$ ; it is the classical family $a^{1 / n}$ , $n \geq 1$ , reindexed by $n = k + 1$ .

Facts & Assumptions

Given: A real $a > 0$ ; the canonical naturals $ι (n) = n \cdot 1_{R}$ for $n \geq 1$ ; and the sequence $c_{k} : = a^{1 / (k + 1)}$ .

[L1]

Roots: for real $x \geq 0$ and natural $n \geq 1$ there is a unique real $s \geq 0$ with $s^{n} = x$ , written $x^{1 / n}$ ; it is $> 0$ when $x > 0$ , and $1^{1 / n} = 1$ by uniqueness (Existence and uniqueness of $n$ -th roots: a unique $a^{1 / n} \geq 0$ with $(a^{1 / n})^{n} = a$ , Integer powers $a^{m}$ ).

[L2]

Rational powers: $x^{1 / n}$ is the rational power at exponent $1 / n$ ; for rational $t > 0$ , $x > 1$ implies $x^{t} > 1$ ; and $(x y)^{1 / n} = x^{1 / n} y^{1 / n}$ for $x, y > 0$ (Rational powers $a^{r}$ of a positive base, Monotonicity of $r \mapsto a^{r}$ and of $a \mapsto a^{r}$ , Laws of rational exponents).

[L3]

Bernoulli's inequality: $(1 + x)^{n} \geq 1 + ι (n) x$ for $x \geq - 1$ and $n \in N$ (Bernoulli's inequality $(1 + x)^{n} \geq 1 + n x$ ).

[L4]

Canonical naturals: $ι (n) > 0$ and invertible for $n \geq 1$ , and $ι$ is strictly increasing (Canonical naturals are positive and strictly increasing, Order on the natural numbers, $\leq$ is a linear order on $N$ ).

[L5]

Reciprocal Archimedean property: for every real $η > 0$ there is a natural $p \geq 1$ with $1 / p < η$ ; and $0 < x < y$ gives $0 < 1 / y < 1 / x$ (For every $ε > 0$ in a complete ordered field there is a natural $n \geq 1$ with $1 / n < ε$ , Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

[L6]

Order arithmetic: inequalities may be added and translated, and multiplying an inequality by a positive element preserves it; the order is total, so exactly one of $a < 1$ , $a = 1$ , $a > 1$ holds (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)).

[L7]

Squeeze theorem; a constant sequence converges to its value; to establish convergence it suffices to produce a threshold for every real $ε > 0$ (The squeeze theorem, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals).

[L8]

Algebra of limits, reciprocal rule: if $z_{j} \to z$ with $z \neq 0$ and $z_{j} \neq 0$ for every $j$ , then $1 / z_{j} \to 1 / z$ (Algebra of limits: sums, scalar multiples, products and quotients).

Proof

technique · cases

1.1

Let $b$ be any real with $b \geq 1$ and let $n \geq 1$ be a natural. If $b = 1$ then $b^{1 / n} = 1$ and both inequalities hold. If $b > 1$ then $1 / n$ is a positive rational, so $t : = b^{1 / n} - 1 > 0$ ; Bernoulli's inequality applied to $t \geq - 1$ gives $b = (b^{1 / n})^{n} = (1 + t)^{n} \geq 1 + ι (n) t$ , hence $ι (n) t \leq b - 1$ and $t \leq (b - 1) / ι (n)$ since $ι (n) > 0$ . In both cases $1 \leq b^{1 / n} \leq 1 + (b - 1) / ι (n)$ , which is claim 1.

givenL1L2L3L4L6

1.2

Case one: $a = 1$ .

givenassume-case one

1.3

Case big: $a > 1$ .

givenassume-case big

1.4

Case small: $0 < a < 1$ .

givenassume-case small

2.1

For every real $b > 1$ the sequence $b^{1 / (k + 1)}$ converges to $1$ . Put $d_{k} : = 1 + (b - 1) / ι (k + 1)$ . Given a real $ε > 0$ , the quotient $ε / (b - 1)$ is positive, so there is a natural $p \geq 1$ with $1 / p < ε / (b - 1)$ ; for $k \geq p$ we have $k + 1 > p$ , hence $ι (k + 1) > ι (p) > 0$ and $0 < (b - 1) / ι (k + 1) < (b - 1) (1 / p) < ε$ , so $∣ d_{k} - 1 ∣ < ε$ and $d_{k} \to 1$ . By step 1.1 applied at $n = k + 1$ we have $1 \leq b^{1 / (k + 1)} \leq d_{k}$ for every $k$ , and the constant sequence $1$ converges to $1$ , so the squeeze theorem gives $b^{1 / (k + 1)} \to 1$ .

step 1.1L4L5L6L7

2.2

In case one, $c_{k} = 1^{1 / (k + 1)} = 1$ for every $k$ , so $(c_{k})$ is the constant sequence $1$ and converges to $1$ .

step 1.2L1L7

3.1

In case big, $a > 1$ , so step 2.1 applied with $b = a$ gives $c_{k} = a^{1 / (k + 1)} \to 1$ .

step 2.1step 1.3

3.2

In case small, put $a^{'} : = 1 / a$ , which satisfies $a^{'} > 1$ because $0 < a < 1$ . For each natural $n \geq 1$ the product rule for roots gives $a^{1 / n} (a^{'})^{1 / n} = (a a^{'})^{1 / n} = 1^{1 / n} = 1$ , so $a^{1 / n} = 1 / (a^{'})^{1 / n}$ , and $(a^{'})^{1 / n} > 0$ . By step 2.1 the sequence $(a^{'})^{1 / (k + 1)}$ converges to $1 \neq 0$ with all terms nonzero, so the reciprocal rule gives $c_{k} = 1 / (a^{'})^{1 / (k + 1)} \to 1 / 1 = 1$ .

step 2.1step 1.4L1L2L5L8

4.1

The three cases are exhaustive by trichotomy applied to $a$ and $1$ , the hypothesis $a > 0$ excluding nothing else, and in each of them $(c_{k})$ converges to $1$ ; together with step 1.1 this proves both claims.

step 2.2step 3.1step 3.2step 1.1L6cases: trichotomy of the ordercases-exhaustive∎

Remarks

Bernoulli is doing the whole job in the case $a > 1$ . The inequality $(1 + t)^{n} \geq 1 + n t$ converts the exact identity $(a^{1 / n})^{n} = a$ into the linear bound $t \leq (a - 1) / n$ on the excess $t = a^{1 / n} - 1$ , and that bound is what tends to $0$ . No estimate on $a^{1 / n}$ itself is needed beyond $a^{1 / n} > 1$ .
The case $0 < a < 1$ is not symmetric to the case $a > 1$ and is not proved again. It is transported by the reciprocal, using $a^{1 / n} (1 / a)^{1 / n} = 1$ (Laws of rational exponents) and the reciprocal rule of Algebra of limits: sums, scalar multiples, products and quotients. The hypothesis of that rule, that the limit be nonzero and every term nonzero, is met because roots of positive reals are positive.
The rate is different from the one in $n^{1 / n} \to 1$ . Here the excess is $O (1 / n)$ with a constant depending on $a$ ; there the base itself grows with $n$ and the excess is only $O (1 / n^{1 / 2})$ . The two lemmas are therefore not instances of one another in either direction.

Depends on

Used by

Dependency tree · two levels

65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Nth root (Wikipedia) (standard reference, not scraped)
Bernoulli's inequality (Wikipedia) (standard reference, not scraped)
W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (3.20) (standard reference, not scraped)
T. Tao, Analysis I, 3rd ed., §6.5 (standard reference, not scraped)
MIT 18.100B, Fall 2011, Problem Set 1 solutions (standard reference, not scraped)
N. Donaldson, Math 140A: Real Analysis notes (standard reference, not scraped)

For every a>0a>0, a1/n→1a1/n→1