Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 X and Y are topological spaces and f:X→Y is sequentially continuous (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure), then f 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 with the cocountable topology to 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 carrying the cocountable topology Tcoc on the one hand and its usual topology TR on the other, and the identity function id:(R,Tcoc)→(R,TR).

[A1]

In the cocountable topology on R the open sets are ∅ 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<b in R the open interval (a,b) is uncountable (Every nondegenerate interval of 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 is at most countable (A nonempty set is at most countable iff it is a surjective image of N).

[L5]

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

Refutation

technique · direct
1.1

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

L1L2L5
1.2

By [L5] one has 1<1+1, so the interval (1, 1+1) is uncountable by [L3]; and (1, 1+1)⊆R∖(−1,1), since x>1 excludes x<1.

L1L3L5
1.3

Let (xk) be a sequence in R converging to p in the cocountable topology, and let R:={ xk:k∈N } be its range; the map k↦xk is a surjection N→R and R≠∅, so R is at most countable.

givenL4
2.1

R∖(−1,1) is not at most countable: otherwise its subset (1, 1+1) would be at most countable by [L3], contradicting step 1.2. Hence V=(−1,1) is nonempty and its complement is not at most countable, so V∉Tcoc.

step 1.2A1L3
2.2

With R as in step 1.3, the set S:=R∖{p} is at most countable by [L3], so U:=R∖S is open in the cocountable topology by [A1], and p∈U.

step 1.3A1L3
3.1

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 is not continuous.

step 1.1step 2.1A2
3.2

U is a neighbourhood of p in the cocountable topology by step 2.2, so convergence gives K∈N with xk∈U for all k≥K; and xk∈R with xk∉S=R∖{p} forces xk=p. So (xk) is eventually constant with value p.

step 2.2A2L6
4.1

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

step 3.2A2L6
5.1

By steps 3.1 and 4.1 the map id:(R,Tcoc)→(R,TR) is sequentially continuous and is not continuous, so the claim is false.

step 3.1step 4.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

77 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