Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 X be an infinite set with the cofinite topology Tcof, whose open sets are ∅ 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 A⊆X, A‾={AA finiteXA infinite,int⁡(A)={AX∖A finite∅X∖A infinite.
  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,V∈Tcof are nonempty then U∩V≠∅.
  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 X with the cofinite topology, subsets A,U,V⊆X and points of X.

[A1]

The open sets of Tcof are ∅ together with the sets whose complement is finite; the closed sets are X together with the finite subsets of X (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).

[L2]

A is dense exactly when it meets every nonempty open set, equivalently when 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 A is finite then A is closed by [A1], so A‾=A by [L1].

A1L1
1.2

If A is infinite then no finite set contains A, since a subset of a finite set is finite; so the only closed superset of A is X and A‾=X.

A1A2L1
1.3

If X∖A is finite then A is open by [A1], so int⁡(A)=A.

A1L1
1.4

If X∖A is infinite then no nonempty open U satisfies U⊆A: such a U would have X∖U finite and X∖A⊆X∖U, making X∖A finite by [A2]. Hence int⁡(A)=∅.

A1A2L1
1.5

Let U,V be nonempty open sets; then X∖U and X∖V are finite, so X∖(U∩V)=(X∖U)∪(X∖V) is finite by [A2], and U∩V cannot be empty, for otherwise X=X∖(U∩V) would be finite, contradicting the hypothesis on X.

givenA1A2L3
1.6

Each singleton {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 A is infinite then A‾=X by step 1.2, so A is dense by [L2]; if A is finite then A≠X, since X is infinite, and A‾=A≠X by step 1.1, so A 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 · two levels

19 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