Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 A⊆R, every f:A→R and every c∈A, at most one real L satisfies

(∀ε>0) (∃δ>0) (∀x∈A) [ 0<∣x−c∣<δ ⟹ ∣f(x)−L∣<ε ].(∗)

Read the claim carefully: it is about the raw formula (∗), extended to an arbitrary point c of the domain. It is not a claim about The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A. That definition imposes (∗) only when c is a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R), and there at most one L 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 A the symbol lim⁡x→cf(x) is undefined in this library, and the refutation below is the reason. If c∈A is not a limit point of A then some punctured neighbourhood of c misses A entirely (Limit point, isolated point, adherent point, derived set, and dense subset of R); the implication inside (∗) then has no instances at all for that δ, so it holds vacuously, and it holds for every real L 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] (Intervals of R: the nine order-convex forms, nondegeneracy, and length), the constant function f:A→R with f(x):=0 for every x∈A, and the point c:=0∈A.

[L1]

The ε-δ formula (∗) above, and the fact that The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A imposes it only at a limit point of the domain.

[L2]

Limit point and isolated point: c is a limit point of S when Nε∗(c)∩S≠∅ for every real ε>0, and c∈S is an isolated point of S when Nε(c)∩S={c} for some real ε>0; for c∈S these are exact opposites (Limit point, isolated point, adherent point, derived set, and dense subset of R, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

Neighbourhoods: N1(0)={ y:∣y∣<1 } and N1∗(0)={ y:0<∣y∣<1 } (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

Absolute value and order: ∣u∣≥0; ∣u∣=0 exactly when u=0; ∣u∣=u for u≥0; the order is total and trichotomy holds; and 0<1, so 0≠1 (Basic properties of the absolute value, The multiplicative identity is positive, Ordered field).

[L5]

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

Refutation

technique · direct
1.1

The point 0 lies in A, and N1(0)∩A={0}: an element of A is either 0, which satisfies ∣0∣=0<1, or an element of [1,2], which satisfies ∣y∣=y≥1 and so is not in N1(0). Hence 0 is an isolated point of A and not a limit point of A.

L2L3L4L5
1.2

The reals 0 and 1 are distinct.

L4
2.1

Take δ:=1. No x∈A satisfies 0<∣x−0∣<1: such an x would lie in N1∗(0)∩A, which is contained in N1(0)∩A={0} and excludes 0, hence is empty. So for every real L and every real ε>0 the choice δ=1 makes the implication in (∗) vacuously true, and every real L satisfies (∗) at c=0.

step 1.1L1L3L4
3.1

In particular L=0 and L=1 both satisfy (∗) at c=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 · two levels

22 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