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.
Regular open algebra in ZF
Statement
In ZF, for every topological space , the operations in the regular-open definition make a complete Boolean algebra. Its order is inclusion, finite meets are intersections, and its bounds are . The displayed formulas apply to empty as well as nonempty families, and may be empty.
Facts & Assumptions
Completeness, regular opens, and order continuity defines regular opens, their proposed operations, completeness, interior and closure.
Quotient operations are well defined makes the quotient of a Boolean algebra by an ideal a Boolean algebra, identifying two elements exactly when their symmetric difference is in the ideal.
Proof
Given: A topological space ; all arguments take place in ZF.
Put . This is regular open for any : is open and contained in the closed set , so . Call nowhere dense if . These sets form an ideal of subsets: the empty set qualifies; subsets qualify by monotonicity; and if qualify, any nonempty open has a nonempty open part , which in turn has a nonempty open part outside . Thus no nonempty open set lies in , proving the finite-union condition. A nowhere-dense set contains no nonempty open set.
For put , and let . The identities and follow respectively from and the closure/interior union inclusions. They and show that is closed under complements and finite unions, hence all finite set Boolean operations. It is therefore a Boolean algebra with those operations. If , then and is nowhere dense, so and is an ideal of it. Every open belongs to : its closed boundary contains no nonempty open , since would force .
For , gives . Also by openness. If regular opens differ by a nowhere-dense set, the open set is a subset of that difference, so it is empty by step 1.1. Hence , and openness gives . Interchanging gives equality. More generally if both and differ from by nowhere-dense sets, then is nowhere dense, so this uniqueness applies. Thus every class of has exactly one regular-open representative, namely .
F2 and step 3.1 transport a Boolean algebra structure to . To identify its operations, first is regular: monotonicity gives , and the reverse inclusion follows from openness. Thus the transported meet is . The transported join is , the representative of its set-theoretic union class. For the complement put . Since and that latter set is closed, ; openness gives equality. Also is nowhere dense by step 2.1, so is the required complement representative. Bounds transport to , which are regular. The transported order satisfies iff iff . In particular all distributive and complement laws hold by F2, rather than by a claim that regular opens are closed under ordinary unions.
For any , is regular by step 1.1 and contains each , since those sets are open subsets of . If a regular open contains each , monotonicity gives , proving it is the least upper bound. Put . For every , . Since is open, it follows that ; the reverse holds because is open. Thus is regular. Any regular-open lower bound is an open subset of , hence lies in , so is the greatest lower bound. If is empty, these formulas give and , directly verifying both bounds. If there is just the one regular open , and the same proof gives the trivial complete Boolean algebra. No countable union of nowhere-dense sets or choice principle has been used. QED.
Depends on
Used by
- Choice-free regular open completion of forcing preorders Theorem
- Completeness, extremal disconnectedness, and regular-open clopens Theorem
- Order-continuous Boolean homomorphisms extend uniquely to completions Theorem
- The regular open completion of a Boolean algebra Theorem
Cited to discharge well-definedness by Completeness, regular opens, and order continuity.
Dependency tree · two levels
5 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
- Fremlin, Measure Theory, 314O–314P, Chapter 31, pp. 37–38 (standard reference, not scraped)