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.

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. Mann's α+β theorem sharpened how density grows under sumsets.

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.

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.

Relationships to Other Abstractions

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

• Schnirelmann Density → Measure → Aggregation → Micro Macro Linkage

Show alternative path (1)

Neighborhood in Abstraction Space

Schnirelmann Density sits in a sparse region of the domain-specific corpus (85^th 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

• Sum-Free Sequence — 0.83
• Normal Order of an Arithmetic Function — 0.82
• Smooth Number — 0.81
• Pascal's rule — 0.80
• Normal Number — 0.79

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