Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

A function has no limit at c as soon as two sequences in A∖{c} tending to c give different limits of the values

Statement

Let A⊆R, let f:A→R and let c be a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R). Then f has no limit at c — that is, no L∈R satisfies lim⁡x→cf(x)=L (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A) — as soon as either of the following occurs.

  1. There are sequences (xk) and (yk) with all terms in A∖{c}, both converging to c, and reals P≠Q with f(xk)→P and f(yk)→Q (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals).
  2. There is a sequence (xk) with all terms in A∖{c}, converging to c, for which (f(xk)) does not converge.

Only the choice-free half of the Heine criterion is used. The proof runs the implication from condition 1 to condition 2 of Heine criterion: lim⁡x→cf(x)=L iff f(xk)→L for every sequence in A∖{c} converging to c, which is a theorem of ZF; no sequence is constructed here, both being supplied by the hypothesis. So this corollary, the workhorse for showing that a limit fails to exist, costs no choice principle at all.

Facts & Assumptions

[L1]

Heine criterion, the direction from the ε-δ limit to sequences: if lim⁡x→cf(x)=L then f(zk)→L for every sequence (zk) with all terms in A∖{c} converging to c (Heine criterion: lim⁡x→cf(x)=L iff f(xk)→L for every sequence in A∖{c} converging to c). That direction is proved without any choice principle.

[L2]

A sequence of reals has at most one limit, so two limits of the same sequence are equal, and a sequence with a limit converges (A sequence has at most one limit, Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Proof

technique · contrapositive
1.1

Each of the two claims has the form "hypothesis ⇒ f has no limit at c"; we prove the contrapositive of each, namely that if some L∈R satisfies lim⁡x→cf(x)=L then neither hypothesis can hold.

contrapositive-reduce
1.2

Assume there is L∈R with lim⁡x→cf(x)=L.

assume-hyp
2.1

Let (zk) be an arbitrary sequence with all terms in A∖{c} converging to c. By [L1], (f(zk)) converges, with limit L.

step 1.2L1
3.1

Under hypothesis 1 this applies to (xk) and to (yk): f(xk)→P and f(xk)→L give P=L by [L2], and likewise Q=L, so P=Q; hypothesis 1, which asserts P≠Q, therefore fails.

step 2.1L2
3.2

Under hypothesis 2 it applies to (xk) and gives that (f(xk)) converges; hypothesis 2, which asserts that it does not, therefore fails.

step 2.1L2
4.1

So the existence of a limit of f at c excludes both hypotheses; contrapositively, either hypothesis excludes the existence of a limit of f at c.

step 3.1step 3.2discharge-contrapositive∎

Remarks

Depends on

Used by

Dependency tree · two levels

28 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