A note on the combinatorial derivation of non-small sets

Abstract

Given an infinite group $G$ and a subset $A$ of $G$ we let $Δ(A) = \{g \in G \,:\, |gA \cap A| =\infty\}$ (this is sometimes called the \emph{combinatorial derivation} of $A$). A subset $A$ of $G$ is called: \emph{large} if there exists a finite subset $F$ of $G$ such that $FA=G$; \emph{$Δ$-large} if $Δ(A)$ is large and \emph{small} if for every large subset $L$ of $G$, $(G \setminus A) \cap L$ is large. In this note we show that every non-small set is $Δ$-large, answering a question of Protasov.

3 pages