Theorem $(1+1.9)$ on the Goldbach Conjecture

This paper unconditionally proves that every sufficiently large even integer can be expressed as the sum of a prime and a product of a prime and a number $r$ (where $r$ is 1 or prime and $r \leq q^{0.9}$), thereby bridging a six-decade theoretical gap between Chen's theorem and the binary Goldbach Conjecture through the development of new weighted sieves and analytic tools.

The Gist

Imagine the world of numbers as a giant construction site. The most important building blocks here are prime numbers (numbers like 2, 3, 5, 7, 11 that can only be divided by 1 and themselves).

For over 200 years, mathematicians have been trying to solve a massive puzzle called the Goldbach Conjecture. The rule is simple: Can every even number bigger than 2 be built by adding exactly two prime numbers together?

• Example: $4 = 2 + 2$, $10 = 3 + 7$, $100 = 3 + 97$.
• The puzzle: We know this works for every number we've ever checked, but no one has ever proven it works for every number in the universe.

The "Almost" Solution (The Old Way)

For decades, the best anyone could do was a "near miss." In 1973, a mathematician named Chen proved that every large even number can be written as the sum of:

1. One prime number.
2. Plus a number that has at most two prime factors (like $6 = 2 \times 3$ or $15 = 3 \times 5$).

Think of this like trying to build a wall with perfect bricks (primes). Chen proved you could build the wall using one perfect brick and one "double-brick" (a brick made of two smaller bricks stuck together). He couldn't prove you could always use two perfect bricks.

The New Breakthrough (This Paper)

The authors of this paper, Jiamin Li and Jianya Liu, have built a new, more precise tool. They didn't just prove the "double-brick" case; they proved a much stronger version.

They showed that for every large even number, you can write it as:
Prime + (Prime $\times$ Prime)
...but with a very specific rule: The "double-brick" doesn't just have two factors; the two factors must be very close in size. Specifically, if the smaller factor is $r$ and the larger is $q$, then $r$ must be smaller than $q^{0.9}$.

The Analogy:
Imagine you are trying to build a tower.

• The Old Goal (Goldbach): Build the tower using exactly two perfect, solid bricks.
• Chen's Goal (1973): Build the tower using one perfect brick and one "composite" brick (which might be a bit wobbly).
• This Paper's Goal (1 + 1.9): Build the tower using one perfect brick and a composite brick, but prove that this composite brick is almost perfect. It's so close to being two perfect bricks that it barely counts as "composite" anymore.

They proved this works for a specific "closeness" level (1.9). If you imagine the "perfectness" scale going from 1 (perfect) to 2 (very composite), they bridged the gap from 2 down to 1.9.

How Did They Do It? (The Toolkit)

Mathematicians use a tool called a Sieve to find these numbers. Imagine a kitchen sieve used to separate flour from lumps.

• The Problem: The "lumps" (composite numbers) are very tricky. Sometimes the sieve lets a lump through that looks like a perfect brick, or misses a perfect brick.
• The Innovation: The authors invented a "Weighted Sieve."
  • Instead of just shaking the sieve, they added special weights to the flour.
  • They designed these weights so that when they shake the sieve, the "almost perfect" bricks (the ones with two factors) get filtered out much more efficiently than before.
  • They also used a "Switching Principle," which is like a magic trick where they swap the order of looking at the numbers to avoid getting stuck in a mathematical loop.

The Twin Prime Connection

There is a related puzzle called the Twin Prime Conjecture: Are there infinitely many pairs of primes that are only 2 apart (like 3 and 5, or 11 and 13)?

• Chen proved there are infinitely many primes $p$ where $p+2$ is a "double-brick."
• This paper proves there are infinitely many primes $p$ where $p+2$ is a "double-brick" that is very close to being two perfect bricks (specifically, the factors are close in size).

The "What If" Scenario

The paper also says: "If we assume a very famous, unproven guess called the Elliott–Halberstam Conjecture is true, we can do even better."

• Without the guess: They reached level 1.9.
• With the guess: They could reach level 1.4.
  This is like saying, "If the universe follows this specific rule we think is true, our sieve can filter out even more 'almost perfect' bricks."

Summary

This paper doesn't solve the Goldbach Conjecture completely (we still don't know if every even number is the sum of two primes). However, it closes a 60-year gap in our understanding. It proves that the "almost" solution is much closer to the "perfect" solution than we thought, using a brand-new, highly sophisticated mathematical sieve that weighs and balances the numbers in a way no one has done before.

In short: They didn't find the final key to the door, but they proved the door is unlocked just a tiny bit more than we knew, and they built a better keyhole to get us even closer.

Technical Summary

Technical Summary: Theorem (1 + 1.9) on the Goldbach Conjecture

Problem Statement
This paper addresses the binary Goldbach Conjecture and the Twin Prime Conjecture by refining the "Proposition (1 + a)" and "Proposition (1 − a)" frameworks.

• Proposition (1 + a): For $1 \le a \le 2$, it asserts that every sufficiently large even integer $N$ can be written as $N = p + rq$, where $p, q$ are primes, $r$ is either 1 or a prime, and $r \le q^{a-1}$.
  • $a=1$ corresponds to the binary Goldbach Conjecture ($N=p+q$).
  • $a=2$ corresponds to Chen's Theorem ($N=p+P_2$), which was the strongest unconditional result for decades.
• Proposition (1 − a): Analogously, it asserts there are infinitely many primes $p$ such that $p+2 = rq$ with the same constraints on $r$ and $q$.
  • $a=2$ corresponds to Chen's result on twin primes ($p+2=P_2$).

The authors aim to bridge the theoretical divide between Chen's results ($a=2$) and the conjectured optimal results ($a=1$) by proving these propositions for values of $a$ strictly between 1 and 2.

Methodology
The paper employs advanced sieve theory, specifically constructing new weighted sieves and utilizing new analytic tools to handle the combinatorial complexity introduced by the parameter $a < 2$.

1. Weighted Sieve Construction:

   • The authors develop intricate weighted inequalities (Propositions 4.1–4.6) involving multiple Buchstab iterations. Unlike Chen's original work, which relied heavily on the "switching principle" (a technique effective for upper bounds but insufficient for the specific lower bounds required here), the authors construct weights that allow for non-trivial lower bounds without relying solely on switching.
   • For $a > 1.5$ (Goldbach) and $a < 1.5$ (Goldbach), distinct weighted inequalities are derived (Propositions 4.2, 4.3, 4.4, 4.5) to accommodate the changing combinatorial structure of the problem.
   • The weights are designed to isolate terms where the "switching principle" fails to provide a lower bound, replacing them with terms that can be estimated effectively using linear sieve functions $F(s)$ and $f(s)$.

2. Analytic Tools and Distribution Levels:

   • Unconditional Results: The proofs rely on the Bombieri–Vinogradov theorem and its generalizations. Crucially, the authors utilize Lemma 3.5 (adapted from Wu [34]), which provides a level of distribution greater than $1/2$ for well-factorable coefficients. This lemma is identified as essential; without it, the constants required to prove Proposition (1 + 1.9) would not be met.
   • Conditional Results: Assuming the Elliott–Halberstam Conjecture, the authors introduce a weighted version, denoted WEH($\theta$). This conjecture allows for a distribution level $\theta$ approaching 1, significantly improving the error term estimates in the sieve.

3. Parameter Optimization:

   • The paper involves extensive numerical optimization of sieve parameters (e.g., $\alpha, \beta, \gamma, \tau$) to maximize the lower bound of the main term while minimizing the upper bounds of the error terms.
   • The authors note that the calculus of variations is not applicable here due to the discrete nature of the Buchstab identity and the differential-difference equations defining the sieve functions.

Key Contributions and Results

1. Unconditional Breakthrough (Goldbach):

   • Theorem 1.1: The authors prove unconditionally that Proposition (1 + 1.9) is true.
   • Specifically, for every sufficiently large even $N$, the number of solutions $D_{1,1.9}(N)$ satisfies:
     $$D_{1,1.9}(N) > 0.0004 \frac{C(N)N}{\log^2 N}$$
   • The exponent 1.9 can be improved to 1.894 using more intricate parameters, but 1.9 is the primary result presented.

2. Unconditional Breakthrough (Twin Primes):

   • Theorem 1.2: The authors prove unconditionally that Proposition (1 − 1.75) is true.
   • Specifically, the number of solutions $\pi_{1,1.75}(x)$ satisfies:
     $$\pi_{1,1.75}(x) > 0.042 \frac{Cx}{\log^2 x}$$

3. Conditional Improvements:

   • Theorem 1.3: Assuming the weighted Elliott–Halberstam conjecture WEH(0.999), the exponent in the Goldbach problem is improved to 1.4 (Proposition (1 + 1.4)).
   • Theorem 1.4: Under the same assumption, the exponent in the Twin Prime problem is improved to 1.4 (Proposition (1 − 1.4)).

Significance and Claims
The paper claims to establish a "connecting pathway" between the long-standing results of Chen (1 + 2) and the binary Goldbach Conjecture (1 + 1).

• Overcoming the Divide: For six decades, a substantial theoretical divide existed between the results for $a=2$ and $a=1$. This work demonstrates that by constructing new weighted sieves, one can achieve results for $a < 2$ that were previously inaccessible.
• Methodological Shift: The authors highlight that the "switching principle," which was decisive in Chen's proof of (1 + 2), is not necessary for these new results and, in some contexts, insufficient for deriving the required lower bounds. The new weighted inequalities allow for a more direct estimation of the solution counts.
• Sensitivity to Distribution Levels: The paper illustrates that the impact of improving the level of distribution (e.g., moving from Bombieri–Vinogradov to Elliott–Halberstam) is highly uneven across different terms in the sieve. The new weighted sieves are specifically designed to exploit these gains where they are most substantial.

The authors conclude that these results represent a breakthrough in the line of research connecting Chen's theorem to the full Goldbach and Twin Prime conjectures, achieved through the synergy of refined combinatorial weights and advanced analytic distribution estimates.