Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 intermediate value theorem gives a second proof that every nonnegative real has an nn-th root, applied to xnx^n on a closed bounded interval

Example

Let aRa \in \mathbb{R} with a0a \ge 0 and let nNn \in \mathbb{N} with n1n \ge 1. Put M:=a+1M := a + 1 and consider

f:[0,M]R,f(x):=xnf : [0, M] \to \mathbb{R}, \qquad f(x) := x^{n}

(Integer powers ama^m, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Then ff is continuous on [0,M][0,M], f(0)=0aMn=f(M)f(0) = 0 \le a \le M^{n} = f(M), and the intermediate value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b][a,b] takes every value between f(a)f(a) and f(b)f(b)) supplies c[0,M]c \in [0,M] with

cn=a.c^{n} = a .

Moreover cc is the only nonnegative real with this property, so c=a1/nc = a^{1/n} in the notation of 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.

This is a second proof of an existing theorem, not a new one. 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 already proves existence and uniqueness of nn-th roots, by an argument that runs directly from the least-upper-bound property and the factorisation of bnanb^{n} - a^{n}; it is the item the rest of the library cites, and no second identifier is minted for the same statement. What is recorded here is that the intermediate value theorem gives the existence half in three lines once continuity of xxnx \mapsto x^{n} is available, which is the standard modern route and the reason the theorem is usually met in this form.

No circularity. Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b][a,b] takes every value between f(a)f(a) and f(b)f(b) rests on A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 00, on the algebra of continuous functions and on the sequential criterion, none of which uses nn-th roots; and the uniqueness half below is Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n, which is pure ordered-field arithmetic. So this argument could have been the library's definition of a1/na^{1/n}; it is not, only because the roots were needed at order 1616, long before continuity existed.

Facts & Assumptions

Given: A real a0a \ge 0, a natural n1n \ge 1, and M:=a+1M := a + 1; the function f(x)=xnf(x) = x^{n} on [0,M][0,M].

[L2]

Intermediate value theorem: for uvu \le v, a function continuous on [u,v][u,v] takes every value between f(u)f(u) and f(v)f(v) (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b][a,b] takes every value between f(a)f(a) and f(b)f(b)).

[L3]

Powers and order: 0n=00^{n} = 0 for n1n \ge 1; if t1t \ge 1 and n1n \ge 1 then tntt^{n} \ge t; and xxnx \mapsto x^{n} is strictly increasing on the nonnegative reals for n1n \ge 1, hence injective there (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n, Integer powers ama^m).

[L4]

Existence and uniqueness of nn-th roots: for a0a \ge 0 and n1n \ge 1 there is a unique 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).

[L5]

Ordered-field arithmetic: a0a \ge 0 gives M=a+11>0M = a + 1 \ge 1 > 0 and M>aM > a; and 0M0 \le M (Ordered field, Complete ordered field (least-upper-bound property)).

Verification

technique · direct
1.1

M=a+11>0M = a + 1 \ge 1 > 0 by [L5], so [0,M][0,M] is a nonempty closed bounded interval, and ff is continuous on it by [L1].

L1L5
1.2

f(0)=0n=0af(0) = 0^{n} = 0 \le a by [L3] and the hypothesis a0a \ge 0; and f(M)=MnM=a+1>af(M) = M^{n} \ge M = a + 1 > a by [L3] and [L5]. So f(0)af(M)f(0) \le a \le f(M).

L3L5
2.1

By [L2] applied on [0,M][0,M] with the value aa, there is c[0,M]c \in [0,M] with cn=ac^{n} = a; in particular c0c \ge 0.

step 1.1step 1.2L2choose
3.1

cc is the only nonnegative real with cn=ac^{n} = a: by [L3] the map ttnt \mapsto t^{n} is injective on the nonnegative reals, so two nonnegative solutions would coincide. Hence c=a1/nc = a^{1/n} in the notation of [L4], and the existence half of [L4] has been re-proved from the intermediate value theorem.

step 2.1L3L4

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: 118 results over 23 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