# Topological facts about upper/lower/order-connected sets #

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).

## Implementation notes #

The same lemmas are true in the additive/multiplicative worlds. To avoid code duplication, we provide HasUpperLowerClosure, an ad hoc axiomatisation of the properties we need.

class HasUpperLowerClosure (α : Type u_1) [] [] :

Ad hoc class stating that the closure of an upper set is an upper set. This is used to state lemmas that do not mention algebraic operations for both the additive and multiplicative versions simultaneously. If you find a satisfying replacement for this typeclass, please remove it!

Instances
theorem HasUpperLowerClosure.isUpperSet_closure {α : Type u_1} [] [] [self : ] (s : Set α) :
theorem HasUpperLowerClosure.isLowerSet_closure {α : Type u_1} [] [] [self : ] (s : Set α) :
theorem HasUpperLowerClosure.isOpen_upperClosure {α : Type u_1} [] [] [self : ] (s : Set α) :
IsOpen (upperClosure s)
theorem HasUpperLowerClosure.isOpen_lowerClosure {α : Type u_1} [] [] [self : ] (s : Set α) :
IsOpen (lowerClosure s)
@[instance 100]
Equations
• =
@[instance 100]
instance OrderedCommGroup.to_hasUpperLowerClosure {α : Type u_1} [] [] [] :
Equations
• =
theorem IsUpperSet.closure {α : Type u_1} [] [] {s : Set α} :
theorem IsLowerSet.closure {α : Type u_1} [] [] {s : Set α} :
theorem IsOpen.upperClosure {α : Type u_1} [] [] {s : Set α} :
IsOpen (upperClosure s)
theorem IsOpen.lowerClosure {α : Type u_1} [] [] {s : Set α} :
IsOpen (lowerClosure s)
instance instHasUpperLowerClosureOrderDual {α : Type u_1} [] [] :
Equations
• =
theorem IsUpperSet.interior {α : Type u_1} [] [] {s : Set α} (h : ) :
theorem IsLowerSet.interior {α : Type u_1} [] [] {s : Set α} (h : ) :
theorem Set.OrdConnected.interior {α : Type u_1} [] [] {s : Set α} (h : s.OrdConnected) :
(interior s).OrdConnected