HepLean Documentation

Mathlib.Order.Bounded

Bounded and unbounded sets #

We prove miscellaneous lemmas about bounded and unbounded sets. Many of these are just variations on the same ideas, or similar results with a few minor differences. The file is divided into these different general ideas.

Subsets of bounded and unbounded sets #

source
theorem Set.Bounded.mono {α : Type u_1} {r : α → α → Prop} {s : Set α} {t : Set α} (hst : s ⊆ t) (hs : Set.Bounded r t) :
Set.Bounded r s
source
theorem Set.Unbounded.mono {α : Type u_1} {r : α → α → Prop} {s : Set α} {t : Set α} (hst : s ⊆ t) (hs : Set.Unbounded r s) :
Set.Unbounded r t

Alternate characterizations of unboundedness on orders #

source
theorem Set.unbounded_le_of_forall_exists_lt {α : Type u_1} {s : Set α} [Preorder α] (h : ∀ (a : α), ∃ b ∈ s, a < b) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.unbounded_le_iff {α : Type u_1} {s : Set α} [LinearOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s ↔ ∀ (a : α), ∃ b ∈ s, a < b
source
theorem Set.unbounded_lt_of_forall_exists_le {α : Type u_1} {s : Set α} [Preorder α] (h : ∀ (a : α), ∃ b ∈ s, a ≤ b) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.unbounded_lt_iff {α : Type u_1} {s : Set α} [LinearOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s ↔ ∀ (a : α), ∃ b ∈ s, a ≤ b
source
theorem Set.unbounded_ge_of_forall_exists_gt {α : Type u_1} {s : Set α} [Preorder α] (h : ∀ (a : α), ∃ b ∈ s, b < a) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.unbounded_ge_iff {α : Type u_1} {s : Set α} [LinearOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s ↔ ∀ (a : α), ∃ b ∈ s, b < a
source
theorem Set.unbounded_gt_of_forall_exists_ge {α : Type u_1} {s : Set α} [Preorder α] (h : ∀ (a : α), ∃ b ∈ s, b ≤ a) :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.unbounded_gt_iff {α : Type u_1} {s : Set α} [LinearOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s ↔ ∀ (a : α), ∃ b ∈ s, b ≤ a

Relation between boundedness by strict and nonstrict orders. #

Less and less or equal #

source
theorem Set.Bounded.rel_mono {α : Type u_1} {r : α → α → Prop} {s : Set α} {r' : α → α → Prop} (h : Set.Bounded r s) (hrr' : r ≤ r') :
Set.Bounded r' s
source
theorem Set.bounded_le_of_bounded_lt {α : Type u_1} {s : Set α} [Preorder α] (h : Set.Bounded (fun (x1 x2 : α) => x1 < x2) s) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.Unbounded.rel_mono {α : Type u_1} {r : α → α → Prop} {s : Set α} {r' : α → α → Prop} (hr : r' ≤ r) (h : Set.Unbounded r s) :
Set.Unbounded r' s
source
theorem Set.unbounded_lt_of_unbounded_le {α : Type u_1} {s : Set α} [Preorder α] (h : Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.bounded_le_iff_bounded_lt {α : Type u_1} {s : Set α} [Preorder α] [NoMaxOrder α] :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) s ↔ Set.Bounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.unbounded_lt_iff_unbounded_le {α : Type u_1} {s : Set α} [Preorder α] [NoMaxOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s

Greater and greater or equal #

source
theorem Set.bounded_ge_of_bounded_gt {α : Type u_1} {s : Set α} [Preorder α] (h : Set.Bounded (fun (x1 x2 : α) => x1 > x2) s) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.unbounded_gt_of_unbounded_ge {α : Type u_1} {s : Set α} [Preorder α] (h : Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s) :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.bounded_ge_iff_bounded_gt {α : Type u_1} {s : Set α} [Preorder α] [NoMinOrder α] :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) s ↔ Set.Bounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.unbounded_gt_iff_unbounded_ge {α : Type u_1} {s : Set α} [Preorder α] [NoMinOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s

The universal set #

source
theorem Set.unbounded_le_univ {α : Type u_1} [LE α] [NoTopOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) Set.univ
source
theorem Set.unbounded_lt_univ {α : Type u_1} [Preorder α] [NoTopOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) Set.univ
source
theorem Set.unbounded_ge_univ {α : Type u_1} [LE α] [NoBotOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) Set.univ
source
theorem Set.unbounded_gt_univ {α : Type u_1} [Preorder α] [NoBotOrder α] :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) Set.univ

Bounded and unbounded intervals #

source
theorem Set.bounded_self {α : Type u_1} {r : α → α → Prop} (a : α) :
Set.Bounded r {b : α | r b a}

Half-open bounded intervals #

source
theorem Set.bounded_lt_Iio {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Iio a)
source
theorem Set.bounded_le_Iio {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Iio a)
source
theorem Set.bounded_le_Iic {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Iic a)
source
theorem Set.bounded_lt_Iic {α : Type u_1} [Preorder α] [NoMaxOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Iic a)
source
theorem Set.bounded_gt_Ioi {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Ioi a)
source
theorem Set.bounded_ge_Ioi {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Ioi a)
source
theorem Set.bounded_ge_Ici {α : Type u_1} [Preorder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Ici a)
source
theorem Set.bounded_gt_Ici {α : Type u_1} [Preorder α] [NoMinOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Ici a)

Other bounded intervals #

source
theorem Set.bounded_lt_Ioo {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Ioo a b)
source
theorem Set.bounded_lt_Ico {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Ico a b)
source
theorem Set.bounded_lt_Ioc {α : Type u_1} [Preorder α] [NoMaxOrder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Ioc a b)
source
theorem Set.bounded_lt_Icc {α : Type u_1} [Preorder α] [NoMaxOrder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (Set.Icc a b)
source
theorem Set.bounded_le_Ioo {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Ioo a b)
source
theorem Set.bounded_le_Ico {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Ico a b)
source
theorem Set.bounded_le_Ioc {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Ioc a b)
source
theorem Set.bounded_le_Icc {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Icc a b)
source
theorem Set.bounded_gt_Ioo {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Ioo a b)
source
theorem Set.bounded_gt_Ioc {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Ioc a b)
source
theorem Set.bounded_gt_Ico {α : Type u_1} [Preorder α] [NoMinOrder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Ico a b)
source
theorem Set.bounded_gt_Icc {α : Type u_1} [Preorder α] [NoMinOrder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (Set.Icc a b)
source
theorem Set.bounded_ge_Ioo {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Ioo a b)
source
theorem Set.bounded_ge_Ioc {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Ioc a b)
source
theorem Set.bounded_ge_Ico {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Ico a b)
source
theorem Set.bounded_ge_Icc {α : Type u_1} [Preorder α] (a : α) (b : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (Set.Icc a b)

Unbounded intervals #

source
theorem Set.unbounded_le_Ioi {α : Type u_1} [SemilatticeSup α] [NoMaxOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Ioi a)
source
theorem Set.unbounded_le_Ici {α : Type u_1} [SemilatticeSup α] [NoMaxOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) (Set.Ici a)
source
theorem Set.unbounded_lt_Ioi {α : Type u_1} [SemilatticeSup α] [NoMaxOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) (Set.Ioi a)
source
theorem Set.unbounded_lt_Ici {α : Type u_1} [SemilatticeSup α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) (Set.Ici a)

Bounded initial segments #

source
theorem Set.bounded_inter_not {α : Type u_1} {r : α → α → Prop} {s : Set α} (H : ∀ (a b : α), ∃ (m : α), ∀ (c : α), r c a ∨ r c b → r c m) (a : α) :
Set.Bounded r (s ∩ {b : α | ¬r b a}) ↔ Set.Bounded r s
source
theorem Set.unbounded_inter_not {α : Type u_1} {r : α → α → Prop} {s : Set α} (H : ∀ (a b : α), ∃ (m : α), ∀ (c : α), r c a ∨ r c b → r c m) (a : α) :
Set.Unbounded r (s ∩ {b : α | ¬r b a}) ↔ Set.Unbounded r s

Less or equal #

source
theorem Set.bounded_le_inter_not_le {α : Type u_1} {s : Set α} [SemilatticeSup α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | ¬b ≤ a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.unbounded_le_inter_not_le {α : Type u_1} {s : Set α} [SemilatticeSup α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | ¬b ≤ a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.bounded_le_inter_lt {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | a < b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.unbounded_le_inter_lt {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | a < b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.bounded_le_inter_le {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | a ≤ b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≤ x2) s
source
theorem Set.unbounded_le_inter_le {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) (s ∩ {b : α | a ≤ b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≤ x2) s

Less than #

source
theorem Set.bounded_lt_inter_not_lt {α : Type u_1} {s : Set α} [SemilatticeSup α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | ¬b < a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.unbounded_lt_inter_not_lt {α : Type u_1} {s : Set α} [SemilatticeSup α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | ¬b < a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.bounded_lt_inter_le {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | a ≤ b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.unbounded_lt_inter_le {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | a ≤ b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.bounded_lt_inter_lt {α : Type u_1} {s : Set α} [LinearOrder α] [NoMaxOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | a < b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 < x2) s
source
theorem Set.unbounded_lt_inter_lt {α : Type u_1} {s : Set α} [LinearOrder α] [NoMaxOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 < x2) (s ∩ {b : α | a < b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 < x2) s

Greater or equal #

source
theorem Set.bounded_ge_inter_not_ge {α : Type u_1} {s : Set α} [SemilatticeInf α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | ¬a ≤ b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.unbounded_ge_inter_not_ge {α : Type u_1} {s : Set α} [SemilatticeInf α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | ¬a ≤ b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.bounded_ge_inter_gt {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | b < a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.unbounded_ge_inter_gt {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | b < a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.bounded_ge_inter_ge {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | b ≤ a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 ≥ x2) s
source
theorem Set.unbounded_ge_iff_unbounded_inter_ge {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) (s ∩ {b : α | b ≤ a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 ≥ x2) s

Greater than #

source
theorem Set.bounded_gt_inter_not_gt {α : Type u_1} {s : Set α} [SemilatticeInf α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | ¬a < b}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.unbounded_gt_inter_not_gt {α : Type u_1} {s : Set α} [SemilatticeInf α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | ¬a < b}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.bounded_gt_inter_ge {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | b ≤ a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.unbounded_inter_ge {α : Type u_1} {s : Set α} [LinearOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | b ≤ a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.bounded_gt_inter_gt {α : Type u_1} {s : Set α} [LinearOrder α] [NoMinOrder α] (a : α) :
Set.Bounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | b < a}) ↔ Set.Bounded (fun (x1 x2 : α) => x1 > x2) s
source
theorem Set.unbounded_gt_inter_gt {α : Type u_1} {s : Set α} [LinearOrder α] [NoMinOrder α] (a : α) :
Set.Unbounded (fun (x1 x2 : α) => x1 > x2) (s ∩ {b : α | b < a}) ↔ Set.Unbounded (fun (x1 x2 : α) => x1 > x2) s