Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-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.

If ff has a finite limit at cc then ff is bounded on some punctured neighbourhood of cc

Statement

Let ARA \subseteq \mathbb{R}, let cc be a limit point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), let f:ARf : A \to \mathbb{R} and suppose the limit of ff at cc exists, say limxcf(x)=L\lim_{x \to c} f(x) = L (The ε\varepsilon-δ\delta limit limxcf(x)=L\lim_{x \to c} f(x) = L of f:ARf : A \to \mathbb{R} at a limit point cc of AA). Then there are a real δ>0\delta > 0 and a real M0M \ge 0 with

f(x)Mfor every xA with 0<xc<δ;|f(x)| \le M \qquad \text{for every } x \in A \text{ with } 0 < |x - c| < \delta ;

equivalently, the image f(ANδ(c))f\bigl(A \cap N^{*}_{\delta}(c)\bigr) is a bounded subset of R\mathbb{R} (Lower bound, bounded below, bounded set, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}). One may take M=L+1M = |L| + 1.

Only local boundedness follows, never boundedness on AA. A function with a limit at cc may be unbounded on its domain, as FALSE: a function with a limit at cc is bounded on its whole domain records.

Facts & Assumptions

Given: A set ARA \subseteq \mathbb{R}, a limit point cc of AA, a function f:ARf : A \to \mathbb{R} and a real LL with limxcf(x)=L\lim_{x \to c} f(x) = L (The ε\varepsilon-δ\delta limit limxcf(x)=L\lim_{x \to c} f(x) = L of f:ARf : A \to \mathbb{R} at a limit point cc of AA, Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}).

[L1]

The limit condition: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xAx \in A with 0<xc<δ0 < |x - c| < \delta satisfies f(x)L<ε|f(x) - L| < \varepsilon (The ε\varepsilon-δ\delta limit limxcf(x)=L\lim_{x \to c} f(x) = L of f:ARf : A \to \mathbb{R} at a limit point cc of AA).

[L2]

Absolute value: u0|u| \ge 0; uuu-|u| \le u \le |u|; and for t>0t > 0, ut|u| \le t is equivalent to tut-t \le u \le t (Basic properties of the absolute value).

[L3]

Triangle inequality: u+vu+v|u + v| \le |u| + |v| (The triangle inequality).

[L4]

Order arithmetic: 0<10 < 1 (The multiplicative identity is positive); adding a constant preserves the order and adding inequalities is legitimate (Order is preserved by adding a constant and by adding inequalities); and u<vu < v implies uvu \le v. Order is preserved by adding a constant and by adding inequalities states these moves in their STRICT forms only; the non-strict forms used below follow by adjoining the equality case, in which the two sides coincide, the order being total (Ordered field).

[L5]

Bounded set: SRS \subseteq \mathbb{R} is bounded when it has both an upper and a lower bound (Lower bound, bounded below, bounded set); and Nδ(c)={y:0<yc<δ}N^{*}_{\delta}(c) = \{\, y : 0 < |y - c| < \delta \,\} (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

Proof

technique · direct
1.1

Apply [L1] with the particular value ε=1\varepsilon = 1, legitimate since 1>01 > 0: fix a real δ>0\delta > 0 such that every xAx \in A with 0<xc<δ0 < |x - c| < \delta satisfies f(x)L<1|f(x) - L| < 1.

L1L4choose
1.2

Put M:=L+1M := |L| + 1. Then M0M \ge 0, since L0|L| \ge 0 and 1>01 > 0.

L2L4
2.1

For every xAx \in A with 0<xc<δ0 < |x - c| < \delta we have f(x)=(f(x)L)+Lf(x)L+L<1+L=M|f(x)| = |(f(x) - L) + L| \le |f(x) - L| + |L| < 1 + |L| = M, hence f(x)M|f(x)| \le M.

step 1.1step 1.2L2L3L4
3.1

Therefore Mf(x)M-M \le f(x) \le M for every such xx, so MM is an upper bound and M-M a lower bound of the image f(ANδ(c))f\bigl(A \cap N^{*}_{\delta}(c)\bigr): that image is a bounded subset of R\mathbb{R}.

step 2.1L2L5

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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