Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

The sequential closure is contained in the closure, continuity implies sequential continuity, and sequential limits need not be unique

Statement

Let X and Y be topological spaces, with convergence, sequential closure and sequential continuity as in Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure. Then:

  1. A⊆seqcl⁡(A)⊆A‾ for every A⊆X.
  2. If f:X→Y is continuous at p∈X (Continuity of a map of topological spaces at a point and globally) then f is sequentially continuous at p.
  3. Sequential limits need not be unique. In the indiscrete topology on a set X with at least two points (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), every sequence in X converges to every point of X.

Claim 3 is why this library never writes lim⁡kxk for a sequence in a general topological space: the symbol would not denote.

Facts & Assumptions

Given: Topological spaces X and Y, a subset A⊆X, a point p∈X, a function f:X→Y, and a sequence (xk) in X.

[A1]

xk→p means that for every neighbourhood N of p there is K∈N with xk∈N for all k≥K; seqcl⁡(A) is the set of points to which some sequence with all terms in A converges; f is sequentially continuous at p when xk→p implies f(xk)→f(p) (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[A2]

f is continuous at p when f−1[V] is a neighbourhood of p for every neighbourhood V of f(p) (Continuity of a map of topological spaces at a point and globally).

[L2]
[L3]

In the indiscrete topology on X the only open sets are ∅ and X (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

Proof

technique · direct
1.1

A⊆seqcl⁡(A): for a∈A the constant sequence xk:=a has all its terms in A, and it converges to a because every neighbourhood of a contains a, so the condition holds with K=0.

A1L2
1.2

Let p∈seqcl⁡(A) and fix a sequence (xk) with xk∈A for all k and xk→p; let N be any neighbourhood of p. Then xk∈N for all k≥K for some K, and in particular xK∈N∩A, so N meets A.

A1choose
1.3

Assume f is continuous at p and let (xk) be a sequence with xk→p; let V be a neighbourhood of f(p). Then f−1[V] is a neighbourhood of p, so xk∈f−1[V] for all k≥K for some K, that is f(xk)∈V for all k≥K.

assume-hypA1A2
1.4

In the indiscrete topology, a neighbourhood N of a point p satisfies p∈U⊆N for some open U; since p∈U forces U≠∅ and hence U=X, the only neighbourhood of any point is X itself.

L3L2
2.1

By step 1.2 every neighbourhood of p meets A, so p∈A‾; as p was an arbitrary point of seqcl⁡(A) this gives seqcl⁡(A)⊆A‾, and with step 1.1 it gives claim 1.

step 1.1step 1.2L1
2.2

By step 1.3 the sequence (f(xk)) is eventually in every neighbourhood of f(p), that is f(xk)→f(p); as (xk) was an arbitrary sequence converging to p, f is sequentially continuous at p, which is claim 2.

step 1.3A1
2.3

By step 1.4, for every p∈X and every sequence (xk) in X the only neighbourhood to be tested is X, and xk∈X for every k; so xk→p for every p∈X. With at least two points in X the limit is therefore not unique, which is claim 3.

step 1.4A1
3.1

Claims 1, 2 and 3 are established by step 2.1, step 2.2 and step 2.3 respectively.

step 2.1step 2.2step 2.3∎

Remarks

Depends on

Used by

Dependency tree · two levels

22 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