Английская Википедия:Erdős–Szemerédi theorem

Шаблон:Short description In arithmetic combinatorics, the Erdős–Szemerédi theorem states that for every finite set <math>A</math> of integers, at least one of <math>A+A</math>, the set of pairwise sums or <math>A\cdot A</math>, the set of pairwise products form a significantly larger set. More precisely, the Erdős–Szemerédi theorem states that there exist positive constants c and <math>\varepsilon</math> such that for any non-empty set <math>A \subset \mathbb{N}</math>

<math>\max( |A+A|, |A \cdot A| ) \geq c |A|^{1+\varepsilon} </math>.

It was proved by Paul Erdős and Endre Szemerédi in 1983.^[1] The notation <math>|A|</math> denotes the cardinality of the set <math>A</math>.

The set of pairwise sums is <math>A+A = \{ a+b: a,b \in A \}</math> and is called sum set of <math>A</math>.

The set of pairwise products is <math>A \cdot A = \{ab: a,b \in A\}</math> and is called the product set of <math>A</math>.

The theorem is a version of the maxim that additive structure and multiplicative structure cannot coexist. It can also be viewed as an assertion that the real line does not contain any set resembling a finite subring or finite subfield; it is the first example of what is now known as the sum-product phenomenon, which is now known to hold in a wide variety of rings and fields, including finite fields.^[2]

Sum-Product Conjecture

The sum-product conjecture informally says that one of the sum set or the product set of any set must be nearly as large as possible. It was originally conjectured by Erdős and Szemerédi over the integers,^[1] but is thought to hold over the real numbers.

Conjecture: For any set <math>A\subset \mathbb{R}</math> one has <math>\max(|A+A|,|AA|) \geq |A|^{2-o(1)}.</math>

The asymptotic parameter in the o(1) notation is |A|.

Examples

If <math>A = \{1,2,3,\dots ,n \}</math> then <math>|A+A| = 2|A| - 1 = O(|A|)</math> using asymptotic notation, with<math>|A|</math> the asymptotic parameter. Informally, this says that the sum set of <math>A</math> does not grow. On the other hand, the product set of <math>A</math> satisfies a bound of the form <math>|A\cdot A| \geq |A|^{2-\epsilon}</math> for all <math>\epsilon > 0</math>. This is related to the Erdős multiplication table problem.^[3] The best lower bound on <math>|A\cdot A| </math> for this set is due to Kevin Ford.^[4]

This example is an instance of the Few Sums, Many Products^[5] version of the sum-product problem of György Elekes and Imre Z. Ruzsa. A consequence of their result is that any set with small additive doubling, for example an arithmetic progression has the lower bound on the product set <math>|AA| =\Omega(|A|^2 \log^{-1}(|A|))</math>. Xu and Zhou ^[6] proved that <math>|AA| =\Omega(|A|^2 \log^{1-2\log2 - o(1)}(|A|))</math> for any dense subset <math> A </math> of an arithmetic progression in integers, which is sharp up to the <math> o(1) </math> factor in the exponent.

Conversely, the set <math>B = \{2,4,8,\dots, 2^n\}</math> satisfies <math>|B\cdot B| = 2|B|-1</math>, but has many sums: <math>|B+B| = \binom{|B|+1}{2}</math>. This bound comes from considering the binary representation of a number. The set <math>B</math> is an example of a geometric progression.

For a random set of <math>n</math> numbers, both the product set and the sum set have cardinality <math>\binom{n+1}{2}</math>; that is, with high probability the sum set generates no repeated elements, and the same for the product set.

Sharpness of the conjecture

Erdős and Szemerédi give an example of a sufficiently smooth set of integers <math>A</math> with the bound:

<math>\max\{|A+A|,|A\cdot A|\} \leq |A|^{2} e^{-\frac{c \log|A|}{\log\log|A|} }</math>.^[1]

This shows that the o(1) term in the conjecture is necessary.

Extremal cases

Often studied are the extreme cases of the hypothesis:

few sums, many product (FSMP): if <math>|A+A| \ll |A|</math>, then <math>|AA| \ge |A|^{2-o(1)}</math>^[5]
few products, many sums (FPMS): if <math>|AA| \ll |A|</math>, then <math>|A+A| \ge |A|^{2-o(1)}</math>.^[7]

History and current results

The following table summarises progress on the sum-product problem over the reals. The exponents 1/4 of György Elekes and 1/3 of József Solymosi are considered milestone results within the citing literature. All improvements after 2009 are of the form <math>\frac13 + c</math>, and represent refinements of the arguments of Konyagin and Shkredov.^[8]

A+A|, |AA|) \geq |A|^{1 + \delta - o(1)}</math> for <math>A \subset \mathbb{R}</math>
Year	Exponent	Author(s)	Comments
1983	non-explicit <math>\delta >0 </math>	Erdős and Szemerédi ^[9]	Only for <math>A\subseteq \mathbb{Z}</math> and of the form <math>1+\delta</math> instead of <math>1+\delta - o(1)</math>.
1997	<math>\frac{1}{31} </math>	Nathanson^[10]	Only for <math>A\subseteq \mathbb{Z}</math> and of the form <math>1+\delta</math> instead of <math>1+\delta - o(1)</math>.
1998	<math>\frac1{15}</math>	Ford ^[11]	Only for <math>A\subseteq \mathbb{Z}</math> and of the form <math>1+\delta</math> instead of <math>1+\delta - o(1)</math>
1997	<math>\frac14</math>	Elekes ^[12]	Of the form <math>1+\delta - o(1)</math>. Valid also over <math>\mathbb{C}.</math>
2005	<math>\frac3{11}</math>	Solymosi^[13]	Valid also over <math>\mathbb{C}</math>
2009	<math>\frac13</math>	Solymosi ^[14]
2015	<math>\frac13 + \frac1{20598} = 0.333381\dots</math>	Konyagin and Shkredov ^[8]
2016	<math>\frac13 + \frac5{9813} = 0.333842\dots</math>	Konyagin and Shkredov ^[15]
2016	<math>\frac13 + \frac{1}{1509} = 0.333996\dots</math>	Rudnev, Shkredov and Stevens ^[16]
2019	<math>\frac13 + \frac5{5277} = 0.334280\dots</math>	Shakan ^[17]
2020	<math>\frac13 + \frac2{1167} = 0.335047\dots</math>	Rudnev and Stevens ^[18]	Current record

Complex numbers

Proof techniques involving only the Szemerédi–Trotter theorem extend automatically to the complex numbers, since the Szemerédi-Trotter theorem holds over <math>\mathbb{C}^2</math>by a theorem of Tóth.^[19] Konyagin and Rudnev^[20] matched the exponent of 4/3 over the complex numbers. The results with exponents of the form <math>\frac43 + c</math> have not been matched over the complex numbers.

Over finite fields

The sum-product problem is particularly well-studied over finite fields. Motivated by the finite field Kakeya conjecture, Wolff conjectured that for every subset <math>A\subseteq \mathbb{F}_p</math>, where <math>p</math> is a (large) prime, that <math>\max\{|A+A|,|AA|\} \geq \min\{p, |A|^{1+\epsilon}\}</math> for an absolute constant <math>\epsilon > 0</math>. This conjecture had also been formulated in the 1990s by Wigderson^[21] motivated by randomness extractors.

Note that the sum-product problem cannot hold in finite fields unconditionally due to the following example:

Example: Let <math>\mathbb{F}</math> be a finite field and take <math>A = \mathbb{F}</math> . Then since <math>\mathbb{F}</math> is closed under addition and multiplication, <math>A+A = A\cdot A = \mathbb{F}</math> and so <math>|A+A| = |A\cdot A| = |\mathbb{F}|</math>. This pathological example extends to taking <math>A</math> to be any sub-field of the field in question.

Qualitatively, the sum-product problem has been solved over finite fields:

Theorem (Bourgain, Katz, Tao (2004) ^[22]): Let <math>p</math> be prime and let <math>A\subset \mathbb{F}_p</math> with <math>p^\delta <|A|< p^{1-\delta}</math> for some <math>0 < \delta < 1</math>. Then one has <math>\max(|A+A|,|A\cdot A|) \geq c_\delta|A|^{1+\epsilon}</math> for some <math>\epsilon =\epsilon(\delta) >0</math>.

Bourgain, Katz and Tao extended this theorem to arbitrary fields. Informally, the following theorem says that if a sufficiently large set does not grow under either addition or multiplication, then it is mostly contained in a dilate of a sub-field.

Theorem (Bourgain, Katz, Tao (2004) ^[22]): Let <math>A</math> be a subset of a finite field <math>\mathbb{F}</math> so that <math>|A| > |\mathbb{F}|^\delta</math> for some <math>0 < \delta < 1</math> and suppose that <math>|A+A|,|A\cdot A|\leq K|A|</math>. Then there exists a sub-field <math>G\subset \mathbb{F}</math> with <math>|G|\leq K^{C_\delta} |A|</math>, <math>x\in \mathbb{F}\setminus\{0\}</math> and a set <math>X\subset \mathbb{F}</math> with <math>|X| \leq K^{C_\delta}</math>so that <math>A \subseteq xG \cup X</math>.

They suggest that the constant <math>C_\delta </math> may be independent of <math>\delta</math>.

Quantitative results towards the finite field sum-product problem in <math>\mathbb{F}</math> typically fall into two categories: when <math>A \subset \mathbb{F}</math> is small with respect to the characteristic of <math>\mathbb{F}</math> and when <math>A \subset \mathbb{F}</math> is large with respect to the characteristic of <math>\mathbb{F}</math>. This is because different types of techniques are used in each setting.

Small sets

In this regime, let <math>\mathbb{F}</math> be a field of characteristic <math>p</math>. Note that the field is not always finite. When this is the case, and the characteristic of <math>\mathbb{F}</math> is zero, then the <math>p</math>-constraint is omitted.

A+A|, |AA|) \geq |A|^{1 + \delta - o(1)}</math> for <math>A \subset \mathbb{F}</math>
Year	Exponent	A\|< p^c</math>	Author(s)	Comments
2004	unquantified	<math>c < 1</math>	Bourgain, Katz, Tao ^[22]	For finite <math>\mathbb{F}</math> only.
2007	<math>\frac1{14}</math>	<math>c = 7/13</math>	Garaev^[23]	A\|)</math>
2008	<math>\frac1{13}</math>	<math>c = 1/2</math>	Katz, Shen	For finite <math>\mathbb{F}</math> only.
2009	<math>\frac1{12}</math>	<math>c=12/23</math>	Bourgain, Garaev^[24]	For finite <math>\mathbb{F}</math> only. o(1) removed by Li.^[25]
2012	<math>\frac1{11}</math>	<math>c = 1/2</math>	Rudnev^[26]	For finite <math>\mathbb{F}</math> only.
2016	<math>\frac15</math>	<math>c = 5/8</math>	Roche-Newton, Rudnev, Shkredov^[27]
2016	<math>\frac19</math>	<math>c = 18/35</math>	Rudnev, Shkredov, Shakan	This result is the best of three contemporaneous results.
2021	<math>\frac14</math>	<math>c = 1/2</math>	Mohammadi, Stevens ^[28]	Current record. Extends to difference sets and ratio sets.

In fields with non-prime order, the <math>p</math>-constraint on <math>A \subset \mathbb{F}</math> can be replaced with the assumption that <math>A</math> does not have too large an intersection with any subfield. The best work in this direction is due to Li and Roche-Newton^[29] attaining an exponent of <math>\delta = \frac1{19}</math>in the notation of the above table.

Large sets

When <math>\mathbb{F} = \mathbb{F}_p</math> for <math>p</math> prime, the sum-product problem is considered resolved due to the following result of Garaev:^[30]

Theorem (Garaev (2007) ): Let <math>A \subset \mathbb{F}_p</math>. Then <math>\max\{|A+A|,|A\cdot A|\} \gg \min\{p^{1/2}|A|^{1/2}, |A|^2 p ^{-1/2}\} </math>.

This is optimal in the range <math>|A|\geq p^{2/3}</math>.

This result was extended to finite fields of non-prime order by Vinh^[31] in 2011.

Variants and generalisations

Other combinations of operators

Bourgain and Chang proved unconditional growth for sets <math>A\subseteq \mathbb{Z}</math>, as long as one considers enough sums or products:

Theorem (Bourgain, Chang (2003) ^[32]): Let <math>b \in \mathbb{N}</math>. Then there exists <math>k\in \mathbb{N}</math> so that for all <math>A\subseteq \mathbb{Z}</math>, one has <math>\max\{|kA|, |A^{(k)}|\} = \max\{|A+A+\dots A|, |A\cdot A \cdot \dots A|\} \geq |A|^b </math> .

In many works, addition and multiplication are combined in one expression. With the motto addition and multiplication cannot coexist, one expects that any non-trivial combination of addition and multiplication of a set should guarantee growth. Note that in finite settings, or in fields with non-trivial subfields, such a statement requires further constraints.

Sets of interest include (results for <math>A \subset \mathbb{R}</math>):

<math>AA+A</math> - Stevens and Warren^[33] show that <math>|AA+A|\gg |A|^{\frac32 + \frac{3}{170} - o(1)}</math>
<math>A(A+A)</math> - Murphy, Roche-Newton and Shkredov^[34] show that <math>|A(A+A)| \gg |A|^{\frac32 + \frac5{242} - o(1)}</math>
<math>A(A+1)</math> - Stevens and Warren^[33] show that <math>|A(A+1)| \gg |A|^{\frac{49}{38} - o(1)}</math>
<math>AA+AA</math> - Stevens and Rudnev^[18] show that <math>|AA+AA|\gg |A|^{\frac{127}{80} - o(1)}</math>

References

Шаблон:Reflist

External links

Шаблон:Cite journal

[:0-1] 1,0 ^1,1 ^1,2 Шаблон:Citation.

[2] Шаблон:Citation.

[3] Шаблон:Cite journal

[4] Шаблон:Citation

[:2-5] 5,0 ^5,1 Шаблон:Cite journal

[:6-6] Шаблон:Cite arXiv

[7] Шаблон:Cite journal

[:1-8] 8,0 ^8,1 Шаблон:Cite journal

[9] Шаблон:Citation

[10] Шаблон:Cite journal

[11] Шаблон:Cite journal

[12] Шаблон:Cite journal

[13] Шаблон:Cite journal

[14] Шаблон:Cite journal

[15] Шаблон:Cite journal

[16] Шаблон:Cite journal

[17] Шаблон:Cite journal

[:4-18] 18,0 ^18,1 Шаблон:Cite arXiv

[19] Шаблон:Cite journal

[20] Шаблон:Cite journal

[21] Шаблон:Cite journal

[:3-22] 22,0 ^22,1 ^22,2 Шаблон:Cite journal

[23] Шаблон:Cite journal

[24] Шаблон:Cite journal

[25] Шаблон:Cite journal

[26] Шаблон:Cite journal

[27] Шаблон:Cite journal

[28] Шаблон:Cite arXiv

[29] Шаблон:Cite journal

[30] Шаблон:Cite journal

[31] Шаблон:Cite journal

[32] Шаблон:Cite journal

[:5-33] 33,0 ^33,1 Шаблон:Cite arXiv

[34] Шаблон:Cite journal

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[33]

[34]

Партнерские ресурсы
Криптовалюты	Обмен криптовалют - www.bestchange.ru Криптовалютная биржа CoinEx Криптовалютная биржа Binance HIVE OS - операционная система для майнинга e4pool - Мультивалютный пул для майнинга.
Магазины	AliExpress — глобальная виртуальная (в Интернете) торговая площадка, предоставляющая возможность покупать товары производителей из КНР; computeruniverse.net - Интернет-магазин компьютеров(Промо код 5 Евро на первую покупку:FWWC3ZKQ);
Хостинг	DigitalOcean - американский провайдер облачных инфраструктур, с главным офисом в Нью-Йорке и с центрами обработки данных по всему миру;
Разное	Викиум - Онлайн-тренажер для мозга Like Центр - Центр поддержки и развития предпринимательства. Gamersbay - лучший магазин по бустингу для World of Warcraft. Ноотропы OmniMind N°1 - Усиливает мозговую активность. Повышает мотивацию. Улучшает память. Санкт-Петербургская школа телевидения - это федеральная сеть образовательных центров, которая имеет филиалы в 37 городах России. Lingualeo.com — интерактивный онлайн-сервис для изучения и практики английского языка в увлекательной игровой форме. Junyschool (Джунискул) – международная школа программирования и дизайна для детей и подростков от 5 до 17 лет, где ученики осваивают компьютерную грамотность, развивают алгоритмическое и креативное мышление, изучают основы программирования и компьютерной графики, создают собственные проекты: игры, сайты, программы, приложения, анимации, 3D-модели, монтируют видео. Умназия - Интерактивные онлайн-курсы и тренажеры для развития мышления детей 6-13 лет SkillBox - это один из лидеров российского рынка онлайн-образования. Среди партнеров Skillbox ведущий разработчик сервисного дизайна AIC, медиа-компания Yoola, первое и самое крупное русскоязычное аналитическое агентство Tagline, онлайн-школа дизайна и иллюстрации Bang! Bang! Education, оператор PR-рынка PACO, студия рисования Draw&Go, агентство performance-маркетинга Ingate, scrum-студия Sibirix, имидж-лаборатория Персона. «Нетология» — это университет по подготовке и дополнительному обучению специалистов в области интернет-маркетинга, управления проектами и продуктами, дизайна, Data Science и разработки. В рамках Нетологии студенты получают ценные теоретические знания от лучших экспертов Рунета, выполняют практические задания на отработку полученных навыков, общаются с экспертами и единомышленниками. Познакомиться со всеми продуктами подробнее можно на сайте https://netology.ru, линейка курсов и профессий постоянно обновляется. StudyBay Brazil – это онлайн биржа для португалоговорящих студентов и авторов! Студент получает уникальную работу любого уровня сложности и больше свободного времени, в то время как у автора появляется дополнительный заработок и бесценный опыт. Автор24 — самая большая в России площадка по написанию учебных работ: контрольные и курсовые работы, дипломы, рефераты, решение задач, отчеты по практике, а так же любой другой вид работы. Сервис сотрудничает с более 70 000 авторов. Более 1 000 000 работ уже выполнено. StudyBay – это онлайн биржа для англоязычных студентов и авторов! Студент получает уникальную работу любого уровня сложности и больше свободного времени, в то время как у автора появляется дополнительный заработок и бесценный опыт.

Английская Википедия:Erdős–Szemerédi theorem

Содержание