-- ------------------------------------------------------------------- -- Reference: James R. Munkres, Topology, 2nd edition, Prentice Hall, -- 2000. Chapter 2, Section 12 ("Topological Spaces") and Section 13 -- ("Basis for a Topology"), about 8 pages in total. -- The material is standard and covered in any introductory topology -- textbook. The task below is described in enough detail that you do -- not need the book, but you may find it useful for the proofs and -- examples. -- Task: formalize the basic definitions of point-set topology in -- Lean. You should use Mathlib for background constructs (such as -- sets, unions, intersections, finiteness, and the real numbers), but -- not Mathlib's topology library (in particular, do not use -- `TopologicalSpace` or anything built on it). Where Munkres talks -- about a set `X`, you can use a type `X`. -- -- (1) Define the notion of a topology on `X`: a collection of -- subsets of `X`, called the open sets, that contains `∅` and `X` -- and is closed under arbitrary unions and finite intersections. -- Define what it means for one topology to be finer or coarser than -- another. -- -- (2) Implement at least one example of a topology from Section 12, -- such as the discrete topology, the indiscrete (trivial) topology, -- or the finite complement topology, in which `U` is open if and -- only if `X \ U` is finite or `U = ∅`. -- -- (3) Define the notion of a basis for a topology on `X`: a -- collection `𝓑` of subsets of `X` such that every `x` belongs to -- some element of `𝓑`, and whenever `x ∈ B₁ ∩ B₂` with `B₁, B₂ ∈ 𝓑`, -- there is `B₃ ∈ 𝓑` with `x ∈ B₃ ⊆ B₁ ∩ B₂`. Define the topology -- generated by `𝓑`, in which `U` is open if and only if for every -- `x ∈ U` there is `B ∈ 𝓑` with `x ∈ B ⊆ U`, and prove that it is -- indeed a topology. Prove Lemma 13.1: the open sets of this -- topology are exactly the unions of elements of `𝓑`. -- -- (4) Implement at least one example from Section 13. Examples are: -- the one-point sets form a basis for the discrete topology; the -- open intervals `(a,b)` form a basis for the standard topology on -- `ℝ`; the half-open intervals `[a,b)` form a basis for the lower -- limit topology on `ℝ`. -- -- Bonus: Prove Lemma 13.3: if `𝓑` and `𝓑'` are bases, then the -- topology generated by `𝓑'` is finer than the one generated by `𝓑` -- if and only if for every `B ∈ 𝓑` and `x ∈ B`, there is `B' ∈ 𝓑'` -- with `x ∈ B' ⊆ B`. Use this to prove (part of) Lemma 13.4: the -- lower limit topology on `ℝ` is strictly finer than the standard -- topology. -- ------------------------------------------------------------------- -- Suggestion: define a topology on `X` as a structure `Topological X`. -- Define a structure `IsBasis X` consisting of a collection of -- subsets of `X` together with proofs of the basis axioms, and a -- function `mk` that takes `B : IsBasis X` and outputs the topology -- generated by `B`. Then, use `mk` to produce the examples. namespace Topological end Topological