Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

The limit at cc depends only on the restriction of ff to a punctured neighbourhood of cc, and passes to any subset of the domain having cc as a limit point

Statement

Let ARA \subseteq \mathbb{R} and let cc be a limit point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}).

  1. Locality. Let f,g:ARf, g : A \to \mathbb{R} and LRL \in \mathbb{R}, and suppose there is a real η>0\eta > 0 with f(x)=g(x)f(x) = g(x) for every xAx \in A satisfying 0<xc<η0 < |x - c| < \eta. Then limxcf(x)=L    limxcg(x)=L\lim_{x \to c} f(x) = L \iff \lim_{x \to c} g(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).

  2. Restriction. Let BAB \subseteq A with cc a limit point of BB, let f:ARf : A \to \mathbb{R} and suppose limxcf(x)=L\lim_{x \to c} f(x) = L. Then cc is a limit point of AA as well, and limxcfB(x)=L\lim_{x \to c} f|_B(x) = L, where fB:BRf|_B : B \to \mathbb{R} is the restriction of ff.

So the limit at cc sees only the values of ff on an arbitrarily small punctured neighbourhood of cc, and it survives shrinking the domain, provided the smaller domain still accumulates at cc. Together with At a limit point of the domain a function has at most one limit this is what makes the phrase the limit at cc a local notion.

The converse of claim 2 is false in general: a restriction may have a limit where the function has none, as the one-sided limits of the sign function on the companion page show.

Facts & Assumptions

Given: A set ARA \subseteq \mathbb{R} and a limit point cc of AA; for claim 1 functions f,g:ARf, g : A \to \mathbb{R}, a real LL and a real η>0\eta > 0 with f(x)=g(x)f(x) = g(x) for every xAx \in A satisfying 0<xc<η0 < |x - c| < \eta; for claim 2 a subset BAB \subseteq A having cc as a limit point, 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: limxch(x)=L\lim_{x \to c} h(x) = L means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain of hh with 0<xc<δ0 < |x - c| < \delta satisfies h(x)L<ε|h(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]

Limit point: cc is a limit point of a set SS when for every real δ>0\delta > 0 there is xSx \in S with 0<xc<δ0 < |x - c| < \delta (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L3]

Order arithmetic: of two positive reals the smaller is positive, the order being total; and u<vwu < v \le w gives u<wu < w (Ordered field).

[L4]

Absolute value (Basic properties of the absolute value); and uniqueness of the limit at a limit point (At a limit point of the domain a function has at most one limit), which is what makes the phrase "the limit" in the statement denote.

Proof

technique · direct
1.1

For claim 1, assume limxcf(x)=L\lim_{x \to c} f(x) = L and let ε>0\varepsilon > 0 be an arbitrary real.

assume-hypL1
1.2

For claim 2, BAB \subseteq A and cc is a limit point of BB; hence cc is a limit point of AA, since for every real δ>0\delta > 0 a point xBx \in B with 0<xc<δ0 < |x - c| < \delta is also a point of AA with 0<xc<δ0 < |x - c| < \delta.

L2
1.3

For claim 2, assume limxcf(x)=L\lim_{x \to c} f(x) = L and let ε>0\varepsilon > 0 be an arbitrary real.

assume-hypL1
2.1

By [L1] fix a real δ0>0\delta_0 > 0 such that every xAx \in A with 0<xc<δ00 < |x - c| < \delta_0 satisfies f(x)L<ε|f(x) - L| < \varepsilon, and put δ\delta to be the smaller of δ0\delta_0 and η\eta, so δ>0\delta > 0.

step 1.1L1L3choose
2.2

By [L1] fix 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.

step 1.3L1choose
3.1

Every xAx \in A with 0<xc<δ0 < |x - c| < \delta satisfies both 0<xc<δ00 < |x - c| < \delta_0 and 0<xc<η0 < |x - c| < \eta, so g(x)=f(x)g(x) = f(x) and g(x)L=f(x)L<ε|g(x) - L| = |f(x) - L| < \varepsilon; as ε>0\varepsilon > 0 was arbitrary, limxcg(x)=L\lim_{x \to c} g(x) = L.

step 2.1L1L3L4
3.2

Every xBx \in B with 0<xc<δ0 < |x - c| < \delta lies in AA and satisfies 0<xc<δ0 < |x - c| < \delta, so fB(x)=f(x)f|_B(x) = f(x) and therefore f(x)L<ε|f(x) - L| < \varepsilon; as ε>0\varepsilon > 0 was arbitrary, and cc is a limit point of BB, limxcfB(x)=L\lim_{x \to c} f|_B(x) = L.

step 2.2L1L4
4.1

The hypothesis of claim 1 is symmetric in ff and gg, so interchanging their roles in steps 1.1, 2.1 and 3.1 gives the implication in the other direction, and claim 1 is proved; claim 2 is steps 1.2 and 3.2.

step 1.2step 3.1step 3.2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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