Theorems · Theorem · order theory
Finset.equitableOn_iff_le_le_add_one
∀ {α : Type u_1} {s : Finset α} {f : α → ℕ},
(↑s).EquitableOn f ↔ ∀ a ∈ s, (∑ i ∈ s, f i) / s.card ≤ f a ∧ f a ≤ (∑ i ∈ s, f i) / s.card + 1- Defined in
- Mathlib.Data.Set.Equitable
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
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
- SetLike.coestatement and proof · cited by 8,199
- Finset.sumstatement and proof · cited by 5,195
- Finset.cardstatement and proof · cited by 2,327
- mul_commproof · cited by 2,262
- le_reflproof · cited by 2,061
- le_rflproof · cited by 1,558
- le_transproof · cited by 985
- LT.lt.trans_leproof · cited by 678
- Finset.sum_constproof · cited by 254
- Finset.sum_le_sumproof · cited by 182
- LE.le.lt_of_neproof · cited by 116
Cited by2
Results whose statement or proof uses this declaration.
- Finset.EquitableOn.leproof · cited by 1
- Finset.EquitableOn.le_add_oneproof · cited by 1