The range of a MonoidWithZeroHom #
Given a MonoidWithZeroHom f : A → B whose codomain B is a LinearOrderedCommGroupWithZero,
we provide some order properties of the MonoidWithZeroHom.ValueGroup₀ as defined in
Mathlib.Algebra.GroupWithZero.Range.
def MonoidWithZeroHom.ValueGroup₀.orderMonoidWithZeroHom {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] (f : A →*₀ B) :
The inclusion of ValueGroup₀ f into WithZero Bˣ as a homomorphism of monoids with zero.
Equations
- MonoidWithZeroHom.ValueGroup₀.orderMonoidWithZeroHom f = { toMonoidWithZeroHom := WithZero.map' f.valueGroup.subtype, monotone' := ⋯ }
Instances For
theorem MonoidWithZeroHom.ValueGroup₀.monoidWithZeroHom_strictMono {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} :
theorem MonoidWithZeroHom.ValueGroup₀.embedding_strictMono {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} :
instance MonoidWithZeroHom.ValueGroup₀.instIsOrderedMonoid {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} :
@[instance_reducible]
instance MonoidWithZeroHom.ValueGroup₀.instLinearOrderedCommGroupWithZero {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} :
Equations
- One or more equations did not get rendered due to their size.
theorem MonoidWithZeroHom.ValueGroup₀.embedding_unit_pos {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} (a : f.ValueGroup₀ˣ) :
theorem MonoidWithZeroHom.ValueGroup₀.embedding_unit_ne_zero {A : Type u_1} {B : Type u_2} [MonoidWithZero A] [LinearOrderedCommGroupWithZero B] {f : A →*₀ B} (a : f.ValueGroup₀ˣ) :