Alphabeta Math
ExampleConstruction: 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.

Sierpinski space and the particular-point topology, with their closures and their continuous maps

Example

Let X be a set, let p∈X, and give X the particular-point topology Tp={∅}∪{ U⊆X:p∈U } (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then, for A⊆X:

  1. Closed sets. The closed subsets of (X,Tp) are X together with the sets not containing p.
  2. Interior and closure (Interior, closure, boundary, exterior, derived set and isolated point in a topological space): int⁡(A)={Ap∈A∅p∉A,A‾={Xp∈AAp∉A. In particular {p} is dense (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and is the smallest dense subset, while X∖{p} has empty interior.
  3. No two nonempty open sets are disjoint, since every nonempty open set contains p.
  4. Sierpinski space is the case of a two-point set. With S={a,b}, a≠b, and particular point b, the topology is TSier={∅,{b},S}; here {b}‾=S and {a}‾={a}, so b is the open point and a the closed point.
  5. Continuous maps into Sierpinski space are exactly the open subsets of the source. For a topological space Y, the assignment f↦f−1[{b}] is a bijection from the set of continuous maps Y→(S,TSier) onto the topology of Y (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾).

Facts & Assumptions

Given: A set X with a point p∈X and the particular-point topology Tp; a subset A⊆X; the two-point set S={a,b} with a≠b and particular point b; and a topological space Y with topology TY.

[A2]

int⁡(A) is the largest open subset of A and A‾ the smallest closed superset of A (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Verification

technique · direct
1.1

F⊆X is closed exactly when X∖F is open, that is exactly when X∖F=∅, giving F=X, or p∈X∖F, that is p∉F; this is claim 1.

A1
1.2

If p∈A then A is open by [A1], so int⁡(A)=A; if p∉A then no nonempty open set is contained in A, every such set containing p, so int⁡(A)=∅.

A1A2
1.3

Two nonempty open sets both contain p, so their intersection contains p and is nonempty; this is claim 3.

A1
1.4

For S={a,b} with particular point b, the subsets containing b are {b} and S, so Tb={∅,{b},S}, which is TSier.

A1
2.1

If p∉A then A is closed by step 1.1, so A‾=A; if p∈A then no closed set other than X contains A, a closed proper subset omitting p by step 1.1, so A‾=X.

step 1.1A2
2.2

Let f:Y→S be any function; by [L2] and step 1.4, f is continuous exactly when f−1[∅]=∅, f−1[S]=Y and f−1[{b}] are all open in Y, and the first two always are; so f is continuous exactly when f−1[{b}]∈TY.

step 1.4L2
3.1

Steps 1.2 and 2.1 give claim 2; in particular {p}‾=X makes {p} dense by [L1], and it is contained in every dense set, since a set A with p∉A has A‾=A≠X whenever p∉A. Also int⁡(X∖{p})=∅ by step 1.2.

step 1.2step 2.1L1
3.2

By step 1.4 and step 2.1 applied to S: {b}‾=S since b is the particular point, and {a}‾={a} since b∉{a}; this is claim 4.

step 2.1step 1.4
3.3

The assignment f↦f−1[{b}] of step 2.2 is injective, since f is determined by f−1[{b}] — its value is b there and a elsewhere — and surjective onto TY, since for U∈TY the function taking the value b on U and a off U is continuous by step 2.2 and has f−1[{b}]=U; this is claim 5.

step 2.2L2
4.1

Claims 1, 2, 3, 4 and 5 are established by step 1.1, step 3.1, step 1.3, step 3.2 and step 3.3 respectively.

step 1.1step 1.3step 3.1step 3.2step 3.3∎

Remarks

  • Sierpinski space is the smallest space that is not indiscrete and not discrete, and claim 5 is why it matters: it represents the notion "open set" as a mapping problem, in the same way that a two-element set represents "subset". Every topology on Y is recovered as the set of continuous maps Y→S.

  • When X has at least two points, the particular-point topology separates distinct points only in the weakest sense. Any two distinct points are distinguished by an open set: if one of them is p, then {p} is open and contains p but not the other; and if neither is p, then {x,p} is open and contains x but not y. It is not Hausdorff: every two nonempty open sets meet at p, and {p} is dense by claim 2. When X={p}, by contrast, the topology is discrete and the separation axioms hold vacuously. In every case the space is first countable, since {{x,p}} is a one-element neighbourhood base at x: any neighbourhood of x contains an open set containing x, which contains p as well.

  • A comparison with the cofinite topology. When X is infinite, both have the property that any two nonempty open sets meet (On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint), but the particular-point topology achieves it with a single point doing all the work. When X has at least two points, its particular point p is not closed, whereas every point is closed in the cofinite topology.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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