Knowledge

User:CRGreathouse/Large and small sets

Source đź“ť

449: 399: 353: 31: 254:. Even density is problematic since many interesting sequences are of zero density despite having different intuitive sizes. The usual combinatorial definition of a large set is one with a divergent reciprocal sum, with the corresponding definition of a small set as one with a convergent reciprocal sum. Thus the natural numbers are large (since the 40:. Please do not link to this page from the article namespace. When finished, the page may be incorporated into another article or used as the basis for a new article. While in this unfinished state, the text is dual-licensed under the GFDL and CC-BY-SA. If you would like me to release it to the public domain, please 322:
is a generalization that looks for the size of the powers in this measure. The cubes are thus smaller than the squares in this sense, since their degree is larger (9). An example of a small set in this sense is the powers of 2. (See also
259: 227:, subsets of the natural numbers are most commonly studied. This shows a limitation of cardinality as a measure of size, since the infinite subsets are always of cardinality 181: 252: 199:
to be chosen if a random natural number is selected. Because the density may not exist in general, the upper density is often used instead. Instead of the limit, the
273: 334:
is a sequence for which all sufficiently large numbers can be expressed as the sum of some subsequence. Essentially it is an additive basis of order ω.
498:
of the natural numbers has at least one part with arbitrarily-long arithmetic sequences with differences in the set. The natural numbers are large by
276:, if proved, would mean that all large sets have arbitrarily long arithmetic progressions. The special case where the large set is the primes is the 200: 315: 91: 255: 499: 389: 485: 218: 206: 153:
a probabilistic definition is useful. Consider the chance of choosing an element of the set out of the first
621: 114: 515: 439: 289: 41: 277: 192: 184: 611: 319: 87: 160: 495: 230: 63: 94:
restricts the number of different cardinalities, if used. Large sets are usually taken to mean
587: 331: 267: 17: 140: 118: 95: 531: 293: 146: 448: 398: 352: 117:(with respect to some universe, usually the natural numbers) is finite. Similarly, in 491: 343: 263: 224: 196: 150: 99: 511: 188: 183:. Large sets have positive density, while small sets have density zero. Thus the 122: 83: 51: 435: 128: 103: 79: 519: 67: 308:
is called its degree. Alternately, a set is an additive basis if a finite
209:
means that all large sets have arbitrarily long arithmetic progressions.
110: 90:
means that there are an infinite number of different cardinalities. The
324: 309: 550:
Neil Hindman and Dona Strauss, "Density in arbitrary semigroups",
54:
there are different formalizations of the intuitive concepts of
443: 393: 347: 25: 460: 410: 364: 62:. Different formalizations of small sets are generally 157:
natural numbers, then take the limit of this value as
233: 163: 618:
Series A, Vol. 113, No. 7 (Oct 2006), pp. 1219–1242.
300:such that every natural number is a sum of at most 612:Multiplicative structures in additively large sets 246: 175: 566:E. SzemerĂ©dy, "On sets of integers containing no 318:is that the squares are large with degree four. 622:Ergodic Theory and the Properties of Large Sets 187:numbers are large (with density 0.5) while the 586:S. A. Burr, P. Erdos, R. L. Graham and W. Li, 610:Beiglböck, Bergelson, Hindman, and Strauss. " 8: 588:Complete sequences of sets of integer powers 296:, that is, if there exists a finite number 274:ErdĹ‘s conjecture on arithmetic progressions 238: 232: 162: 258:diverges), the prime numbers are large ( 543: 312:of the set equals the natural numbers. 570:-elements in arithmetic progression", 304:elements from the set. The least such 262:) but the squares are small (see the 7: 82:, the natural definition of size is 270:, the set of twin primes is small. 70:, assuming finite sets are small). 518:may be considered large, as may a 235: 170: 149:as well as many other fields like 24: 131:are another type of 'small' set. 447: 397: 351: 125:sets could be considered large. 92:generalized continuum hypothesis 29: 616:Journal of Combinatorial Theory 494:, a set is large if any finite 30: 316:Lagrange's four-square theorem 167: 1: 292:, a set is large if it is an 191:are small (density 0 by the 176:{\displaystyle n\to \infty } 113:sets: a set is large if its 390:Small set (category theory) 247:{\displaystyle \aleph _{0}} 641: 483: 433: 387: 341: 216: 138: 500:Van der Waerden's theorem 486:Large set (Ramsey theory) 219:Small set (combinatorics) 195:). Sets of density 1 are 98:in this context, where 516:piecewise syndetic set 440:prevalent and shy sets 290:additive number theory 284:Additive number theory 248: 177: 109:Alternately, consider 249: 178: 597:(1996), pp. 133-138. 577:(1975), pp. 199–245. 557:(2006), pp. 273–300. 231: 193:prime number theorem 161: 50:In many branches of 207:SzemerĂ©di's theorem 38:preliminary version 459:. You can help by 409:. You can help by 363:. You can help by 244: 173: 605:Further expansion 477: 476: 427: 426: 381: 380: 332:complete sequence 278:Green–Tao theorem 48: 47: 18:User:CRGreathouse 632: 598: 592:Acta Arithmetica 584: 578: 572:Acta Arithmetica 564: 558: 548: 472: 469: 451: 444: 422: 419: 401: 394: 376: 373: 355: 348: 320:Waring's problem 253: 251: 250: 245: 243: 242: 182: 180: 179: 174: 96:uncountable sets 88:Cantor's theorem 33: 32: 26: 640: 639: 635: 634: 633: 631: 630: 629: 627: 607: 602: 601: 585: 581: 565: 561: 552:Semigroup Forum 549: 545: 540: 528: 508: 488: 482: 473: 467: 464: 457:needs expansion 442: 434:Main articles: 432: 423: 417: 414: 407:needs expansion 392: 386: 384:Category theory 377: 371: 368: 361:needs expansion 346: 340: 286: 256:harmonic series 234: 229: 228: 221: 215: 159: 158: 143: 141:Natural density 137: 76: 36:This page is a 22: 21: 20: 12: 11: 5: 638: 636: 625: 624: 619: 606: 603: 600: 599: 579: 559: 542: 541: 539: 536: 535: 534: 532:Large category 527: 524: 507: 504: 484:Main article: 481: 478: 475: 474: 454: 452: 431: 428: 425: 424: 404: 402: 388:Main article: 385: 382: 379: 378: 358: 356: 342:Main article: 339: 336: 294:additive basis 285: 282: 268:Brun's theorem 241: 237: 217:Main article: 214: 211: 172: 169: 166: 147:measure theory 139:Main article: 136: 135:Measure theory 133: 75: 72: 46: 45: 34: 23: 15: 14: 13: 10: 9: 6: 4: 3: 2: 637: 628: 623: 620: 617: 613: 609: 608: 604: 596: 593: 589: 583: 580: 576: 573: 569: 563: 560: 556: 553: 547: 544: 537: 533: 530: 529: 525: 523: 521: 517: 513: 505: 503: 501: 497: 493: 492:Ramsey theory 487: 480:Ramsey theory 479: 471: 462: 458: 455:This section 453: 450: 446: 445: 441: 437: 429: 421: 412: 408: 405:This section 403: 400: 396: 395: 391: 383: 375: 366: 362: 359:This section 357: 354: 350: 349: 345: 344:Slender group 337: 335: 333: 328: 326: 321: 317: 313: 311: 307: 303: 299: 295: 291: 283: 281: 279: 275: 271: 269: 265: 264:Basel problem 261: 257: 239: 226: 225:combinatorics 220: 213:Combinatorics 212: 210: 208: 204: 202: 198: 194: 190: 186: 164: 156: 152: 151:number theory 148: 142: 134: 132: 130: 126: 124: 120: 116: 112: 107: 105: 101: 97: 93: 89: 85: 81: 73: 71: 69: 65: 61: 57: 53: 43: 39: 35: 28: 27: 19: 626: 615: 594: 591: 582: 574: 571: 567: 562: 554: 551: 546: 509: 489: 465: 461:adding to it 456: 415: 411:adding to it 406: 369: 365:adding to it 360: 338:Group theory 329: 314: 305: 301: 297: 287: 272: 222: 205: 154: 144: 127: 108: 77: 59: 55: 49: 37: 197:almost sure 123:cocountable 119:uncountable 106:are small. 104:finite sets 84:cardinality 68:bornologies 52:mathematics 538:References 436:Meagre set 203:is taken. 129:Porous set 121:universes 115:complement 80:set theory 74:Set theory 64:set ideals 42:contact me 520:thick set 496:partition 372:July 2012 236:ℵ 171:∞ 168:→ 100:countable 526:See also 512:syndetic 468:May 2010 430:Topology 418:May 2010 111:cofinite 266:). By 201:lim sup 506:Others 325:IP set 310:sumset 189:primes 66:(even 260:proof 60:small 56:large 16:< 438:and 185:even 102:and 58:and 614:", 514:or 490:In 463:. 413:. 367:. 327:.) 288:In 223:In 145:In 86:. 78:In 595:77 590:, 575:27 555:73 522:. 510:A 502:. 330:A 280:. 568:k 470:) 466:( 420:) 416:( 374:) 370:( 306:d 302:d 298:d 240:0 165:n 155:n 44:.

Index

User:CRGreathouse
contact me
mathematics
set ideals
bornologies
set theory
cardinality
Cantor's theorem
generalized continuum hypothesis
uncountable sets
countable
finite sets
cofinite
complement
uncountable
cocountable
Porous set
Natural density
measure theory
number theory
even
primes
prime number theorem
almost sure
lim sup
Szemerédi's theorem
Small set (combinatorics)
combinatorics
harmonic series
proof

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑