Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Kneser's Theorem in $σ$-finite Abelian groups (1911.07745v2)

Published 18 Nov 2019 in math.NT and math.GR

Abstract: Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n){n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf{n\to\infty}\frac{|A\cap G_n|}{|G_n|}$ be its lower asymptotic density. We show that for any subsets $A$ and $B$ of $G$, whenever $\underline{\mathrm{d}}(A+B)<\underline{\mathrm{d}}(A)+\underline{\mathrm{d}}(B)$, the sumset $A+B$ must be periodic, that is, a union of translates of a subgroup $H\leq G$ of finite index. This is exactly analogous to Kneser's theorem regarding the density of infinite sets of integers. Further, we show similar statements for the upper asymptotic density in the case where $A=\pm B$. An analagous statement had already been proven by Griesmer in the very general context of countable abelian groups, but the present paper provides a much simpler argument specifically tailored for the setting of $\sigma$-finite abelian groups. This argument relies on an appeal to another theorem of Kneser, namely the one regarding finite sumsets in an abelian group.

Summary

We haven't generated a summary for this paper yet.