Group action on rings #

THIS FILE IS SYNCHRONIZED WITH MATHLIB4. Any changes to this file require a corresponding PR to mathlib4.

This file defines the typeclass of monoid acting on semirings mul_semiring_action M R, and the corresponding typeclass of invariant subrings.

Note that algebra does not satisfy the axioms of mul_semiring_action.

Implementation notes #

There is no separate typeclass for group acting on rings, group acting on fields, etc. They are all grouped under mul_semiring_action.

Tags #

group action, invariant subring

source

@[class]

structure mul_semiring_action (M : Type u) (R : Type v) [monoid M] [semiring R] :

Type (max u v)

to_distrib_mul_action : distrib_mul_action M R
smul_one : ∀ (g : M), g • 1 = 1
smul_mul : ∀ (g : M) (x y : R), g • (x * y) = g • x * g • y

Typeclass for multiplicative actions by monoids on semirings.

This combines distrib_mul_action with mul_distrib_mul_action.

Instances of this typeclass

Instances of other typeclasses for mul_semiring_action

mul_semiring_action.has_sizeof_inst

source

@[protected, instance]

def mul_semiring_action.to_mul_distrib_mul_action (M : Type u_1) [monoid M] (R : Type v) [semiring R] [h : mul_semiring_action M R] :

mul_distrib_mul_action M R

Equations

mul_semiring_action.to_mul_distrib_mul_action M R = {to_mul_action := distrib_mul_action.to_mul_action mul_semiring_action.to_distrib_mul_action, smul_mul := _, smul_one := _}

source

@[simp]

theorem mul_semiring_action.to_ring_hom_apply (M : Type u_1) [monoid M] (R : Type v) [semiring R] [mul_semiring_action M R] (x : M) (ᾰ : R) :

⇑(mul_semiring_action.to_ring_hom M R x) ᾰ = (mul_distrib_mul_action.to_monoid_hom R x).to_fun ᾰ

source

def mul_semiring_action.to_ring_hom (M : Type u_1) [monoid M] (R : Type v) [semiring R] [mul_semiring_action M R] (x : M) :

R →+* R

Each element of the monoid defines a semiring homomorphism.

Equations

mul_semiring_action.to_ring_hom M R x = {to_fun := (mul_distrib_mul_action.to_monoid_hom R x).to_fun, map_one' := _, map_mul' := _, map_zero' := _, map_add' := _}

source

theorem to_ring_hom_injective (M : Type u_1) [monoid M] (R : Type v) [semiring R] [mul_semiring_action M R] [has_faithful_smul M R] :

function.injective (mul_semiring_action.to_ring_hom M R)

source

@[simp]

theorem mul_semiring_action.to_ring_equiv_apply (G : Type u_3) [group G] (R : Type v) [semiring R] [mul_semiring_action G R] (x : G) (ᾰ : R) :

⇑(mul_semiring_action.to_ring_equiv G R x) ᾰ = (distrib_mul_action.to_add_equiv R x).to_fun ᾰ

source

def mul_semiring_action.to_ring_equiv (G : Type u_3) [group G] (R : Type v) [semiring R] [mul_semiring_action G R] (x : G) :

R ≃+* R

Each element of the group defines a semiring isomorphism.

Equations

mul_semiring_action.to_ring_equiv G R x = {to_fun := (distrib_mul_action.to_add_equiv R x).to_fun, inv_fun := (distrib_mul_action.to_add_equiv R x).inv_fun, left_inv := _, right_inv := _, map_mul' := _, map_add' := _}

source

@[simp]

theorem mul_semiring_action.to_ring_equiv_symm_apply (G : Type u_3) [group G] (R : Type v) [semiring R] [mul_semiring_action G R] (x : G) (ᾰ : R) :

⇑((mul_semiring_action.to_ring_equiv G R x).symm) ᾰ = (distrib_mul_action.to_add_equiv R x).inv_fun ᾰ

source

@[reducible]

def mul_semiring_action.comp_hom {M : Type u_1} {N : Type u_2} [monoid M] [monoid N] (R : Type v) [semiring R] (f : N →* M) [mul_semiring_action M R] :

mul_semiring_action N R

Compose a mul_semiring_action with a monoid_hom, with action f r' • m. See note [reducible non-instances].

Equations

mul_semiring_action.comp_hom R f = {to_distrib_mul_action := {to_mul_action := {to_has_smul := {smul := has_smul.comp.smul ⇑f}, one_smul := _, mul_smul := _}, smul_zero := _, smul_add := _}, smul_one := _, smul_mul := _}

source

@[simp]

theorem smul_inv'' {M : Type u_1} [monoid M] {F : Type v} [division_ring F] [mul_semiring_action M F] (x : M) (m : F) :

x • m⁻¹ = (x • m)⁻¹

Note that smul_inv' refers to the group case, and smul_inv has an additional inverse on x.