Dyson's transform

From testwiki
Jump to navigation Jump to search

Template:Short description

Freeman Dyson in 2005

Dyson's transform is a fundamental technique in additive number theory.[1] It was developed by Freeman Dyson as part of his proof of Mann's theorem,[2]Template:Rp is used to prove such fundamental results of additive number theory as the Cauchy-Davenport theorem,[1] 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.[3]Template:Rp The term Dyson's transform for this technique is used by Ramaré.[3]Template:Rp Halberstam and Roth call it the τ-transformation.[2]Template:Rp

This formulation of the transform is from Ramaré.[3]Template:Rp 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 [1, x]. Suppose A={a1<a2<} and B={0=b1<b2<} 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(B+{e}) and B=B(A{e}). The transformed sequences have the properties:

  • A+BA+B
  • {e}+BA
  • 0B
  • A(m)+B(me)=A(m)+B(me)


Other closely related transforms are sometimes referred to as Dyson transforms. This includes the transform defined by A1=A(A+{e}), A2=A(A+{e}), B1=B({e}+B), B2=B({e}+B) for A,B sets in a (not necessarily abelian) group. This transformation has the property that

  • A1+B1A+B,A2+B2A+B
  • |A1|+|A2|=2|A|, |B1|+|B2|=2|B|

It can be used to prove a generalisation of the Cauchy-Davenport theorem.[4]

References

Template:Reflist


Template:Numtheory-stub