The sum-product phenomenon says that a finite subset of a field cannot usually have both a small sumset and a small product set unless it has additional subfield-like structure.
Write and suppose some nonzero has . The mixed-set Plünnecke-Ruzsa inequality gives and . The Ruzsa covering lemma covers by at most translates of . Covering two dilates proves the addition bound. First covering , then both copies of in , proves the multiplication bound. The Ruzsa triangle inequality also gives . These bounds transfer controlled additive expansion through a bounded-complexity expression in scalars.
For positive , suppose and . Repeatedly replace a scalar set by . Quadratic growth of a sixfold product difference set reaches size at least in a number of steps depending only on . The closure bounds for small skew-sumset scalars transfer a putative bound to all these scalars with exponent depending only on the number of steps. Averaging collisions over the resulting large scalar set then forces . This supplies a positive exponent depending only on . The finitely many smaller primes are covered by the strict inequality for every nonzero when .
For with , put using nonzero denominators. If is proper, some lies outside , since invariance under addition of one would give all of the prime field. The map on is injective. Clearing the denominator in a representation of puts a dilate of its image inside . If is the full field, averaging the collision count of gives some with . Clearing its denominator puts a dilate inside . Here is a product set, and the prefactors denote repeated sumsets, not scalar multiplication.
For finite with and ,In particular, addition and multiplication cannot both expand a nontrivial finite set of complex numbers only slightly.
Articles by others on the same topic
There are currently no matching articles.