Theorems · Theorem · commutative algebra

PolynomialLaw.toFun_neg

∀ {R : Type u} [inst : CommRing R] {M : Type u_6} [inst_1 : AddCommGroup M] [inst_2 : Module R M] {N : Type u_7}
  [inst_3 : AddCommGroup N] [inst_4 : Module R N] (f : M →ₚₗ[R] N) (S : Type u_8) [inst_5 : CommSemiring S]
  [inst_6 : Algebra R S], PolynomialLaw.toFun S (-f) = -1 • PolynomialLaw.toFun S f

Defined in

Mathlib.RingTheory.PolynomialLaw.Basic

Cited by

0 results in Mathlib

Foundations

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

Assumes

CommRingAddCommGroupModuleAddCommGroupModuleCommSemiringAlgebra