Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

Every subset of R\overline{\mathbb{R}} has a least upper bound and a greatest lower bound in R\overline{\mathbb{R}}, agreeing with the real supremum and infimum on nonempty sets bounded in R\mathbb{R}

Statement

Let ARA \subseteq \overline{\mathbb{R}} be any subset of the extended real line (The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined) and write AR:=ARA_{\mathbb{R}} := A \cap \mathbb{R}. Then AA has a least upper bound and a greatest lower bound in R\overline{\mathbb{R}} (Upper bound, least upper bound, and strict upper bound), each unique, which we write supA\sup A and infA\inf A with the ambient set always R\overline{\mathbb{R}}. Explicitly:

  • supA=+\sup A = +\infty if +A+\infty \in A, or if ARA_{\mathbb{R}} is not bounded above in R\mathbb{R};
  • supA=\sup A = -\infty if +A+\infty \notin A and AR=A_{\mathbb{R}} = \emptyset;
  • supA\sup A is the real supremum supAR\sup A_{\mathbb{R}} (Complete ordered field (least-upper-bound property)) if +A+\infty \notin A and ARA_{\mathbb{R}} is nonempty and bounded above in R\mathbb{R};

and dually, with -\infty and ++\infty exchanged and "above" replaced by "below", for infA\inf A (Greatest lower bound (infimum), Every nonempty set bounded below has an infimum).

Agreement. If ARA \subseteq \mathbb{R} is nonempty and bounded above in R\mathbb{R} (Lower bound, bounded below, bounded set) then supA\sup A computed in R\overline{\mathbb{R}} is the real number supA\sup A of Complete ordered field (least-upper-bound property); if ARA \subseteq \mathbb{R} is nonempty and bounded below then infA\inf A computed in R\overline{\mathbb{R}} is the real number infA\inf A of Every nonempty set bounded below has an infimum. In particular the notation is unambiguous on the sets for which the real supremum and infimum are defined, and sup=\sup \emptyset = -\infty, inf=+\inf \emptyset = +\infty in R\overline{\mathbb{R}}.

No hypothesis is placed on AA. This is exactly what the real supremum cannot do, and it is why every lim sup\limsup statement on this page holds for every sequence rather than for bounded ones only. It is also not a weakening of the discipline this library keeps around suprema: the operation supplied here is a different operation, taken in a different ordered set, and the agreement clause records exactly where the two coincide.

Facts & Assumptions

Given: A subset ARA \subseteq \overline{\mathbb{R}}, and its real part AR:=ARA_{\mathbb{R}} := A \cap \mathbb{R}.

[L1]

(R,)(\overline{\mathbb{R}}, \le) is a totally ordered set in which -\infty is the least element and ++\infty the greatest, and whose order restricted to R\mathbb{R} is the order of R\mathbb{R} (The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined, Partial order and partially ordered set, Order on the reals).

[L2]

Upper and lower bounds in a poset: uu is an upper bound of AA when aua \le u for all aAa \in A, and a least upper bound when moreover uvu \le v for every upper bound vv; dually for lower bounds and greatest lower bounds. Each is unique when it exists, by antisymmetry (Upper bound, least upper bound, and strict upper bound, Partial order and partially ordered set).

[L3]

Least-upper-bound property of R\mathbb{R}: every nonempty SRS \subseteq \mathbb{R} that is bounded above in R\mathbb{R} has a real least upper bound supS\sup S (Complete ordered field (least-upper-bound property)).

[L4]

Greatest-lower-bound property of R\mathbb{R}: every nonempty SRS \subseteq \mathbb{R} that is bounded below in R\mathbb{R} has a real greatest lower bound infS\inf S (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).

[L5]

Bounded above and bounded below in R\mathbb{R} mean the existence of a real upper, respectively lower, bound (Lower bound, bounded below, bounded set).

Proof

technique · cases
1.1

Case S1 for the supremum: +A+\infty \in A.

givenassume-case suptop
1.2

Case S2 for the supremum: +A+\infty \notin A and AR=A_{\mathbb{R}} = \emptyset, so that every element of AA equals -\infty.

givenassume-case supbot
1.3

Case S3 for the supremum: +A+\infty \notin A, ARA_{\mathbb{R}} \ne \emptyset, and ARA_{\mathbb{R}} is bounded above in R\mathbb{R}.

givenassume-case supfin
1.4

Case S4 for the supremum: +A+\infty \notin A, ARA_{\mathbb{R}} \ne \emptyset, and ARA_{\mathbb{R}} is not bounded above in R\mathbb{R}.

givenassume-case supunb
1.5

Case I1 for the infimum: A-\infty \in A.

givenassume-case infbot
1.6

Case I2 for the infimum: A-\infty \notin A and AR=A_{\mathbb{R}} = \emptyset, so that every element of AA equals ++\infty.

givenassume-case inftop
1.7

Case I3 for the infimum: A-\infty \notin A, ARA_{\mathbb{R}} \ne \emptyset, and ARA_{\mathbb{R}} is bounded below in R\mathbb{R}.

givenassume-case inffin
1.8

Case I4 for the infimum: A-\infty \notin A, ARA_{\mathbb{R}} \ne \emptyset, and ARA_{\mathbb{R}} is not bounded below in R\mathbb{R}.

givenassume-case infunb
2.1

In case S1 the element ++\infty is an upper bound of AA, being the greatest element of R\overline{\mathbb{R}}; and if vv is any upper bound of AA then +A+\infty \in A gives +v+\infty \le v, whence v=+v = +\infty by antisymmetry. So ++\infty is the least upper bound of AA.

step 1.1L1L2
2.2

In case S2 every element of AA equals -\infty, so -\infty is an upper bound of AA by reflexivity; and v-\infty \le v for every vRv \in \overline{\mathbb{R}}, being the least element. So -\infty is the least upper bound of AA.

step 1.2L1L2
2.3

In case S3 the real number σ:=supAR\sigma := \sup A_{\mathbb{R}} exists, and it is an upper bound of AA in R\overline{\mathbb{R}}: an element of AA is either real, hence lies in ARA_{\mathbb{R}} and satisfies aσa \le \sigma in R\mathbb{R} and so in R\overline{\mathbb{R}}, or equals -\infty, which is σ\le \sigma; the value ++\infty does not occur in AA in this case.

step 1.3L1L3
2.4

In case S4 the element ++\infty is an upper bound of AA; and if vv is an upper bound then vv \ne -\infty, because fixing aARa \in A_{\mathbb{R}}, which is possible in this case, gives ava \le v with aa real and -\infty is below no real, while vv real would make vv a real upper bound of ARA_{\mathbb{R}} and contradict the case hypothesis. So v=+v = +\infty, and ++\infty is the least upper bound of AA.

step 1.4L1L2L5
2.5

In case I1 the element -\infty is a lower bound of AA, being least; and any lower bound ww satisfies ww \le -\infty because A-\infty \in A, whence w=w = -\infty by antisymmetry. So -\infty is the greatest lower bound of AA.

step 1.5L1L2
2.6

In case I2 every element of AA equals ++\infty, so ++\infty is a lower bound of AA by reflexivity, and w+w \le +\infty for every ww. So ++\infty is the greatest lower bound of AA.

step 1.6L1L2
2.7

In case I3 the real number ι:=infAR\iota := \inf A_{\mathbb{R}} exists and is a lower bound of AA in R\overline{\mathbb{R}}: an element of AA is either real, hence in ARA_{\mathbb{R}} and ι\ge \iota, or equals +ι+\infty \ge \iota; the value -\infty does not occur in AA in this case.

step 1.7L1L4
2.8

In case I4 the element -\infty is a lower bound of AA; any lower bound ww satisfies w+w \ne +\infty, because fixing aARa \in A_{\mathbb{R}} gives waw \le a with aa real and ++\infty is above no real, while ww real would be a real lower bound of ARA_{\mathbb{R}} and contradict the case hypothesis. So w=w = -\infty is the greatest lower bound of AA.

step 1.8L1L2L5
3.1

In case S3 let vv be any upper bound of AA and fix aARa \in A_{\mathbb{R}}, which is possible since ARA_{\mathbb{R}} \ne \emptyset. From ava \le v with aa real we get vv \ne -\infty, since -\infty is below no real. If v=+v = +\infty then σv\sigma \le v because ++\infty is greatest. Otherwise vv is real, and it bounds ARA_{\mathbb{R}} above in R\mathbb{R}, so σv\sigma \le v by leastness of the real supremum. Hence σ\sigma is the least upper bound of AA.

step 1.3step 2.3L1L2L3
3.2

In case I3 let ww be a lower bound of AA and fix aARa \in A_{\mathbb{R}}. From waw \le a with aa real we get w+w \ne +\infty. If w=w = -\infty then wιw \le \iota; otherwise ww is real and bounds ARA_{\mathbb{R}} below in R\mathbb{R}, so wιw \le \iota. Hence ι\iota is the greatest lower bound of AA.

step 1.7step 2.7L1L2L4
4.1

The four supremum cases are exhaustive and mutually exclusive: either +A+\infty \in A, which is S1, or not, and then either AR=A_{\mathbb{R}} = \emptyset, which is S2, or ARA_{\mathbb{R}} \ne \emptyset and it is bounded above in R\mathbb{R}, which is S3, or it is not, which is S4. In each case a least upper bound was produced, and it is unique. The same four alternatives with -\infty, ++\infty and "below" in place of ++\infty, -\infty and "above" are I1 to I4, and in each a greatest lower bound was produced.

step 2.1step 2.2step 3.1step 2.4step 2.5step 2.6step 3.2step 2.8L2L5cases: a two-fold split followed by a three-fold splitcases-exhaustive
5.1

The agreement clause follows: a nonempty ARA \subseteq \mathbb{R} bounded above in R\mathbb{R} satisfies +A+\infty \notin A and AR=AA_{\mathbb{R}} = A, so case S3 applies and supA=supAR\sup A = \sup A_{\mathbb{R}} is the real supremum; a nonempty ARA \subseteq \mathbb{R} bounded below satisfies case I3 and infA\inf A is the real infimum; and A=A = \emptyset falls under S2 and I2, giving sup=\sup \emptyset = -\infty and inf=+\inf \emptyset = +\infty.

step 2.3step 3.1step 2.7step 3.2step 4.1L3L4

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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