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
Statement
Over , BPI (The Boolean prime ideal principle) is equivalent to the compactness in the product topology (The product set 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) of every product of spaces each carrying the cofinite topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
Facts & Assumptions
Given: A family of spaces with the cofinite topology on , and its product with projections .
The closed sets of the cofinite topology on a set are the set itself and its finite subsets; the cofinite space is (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, (Kolmogorov) and (Frechet) spaces).
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).
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).
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).
The complements of basic product-open sets form the following closed basis: Consequently is compact if every subfamily of with the finite intersection property has nonempty intersection: the complementary basic open sets then satisfy the finite-subcover test (The product set 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).
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 ; in the latter case the intersections with have nonempty total intersection, since otherwise finitely many of them already exclude the finitely many points of (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, The natural numbers (von Neumann)).
Proof
Assume BPI for the forward direction. If for any reason, it is compact; this includes an empty factor and does not assert that nonempty factors have nonempty product. If , the product is a singleton and compact. In the remaining case , fix one .
By [L1], it is enough to let have the finite intersection property. By [F3], extend the filter generated by to an ultrafilter of subsets of .
For each , push forward through the projection by putting Preimages preserve complements and finite intersections, so is an ultrafilter on . Its closed members have the finite intersection property. By compactness of the cofinite factor [L2], their intersection is nonempty.
By [F1], each , being an intersection of closed sets, is either all of or finite. If it is finite, contains a finite set: this is itself when is finite, while if is infinite and , some closed member occurring in the intersection defining is proper and hence finite. An ultrafilter containing a nonempty finite set contains exactly one of its singleton subsets. If that singleton is , then every member of contains , and is itself a closed member, so . Define to be the unique point of whenever is a singleton, and otherwise put ; in this latter case . This defines without making a new choice.
Fix . By [L1], write with finite and each closed. Since , finite primeness of the ultrafilter gives some with . Thus , so by step 4.1. Hence . Therefore , and [L1] proves that is compact.
The forward implication is established in step 5.1. For the converse, assume every product of cofinite spaces is compact. Let be any set carrying a proper filter , and put . The two-point cofinite topology is discrete, so the hypothesis makes compact. The constant-zero function shows 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.
On a point impose the constraints , , and for every , and for every . Each constraint defines a clopen subset of : 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 occur. Their intersection is nonempty by properness of the filter, with the empty intersection equal to , also nonempty. Fix in that intersection and set exactly when . This valuation satisfies all Boolean equations, including the listed filter constraints. Thus [F2] and compactness give a single satisfying every constraint.
Put . The constraints include and exclude , close under intersections, and make it upward closed: if and , then forces . They also decide exactly one of and its complement, so [F3] makes an ultrafilter extending . Every proper filter has therefore been extended; if 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.
Depends on
- The Boolean prime ideal principle
- The product set $\prod_{i \in I} X_i$ 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
- Compact Hausdorff Tychonoff is equivalent to BPI
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection
- Finite intersection property
- Ultrafilter
- Characterisation of ultrafilters: every set or its complement
- BPI and the set ultrafilter lemma are equivalent
- $T_0$ (Kolmogorov) and $T_1$ (Frechet) spaces
- 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
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- The natural numbers $\mathbb{N}$ (von Neumann)
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
- Kyriakos Keremedis and Eleftherios Tachtsis, Wallman Compactifications and Tychonoff's Compactness Theorem in ZF (standard reference, not scraped)