Alphabeta Math
RemarkRemark: AI-generatedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Which extended-real operations this library leaves undefined, and where each lim sup\limsup statement needs the hypothesis

Conventions: sup\sup \emptyset, unbounded sets, and the extended reals refused, inside R\mathbb{R}, the conventions supS=+\sup S = +\infty and inf=+\inf \emptyset = +\infty, and promised that a later page needing R\overline{\mathbb{R}} would introduce it explicitly as a new object with its own order and its own partial arithmetic. The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined is that introduction, and this page is the one that needed it. Nothing about the real supremum has changed: supS\sup S and infS\inf S for SRS \subseteq \mathbb{R} are still real numbers, still defined only under the nonempty and bounded hypotheses, and the extended bounds of 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} are a different operation in a different ordered set, agreeing with the real one exactly where the real one is defined.

What is defined. On R\overline{\mathbb{R}} this library defines exactly three things: the total order, the reflection aaa \mapsto -a, and the two partial operations a+ba + b and abab. The order and the reflection are total. The two operations are not, and the gaps are these.

expressionstatus
a+ba + b with a,bRa, b \in \mathbb{R}the field sum
(+)+b(+\infty) + b with bb \ne -\infty++\infty
()+b(-\infty) + b with b+b \ne +\infty-\infty
(+)+()(+\infty) + (-\infty) and ()+(+)(-\infty) + (+\infty)undefined
abab with a,bRa, b \in \mathbb{R}the field product
(±)b(\pm\infty) \cdot b with b0b \ne 0±\pm\infty, by the sign rule
0(±)0 \cdot (\pm\infty) and (±)0(\pm\infty) \cdot 0undefined

What is not defined at all. There is no subtraction on R\overline{\mathbb{R}}, no division, no absolute value and no exponentiation. Where a proof on this page wants aba - b it writes a+(b)a + (-b), which inherits the gap at {+,}\{+\infty, -\infty\}; where it wants a quotient it does not write one. In particular the expressions (+)(+)(+\infty) - (+\infty), (+)/(+)(+\infty)/(+\infty) and 0/00/0 do not occur here, not because they are hard but because neither operation exists.

Why the two gaps are gaps. They are the two places where the value is not determined by the sequences involved, so no assignment could be compatible with limits. For the product this is proved: Null times divergent has no rule: xk=1/kx_k = 1/k with yk=cky_k = ck gives product limit cc, and with yk=k2y_k = k^2 gives divergence exhibits a null sequence and sequences diverging to ++\infty whose products behave differently, so 0(+)0 \cdot (+\infty) has no value that would make a product rule true. For the sum the same is visible with ak=ka_k = k and bk=kb_k = -k, whose sum is constantly 00, against ak=ka_k = k and bk=2kb_k = -2k, whose sum diverges to -\infty; both pairs have lim supak=+\limsup a_k = +\infty and lim supbk=\limsup b_k = -\infty.

Where each statement on this page carries the hypothesis. Reading the page in order, the pattern is that everything purely order-theoretic is unconditional and everything arithmetic is not.

What this costs a reader coming from a measure-theory text. Such a text typically declares 0:=00 \cdot \infty := 0, which is genuinely convenient there, because in an integral the factor 00 is a measure-zero set and the convention makes countable additivity work without cases. That convention is not in force here, and it is not compatible with limits: it is a decision about a particular formula, not a fact about R\overline{\mathbb{R}}. A statement quoted from such a source therefore needs its degenerate cases restored before it can be used with the results on this page.

One thing that is not a convention. The equations lim supkxk=+\limsup_k x_k = +\infty and lim infkxk=\liminf_k x_k = -\infty occurring throughout this page are ordinary equations between elements of R\overline{\mathbb{R}}, not abbreviations. That is precisely the difference from Divergence to ++\infty and to -\infty, where "xk+x_k \to +\infty" is a single abbreviation for a condition and no object named ++\infty is involved. Both readings coexist without conflict, and A real sequence converges to LRL \in \mathbb{R} iff lim infxk=lim supxk=L\liminf x_k = \limsup x_k = L, and diverges to ±\pm\infty iff both equal ±\pm\infty is the statement that relates them.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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