Construct ordered groups from groups with a specified positive cone.

In this file we provide the structure GroupCone and the predicate IsMaxCone that encode axioms of OrderedCommGroup and LinearOrderedCommGroup in terms of the subset of non-negative elements.

We also provide constructors that convert between cones in groups and the corresponding ordered groups.

class AddGroupConeClass (S : Type u_1) (G : outParam (Type u_2)) [AddCommGroup G] [SetLike S G] extends AddSubmonoidClass S G : Prop

AddGroupConeClass S G says that S is a type of cones in G.

• add_mem {s : S} {a b : G} : a ∈ s → b ∈ s → a + b ∈ s
• zero_mem (s : S) : 0 ∈ s
• eq_zero_of_mem_of_neg_mem {C : S} {a : G} : a ∈ C → -a ∈ C → a = 0

class GroupConeClass (S : Type u_1) (G : outParam (Type u_2)) [CommGroup G] [SetLike S G] extends SubmonoidClass S G : Prop

GroupConeClass S G says that S is a type of cones in G.

• mul_mem {s : S} {a b : G} : a ∈ s → b ∈ s → a * b ∈ s
• one_mem (s : S) : 1 ∈ s
• eq_one_of_mem_of_inv_mem {C : S} {a : G} : a ∈ C → a⁻¹ ∈ C → a = 1

structure AddGroupCone (G : Type u_1) [AddCommGroup G] extends AddSubmonoid G : Type u_1

A (positive) cone in an abelian group is a submonoid that does not contain both a and -a for any nonzero a. This is equivalent to being the set of non-negative elements of some order making the group into a partially ordered group.

• carrier : Set G
• add_mem' {a b : G} : a ∈ self.carrier → b ∈ self.carrier → a + b ∈ self.carrier
• zero_mem' : 0 ∈ self.carrier
• eq_zero_of_mem_of_neg_mem' {a : G} : a ∈ self.carrier → -a ∈ self.carrier → a = 0

structure GroupCone (G : Type u_1) [CommGroup G] extends Submonoid G : Type u_1

A (positive) cone in an abelian group is a submonoid that does not contain both a and a⁻¹ for any non-identity a. This is equivalent to being the set of elements that are at least 1 in some order making the group into a partially ordered group.

• carrier : Set G
• mul_mem' {a b : G} : a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
• one_mem' : 1 ∈ self.carrier
• eq_one_of_mem_of_inv_mem' {a : G} : a ∈ self.carrier → a⁻¹ ∈ self.carrier → a = 1

@[implicit_reducible]

instance GroupCone.instSetLike (G : Type u_1) [CommGroup G] : SetLike (GroupCone G) G

Equations

• GroupCone.instSetLike G = { coe := fun (C : GroupCone G) => C.carrier, coe_injective' := ⋯ }

@[implicit_reducible]

instance AddGroupCone.instSetLike (G : Type u_1) [AddCommGroup G] : SetLike (AddGroupCone G) G

Equations

• AddGroupCone.instSetLike G = { coe := fun (C : AddGroupCone G) => C.carrier, coe_injective' := ⋯ }

@[implicit_reducible]

instance instPartialOrderGroupCone (G : Type u_1) [CommGroup G] : PartialOrder (GroupCone G)

Equations

• instPartialOrderGroupCone G = PartialOrder.ofSetLike (GroupCone G) G

@[implicit_reducible]

instance instPartialOrderAddGroupCone (G : Type u_1) [AddCommGroup G] : PartialOrder (AddGroupCone G)

Equations

• instPartialOrderAddGroupCone G = PartialOrder.ofSetLike (AddGroupCone G) G

instance GroupCone.instGroupConeClass (G : Type u_1) [CommGroup G] : GroupConeClass (GroupCone G) G

instance AddGroupCone.instAddGroupConeClass (G : Type u_1) [AddCommGroup G] : AddGroupConeClass (AddGroupCone G) G

def GroupCone.oneLE (H : Type u_1) [CommGroup H] [PartialOrder H] [IsOrderedMonoid H] : GroupCone H

The cone of elements that are at least 1.

Equations

• GroupCone.oneLE H = { toSubmonoid := Submonoid.oneLE H, eq_one_of_mem_of_inv_mem' := ⋯ }

def AddGroupCone.nonneg (H : Type u_1) [AddCommGroup H] [PartialOrder H] [IsOrderedAddMonoid H] : AddGroupCone H

The cone of non-negative elements.

Equations

• AddGroupCone.nonneg H = { toAddSubmonoid := AddSubmonoid.nonneg H, eq_zero_of_mem_of_neg_mem' := ⋯ }

@[simp]

theorem GroupCone.oneLE_toSubmonoid {H : Type u_1} [CommGroup H] [PartialOrder H] [IsOrderedMonoid H] : (oneLE H).toSubmonoid = Submonoid.oneLE H

@[simp]

theorem AddGroupCone.nonneg_toAddSubmonoid {H : Type u_1} [AddCommGroup H] [PartialOrder H] [IsOrderedAddMonoid H] : (nonneg H).toAddSubmonoid = AddSubmonoid.nonneg H

@[simp]

theorem GroupCone.mem_oneLE {H : Type u_1} [CommGroup H] [PartialOrder H] [IsOrderedMonoid H] {a : H} : a ∈ oneLE H ↔ 1 ≤ a

@[simp]

theorem AddGroupCone.mem_nonneg {H : Type u_1} [AddCommGroup H] [PartialOrder H] [IsOrderedAddMonoid H] {a : H} : a ∈ nonneg H ↔ 0 ≤ a

@[simp]

theorem GroupCone.coe_oneLE {H : Type u_1} [CommGroup H] [PartialOrder H] [IsOrderedMonoid H] : ↑(oneLE H) = {x : H | 1 ≤ x}

@[simp]

theorem AddGroupCone.coe_nonneg {H : Type u_1} [AddCommGroup H] [PartialOrder H] [IsOrderedAddMonoid H] : ↑(nonneg H) = {x : H | 0 ≤ x}

instance GroupCone.oneLE.hasMemOrInvMem {H : Type u_2} [CommGroup H] [LinearOrder H] [IsOrderedMonoid H] : HasMemOrInvMem (oneLE H)

instance AddGroupCone.nonneg.hasMemOrNegMem {H : Type u_2} [AddCommGroup H] [LinearOrder H] [IsOrderedAddMonoid H] : HasMemOrNegMem (nonneg H)

@[reducible, inline]

abbrev PartialOrder.mkOfGroupCone {S : Type u_1} {G : Type u_2} [CommGroup G] [SetLike S G] (C : S) [GroupConeClass S G] : PartialOrder G

Construct a partial order by designating a cone in an abelian group.

Equations

• PartialOrder.mkOfGroupCone C = { le := fun (a b : G) => b / a ∈ C, le_refl := ⋯, le_trans := ⋯, lt_iff_le_not_ge := ⋯, le_antisymm := ⋯ }

@[reducible, inline]

abbrev PartialOrder.mkOfAddGroupCone {S : Type u_1} {G : Type u_2} [AddCommGroup G] [SetLike S G] (C : S) [AddGroupConeClass S G] : PartialOrder G

Construct a partial order by designating a cone in an abelian group.

Equations

• PartialOrder.mkOfAddGroupCone C = { le := fun (a b : G) => b - a ∈ C, le_refl := ⋯, le_trans := ⋯, lt_iff_le_not_ge := ⋯, le_antisymm := ⋯ }

@[simp]

theorem PartialOrder.mkOfGroupCone_le_iff {S : Type u_3} {G : Type u_4} [CommGroup G] [SetLike S G] [GroupConeClass S G] {C : S} {a b : G} : a ≤ b ↔ b / a ∈ C

@[simp]

theorem PartialOrder.mkOfAddGroupCone_le_iff {S : Type u_3} {G : Type u_4} [AddCommGroup G] [SetLike S G] [AddGroupConeClass S G] {C : S} {a b : G} : a ≤ b ↔ b - a ∈ C

@[reducible, inline]

abbrev LinearOrder.mkOfGroupCone {S : Type u_1} {G : Type u_2} [CommGroup G] [SetLike S G] (C : S) [GroupConeClass S G] [HasMemOrInvMem C] [DecidablePred fun (x : G) => x ∈ C] : LinearOrder G

Construct a linear order by designating a maximal cone in an abelian group.

Equations

• One or more equations did not get rendered due to their size.

@[reducible, inline]

abbrev LinearOrder.mkOfAddGroupCone {S : Type u_1} {G : Type u_2} [AddCommGroup G] [SetLike S G] (C : S) [AddGroupConeClass S G] [HasMemOrNegMem C] [DecidablePred fun (x : G) => x ∈ C] : LinearOrder G

Construct a linear order by designating a maximal cone in an abelian group.

Equations

• One or more equations did not get rendered due to their size.

theorem IsOrderedMonoid.mkOfCone {S : Type u_1} {G : Type u_2} [CommGroup G] [SetLike S G] (C : S) [GroupConeClass S G] : have x := PartialOrder.mkOfGroupCone C; IsOrderedMonoid G

Construct a partially ordered abelian group by designating a cone in an abelian group.

theorem IsOrderedAddMonoid.mkOfCone {S : Type u_1} {G : Type u_2} [AddCommGroup G] [SetLike S G] (C : S) [AddGroupConeClass S G] : have x := PartialOrder.mkOfAddGroupCone C; IsOrderedAddMonoid G

Construct a partially ordered abelian group by designating a cone in an abelian group.