Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 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.

The identity from the cocountable topology on R to the usual topology is sequentially continuous and not continuous

Statement refuted

Facts & Assumptions

Given: R carrying Tcoc as source and TR as target, and the identity function between them.

[A1]

The open sets of Tcoc are ∅ together with the sets of at most countable complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

In (R,Tcoc) a sequence converges if and only if it is eventually constant, and then to its eventual value (In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant, claim 3).

[L4]

For a<b the interval (a,b) is uncountable (Every nondegenerate interval of R is uncountable), and every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

Counterexample

technique · direct
1.1

V:=B(0,1)=(−1,1) is open in the usual topology, the radius 1 being positive by [L5].

L2L5
1.2

1<1+1 by [L5], so (1, 1+1) is uncountable by [L4], and it is contained in R∖(−1,1), a point x>1 satisfying neither x<1 nor −1<x<1.

L4L5
1.3

Let (xk) be a sequence converging to p in (R,Tcoc); by [L1] it is eventually constant with value p, say xk=p for all k≥K.

L1
2.1

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

step 1.2A1L4
2.2

The image sequence id(xk)=xk of step 1.3 is eventually equal to p, so for every neighbourhood N of p in the usual topology one has p∈N and hence xk∈N for all k≥K; that is id(xk)→id(p) in the usual topology. As (xk) and p were arbitrary, id is sequentially continuous.

step 1.3L3
3.1

id−1[V]=V is open in the target by step 1.1 and not open in the source by step 2.1, so id is not continuous; with step 2.2 the witness is established and the claim of FALSE: a sequentially continuous map between topological spaces is continuous is refuted.

step 1.1step 2.1step 2.2L3∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 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