Theorems · Inductive type · linear algebra
PiTensorProduct.Eqv
{ι : Type u_1} →
(R : Type u_4) →
[inst : CommSemiring R] →
(s : ι → Type u_7) →
[inst_1 : (i : ι) → AddCommMonoid (s i)] →
[(i : ι) → Module R (s i)] → FreeAddMonoid (R × ((i : ι) → s i)) → FreeAddMonoid (R × ((i : ι) → s i)) → PropThe relation on FreeAddMonoid (R × Π i, s i) that generates a congruence whose quotient is
the tensor product.
- Cited by
- 3 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.
Cites4
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
- FreeAddMonoidstatement · cited by 145
Cited by8
Results whose statement or proof uses this declaration.
- PiTensorProductproof · cited by 181
- PiTensorProduct.tprodCoeffproof · cited by 13
- PiTensorProduct.liftAux_tprodproof · cited by 2
- PiTensorProduct.liftAddHomproof · cited by 1
- FreeAddMonoid.toPiTensorProductstatement and proof · cited by 1
- PiTensorProduct.lifts_addproof · cited by 1
- PiTensorProduct.Eqv.casesOnstatement and proof · cited by 0
- PiTensorProduct.Eqv.recOnstatement and proof · cited by 0