# Additive Bases

## Representing Integers by Sums

A central question in additive number theory asks whether every integer can be represented as a sum of elements from a fixed set.

Let

$$
A\subseteq \mathbb N.
$$

We say that $A$ is an additive basis if sufficiently large integers can be written as sums of finitely many elements of $A$.

The subject studies how additive structure emerges from repeated summation of sets.

## Basis of Order $h$

A set $A$ is called an additive basis of order $h$ if every sufficiently large positive integer can be represented as

$$
n=a_1+a_2+\cdots+a_h,
\qquad
a_i\in A.
$$

Equivalently,

$$
hA =
A+\cdots+A
$$

contains all sufficiently large integers.

If every positive integer is representable, one sometimes says that $A$ is an exact basis of order $h$.

## Simple Examples

### All Positive Integers

The set

$$
\mathbb N
$$

is trivially a basis of order $1$.

### Even Numbers

The set

$$
2\mathbb N
$$

is not an additive basis because odd integers can never be represented.

### Squares

Lagrange's theorem states that the squares form a basis of order $4$:

$$
n=x_1^2+x_2^2+x_3^2+x_4^2.
$$

Thus the set

$$
\{0,1,4,9,16,\ldots\}
$$

is an additive basis of order $4$.

### Primes

The weak Goldbach theorem implies that primes form an asymptotic basis of order $3$:

every sufficiently large odd integer is a sum of three primes.

## Asymptotic Bases

A set $A$ is an asymptotic basis of order $h$ if all sufficiently large integers lie in

$$
hA.
$$

Small exceptions are allowed.

This asymptotic viewpoint is often more natural analytically because local irregularities among small integers become irrelevant.

## Representation Functions

Given a set $A$, define the representation function

$$
r_h(n) =
\#\{
(a_1,\ldots,a_h)\in A^h :
a_1+\cdots+a_h=n
\}.
$$

This counts the number of additive representations of $n$.

A basis property corresponds to

$$
r_h(n)>0
$$

for all sufficiently large $n$.

Studying the growth and fluctuation of $r_h(n)$ is a major topic in additive number theory.

## Density Heuristics

The density of a set strongly influences whether it can form a basis.

Suppose

$$
A(x)=\#\{a\in A : a\leq x\}.
$$

If

$$
A(x)\approx x^\alpha,
$$

then one heuristically expects

$$
hA
$$

to contain many integers once

$$
h\alpha>1.
$$

This is only a rough principle because congruence obstructions may still prevent representations.

## Local Obstructions

Congruence restrictions are often decisive.

For example, squares modulo $8$ satisfy

$$
x^2\equiv0,1,4\pmod8.
$$

Thus some residue classes require several squares to achieve full coverage.

A set cannot be an additive basis if it systematically misses certain congruence classes modulo some integer.

Understanding local obstructions is therefore fundamental.

## Schnirelmann Density

entity["people","Lev Schnirelmann","Russian mathematician"] introduced a density notion adapted to additive problems.

The Schnirelmann density of a set $A$ is

$$
\sigma(A) =
\inf_{n\geq1}
\frac{A(n)}{n}.
$$

A remarkable theorem states:

If

$$
\sigma(A)>0,
$$

then repeated sumsets of $A$ eventually cover all positive integers.

This result initiated modern additive combinatorics.

## Sumset Growth

Repeated addition enlarges sets:

$$
A,\quad
2A,\quad
3A,\quad
\ldots
$$

The rate of growth reveals additive structure.

Dense sets often become additive bases after relatively few summations. Sparse sets may require many summands or may never become bases.

This interplay between density and additive coverage is a central theme.

## Minimal Bases

An additive basis is minimal if removing any element destroys the basis property.

Minimal bases illustrate that additive coverage can depend delicately on individual elements.

The structure of minimal bases remains subtle and difficult.

## Thin Bases

A basis may still be extremely sparse.

For example, there exist bases of order $h$ satisfying roughly

$$
A(x)\approx x^{1/h}.
$$

Such sets are called thin bases.

Constructing sparse additive bases is an important problem connecting combinatorics and probabilistic methods.

## Probabilistic Constructions

Random sets often exhibit basis behavior.

Probabilistic techniques show that sparse random subsets may become asymptotic bases with high probability.

This probabilistic viewpoint has become increasingly important in additive combinatorics.

## Connections with the Circle Method

Many basis problems are studied analytically using the circle method.

Representation functions are expressed through Fourier integrals:

$$
r_h(n) =
\int_0^1
\widehat{1_A}(\alpha)^h
e(-\alpha n)\,d\alpha.
$$

Major arcs describe structured additive behavior, while minor arcs require cancellation estimates.

## Importance

Additive bases are one of the foundational concepts of additive number theory.

They connect:

- sumsets,
- density,
- congruence restrictions,
- Fourier analysis,
- probabilistic methods,
- additive combinatorics.

The subject studies how repeated addition transforms sparse arithmetic sets into structures capable of representing all integers.