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.

For a natural n1n \ge 1, the derivative of xx1/nx \mapsto x^{1/n} on (0,)(0,\infty) is 1ι(n)x1/n1\frac{1}{\iota(n)}x^{1/n - 1}, obtained from the inverse rule applied to xxnx \mapsto x^{n}; in particular (x)=1/(ι(2)x)(\sqrt{x})' = 1/(\iota(2)\sqrt{x})

Example

Let nNn \in \mathbb{N} with n1n \ge 1, let ι\iota be the canonical natural of The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, and let rational powers be those of Rational powers ara^r of a positive base, so that u1/nu^{1/n} is the unique nonnegative nn-th root of uu (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).

Claim. The function

g:(0,)R,g(u):=u1/n,g : (0,\infty) \to \mathbb{R}, \qquad g(u) := u^{1/n},

is differentiable at every b(0,)b \in (0,\infty) (The derivative f(c)=limxcf(x)f(c)xcf'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c} of f:ARf : A \to \mathbb{R} at a point cAc \in A that is a limit point of AA, and differentiability on a set), and

g(b)  =  1ι(n)  b1/n1.g'(b) \;=\; \frac{1}{\iota(n)}\; b^{\,1/n - 1} .

In particular at n=2n = 2, writing u=u1/2\sqrt{u} = u^{1/2},

g(b)  =  1ι(2)b1/2  =  1ι(2)b.g'(b) \;=\; \frac{1}{\iota(2)}\,b^{-1/2} \;=\; \frac{1}{\iota(2)\sqrt{b}} .

The domain is (0,)(0,\infty) and not [0,)[0,\infty), and the reason depends on nn. For n2n \ge 2 the exponent 1/n11/n - 1 is a negative rational, and Rational powers ara^r of a positive base leaves 0r0^{r} undefined for rational r<0r < 0, so at b=0b = 0 the displayed formula is not a statement at all; and the root really is not differentiable there, by claim 2 of Derivative of an inverse: if ff is continuous and injective on a nondegenerate interval II and differentiable at cIc \in I with f(c)0f'(c) \ne 0, then the inverse gg is differentiable at f(c)f(c) with g(f(c))=1/f(c)g'(f(c)) = 1/f'(c); and if f(c)=0f'(c) = 0 then gg is not differentiable at f(c)f(c) applied on [0,)[0,\infty), since xxnx \mapsto x^{n} has derivative ι(n)0n1=0\iota(n)\,0^{\,n-1} = 0 at 00 for n2n \ge 2 (For a natural n1n \ge 1 the function xxnx \mapsto x^{n} is differentiable everywhere with derivative ι(n)xn1\iota(n)\,x^{\,n-1}; for n=0n = 0 it is the constant 11, with derivative 00; for a natural n1n \ge 1 the function xxnx \mapsto x^{-n} is differentiable at every x0x \ne 0 with derivative ι(n)xn1-\iota(n)\,x^{-n-1}; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Integer powers ama^m). At n=1n = 1 neither obstruction arises: the exponent 1/n11/n - 1 is 00, not negative; u1/1=uu^{1/1} = u is the identity (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); and the formula reads g(b)=b0=1g'(b) = b^{0} = 1, which is correct at every real. So for n=1n = 1 the restriction to (0,)(0,\infty) is a convenience of the uniform statement rather than a necessity. Nothing below asserts anything about the root at 00 in either case.

Facts & Assumptions

Given: A natural n1n \ge 1, the set I:=(0,)I := (0,\infty), the function f:IRf : I \to \mathbb{R}, f(x):=xnf(x) := x^{n}, and the function g:IRg : I \to \mathbb{R}, g(u):=u1/ng(u) := u^{1/n}.

[L1]

Roots (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): 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}; and a1/n>0a^{1/n} > 0 when a>0a > 0. By Rational powers ara^r of a positive base the rational power a1/na^{1/n} is that same number.

[L2]

Rational power laws (Laws of rational exponents): for a>0a > 0 and rationals r,sr, s one has ar>0a^{r} > 0, (ar)s=ars(a^{r})^{s} = a^{rs}, ar+s=arasa^{r+s} = a^{r}a^{s} and ar=1/ara^{-r} = 1/a^{r}; and rational powers extend integer powers on positive bases (Rational powers ara^r of a positive base, Integer powers ama^m).

[L3]

Monotonicity of integer powers (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n): for a natural n1n \ge 1 the map xxnx \mapsto x^{n} is strictly increasing on {x0}\{x \ge 0\}, hence injective there (claim 2); and x>0x > 0 implies xn>0x^{n} > 0 (claim 1).

[L6]

Derivative of an inverse (Derivative of an inverse: if ff is continuous and injective on a nondegenerate interval II and differentiable at cIc \in I with f(c)0f'(c) \ne 0, then the inverse gg is differentiable at f(c)f(c) with g(f(c))=1/f(c)g'(f(c)) = 1/f'(c); and if f(c)=0f'(c) = 0 then gg is not differentiable at f(c)f(c), claim 1): for II order-convex with at least two elements and f:IRf : I \to \mathbb{R} continuous and injective with inverse g:f[I]Ig : f[I] \to I, if ff is differentiable at cIc \in I with f(c)0f'(c) \ne 0 then gg is differentiable at f(c)f(c) with g(f(c))=1/f(c)g'(f(c)) = 1/f'(c).

[L7]

Verification

technique · direct
1.1

I=(0,)I = (0,\infty) is order-convex with at least two elements, and every point of II is a limit point of II.

L8
1.2

ff is injective on II by [L3], continuous on II by [L4], and takes only positive values by [L3].

L3L4
1.3

f[I]=If[I] = I. For xIx \in I one has f(x)=xn>0f(x) = x^{n} > 0 by [L3], so f[I]If[I] \subseteq I; and for uIu \in I the number u1/nu^{1/n} is positive by [L1], hence lies in II, and f(u1/n)=(u1/n)n=uf(u^{1/n}) = (u^{1/n})^{n} = u by [L1], so uf[I]u \in f[I].

L1L3
2.1

The map g:IIg : I \to I, uu1/nu \mapsto u^{1/n}, is the inverse of f:If[I]=If : I \to f[I] = I. By [L7] and step 1.2 that bijection has a unique two-sided inverse; by step 1.3 the map gg takes values in II and satisfies f(g(u))=uf(g(u)) = u for every uIu \in I, so it is a right inverse of the bijection and therefore is that unique inverse.

step 1.2step 1.3L1L7
2.2

ff is differentiable at every cIc \in I with f(c)=ι(n)cn1f'(c) = \iota(n)c^{\,n-1}, by [L5] together with step 1.1; and f(c)0f'(c) \ne 0, since ι(n)>0\iota(n) > 0 by [L8] and cn1>0c^{\,n-1} > 0 by [L3] as c>0c > 0.

step 1.1L3L5L8
3.1

Let bIb \in I and put c:=b1/nc := b^{1/n}, an element of II by [L1], with f(c)=bf(c) = b by [L1]. By step 1.2, step 2.2 and [L6], applied on II at cc, the inverse gg is differentiable at b=f(c)b = f(c) with g(b)=1/f(c)=1/(ι(n)cn1)g'(b) = 1/f'(c) = 1/\bigl(\iota(n)\,c^{\,n-1}\bigr).

step 2.1step 2.2L1L6
4.1

Rewriting in terms of bb: since c=b1/nc = b^{1/n} and n1n - 1 is a natural, [L2] gives cn1=(b1/n)n1=b(n1)/n=b11/nc^{\,n-1} = \bigl(b^{1/n}\bigr)^{\,n-1} = b^{\,(n-1)/n} = b^{\,1 - 1/n}, a positive real. Hence g(b)=1/(ι(n)b11/n)=1ι(n)b(11/n)=1ι(n)b1/n1g'(b) = 1/\bigl(\iota(n)\,b^{\,1-1/n}\bigr) = \frac{1}{\iota(n)}\,b^{-(1-1/n)} = \frac{1}{\iota(n)}\,b^{\,1/n - 1}, using ar=1/ara^{-r} = 1/a^{r} from [L2] and ι(n)0\iota(n) \ne 0 from [L8].

step 3.1L2L8
5.1

At n=2n = 2 the map gg is uu1/2=uu \mapsto u^{1/2} = \sqrt{u}, and step 4.1 reads g(b)=1ι(2)b1/21=1ι(2)b1/2=1ι(2)bg'(b) = \frac{1}{\iota(2)}b^{\,1/2 - 1} = \frac{1}{\iota(2)}b^{-1/2} = \frac{1}{\iota(2)\sqrt{b}}, again by [L2].

step 4.1L2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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