Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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 is continuous at no point of R

Statement refuted

Refuted claim: every function R→R is continuous at at least one point (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).

The witness is the Dirichlet function, the indicator of the rationals: writing Q for the canonical copy of the rationals inside R (The rationals embed densely in the reals),

1Q:R→R,1Q(x):={1if x∈Q,0if x∉Q.

It is continuous at no point of R. The mechanism is that both Q and its complement are dense (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable), so every neighbourhood of every real contains a point of each, and the two values differ by 1.

The argument is choice free. Density is used in the form "every neighbourhood of every point meets the set", which is The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points applied to a closure equal to R; no sequence is built, so neither A point lies in the closure of A⊆R iff some sequence in A converges to it, so a subset of R is closed iff it is sequentially closed nor f is continuous at c∈A if and only if f(xk)→f(c) for every sequence in A converging to c, the converse direction costing countable choice is invoked, and the countable choice those two spend is not spent here.

Facts & Assumptions

Given: The canonical copy Q⊆R of the rationals, its complement X:=R∖Q, and the function 1Q:R→R taking the value 1 on Q and 0 on X.

[L1]

Continuity at c: for every real ε>0 there is a real δ>0 with ∣1Q(x)−1Q(c)∣<ε for every real x with ∣x−c∣<δ. So continuity at c fails as soon as some real ε0>0 admits, for every real δ>0, a real x with ∣x−c∣<δ and ∣1Q(x)−1Q(c)∣≥ε0 (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

1Q is a well-defined function: X is by definition the complement R∖Q, so every real either lies in Q or does not, exclusively; and ∣1−0∣=∣0−1∣=1, with 1/2>0 and 1/2<1 (Basic properties of the absolute value, Ordered field).

Counterexample

technique · direct
1.1

1Q is a well-defined function on R taking only the values 0 and 1, and R is the disjoint union of Q and X.

L4
1.2

Let c∈R be arbitrary, put ε0:=1/2>0, and let a real δ>0 be given.

L4
2.1

By [L2] and [L3] the neighbourhood Nδ(c) meets Q and it meets X: there are reals p∈Nδ(c)∩Q and z∈Nδ(c)∩X, so ∣p−c∣<δ and ∣z−c∣<δ, with 1Q(p)=1 and 1Q(z)=0.

step 1.2L2L3choose
3.1

If c∈Q then 1Q(c)=1 and the point x:=z satisfies ∣x−c∣<δ and ∣1Q(x)−1Q(c)∣=∣0−1∣=1≥ε0. If c∉Q then 1Q(c)=0 and the point x:=p satisfies ∣x−c∣<δ and ∣1Q(x)−1Q(c)∣=∣1−0∣=1≥ε0. By [L4] these two possibilities are exhaustive and exclusive.

step 1.1step 2.1L4
4.1

So for the fixed ε0=1/2 no real δ>0 serves at c, and by [L1] the function 1Q is not continuous at c. As c was an arbitrary real, it is continuous at no point of R, and the refuted claim is false.

step 1.2step 3.1L1∎

Remarks

Depends on

Used by

Dependency tree · two levels

34 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