Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Limits at +∞ and −∞, and infinite limits at a point

Definition

Throughout, +∞ and −∞ are abbreviations and not real numbers, exactly as in Intervals of R: the nine order-convex forms, nondegeneracy, and length and Divergence to +∞ and to −∞. Every phrase below is a single abbreviation for a displayed condition on reals, and no arithmetic is ever performed with the symbols.

Limits at +∞. Let A⊆R be not bounded above (Lower bound, bounded below, bounded set), let f:A→R and let L∈R. We write

lim⁡x→+∞f(x)=L

when for every real ε>0 there is a real M such that

∣f(x)−L∣<εfor every x∈A with x>M.

Limits at −∞. Let A be not bounded below. We write lim⁡x→−∞f(x)=L when for every real ε>0 there is a real M with ∣f(x)−L∣<ε for every x∈A with x<M.

Why unboundedness is required. It plays exactly the role the limit-point condition plays in The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A. Saying that A is not bounded above says that no real is an upper bound of A, that is, that for every real M there is x∈A with x>M (Lower bound, bounded below, bounded set, Complete ordered field (least-upper-bound property)); so the set over which the condition quantifies is never empty and the condition is never vacuous. Without the hypothesis every real L would satisfy it and the notation would not denote.

Uniqueness, proved here. Suppose A is not bounded above and lim⁡x→+∞f(x)=L and lim⁡x→+∞f(x)=L′ with L≠L′. Then ∣L−L′∣>0 (Basic properties of the absolute value), so ε:=∣L−L′∣/2>0 (The multiplicative identity is positive, Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication). Choose reals M1,M2 witnessing the two conditions at this ε and let M be the larger of them, the order being total. Since A is not bounded above there is x∈A with x>M, hence with x>M1 and x>M2, and then

∣L−L′∣=∣(L−f(x))+(f(x)−L′)∣≤∣f(x)−L∣+∣f(x)−L′∣<2ε=∣L−L′∣

(The triangle inequality, Basic properties of the absolute value, Order is preserved by adding a constant and by adding inequalities), which trichotomy forbids. So L=L′, and the notation lim⁡x→+∞f(x) denotes a single real. The same four lines, with the inequalities on x reversed, give uniqueness at −∞.

Infinite limits at a point. Let A⊆R, let c be a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R) and let f:A→R. We write

f(x)→+∞  as  x→c

when for every real M there is a real δ>0 such that f(x)>M for every x∈A with 0<∣x−c∣<δ; and f(x)→−∞ as x→c when for every real M there is a real δ>0 with f(x)<M for every such x.

This library does not write lim⁡x→cf(x)=+∞. The right-hand side would not be an element of R, and writing the equation would silently move the discussion into the extended real line, a structure that is not a field. That is the convention already fixed by Divergence to +∞ and to −∞ for sequences and by Conventions: sup⁡∅, unbounded sets, and the extended reals for suprema, and it is kept here. In particular none of the rules of Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero may be applied to a function tending to ±∞.

Combined forms. Let A be not bounded above and f:A→R. We write f(x)→+∞ as x→+∞ when for every real N there is a real M with f(x)>N for every x∈A with x>M. The other forms are obtained the same way, by pairing one of the two conditions on x (unbounded above, unbounded below) with one of the two conditions on f(x) (above every real, below every real); each is again a single abbreviation for the displayed condition, and none of them is an equation.

Remarks

Depends on

Used by

Dependency tree · two levels

27 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