Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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.

Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}

Statement

Let FF be a complete ordered field (Complete ordered field (least-upper-bound property)). Then every aFa \in F with a0a \ge 0 has a unique sFs \in F with s0s \ge 0 and s2=as^2 = a; we write s=as = \sqrt{a}. Consequently the positive elements of FF are exactly the nonzero squares: x>0x > 0 if and only if x=y2x = y^2 for some y0y \neq 0.

Facts & Assumptions

Given: A complete ordered field FF (Complete ordered field (least-upper-bound property)), that is, an ordered field (Ordered field) with the least-upper-bound property, and an element aFa \in F with a0a \ge 0.

[L1]

Every nonempty subset of FF that is bounded above has a least upper bound in FF (Complete ordered field (least-upper-bound property)).

[L2]

Sign and scaling rules: a product of positives is positive, and for c>0c > 0 one has x<y    cx<cyx < y \iff cx < cy (Sign rules for products and monotonicity of multiplication).

[L3]

Squaring is strictly monotone on the nonnegatives: if 0x<y0 \le x < y then x2<y2x^2 < y^2; in particular squaring is injective on {x:x0}\{x : x \ge 0\} (Squaring is monotone on the nonnegatives).

[L4]

A nonzero square is positive: if y0y \neq 0 then y2>0y^2 > 0 (Squares of nonzero elements are positive).

[L5]

Multiplying inequalities of positives: if 0<x<y0 < x < y and 0<u<v0 < u < v then xu<yvxu < yv (Multiplying inequalities of positives).

Proof

technique · contradiction
1.1

If a=0a = 0, then s=0s = 0 satisfies s0s \ge 0 and s2=0=as^2 = 0 = a, so existence holds; assume henceforth a>0a > 0.

givenalgebra
1.2

Uniqueness holds once a root exists: if u,v0u, v \ge 0 satisfy u2=v2u^2 = v^2, then strict monotonicity of squaring on nonnegatives [L3] rules out both u<vu < v and u>vu > v, forcing u=vu = v; so at most one s0s \ge 0 has s2=as^2 = a.

L3given
1.3

Define S={tF:t0 and t2a}S = \{ t \in F : t \ge 0 \text{ and } t^2 \le a \}; then 0S0 \in S because 000 \ge 0 and 02=0a0^2 = 0 \le a, so SS \neq \emptyset.

givenalgebra
1.4

The element 1+a1 + a is an upper bound of SS: since a>0a > 0 we have 1+a>11 + a > 1, so any t>1+at > 1 + a has t>1t > 1 and t>0t > 0, whence t2=tt>1t=t>1+a>at^2 = t \cdot t > 1 \cdot t = t > 1 + a > a, giving tSt \notin S.

givenL2
2.1

By completeness [L1], s:=supSs := \sup S exists in FF; and since 0S0 \in S we have s0s \ge 0.

L1step 1.3step 1.4
3.1

Assume, for contradiction, that s2as^2 \neq a; by trichotomy either s2<as^2 < a or s2>as^2 > a.

assume-contrastep 2.1
4.1

(Case s2<as^2 < a.) Choose hh with 0<h<10 < h < 1 and h<as22s+1h < \dfrac{a - s^2}{2s + 1}, possible since as2>0a - s^2 > 0 and 2s+11>02s + 1 \ge 1 > 0; then h2=hh<h1=hh^2 = h \cdot h < h \cdot 1 = h and h(2s+1)<as2h(2s+1) < a - s^2, so (s+h)2=s2+2sh+h2<s2+2sh+h=s2+h(2s+1)<a(s+h)^2 = s^2 + 2sh + h^2 < s^2 + 2sh + h = s^2 + h(2s+1) < a, whence s+hSs + h \in S with s+h>ss + h > s, contradicting that ss is an upper bound of SS.

assume-case lowstep 3.1step 2.1L2L5choose
4.2

(Case s2>as^2 > a.) Here s>0s > 0 since s2>a0s^2 > a \ge 0; choose hh with 0<h<s0 < h < s and h<s2a2sh < \dfrac{s^2 - a}{2s}, so 2sh<s2a2sh < s^2 - a and (sh)2=s22sh+h2s22sh>a(s-h)^2 = s^2 - 2sh + h^2 \ge s^2 - 2sh > a, hence every tSt \in S has t2a<(sh)2t^2 \le a < (s-h)^2 with t0t \ge 0 and sh>0s - h > 0, so t<sht < s - h by [L3]; thus shs - h is an upper bound of SS with sh<ss - h < s, contradicting that ss is the least upper bound.

assume-case highstep 3.1step 2.1L3choose
5.1

Both cases of the disjunction in step 3.1 give a contradiction, so the assumption fails and s2=as^2 = a: a unique (by step 1.2) s=a0s = \sqrt{a} \ge 0 with s2=as^2 = a exists, and applying this to any x>0x > 0 writes x=(x)2x = (\sqrt{x})^2 with x0\sqrt{x} \neq 0 while conversely any nonzero square is positive by [L4], so the positive elements of FF are exactly the nonzero squares.

step 4.1step 4.2step 3.1step 1.2L4casesdischarge-contradiction

Depends on

Used by

…and 20 more results.

Dependency tree · next 3 levels

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