Alphabeta Math
CounterexampleConstruction: 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.

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

Depends on

Used by

Dependency tree · next 3 levels

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