Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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 n-th root, applied to xn on a closed bounded interval

Example

Let a∈R with a≥0 and let n∈N with n≥1. Put M:=a+1 and consider

f:[0,M]→R,f(x):=xn

(Integer powers am, Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then f is continuous on [0,M], f(0)=0≤a≤Mn=f(M), and the intermediate value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b)) supplies c∈[0,M] with

cn=a.

Moreover c is the only nonnegative real with this property, so c=a1/n in the notation of Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a.

This is a second proof of an existing theorem, not a new one. Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a already proves existence and uniqueness of n-th roots, by an argument that runs directly from the least-upper-bound property and the factorisation of bn−an; 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 x↦xn 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] takes every value between f(a) and 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 0, on the algebra of continuous functions and on the sequential criterion, none of which uses n-th roots; and the uniqueness half below is Monotonicity of x↦xn and of n↦an, which is pure ordered-field arithmetic. So this argument could have been the library's definition of a1/n; it is not, only because the roots were needed at order 16, long before continuity existed.

Facts & Assumptions

Given: A real a≥0, a natural n≥1, and M:=a+1; the function f(x)=xn on [0,M].

[L2]

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

[L3]

Powers and order: 0n=0 for n≥1; if t≥1 and n≥1 then tn≥t; and x↦xn is strictly increasing on the nonnegative reals for n≥1, hence injective there (Monotonicity of x↦xn and of n↦an, Integer powers am).

[L4]

Existence and uniqueness of n-th roots: for a≥0 and n≥1 there is a unique 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).

[L5]

Ordered-field arithmetic: a≥0 gives M=a+1≥1>0 and M>a; and 0≤M (Ordered field, Complete ordered field (least-upper-bound property)).

Verification

technique · direct
1.1

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

L1L5
1.2

f(0)=0n=0≤a by [L3] and the hypothesis a≥0; and f(M)=Mn≥M=a+1>a by [L3] and [L5]. So f(0)≤a≤f(M).

L3L5
2.1

By [L2] applied on [0,M] with the value a, there is c∈[0,M] with cn=a; in particular c≥0.

step 1.1step 1.2L2choose
3.1

c is the only nonnegative real with cn=a: by [L3] the map t↦tn is injective on the nonnegative reals, so two nonnegative solutions would coincide. Hence c=a1/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 · two levels

58 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