Skip to content

Schnirelmann Density

Measure a set of positive integers by the least fraction it occupies in any initial segment, making early gaps permanently visible and enabling quantitative sumset and additive-basis theorems.

Version
v3 · 2026-09-06 · History
Domain-specific #
2716
Origin domain
mathematics
Subdomain
additive number theory
Aliases
Shnirelman density, Schnirelmann lower density, Sigma density

Core Idea

For a set \(A\subseteq\mathbb N\) of positive integers with counting function \(A(n)=|A\cap\{1,\ldots,n\}|\), the Schnirelmann density is

\[ \sigma(A)=\inf_{n\ge1}\frac{A(n)}{n}. \]

Unlike asymptotic density, it audits every initial segment. A single early omission can cap the value forever, and omitting 1 forces density zero. This sensitivity is precisely what allows density inequalities to yield exact additive-basis conclusions.[1]

Structural Signature

  • A subset of the positive integers.
  • An initial-segment counting function (A(n)).
  • Normalization by segment length (n).
  • Infimum across every positive (n).
  • A value in the unit interval.
  • Permanent sensitivity to finite initial gaps.
  • Sumset operation with zero adjoined by convention where stated.
  • Lower bounds on density growth under addition.
  • A bridge from positive density to finite additive basis.
  • Explicit distinction from limiting natural density.

What It Is Not

It is not upper or lower asymptotic density, because finite changes can radically alter it. It is not a countably additive measure on all subsets of integers and is not translation invariant. Equal long-run frequencies do not imply equal Schnirelmann density.

Scope of Application

The density was created for additive number theory, including Waring-type and Goldbach-type problems. Schnirelmann used it to prove that the primes form an additive basis of finite order after the appropriate conventions.[2] Mann's α+β theorem sharpened how density grows under sumsets.[3]

Clarity

State whether ℕ begins at 1, whether zero is adjoined in sumsets, and which density convention is used. Compute small prefixes before invoking asymptotic intuition. Separate a positive-density theorem from any claimed numerical order of an additive basis.

Manages Complexity

The worst-prefix rule converts a globally distributed set into one conservative scalar whose behavior under addition is strong enough to force coverage. It deliberately pays sensitivity to early exceptions for exact finite-addition conclusions.

Abstract Reasoning

  1. Define (A(n)) on every initial segment.
  2. Compute or bound (A(n)/n).
  3. Take the greatest lower bound over all (n).
  4. Identify early prefixes that determine or cap the value.
  5. Form sumsets using the declared zero convention.
  6. Apply Schnirelmann or Mann density inequalities.
  7. Iterate addition to drive density upward.
  8. Translate density one or the coverage theorem into additive-basis status.

Nathanson presents the method within the modern structural theory of sumsets and additive bases.[4]

Knowledge Transfer

The portable pattern is score a sequence by its worst prefix rather than its limiting average, buying uniform finite-prefix guarantees. It transfers to service-level and prefix-fairness metrics. The proposed immediate parent is Measure.

Examples

The positive even integers have Schnirelmann density zero because 1 is absent, despite asymptotic density one-half. Positive odd integers have density one-half: the worst initial occupancy reaches that value.

If \(\sigma(A)>0\), repeated sumsets of \(A\cup\{0\}\) eventually cover all positive integers, so (A) is an additive basis of finite order.

Structural Tensions

  • Worst-prefix guarantee versus asymptotic representativeness.
  • Finite-change sensitivity versus translation invariance.
  • Conservative scalar versus strong sumset conclusions.
  • Density growth versus exact coverage.
  • Historical notation versus modern conventions.

Structural–Framed Character

Worst-prefix normalization is structural. Natural numbers, counting functions, sumsets, additive bases, and number-theoretic coverage are constitutive. The identity is domain-specific.

Structural Core vs. Domain Accent

The structural core is prefix occupancy -> infimum -> conservative density -> repeated aggregation coverage. The domain accent is additive subsets of integers.

Measure is the proposed immediate parent. Infimum, Aggregation, Coverage, and Lower Bound are related primes. Normal Order and Natural Density are domain-specific neighbors.

The prospective queue contains one strict edge to prime:measure. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for Schnirelmann DensityParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Schnirelmann DensityDOMAINPrime abstraction: Measure — is a kind ofMeasurePRIME

Current abstraction Schnirelmann Density Domain-specific

Parents (1) — more general patterns this builds on

  • Schnirelmann Density is a kind of Measure Prime

    Measure is the proposed immediate parent.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Schnirelmann Density sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Additive Number Theory & Series Tests (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Natural density.
  • Lower asymptotic density.
  • Probability measure.
  • Banach density.
  • Schnirelmann's constant.
  • Density of a continuous distribution.

References

[1] Henry B. Mann, Addition Theorems: The Addition Theorems of Group Theory and Number Theory (Wiley, 1965). registry ↩

[2] L. G. Schnirelmann, “Über additive Eigenschaften von Zahlen,” Mathematische Annalen 107 (1933): 649–690, doi:10.1007/BF01448916. registry ↩

[3] Henry B. Mann, “A Proof of the Fundamental Theorem on the Density of Sums of Sets of Positive Integers,” Annals of Mathematics 43, no. 3 (1942): 523–527, doi:10.2307/1968803. registry ↩

[4] Melvyn B. Nathanson, Additive Number Theory: The Classical Bases (Springer, 1996), doi:10.1007/978-1-4757-3845-2. registry ↩