Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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 isolated-point repair of Kelley's choice space

Statement

Let A be a set and let Ac be A with the cofinite topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then the topological sum XA:=Ac{} of Ac with a one-point space (The disjoint union (coproduct) iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) and T1 (T0 (Kolmogorov) and T1 (Frechet) spaces), and A is a closed subspace of XA (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). This is the repaired coordinate of the product-compactness argument. We identify each summand with its tagged copy in the disjoint union, so the added point is distinct from every point of A. This is in contrast with the cofinite topology on A{} itself.

Facts & Assumptions

Given: A set A; the cofinite space Ac; the sum XA=Ac{}.

[F1]

In the cofinite topology the open sets are and the sets with finite complement, and the closed sets are the whole space and the finite sets; the cofinite space is T1 (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, T0 (Kolmogorov) and T1 (Frechet) spaces).

[F2]

In the topological sum a subset UXA is open exactly when its trace UA is open in Ac; independently, its trace on the singleton summand may be either or {}, both of which are open. Thus and {} are open, and the summand A is clopen (The disjoint union (coproduct) iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is, A map out of a disjoint union is continuous iff each of its restrictions is; the canonical injections are open and closed embeddings; and each summand is clopen in the union).

[F3]

A space is compact when every open cover has a finite subcover; in particular, the empty space and a one-point space are compact directly from this definition (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[F4]

For a function F with domain a natural number n, if each F(j) is nonempty then its family of values F[n] has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values). A finite set admits a bijection from some natural number; fixing one such enumeration for one finite set is a single existential instantiation (Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

Assume XA is nonempty, which it is because is one of its points.

given
2.1

The cofinite space Ac is compact. Given an open cover U, if A= the empty subfamily covers it. Otherwise fix aA and U0U containing a. By [F1] the complement C=AU0 is finite. Fix a natural number n and a bijection e:nC by [F4], including the empty enumeration when C=. Define F(j)={UU:e(j)U} for j<n. Every value is nonempty because U covers A. Apply [F4] to this function and let c choose from its family of values. Then U0 together with the list c(F(j)), j<n, is a finite subcover. No simultaneous choice of enumerations for an infinite family is involved.

step 1.1F1F3F4
2.2

XA is T1: for distinct points x,y of XA, the set XA{y} is open — if y= it is A, which is cofinite in A and open in the sum by [F2]; if yA it is (A{y}){}, whose trace on A is cofinite, hence open in the sum by [F2] — and symmetrically for XA{x}.

step 1.1F1F2
3.1

Let V be an open cover of XA. By [F2], {VA:VV} is an open cover of Ac. Step 2.1 and [F3] give either the empty subcover or a finite list of traces Wj, j<m, covering A. Define G(j)={VV:VA=Wj} for j<m. Each value is nonempty by the definition of the trace family. Apply [F4] to G and choose d on its family of values; the list d(G(j)), j<m, covers A. Fix one VV containing , which exists since V covers XA. Adjoining it to this finite list covers XA, proving compactness. When A is empty take m=0, so V alone suffices.

step 2.1F2F3F4
4.1

A is closed in XA: its complement {} is open in the sum by [F2], and the subspace topology that A inherits is the cofinite topology of Ac; hence A is a closed subspace of XA in the sense of Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace.

step 2.2F1F2

Remarks

  • Why the naive coordinate fails. If instead A{} carries the cofinite topology, then for infinite A the set A is not closed: its complement {} is finite and hence closed, while a proper closed set in a cofinite space must itself be finite. Thus A is open but not closed. That failure is the content of the companion counterexample.

  • What compactness costs. Compactness of Ac uses finite choice only, and the sum with a point adds no further cost, so the repaired coordinate is available in ZF; this is what makes it usable in the product argument below.

Depends on

Used by

Dependency tree · two levels

33 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