Theorems · Theorem · order theory
Finset.EquitableOn.le
∀ {α : Type u_1} {s : Finset α} {f : α → ℕ} {a : α}, (↑s).EquitableOn f → a ∈ s → (∑ i ∈ s, f i) / s.card ≤ f a- Defined in
- Mathlib.Data.Set.Equitable
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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 · cited by 5,195
- Finset.cardstatement · cited by 2,327
- Set.EquitableOnstatement and proof · cited by 12
- Finset.equitableOn_iff_le_le_add_oneproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finpartition.IsEquipartition.average_le_card_partproof · cited by 1