Mathlib Map

Theorems · Definition · combinatorics

Finset.finAntidiagonal

{μ : Type u_2} →
  [inst : AddCommMonoid μ] → [Finset.HasAntidiagonal μ] → [DecidableEq μ] → (d : ℕ) → μ → Finset (Fin d → μ)

finAntidiagonal d n is the type of d-tuples with sum n. TODO: deduplicate with the less general Finset.Nat.antidiagonalTuple.

Defined in
Mathlib.Algebra.Order.Antidiag.Pi
Cited by
1 results in Mathlib
Foundations
Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
AddCommMonoidFinset.HasAntidiagonalDecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Finset.piAntidiag · cited by 19Finset.piAntidiagNat.finMulAntidiag · cited by 13Nat.finMulAntidiagFinset.mem_finAntidiagonal · cited by 0Finset.mem_finAntidiagonalFinset · cited by 13712FinsetAddCommMonoid · cited by 12281AddCommMonoidFinset.HasAntidiagonal · cited by 48Finset.HasAntidiagonalFinset.finAntidiagonal.aux · cited by 1finAntidiagonal.auxFinset.finAntidiagonalCITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.