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 statement needs the hypothesis
Conventions: , unbounded sets, and the extended reals refused, inside , the conventions and , and promised that a later page needing would introduce it explicitly as a new object with its own order and its own partial arithmetic. The extended real line , 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: and for are still real numbers, still defined only under the nonempty and bounded hypotheses, and the extended bounds of Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in 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 this library defines exactly three things: the total order, the reflection , and the two partial operations and . The order and the reflection are total. The two operations are not, and the gaps are these.
| expression | status |
|---|---|
| with | the field sum |
| with | |
| with | |
| and | undefined |
| with | the field product |
| with | , by the sign rule |
| and | undefined |
What is not defined at all. There is no subtraction on , no division, no absolute value and no exponentiation. Where a proof on this page wants it writes , which inherits the gap at ; where it wants a quotient it does not write one. In particular the expressions , and 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: with gives product limit , and with gives divergence ↗ exhibits a null sequence and sequences diverging to whose products behave differently, so has no value that would make a product rule true. For the sum the same is visible with and , whose sum is constantly , against and , whose sum diverges to ; both pairs have and .
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.
- Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in , Limit superior and limit inferior of a real sequence as and in , The tail suprema of any real sequence are nonincreasing in , so the limit superior exists for every sequence, , with the reflection of exchanging , for every real sequence, If eventually then and , The limit superior is itself a subsequential limit in and is the greatest one and The limit inferior is the least subsequential limit in carry no hypothesis on the sequence. They use only the order and the reflection, both of which are total, so unbounded sequences and the values need no separate treatment.
- For finite : iff for every one has eventually and frequently requires . That is not an arithmetic gap but a syntactic one: its conditions mention and , and subtraction is not available in . The infinite cases are covered instead by A real sequence converges to iff , and diverges to iff both equal , whose statement uses no arithmetic at all.
- whenever the right-hand side is defined in , and dually for requires that be defined, which is exactly the exclusion of the pair from the table above. Nothing else is assumed; in particular the sequences need not be bounded, and the two infinite cases are proved rather than excluded.
- For bounded nonnegative sequences, requires the sequences to be bounded and nonnegative. Boundedness is what makes all three limit superiors real, so that the product on the right is a product in ; without it the right-hand side could be the undefined . Nonnegativity is a separate requirement, needed because the estimate multiplies two upper bounds.
What this costs a reader coming from a measure-theory text. Such a text typically declares , which is genuinely convenient there, because in an integral the factor 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 . 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 and occurring throughout this page are ordinary equations between elements of , not abbreviations. That is precisely the difference from Divergence to and to , where "" is a single abbreviation for a condition and no object named is involved. Both readings coexist without conflict, and A real sequence converges to iff , and diverges to iff both equal is the statement that relates them.
Depends on
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Limit superior and limit inferior of a real sequence as $\inf_n \sup_{k \ge n} x_k$ and $\sup_n \inf_{k \ge n} x_k$ in $\overline{\mathbb{R}}$
- $\limsup(x_k + y_k) \le \limsup x_k + \limsup y_k$ whenever the right-hand side is defined in $\overline{\mathbb{R}}$, and dually for $\liminf$
- For bounded nonnegative sequences, $\limsup(x_k y_k) \le (\limsup x_k)(\limsup y_k)$
- Conventions: $\sup \emptyset$, unbounded sets, and the extended reals
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
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
- Extended real number line (Wikipedia) (standard reference, not scraped)
- Indeterminate form (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (1.23) (standard reference, not scraped)