Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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 extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined

Definition

Fix two objects -\infty and ++\infty, distinct from one another and neither of them a real number (The real numbers), and set

R:=R{,+}.\overline{\mathbb{R}} := \mathbb{R} \cup \{-\infty, +\infty\}.

This is a new object, introduced here explicitly with its own order and its own partial arithmetic. It is not an enlargement of the field R\mathbb{R}, and no operation of R\mathbb{R} (Complete ordered field (least-upper-bound property)) is redefined by anything below.

The order. For a,bRa, b \in \overline{\mathbb{R}} declare

ab:a=  or  b=+  or  (a,bR and ab in R),a \le b \quad :\Longleftrightarrow \quad a = -\infty \ \text{ or } \ b = +\infty \ \text{ or } \ \big(a, b \in \mathbb{R} \text{ and } a \le b \text{ in } \mathbb{R}\big),

with R\mathbb{R} ordered as in Order on the reals, and write a<ba < b for "aba \le b and aba \ne b" as usual (Partial order and partially ordered set).

(R,)(\overline{\mathbb{R}}, \le) is a totally ordered set, and the inclusion of R\mathbb{R} preserves and reflects the order. All four checks are immediate from the displayed clauses.

  • Reflexive. For a=±a = \pm\infty one of the first two clauses applies; for aRa \in \mathbb{R} the third does, since aaa \le a in R\mathbb{R}.
  • Antisymmetric. Suppose aba \le b and bab \le a. If a=a = -\infty then bab \le a forces b=b = -\infty, since the clause a=+a = +\infty fails and b,ab, a are not both real. Symmetrically b=b = -\infty forces a=a = -\infty, and a=+a = +\infty or b=+b = +\infty forces the other to be ++\infty. In the one remaining situation aa and bb are both real and antisymmetry is that of R\mathbb{R}.
  • Transitive. Let abca \le b \le c. If a=a = -\infty or c=+c = +\infty the conclusion is one of the first two clauses. Otherwise aa \ne -\infty forces, in aba \le b, either b=+b = +\infty or a,bRa, b \in \mathbb{R}; and c+c \ne +\infty forces, in bcb \le c, either b=b = -\infty or b,cRb, c \in \mathbb{R}. The value b=+b = +\infty is incompatible with the second alternative pair, so bb is real, hence so are aa and cc, and transitivity is that of R\mathbb{R}.
  • Total. If a=a = -\infty or b=+b = +\infty then aba \le b; if b=b = -\infty or a=+a = +\infty then bab \le a; otherwise both are real and the order of R\mathbb{R} is total.
  • Preserved and reflected. For a,bRa, b \in \mathbb{R} the first two clauses fail, so aba \le b in R\overline{\mathbb{R}} says exactly aba \le b in R\mathbb{R}.

In particular -\infty is the least and ++\infty the greatest element of R\overline{\mathbb{R}}, and <x<+-\infty < x < +\infty for every xRx \in \mathbb{R}.

Reflection. Extend negation by

(+):=,():=+,-(+\infty) := -\infty, \qquad -(-\infty) := +\infty,

keeping the field negative on R\mathbb{R}. The resulting map ν:RR\nu : \overline{\mathbb{R}} \to \overline{\mathbb{R}}, ν(a)=a\nu(a) = -a, satisfies ν(ν(a))=a\nu(\nu(a)) = a and

ab    ba(a,bR).a \le b \iff -b \le -a \qquad (a, b \in \overline{\mathbb{R}}).

For aa and bb real this is the elementwise order reversal in R\mathbb{R}: translation invariance (Order is preserved by adding a constant and by adding inequalities) applied with the constant ab-a-b turns a<ba < b into b<a-b < -a and, applied with the constant a+ba+b, turns it back, while a=ba = b holds exactly when a=b-a = -b. In every other case both sides are decided by the first two clauses of the order: a=a = -\infty makes both sides true, as does b=+b = +\infty, and if aa \ne -\infty, b+b \ne +\infty and a,ba, b are not both real then one of a=+a = +\infty, b=b = -\infty holds and both sides are false.

Partial addition. For a,bRa, b \in \overline{\mathbb{R}} the sum a+ba + b is defined by

  • a+ba + b = the field sum, when a,bRa, b \in \mathbb{R};
  • a+b:=+a + b := +\infty when a=+a = +\infty and bb \ne -\infty, or b=+b = +\infty and aa \ne -\infty;
  • a+b:=a + b := -\infty when a=a = -\infty and b+b \ne +\infty, or b=b = -\infty and a+a \ne +\infty;

and the two sums (+)+()(+\infty) + (-\infty) and ()+(+)(-\infty) + (+\infty) are left undefined. Addition is commutative where defined, and

(a+b)=(a)+(b),-(a + b) = (-a) + (-b),

each side being defined exactly when the other is: the excluded pairs {+,}\{+\infty, -\infty\} are exchanged by ν\nu, and the three clauses above are exchanged accordingly.

Partial multiplication. For a,bRa, b \in \overline{\mathbb{R}} the product abab is defined by

  • abab = the field product, when a,bRa, b \in \mathbb{R};
  • ab:=+ab := +\infty when one of a,ba, b is ±\pm\infty, the other is 0\ne 0, and both are >0> 0 or both are <0< 0;
  • ab:=ab := -\infty when one of a,ba, b is ±\pm\infty, the other is 0\ne 0, and one is >0> 0 and the other <0< 0;

and every product with one factor 00 and the other ±\pm\infty is left undefined. The comparisons >0> 0 and <0< 0 here are taken in the order above, under which +>0>+\infty > 0 > -\infty.

Nothing else is defined. There is no subtraction, no division, no exponentiation and no absolute value on R\overline{\mathbb{R}} in this library; where such an expression is wanted it is written out in the two defined operations, and where a case falls in the undefined list the statement carries an explicit hypothesis saying so.

Remarks

Depends on

Used by

…and 6 more results.

Dependency tree · next 3 levels

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