Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 n-th root as a continuous inverse: for a natural n≥1 the map x↦xn is continuous and strictly increasing on [0,∞) with image [0,∞), so its inverse x↦x1/n is continuous and strictly increasing

Example

Facts & Assumptions

Given: A natural n≥1, the order-convex set I=[0,∞) and p:I→R with p(x)=xn.

[L2]

If 0≤a<b and n≥1 then an<bn; and a≥0 gives an≥0 (Monotonicity of x↦xn and of n↦an, claims 1 and 2).

[L3]

For every real a≥0 and every natural n≥1 there is a unique real s≥0 with sn=a, written a1/n (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a, Rational powers ar of a positive base).

Verification

technique · direct
1.1

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

L1
1.2

Claim 2: for 0≤x<y one has xn<yn since n≥1, so p is increasing on I; an increasing function is injective.

L2
1.3

Claim 3: p[I]⊆I, since x≥0 gives xn≥0; and I⊆p[I], since for a≥0 the real s:=a1/n≥0 lies in I and satisfies p(s)=sn=a.

L2L3
2.1

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

step 1.1step 1.2step 1.3L4L5
3.1

The value g(a) is the unique s≥0 with sn=a, since g inverts p and p(s)=sn; so g(a)=a1/n in the notation of the root theorem.

step 2.1L3∎

Remarks

  • Why n≥1. At n=0 the map x↦x0 is constantly 1 (Integer powers am), so it is neither injective nor surjective onto [0,∞), and no inverse exists. Every claim above is stated for n≥1 and the hypothesis is used in step 1.2.

  • Why the domain is [0,∞) and not R. For even n the map x↦xn is not injective on R, since (−x)n=xn, so the continuous inverse theorem does not apply there; restricting to the nonnegative reals is what makes it injective, and it is also where Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a provides the roots.

  • What is gained over the root theorem alone. Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a produces the number a1/n for each a separately and says nothing about how it varies with a. Claim 4 is the statement that a↦a1/n is a continuous increasing function, and it comes from the structure of the situation rather than from any estimate on roots.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

61 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