Theorems · Definition · combinatorics
Finset.diag
{α : Type u_1} → Finset α → Finset (α × α)Given a finite set s, the diagonal, s.diag is the set of pairs of the form (a, a) for
a ∈ s.
- Defined in
- Mathlib.Data.Finset.Prod
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Quot.sound
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.
- Finsetstatement and proof · cited by 13,712
- Finset.mapproof · cited by 747
- Function.diagproof · cited by 34
- Function.diag_injectiveproof · cited by 3
Cited by23
Results whose statement or proof uses this declaration.
- Finset.image_diagstatement · cited by 2
- QuadraticMap.toQuadraticMap_toBilinproof · cited by 1
- Finset.sum_diagstatement · cited by 1
- Finset.diag_union_offDiagstatement · cited by 1
- Finset.disjoint_diag_offDiagstatement · cited by 1
- Sym2.card_image_diagstatement · cited by 0
- Finset.diag_cardstatement · cited by 0
- Finset.diag_emptystatement · cited by 0
- Finset.diag_eq_emptystatement · cited by 0
- Finset.diag_eq_filterstatement · cited by 0
- Finset.diag_insertstatement · cited by 0
- Finset.diag_interstatement · cited by 0