Theorems · Theorem · linear algebra
Matrix.det_mul_aux
∀ {n : Type u_2} [inst : DecidableEq n] [inst_1 : Fintype n] {R : Type v} [inst_2 : CommRing R] {M N : Matrix n n R}
{p : n → n}, ¬Function.Bijective p → ∑ σ, ↑↑(Equiv.Perm.sign σ) * ∏ x, M (σ x) (p x) * N (p x) x = 0- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeCommRing
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement · cited by 5,195
- Matrixstatement and proof · cited by 4,303
- mul_oneproof · cited by 3,885
- MonoidHomstatement · cited by 3,629
- Finset.univstatement and proof · cited by 3,473
- Unitsstatement · cited by 2,804
- Finset.prodstatement and proof · cited by 2,356
- Units.valstatement and proof · cited by 1,966
- Equiv.Permstatement and proof · cited by 1,375
Cited by1
Results whose statement or proof uses this declaration.
- Matrix.det_mulproof · cited by 51