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.

In the cocountable topology on R the sequential closure of [0,1] is [0,1] while its closure is all of R

Statement refuted

Refuted: that the sequential closure of a subset of a topological space equals its closure. The sequential closure is contained in the closure, continuity implies sequential continuity, and sequential limits need not be unique asserts only the inclusion seqcl⁡(A)⊆A‾, and asserts it without any hypothesis; the witness below shows that the inclusion can be as far from an equality as it is possible to be, the two sides differing by all but a bounded interval.

Witness. Give R the cocountable topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant) and take A:=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then seqcl⁡(A)=[0,1]⊊R=A‾.

Facts & Assumptions

Given: R with the cocountable topology, and the set A=[0,1]={ t∈R:0≤t≤1 }.

[A1]

seqcl⁡(A) is the set of points to which some sequence with all terms in A converges (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L1]

In the cocountable topology on R a sequence converges if and only if it is eventually constant, and it then converges to its eventual value and to no other point (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).

[L2]

Counterexample

technique · direct
1.1

0<1 by [L3], so [0,1] is a nondegenerate closed interval and is uncountable by [L3].

L3
1.2

Let (xk) be a sequence with xk∈[0,1] for every k and suppose xk→p in the cocountable topology. By [L1] the sequence is eventually constant with value p, so p=xK for some index K, and xK∈[0,1]; hence p∈[0,1].

A1L1
1.3

Conversely every a∈[0,1] lies in seqcl⁡([0,1]), the constant sequence with value a having all its terms in [0,1] and converging to a by [L1].

A1L1
2.1

By steps 1.2 and 1.3, seqcl⁡([0,1])=[0,1].

step 1.2step 1.3
2.2

By step 1.1 the set [0,1] is uncountable, so [0,1]‾=R by [L2].

step 1.1L2
3.1

The inclusion [0,1]⊆R is strict, since 2∉[0,1]; so by steps 2.1 and 2.2 the sequential closure of [0,1] is strictly smaller than its closure, and the inclusion of [L4] cannot in general be improved to an equality.

step 2.1step 2.2L4∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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