Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

FALSE: a function has at most one limit at every point of its domain, isolated points included

Statement

False 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] . \qquad (\ast)

Read the claim carefully: it is about the raw formula ()(\ast), extended to an arbitrary point cc of the domain. It is not a claim about 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. That definition imposes ()(\ast) only when cc is a limit point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), and there at most one LL does satisfy it — that is exactly At a limit point of the domain a function has at most one limit, which is true and proved. The false claim is what one gets by deleting the limit-point requirement.

At an isolated point of AA the symbol limxcf(x)\lim_{x \to c} f(x) is undefined in this library, and the refutation below is the reason. If cAc \in A is not a limit point of AA then some punctured neighbourhood of cc misses AA entirely (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}); the implication inside ()(\ast) then has no instances at all for that δ\delta, so it holds vacuously, and it holds for every real LL at once. A formula satisfied by every real determines nothing, so no notation is introduced for it.

Facts & Assumptions

Given: The set A:={0}[1,2]A := \{0\} \cup [1,2] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), the constant function f:ARf : A \to \mathbb{R} with f(x):=0f(x) := 0 for every xAx \in A, and the point c:=0Ac := 0 \in A.

[L1]

The ε\varepsilon-δ\delta formula ()(\ast) 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.

[L2]

Limit point and isolated point: cc is a limit point of SS when Nε(c)SN^{*}_{\varepsilon}(c) \cap S \ne \varnothing for every real ε>0\varepsilon > 0, and cSc \in S is an isolated point of SS when Nε(c)S={c}N_{\varepsilon}(c) \cap S = \{c\} for some real ε>0\varepsilon > 0; for cSc \in S these 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: N1(0)={y:y<1}N_{1}(0) = \{\, y : |y| < 1 \,\} and N1(0)={y:0<y<1}N^{*}_{1}(0) = \{\, y : 0 < |y| < 1 \,\} (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

Absolute value and order: u0|u| \ge 0; u=0|u| = 0 exactly when u=0u = 0; u=u|u| = u for u0u \ge 0; the order is total and trichotomy holds; and 0<10 < 1, so 010 \ne 1 (Basic properties of the absolute value, The multiplicative identity is positive, Ordered field).

[L5]

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).

Refutation

technique · direct
1.1

The point 00 lies in AA, and N1(0)A={0}N_{1}(0) \cap A = \{0\}: an element of AA is either 00, which satisfies 0=0<1|0| = 0 < 1, or an element of [1,2][1,2], which satisfies y=y1|y| = y \ge 1 and so is not in N1(0)N_1(0). Hence 00 is an isolated point of AA and not a limit point of AA.

L2L3L4L5
1.2

The reals 00 and 11 are distinct.

L4
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 in ()(\ast) vacuously true, and every real LL satisfies ()(\ast) at c=0c = 0.

step 1.1L1L3L4
3.1

In particular L=0L = 0 and L=1L = 1 both satisfy ()(\ast) at c=0c = 0, and they are distinct: more than one real satisfies the formula, so the claim is false.

step 1.2step 2.1L4

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