In additive combinatorics, the Ruzsa triangle inequality, also known as the Ruzsa difference triangle inequality to differentiate it from some of its variants, bounds the size of the difference of two sets in terms of the sizes of both their differences with a third set. It was proven by Imre Ruzsa (1996), and is so named for its resemblance to the triangle inequality. It is an important lemma in the proof of the Plünnecke-Ruzsa inequality.
Statement If A {\displaystyle A} and B {\displaystyle B} are subsets of a group, then the sumset notation A + B {\displaystyle A+B} is used to denote { a + b : a ∈ A , b ∈ B } {\displaystyle \{a+b:a\in A,b\in B\}} . Similarly, A − B {\displaystyle A-B} denotes { a − b : a ∈ A , b ∈ B } {\displaystyle \{a-b:a\in A,b\in B\}} . Then, the Ruzsa triangle inequality states the following.
An alternate formulation involves the notion of the Ruzsa distance. Definition. If A {\displaystyle A} and B {\displaystyle B} are finite subsets of a group, then the Ruzsa distance between these two sets, denoted d ( A , B ) {\displaystyle d(A,B)} , is defined to be
d ( A , B ) = log | A − B | | A | | B | . {\displaystyle d(A,B)=\log {\frac {|A-B|}{\sqrt {|A||B|}}}.}
Then, the Ruzsa triangle inequality has the following equivalent formulation:
This formulation resembles the triangle inequality for a metric space; however, the Ruzsa distance does not define a metric space since d ( A , A ) {\displaystyle d(A,A)} is not always zero.
Proof To prove the statement, it suffices to construct an injection from the set A × ( B − C ) {\displaystyle A\times (B-C)} to the set ( A − B ) × ( A − C ) {\displaystyle (A-B)\times (A-C)} . Define a function ϕ {\displaystyle \phi } as follows. For each x ∈ B − C {\displaystyle x\in B-C} choose a b ( x ) ∈ B {\displaystyle b(x)\in B} and a c ( x ) ∈ C {\displaystyle c(x)\in C} such that x = b ( x ) − c ( x ) {\displaystyle x=b(x)-c(x)} . By the definition of B − C {\displaystyle B-C} , this can always be done. Let ϕ : A × ( B − C ) → ( A − B ) × ( A − C ) {\displaystyle \phi :A\times (B-C)\rightarrow (A-B)\times (A-C)} be the function that sends ( a , x ) {\displaystyle (a,x)} to ( a − b ( x ) , a − c ( x ) ) {\displaystyle (a-b(x),a-c(x))} . For every point ϕ ( a , x ) = ( y , z ) {\displaystyle \phi (a,x)=(y,z)} in the set is ( A − B ) × ( A − C ) {\displaystyle (A-B)\times (A-C)} , it must be the case that x = z − y {\displaystyle x=z-y} and a = y + b ( x ) {\displaystyle a=y+b(x)} . Hence, ϕ {\displaystyle \phi } maps every point in A × ( B − C ) {\displaystyle A\times (B-C)} to a distinct point in ( A − B ) × ( A − C ) {\displaystyle (A-B)\times (A-C)} and is thus an injection. In particular, there must be at least as many points in ( A − B ) × ( A − C ) {\displaystyle (A-B)\times (A-C)} as in A × ( B − C ) {\displaystyle A\times (B-C)} . Therefore,
… excerpt ends here. Continue reading the full article.
