Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

The nn-th root as a continuous inverse: for a natural n1n \ge 1 the map xxnx \mapsto x^{n} is continuous and strictly increasing on [0,)[0,\infty) with image [0,)[0,\infty), so its inverse xx1/nx \mapsto x^{1/n} is continuous and strictly increasing

Example

Let nNn \in \mathbb{N} with n1n \ge 1 and put I:=[0,)I := [0,\infty) (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and p:IRp : I \to \mathbb{R}, p(x):=xnp(x) := x^{n} (Integer powers ama^m). Then:

  1. pp is continuous on II (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point);
  2. pp is increasing on II (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R\mathbb{R}, with the dictionary to monotone sequences), hence injective (Injection, surjection, bijection);
  3. p[I]=Ip[I] = I;
  4. consequently the inverse map g:IIg : I \to I of pp is continuous on II and increasing, and g(a)=a1/ng(a) = a^{1/n} is the unique nonnegative nn-th root of aa (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).

So the nn-th root function is continuous, and it is obtained from Continuous inverse theorem: a continuous injective ff on an interval II is a bijection onto the order-convex set f[I]f[I], and the inverse g:f[I]Ig : f[I] \to I is continuous and strictly monotone in the same sense as ff rather than from a direct ε\varepsilon-δ\delta estimate.

Facts & Assumptions

Given: A natural n1n \ge 1, the order-convex set I=[0,)I = [0,\infty) and p:IRp : I \to \mathbb{R} with p(x)=xnp(x) = x^{n}.

[L2]

If 0a<b0 \le a < b and n1n \ge 1 then an<bna^{n} < b^{n}; and a0a \ge 0 gives an0a^{n} \ge 0 (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n, claims 1 and 2).

[L3]

For every real a0a \ge 0 and every natural n1n \ge 1 there is a unique real s0s \ge 0 with sn=as^{n} = a, written a1/na^{1/n} (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, Rational powers ara^r of a positive base).

Verification

technique · direct
1.1

Claim 1: pp is the restriction to II of a polynomial function, hence continuous on II.

L1
1.2

Claim 2: for 0x<y0 \le x < y one has xn<ynx^{n} < y^{n} since n1n \ge 1, so pp is increasing on II; an increasing function is injective.

L2
1.3

Claim 3: p[I]Ip[I] \subseteq I, since x0x \ge 0 gives xn0x^{n} \ge 0; and Ip[I]I \subseteq p[I], since for a0a \ge 0 the real s:=a1/n0s := a^{1/n} \ge 0 lies in II and satisfies p(s)=sn=ap(s) = s^{n} = a.

L2L3
2.1

Claim 4: II is order-convex and pp is continuous and injective on it, so by the continuous inverse theorem pp is a bijection onto the order-convex set p[I]p[I], which is II by step 1.3, and the inverse g:IIg : I \to I is continuous and strictly monotone in the same sense as pp, that is increasing.

step 1.1step 1.2step 1.3L4L5
3.1

The value g(a)g(a) is the unique s0s \ge 0 with sn=as^{n} = a, since gg inverts pp and p(s)=snp(s) = s^{n}; so g(a)=a1/ng(a) = a^{1/n} in the notation of the root theorem.

step 2.1L3

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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