Theorems · Theorem · combinatorics
Finset.ruzsa_covering_add
∀ {G : Type u_1} [inst : AddGroup G] {K : ℝ} [inst_1 : DecidableEq G] {A B : Finset G},
B.Nonempty → ↑(A + B).card ≤ K * ↑B.card → ∃ F ⊆ A, ↑F.card ≤ K ∧ A ⊆ F + (B - B)Ruzsa's covering lemma
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 106 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddGroupDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites47
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Realstatement and proof · cited by 25,697
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- AddGroupstatement and proof · cited by 4,410
- Finset.cardstatement and proof · cited by 2,327
- Disjointproof · cited by 2,201
- le_reflproof · cited by 2,061
- HVAdd.hVAddproof · cited by 1,820
- Finset.Nonemptystatement and proof · cited by 1,001
- Finset.filterproof · cited by 949
- add_le_addproof · cited by 666
Cited by2
Results whose statement or proof uses this declaration.
- IsApproximateAddSubgroup.of_small_triplingproof · cited by 0
- Set.ruzsa_covering_addproof · cited by 0