Theorems · Theorem · combinatorics

Finset.card_mul_inv_eq_convolution_inv

∀ {G : Type u_1} [inst : Group G] [inst_1 : DecidableEq G] (A B : Finset G) (x : G),
  {ab ∈ A ×ˢ B | ab.1 * ab.2⁻¹ = x}.card = A.convolution B⁻¹ x

Defined in

Mathlib.Combinatorics.Additive.Convolution

Cited by

1 results in Mathlib

Foundations

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

Assumes

GroupDecidableEq