Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-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.

Epsilon characterisation of the supremum

Statement

Let SRS \subseteq \mathbb{R} be nonempty and bounded above, and let uu be an upper bound of SS (Complete ordered field (least-upper-bound property)). Then

u=supSfor every ε>0 there exists sS with uε<s.u = \sup S \quad \Longleftrightarrow \quad \text{for every } \varepsilon > 0 \text{ there exists } s \in S \text{ with } u - \varepsilon < s.

In words: among the upper bounds of SS, the supremum is exactly the one that cannot be lowered by any positive amount and still bound SS.

Facts & Assumptions

Given: A nonempty SRS \subseteq \mathbb{R} that is bounded above, and an upper bound uu of SS; since SS is nonempty and bounded above, supS\sup S exists.

[L1]

Supremum: u=supSu = \sup S exactly when uu is an upper bound of SS and uuu \le u' for every upper bound uu' of SS; and every nonempty subset of R\mathbb{R} that is bounded above has such a least upper bound (Complete ordered field (least-upper-bound property)).

[L2]

The least upper bound is unique, so the equation u=supSu = \sup S says precisely that uu is a least upper bound of SS (Suprema and infima are unique).

[L3]

The order is total: for a,bRa, b \in \mathbb{R} exactly one of a<ba < b, a=ba = b, b<ab < a holds, so the negation of aba \le b is b<ab < a; and a<ba < b holds exactly when ba>0b - a > 0 (Complete ordered field (least-upper-bound property), Ordered field). (Translation invariance follows in one line from that last equivalence, since (b+c)(a+c)=ba(b + c) - (a + c) = b - a, but no step below uses it and it is not claimed here as a quoted result.)

Proof

technique · direct
1.1

For the forward implication assume u=supSu = \sup S, that is, uu is an upper bound of SS that is \le every upper bound of SS, and let ε>0\varepsilon > 0 be arbitrary.

assume-hypL1L2
1.2

For the converse implication assume that uu is an upper bound of SS such that for every ε>0\varepsilon > 0 there exists sSs \in S with uε<su - \varepsilon < s, and let uu' be an arbitrary upper bound of SS.

assume-hyp
2.1

Since u(uε)=ε>0u - (u - \varepsilon) = \varepsilon > 0, we have uε<uu - \varepsilon < u.

step 1.1L3algebra
2.2

By totality either uuu \le u' or u<uu' < u; in the second case put ε0:=uu\varepsilon_0 := u - u', so that ε0>0\varepsilon_0 > 0 and uε0=uu - \varepsilon_0 = u'.

step 1.2L3algebra
3.1

The element uεu - \varepsilon is not an upper bound of SS: if it were, the leastness of uu among upper bounds would give uuεu \le u - \varepsilon, which contradicts uε<uu - \varepsilon < u by trichotomy.

step 2.1step 1.1L1L3
3.2

In that second case the hypothesis applied to ε0\varepsilon_0 yields s0Ss_0 \in S with u=uε0<s0u' = u - \varepsilon_0 < s_0, so s0us_0 \le u' fails, contradicting that uu' is an upper bound of SS; the second case is therefore impossible and uuu \le u'.

step 2.2step 1.2L3
4.1

Failing to be an upper bound of SS means precisely that some sSs \in S does not satisfy suεs \le u - \varepsilon, and by totality that says uε<su - \varepsilon < s; since ε>0\varepsilon > 0 was arbitrary, the forward implication is proved.

step 3.1L3
4.2

Since uu' was an arbitrary upper bound of SS, we get uuu \le u' for every upper bound uu'; as uu is itself an upper bound, uu is a least upper bound of SS, hence u=supSu = \sup S by uniqueness, which proves the converse implication.

step 3.2step 1.2L1L2
5.1

Both implications hold, so for an upper bound uu of a nonempty set SS bounded above, u=supSu = \sup S if and only if for every ε>0\varepsilon > 0 there is sSs \in S with uε<su - \varepsilon < s.

step 4.1step 4.2

Depends on

Used by

Dependency tree · next 3 levels

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