Documentation

Linglib.Core.Algebra.Order.Group.Indicator

Strictly monotone maps into ordered groups detect ≤ #

[UPSTREAM] candidate for Mathlib/Algebra/Order/Group/Indicator.lean.

The indicator of an upper set is monotone wherever the function is monotone and nonnegative. Adding a large constant on Set.Ici a to a strictly monotone map into a nontrivial linearly ordered additive group therefore keeps it strictly monotone, so for a partial order α, a ≤ b fails exactly when some strictly monotone map puts a above b, and two elements are incomparable exactly when strictly monotone maps order them both ways.

theorem IsUpperSet.monotone_mulIndicator {α : Type u_1} {M : Type u_2} [Preorder α] [Preorder M] [One M] {s : Set α} {f : α → M} (hs : IsUpperSet s) (hf : Monotone f) (h1 : ∀ x ∈ s, 1 ≤ f x) :
Monotone (s.mulIndicator f)

The indicator of an upper set is monotone where the function is monotone and at least 1.

theorem IsUpperSet.monotone_indicator {α : Type u_1} {M : Type u_2} [Preorder α] [Preorder M] [Zero M] {s : Set α} {f : α → M} (hs : IsUpperSet s) (hf : Monotone f) (h1 : ∀ x ∈ s, 0 ≤ f x) :
Monotone (s.indicator f)

The indicator of an upper set is monotone where the function is monotone and nonnegative.

theorem StrictMono.exists_strictMono_lt_of_not_ge {α : Type u_1} {β : Type u_2} [AddCommGroup β] [LinearOrder β] [IsOrderedAddMonoid β] [Nontrivial β] {f : α → β} {a b : α} [Preorder α] (hf : StrictMono f) (hab : ¬a ≤ b) :
∃ (g : α → β), StrictMono g ∧ g b < g a

Given one strictly monotone map into a nontrivial linearly ordered additive group, some strictly monotone map puts a above any b with ¬ a ≤ b.

theorem StrictMono.not_le_iff_exists_strictMono_lt {α : Type u_1} {β : Type u_2} [AddCommGroup β] [LinearOrder β] [IsOrderedAddMonoid β] [Nontrivial β] {f : α → β} {a b : α} [PartialOrder α] (hf : StrictMono f) :
¬a ≤ b ↔ ∃ (g : α → β), StrictMono g ∧ g b < g a

For a partial order α with a strictly monotone map into a nontrivial linearly ordered additive group, a ≤ b fails iff some strictly monotone map puts a above b.

theorem StrictMono.incompRel_iff_exists_strictMono {α : Type u_1} {β : Type u_2} [AddCommGroup β] [LinearOrder β] [IsOrderedAddMonoid β] [Nontrivial β] {f : α → β} {a b : α} [PartialOrder α] (hf : StrictMono f) :
IncompRel (fun (x1 x2 : α) => x1 ≤ x2) a b ↔ (∃ (g : α → β), StrictMono g ∧ g a < g b) ∧ ∃ (g : α → β), StrictMono g ∧ g b < g a

For a partial order α with a strictly monotone map into a nontrivial linearly ordered additive group, a and b are incomparable iff strictly monotone maps order them both ways.