Theorems · Inductive type · commutative algebra
PolynomialLaw
(R : Type u) →
[inst : CommSemiring R] →
(M : Type u_1) →
[inst_1 : AddCommMonoid M] →
[Module R M] → (N : Type u_2) → [inst_3 : AddCommMonoid N] → [Module R N] → Type (max (max (u + 1) u_1) u_2)A polynomial law M →ₚₗ[R] N between R-modules is a functorial family of maps
S ⊗[R] M → S ⊗[R] N, for all R-algebras S.
For universe reasons, S has to be restricted to the same universe as R.
- Defined in
- Mathlib.RingTheory.PolynomialLaw.Basic
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement · cited by 20,661
- AddCommMonoidstatement · cited by 12,281
- CommSemiringstatement · cited by 10,911
Cited by53
Results whose statement or proof uses this declaration.
- PolynomialLaw.toFun'statement and proof · cited by 29
- PolynomialLaw.toFunstatement and proof · cited by 12
- PolynomialLaw.toFun_eq_rTensor_φ_toFun'statement and proof · cited by 7
- PolynomialLaw.compstatement and proof · cited by 6
- PolynomialLaw.extstatement and proof · cited by 6
- PolynomialLaw.groundstatement and proof · cited by 5
- PolynomialLaw.idstatement · cited by 5
- PolynomialLaw.isCompat_apply'statement and proof · cited by 3
- PolynomialLaw.isCompat_applystatement and proof · cited by 2
- PolynomialLaw.toFun'_eq_of_diagramstatement and proof · cited by 2
- PolynomialLaw.toFunLiftedstatement and proof · cited by 2
- PolynomialLaw.comp_toFun'statement and proof · cited by 1