Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint

Example

Let XX be an infinite set with the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}}, whose open sets are \varnothing together with the sets of finite complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable). Then:

  1. Closures. For AXA \subseteq X, A={AA finiteXA infinite,int(A)={AXA finiteXA infinite.\overline{A} = \begin{cases} A & A \text{ finite} \\ X & A \text{ infinite,} \end{cases} \qquad \operatorname{int}(A) = \begin{cases} A & X \setminus A \text{ finite} \\ \varnothing & X \setminus A \text{ infinite.} \end{cases}
  2. A subset is dense if and only if it is infinite (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); in particular every infinite subset is dense, and no finite subset is.
  3. No two nonempty open sets are disjoint. If U,VTcofU, V \in \mathcal{T}_{\mathrm{cof}} are nonempty then UVU \cap V \ne \varnothing.
  4. Every singleton is closed, so points are distinguishable by closed sets; nevertheless claim 3 says distinct points are never separated by disjoint open sets, so the space is as far from Hausdorff as a space with closed points can be.

Facts & Assumptions

Given: An infinite set XX with the cofinite topology, subsets A,U,VXA, U, V \subseteq X and points of XX.

[A1]

The open sets of Tcof\mathcal{T}_{\mathrm{cof}} are \varnothing together with the sets whose complement is finite; the closed sets are XX together with the finite subsets of XX (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[A2]

A subset of a finite set is finite, and a union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies); "infinite" means "not finite" (Finite, countably infinite, countable, uncountable).

[L1]

int(A)\operatorname{int}(A) is the largest open subset of AA, A\overline{A} the smallest closed superset of AA (Interior, closure, boundary, exterior, derived set and isolated point in a topological space); a set is closed exactly when it equals its closure (A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set, claim 2).

[L2]

AA is dense exactly when it meets every nonempty open set, equivalently when A=X\overline{A} = X (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Verification

technique · direct
1.1

If AA is finite then AA is closed by [A1], so A=A\overline{A} = A by [L1].

A1L1
1.2

If AA is infinite then no finite set contains AA, since a subset of a finite set is finite; so the only closed superset of AA is XX and A=X\overline{A} = X.

A1A2L1
1.3

If XAX \setminus A is finite then AA is open by [A1], so int(A)=A\operatorname{int}(A) = A.

A1L1
1.4

If XAX \setminus A is infinite then no nonempty open UU satisfies UAU \subseteq A: such a UU would have XUX \setminus U finite and XAXUX \setminus A \subseteq X \setminus U, making XAX \setminus A finite by [A2]. Hence int(A)=\operatorname{int}(A) = \varnothing.

A1A2L1
1.5

Let U,VU, V be nonempty open sets; then XUX \setminus U and XVX \setminus V are finite, so X(UV)=(XU)(XV)X \setminus (U \cap V) = (X \setminus U) \cup (X \setminus V) is finite by [A2], and UVU \cap V cannot be empty, for otherwise X=X(UV)X = X \setminus (U \cap V) would be finite, contradicting the hypothesis on XX.

givenA1A2L3
1.6

Each singleton {x}\{x\} is finite, hence closed by [A1].

A1
2.1

Steps 1.1 to 1.4 give claim 1.

step 1.1step 1.2step 1.3step 1.4
2.2

If AA is infinite then A=X\overline{A} = X by step 1.2, so AA is dense by [L2]; if AA is finite then AXA \ne X, since XX is infinite, and A=AX\overline{A} = A \ne X by step 1.1, so AA is not dense. Hence the dense subsets are exactly the infinite ones, which is claim 2.

step 1.1step 1.2givenL2
3.1

Step 1.5 is claim 3, and step 1.6 with claim 3 is claim 4.

step 1.5step 1.6

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 39 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources