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

DC is equivalent to Baireness of compact-Hausdorff products

Statement

Over ZF, the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) is equivalent to the assertion that every product of compact Hausdorff spaces, including the empty product, is a Baire space (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, Baire space: a topological space in which every countable intersection of dense open subsets is dense).

The equivalence is due to Herrlich and Keremedis. Their forward direction runs the pseudo-complete-space recursion, which for compact Hausdorff factors reduces to a recursion of finite-support cylinders; the reverse direction reduces the hypothesis to Baireness of the complete sequence space Aω of a serial relation, where the classical Blair extraction of a chain applies. No nonemptiness of an arbitrary product of nonempty compact Hausdorff spaces is claimed: that statement is strictly stronger than DC.

Facts & Assumptions

Given: The two assertions of the statement; an arbitrary family (Xi)iI of compact Hausdorff spaces with product X; a countable family (Un)nN of dense open subsets of X; a nonempty open BX; an arbitrary serial relation R on a nonempty set A.

[F1]

DC: for every nonempty P, every relation entire on P, and every aP, there is x:NP with x0=a and xnRxn+1 (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F5]

The discrete sequence space Aω with its reciprocal first-difference metric is nonempty and complete in ZF, and its sets Ui={f:j f(i)Rf(j)} are open and dense (Discrete sequence spaces are complete in ZF, Successor-occurrence sets of a serial relation are open and dense).

[F6]

Every nonempty subset of N has a least element, recursion on N defines functions from a self-map and an initial value, and the prescribed-start and starting-point-free forms of DC are equivalent over ZF (The well-ordering principle, The recursion theorem, Prescribed-start and starting-point-free serial choice are equivalent in ZF).

[F7]

Finite choice and finite unions: a function with finite domain all of whose values are nonempty has a choice function, a subset of a finite set is finite, and a countable union of at most countable sets is at most countable under countable choice (Every natural-number-indexed list of nonempty sets has a choice function on its family of values, A subset of a finite set is finite, with BA, and equality holds if and only if B=A, Countable unions of at most countable sets, assuming ACω, Finite, countably infinite, countable, uncountable).

[L2]

A compact Hausdorff space is regular and normal (A compact Hausdorff space is regular and normal, hence T3 and T4), so for every point x of such a space and every open Ux there is an open V with xVVU.

Proof

technique · direct
1.1

Assume DC and let (Xi)iI, (Un) and B be as in the assumptions; the task is to find a point of BnUn.

assume-hypgiven
1.2

Assume instead that every product of compact Hausdorff spaces is Baire, and let R be a serial relation on a nonempty set A; the task is to build an infinite R-chain.

assume-hypgiven
2.1

Under step 1.1: if X= then X is Baire and the empty product is the one-point space, which is Baire, so assume X and fix xX.

step 1.1L1
2.2

Under step 1.2: if A is finite and nonempty, finite choice gives f:AA with aRf(a) for every a, and recursion on N gives the R-chain a,f(a),f(f(a)),; so assume A is infinite.

step 1.2F6F7
3.1

Under step 1.1 and step 2.1, let Y be the set of quadruples (n,F,(Bi)iF) where nN, FI is finite, each BiXi is nonempty open, and iFπi1[Bi]BUn; here πi is the projection. Then Y: the set BU0 is nonempty open by [L1], so it contains a basic open cylinder, which is a finite intersection of coordinates.

step 2.1L1
3.2

Under step 2.2 and A infinite, let αA:=A{} be the one-point compactification of the discrete space A; by [F3] it is compact Hausdorff, and A is open and dense in αA because the infinite discrete space A is not compact.

step 2.2F3
4.1

Under step 3.1 define ρ on Y by (n,F,(Bi))ρ(n,F,(Bi)) iff n=n+1, FF, and BiBi for iF; the new open sets indexed by FF are unrestricted beyond the membership condition of Y. Then ρ is entire on Y: given (n,F,(Bi))Y the cylinder C:=iFπi1[Bi] is a nonempty open subset of BUn, so CUn+1 is nonempty open because Un+1 is dense; fix a point w of it. Some basic open cylinder around w lies in the open set CUn+1; intersecting it with C and adding the coordinates of C that it omits, we obtain a basic open cylinder iFπi1[Bi] with FF, BiBi for iF, and wiFπi1[Bi]CUn+1. For each iF the point wi lies in Bi, so by the regularity clause of [L2] applied in the compact Hausdorff space Xi there is a nonempty open Bi with wiBiBiBi; put F:=F. Then iFπi1[Bi]iFπi1[Bi]BUn+1, so (n+1,F,(Bi))Y, and BiBiBi for every iF, so (n,F,(Bi))ρ(n+1,F,(Bi)).

step 3.1L1L2F4
4.2

Under step 3.2 let X:=(αA)ω; it is a product of compact Hausdorff spaces, hence Baire by the hypothesis of step 1.2, and the sets Dn:={gX:g(n)A} are open and dense, so Aω=nDn is a dense Gδ of X; a dense Gδ subspace of a Baire space is Baire, since the traces of countably many dense open sets of the bigger space witness the subspace condition.

step 3.2L1F4
5.1

Under step 1.1 and step 4.1, DC gives a sequence yn=(n,Fn,(Bin)iFn) in Y with ynρyn+1 for all n; in particular FnFn+1 and, for every iFn, the closures nest inside the previous open sets: Bin+1Bin.

step 4.1F1
5.2

Under step 4.2 the subspace Aω is the discrete sequence space with its product topology, complete under the reciprocal first-difference metric by [F5]; so this complete metric space is Baire.

step 4.2F5
6.1

Under step 5.1 the set F:=nFn is at most countable: it is a countable union of finite sets, and countable choice holds by [F2].

step 5.1F2F7
6.2

Under step 5.1, for each iF let ni be least with iFni; then the sets Bin for nni form a decreasing sequence of nonempty closed subsets of the compact space Xi, so their intersection is nonempty and is contained in nniBin, since Bin+1Bin for every n.

step 5.1L1F7
6.3

Under step 5.2 the sets Vi:={fAω:j f(i)Rf(j)} are open and dense in Aω by [F5], so their intersection is dense and hence nonempty; fix fiVi.

step 5.2F5L1
7.1

Under step 6.1, step 6.2 and countable choice, choose binniBin for each iF — the set is nonempty by step 6.2, where compactness gives a point of the intersection of the nested closed sets, and step 6.2 also identifies the intersection as a subset of nniBin — and define yX by yi:=bi for iF and yi:=xi for iF.

step 6.1step 6.2F2F7
7.2

Under step 6.3 define q(i):=min{jN:f(i)Rf(j)}, which exists by [F6] because fVi, and k(0):=0, k(n+1):=q(k(n)), a definition by recursion; then a(n):=f(k(n)) satisfies a(n)=f(k(n))Rf(q(k(n)))=f(k(n+1))=a(n+1) for every n, so a is an infinite R-chain.

step 6.3F6
8.1

Under step 7.1, yiFnπi1[Bin]BUn for every n, because biBin for every iFn and the inclusion is the defining property of Y; hence BnUn, so every product of compact Hausdorff spaces is Baire under DC.

step 7.1step 3.1
8.2

Under step 2.2 and step 7.2 every serial relation on a nonempty set admits an infinite chain, which is the starting-point-free form of DC; the prescribed-start form follows by [F6], so the hypothesis of step 1.2 implies DC.

step 2.2step 7.2F6
9.1

Step 8.1 proves that DC implies Baireness of every product of compact Hausdorff spaces, and step 8.2 proves the converse; the two implications are the displayed equivalence.

step 8.1step 8.2

Remarks

  • Why the empty product is named. The product over an empty index set is the one-point space, which is trivially Baire, and a product with an empty factor is empty and hence Baire for the same reason; both cases are separated in step 2.1 and neither contributes to either implication.

  • What the forward direction does not claim. The quadruple recursion proves Baireness of the product; it does not prove that the product of nonempty compact Hausdorff spaces is nonempty, and the remark of Herrlich and Keremedis that this stronger statement is properly stronger than DC is not used here.

Depends on

Used by

Dependency tree · two levels

99 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