Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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.

FALSE: the supremum of a set belongs to the set

Statement

False claim: if SRS \subseteq \mathbb{R} is nonempty and bounded above, then supSS\sup S \in S.

Equivalently, the false claim asserts that every nonempty set bounded above has a maximum (Maximum and minimum of a set). It is refuted below by the open unit interval, whose supremum exists, is unique, and lies outside the set.

Facts & Assumptions

Given: The set S:={xR:0<x<1}S := \{x \in \mathbb{R} : 0 < x < 1\} inside the complete ordered field R\mathbb{R}, and the abbreviation 2:=1+12 := 1 + 1.

[L1]

Epsilon characterisation of the supremum: for a nonempty XRX \subseteq \mathbb{R} bounded above and an upper bound ww of XX, one has w=supXw = \sup X if and only if for every ε>0\varepsilon > 0 there is xXx \in X with wε<xw - \varepsilon < x (Epsilon characterisation of the supremum).

[L2]

Maximum: m=maxXm = \max X means mXm \in X and xmx \le m for every xXx \in X (Maximum and minimum of a set).

[L3]

Order: trichotomy holds, so exactly one of a<ba < b, a=ba = b, b<ab < a is true, the negation of aba \le b is b<ab < a, and a<aa < a is impossible; the order is transitive; and adding a constant preserves it, so a<ba < b if and only if a+c<b+ca + c < b + c (Complete ordered field (least-upper-bound property), Ordered field, Order is preserved by adding a constant and by adding inequalities).

[L4]

Positivity and multiplication: 0<10 < 1 (The multiplicative identity is positive); sums and products of positive elements are positive (axiom O2 of Ordered field); every nonzero element has a multiplicative inverse (Field); 0c=00 \cdot c = 0 for every cc (Multiplication by zero: 0a=00 \cdot a = 0); and for a positive multiplier cc one has x<yx < y if and only if xc<ycxc < yc (claim 4 of Sign rules for products and monotonicity of multiplication).

Refutation

technique · direct
1.1

Since 0<10 < 1, the element 2=1+12 = 1 + 1 is positive, hence nonzero, so 212^{-1} exists; from 212=1>0=022^{-1} \cdot 2 = 1 > 0 = 0 \cdot 2 we get 21>02^{-1} > 0, and from 212=1<2=122^{-1} \cdot 2 = 1 < 2 = 1 \cdot 2 (the inequality 1<21 < 2 holding because 21=1>02 - 1 = 1 > 0) we get 21<12^{-1} < 1; therefore 21S2^{-1} \in S and SS \ne \emptyset.

L3L4algebra
1.2

Every xSx \in S satisfies x<1x < 1 and hence x1x \le 1, so 11 is an upper bound of SS and SS is bounded above.

L3
1.3

Let ε>0\varepsilon > 0. Then 1+ε>01 + \varepsilon > 0 is nonzero, so we may put η:=ε(1+ε)1\eta := \varepsilon (1 + \varepsilon)^{-1}, which satisfies η(1+ε)=ε\eta (1 + \varepsilon) = \varepsilon; multiplying by the positive 1+ε1 + \varepsilon is an equivalence, so η>0\eta > 0 follows from η(1+ε)=ε>0=0(1+ε)\eta(1+\varepsilon) = \varepsilon > 0 = 0 \cdot (1 + \varepsilon), next η<1\eta < 1 follows from η(1+ε)=ε<1+ε=1(1+ε)\eta(1+\varepsilon) = \varepsilon < 1 + \varepsilon = 1 \cdot (1 + \varepsilon), and finally η<ε\eta < \varepsilon follows from η(1+ε)=ε<ε+ε2=ε(1+ε)\eta(1+\varepsilon) = \varepsilon < \varepsilon + \varepsilon^2 = \varepsilon(1 + \varepsilon), the last inequality holding because ε2>0\varepsilon^2 > 0.

L3L4algebra
2.1

Put s:=1ηs := 1 - \eta. From 0<η0 < \eta we get s=1η<1s = 1 - \eta < 1, from η<1\eta < 1 we get 0=11<1η=s0 = 1 - 1 < 1 - \eta = s, so sSs \in S; and from η<ε\eta < \varepsilon we get 1ε<1η=s1 - \varepsilon < 1 - \eta = s. Since ε>0\varepsilon > 0 was arbitrary, for every ε>0\varepsilon > 0 there is an element of SS strictly greater than 1ε1 - \varepsilon.

step 1.3L3algebra
2.2

The number 11 is not an element of SS, because membership in SS requires x<1x < 1 and 1<11 < 1 is impossible by trichotomy.

step 1.1L3
2.3

The set SS has no maximum: if mm were one then mSm \in S, so 0<m<10 < m < 1; putting m:=(m+1)21m' := (m + 1) 2^{-1}, so that m2=m+1m' \cdot 2 = m + 1, the inequality m2=m+m<m+1=m2m \cdot 2 = m + m < m + 1 = m' \cdot 2 gives m<mm < m', the inequality m2=m+1<1+1=12m' \cdot 2 = m + 1 < 1 + 1 = 1 \cdot 2 gives m<1m' < 1, and m2=m+1>0=02m' \cdot 2 = m + 1 > 0 = 0 \cdot 2 gives m>0m' > 0; hence mSm' \in S with m<mm < m', contradicting the requirement mmm' \le m for a maximum.

step 1.1L2L3L4algebra
3.1

The set SS is nonempty and bounded above with upper bound 11, and every 1ε1 - \varepsilon with ε>0\varepsilon > 0 is exceeded by some element of SS, so the epsilon characterisation gives supS=1\sup S = 1.

step 1.1step 1.2step 2.1L1
4.1

Thus SS is a nonempty subset of R\mathbb{R} that is bounded above, its supremum exists and equals 11, and 1S1 \notin S; the claim that the supremum of a set belongs to the set is therefore false, and correspondingly SS has no maximum, so no element of SS could have served as its supremum.

step 3.1step 2.2step 2.3

Remarks

  • The refutation is self-contained: the witness SS, the value of supS\sup S and the failure of membership are all verified here from the complete-ordered-field axioms and the items this page has already proved.
  • What is true is the corrected statement The supremum is attained exactly when a maximum exists: for a set whose supremum exists, supSS\sup S \in S exactly when SS has a maximum, and then supS=maxS\sup S = \max S. Being nonempty and finite is a sufficient condition for having a maximum (Every nonempty finite set of reals has a maximum and a minimum); nonemptiness cannot be dropped there, since \emptyset is finite and has no maximum. Being nonempty and bounded above is not sufficient, which is exactly what the witness above shows.
  • The error is a common one because it is harmless on finite sets, which is where intuition is trained. The whole point of the supremum is to name a boundary that the set approaches without reaching.

Depends on

Used by

Dependency tree · next 3 levels

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