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

Products of cofinite spaces are compact exactly under BPI

Facts & Assumptions

Given: A family {(Xi,Ti)}iI of spaces with Ti the cofinite topology on Xi, and its product X with projections πi.

[F1]

The closed sets of the cofinite topology on a set are the set itself and its finite subsets; the cofinite space is T1 (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, T0 (Kolmogorov) and T1 (Frechet) spaces).

[F2]

A space is compact if and only if every family of closed sets with the finite intersection property has nonempty intersection (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, Finite intersection property).

[F3]

The set ultrafilter lemma is equivalent over ZF to BPI: every proper filter on a set extends to an ultrafilter, and an ultrafilter contains exactly one of a subset and its complement (BPI and the set ultrafilter lemma are equivalent, Ultrafilter, Characterisation of ultrafilters: every set or its complement, The Boolean prime ideal principle).

[F4]

Under BPI, every product of compact Hausdorff spaces is compact, and the two-point discrete space is compact Hausdorff (Compact Hausdorff Tychonoff is equivalent to BPI, The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

The complements of basic product-open sets form the following closed basis: C(X)={qQπq1[Cq]:QI finite and every CqXq is closed}. Consequently X is compact if every subfamily of C(X) with the finite intersection property has nonempty intersection: the complementary basic open sets then satisfy the finite-subcover test (The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Finite intersection property).

[L2]

Every cofinite space is compact in ZF. Indeed, a family of its closed sets with the finite intersection property either contains only the whole space, or contains a finite member C; in the latter case the intersections with C have nonempty total intersection, since otherwise finitely many of them already exclude the finitely many points of C (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, The natural numbers N (von Neumann)).

Proof

technique · direct
1.1

Assume BPI for the forward direction. If X= for any reason, it is compact; this includes an empty factor and does not assert that nonempty factors have nonempty product. If I=, the product is a singleton and compact. In the remaining case X, fix one xˉX.

givenF2
2.1

By [L1], it is enough to let HC(X) have the finite intersection property. By [F3], extend the filter generated by H to an ultrafilter F of subsets of X.

step 1.1F3L1
3.1

For each iI, push F forward through the projection by puttingGi:={BXi:πi1[B]F}. Preimages preserve complements and finite intersections, so Gi is an ultrafilter on Xi. Its closed members have the finite intersection property. By compactness of the cofinite factor [L2], their intersection Ai:={CGi:C is closed in Xi} is nonempty.

step 2.1F2F3L2
4.1

By [F1], each Ai, being an intersection of closed sets, is either all of Xi or finite. If it is finite, Gi contains a finite set: this is Xi itself when Xi is finite, while if Xi is infinite and AiXi, some closed member occurring in the intersection defining Ai is proper and hence finite. An ultrafilter containing a nonempty finite set contains exactly one of its singleton subsets. If that singleton is {ai}, then every member of Gi contains ai, and {ai} is itself a closed member, so Ai={ai}. Define xi to be the unique point of Ai whenever Ai is a singleton, and otherwise put xi:=xˉi; in this latter case Ai=Xi. This defines x=(xi)iIX without making a new choice.

step 1.1step 3.1F1F3
5.1

Fix HH. By [L1], write H=qQπq1[Cq] with Q finite and each Cq closed. Since HF, finite primeness of the ultrafilter gives some qQ with πq1[Cq]F. Thus CqGq, so xqAqCq by step 4.1. Hence xH. Therefore xH, and [L1] proves that X is compact.

step 2.1step 3.1step 4.1F3L1
6.1

The forward implication is established in step 5.1. For the converse, assume every product of cofinite spaces is compact. Let S be any set carrying a proper filter D, and put Y=2P(S). The two-point cofinite topology is discrete, so the hypothesis makes Y compact. The constant-zero function shows Y is nonempty in ZF. The finite discrete factor is also the one described in [F4]; no converse for arbitrary compact Hausdorff products is inferred from that fact.

step 5.1F4L1
7.1

On a point v:P(S)2 impose the constraints v(S)=1, v()=0, v(SA)=1v(A) and v(AB)=v(A)v(B) for every A,BS, and v(D)=1 for every DD. Each constraint defines a clopen subset of Y: it is a finite union of patterns in its finitely many involved coordinates, and both each pattern and its complement are unions of basic discrete-coordinate cylinders. This family has FIP. For any finite list of constraints, only finitely many filter-members D1,,Dk occur. Their intersection is nonempty by properness of the filter, with the empty intersection equal to S, also nonempty. Fix s in that intersection and set vs(A)=1 exactly when sA. This valuation satisfies all Boolean equations, including the listed filter constraints. Thus [F2] and compactness give a single v satisfying every constraint.

step 6.1F2F3L1
8.1

Put U={AS:v(A)=1}. The constraints include S and exclude , close U under intersections, and make it upward closed: if AB and v(A)=1, then 1=v(AB)=v(A)v(B) forces v(B)=1. They also decide exactly one of A and its complement, so [F3] makes U an ultrafilter extending D. Every proper filter has therefore been extended; if S is empty there is no proper filter and the assertion is vacuous. By the UFL-to-BPI direction of [F3], BPI holds. Combined with step 5.1, this proves the equivalence.

step 5.1step 7.1F3

Depends on

Used by

Dependency tree · two levels

47 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