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.
Compact Hausdorff Baire implies DMC
Statement
Over , if every compact Hausdorff space is a Baire space, then DMC holds (Dependent multiple choice in finite-level tree form).
The proof follows the dichotomy of Fossy and Morillon, in the form given by Fremlin: for a pruned tree one forms the product of the one-point compactifications of and considers the closed set of weakly increasing points. If is compact, Baireness of a compact Hausdorff space produces a branch of ; if is not compact, compactness failure of produces, by way of the finite-intersection property, finite levels of a subtree of .
Facts & Assumptions
Given: The hypothesis that every compact Hausdorff space is Baire; a pruned tree of height on a set whose levels are nonempty.
DMC in tree form is equivalent over to DMC in successor-menu form, so proving the tree form suffices (The tree and successor-menu formulations of DMC are equivalent, Dependent multiple choice in finite-level tree form).
The one-point compactification of a space is compact and contains as an open subspace, is Hausdorff when is locally compact Hausdorff, and is dense in exactly when is not compact (The one-point (Alexandroff) compactification , whose open sets are the open sets of together with the complements in of the closed compact subsets of , is compact and contains as an open subspace; is dense in exactly when is not compact; and is Hausdorff exactly when is locally compact and Hausdorff).
A discrete space is locally compact and Hausdorff, and a product of Hausdorff spaces is Hausdorff; Hausdorffness is hereditary to subspaces (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Arbitrary products preserve , , and Hausdorffness, , , and Hausdorffness are hereditary, Hereditary, open-hereditary and closed-hereditary properties of topological spaces).
A space is compact if and only if every family of closed subsets 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).
Baireness: the intersection of every sequence of dense open sets is dense (Baire space: a topological space in which every countable intersection of dense open subsets is dense); a subset of a compact space is closed exactly when its complement is open, and closed subspaces with the subspace topology are what the hypothesis applies to (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, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
Nodes of are functions on a natural number, a node may have many immediate successors, but each node of length has the unique length- predecessor obtained by restriction, and the levels are the nodes of length (Dependent multiple choice in finite-level tree form, The natural numbers (von Neumann)).
Finite choices are available in ZF: fix a listing of the particular finite index set and apply Every natural-number-indexed list of nonempty sets has a choice function on its family of values; no family of such listings is selected. Subsets of finite sets are finite (A subset of a finite set is finite, with , and equality holds if and only if ).
Proof
Assume every compact Hausdorff space is Baire, let be a pruned tree of height with nonempty levels on a set , and let be a point outside ; it suffices by [F1] to produce a subtree of with nonempty finite levels.
Give the discrete topology and let be its one-point compactification; by [F3] the discrete is locally compact Hausdorff, so is compact Hausdorff by [F2], and it is nonempty because . In the discrete space a compact subset is finite: its singleton cover has a finite subcover. Conversely finite subsets are compact by finite choices from a cover. Thus the neighbourhoods of are exactly the complements of finite subsets of .
Let with the product topology; by [F3] is Hausdorff, and is nonempty because the constant- function is a member.
Let be the set of those with: for all , either , or , or and is a proper initial segment of .
is closed in : its complement is the union, over and for which is not a proper initial segment of , of the two-coordinate cylinders . Each such cylinder is open because every is an isolated point of , so the complement of is open. Hence is a closed subspace of the Hausdorff space , and is Hausdorff by [F3]; it is nonempty because the constant sequence with value lies in .
For put , a subset of .
Each is open in : it is the union over and of the sets , and each is a basic open set of the product because is open in the discrete space .
Case B: is not compact. Choose an open cover of with no finite subcover, and refine it by taking all canonical basic product cylinders whose trace is contained in a member of the cover; here the coordinate restrictions in may be taken to be a singleton , , or a cofinite neighbourhood of . This is still a cover of with no finite subcover. Let consist of all finite intersections of , the closed cylinder complements , and all constraint complements for and with not a proper initial segment of . Every such generator is a closed member of the finite-coordinate cylinder algebra. Every finite intersection is nonempty: choose in a point outside the finitely many 's, which automatically satisfies every constraint complement. The intersection of all members is empty because the constraint complements cut the intersection down to and the 's cover . Thus is a downwards-directed family of nonempty closed subsets of , contains and every constraint complement, has empty intersection, and every member belongs to the finite-coordinate cylinder algebra.
Each is dense in : let be a nonempty relatively open subset of , and choose a basic product-open with , restricting only the coordinates in a finite set ; choose . If for some then and we are done. Otherwise every non- value of occurs at an index ; let be a value of of maximal length among those, or the empty node if has no non- value. Choose larger than every index in and larger than , and let be a proper extension of of length at least , which exists by finitely iterating pruning and restricting to the required length if needed (choose a length at least ). Define by: for ; if and ; ; and if and . Then , because the only non- values are the values of at indices in together with at , all of which are comparable by the maximality of and the choice of ; and with gives .
In case B, construct families of closed subsets of by and: if for every , let be together with for , and otherwise let ; here is the -th projection. The added sets are nonempty by the condition triggering the first alternative, and downward directedness follows because a lower bound in gives the lower bound whenever one or both of the two sets carries the new coordinate constraint. Thus each is downwards directed, consists of nonempty closed sets, and has empty intersection because it contains . Inductively every member lies in the finite-coordinate cylinder algebra generated by the sets , , , and , . For such an , take one finite Boolean expression in the listed generators and let be the finite set of node labels tested at coordinate . No test occurs, since all infinity tests have indices less than . If and , replacing only by preserves every test and hence membership in . Therefore implies , so that projection is finite. This uses no compactness of an infinite or finite product.
Case A: is compact. Then is a compact Hausdorff space, so by the hypothesis assumed in step 1.1 it is Baire, and by step 6.1 and step 7.1 the sets are dense open, so their intersection is dense and in particular nonempty; fix . Let .
In case B, put and . If , then some has : otherwise the first alternative in step 7.2, applied also to , would put in , contrary to . The finite-test argument in step 7.2 makes finite. Put . Downward directedness makes the projected family finitely intersecting, so its intersection inside the finite set is nonempty; hence is a nonempty finite subset of . Moreover some satisfies : using [F5] after fixing a listing of the finite set , for each such take a member whose projection omits , and take a common lower bound with . Its projection is contained in , while the definition of gives the reverse inclusion.
In case A, is infinite: for each the membership gives some with , so contains arbitrarily large naturals and is therefore infinite.
In case B, is infinite. Suppose instead that it is finite. Successively for , one can adjoin a cylinder , , while preserving the finite-intersection property: at that stage include the member from step 8.2, whose -th projection is the finite set ; if no one of the finitely many cells , , preserved the finite-intersection property, finitely many witnessing failures, obtained using [F5], would have a common lower bound meeting but none of those cells, a contradiction. Closing under finite intersections gives a downwards-directed family of nonempty closed sets which contains and the chosen cylinders. Define for and otherwise. Every basic neighbourhood of meets every : intersect with the finitely many chosen singleton cylinders for its coordinates in and, for coordinates outside , with the cylinders . Therefore lies in the closure of every member, hence in every member because they are closed, contradicting the empty intersection of .
In case B, let lie in and . Then some properly extends . Otherwise every gives a constraint complement by step 6.2. Take with from step 8.2, and use downward directedness and the finiteness of to obtain with . Since , choose with . But ; taking contradicts .
In case A, the values for form a chain in under initial segment, strictly increasing in length, by the definition of in step 4.1 since no two of them are .
In case B, enumerate increasingly as and put and . By step 9.3, every has an extension in ; by definition every member of has a predecessor in . Thus every is nonempty finite, and every one of its nodes has length at least . Let be the set of all initial segments of nodes in . It is a subtree and has a node at every level , because any member of has length at least . Its level is finite: if has length , choose with an initial segment of . If , extend through the successive to a member of ; if , follow predecessors down to a member of . In either case, because initial segments of the same node are comparable and every member of has length at least , is the length- initial segment of some member of the finite set . Hence the level has at most elements.
In case A, let be the set of all initial segments of the nodes , . Then is a subtree of : it is contained in because is closed under initial segments, and it is closed under initial segments by construction. Its level consists of the initial segments of length of the nodes with ; for in the nodes are comparable and is an initial segment of , so all nodes with length at least have the same initial segment of length , and this common node is unique; since lengths in are unbounded there is such an , so level of is a singleton. Hence has nonempty finite levels, as required.
In either case the pruned tree has a subtree with nonempty finite levels: case A by step 11.1, case B by step 10.2. This is the tree form of DMC, so by [F1] DMC in successor-menu form holds, and since was an arbitrary pruned tree with nonempty levels, the hypothesis that every compact Hausdorff space is Baire implies DMC.
Remarks
-
What compactness of is used for, and what happens without it. In case A the hypothesis of the theorem is applied to itself, so must be compact; in case B the failure of compactness is converted into a family of closed sets with empty intersection, which is the exact form the finite-intersection characterisation of compactness provides.
-
The dichotomy is exhaustive and no choice is used in it. In case A, the assumed Baireness of the compact Hausdorff space supplies one point of the intersection of the dense open sets ; the recursive construction of the families in case B is a definition by recursion on and the sets are defined, not selected. Case B uses individual existential witnesses and finite choices, never countably many simultaneous selections.
Depends on
- Dependent multiple choice in finite-level tree form
- 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
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space
- The one-point (Alexandroff) compactification $X^{*} = X \cup \{\infty\}$, whose open sets are the open sets of $X$ together with the complements in $X^{*}$ of the closed compact subsets of $X$
- $X^{*}$ is compact and contains $X$ as an open subspace; $X$ is dense in $X^{*}$ exactly when $X$ is not compact; and $X^{*}$ is Hausdorff exactly when $X$ is locally compact and Hausdorff
- 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
- Arbitrary products preserve $T_0$, $T_1$, and Hausdorffness
- $T_0$, $T_1$, and Hausdorffness are hereditary
- 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
- A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection
- Finite intersection property
- The tree and successor-menu formulations of DMC are equivalent
- The natural numbers $\mathbb{N}$ (von Neumann)
- Interior, closure, boundary, exterior, derived set and isolated point in a topological space
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Hereditary, open-hereditary and closed-hereditary properties of topological spaces
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
Dependency tree · two levels
74 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
- David H. Fremlin, Dependent multiple choice and Baire's theorem (following Fossy and Morillon) (standard reference, not scraped)