Kneser's theorem (combinatorics)

Key takeaways

Kneser's theorem (combinatorics) belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Kneser's theorem (combinatorics) to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Kneser's theorem (combinatorics) from memory before moving on to harder problems.

Reference excerpt

In the branch of mathematics known as additive combinatorics, Kneser's theorem can refer to one of several related theorems regarding the sizes of certain sumsets in abelian groups. These are named after Martin Kneser, who published them in 1953 and 1956. They may be regarded as extensions of the Cauchy–Davenport theorem, which also concerns sumsets in groups but is restricted to groups whose order is a prime number. The first three statements deal with sumsets whose size (in various senses) is strictly smaller than the sum of the size of the summands. The last statement deals with the case of equality for Haar measure in connected compact abelian groups.

Strict inequality If G {\displaystyle G} is an abelian group and C {\displaystyle C} is a subset of G {\displaystyle G} , the group H ( C ) := { g ∈ G : g + C = C } {\displaystyle H(C):=\{g\in G:g+C=C\}} is the stabilizer of C {\displaystyle C} .

Cardinality Let G {\displaystyle G} be an abelian group. If A {\displaystyle A} and B {\displaystyle B} are nonempty finite subsets of G {\displaystyle G} satisfying | A + B | < | A | + | B | {\displaystyle |A+B|<|A|+|B|} and H {\displaystyle H} is the stabilizer of A + B {\displaystyle A+B} , then | A + B | = | A + H | + | B + H | − | H | . {\displaystyle {\begin{aligned}|A+B|&=|A+H|+|B+H|-|H|.\end{aligned}}}

This statement is a corollary of the statement for locally compact abelian groups below, obtained by specializing to the case where the ambient group is discrete. A self-contained proof is provided in Nathanson's textbook.

Lower asymptotic density in the natural numbers The main result of Kneser's 1953 article is a variant of Mann's theorem on Schnirelmann density. If C {\displaystyle C} is a subset of N {\displaystyle \mathbb {N} } , the lower asymptotic density of C {\displaystyle C} is the number d _ ( C ) := lim inf n → ∞ | C ∩ { 1 , … , n } | n {\displaystyle {\underline {d}}(C):=\liminf _{n\to \infty }{\frac {|C\cap \{1,\dots ,n\}|}{n}}} . Kneser's theorem for lower asymptotic density states that if A {\displaystyle A} and B {\displaystyle B} are subsets of N {\displaystyle \mathbb {N} } satisfying d _ ( A + B ) < d _ ( A ) + d _ ( B ) {\displaystyle {\underline {d}}(A+B)<{\underline {d}}(A)+{\underline {d}}(B)} , then there is a natural number k {\displaystyle k} such that H := k N ∪ { 0 } {\displaystyle H:=k\mathbb {N} \cup \{0\}} satisfies the following two conditions:

( A + B + H ) ∖ ( A + B ) {\displaystyle (A+B+H)\setminus (A+B)} is finite, and

d _ ( A + B ) = d _ ( A + H ) + d _ ( B + H ) − d _ ( H ) . {\displaystyle {\underline {d}}(A+B)={\underline {d}}(A+H)+{\underline {d}}(B+H)-{\underline {d}}(H).}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Kneser's theorem (combinatorics)

Start with the simplest possible case. Write down what Kneser's theorem (combinatorics) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Kneser's theorem (combinatorics) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Kneser's theorem (combinatorics) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Kneser's theorem (combinatorics)

In research: Kneser's theorem (combinatorics) appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Kneser's theorem (combinatorics) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Kneser's theorem (combinatorics) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Sumsets, Theorems in combinatorics, so understanding it makes those chapters shorter.
In everyday life: Look for Kneser's theorem (combinatorics) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Kneser's theorem (combinatorics) in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Kneser's theorem (combinatorics) means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Kneser's theorem (combinatorics) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Kneser's theorem (combinatorics) in simple terms?

In the branch of mathematics known as additive combinatorics, Kneser's theorem can refer to one of several related theorems regarding the sizes of certain sumsets in abelian groups. These are named after Martin Kneser, who published them in 1953 and 1956.

Why does Kneser's theorem (combinatorics) matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Kneser's theorem (combinatorics)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Kneser's theorem (combinatorics).