Documentation

Mathlib.GroupTheory.MonoidLocalization.Order

Ordered structures on localizations of commutative monoids #

@[implicit_reducible]
instance Localization.le {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} :
@[implicit_reducible]
@[implicit_reducible]
instance Localization.lt {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} :
@[implicit_reducible]
theorem Localization.mk_le_mk {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} {a₁ b₁ : α} {a₂ b₂ : s} :
mk a₁ a₂ mk b₁ b₂ b₂ * a₁ a₂ * b₁
theorem AddLocalization.mk_le_mk {α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] {s : AddSubmonoid α} {a₁ b₁ : α} {a₂ b₂ : s} :
mk a₁ a₂ mk b₁ b₂ b₂ + a₁ a₂ + b₁
theorem Localization.mk_lt_mk {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} {a₁ b₁ : α} {a₂ b₂ : s} :
mk a₁ a₂ < mk b₁ b₂ b₂ * a₁ < a₂ * b₁
theorem AddLocalization.mk_lt_mk {α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] {s : AddSubmonoid α} {a₁ b₁ : α} {a₂ b₂ : s} :
mk a₁ a₂ < mk b₁ b₂ b₂ + a₁ < a₂ + b₁
@[implicit_reducible]
instance Localization.decidableLE {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} [DecidableLE α] :
DecidableLE (Localization s)
@[implicit_reducible]
instance AddLocalization.decidableLE {α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] {s : AddSubmonoid α} [DecidableLE α] :
DecidableLE (AddLocalization s)
@[implicit_reducible]
instance Localization.decidableLT {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} [DecidableLT α] :
DecidableLT (Localization s)
@[implicit_reducible]
instance AddLocalization.decidableLT {α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] {s : AddSubmonoid α} [DecidableLT α] :
DecidableLT (AddLocalization s)

An ordered cancellative monoid injects into its localization by sending a to a / b.

Instances For

    An ordered cancellative monoid injects into its localization by sending a to a - b.

    Instances For
      @[simp]
      theorem Localization.mkOrderEmbedding_apply {α : Type u_1} [CommMonoid α] [PartialOrder α] [IsOrderedCancelMonoid α] {s : Submonoid α} (b : s) (a : α) :
      (mkOrderEmbedding b) a = mk a b