Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableverified 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.

Conventions: sup⁡∅, unbounded sets, and the extended reals

Many texts, especially in measure theory, lattice theory and optimisation, work in the extended real line R‾=R∪{−∞,+∞} and adopt the conventions

sup⁡∅=−∞,inf⁡∅=+∞,sup⁡S=+∞  for S not bounded above,inf⁡S=−∞  for S not bounded below.

With those conventions in force, every subset of R has a supremum and an infimum in R‾, and the two exceptional cases recorded in FALSE: every subset of R has a supremum disappear. The conventions are consistent and often convenient. The value sup⁡∅=−∞ is not arbitrary: it is forced by monotonicity under inclusion together with sup⁡{x}=x, since ∅⊆{x} then gives sup⁡∅≤x for every real x, and −∞ is the only element of R‾ below every real. (Monotonicity together with sup⁡R=+∞ forces nothing here: it only gives sup⁡∅≤+∞.) The convention also makes sup⁡(S∪T)=max⁡{sup⁡S,sup⁡T} hold without side conditions.

This library does not adopt them. Two reasons, both about keeping the foundations honest.

  • ±∞ are not elements of R. The library's R is the complete ordered field (Complete ordered field (least-upper-bound property)), and R‾ is not a field: +∞ has no additive inverse, and the expressions (+∞)+(−∞) and 0⋅(+∞) have no definition that keeps the field axioms. Writing sup⁡S=+∞ silently moves the discussion into a different structure, and every subsequent algebraic step then needs its own justification.
  • Suppressed hypotheses become invisible errors. If sup⁡S is always defined, a statement such as "sup⁡(S+T)=sup⁡S+sup⁡T" appears to be unconditional, and the cases where it degenerates are hidden inside the arithmetic of ±∞ rather than shown in the hypotheses.

Accordingly, in this library:

A reader coming from a source that uses the extended-real conventions should therefore expect the statements here to look more heavily qualified than the ones they are used to. The mathematics is the same; the difference is where the case analysis is written down. The extended real line is introduced explicitly in The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined for later limsup and liminf arguments, with its order and partial arithmetic kept separate from R.

Depends on

Used by

Dependency tree · two levels

23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources