Dyson's transform

Dyson's transform is a fundamental technique in additive number theory. It was developed by Freeman Dyson as part of his proof of Mann's theorem, is used to prove such fundamental results of additive number theory as the Cauchy-Davenport theorem, and was used by Olivier Ramaré in his work on the Goldbach conjecture that proved that every even integer is the sum of at most 6 primes. The term ''Dyson's transform'' for this technique is used by Ramaré. Halberstam and Roth call it the τ-transformation.

This formulation of the transform is from Ramaré. Let ''A'' be a sequence of natural numbers, and ''x'' be any real number. Write ''A''(''x'') for the number of elements of ''A'' which lie in , ''x'' Suppose $A= \$ and $B= \$ are two sequences of natural numbers. We write ''A'' + ''B'' for the sumset, that is, the set of all elements ''a'' + ''b'' where ''a'' is in ''A'' and ''b'' is in B; and similarly ''A'' − ''B'' for the set of differences ''a'' − ''b''. For any element ''e'' in ''A'', Dyson's transform consists in forming the sequences $A'= A \cup (B + \)$ and $\,B'= B \cap (A - \)$. The transformed sequences have the properties:

* $A' + B' \subset A + B$
* $\ + B' \subset A'$
* $0 \in B'$
* $A'(m)+ B'(m-e) = A(m) + B(m-e)$

Other closely related transforms are sometimes referred to as Dyson transforms. This includes the transform defined by $A_1 = A \cap (A + \)$, $A_2 = A \cup (A + \)$, $B_1 = B \cap (-\ + B)$, $B_2 = B \cup (-\ + B)$ for $A, B$ sets in a (not necessarily abelian) group. This transformation has the property that

* $A_1 + B_1 \subset A + B, A_2 + B_2 \subset A + B$
* $, A_1, + , A_2, = 2, A,$, $, B_1, + , B_2, = 2, B,$
It can be used to prove a generalisation of the Cauchy-Davenport theorem.

References

Sumsets
Freeman Dyson

{{numtheory-stub