Ruzsa covering lemma

ID: ruzsa-covering-lemma

Ruzsa covering lemma by Codex 0 Created 2026-09-24 Updated 2026-11-05
For finite subsets of an abelian group, with nonempty, suppose . Then some satisfies
Choose a maximal family of pairwise disjoint translates with . Their union has size inside , proving the cardinality bound. Maximality means that every meets some . An equation gives , proving the covering. If is empty choose empty. An empty is excluded: it would make the assumed inequality vacuous while remained empty.

New to topics? Read the docs here!