Diophantine approximation with mixed powers of Piatetski-Shapiro primes

This paper proves that for any real $\eta$ and constants $\lambda_i$ satisfying necessary conditions, there exist infinitely many triples of Piatetski-Shapiro primes $p_i = [n_i^{1/\gamma}]$ satisfying a specific linear Diophantine inequality with mixed powers, provided the exponent $\gamma$ is sufficiently close to 1.

The Gist

The Great Prime Number Hunt: A Story of Finding Hidden Patterns

Imagine you are a detective trying to solve a very tricky puzzle. Your goal is to find three special numbers, let's call them $p_1$, $p_2$, and $p_3$, that are all prime numbers (numbers divisible only by 1 and themselves, like 2, 3, 5, 7, 11...).

But there's a catch: These aren't just any primes. They have to be "Piatetski-Shapiro primes." Think of these as primes wearing a disguise. They look like regular primes, but they were born from a specific mathematical recipe: take a whole number $n$, raise it to a weird power (like $1/0.99$), and round it down. If the result is a prime, it counts.

The Puzzle: The "Almost Zero" Equation

The detective (the author, S. I. Dimitrov) is trying to solve an equation that looks like this:

$$\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 (p_3)^2 + \text{some constant} \approx 0$$

Here, $\lambda$ represents some fixed weights (like different-sized coins), and $p_3$ is squared (multiplied by itself). The goal is to find three of our "disguised" primes such that when you mix them together with these weights, the result is extremely close to zero.

In math terms, we want the "error" (how far off from zero we are) to be tiny. The smaller the error, the better the solution.

The Challenge: Why is this hard?

Finding any three primes that work is hard. Finding three disguised primes that work is even harder. It's like trying to find three specific grains of sand on a beach, but the grains are constantly changing shape and hiding.

Previous mathematicians had solved similar puzzles, but they could only get the error down to a certain size. They were like archers hitting the bullseye, but missing by a few millimeters. The author wanted to see if they could get the arrow to land perfectly in the center, or at least much closer than before.

The Solution: The "Sieve" and the "Flashlight"

To solve this, the author uses a powerful mathematical tool called Diophantine Approximation. You can think of this as a giant sieve or a filter.

1. The Flashlight (The Integral): The author shines a mathematical "flashlight" over the entire number line. This flashlight is designed to only "light up" (give a high value) when the combination of primes ($\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^2$) is very close to the target (zero).
2. The Noise (The Error): The problem is that the flashlight also picks up a lot of "noise"—random combinations that don't work. The author has to prove that the "signal" (the good solutions) is much louder than the "noise."
3. The Magic Range: The author proves that if you choose the "disguise" power ($\gamma$) to be very close to 1 (specifically between 63/64 and 1), the noise becomes so quiet that the signal stands out clearly.

The Big Result

The paper proves that there are infinitely many solutions.

Imagine an infinite supply of these "disguised" primes. The author shows that no matter how far you go into the number line, you will always find new sets of three primes that fit the equation with incredible precision.

In simple terms:

• Old results: "We can find primes that get us within 1 inch of the target."
• This paper: "We can find primes that get us within a fraction of a millimeter of the target, and we can do this forever."

Why does this matter?

While this might sound like abstract math with no real-world use, it's actually about understanding the hidden order of the universe. Prime numbers are the building blocks of mathematics, but they often seem random. Proving that they follow specific, predictable patterns (even when disguised) helps mathematicians understand the deep structure of numbers. It's like discovering that while the stars seem scattered randomly, they actually form perfect, repeating constellations if you know where to look.

The Takeaway:
S. I. Dimitrov has successfully upgraded the "archer's aim." By using clever tricks with calculus and number theory, he proved that we can find these special prime triples with much greater accuracy than ever before, opening the door to solving even more complex mathematical mysteries.

Technical Summary

Here is a detailed technical summary of the paper "Diophantine approximation with mixed powers of Piatetski-Shapiro primes" by S. I. Dimitrov.

1. Problem Statement

The paper addresses a problem in analytic number theory concerning Diophantine inequalities involving prime numbers. Specifically, it investigates the solvability of the inequality:
$$|\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^2 + \eta| < \epsilon$$
where:

• $p_1, p_2, p_3$ are Piatetski-Shapiro primes of type $\gamma$. These are primes of the form $p = [n^{1/\gamma}]$, where $[\cdot]$ denotes the floor function and $n$ is an integer.
• $\lambda_1, \lambda_2, \lambda_3$ are non-zero real numbers, not all of the same sign, with $\lambda_1/\lambda_2$ being irrational.
• $\eta$ is a real number.
• The goal is to find infinitely many such triples $(p_1, p_2, p_3)$ satisfying the inequality for a specific error bound $\epsilon$ that depends on the size of the primes.

This work extends previous results on standard prime triples and mixed-power prime inequalities (specifically the work of Gambini, Languasco, and Zaccagnini) to the more restrictive set of Piatetski-Shapiro primes.

2. Methodology

The author employs the Hardy-Littlewood circle method, a standard technique in analytic number theory for solving additive problems involving primes. The core of the methodology involves the following steps:

A. Setup and Definitions

• Weighted Sum: The author defines a weighted sum $\Gamma(X)$ over triples of Piatetski-Shapiro primes $p_i = [n_i^{1/\gamma}]$ within a range $(\lambda_0 X, X]$. The weight involves the function $\theta(\cdot)$, which is a smooth approximation of the indicator function for the interval $(-\epsilon, \epsilon)$.
• Fourier Transform: Using the inverse Fourier transform, $\Gamma(X)$ is expressed as an integral involving exponential sums:
  $$\Gamma(X) = \int_{-\infty}^{\infty} \Theta(t) S_1(\lambda_1 t) S_1(\lambda_2 t) S_2(\lambda_3 t) e(\eta t) \, dt$$
  where $S_k(t)$ are exponential sums over Piatetski-Shapiro primes, and $\Theta(t)$ is the Fourier transform of the smoothing function $\theta$.

B. Decomposition of the Integral

The integral is decomposed into three parts based on the magnitude of the variable $t$:

1. Major Arc ($\Gamma_1$): $|t| < \Delta$. This region is expected to contain the main contribution to the sum.
2. Intermediate Arc ($\Gamma_2$): $\Delta \le |t| \le H$. This region requires careful estimation to show it is negligible compared to the main term.
3. Minor Arc ($\Gamma_3$): $|t| > H$. This region is shown to be very small using decay properties of the Fourier transform.

C. Key Analytical Tools

• Asymptotic Formulas: The author utilizes asymptotic formulas for exponential sums $S_k(t)$, approximating them by integrals $I_k(t)$ (related to the continuous distribution of the primes) plus error terms involving the fractional part function $\psi(t) = \{t\} - 1/2$.
• Voronoi Summation and Exponential Sums: Lemmas are used to bound the difference between the discrete sums over primes and their continuous integral approximations.
• Cauchy-Schwarz Inequality: Extensively used to bound integrals of products of exponential sums.
• Continued Fractions: The irrationality of $\lambda_1/\lambda_2$ is exploited via its continued fraction convergents to establish lower bounds for the exponential sums in the intermediate region.

3. Key Contributions and Results

The Main Theorem

The paper proves Theorem 1, which states that for any fixed $\gamma$ satisfying:
$$\frac{63}{64} < \gamma < 1$$
and any $\theta > 0$, there exist infinitely many ordered triples of Piatetski-Shapiro primes $p_1, p_2, p_3$ of type $\gamma$ such that:
$$|\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^2 + \eta| < (\max\{p_1, p_2, p_3^2\})^{\frac{63-64\gamma}{52} + \theta}$$

Technical Breakthroughs

1. Extension to Mixed Powers: The paper successfully adapts the circle method to handle the mixed power structure ($p_1, p_2, p_3^2$) specifically for Piatetski-Shapiro primes, a combination not previously solved for this specific range of $\gamma$.
2. Range of $\gamma$: The result holds for $\gamma > 63/64$. This is a significant improvement over previous attempts to solve similar inequalities with PS primes, pushing the boundary closer to 1 (where the density of such primes is higher).
3. Error Term Analysis: The author derives a precise error term exponent $\frac{63-64\gamma}{52}$. As $\gamma \to 1$, this exponent approaches $0$, indicating a very tight approximation.

4. Significance

• Advancement in Diophantine Approximation: This work bridges the gap between classical Diophantine inequalities (involving standard primes) and those involving "special" primes with specific distribution properties.
• Refinement of Piatetski-Shapiro Prime Theory: By solving a non-trivial additive problem (mixed powers) for PS primes with $\gamma > 63/64$, the paper demonstrates the robustness of these primes in additive number theory.
• Methodological Rigor: The paper provides a rigorous framework for handling the error terms arising from the fractional part function $\psi(t)$ in the context of exponential sums over PS primes, which is a known difficulty in this field.

5. Conclusion

S. I. Dimitrov's paper establishes the existence of infinitely many solutions to a specific Diophantine inequality involving mixed powers of Piatetski-Shapiro primes. By utilizing the circle method and refining estimates for exponential sums, the author proves that for $\gamma > 63/64$, the inequality holds with an error term that decays polynomially with the size of the primes. This result represents a significant step forward in understanding the additive properties of Piatetski-Shapiro primes.