Schnirelmann density

Schnirelmann density (Redirected from Mann's theorem) Jump to navigation Jump to search In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the first to study it.[1][2] Inhalt 1 Definition 2 Eigenschaften 2.1 Sensitivity 3 Schnirelmann's theorems 4 Additive bases 5 Mann's theorem 6 Waring's problem 7 Schnirelmann's constant 8 Essential components 9 References Definition The Schnirelmann density of a set of natural numbers A is defined as {displaystyle sigma A=inf _{n}{frac {EIN(n)}{n}},} wo ein(n) denotes the number of elements of A not exceeding n and inf is infimum.[3] The Schnirelmann density is well-defined even if the limit of A(n)/n as n → ∞ fails to exist (see upper and lower asymptotic density).

Properties By definition, 0 ≤ A(n) ≤ n and n σA ≤ A(n) for all n, und deshalb 0 ≤ σA ≤ 1, and σA = 1 if and only if A = N. Außerdem, {displaystyle sigma A=0Rightarrow forall epsilon >0 exists n A(n)0} then there exists {Anzeigestil k} so dass {Anzeigestil bigoplus _{i=1}^{k}A=mathbb {N} .} Additive bases A subset {displaystyle Asubseteq mathbb {N} } with the property that {displaystyle Aoplus Aoplus cdots oplus A=mathbb {N} } for a finite sum, is called an additive basis, and the least number of summands required is called the degree (sometimes order) of the basis. Daher, the last theorem states that any set with positive Schnirelmann density is an additive basis. In dieser Terminologie, the set of squares {Anzeigestil {mathfrak {G}}^{2}={k^{2}}_{k=1}^{unendlich }} is an additive basis of degree 4. (About an open problem for additive bases, see Erdős–Turán conjecture on additive bases.) Mann's theorem Historically the theorems above were pointers to the following result, at one time known as the {displaystyle alpha +beta } hypothesis. It was used by Edmund Landau and was finally proved by Henry Mann in 1942.

Satz. (Mann 1942) Lassen {Anzeigestil A} und {Anzeigestil B} be subsets of {Anzeigestil mathbb {N} } . In case that {displaystyle Aoplus Bneq mathbb {N} } , Wir haben noch {Display-Sigma (Aoplus B)geq sigma A+sigma B.} An analogue of this theorem for lower asymptotic density was obtained by Kneser.[4] At a later date, E. Artin and P. Scherk simplified the proof of Mann's theorem.[5] Waring's problem Main article: Waring's problem Let {Anzeigestil k} und {Anzeigestil N} be natural numbers. Lassen {Anzeigestil {mathfrak {G}}^{k}={i^{k}}_{i=1}^{unendlich }} . Definieren {Anzeigestil r_{N}^{k}(n)} to be the number of non-negative integral solutions to the equation {Anzeigestil x_{1}^{k}+x_{2}^{k}+cdots +x_{N}^{k}=n} und {Anzeigestil R_{N}^{k}(n)} to be the number of non-negative integral solutions to the inequality {displaystyle 0leq x_{1}^{k}+x_{2}^{k}+cdots +x_{N}^{k}leq n,} in the variables {Anzeigestil x_{ich}} , beziehungsweise. Daher {Anzeigestil R_{N}^{k}(n)= Summe _{ich=0}^{n}r_{N}^{k}(ich)} . Wir haben {Anzeigestil r_{N}^{k}(n)>0leftrightarrow nin N{mathfrak {G}}^{k},} {Anzeigestil R_{N}^{k}(n)geklinkt({frac {n}{N}}Rechts)^{frac {N}{k}}.} The volume of the {Anzeigestil N} -dimensional body defined by {displaystyle 0leq x_{1}^{k}+x_{2}^{k}+cdots +x_{N}^{k}leq n} , is bounded by the volume of the hypercube of size {Anzeigestil n^{1/k}} , somit {Anzeigestil R_{N}^{k}(n)= Summe _{ich=0}^{n}r_{N}^{k}(ich)leq n^{N/k}} . The hard part is to show that this bound still works on the average, d.h., Lemma. (Linnik) Für alle {Anzeigestil kin mathbb {N} } es existiert {Anzeigestil Nin mathbb {N} } and a constant {displaystyle c=c(k)} , depending only on {Anzeigestil k} , so dass für alle {Anzeigestil nin mathbb {N} } , {Anzeigestil r_{N}^{k}(m)0} .

We have thus established the general solution to Waring's Problem: Logische Folge. (Hilbert 1909) Für alle {Anzeigestil k} es existiert {Anzeigestil N} , depending only on {Anzeigestil k} , such that every positive integer {Anzeigestil n} can be expressed as the sum of at most {Anzeigestil N} many {Anzeigestil k} -th powers.

Schnirelmann's constant In 1930 Schnirelmann used these ideas in conjunction with the Brun sieve to prove Schnirelmann's theorem,[1][2] that any natural number greater than 1 can be written as the sum of not more than C prime numbers, where C is an effectively computable constant:[6] Schnirelmann obtained C < 800000.[7] Schnirelmann's constant is the lowest number C with this property.[6] Olivier Ramaré showed in (Ramaré 1995) that Schnirelmann's constant is at most 7,[6] improving the earlier upper bound of 19 obtained by Hans Riesel and R. C. Vaughan. Schnirelmann's constant is at least 3; Goldbach's conjecture implies that this is the constant's actual value.[6] In 2013, Harald Helfgott proved Goldbach's weak conjecture for all odd numbers. Therefore Schnirelmann's constant is at most 4. [8][9][10][11] Essential components Khintchin proved that the sequence of squares, though of zero Schnirelmann density, when added to a sequence of Schnirelmann density between 0 and 1, increases the density: {displaystyle sigma (A+{mathfrak {G}}^{2})>Sigma (EIN){Text{ zum }}0 1, and for every c > 1 there is an essential component which has at most (Protokoll x)c elements up to x.[15] Referenzen ^ Hochspringen zu: a b Schnirelmann, L.G. (1930). "On the additive properties of numbers", first published in "Proceedings of the Don Polytechnic Institute in Novocherkassk" (auf Russisch), vol XIV (1930), pp. 3-27, and reprinted in "Uspekhi Matematicheskikh Nauk" (auf Russisch), 1939, nein. 6, 9–25. ^ Nach oben springen: a b Schnirelmann, L.G. (1933). First published as "Über additive Eigenschaften von Zahlen" in "Mathematische Annalen" (auf Deutsch), vol 107 (1933), 649-690, and reprinted as "On the additive properties of numbers" in "Uspekhin. Matematicheskikh Nauk" (auf Russisch), 1940, nein. 7, 7–46. ^ Nathanson (1996) pp.191–192 ^ Nathanson (1990) p.397 ^ E. Artin and P. Scherk (1943) On the sums of two sets of integers, Ann. von Math 44, page=138-142. ^ Nach oben springen: a b c d Nathanson (1996) p.208 ^ Gelfond & Linnik (1966) p.136 ^ Helfgott, Harald A. (2013). "Major arcs for Goldbach's theorem". arXiv:1305.2897 [math.NT]. ^ Helfgott, Harald A. (2012). "Minor arcs for Goldbach's problem". arXiv:1205.5252 [math.NT]. ^ Helfgott, Harald A. (2013). "The ternary Goldbach conjecture is true". arXiv:1312.7748 [math.NT]. ^ Helfgoot, Harald A. (2015). "The ternary Goldbach problem". arXiv:1501.05438 [math.NT]. ^ Ruzsa (2009) p.177 ^ Ruzsa (2009) p.179 ^ Linnik, Yu. v. (1942). "On Erdõs's theorem on the addition of numerical sequences". Matte. Sb. 10: 67–78. Zbl 0063.03574. ^ Ruzsa (2009) p.184 Hilbert, David (1909). "Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl nter Potenzen (Waringsches Problem)". Mathematische Annalen. 67 (3): 281–300. doi:10.1007/BF01450405. ISSN 0025-5831. HERR 1511530. S2CID 179177986. Schnirelmann, L.G. (1930). "On additive properties of numbers". Ann. Inst. Polytechn. Novočerkassk (auf Russisch). 14: 3–28. JFM 56.0892.02. Schnirelmann, L.G. (1933). "Über additive Eigenschaften von Zahlen". Mathematik. Ann. (auf Deutsch). 107: 649–690. doi:10.1007/BF01448914. S2CID 123067485. Zbl 0006.10402. Mann, Henry B. (1942). "A proof of the fundamental theorem on the density of sums of sets of positive integers". Annalen der Mathematik. Zweite Serie. 43 (3): 523–527. doi:10.2307/1968807. ISSN 0003-486X. JSTOR 1968807. HERR 0006748. Zbl 0061.07406. Gelfond, A.O.; Linnik, Yu. v. (1966). L.J. Mordell (ed.). Elementary Methods in Analytic Number Theory. George Allen & Unwin. Mann, Henry B. (1976). Addition Theorems: The Addition Theorems of Group Theory and Number Theory (Corrected reprint of 1965 Wiley ed.). Huntington, New York: Robert E. Krieger Publishing Company. ISBN 978-0-88275-418-5. HERR 0424744. {{cite book}}: External link in |publisher= (help) Nathanson, Melvyn B. (1990). "Best possible results on the density of sumsets". In Berndt, Bruce C.; Diamond, Harold G.; Halberstam, Hi; et al. (Hrsg.). Analytische Zahlentheorie. Proceedings of a conference in honor of Paul T. Bateman, held on April 25-27, 1989, at the University of Illinois, Urbana, Il (Vereinigte Staaten von Amerika). Progress in Mathematics. Vol. 85. Boston: Birkhäuser. pp. 395–403. ISBN 978-0-8176-3481-0. Zbl 0722.11007. Ramaré, Ö. (1995). "On Šnirel'man's constant". Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV. 22 (4): 645–706. Zbl 0851.11057. Abgerufen 2011-03-28. Nathanson, Melvyn B. (1996). Additive Zahlentheorie: the Classical Bases. Abschlusstexte in Mathematik. Vol. 164. Springer-Verlag. ISBN 978-0-387-94656-6. Zbl 0859.11002. Nathanson, Melvyn B. (2000). Elementary Methods in Number Theory. Abschlusstexte in Mathematik. Vol. 195. Springer-Verlag. pp. 359–367. ISBN 978-0-387-98912-9. Zbl 0953.11002. Khinchin, EIN. Ya. (1998). Three Pearls of Number Theory. Mineola, NY: Dover. ISBN 978-0-486-40026-6. Has a proof of Mann's theorem and the Schnirelmann-density proof of Waring's conjecture. Artin, Emil; Scherk, P. (1943). "On the sums of two set of integers". Ann. von Math. 44: 138–142. Cojocaru, Alina Carmen; Murty, M. RAM (2005). An introduction to sieve methods and their applications. Studententexte der London Mathematical Society. Vol. 66. Cambridge University Press. pp. 100–105. ISBN 978-0-521-61275-3. Ruzsa, Imre Z. (2009). "Sumsets and structure". In Geroldinger, Alfred; Ruzsa, Imre Z. (Hrsg.). Combinatorial number theory and additive group theory. Advanced Courses in Mathematics CRM Barcelona. Elsholtz, C.; Freiman, G.; Hamidoune, Y. O.; Hegyvári, N.; Károlyi, G.; Nathanson, M.; Solymosi, J.; Stanchescu, Y. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse). Basel: Birkhäuser. pp. 87–210. ISBN 978-3-7643-8961-1. Zbl 1221.11026. Kategorien: Additive number theoryMathematical constants

Wenn Sie andere ähnliche Artikel wissen möchten Schnirelmann density Sie können die Kategorie besuchen Additive Zahlentheorie.

Hinterlasse eine Antwort

Deine Email-Adresse wird nicht veröffentlicht.

Geh hinauf

Wir verwenden eigene Cookies und Cookies von Drittanbietern, um die Benutzererfahrung zu verbessern Mehr Informationen