theorem PointedCone.eq_zero_of_mem_of_neg_mem {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {C : PointedCone R M} (hC : C.IsPointed) {x : M} (hx₁ : x ∈ C) (hx₂ : -x ∈ C) :
theorem PointedCone.eq_zero_of_mem_of_neg_mem₂ {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {C : PointedCone R M} (hC : C.IsPointed) {x : M} (hx₁ : x ∈ C) (hx₂ : -x ∈ C) :
Alias of PointedCone.eq_zero_of_mem_of_neg_mem.
theorem PointedCone.mem_or_neg_mem {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {C : PointedCone R M} (hC : C.IsSpanning) (a : M) :
@[simp]
theorem PointedCone.lineal_eq_bot {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} [AddCommGroup M] [Module R M] (C : PointedCone R M) (hC : C.IsPointed) :
theorem PointedCone.comap_isSpanning {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} {M' : Type u_4} [AddCommGroup M] [Module R M] [AddCommGroup M'] [Module R M'] (f : M →ₗ[R] M') (C' : PointedCone R M') (hC' : C'.IsSpanning) :
(comap f C').IsSpanning
theorem PointedCone.map_isSpanning {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} {M' : Type u_4} [AddCommGroup M] [Module R M] [AddCommGroup M'] [Module R M'] {f : M →ₗ[R] M'} (C : PointedCone R M) (hC : C.IsSpanning) (hf : Function.Surjective ⇑f) :
(map f C).IsSpanning
theorem AddSubmonoid.IsPointed.of_lineal_eq_bot {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} [AddCommGroup M] [Module R M] (C : PointedCone R M) (h : C.lineal = ⊥) :
theorem PointedCone.lineal_mono {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} [AddCommGroup M] [Module R M] {C D : PointedCone R M} (h : C ≤ D) :
@[simp]
theorem PointedCone.lineal_inf {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} [AddCommGroup M] [Module R M] (C D : PointedCone R M) :
@[simp]
theorem PointedCone.lineal_sInf {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} [AddCommGroup M] [Module R M] {s : Set (PointedCone R M)} :
@[simp]
theorem PointedCone.lineal_comap {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} {M' : Type u_4} [AddCommGroup M] [Module R M] [AddCommGroup M'] [Module R M'] (f : M →ₗ[R] M') (C' : PointedCone R M') :
@[simp]
theorem PointedCone.lineal_map {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_3} {M' : Type u_4} [AddCommGroup M] [Module R M] [AddCommGroup M'] [Module R M'] {f : M →ₗ[R] M'} {C : PointedCone R M} (hsupp : f.ker ≤ C.lineal) :
theorem PointedCone.IsSpanning.positive {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] (M : Type u_2) [AddCommGroup M] [Module R M] [LinearOrder M] [IsOrderedAddMonoid M] [IsOrderedModule R M] :
theorem PointedCone.IsPointed.positive {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] (M : Type u_2) [AddCommGroup M] [Module R M] [PartialOrder M] [IsOrderedAddMonoid M] [IsOrderedModule R M] :
theorem IsOrderedModule.ofAddSubmonoid {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {C : PointedCone R M} (hC : C.IsPointed) :
IsOrderedModule R M
noncomputable def Module.isPointedPartialOrderEquiv (R : Type u_1) [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] :
{ C : PointedCone R M // C.IsPointed } ≃ { _o : PartialOrder M // IsOrderedAddMonoid M ∧ IsOrderedModule R M }
Equivalence between cones with zero lineality space in an R-module M
and partially ordered R-module structures on M.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem Module.isPointedPartialOrderEquiv_apply {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] (C : PointedCone R M) (h : C.IsPointed) :
@[simp]
theorem Module.isPointedPartialOrderEquiv_symm_apply {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] (o : PartialOrder M) (h : IsOrderedAddMonoid M ∧ IsOrderedModule R M) :
have this := ⋯;
have this_1 := ⋯;
↑↑((isPointedPartialOrderEquiv R).symm ⟨o, h⟩) = ConvexCone.positive R M
noncomputable def Module.isPointedLinearOrderEquiv (R : Type u_1) [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] :
{ C : PointedCone R M // C.IsPointed ∧ C.IsSpanning } ≃ { _o : LinearOrder M // IsOrderedAddMonoid M ∧ IsOrderedModule R M }
Equivalence between maximal cones with zero lineality space in an R-module M
and linearly ordered R-module structures on M.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem Module.isPointedLinearOrderEquiv_apply {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] (C : PointedCone R M) (h : C.IsPointed ∧ C.IsSpanning) :
@[simp]
theorem Module.isPointedLinearOrderEquiv_symm_apply {R : Type u_1} [Ring R] [LinearOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] (o : LinearOrder M) (h : IsOrderedAddMonoid M ∧ IsOrderedModule R M) :
have this := ⋯;
have this_1 := ⋯;
↑((isPointedLinearOrderEquiv R).symm ⟨o, h⟩) = PointedCone.positive R M