Upper/lower/order-connected sets in normed groups #

The topological closure and interior of an upper/lower/order-connected set is an upper/lower/order-connected set (with the notable exception of the closure of an order-connected set).

We also prove lemmas specific to ℝⁿ. Those are helpful to prove that order-connected sets in ℝⁿ are measurable.

TODO #

Is there a way to generalise IsClosed.upperClosure_pi/IsClosed.lowerClosure_pi so that they also apply to ℝ, ℝ × ℝ, EuclideanSpace ι ℝ? _pi has been appended to their names to disambiguate from the other possible lemmas, but we will want there to be a single set of lemmas for all situations.

theorem IsUpperSet.thickening {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsUpperSet.thickening' {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsLowerSet.thickening {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsLowerSet.thickening' {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsUpperSet.cthickening {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsUpperSet.cthickening' {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsLowerSet.cthickening {α : Type u_1} {s : Set α} (hs : ) (ε : ) :
theorem IsLowerSet.cthickening' {α : Type u_1} {s : Set α} (hs : ) (ε : ) :

ℝⁿ#

theorem IsUpperSet.mem_interior_of_forall_lt {ι : Type u_2} [] {s : Set (ι)} {x : ι} {y : ι} (hs : ) (hx : x ) (h : ∀ (i : ι), x i < y i) :
y
theorem IsLowerSet.mem_interior_of_forall_lt {ι : Type u_2} [] {s : Set (ι)} {x : ι} {y : ι} (hs : ) (hx : x ) (h : ∀ (i : ι), y i < x i) :
y
theorem dist_inf_sup_pi {ι : Type u_2} [] (x : ι) (y : ι) :
dist (x y) (x y) = dist x y
theorem dist_mono_left_pi {ι : Type u_2} [] {y : ι} :
MonotoneOn (fun (x : ι) => dist x y) (Set.Ici y)
theorem dist_mono_right_pi {ι : Type u_2} [] {x : ι} :
theorem dist_anti_left_pi {ι : Type u_2} [] {y : ι} :
AntitoneOn (fun (x : ι) => dist x y) (Set.Iic y)
theorem dist_anti_right_pi {ι : Type u_2} [] {x : ι} :
theorem dist_le_dist_of_le_pi {ι : Type u_2} [] {a₁ : ι} {a₂ : ι} {b₁ : ι} {b₂ : ι} (ha : a₂ a₁) (h₁ : a₁ b₁) (hb : b₁ b₂) :
dist a₁ b₁ dist a₂ b₂
theorem IsUpperSet.exists_subset_ball {ι : Type u_2} [] {s : Set (ι)} {x : ι} {δ : } (hs : ) (hx : x ) (hδ : 0 < δ) :
∃ (y : ι), Metric.closedBall y (δ / 4) Metric.closedBall y (δ / 4)
theorem IsLowerSet.exists_subset_ball {ι : Type u_2} [] {s : Set (ι)} {x : ι} {δ : } (hs : ) (hx : x ) (hδ : 0 < δ) :
∃ (y : ι), Metric.closedBall y (δ / 4) Metric.closedBall y (δ / 4)

Note #

The closure and frontier of an antichain might not be antichains. Take for example the union of the open segments from (0, 2) to (1, 1) and from (2, 1) to (3, 0). (1, 1) and (2, 1) are comparable and both in the closure/frontier.

theorem IsClosed.upperClosure_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) (hs' : ) :
theorem IsClosed.lowerClosure_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) (hs' : ) :
theorem IsClopen.upperClosure_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) (hs' : ) :
theorem IsClopen.lowerClosure_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) (hs' : ) :
theorem closure_upperClosure_comm_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) :
theorem closure_lowerClosure_comm_pi {ι : Type u_2} [] {s : Set (ι)} (hs : ) :