{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "erdos-littlewood-offord-sharp-real-concentration-1945",
    "title": "Erdős: sharp real sign-sum anti-concentration and Sperner extension",
    "summary": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain.",
    "boundary": "Signed sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.",
    "area": "Probability and extremal set theory",
    "topic": "Mathematics",
    "year": 1945,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "erdos-littlewood-offord-sharp-real-concentration-1945",
    "target": {
      "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
      "version": 1,
      "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
    },
    "humans": [
      "P. Erdős"
    ],
    "human_identities": [
      {
        "author_position": 0,
        "source_name": "P. Erdős",
        "person_id": "wrs-person-2877238e4d2ac172f8db6384",
        "display_name": "Paul Erdős",
        "status": "SOURCE_LINKED_IDENTITY",
        "sources": [
          {
            "title": "Attribution source",
            "url": "https://renyi.hu/en/node/4094"
          }
        ]
      }
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261020-erdos-littlewood-offord-1945",
        "title": "On a lemma of Littlewood and Offord (original1945)",
        "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf",
        "date": "1945-12"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "Printed University of Michigan author address on the original final page. No nationality or individual effort share inferred.",
      "source_url": "https://www.renyi.hu/~p_erdos/1945-04.pdf",
      "target": {
        "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
        "version": 1,
        "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-10-23",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "On a lemma of Littlewood and Offord (original1945)",
          "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "320000",
    "published_grade": {
      "id": "erdos-littlewood-offord-sharp-real-concentration-1945",
      "entry_id": "erdos-littlewood-offord-sharp-real-concentration-1945",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
        "version": 1,
        "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
      },
      "what_changed": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain.",
      "scope": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain. Signed sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
        "version": 1,
        "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-23T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "P. Erdős",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "On a lemma of Littlewood and Offord (original1945)",
            "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "On a lemma of Littlewood and Offord (original1945)",
            "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Signed sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.",
        "domain": "Probability and extremal set theory"
      },
      "sources": [
        {
          "citation": "On a lemma of Littlewood and Offord (original1945)",
          "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf"
        }
      ],
      "statement": "# Erdős: sharp real sign-sum anti-concentration and Sperner extension\n\n## How often can random signs cancel?\n\nTake several real numbers, each with magnitude at least one, and independently choose a plus or minus sign for each. Add the signed numbers. Sometimes many different choices give the same answer. Anti-concentration asks how large a fraction of all choices can land in a short interval. It is about limiting a pile-up of outcomes, rather than showing most outcomes stay near their average.\n\n## Count choices, not distinct answers\n\nErdős sharp real bound says that among the two-to-the-n sign choices, at most the central binomial coefficient can land inside any open interval of length two. A binomial coefficient counts ways to select a fixed number of objects. Repeated equal numerical sums are still separate sign choices. In probability language, divide the count by two-to-the-n. The lower bound on coefficient magnitudes and the open endpoints are essential parts of this statement.\n\n## Four ones make the bound visible\n\nFor a teaching example, use four coefficients all equal to one. There are sixteen sign choices. Six choices have two plus signs and two minus signs, producing zero. The open interval from minus one to one contains exactly those six outcomes, and the central binomial coefficient is six. Now try the closed interval from zero to two: it includes six zero outcomes and four outcomes equal to two, giving ten. Changing the endpoint convention would make the claimed bound false.\n\n## A probability problem becomes a set problem\n\nRepresent each sign choice by the set of positions carrying a plus sign. After making coefficients positive by relabelling signs, a set strictly containing another changes the signed sum by at least two. Two choices inside one open length-two interval therefore cannot have that containment relation. They form an antichain: a collection in which no member contains another. Sperner earlier antichain theorem supplies the central binomial bound. Erdős uses that inherited theorem rather than claiming to invent it.\n\n## Check a boundary rather than overclaim\n\nAsk your agent to enumerate the sixteen choices and label which intervals include each answer. Then change one coefficient and repeat, retaining the exact interval endpoints. A finite enumeration checks that example, not every number of coefficients. The original also gives longer-interval and complex-number bounds, but the complex constant is not the same sharp real constant. Its final vector and reverse-concentration proposals were conjectures in that paper; this entry does not declare their present-day status.\n\n## Scientific scope\n\nSigned sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.\n\n## Sources for this explanation\n\n- [On a lemma of Littlewood and Offord (original1945)](https://www.renyi.hu/~p_erdos/1945-04.pdf): Original1945 pp898–902; Theorem1 and Sperner argument p898, longer intervals and complex result p899, chain-family proof and historical conjectures pp900–902.\n",
      "summary": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain.",
      "title": "Erdős: sharp real sign-sum anti-concentration and Sperner extension"
    },
    "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
      "version": 1,
      "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:885e67dbf5ff7b57d23b37cb20f895dabb3f65f685eeea15634077daf51c0db9"
  },
  "target": {
    "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
    "version": 1,
    "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "erdos-littlewood-offord-sharp-real-concentration-1945",
    "entry_id": "erdos-littlewood-offord-sharp-real-concentration-1945",
    "revision": 1,
    "title": "Erdős: sharp real sign-sum anti-concentration and Sperner extension",
    "context": "Probability and extremal set theory",
    "track": "Exact theorem and reusable mathematical method",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-23",
    "evidence_cutoff": "2026-10-23",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain.",
    "scope": "For real coefficients |x_i|≥1, at most binomial(n,floor(n/2)) of the2^n signed sums fall inside any open interval of length2. Erdős obtains the sharp bound through Sperner's antichain theorem, removes a logarithmic loss for complex-coefficient disk concentration up to an absolute constant, and proves the associated bound by the r largest binomial coefficients for longer intervals and families without an(r+1)-element inclusion chain. Signed sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.",
    "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. Signed sums count sign choices, including repeated equal numerical values; in probabilistic form the signs are independent and equally likely. The real theorem uses the interior of a length2interval, not a closed interval including both endpoints; coefficients have the stated lower magnitude. The complex result is order-sharp with an unspecified absolute constant and integer radius, not the sharp real binomial constant. Hilbert/Banach-space sharp versions and the reverse small-ball assertion are labelled conjectures in this original, not proved here or asserted still open today. Later inverse theorems and arbitrary-sign distributions are not covered. Sperner1928, Littlewood–Offord1943 and Menger disjoint paths are inherited; no new award for those theorems. The original last-page vector and reverse-concentration assertions remain conjectures of that paper, not a claim about current open status.",
    "references": [
      {
        "title": "On a lemma of Littlewood and Offord (original1945)",
        "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      }
    ],
    "roles": [
      {
        "who": "The named authors in the research record",
        "credit": "SCIENCE",
        "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred."
      }
    ],
    "target": {
      "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
      "version": 1,
      "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "320000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": {
    "id": "erdos-littlewood-offord-sharp-real-concentration-1945",
    "target": {
      "record_id": "urn:uuid:99ce3eb2-ae49-4161-a285-8ceadb2d61f4",
      "version": 1,
      "content_hash": "sha256:a26a63525ec9230774813a61b58eb4e9ea7b2e9f43f5f039c5f10e51802e5d84"
    },
    "sections": [
      {
        "title": "How often can random signs cancel?",
        "text": "Take several real numbers, each with magnitude at least one, and independently choose a plus or minus sign for each. Add the signed numbers. Sometimes many different choices give the same answer. Anti-concentration asks how large a fraction of all choices can land in a short interval. It is about limiting a pile-up of outcomes, rather than showing most outcomes stay near their average."
      },
      {
        "title": "Count choices, not distinct answers",
        "text": "Erdős sharp real bound says that among the two-to-the-n sign choices, at most the central binomial coefficient can land inside any open interval of length two. A binomial coefficient counts ways to select a fixed number of objects. Repeated equal numerical sums are still separate sign choices. In probability language, divide the count by two-to-the-n. The lower bound on coefficient magnitudes and the open endpoints are essential parts of this statement."
      },
      {
        "title": "Four ones make the bound visible",
        "text": "For a teaching example, use four coefficients all equal to one. There are sixteen sign choices. Six choices have two plus signs and two minus signs, producing zero. The open interval from minus one to one contains exactly those six outcomes, and the central binomial coefficient is six. Now try the closed interval from zero to two: it includes six zero outcomes and four outcomes equal to two, giving ten. Changing the endpoint convention would make the claimed bound false."
      },
      {
        "title": "A probability problem becomes a set problem",
        "text": "Represent each sign choice by the set of positions carrying a plus sign. After making coefficients positive by relabelling signs, a set strictly containing another changes the signed sum by at least two. Two choices inside one open length-two interval therefore cannot have that containment relation. They form an antichain: a collection in which no member contains another. Sperner earlier antichain theorem supplies the central binomial bound. Erdős uses that inherited theorem rather than claiming to invent it."
      },
      {
        "title": "Check a boundary rather than overclaim",
        "text": "Ask your agent to enumerate the sixteen choices and label which intervals include each answer. Then change one coefficient and repeat, retaining the exact interval endpoints. A finite enumeration checks that example, not every number of coefficients. The original also gives longer-interval and complex-number bounds, but the complex constant is not the same sharp real constant. Its final vector and reverse-concentration proposals were conjectures in that paper; this entry does not declare their present-day status."
      }
    ],
    "references": [
      {
        "title": "On a lemma of Littlewood and Offord (original1945)",
        "url": "https://www.renyi.hu/~p_erdos/1945-04.pdf",
        "locator": "Original1945 pp898–902; Theorem1 and Sperner argument p898, longer intervals and complex result p899, chain-family proof and historical conjectures pp900–902."
      }
    ]
  },
  "reading_status": "EXPLANATORY_GUIDE"
}