English
An expression equating open sets in the lower topology to those generated by a specific basis yields a full description of the topology basis.
Русский
Выражение, устанавливающее соответствие открытых множеств нижней топологии генерируемым базисом, даёт полное описание базиса топологии.
LaTeX
$$$\\text{IsOpen}(U) \\iff (U = \\mathrm{univ} \\lor \\exists a, U = (\\Ici(a))^{c})$$$
Lean4
theorem isTopologicalSpace_basis (U : Set α) : IsOpen U ↔ U = univ ∨ ∃ a, (Ici a)ᶜ = U :=
by
by_cases hU : U = univ
· simp only [hU, isOpen_univ, compl_Ici, true_or]
refine ⟨?_, isTopologicalBasis_insert_univ_subbasis.isOpen⟩
intro hO
apply Or.inr
convert IsTopologicalBasis.open_eq_sUnion isTopologicalBasis_insert_univ_subbasis hO
constructor
· intro ⟨a, ha⟩
use { U }
constructor
· apply subset_trans (singleton_subset_iff.mpr _) (subset_insert _ _)
use a
· rw [sUnion_singleton]
· intro ⟨S, hS1, hS2⟩
have hUS : univ ∉ S := by
by_contra hUS'
apply hU
rw [hS2]
exact sUnion_eq_univ_iff.mpr (fun a => ⟨univ, hUS', trivial⟩)
use sSup {a | (Ici a)ᶜ ∈ S}
rw [hS2, sUnion_eq_compl_sInter_compl, compl_inj_iff]
apply le_antisymm
· intro b hb
simp only [sInter_image, mem_iInter, mem_compl_iff]
intro s hs
obtain ⟨a, ha⟩ := (subset_insert_iff_of_notMem hUS).mp hS1 hs
subst hS2 ha
simp_all only [compl_Ici, mem_Ici, sSup_le_iff, mem_setOf_eq, mem_Iio, not_lt]
· intro b hb
rw [mem_Ici, sSup_le_iff]
intro c hc
simp only [sInter_image, mem_iInter] at hb
rw [← not_lt, ← mem_Iio, ← compl_Ici]
exact hb _ hc