Theorems · Theorem · commutative algebra

PolynomialLaw.toFun_comp_apply

∀ {R : Type u} [inst : CommSemiring R] {M : Type u_3} [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {N : Type u_4}
  [inst_3 : AddCommMonoid N] [inst_4 : Module R N] {P : Type u_5} [inst_5 : AddCommMonoid P] [inst_6 : Module R P]
  (f : M →ₚₗ[R] N) (g : N →ₚₗ[R] P) (S : Type u_7) [inst_7 : CommSemiring S] [inst_8 : Algebra R S]
  (m : TensorProduct R S M), PolynomialLaw.toFun S (g.comp f) m = PolynomialLaw.toFun S g (PolynomialLaw.toFun S f m)

Defined in

Mathlib.RingTheory.PolynomialLaw.Basic

Cited by

0 results in Mathlib

Foundations

Depth 106 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CommSemiringAddCommMonoidModuleAddCommMonoidModuleAddCommMonoidModuleCommSemiringAlgebra