Alphabeta Math
Session-authored (Fable 5 assisted)
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.

11 results · all verified · 9 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Limits of Real Functions: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

RemarkRemark: AI-generatedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The classical form of the oscillator above is sin(1/x)\sin(1/x), which this library can only construct much later

Orientation, not a claim of this library

Every analysis course states the two examples of this page in the form

sin(1/x)has no limit at 0,xsin(1/x)0 as x0,\sin(1/x) \quad \text{has no limit at } 0, \qquad x \sin(1/x) \to 0 \text{ as } x \to 0 ,

and a reader who has met them before will recognise ψ(1/x)\psi(1/x) has no limit at 00: two sequences tending to 00 give values constantly 00 and constantly 1/21/2 and xψ(1/x)0x\,\psi(1/x) \to 0 as x0x \to 0, by the squeeze theorem as those examples with ψ\psi in place of sin\sin. This remark records the correspondence, and it records that the correspondence is orientation only: the two displayed statements are reported as what the classical treatment proves, not asserted here, and nothing on this page uses or proves anything about sin\sin.

The later analytic construction

This library now constructs sine and cosine from their power series, proves their differential and addition laws, and defines pi from the first positive zero of cosine. Under this library's counterexample convention, sin(1/x) has no limit as x tends to zero displays the false proposition that the sine limit exists under Statement refuted, then proves it false; x sin(1/x) tends to zero despite its oscillation proves the squeezed limit for the product. Both occur later in the reading order, so the links are orientation-only forward references declared in this item's forward_refs; no proof on this earlier page depends on them.

What $\psi$ supplies instead

The function ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| of The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic is elementary — it needs only the integer part, the order and the absolute value — and it has the three properties that make the classical examples work:

  • it is bounded, with values exactly in [0,1/2][0, 1/2];
  • it is periodic, with period 11, so ψ(1/x)\psi(1/x) oscillates without damping as x0x \to 0;
  • it attains two distinct values on every punctured neighbourhood of 00 after the substitution x1/xx \mapsto 1/x, namely 00 at the reciprocals of the integers and 1/21/2 at the reciprocals of the half-integers.

The third property is what ψ(1/x)\psi(1/x) has no limit at 00: two sequences tending to 00 give values constantly 00 and constantly 1/21/2 uses. It is not sharper than what sin\sin would give — the classical witnessing sequences hit the extreme values of sin\sin exactly too — but it is available here: the two values 00 and 1/21/2 are read off from the integer part in one line (Integer part: for every real xx there is exactly one integer mm with mx<m+1m \le x < m + 1), with no series and no π\pi, whereas the corresponding facts about sin\sin presuppose the whole construction described above.

What is genuinely lost, and what is not

Nothing on this page is weaker for using ψ\psi. The two statements proved are exactly the statements usually proved with sin\sin, and their proofs are shorter.

What is lost is a connection to a different subject. The classical pair sin(1/x)\sin(1/x), xsin(1/x)x\sin(1/x) also carries information about smoothness, about power series and about the topologist's sine curve, none of which ψ\psi can carry, since ψ\psi is assembled from the order, the absolute value and the integer part alone. Those notions occur only later in the reading order and are unavailable on this earlier page.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

Every polynomial has limxcp(x)=p(c)\lim_{x \to c} p(x) = p(c), and rational functions do so away from the zeros of the denominator

Example

For a list a0,,an1a_0, \dots, a_{n-1} of reals write

p(x)  :=  j<najxjp(x) \;:=\; \sum_{j < n} a_j x^j

for the finite sum of Finite sums and finite products, by recursion applied to the list jajxjj \mapsto a_j x^j, with powers as in Integer powers ama^m. So j<0\sum_{j < 0} is the empty sum 00, and pp is a function RR\mathbb{R} \to \mathbb{R}; these are the polynomial functions.

Claim 1. For every polynomial function pp and every cRc \in \mathbb{R}, the limit of pp at cc exists and

limxcp(x)  =  p(c).\lim_{x \to c} p(x) \;=\; p(c) .

Claim 2. Let pp and qq be polynomial functions and let cRc \in \mathbb{R} satisfy q(c)0q(c) \ne 0. Put Aq:={xR:q(x)0}A_q := \{\, x \in \mathbb{R} : q(x) \ne 0 \,\}. Then cAqc \in A_q, the point cc is a limit point of AqA_q, the quotient p/qp/q is defined on AqA_q, its limit at cc exists, and

limxc(p/q)Aq(x)  =  p(c)q(c).\lim_{x \to c} (p/q)|_{A_q}(x) \;=\; \frac{p(c)}{q(c)} .

Everything is read off from Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero once two trivial limits are in hand: that of a constant function and that of the identity. Note that claim 1 is exactly the statement that limxcp(x)=p(c)\lim_{x \to c} p(x) = p(c), the equality that FALSE: limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) whenever both sides exist shows is not automatic; for polynomials it is a theorem, and the algebra of limits is what proves it.

Facts & Assumptions

Given: A list a0,,an1a_0, \dots, a_{n-1} of reals and the polynomial function p(x)=j<najxjp(x) = \sum_{j<n} a_j x^j; a second polynomial function qq; and a real cc (Finite sums and finite products, by recursion, Integer powers ama^m).

[L1]

The limit condition (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): limxch(x)=P\lim_{x \to c} h(x) = P 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)P<ε|h(x) - P| < \varepsilon.

[L2]

Algebra of function limits: at a limit point cc of the common domain, the limits of f+gf + g, of αf\alpha f and of fgfg exist and equal L+ML + M, αL\alpha L and LMLM; and if M0M \ne 0 the limit of (f/g)(f/g) restricted to {g0}\{g \ne 0\} exists and equals L/ML/M (Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero).

[L4]

Finite sums: j<0aj=0\sum_{j<0} a_j = 0 and j<n+1aj=(j<naj)+an\sum_{j<n+1} a_j = \bigl(\sum_{j<n} a_j\bigr) + a_n (Finite sums and finite products, by recursion).

[L5]

Powers: x0=1x^0 = 1 and xj+1=xjxx^{j+1} = x^j \cdot x for every xRx \in \mathbb{R} and jNj \in \mathbb{N} (Integer powers ama^m).

[L6]

Induction principle on N\mathbb{N} (The principle of mathematical induction).

[L8]

Absolute value: 0=0|0| = 0; and field arithmetic (Basic properties of the absolute value, Field).

Verification

technique · direct
1.1

Every cRc \in \mathbb{R} is a limit point of R\mathbb{R}, so [L1] and [L2] apply at cc to functions defined on R\mathbb{R}.

L3
1.2

A constant function xax \mapsto a has limit aa at cc: aa=0=0<ε|a - a| = |0| = 0 < \varepsilon for every real ε>0\varepsilon > 0, any δ\delta serving.

L1L8
1.3

The identity function xxx \mapsto x has limit cc at cc: given a real ε>0\varepsilon > 0, take δ:=ε\delta := \varepsilon; then 0<xc<δ0 < |x - c| < \delta gives xc<ε|x - c| < \varepsilon.

L1
2.1

For every jNj \in \mathbb{N} the function xxjx \mapsto x^j has limit cjc^j at cc. This is an induction on jj [L6]. For j=0j = 0 the function is the constant 11 by [L5], and step 1.2 applies with a=1=c0a = 1 = c^0. If the claim holds for jj, then xj+1=xjxx^{j+1} = x^j \cdot x by [L5], and the product rule of [L2] applied to xxjx \mapsto x^j and the identity gives limit cjc=cj+1c^j \cdot c = c^{j+1}.

step 1.2step 1.3L2L5L6
3.1

For every jNj \in \mathbb{N} the function xajxjx \mapsto a_j x^j has limit ajcja_j c^j at cc, by the scalar rule of [L2] applied to step 2.1 with α=aj\alpha = a_j.

step 2.1L2
4.1

For every nNn \in \mathbb{N} the function xj<najxjx \mapsto \sum_{j<n} a_j x^j has limit j<najcj\sum_{j<n} a_j c^j at cc. This is an induction on nn [L6]. For n=0n = 0 both the function and the asserted limit are the empty sum 00 by [L4], and step 1.2 applies. If the claim holds for nn, then j<n+1ajxj=(j<najxj)+anxn\sum_{j<n+1} a_j x^j = \bigl(\sum_{j<n} a_j x^j\bigr) + a_n x^n by [L4], and the sum rule of [L2] applied to the inductive hypothesis and step 3.1 gives limit (j<najcj)+ancn=j<n+1ajcj\bigl(\sum_{j<n} a_j c^j\bigr) + a_n c^n = \sum_{j<n+1} a_j c^j. Taking the given nn, the limit of pp at cc exists and equals p(c)p(c): claim 1.

step 1.2step 3.1L2L4L6
5.1

Now let qq be a polynomial function with q(c)0q(c) \ne 0 and put Aq:={xR:q(x)0}A_q := \{\, x \in \mathbb{R} : q(x) \ne 0 \,\}. By step 4.1 the limit of qq at cc exists and equals q(c)0q(c) \ne 0, so [L7] gives that cc is a limit point of AqA_q; and cAqc \in A_q because q(c)0q(c) \ne 0.

step 4.1L7
6.1

The quotient rule of [L2], applied on R\mathbb{R} to pp and qq with limxcq(x)=q(c)0\lim_{x \to c} q(x) = q(c) \ne 0, gives that the limit of (p/q)Aq(p/q)|_{A_q} at cc exists and equals p(c)/q(c)p(c)/q(c): claim 2.

step 1.1step 4.1step 5.1L2

Remarks

  • Two inductions, and why they are separate. The first builds the monomials from the identity by repeated multiplication; the second builds the polynomial from the monomials by repeated addition. Each is an induction on the recursion clause of the object it builds (Integer powers ama^m and Finite sums and finite products, by recursion respectively), and neither can be replaced by dots.

  • Index hygiene. The sum is written j<n\sum_{j<n}, whose first index is j=0j = 0 and whose empty case n=0n = 0 is the zero function; the base case of step 4.1 is that empty case, and x0=1x^0 = 1 holds for every real xx including 00 (Integer powers ama^m), so no index or value is left undefined.

  • What claim 2 does not say. It says nothing at a zero of qq. There the quotient is undefined, and whether it has a limit depends on pp as well. It may have one: on {x:x0}\{\, x : x \ne 0 \,\} the quotient x2/xx^2/x equals xx, whose limit at 00 is 00 by step 1.3 and 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. It may also fail to have one. Nothing on this page decides such cases in general.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic

Example

Identify Z\mathbb{Z} with its canonical copy in R\mathbb{R} (The integers as equivalence classes of pairs of naturals, The integers embed in the rationals, The rationals embed densely in the reals) and for xRx \in \mathbb{R} put

D(x)  :=  {xn : nZ},ψ(x)  :=  infD(x)D(x) \;:=\; \{\, |x - n| \ : \ n \in \mathbb{Z} \,\}, \qquad \psi(x) \;:=\; \inf D(x)

(Greatest lower bound (infimum)). Write m:=xm := \lfloor x \rfloor for the integer part of xx (Integer part: for every real xx there is exactly one integer mm with mx<m+1m \le x < m + 1) and t:=xmt := x - m, so 0t<10 \le t < 1. Then:

  1. Existence and attainment. ψ(x)\psi(x) exists and is attained: ψ(x)  =  min{t, 1t}  =  min{xm, x(m+1)},\psi(x) \;=\; \min\{\, t,\ 1 - t \,\} \;=\; \min\bigl\{\, |x - m|,\ |x - (m+1)| \,\bigr\} , so ψ(x)=xn\psi(x) = |x - n| for n=mn = m or n=m+1n = m + 1, and ψ(x)=minD(x)\psi(x) = \min D(x) (Maximum and minimum of a set).
  2. Range. 0ψ(x)1/20 \le \psi(x) \le 1/2 for every real xx, and every value in [0,1/2][0, 1/2] occurs: the range of ψ\psi is exactly the interval [0,1/2][0, 1/2] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).
  3. Zero set. ψ(x)=0\psi(x) = 0 if and only if xZx \in \mathbb{Z}.
  4. Half-integers. ψ(m+1/2)=1/2\psi(m + 1/2) = 1/2 for every mZm \in \mathbb{Z}.
  5. Periodicity. ψ(x+1)=ψ(x)\psi(x + 1) = \psi(x) for every real xx.

What this function is for. It is the elementary, trigonometry-free substitute for sin\sin: it is bounded, it oscillates, and on every punctured neighbourhood of 00 the composite ψ(1/x)\psi(1/x) attains both the value 00 and the value 1/21/2. Claims 3 and 4 are exactly what the companion counterexample ψ(1/x)\psi(1/x) has no limit at 00: two sequences tending to 00 give values constantly 00 and constantly 1/21/2 evaluates, and claim 2 is what the squeeze argument of xψ(1/x)0x\,\psi(1/x) \to 0 as x0x \to 0, by the squeeze theorem uses.

Facts & Assumptions

Given: A real xx; the set D(x)={xn:nZ}D(x) = \{\, |x - n| : n \in \mathbb{Z} \,\}; the integer m:=xm := \lfloor x \rfloor and the real t:=xmt := x - m. Integers are identified with their canonical copies in R\mathbb{R}.

[L1]

Integer part: for every real xx there is exactly one integer mm with mx<m+1m \le x < m + 1 (Integer part: for every real xx there is exactly one integer mm with mx<m+1m \le x < m + 1). Hence 0t<10 \le t < 1 and 0<1t10 < 1 - t \le 1, where 1t=(m+1)x1 - t = (m+1) - x.

[L2]

Integers in R\mathbb{R}: the embeddings NZQR\mathbb{N} \to \mathbb{Z} \to \mathbb{Q} \to \mathbb{R} are injective and preserve 00, 11, addition and order; Z\mathbb{Z} is a totally ordered commutative ring, closed under nn+1n \mapsto n + 1 and nn1n \mapsto n - 1; every integer 0\ge 0 is the image of a unique natural; and a natural j0j \ne 0 satisfies j1j \ge 1, so an integer >0> 0 is 1\ge 1 and consequently, for integers n<nn < n', one has n+1nn + 1 \le n' (The integers as equivalence classes of pairs of naturals, The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals, The integers form a totally ordered ring, The integers form a commutative ring, Discreteness: σ(n)\sigma(n) is the immediate successor, The natural numbers N\mathbb{N} (von Neumann)).

[L3]

Infimum: =infS\ell = \inf S when s\ell \le s for every sSs \in S and \ell' \le \ell for every lower bound \ell' of SS. So a lower bound of SS that belongs to SS is the infimum, and is then also the minimum of SS (Greatest lower bound (infimum), Maximum and minimum of a set, Lower bound, bounded below, bounded set).

[L4]

Absolute value: u0|u| \ge 0; u=0|u| = 0 exactly when u=0u = 0; u=u|u| = u for u0u \ge 0 and u=u|u| = -u for u0u \le 0 (Basic properties of the absolute value, Absolute value in an ordered field).

[L5]

Order and field arithmetic in R\mathbb{R}: the order is total and trichotomy holds; translation invariance and adding inequalities (Order is preserved by adding a constant and by adding inequalities); 0<10 < 1 (The multiplicative identity is positive), so 2>02 > 0, 1/2>01/2 > 0 (Inverses of positives are positive, and reciprocation reverses order), 1/2<11/2 < 1 and 11/2=1/21 - 1/2 = 1/2 (Sign rules for products and monotonicity of multiplication, Field); and the minimum of a two-element set of reals (Maximum and minimum of a set, Ordered field).

Verification

technique · direct
1.1

D(x)D(x) is nonempty and 00 is a lower bound of it: the integer 00 gives x0D(x)|x - 0| \in D(x), and xn0|x - n| \ge 0 for every nZn \in \mathbb{Z}.

L2L4
1.2

By [L1] the integer m=xm = \lfloor x \rfloor satisfies mx<m+1m \le x < m + 1, so t=xmt = x - m satisfies 0t<10 \le t < 1, and (m+1)x=1t(m+1) - x = 1 - t satisfies 0<1t10 < 1 - t \le 1.

L1L5
2.1

Every element of D(x)D(x) is at least min{t,1t}\min\{t, 1-t\}. Let nZn \in \mathbb{Z}. By [L2] and totality either nmn \le m or m<nm < n, and in the second case m+1nm + 1 \le n. If nmn \le m then xnxm=t0x - n \ge x - m = t \ge 0, so xn=xnt|x - n| = x - n \ge t. If m+1nm + 1 \le n then nx(m+1)x=1t>0n - x \ge (m+1) - x = 1 - t > 0, so xn=nx1t|x - n| = n - x \ge 1 - t. In both cases xnmin{t,1t}|x - n| \ge \min\{t, 1-t\}.

step 1.2L2L4L5
2.2

Both tt and 1t1 - t belong to D(x)D(x): since t0t \ge 0 we have t=xmt = |x - m|, and since 1t>01 - t > 0 we have 1t=x(m+1)1 - t = |x - (m+1)|, with mm and m+1m+1 in Z\mathbb{Z}.

step 1.2L2L4
3.1

Hence min{t,1t}\min\{t, 1-t\} is a lower bound of D(x)D(x) belonging to D(x)D(x), so by [L3] it is the greatest lower bound and also the minimum: ψ(x)=min{t,1t}=min{xm,x(m+1)}\psi(x) = \min\{t, 1-t\} = \min\{|x - m|, |x - (m+1)|\}, attained at n=mn = m or at n=m+1n = m+1. This is claim 1.

step 2.1step 2.2L3L5
4.1

Claim 2, the inclusion. ψ(x)0\psi(x) \ge 0, since t0t \ge 0 and 1t>01 - t > 0; and ψ(x)1/2\psi(x) \le 1/2: if t1/2t \le 1/2 then ψ(x)t1/2\psi(x) \le t \le 1/2, while if 1/2<t1/2 < t then 1t<11/2=1/21 - t < 1 - 1/2 = 1/2 and ψ(x)1t<1/2\psi(x) \le 1 - t < 1/2. So 0ψ(x)1/20 \le \psi(x) \le 1/2 for every real xx.

step 1.2step 3.1L5
4.2

Claim 3. If ψ(x)=0\psi(x) = 0 then min{t,1t}=0\min\{t, 1-t\} = 0; since 1t>01 - t > 0 this forces t=0t = 0, that is x=mZx = m \in \mathbb{Z}. Conversely if xZx \in \mathbb{Z} then xx=0|x - x| = 0 lies in D(x)D(x) and 00 is a lower bound of D(x)D(x) by step 1.1, so ψ(x)=0\psi(x) = 0 by [L3].

step 1.1step 1.2step 3.1L3L4L5
4.3

Claim 4. Let mZm \in \mathbb{Z} and x:=m+1/2x := m + 1/2. Since 0<1/2<10 < 1/2 < 1 we have mx<m+1m \le x < m + 1, so the uniqueness in [L1] gives x=m\lfloor x \rfloor = m and t=1/2t = 1/2; then step 3.1 gives ψ(x)=min{1/2, 11/2}=min{1/2,1/2}=1/2\psi(x) = \min\{1/2,\ 1 - 1/2\} = \min\{1/2, 1/2\} = 1/2.

step 3.1L1L5
4.4

Claim 5. The map nn+1n \mapsto n + 1 is a bijection of Z\mathbb{Z} onto itself, with inverse nn1n \mapsto n - 1 [L2]; so, substituting n=n+1n = n' + 1, D(x+1)={(x+1)n:nZ}={xn:nZ}=D(x).D(x+1) = \{\, |(x+1) - n| : n \in \mathbb{Z} \,\} = \{\, |x - n'| : n' \in \mathbb{Z} \,\} = D(x) . Being infima of the same set, ψ(x+1)\psi(x+1) and ψ(x)\psi(x) are equal by step 3.1 applied at x+1x + 1 and at xx.

step 3.1L2L3
5.1

Claim 2, the exact range. Every value of ψ\psi lies in [0,1/2][0,1/2] by step 4.1. Conversely let ss satisfy 0s1/20 \le s \le 1/2; then 0s<10 \le s < 1, so 0s<0+10 \le s < 0 + 1 and the uniqueness in [L1] gives s=0\lfloor s \rfloor = 0 and t=st = s; and s1/21ss \le 1/2 \le 1 - s because 2s12s \le 1, so step 3.1 gives ψ(s)=min{s,1s}=s\psi(s) = \min\{s, 1-s\} = s. Hence the range of ψ\psi is exactly [0,1/2][0,1/2].

step 3.1step 4.1L1L5
6.1

So ψ\psi is defined at every real, is attained at a nearest integer, has range exactly [0,1/2][0,1/2], vanishes exactly on Z\mathbb{Z}, takes the value 1/21/2 at every half-integer, and is 11-periodic.

step 3.1step 4.1step 4.2step 4.3step 4.4step 5.1

Remarks

  • No completeness of R\mathbb{R} is needed for the infimum here. The general existence theorem Every nonempty set bounded below has an infimum would supply infD(x)\inf D(x) from the least-upper-bound property, but step 3.1 does not use it: the infimum is produced by exhibiting an element of D(x)D(x) that is also a lower bound, which is Greatest lower bound (infimum) read directly. Completeness does enter, once, through Integer part: for every real xx there is exactly one integer mm with mx<m+1m \le x < m + 1, whose existence half is the Archimedean property.

  • Why min{t,1t}\min\{t, 1-t\} and not "the distance to the nearest integer". The phrase presupposes that a nearest integer exists, which is exactly what step 2.2 establishes and what the picture cannot. When t=1/2t = 1/2 there are two nearest integers, mm and m+1m+1, and the formula is indifferent to which is chosen, so nothing has to be selected.

  • ψ\psi is the triangle wave of amplitude 1/21/2 and period 11 — not the sawtooth xxx - \lfloor x \rfloor, which drops discontinuously at every integer: on [0,1/2][0, 1/2] it is ψ(s)=s\psi(s) = s by step 5.1, and periodicity and the reflection ψ(x)=ψ(x)\psi(-x) = \psi(x) — immediate from D(x)={xn:nZ}={x+n:nZ}=D(x)D(-x) = \{\, |-x - n| : n \in \mathbb{Z} \,\} = \{\, |x + n| : n \in \mathbb{Z} \,\} = D(x), using u=u|-u| = |u| and the bijection nnn \mapsto -n of Z\mathbb{Z} — determine it everywhere.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

xψ(1/x)0x\,\psi(1/x) \to 0 as x0x \to 0, by the squeeze theorem

Example

Let A:=R{0}A := \mathbb{R} \setminus \{0\} and define h:ARh : A \to \mathbb{R} by

h(x)  :=  xψ(1/x),h(x) \;:=\; x \cdot \psi(1/x),

with ψ\psi as in The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic. Then 00 is a limit point of AA, the limit of hh at 00 exists, and

limx0h(x)  =  0.\lim_{x \to 0} h(x) \;=\; 0 .

The point of the example. The factor ψ(1/x)\psi(1/x) has no limit at 00 at all (ψ(1/x)\psi(1/x) has no limit at 00: two sequences tending to 00 give values constantly 00 and constantly 1/21/2), so Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero cannot be applied to the product: its product rule requires both factors to have limits. What is available is that ψ(1/x)\psi(1/x) stays inside [0,1/2][0,1/2], and a bounded factor multiplied by one tending to 00 is killed. That is exactly what If fghf \le g \le h near cc and ff and hh have the same limit at cc, then so does gg delivers, and it delivers the existence of the limit, not merely its value.

Facts & Assumptions

[L2]

The limit condition (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): limxcf(x)=P\lim_{x \to c} f(x) = P means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain with 0<xc<δ0 < |x - c| < \delta satisfies f(x)P<ε|f(x) - P| < \varepsilon.

[L3]

Squeeze theorem: if fgkf \le g \le k on ANη(c)A \cap N^{*}_{\eta}(c) for some real η>0\eta > 0, and the limits of ff and of kk at cc exist and are equal to LL, then the limit of gg at cc exists and equals LL (If fghf \le g \le h near cc and ff and hh have the same limit at cc, then so does gg).

[L4]

Absolute value: u0|u| \ge 0; u=0|u| = 0 exactly when u=0u = 0; uv=uv|uv| = |u|\,|v|; u=u|-u| = |u|; u=u|u| = u for u0u \ge 0; and uuu-|u| \le u \le |u| (Basic properties of the absolute value).

[L5]

Order and field arithmetic: x0x \ne 0 has an inverse 1/x1/x (Field); 0<10 < 1, so 2>02 > 0 and 1/2>01/2 > 0 with t/2<tt/2 < t for t>0t > 0 (The multiplicative identity is positive, Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication); multiplying an inequality by a non-negative factor, and adding inequalities (Sign rules for products and monotonicity of multiplication, Order is preserved by adding a constant and by adding inequalities); the order is total (Ordered field). Those two sources state their moves in their STRICT forms only; the non-strict forms used below follow by adjoining the equality case, in which the two sides coincide (Ordered field).

Verification

technique · direct
1.1

00 is a limit point of A=R{0}A = \mathbb{R} \setminus \{0\}: given a real ε>0\varepsilon > 0, the real ε/2\varepsilon/2 satisfies ε/2>0\varepsilon/2 > 0, so it lies in AA, and 0<ε/20=ε/2<ε0 < |\varepsilon/2 - 0| = \varepsilon/2 < \varepsilon.

L4L5L6
1.2

hh is defined on all of AA, and h(x)x/2|h(x)| \le |x|/2 there: for xAx \in A we have x0x \ne 0, so 1/x1/x exists, and h(x)=xψ(1/x)|h(x)| = |x| \cdot \psi(1/x) by [L4], while 0ψ(1/x)1/20 \le \psi(1/x) \le 1/2 by [L1] and x0|x| \ge 0, so multiplying the inequality ψ(1/x)1/2\psi(1/x) \le 1/2 by the non-negative factor x|x| gives h(x)x/2|h(x)| \le |x|/2.

L1L4L5
1.3

The two functions xx/2x \mapsto -|x|/2 and xx/2x \mapsto |x|/2 on AA each have limit 00 at 00: given a real ε>0\varepsilon > 0, take δ:=ε\delta := \varepsilon; every xAx \in A with 0<x0<δ0 < |x - 0| < \delta satisfies x/20=x/2<ε/2<ε\bigl| |x|/2 - 0 \bigr| = |x|/2 < \varepsilon/2 < \varepsilon, and likewise x/20=x/2<ε\bigl| -|x|/2 - 0 \bigr| = |x|/2 < \varepsilon.

L2L4L5
2.1

Hence x/2h(x)x/2-|x|/2 \le h(x) \le |x|/2 for every xAx \in A, by [L4] applied to h(x)x/2|h(x)| \le |x|/2.

step 1.2L4
3.1

The three functions satisfy x/2h(x)x/2-|x|/2 \le h(x) \le |x|/2 on all of AA, in particular on AN1(0)A \cap N^{*}_{1}(0), and the two outer ones have limit 00 at 00; since 00 is a limit point of AA, the squeeze theorem [L3] gives that the limit of hh at 00 exists and equals 00.

step 1.1step 1.3step 2.1L3

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The sign function has both one-sided limits at 00 and no two-sided limit

Example

Define sgn:RR\operatorname{sgn} : \mathbb{R} \to \mathbb{R} by

sgn(x):={1x>0,0x=0,1x<0.\operatorname{sgn}(x) := \begin{cases} 1 & x > 0, \\ 0 & x = 0, \\ -1 & x < 0. \end{cases}

Then 00 is a limit point of both (0,)(0,\infty) and (,0)(-\infty,0), both one-sided limits at 00 exist (The left and right limits of ff at cc, as limits of the restrictions of ff to A(,c)A \cap (-\infty, c) and A(c,)A \cap (c, \infty)),

limx0+sgn(x)=1,limx0sgn(x)=1,\lim_{x \to 0^{+}} \operatorname{sgn}(x) = 1, \qquad \lim_{x \to 0^{-}} \operatorname{sgn}(x) = -1 ,

and sgn\operatorname{sgn} has no limit at 00.

This is the standard illustration of If cc is a limit point of the domain from both sides, the limit exists iff both one-sided limits exist and agree: the two one-sided limits both exist, so nothing is missing on either side, yet they disagree, and disagreement is exactly what the theorem converts into the failure of the two-sided limit. Note also that the value sgn(0)=0\operatorname{sgn}(0) = 0 is equal to neither one-sided limit, and is irrelevant to all three assertions (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).

Facts & Assumptions

Given: The function sgn:RR\operatorname{sgn} : \mathbb{R} \to \mathbb{R} above, with A:=RA := \mathbb{R}, c:=0c := 0, A+=R(0,)=(0,)A^{+} = \mathbb{R} \cap (0,\infty) = (0,\infty) and A=R(,0)=(,0)A^{-} = \mathbb{R} \cap (-\infty,0) = (-\infty,0) (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L1]

The limit condition (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): limxcf(x)=P\lim_{x \to c} f(x) = P means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain with 0<xc<δ0 < |x - c| < \delta satisfies f(x)P<ε|f(x) - P| < \varepsilon.

[L2]

One-sided limits are the limits at cc of the restrictions of ff to AA^{-} and A+A^{+}, and are well posed exactly when cc is a limit point of the set in question (The left and right limits of ff at cc, as limits of the restrictions of ff to A(,c)A \cap (-\infty, c) and A(c,)A \cap (c, \infty)).

[L4]

Absolute value: 0=0|0| = 0; u0|u| \ge 0; u=u|u| = u for u0u \ge 0 and u=u|u| = -u for u0u \le 0 (Basic properties of the absolute value).

[L5]

Order in R\mathbb{R}: trichotomy, so every real satisfies exactly one of x>0x > 0, x=0x = 0, x<0x < 0; 0<10 < 1 and hence 2>02 > 0, ε/2>0\varepsilon/2 > 0 and ε/2<ε\varepsilon/2 < \varepsilon for ε>0\varepsilon > 0; and 1(1)=1+1>01 - (-1) = 1 + 1 > 0, so 1<1-1 < 1 and in particular 111 \ne -1 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Ordered field).

[L6]

Two-sided versus one-sided: if cc is a limit point of both AA^{-} and A+A^{+} and limxcf(x)=L\lim_{x \to c} f(x) = L, then limxcf(x)=L\lim_{x \to c^{-}} f(x) = L and limxc+f(x)=L\lim_{x \to c^{+}} f(x) = L (If cc is a limit point of the domain from both sides, the limit exists iff both one-sided limits exist and agree).

[L7]

At a limit point of its domain a function has at most one limit (At a limit point of the domain a function has at most one limit); applied to the restrictions, each one-sided limit is a single real.

Verification

technique · direct
1.1

sgn\operatorname{sgn} is a well-defined function on R\mathbb{R}: by trichotomy every real satisfies exactly one of the three defining conditions.

L5
1.2

00 is a limit point of A+=(0,)A^{+} = (0,\infty) and of A=(,0)A^{-} = (-\infty,0): given a real ε>0\varepsilon > 0, the real ε/2\varepsilon/2 is positive, hence lies in A+A^{+}, and satisfies 0<ε/20=ε/2<ε0 < |\varepsilon/2 - 0| = \varepsilon/2 < \varepsilon; and ε/2-\varepsilon/2 is negative, hence lies in AA^{-}, and satisfies 0<ε/20=ε/2<ε0 < |-\varepsilon/2 - 0| = \varepsilon/2 < \varepsilon.

L3L4L5
1.3

The reals 11 and 1-1 are distinct, since 1(1)=1+1>01 - (-1) = 1 + 1 > 0.

L5
2.1

limx0+sgn(x)=1\lim_{x \to 0^{+}} \operatorname{sgn}(x) = 1: by [L2] this is the limit at 00 of the restriction of sgn\operatorname{sgn} to A+A^{+}, which is well posed by step 1.2. Given a real ε>0\varepsilon > 0, any δ>0\delta > 0 serves, since every xA+x \in A^{+} has x>0x > 0, hence sgn(x)=1\operatorname{sgn}(x) = 1 and sgn(x)1=0=0<ε|\operatorname{sgn}(x) - 1| = |0| = 0 < \varepsilon.

step 1.1step 1.2L1L2L4
2.2

limx0sgn(x)=1\lim_{x \to 0^{-}} \operatorname{sgn}(x) = -1: identically, every xAx \in A^{-} has x<0x < 0, hence sgn(x)=1\operatorname{sgn}(x) = -1 and sgn(x)(1)=0=0<ε|\operatorname{sgn}(x) - (-1)| = |0| = 0 < \varepsilon for every ε>0\varepsilon > 0 and every δ>0\delta > 0.

step 1.1step 1.2L1L2L4
3.1

Suppose sgn\operatorname{sgn} had a limit at 00, say limx0sgn(x)=L\lim_{x \to 0} \operatorname{sgn}(x) = L. Since 00 is a limit point of both AA^{-} and A+A^{+} by step 1.2, [L6] gives limx0sgn(x)=L\lim_{x \to 0^{-}} \operatorname{sgn}(x) = L and limx0+sgn(x)=L\lim_{x \to 0^{+}} \operatorname{sgn}(x) = L; each one-sided limit is single valued by [L7], so steps 2.1 and 2.2 force L=1L = 1 and L=1L = -1, contradicting step 1.3. Hence sgn\operatorname{sgn} has no limit at 00.

step 1.3step 2.1step 2.2L6L7

Remarks

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

(3x21)/(x2+x)3(3x^2 - 1)/(x^2 + x) \to 3 as x+x \to +\infty

Example

Let A:=(0,)A := (0, \infty) (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and let

f:AR,f(x):=3x21x2+xf : A \to \mathbb{R}, \qquad f(x) := \frac{3x^2 - 1}{x^2 + x}

(Integer powers ama^m). Then AA is not bounded above (Lower bound, bounded below, bounded set), so the limit at ++\infty is well posed (Limits at ++\infty and -\infty, and infinite limits at a point); it exists, and

limx+f(x)  =  3.\lim_{x \to +\infty} f(x) \;=\; 3 .

This is proved by a direct estimate, not by an algebra of limits. Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero is stated at a finite limit point of the domain, and this library proves no algebra of limits at ±\pm\infty; the familiar manipulation "divide numerator and denominator by x2x^2 and take limits termwise" is therefore not available here. Instead the whole computation is packed into one inequality, valid for x1x \ge 1:

f(x)3  =  1+3xx2+x    4x,|f(x) - 3| \;=\; \frac{1 + 3x}{x^2 + x} \;\le\; \frac{4}{x} ,

after which the Archimedean property finishes the argument.

Facts & Assumptions

Given: The set A=(0,)A = (0,\infty) and the function f(x)=(3x21)/(x2+x)f(x) = (3x^2 - 1)/(x^2 + x) on AA.

[L1]

Limits at ++\infty: for AA not bounded above, limx+f(x)=L\lim_{x \to +\infty} f(x) = L means that for every real ε>0\varepsilon > 0 there is a real MM with f(x)L<ε|f(x) - L| < \varepsilon for every xAx \in A with x>Mx > M (Limits at ++\infty and -\infty, and infinite limits at a point).

[L2]

Archimedean property: for every real tt there is a natural n1n \ge 1 with t<n1Rt < n \cdot 1_{\mathbb{R}}; and for every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (Every complete ordered field is Archimedean, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Complete ordered field (least-upper-bound property)). The canonical naturals satisfy n1R>0n \cdot 1_{\mathbb{R}} > 0 and 1n1R1 \le n \cdot 1_{\mathbb{R}} for n1n \ge 1, and are increasing in nn (Canonical naturals are positive and strictly increasing).

[L3]

Bounded set: SS is bounded above when some real is an upper bound of it (Lower bound, bounded below, bounded set); and (0,)={x:x>0}(0,\infty) = \{\, x : x > 0 \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

Order and field arithmetic: products of positives are positive and for t>0t > 0, u<vu < v is equivalent to ut<vtut < vt (Sign rules for products and monotonicity of multiplication); a>0a > 0 gives a1>0a^{-1} > 0 and 0<a<b0 < a < b gives 0<1/b<1/a0 < 1/b < 1/a, with the non-strict forms following by adjoining equality (Inverses of positives are positive, and reciprocation reverses order); adding inequalities and translation invariance (Order is preserved by adding a constant and by adding inequalities); 0<10 < 1 (The multiplicative identity is positive); the field identities (Field); transitivity and totality (Ordered field).

[L5]

Absolute value: u0|u| \ge 0, u=u|u| = u for u0u \ge 0, and u=u|-u| = |u| (Basic properties of the absolute value).

[L6]

Powers: x2=xxx^2 = x \cdot x (Integer powers ama^m).

Verification

technique · direct
1.1

ff is defined on all of AA: every xAx \in A has x>0x > 0, hence x2=xx>0x^2 = x \cdot x > 0 and x2+x>0x^2 + x > 0, so x2+x0x^2 + x \ne 0 and the quotient exists.

L3L4L6
1.2

AA is not bounded above: given a real MM, [L2] supplies a natural n1n \ge 1 with M<n1RM < n \cdot 1_{\mathbb{R}}, and n1R>0n \cdot 1_{\mathbb{R}} > 0 puts it in AA; so no real is an upper bound of AA, and the limit at ++\infty is well posed.

L2L3
2.1

For every xAx \in A, f(x)3=(3x21)3(x2+x)x2+x=13xx2+xf(x) - 3 = \dfrac{(3x^2 - 1) - 3(x^2 + x)}{x^2 + x} = \dfrac{-1 - 3x}{x^2 + x}, hence, both 1+3x1 + 3x and x2+xx^2 + x being positive, f(x)3=1+3xx2+x|f(x) - 3| = \dfrac{1 + 3x}{x^2 + x}.

step 1.1L4L5L6
3.1

For every xAx \in A with x1x \ge 1: from 1x1 \le x we get 1+3xx+3x=4x1 + 3x \le x + 3x = 4x, and from x>0x > 0 we get x2+x>x2>0x^2 + x > x^2 > 0; therefore 1+3xx2+x4xx2+x4xx2=4x\dfrac{1 + 3x}{x^2 + x} \le \dfrac{4x}{x^2 + x} \le \dfrac{4x}{x^2} = \dfrac{4}{x}, so f(x)34/x|f(x) - 3| \le 4/x.

step 2.1L4L6
4.1

Let ε>0\varepsilon > 0 be an arbitrary real. By [L2] fix a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, and put M:=4nM := 4n, where nn denotes the canonical natural n1Rn \cdot 1_{\mathbb{R}}. Since n1n \ge 1 we have M=4n4>1M = 4n \ge 4 > 1. For every xAx \in A with x>Mx > M: first x>1x > 1, so step 3.1 applies and f(x)34/x|f(x) - 3| \le 4/x; and 0<M<x0 < M < x gives 0<1/x<1/M0 < 1/x < 1/M by [L4], whence 4/x<4/M=4/(4n)=1/n<ε4/x < 4/M = 4/(4n) = 1/n < \varepsilon. So f(x)3<ε|f(x) - 3| < \varepsilon for every xAx \in A with x>Mx > M.

step 3.1L2L4L5
5.1

Since AA is not bounded above and for every real ε>0\varepsilon > 0 such an MM has been produced, the limit of ff at ++\infty exists and equals 33.

step 1.2step 4.1L1

Remarks

  • Where the estimate comes from. The exact identity of step 2.1 replaces the informal "the leading terms dominate": it makes f(x)3|f(x) - 3| a quotient of two explicit positive quantities, and step 3.1 then bounds numerator above and denominator below by the crudest possible expressions, 4x4x and x2x^2. The constant 44 is not optimal and does not need to be: the Archimedean property absorbs any constant.

  • Why the domain is (0,)(0,\infty) and not R\mathbb{R}. The denominator x2+xx^2 + x vanishes at 00 and at 1-1, so ff is not defined there; restricting to (0,)(0,\infty) both makes ff a function and makes the denominator positive, which is what lets the absolute values be dropped in step 2.1. Any domain unbounded above and avoiding the two zeros would give the same limit by the same estimate.

  • The corresponding statement at -\infty would be the limit 33 on a domain unbounded below and avoiding the two zeros of the denominator, proved from the same identity of step 2.1 with the inequalities on xx reversed. It is not asserted here and is not proved here, because nothing on these pages uses it.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

ψ(1/x)\psi(1/x) has no limit at 00: two sequences tending to 00 give values constantly 00 and constantly 1/21/2

Statement refuted

Refuted claim: the function

Φ:R{0}R,Φ(x):=ψ(1/x),\Phi : \mathbb{R} \setminus \{0\} \to \mathbb{R}, \qquad \Phi(x) := \psi(1/x) ,

with ψ\psi the distance to the integers (The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic), has a limit at 00 (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).

Φ\Phi is bounded — 0Φ(x)1/20 \le \Phi(x) \le 1/2 for every x0x \ne 0, by claim 2 of The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic — and 00 is a limit point of its domain, so every hypothesis that might plausibly deliver a limit except the limit itself is present. Boundedness near a point is therefore not sufficient for a limit to exist, and the converse of If ff has a finite limit at cc then ff is bounded on some punctured neighbourhood of cc fails.

The refutation exhibits two sequences of positive reals tending to 00 along which Φ\Phi is constantly 00 and constantly 1/21/2, and applies A function has no limit at cc as soon as two sequences in A{c}A \setminus \{c\} tending to cc give different limits of the values.

Facts & Assumptions

Given: The function Φ(x)=ψ(1/x)\Phi(x) = \psi(1/x) on R{0}\mathbb{R} \setminus \{0\}, and the sequences xk:=1/(k+1)x_k := 1/(k+1) and yk:=2/(2k+1)y_k := 2/(2k+1) for kNk \in \mathbb{N}. Sequences are functions on N\mathbb{N} and N\mathbb{N} contains 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences, The natural numbers N\mathbb{N} (von Neumann)), so the first terms are x0=1x_0 = 1 and y0=2y_0 = 2; the denominators k+1k+1 and 2k+12k+1 are canonical naturals 1\ge 1, never 00, which is why the sequences are written this way and not as 1/k1/k.

[L1]

The function ψ\psi vanishes exactly on Z\mathbb{Z}, satisfies ψ(m+1/2)=1/2\psi(m + 1/2) = 1/2 for every mZm \in \mathbb{Z}, and takes values in [0,1/2][0,1/2] (The trigonometry-free oscillator ψ(x)=infnZxn\psi(x) = \inf_{n \in \mathbb{Z}} |x - n| is well defined and attained at a nearest integer, takes values in [0,1/2][0, 1/2], vanishes exactly on Z\mathbb{Z}, equals 1/21/2 at half-integers, and is 11-periodic, claims 2, 3 and 4).

[L2]

Nonexistence criterion: if two sequences with all terms in A{c}A \setminus \{c\} converge to cc while the image sequences converge to distinct reals, then ff has no limit at cc (A function has no limit at cc as soon as two sequences in A{c}A \setminus \{c\} tending to cc give different limits of the values).

[L3]

Sequential convergence, and the fact that a constant sequence converges to its value (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences). Testing against every positive real rather than every positive rational defines the same relation (The rationals embed densely in the reals, remarks of Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L4]

Reciprocal Archimedean property: for every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean); canonical naturals are positive and strictly increasing in the index (Canonical naturals are positive and strictly increasing); and 0<a<b0 < a < b gives 0<1/b<1/a0 < 1/b < 1/a, with the non-strict form following by adjoining equality (Inverses of positives are positive, and reciprocation reverses order).

Counterexample

technique · direct
1.1

00 is a limit point of R{0}\mathbb{R} \setminus \{0\}: given a real ε>0\varepsilon > 0, the real ε/2\varepsilon/2 is positive, hence lies in R{0}\mathbb{R} \setminus \{0\}, and 0<ε/20=ε/2<ε0 < |\varepsilon/2 - 0| = \varepsilon/2 < \varepsilon.

L5L6
1.2

For every kNk \in \mathbb{N} the terms xk=1/(k+1)x_k = 1/(k+1) and yk=2/(2k+1)y_k = 2/(2k+1) are defined and positive, since k+11>0k + 1 \ge 1 > 0 and 2k+11>02k + 1 \ge 1 > 0; in particular xk0x_k \ne 0 and yk0y_k \ne 0, so both sequences have all their terms in R{0}\mathbb{R} \setminus \{0\}, which equals (R{0}){0}(\mathbb{R} \setminus \{0\}) \setminus \{0\}.

L4L6L7
1.3

The reals 00 and 1/21/2 are distinct, since 1/2>01/2 > 0.

L6
2.1

xk0x_k \to 0: given a real ε>0\varepsilon > 0, [L4] supplies a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon; every knk \ge n has k+1>n1k + 1 > n \ge 1, hence xk0=1/(k+1)<1/n<ε|x_k - 0| = 1/(k+1) < 1/n < \varepsilon.

step 1.2L3L4L6
2.2

yk0y_k \to 0: for every kNk \in \mathbb{N} we have 2k+1k+12k + 1 \ge k + 1, since their difference is k0k \ge 0, so 0<yk=2/(2k+1)2/(k+1)0 < y_k = 2/(2k+1) \le 2/(k+1). Given a real ε>0\varepsilon > 0, [L4] supplies a natural n1n \ge 1 with 1/n<ε/21/n < \varepsilon/2; every knk \ge n has k+1>nk + 1 > n, hence yk02/(k+1)<2/n<ε|y_k - 0| \le 2/(k+1) < 2/n < \varepsilon.

step 1.2L3L4L6
2.3

Φ(xk)=0\Phi(x_k) = 0 for every kk: 1/xk=k+11/x_k = k + 1, a canonical natural and hence an integer by [L7], so ψ(1/xk)=0\psi(1/x_k) = 0 by [L1]. The image sequence is therefore the constant sequence 00 and converges to 00.

step 1.2L1L3L7
2.4

Φ(yk)=1/2\Phi(y_k) = 1/2 for every kk: 1/yk=(2k+1)/2=k+1/21/y_k = (2k+1)/2 = k + 1/2 with kk an integer by [L7], so ψ(1/yk)=1/2\psi(1/y_k) = 1/2 by [L1]. The image sequence is therefore the constant sequence 1/21/2 and converges to 1/21/2.

step 1.2L1L3L6L7
3.1

So (xk)(x_k) and (yk)(y_k) have all their terms in (R{0}){0}(\mathbb{R} \setminus \{0\}) \setminus \{0\} and both converge to 00, which is a limit point of R{0}\mathbb{R} \setminus \{0\}, while the image sequences converge to the distinct reals 00 and 1/21/2. By [L2], Φ\Phi has no limit at 00.

step 1.1step 1.3step 2.1step 2.2step 2.3step 2.4L2

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The function equal to 00 off the origin and to 11 at the origin has limit 010 \ne 1 there

Statement refuted

Refuted claim: if cAc \in A is a limit point of ARA \subseteq \mathbb{R} and f:ARf : A \to \mathbb{R} has a limit at cc, then limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) — the false statement FALSE: limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) whenever both sides exist.

The witness is the smallest one available: the function

f:RR,f(x):={0x0,1x=0,f : \mathbb{R} \to \mathbb{R}, \qquad f(x) := \begin{cases} 0 & x \ne 0, \\ 1 & x = 0, \end{cases}

at the point c=0c = 0. It has limit 00 there, while f(0)=1f(0) = 1.

Beyond refuting the claim, this item records two further facts about the same witness, both used elsewhere on the page: both one-sided limits at 00 also equal 00, so the defect is not a jump; and changing the single value f(0)f(0) to 00 produces a function with the same limit and the equality restored. That is what makes this a removable defect, and it is the pattern the composition counterexample With g0g \equiv 0 and ff equal to 00 off the origin and 11 at it, limg=0\lim g = 0 and limy0f=0\lim_{y \to 0} f = 0 while fg1f \circ g \equiv 1 exploits.

Facts & Assumptions

Given: The function f:RRf : \mathbb{R} \to \mathbb{R} above and the point c:=0c := 0; and the constant function g:RRg : \mathbb{R} \to \mathbb{R} with g(x):=0g(x) := 0 for every xx.

[L1]

The limit condition (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): limxch(x)=P\lim_{x \to c} h(x) = P means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain with 0<xc<δ0 < |x - c| < \delta satisfies h(x)P<ε|h(x) - P| < \varepsilon.

[L2]

Limit point: every real is a limit point of R\mathbb{R}, punctured neighbourhoods being never empty; and 00 is a limit point of (0,)(0,\infty) and of (,0)(-\infty,0), since ε/2\varepsilon/2 and ε/2-\varepsilon/2 lie in them at distance ε/2\varepsilon/2 from 00 (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}, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L3]

Absolute value: 0=0|0| = 0; u=0|u| = 0 exactly when u=0u = 0 (Basic properties of the absolute value).

[L4]

Order in R\mathbb{R}: trichotomy, so every real either equals 00 or does not, exclusively; 0<10 < 1, so 101 \ne 0, and ε/2>0\varepsilon/2 > 0 for ε>0\varepsilon > 0 (The multiplicative identity is positive, Ordered field).

[L5]

One-sided limits are the limits of the restrictions to A(,c)A \cap (-\infty,c) and A(c,)A \cap (c,\infty) (The left and right limits of ff at cc, as limits of the restrictions of ff to A(,c)A \cap (-\infty, c) and A(c,)A \cap (c, \infty)).

[L6]

Locality: if two functions on AA agree on ANη(c)A \cap N^{*}_{\eta}(c) for some real η>0\eta > 0, they have the same limits at cc (claim 1 of 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).

Counterexample

technique · direct
1.1

ff is a well-defined function on R\mathbb{R}, by trichotomy; and 0R0 \in \mathbb{R} is a limit point of R\mathbb{R}.

L2L4
1.2

The reals 00 and 11 are distinct.

L4
2.1

The limit of ff at 00 exists and equals 00: given an arbitrary real ε>0\varepsilon > 0, take δ:=1>0\delta := 1 > 0; every xRx \in \mathbb{R} with 0<x0<10 < |x - 0| < 1 has x0|x| \ne 0, hence x0x \ne 0, hence f(x)=0f(x) = 0 and f(x)0=0=0<ε|f(x) - 0| = |0| = 0 < \varepsilon.

step 1.1L1L3L4
2.2

Both one-sided limits of ff at 00 exist and equal 00: the point 00 is a limit point of (0,)(0,\infty) and of (,0)(-\infty,0) by [L2], and every xx in either set satisfies x0x \ne 0, hence f(x)=0f(x) = 0; so any δ>0\delta > 0 serves in the definition of each one-sided limit.

step 1.1L1L2L3L5
3.1

Yet f(0)=1f(0) = 1, and 10=limx0f(x)1 \ne 0 = \lim_{x \to 0} f(x): at the point c=0c = 0 of the domain, which is a limit point of the domain, the limit exists and differs from the value, refuting the claim.

step 1.2step 2.1L4
3.2

Changing the single value repairs the equality: ff and the constant function gg agree at every x0x \ne 0, hence on RN1(0)\mathbb{R} \cap N^{*}_{1}(0), so by [L6] the limit of gg at 00 exists and equals 00; and g(0)=0g(0) = 0 is that limit.

step 2.1L6
4.1

So the limit at a point of the domain is independent of the value of the function there, and the two agree only under an extra hypothesis on the function, never as a consequence of the limit existing.

step 3.1step 3.2

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

With g0g \equiv 0 and ff equal to 00 off the origin and 11 at it, limg=0\lim g = 0 and limy0f=0\lim_{y \to 0} f = 0 while fg1f \circ g \equiv 1

Statement refuted

Refuted claim: if limxcg(x)=L\lim_{x \to c} g(x) = L and limyLf(y)=M\lim_{y \to L} f(y) = M then the limit of fgf \circ g at cc exists and equals MM — the false statement FALSE: limxcf(g(x))=M\lim_{x \to c} f(g(x)) = M whenever limxcg=L\lim_{x \to c} g = L and limyLf=M\lim_{y \to L} f = M.

Take A=B=RA = B = \mathbb{R}, c=0c = 0, the constant function g0g \equiv 0, and the function ff of The function equal to 00 off the origin and to 11 at the origin has limit 010 \ne 1 there, equal to 00 off the origin and to 11 at it. Then L=0L = 0, M=0M = 0, and fgf \circ g is the constant function 11, so the limit of fgf \circ g at 00 exists and equals 10=M1 \ne 0 = M.

What this item adds to the false statement. It carries the comparison through: it identifies which of the two hypotheses of Composition of limits holds under either hypothesis: ff is defined at LL with value MM, or gg avoids LL on a punctured neighbourhood of cc fails here — both do — and it shows that replacing the inner function by the identity, which satisfies hypothesis (ii), restores the conclusion with the same outer function. So neither the outer function nor the composition operation is at fault; the failure is precisely that the inner function takes the critical value.

Facts & Assumptions

Given: The function f:RRf : \mathbb{R} \to \mathbb{R} of The function equal to 00 off the origin and to 11 at the origin has limit 010 \ne 1 there, with f(y)=0f(y) = 0 for y0y \ne 0 and f(0)=1f(0) = 1; the constant function g:RRg : \mathbb{R} \to \mathbb{R}, g(x)=0g(x) = 0; the identity function ι:RR\iota : \mathbb{R} \to \mathbb{R}, ι(x)=x\iota(x) = x; and the point c:=0c := 0.

[L1]

The limit condition (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): limxch(x)=P\lim_{x \to c} h(x) = P means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain with 0<xc<δ0 < |x - c| < \delta satisfies h(x)P<ε|h(x) - P| < \varepsilon.

[L3]

The witness function: f(0)=1f(0) = 1 by its definition, and the limit of ff at 00 exists and equals 00, as verified in The function equal to 00 off the origin and to 11 at the origin has limit 010 \ne 1 there.

[L4]

Absolute value: 0=0|0| = 0; u=0|u| = 0 exactly when u=0u = 0 (Basic properties of the absolute value).

[L5]

Order in R\mathbb{R}: trichotomy, and 0<10 < 1, so 101 \ne 0 (The multiplicative identity is positive, Ordered field).

[L6]

Composition of limits, and its two extra hypotheses: (i) LBL \in B and f(L)=Mf(L) = M; (ii) some real η>0\eta > 0 has g(x)Lg(x) \ne L for every xAx \in A with 0<xc<η0 < |x - c| < \eta (Composition of limits holds under either hypothesis: ff is defined at LL with value MM, or gg avoids LL on a punctured neighbourhood of cc).

Counterexample

technique · direct
1.1

By [L3] the limit of ff at 00 exists and equals 00, and f(0)=1f(0) = 1; so the outer hypothesis of the refuted claim holds with L=0L = 0 and M=0M = 0.

L3
1.2

00 is a limit point of R\mathbb{R}, and g(R)={0}Rg(\mathbb{R}) = \{0\} \subseteq \mathbb{R} and ι(R)=R\iota(\mathbb{R}) = \mathbb{R}, so both fgf \circ g and fιf \circ \iota are functions on R\mathbb{R}.

L2
1.3

The reals 00 and 11 are distinct.

L5
2.1

The inner hypothesis holds for gg with L=0L = 0: for every real ε>0\varepsilon > 0 every δ>0\delta > 0 serves, since g(x)0=0=0<ε|g(x) - 0| = |0| = 0 < \varepsilon for every xx. So the limit of gg at 00 exists and equals 00.

step 1.2L1L4
2.2

It holds for ι\iota as well: given a real ε>0\varepsilon > 0 take δ:=ε\delta := \varepsilon; then 0<x0<δ0 < |x - 0| < \delta gives ι(x)0=x<ε|\iota(x) - 0| = |x| < \varepsilon. So the limit of ι\iota at 00 exists and equals 00.

step 1.2L1
3.1

fgf \circ g is the constant function 11: for every xRx \in \mathbb{R}, g(x)=0g(x) = 0 and hence f(g(x))=f(0)=1f(g(x)) = f(0) = 1. By the computation of step 2.1, applied to the constant 11 in place of the constant 00, the limit of fgf \circ g at 00 exists and equals 11.

step 1.1step 2.1L1L4
3.2

fι=ff \circ \iota = f, since f(ι(x))=f(x)f(\iota(x)) = f(x) for every xx; so by [L3] the limit of fιf \circ \iota at 00 exists and equals 0=M0 = M.

step 1.1step 2.2L3
4.1

Hence limx0g(x)=0=L\lim_{x \to 0} g(x) = 0 = L and limy0f(y)=0=M\lim_{y \to 0} f(y) = 0 = M, while limx0f(g(x))=10=M\lim_{x \to 0} f(g(x)) = 1 \ne 0 = M: the refuted claim is false.

step 1.3step 3.1L5
4.2

Both extra hypotheses of Composition of limits holds under either hypothesis: ff is defined at LL with value MM, or gg avoids LL on a punctured neighbourhood of cc fail for the pair (f,g)(f, g): hypothesis (i) fails because L=0L = 0 lies in B=RB = \mathbb{R} while f(L)=f(0)=10=Mf(L) = f(0) = 1 \ne 0 = M, and hypothesis (ii) fails because g(x)=0=Lg(x) = 0 = L for every xx, so no punctured neighbourhood of 00 avoids the value LL. For the pair (f,ι)(f, \iota), hypothesis (ii) does hold with η:=1\eta := 1, since ι(x)=x0\iota(x) = x \ne 0 whenever 0<x0<10 < |x - 0| < 1; and step 3.2 confirms the conclusion of the theorem there.

step 1.1step 3.1step 3.2L6
5.1

So the two safeguards in the true theorem cannot both be omitted, and the obstruction is located exactly at the values of the inner function that equal LL.

step 4.1step 4.2

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The indicator of Q\mathbb{Q} has a limit at no point of R\mathbb{R}

Statement refuted

Write Q\mathbb{Q} for the canonical copy of the rationals inside R\mathbb{R} (The rationals embed densely in the reals), X:=RQX := \mathbb{R} \setminus \mathbb{Q} for the irrationals, and let

1Q:RR,1Q(x):={1xQ,0xX.\mathbf{1}_{\mathbb{Q}} : \mathbb{R} \to \mathbb{R}, \qquad \mathbf{1}_{\mathbb{Q}}(x) := \begin{cases} 1 & x \in \mathbb{Q}, \\ 0 & x \in X. \end{cases}

Refuted claim: there is a point cRc \in \mathbb{R} at which 1Q\mathbf{1}_{\mathbb{Q}} has a limit (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).

The refutation fixes an arbitrary real cc and produces two sequences tending to cc, one of rationals and one of irrationals, both avoiding cc; the image sequences are constantly 11 and constantly 00, and A function has no limit at cc as soon as two sequences in A{c}A \setminus \{c\} tending to cc give different limits of the values applies. Since cc was arbitrary, the function has a limit nowhere.

Where the choice principle enters, and where it does not. Producing the two sequences is a use of A point lies in the closure of ARA \subseteq \mathbb{R} iff some sequence in AA converges to it, so a subset of R\mathbb{R} is closed iff it is sequentially closed, whose left-to-right direction spends countable choice, and that cost is inherited here and recorded by that item. The criterion applied afterwards is the choice-free one (A function has no limit at cc as soon as two sequences in A{c}A \setminus \{c\} tending to cc give different limits of the values).

Facts & Assumptions

Given: The canonical copy QR\mathbb{Q} \subseteq \mathbb{R} of the rationals, the irrationals X=RQX = \mathbb{R} \setminus \mathbb{Q}, the function 1Q\mathbf{1}_{\mathbb{Q}} above, and an arbitrary real cc.

[L2]

Sequential characterisation of the closure: xx lies in the closure of SS if and only if there is a sequence with all terms in SS converging to xx (A point lies in the closure of ARA \subseteq \mathbb{R} iff some sequence in AA converges to it, so a subset of R\mathbb{R} is closed iff it is sequentially closed, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals). The direction used below, from the closure to a sequence, is the one that spends countable choice, as that item records.

[L3]

Neighbourhoods: Nρ(u)={y:yu<ρ}N_{\rho}(u) = \{\, y : |y - u| < \rho \,\} for real ρ>0\rho > 0, so Nε/2(c+ε/2)={y:c<y<c+ε}N_{\varepsilon/2}(c + \varepsilon/2) = \{\, y : c < y < c + \varepsilon \,\} (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

Nonexistence criterion: if two sequences with all terms in A{c}A \setminus \{c\} converge to cc while the image sequences converge to distinct reals, then the function has no limit at cc (A function has no limit at cc as soon as two sequences in A{c}A \setminus \{c\} tending to cc give different limits of the values).

[L7]

Absolute value and order: u0|u| \ge 0 and u=u|u| = u for u0u \ge 0 (Basic properties of the absolute value); 0<10 < 1, so 2>02 > 0, ε/2>0\varepsilon/2 > 0 and ε/2<ε\varepsilon/2 < \varepsilon for ε>0\varepsilon > 0; trichotomy and totality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Inverses of positives are positive, and reciprocation reverses order, Ordered field).

Counterexample

technique · direct
1.1

Let cRc \in \mathbb{R} be arbitrary. Then cc is a limit point of R\mathbb{R}, the domain of 1Q\mathbf{1}_{\mathbb{Q}}, so the question of a limit at cc is well posed.

L5
1.2

Let SS be either Q\mathbb{Q} or XX, and let ε>0\varepsilon > 0 be an arbitrary real. Applying [L1] at the real c+ε/2c + \varepsilon/2 with the radius ε/2>0\varepsilon/2 > 0, the neighbourhood Nε/2(c+ε/2)N_{\varepsilon/2}(c + \varepsilon/2) meets SS; and by [L3] every yy in that neighbourhood satisfies c<y<c+εc < y < c + \varepsilon, hence ycy \ne c and 0<yc<ε0 < |y - c| < \varepsilon. So every neighbourhood of cc meets S{c}S \setminus \{c\}.

L1L3L7
2.1

By [L1] again, step 1.2 says exactly that cc lies in the closure of Q{c}\mathbb{Q} \setminus \{c\} and in the closure of X{c}X \setminus \{c\}. Hence [L2] supplies a sequence (qk)(q_k) with all terms in Q{c}\mathbb{Q} \setminus \{c\} converging to cc, and a sequence (uk)(u_k) with all terms in X{c}X \setminus \{c\} converging to cc.

step 1.2L1L2choose
3.1

Every term of (qk)(q_k) lies in Q\mathbb{Q}, so 1Q(qk)=1\mathbf{1}_{\mathbb{Q}}(q_k) = 1 for every kk and the image sequence is the constant sequence 11, converging to 11; every term of (uk)(u_k) lies in XX, so 1Q(uk)=0\mathbf{1}_{\mathbb{Q}}(u_k) = 0 for every kk and that image sequence converges to 00. The reals 11 and 00 are distinct.

step 2.1L6L7
4.1

Both sequences have all their terms in R{c}\mathbb{R} \setminus \{c\} and converge to cc, while their image sequences converge to distinct reals; by [L4] the function 1Q\mathbf{1}_{\mathbb{Q}} has no limit at cc. Since cRc \in \mathbb{R} was arbitrary, it has a limit at no point of R\mathbb{R}.

step 1.1step 2.1step 3.1L4

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

x1Q(x)x \cdot 1_{\mathbb{Q}}(x) has a limit at 00 and at no other point

Example

With 1Q\mathbf{1}_{\mathbb{Q}} as in The indicator of Q\mathbb{Q} has a limit at no point of R\mathbb{R}, let

d:RR,d(x):=x1Q(x),d : \mathbb{R} \to \mathbb{R}, \qquad d(x) := x \cdot \mathbf{1}_{\mathbb{Q}}(x),

so d(x)=xd(x) = x for rational xx and d(x)=0d(x) = 0 for irrational xx. Then the limit of dd at 00 exists, with

limx0d(x)=0,\lim_{x \to 0} d(x) = 0 ,

and at every c0c \ne 0 the function dd has no limit.

The point of the example. The factor 1Q\mathbf{1}_{\mathbb{Q}} has a limit nowhere; multiplying it by xx repairs exactly one point, and only that one. The repair at 00 is the squeeze theorem (If fghf \le g \le h near cc and ff and hh have the same limit at cc, then so does gg) applied to xd(x)x-|x| \le d(x) \le |x|; the failure elsewhere is the same two-sequence argument as in The indicator of Q\mathbb{Q} has a limit at no point of R\mathbb{R}, now with image limits cc and 00, which are distinct precisely because c0c \ne 0.

Facts & Assumptions

Given: The canonical copy QR\mathbb{Q} \subseteq \mathbb{R} of the rationals, the irrationals X=RQX = \mathbb{R} \setminus \mathbb{Q}, the function d(x)=x1Q(x)d(x) = x \cdot \mathbf{1}_{\mathbb{Q}}(x), and a real c0c \ne 0.

[L1]

The values of dd: d(x)=xd(x) = x for xQx \in \mathbb{Q} and d(x)=0d(x) = 0 for xXx \in X; every real lies in exactly one of Q\mathbb{Q} and XX (The indicator of Q\mathbb{Q} has a limit at no point of R\mathbb{R}).

[L2]

The limit condition (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): limxcf(x)=P\lim_{x \to c} f(x) = P means that for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xx in the domain with 0<xc<δ0 < |x - c| < \delta satisfies f(x)P<ε|f(x) - P| < \varepsilon.

[L3]

Squeeze theorem: if fgkf \le g \le k on ANη(c)A \cap N^{*}_{\eta}(c) for some real η>0\eta > 0 and the limits of ff and of kk at cc exist and are equal to LL, then the limit of gg at cc exists and equals LL (If fghf \le g \le h near cc and ff and hh have the same limit at cc, then so does gg).

[L7]

Absolute value: u0|u| \ge 0; uuu-|u| \le u \le |u|; u=u|u| = u for u0u \ge 0; 0=0|0| = 0 (Basic properties of the absolute value). Order arithmetic: trichotomy and totality; 0<10 < 1, so 2>02 > 0 and ε/2<ε\varepsilon/2 < \varepsilon for ε>0\varepsilon > 0 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field).

Verification

technique · direct
1.1

For every xRx \in \mathbb{R}, xd(x)x-|x| \le d(x) \le |x|: if xQx \in \mathbb{Q} then d(x)=xd(x) = x and xxx-|x| \le x \le |x|; if xXx \in X then d(x)=0d(x) = 0 and x0x-|x| \le 0 \le |x|.

L1L7
1.2

Every real is a limit point of R\mathbb{R}; in particular 00 and the given cc are.

L6
1.3

The functions xxx \mapsto -|x| and xxx \mapsto |x| have limit 00 at 00: given a real ε>0\varepsilon > 0 take δ:=ε\delta := \varepsilon; every xx with 0<x0<δ0 < |x - 0| < \delta satisfies x0=x<ε\bigl| |x| - 0 \bigr| = |x| < \varepsilon and x0=x<ε\bigl| -|x| - 0 \bigr| = |x| < \varepsilon.

L2L7
2.1

The three functions satisfy xd(x)x-|x| \le d(x) \le |x| on all of R\mathbb{R}, in particular on RN1(0)\mathbb{R} \cap N^{*}_{1}(0), and the outer two have limit 00 at 00; since 00 is a limit point of R\mathbb{R}, the squeeze theorem [L3] gives that the limit of dd at 00 exists and equals 00.

step 1.1step 1.2step 1.3L3
2.2

Fix the real c0c \ne 0. By [L5] there are a sequence (qk)(q_k) with all terms in Q{c}\mathbb{Q} \setminus \{c\} and a sequence (uk)(u_k) with all terms in X{c}X \setminus \{c\}, both converging to cc.

step 1.2L5choose
3.1

By [L1], d(qk)=qkd(q_k) = q_k for every kk, so the image sequence (d(qk))(d(q_k)) is (qk)(q_k) itself and converges to cc; and d(uk)=0d(u_k) = 0 for every kk, so that image sequence is constant and converges to 00. Since c0c \ne 0, the two limits are distinct, and both sequences have all their terms in R{c}\mathbb{R} \setminus \{c\} and converge to cc; by [L4] the function dd has no limit at cc.

step 2.2L1L4L7L8
4.1

So the limit of dd exists at 00, with value 00, and fails to exist at every other real: dd has a limit at exactly one point.

step 2.1step 3.1

Remarks

  • Why 00 is the exceptional point. The squeeze bound d(x)x|d(x)| \le |x| is useful only where x|x| is small, that is near 00; at any other cc the two bounding functions have limit c0|c| \ne 0 and c-|c|, which are different, so the squeeze theorem says nothing there. That is not an accident of the proof: the two-sequence argument shows the limit genuinely fails at every such cc.

  • The value d(0)=0d(0) = 0 happens to equal the limit, since 00 is rational, so dd satisfies at 00 the equality that FALSE: limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) whenever both sides exist shows is not automatic. It is the only point of R\mathbb{R} at which dd does so.

  • Contrast with ψ(1/x)\psi(1/x). There the oscillation is bounded and the failure is confined to a single point, 00, with the multiplication by xx repairing precisely that point (xψ(1/x)0x\,\psi(1/x) \to 0 as x0x \to 0, by the squeeze theorem). Here the failure is everywhere and the multiplication repairs precisely one point. The two examples are the same mechanism — a bounded factor damped by a vanishing one — applied to opposite kinds of irregularity.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

On the domain {0}[1,2]\{0\} \cup [1,2] every real is vacuously a limit at 00

Statement refuted

Refuted claim: for every ARA \subseteq \mathbb{R}, every f:ARf : A \to \mathbb{R} and every cAc \in A, at most one real LL satisfies

(ε>0) (δ>0) (xA) [ 0<xc<δ  f(x)L<ε ](\forall \varepsilon > 0)\ (\exists \delta > 0)\ (\forall x \in A)\ \bigl[\ 0 < |x - c| < \delta \ \Longrightarrow\ |f(x) - L| < \varepsilon\ \bigr]

— the false statement FALSE: a function has at most one limit at every point of its domain, isolated points included.

The witness is A:={0}[1,2]A := \{0\} \cup [1,2] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), f:ARf : A \to \mathbb{R} the constant 00, and c:=0c := 0. At cc the displayed formula holds for every real LL at once, so it determines nothing.

What this item adds. It exhibits the dichotomy inside one example: at the isolated point 00 the formula is vacuous, while at the point 11 of the same domain — which is a limit point of AA — the formula is not vacuous and At a limit point of the domain a function has at most one limit applies, so the limit there exists and is unique. The same AA, the same ff, and opposite behaviour at two of its points.

Facts & Assumptions

Given: The set A:={0}[1,2]A := \{0\} \cup [1,2], the constant function f:ARf : A \to \mathbb{R} with f(x):=0f(x) := 0 for every xAx \in A, and the points 00 and 11 of AA.

[L1]

The ε\varepsilon-δ\delta formula displayed above, and the fact that 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 imposes it only at a limit point of the domain, where At a limit point of the domain a function has at most one limit then makes LL unique.

[L2]

Limit point and isolated point: cc is a limit point of SS when Nρ(c)SN^{*}_{\rho}(c) \cap S \ne \varnothing for every real ρ>0\rho > 0; cSc \in S is isolated in SS when Nρ(c)S={c}N_{\rho}(c) \cap S = \{c\} for some real ρ>0\rho > 0; and for cSc \in S the two are exact opposites (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]

Neighbourhoods: Nρ(u)={y:yu<ρ}N_{\rho}(u) = \{\, y : |y - u| < \rho \,\} and Nρ(u)=Nρ(u){u}N^{*}_{\rho}(u) = N_{\rho}(u) \setminus \{u\} (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

Intervals: [1,2]={y:1y2}[1,2] = \{\, y : 1 \le y \le 2 \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L5]

Absolute value: u0|u| \ge 0; u=0|u| = 0 exactly when u=0u = 0; u=u|u| = u for u0u \ge 0; 0=0|0| = 0 (Basic properties of the absolute value).

[L6]

Order in R\mathbb{R}: trichotomy and totality; 0<10 < 1, so 2>02 > 0 and ρ/2>0\rho/2 > 0 with ρ/2<ρ\rho/2 < \rho for ρ>0\rho > 0; and of two positive reals the smaller is positive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field).

Counterexample

technique · direct
1.1

A={0}[1,2]A = \{0\} \cup [1,2] is a subset of R\mathbb{R}, and ff is the constant 00 on AA; both 00 and 11 belong to AA.

L4
1.2

00 is an isolated point of AA and not a limit point of AA: N1(0)A={0}N_{1}(0) \cap A = \{0\}, since an element of AA is either 00, with 00=0<1|0 - 0| = 0 < 1, or an element of [1,2][1,2], with y0=y1|y - 0| = y \ge 1 and hence outside N1(0)N_1(0).

L2L3L4L5
1.3

The reals 00 and 11 are distinct.

L6
2.1

Take δ:=1\delta := 1. No xAx \in A satisfies 0<x0<10 < |x - 0| < 1: such an xx would lie in N1(0)AN^{*}_{1}(0) \cap A, which is contained in N1(0)A={0}N_1(0) \cap A = \{0\} and excludes 00, hence is empty. So for every real LL and every real ε>0\varepsilon > 0 the choice δ=1\delta = 1 makes the implication vacuously true, and every real LL satisfies the displayed formula at c=0c = 0.

step 1.2L1L3L5
2.2

By contrast 1A1 \in A is a limit point of AA: given a real ρ>0\rho > 0, let σ\sigma be the smaller of ρ\rho and 11, so σ>0\sigma > 0; then 1+σ/21 + \sigma/2 satisfies 11+σ/21+1/221 \le 1 + \sigma/2 \le 1 + 1/2 \le 2, so it lies in [1,2]A[1,2] \subseteq A, and 0<(1+σ/2)1=σ/2<ρ0 < |(1 + \sigma/2) - 1| = \sigma/2 < \rho. There 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 applies, At a limit point of the domain a function has at most one limit gives at most one LL, and in fact limx1f(x)=0\lim_{x \to 1} f(x) = 0, since f(x)0=0=0<ε|f(x) - 0| = |0| = 0 < \varepsilon for every xAx \in A and every real ε>0\varepsilon > 0.

step 1.1L1L2L4L5L6
3.1

In particular L=0L = 0 and L=1L = 1 both satisfy the formula at c=0c = 0, and they are distinct: more than one real satisfies it, so the claim is refuted. This is why 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 is stated only at a limit point, and why limx0f(x)\lim_{x \to 0} f(x) is left undefined on this domain.

step 1.3step 2.1L1L6
4.1

So on one and the same domain the formula pins down a unique value at the limit point 11 and no value at all at the isolated point 00: uniqueness of the limit is a property of limit points, not of arbitrary points of the domain.

step 2.2step 3.1

Remarks

Sources