The embedding of a cancellative semigroup into itself by multiplication by a fixed element. #
If left-addition by any element is cancellative, left-addition by g
is an
embedding.
Equations
- addLeftEmbedding g = { toFun := fun (h : G) => g + h, inj' := (_ : Function.Injective fun (x : G) => g + x) }
Instances For
@[simp]
theorem
mulLeftEmbedding_apply
{G : Type u_1}
[Mul G]
[IsLeftCancelMul G]
(g : G)
(h : G)
:
(mulLeftEmbedding g) h = g * h
@[simp]
theorem
addLeftEmbedding_apply
{G : Type u_1}
[Add G]
[IsLeftCancelAdd G]
(g : G)
(h : G)
:
(addLeftEmbedding g) h = g + h
If left-multiplication by any element is cancellative, left-multiplication by g
is an
embedding.
Equations
- mulLeftEmbedding g = { toFun := fun (h : G) => g * h, inj' := (_ : Function.Injective fun (x : G) => g * x) }
Instances For
If right-addition by any element is cancellative, right-addition by g
is an
embedding.
Equations
- addRightEmbedding g = { toFun := fun (h : G) => h + g, inj' := (_ : Function.Injective fun (x : G) => x + g) }
Instances For
@[simp]
theorem
mulRightEmbedding_apply
{G : Type u_1}
[Mul G]
[IsRightCancelMul G]
(g : G)
(h : G)
:
(mulRightEmbedding g) h = h * g
@[simp]
theorem
addRightEmbedding_apply
{G : Type u_1}
[Add G]
[IsRightCancelAdd G]
(g : G)
(h : G)
:
(addRightEmbedding g) h = h + g
If right-multiplication by any element is cancellative, right-multiplication by g
is an
embedding.
Equations
- mulRightEmbedding g = { toFun := fun (h : G) => h * g, inj' := (_ : Function.Injective fun (x : G) => x * g) }
Instances For
theorem
addLeftEmbedding_eq_addRightEmbedding
{G : Type u_1}
[AddCommSemigroup G]
[IsCancelAdd G]
(g : G)
:
theorem
mulLeftEmbedding_eq_mulRightEmbedding
{G : Type u_1}
[CommSemigroup G]
[IsCancelMul G]
(g : G)
: