Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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.

Existence and uniqueness of nn-th roots: a unique a1/n0a^{1/n} \ge 0 with (a1/n)n=a(a^{1/n})^n = a

Statement

Let R\mathbb{R} be a complete ordered field (Complete ordered field (least-upper-bound property)). For every aRa \in \mathbb{R} with a0a \ge 0 and every nNn \in \mathbb{N} with n1n \ge 1 there is a unique sRs \in \mathbb{R} with s0s \ge 0 and sn=as^n = a (Integer powers ama^m); we write

s=a1/n=an.s = a^{1/n} = \sqrt[n]{a}.

Moreover a1/n>0a^{1/n} > 0 when a>0a > 0, and a1/1=aa^{1/1} = a.

This generalises the published Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}, and the case n=2n = 2 is not new. That theorem already produces the unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a, and it is cited as such throughout the library; the notation a1/2a^{1/2} introduced here is the same number. What is new is the passage to general nn: the completed square that drives the n=2n = 2 argument has no direct analogue, and its place is taken by the factorisation of bnanb^n - a^n and the resulting Lipschitz estimate (Factorisation of bnanb^n - a^n, and the resulting Lipschitz estimate).

Facts & Assumptions

Given: A complete ordered field R\mathbb{R} (Complete ordered field (least-upper-bound property)), that is, an ordered field (Ordered field) with the least-upper-bound property; an element a0a \ge 0; and a natural n1n \ge 1, with ι(n)R\iota(n) \in \mathbb{R} written nn (Canonical naturals are positive and strictly increasing, The unique embedding of ℚ into an ordered field).

[L1]

Least-upper-bound property: every nonempty subset of R\mathbb{R} that is bounded above (Lower bound, bounded below, bounded set) has a least upper bound, and it is unique, so the notation supS\sup S is legitimate (Complete ordered field (least-upper-bound property), Suprema and infima are unique).

[L2]

Epsilon characterisation of the supremum: if SS is nonempty and bounded above and u=supSu = \sup S, then for every ε>0\varepsilon > 0 there is tSt \in S with uε<tu - \varepsilon < t (Epsilon characterisation of the supremum).

[L3]

Monotonicity of powers (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n): xxnx \mapsto x^n is strictly increasing on {x0}\{x \ge 0\} for n1n \ge 1, hence injective there; x0x \ge 0 implies xn0x^n \ge 0 and x>0x > 0 implies xn>0x^n > 0; and x1x \ge 1 implies xnxx^n \ge x.

[L4]

Lipschitz estimate (Factorisation of bnanb^n - a^n, and the resulting Lipschitz estimate): if 0xyB0 \le x \le y \le B and n1n \ge 1 then 0ynxnnBn1(yx)0 \le y^n - x^n \le n B^{\,n-1}(y - x).

[L5]

Order arithmetic: adding a constant preserves the order and for c>0c > 0, x<y    cx<cyx < y \iff cx < cy (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication), both stated there for the STRICT order alone, so where a \le is added or scaled below the move is that statement together with the case of equality, settled by trichotomy (Ordered field); 1>01 > 0, which is proved in The multiplicative identity is positive and stated by none of those three, hence 2=1+1>02 = 1 + 1 > 0; and 0<21<10 < 2^{-1} < 1, since 0<1<20 < 1 < 2 gives 0<21<11=10 < 2^{-1} < 1^{-1} = 1 (Inverses of positives are positive, and reciprocation reverses order, claim 2).

[L6]

Trichotomy: for x,yRx, y \in \mathbb{R} exactly one of x<yx < y, x=yx = y, y<xy < x holds; consequently any two elements have a minimum (Ordered field).

[L7]

A product with a zero factor vanishes: 0x=x0=00 \cdot x = x \cdot 0 = 0 (Multiplication by zero: 0a=00 \cdot a = 0).

Proof

technique · contradiction
1.1

If a=0a = 0 then s=0s = 0 satisfies s0s \ge 0 and sn=0=as^n = 0 = a, since 0n=0n10=00^n = 0^{n-1} \cdot 0 = 0 for n1n \ge 1; so existence holds in that case and we assume a>0a > 0 from here on.

givenL3L7algebra
1.2

Uniqueness holds as soon as a root exists: if u,v0u, v \ge 0 satisfy un=vnu^n = v^n, then strict monotonicity of xxnx \mapsto x^n on the nonnegatives rules out both u<vu < v and v<uv < u, so u=vu = v by trichotomy.

L3L6
1.3

Define S={tR:t0 and tna}S = \{t \in \mathbb{R} : t \ge 0 \text{ and } t^n \le a\}; then 0S0 \in S, because 000 \ge 0 and 0n=0a0^n = 0 \le a, so SS is nonempty.

givenL3L7
1.4

The element M:=1+aM := 1 + a is an upper bound of SS: since a>0a > 0 and 1>01 > 0 we have M>1M > 1 and M>aM > a, so any t>Mt > M satisfies t>1t > 1, whence tnt>M>at^n \ge t > M > a and tSt \notin S.

givenL3L5
2.1

By the least-upper-bound property s:=supSs := \sup S exists in R\mathbb{R}; moreover s0s \ge 0 because 0S0 \in S, and sMs \le M because MM is an upper bound and ss is the least one.

L1step 1.3step 1.4
3.1

Put B:=M+1=a+2B := M + 1 = a + 2; then B>M1>0B > M \ge 1 > 0, so Bn1>0B^{\,n-1} > 0 and nBn1>0n B^{\,n-1} > 0, and every xx with 0xM+10 \le x \le M + 1 satisfies 0xB0 \le x \le B.

step 2.1L3L5
3.2

Assume, for contradiction, that snas^n \ne a; by trichotomy either sn<as^n < a or sn>as^n > a.

assume-contrastep 2.1L6
4.1

(Case sn<as^n < a.) Put δ:=min{1,(asn)(nBn1)1}\delta := \min\{1, (a - s^n)(n B^{\,n-1})^{-1}\}, which is >0> 0 since asn>0a - s^n > 0 and nBn1>0n B^{\,n-1} > 0, and put h:=21δh := 2^{-1}\delta, so that 0<h<δ10 < h < \delta \le 1 and h<(asn)(nBn1)1h < (a - s^n)(nB^{\,n-1})^{-1}; then 0ss+hM+1=B0 \le s \le s + h \le M + 1 = B, so the Lipschitz estimate gives (s+h)nsnnBn1h<asn(s+h)^n - s^n \le nB^{\,n-1} h < a - s^n, hence (s+h)n<a(s+h)^n < a and s+hSs + h \in S, while s+h>ss + h > s contradicts that ss is an upper bound of SS.

assume-case lowstep 3.2step 2.1step 3.1L4L5L6choose
4.2

(Case sn>as^n > a.) Here s>0s > 0, since s=0s = 0 would give sn=0as^n = 0 \le a; put δ:=min{s,(sna)(nBn1)1}>0\delta := \min\{s, (s^n - a)(nB^{\,n-1})^{-1}\} > 0 and h:=21δh := 2^{-1}\delta, so that 0<h<s0 < h < s and h<(sna)(nBn1)1h < (s^n - a)(nB^{\,n-1})^{-1}; then 0shsB0 \le s - h \le s \le B, so the Lipschitz estimate gives sn(sh)nnBn1h<snas^n - (s-h)^n \le nB^{\,n-1}h < s^n - a, hence (sh)n>a(s-h)^n > a; applying the epsilon characterisation with ε=h\varepsilon = h produces tSt \in S with t>sh0t > s - h \ge 0, whence tn>(sh)n>at^n > (s-h)^n > a by strict monotonicity, contradicting tSt \in S.

assume-case highstep 3.2step 2.1step 3.1L2L3L4L5L6L7choose
5.1

Both cases of the disjunction in step 3.2 are impossible, so the assumption fails and sn=as^n = a; this ss is the unique nonnegative nn-th root of aa by step 1.2, it satisfies s>0s > 0 when a>0a > 0 because s=0s = 0 would force a=sn=0a = s^n = 0, and at n=1n = 1 the element aa itself is a nonnegative solution of s1=as^1 = a, so a1/1=aa^{1/1} = a; writing a1/n=ana^{1/n} = \sqrt[n]{a} for it, the case n=2n = 2 recovers the already published a\sqrt{a} of Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}.

step 4.1step 4.2step 3.2step 1.2step 1.1L3L7casesdischarge-contradiction

Depends on

Used by

…and 8 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 63 results over 17 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