Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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 f has a finite limit at c then f is bounded on some punctured neighbourhood of c

Statement

Let A⊆R, let c be a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R), let f:A→R and suppose the limit of f at c exists, say lim⁡x→cf(x)=L (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A). Then there are a real δ>0 and a real M≥0 with

∣f(x)∣≤Mfor every x∈A with 0<∣x−c∣<δ;

equivalently, the image f(A∩Nδ∗(c)) is a bounded subset of R (Lower bound, bounded below, bounded set, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R). One may take M=∣L∣+1.

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

Facts & Assumptions

Given: A set A⊆R, a limit point c of A, a function f:A→R and a real L with lim⁡x→cf(x)=L (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A, Limit point, isolated point, adherent point, derived set, and dense subset of R).

[L1]

The limit condition: for every real ε>0 there is a real δ>0 such that every x∈A with 0<∣x−c∣<δ satisfies ∣f(x)−L∣<ε (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A).

[L2]

Absolute value: ∣u∣≥0; −∣u∣≤u≤∣u∣; and for t>0, ∣u∣≤t is equivalent to −t≤u≤t (Basic properties of the absolute value).

[L3]

Triangle inequality: ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

[L4]

Order arithmetic: 0<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<v implies u≤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: S⊆R is bounded when it has both an upper and a lower bound (Lower bound, bounded below, bounded set); and Nδ∗(c)={ y:0<∣y−c∣<δ } (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

Proof

technique · direct
1.1

Apply [L1] with the particular value ε=1, legitimate since 1>0: fix a real δ>0 such that every x∈A with 0<∣x−c∣<δ satisfies ∣f(x)−L∣<1.

L1L4choose
1.2

Put M:=∣L∣+1. Then M≥0, since ∣L∣≥0 and 1>0.

L2L4
2.1

For every x∈A with 0<∣x−c∣<δ we have ∣f(x)∣=∣(f(x)−L)+L∣≤∣f(x)−L∣+∣L∣<1+∣L∣=M, hence ∣f(x)∣≤M.

step 1.1step 1.2L2L3L4
3.1

Therefore −M≤f(x)≤M for every such x, so M is an upper bound and −M a lower bound of the image f(A∩Nδ∗(c)): that image is a bounded subset of R.

step 2.1L2L5∎

Remarks

Depends on

Used by

Dependency tree · two levels

20 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