Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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 sequentially continuous map between topological spaces is continuous

Statement

False claim: if XX and YY are topological spaces and f:XYf : X \to Y is sequentially continuous (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure), then ff is continuous (Continuity of a map of topological spaces at a point and globally).

One half of the relation between the two notions is a theorem: continuity always implies sequential continuity, and, assuming the Axiom of Countable Choice, in a first countable source the converse holds as well (Assuming Countable Choice, in a first countable space sequential closure equals closure and sequential continuity at a point equals continuity there). The claim above drops the first-countability hypothesis, and the witness is the identity map from R\mathbb{R} with the cocountable topology to R\mathbb{R} with its usual topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and it is exhibited in full below rather than cited, so that this page does not depend on its companion.

Facts & Assumptions

Given: The set R\mathbb{R} carrying the cocountable topology Tcoc\mathcal{T}_{\mathrm{coc}} on the one hand and its usual topology TR\mathcal{T}_{\mathbb{R}} on the other, and the identity function id:(R,Tcoc)(R,TR)\mathrm{id} : (\mathbb{R}, \mathcal{T}_{\mathrm{coc}}) \to (\mathbb{R}, \mathcal{T}_{\mathbb{R}}).

[A1]

In the cocountable topology on R\mathbb{R} the open sets are \varnothing together with the sets whose complement is at most countable (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable).

[L3]

For a<ba < b in R\mathbb{R} the open interval (a,b)(a,b) is uncountable (Every nondegenerate interval of R\mathbb{R} is uncountable); every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L4]

A nonempty set admitting a surjection from N\mathbb{N} is at most countable (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}).

[L5]

0<10 < 1 in R\mathbb{R} (The multiplicative identity is positive), and adding 11 to both sides of 0<10 < 1 gives 1<1+11 < 1 + 1 (Order is preserved by adding a constant and by adding inequalities).

Refutation

technique · direct
1.1

The radius 11 is positive by [L5], so V:=B(0,1)=(1,1)V := B(0,1) = (-1, 1) is a ball, and it is open in the usual topology of R\mathbb{R}.

L1L2L5
1.2

By [L5] one has 1<1+11 < 1+1, so the interval (1, 1+1)(1,\ 1+1) is uncountable by [L3]; and (1, 1+1)R(1,1)(1,\ 1+1) \subseteq \mathbb{R} \setminus (-1,1), since x>1x > 1 excludes x<1x < 1.

L1L3L5
1.3

Let (xk)(x_k) be a sequence in R\mathbb{R} converging to pp in the cocountable topology, and let R:={xk:kN}R := \{\, x_k : k \in \mathbb{N} \,\} be its range; the map kxkk \mapsto x_k is a surjection NR\mathbb{N} \to R and RR \ne \varnothing, so RR is at most countable.

givenL4
2.1

R(1,1)\mathbb{R} \setminus (-1,1) is not at most countable: otherwise its subset (1, 1+1)(1,\ 1+1) would be at most countable by [L3], contradicting step 1.2. Hence V=(1,1)V = (-1,1) is nonempty and its complement is not at most countable, so VTcocV \notin \mathcal{T}_{\mathrm{coc}}.

step 1.2A1L3
2.2

With RR as in step 1.3, the set S:=R{p}S := R \setminus \{p\} is at most countable by [L3], so U:=RSU := \mathbb{R} \setminus S is open in the cocountable topology by [A1], and pUp \in U.

step 1.3A1L3
3.1

id1[V]=V\mathrm{id}^{-1}[V] = V, which is open in the usual topology by step 1.1 and not open in the cocountable topology by step 2.1; so id\mathrm{id} is not continuous.

step 1.1step 2.1A2
3.2

UU is a neighbourhood of pp in the cocountable topology by step 2.2, so convergence gives KNK \in \mathbb{N} with xkUx_k \in U for all kKk \ge K; and xkRx_k \in R with xkS=R{p}x_k \notin S = R \setminus \{p\} forces xk=px_k = p. So (xk)(x_k) is eventually constant with value pp.

step 2.2A2L6
4.1

An eventually constant sequence with eventual value pp converges to pp in every topology on R\mathbb{R}, since every neighbourhood of pp contains pp; in particular id(xk)=xkp=id(p)\mathrm{id}(x_k) = x_k \to p = \mathrm{id}(p) in the usual topology. As (xk)(x_k) and pp were arbitrary, id\mathrm{id} is sequentially continuous.

step 3.2A2L6
5.1

By steps 3.1 and 4.1 the map id:(R,Tcoc)(R,TR)\mathrm{id} : (\mathbb{R},\mathcal{T}_{\mathrm{coc}}) \to (\mathbb{R},\mathcal{T}_{\mathbb{R}}) is sequentially continuous and is not continuous, so the claim is false.

step 3.1step 4.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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