Kneser's theorem, in additive combinatorics, refers to a group of related results about the size of sumsets in abelian groups, published by Martin Kneser in 1953 and 1956. The theorems extend the Cauchy-Davenport theorem, which bounds sumset sizes only for groups of prime order, to general abelian groups, with several statements addressing when a sumset stays strictly smaller than the sum of the sizes of its two component sets, and a further statement addressing when equality holds for Haar measure in connected compact abelian groups. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Sources
1. Kneser's theorem (combinatorics) (Wikipedia)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.