Theorem 2.24 — unions and intersections of open and closed sets
ProvedRudin.ch02_open_closed_opstopology
In a metric space: (a) any union of open sets is open; (b) any intersection of closed sets is closed; (c) a finite intersection of open sets is open; (d) a finite union of closed sets is closed. The finiteness in (c) and (d) is essential, as Rudin's Example 2.25 shows.
Preamble
import Mathlib
Formal statement
namespace Rudin
/-- Rudin, Theorem 2.24: arbitrary unions of open sets are open, arbitrary intersections of
closed sets are closed, finite intersections of open sets are open, and finite unions of closed
sets are closed. -/
theorem ch02_open_closed_ops (X : Type) [MetricSpace X] :
(∀ (ι : Type) (G : ι → Set X), (∀ i, IsOpen (G i)) → IsOpen (⋃ i, G i)) ∧
(∀ (ι : Type) (F : ι → Set X), (∀ i, IsClosed (F i)) → IsClosed (⋂ i, F i)) ∧
(∀ (n : ℕ) (G : Fin n → Set X), (∀ i, IsOpen (G i)) → IsOpen (⋂ i, G i)) ∧
(∀ (n : ℕ) (F : Fin n → Set X), (∀ i, IsClosed (F i)) → IsClosed (⋃ i, F i)) := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 34, Theorem 2.24
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a metric space (a type in the lowest universe with a metric, hence with its induced topology). Four assertions are made simultaneously:
- For every index type (again in the lowest universe) and every family , if each is open then is open.
- For every index type and every family , if each is closed then is closed.
- For every natural number and every family of subsets indexed by , if each is open then is open.
- For every natural number and every family of subsets indexed by , if each is closed then is closed.
The index types in 1 and 2 are completely arbitrary, including the empty type: then and . Likewise 3 and 4 include , where the intersection is all of and the union is empty. "Finite" in 3 and 4 is realized specifically by index sets of the form .
Human review
Confirmed by the mission captain (proposal self-audit).