Theorems · Theorem · combinatorics
Finsupp.prod_antidiagonal_swap
∀ {α : Type u} [inst : DecidableEq α] {M : Type u_1} [inst_1 : CommMonoid M] (n : α →₀ ℕ) (f : (α →₀ ℕ) → (α →₀ ℕ) → M),
∏ p ∈ Finset.HasAntidiagonal.antidiagonal n, f p.1 p.2 = ∏ p ∈ Finset.HasAntidiagonal.antidiagonal n, f p.2 p.1- Defined in
- Mathlib.Data.Finsupp.Antidiagonal
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsuppstatement and proof · cited by 5,255
- Finset.prodstatement · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- add_commproof · cited by 1,535
- Finset.HasAntidiagonal.antidiagonalstatement · cited by 218
- Equiv.prodCommproof · cited by 55
- Finset.prod_equivproof · cited by 11
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.