Rigorous Geometric Obstructions for Fourier Curves Generated by Prime Numbers

1. Problem Statement

The paper addresses the geometric behavior of a specific family of planar curves defined by finite Fourier series where the frequencies are prime numbers. These curves, denoted as $\Gamma_n$, are constructed using coefficients derived from the prime factorization of factorials ($n!$).

While previous numerical investigations (cited as [3, 4]) suggested that these curves exhibit complex, irregular behavior at multiple scales as $n \to \infty$, such observations lacked rigorous mathematical proof. The central problem is to determine whether this geometric irregularity can be justified analytically, independent of discretization or heuristic interpretation. Specifically, the author seeks to prove that the family of curves $\{\Gamma_n\}$ does not converge to a uniformly smooth geometric object and that specific geometric quantities (length, derivatives, diameter) diverge or grow unboundedly.

2. Methodology

The author employs a combination of harmonic analysis and elementary number theory to derive rigorous bounds.

• Mathematical Model:
  The curve is defined by the complex function:
  $$F_n(t) = \sum_{p \le n} v_p(n!) e^{ipt}, \quad t \in [-\pi, \pi]$$
  where $p$ ranges over prime numbers $\le n$, and $v_p(n!)$ is the exponent of $p$ in the prime factorization of $n!$, calculated via Legendre's formula:
  $$v_p(n!) = \sum_{k \ge 1} \left\lfloor \frac{n}{p^k} \right\rfloor$$
  The planar curve is $\Gamma_n(t) = (\text{Re } F_n(t), \text{Im } F_n(t))$.

• Analytic Tools:

  • Parseval's Identity: Used to relate the $L^2$ norms of the derivatives of $F_n$ to the sums of their Fourier coefficients.
  • Legendre's Formula Estimates: Used to bound the coefficients $v_p(n!)$.
  • Prime Number Theorem (PNT): Used to estimate the density of primes ($\pi(x)$) and the distribution of primes in intervals like $(n/3, n/2]$.
  • Mertens' Theorem: Used to estimate the sum of reciprocals of primes ($\sum_{p \le n} 1/p \approx \log \log n$).
  • Norm Inequalities: Specifically, the relationship between $L^1$, $L^2$, and $L^\infty$ norms to bound curve length and derivative magnitudes.
  • Geometric Covering Arguments: Using the diameter of the curve to establish lower bounds on the number of squares required to cover the set (covering numbers).

3. Key Contributions and Results

The paper establishes four main "obstructions" to uniform geometric regularity as $n \to \infty$:

A. Divergence of Derivatives ($L^2$ Norms)

The paper proves that the $L^2$ norms of both the first and second derivatives of $F_n$ diverge to infinity.

• Result: $\|F'_n\|_{L^2} \to \infty$ and $\|F''_n\|_{L^2} \to \infty$.
• Mechanism: By isolating primes in the interval $(n/3, n/2]$, the author shows that $v_p(n!) = 2$ for these primes. The sums $\sum p^2 v_p(n!)^2$ and $\sum p^4 v_p(n!)^2$ over this interval grow faster than $n^2$ and $n^4$ respectively, scaled by the prime density.
• Implication: The second derivative grows significantly faster than the first, indicating increasing oscillation and roughness.

B. Unbounded Curve Length

The length of the curve $\Gamma_n$ is not uniformly bounded; in fact, it grows linearly with $n$.

• Result: $L(\Gamma_n) \to \infty$ as $n \to \infty$. Specifically, $L(\Gamma_n) \gtrsim n$.
• Derivation: Using the inequality $\|f\|_{L^1} \ge \|f\|_{L^2}^2 / \|f\|_{L^\infty}$, the author combines the divergent $L^2$ norm of the derivative with an upper bound on the $L^\infty$ norm (derived from the triangle inequality and PNT). The numerator grows faster than the denominator, forcing the length to infinity.

C. Failure of Uniform $C^1$ and $C^{1,1}$ Bounds

The paper proves that no subsequence of the curves can possess uniformly bounded first or second derivatives.

• Result: $\|F'_n\|_{L^\infty} \to \infty$ and $\|F''_n\|_{L^\infty} \to \infty$.
• Significance: This rules out the possibility that the curves converge to a smooth ($C^1$ or $C^{1,1}$) limit curve. The geometric irregularity is intrinsic and persists regardless of how $n$ increases.

D. Diameter Growth and Covering Numbers

The paper establishes a lower bound on the diameter of the curve and, consequently, on the complexity of covering the curve with small squares.

• Result: The diameter of $\Gamma_n$ grows at least as $O(n \log \log n)$.
• Covering Number: The minimal number of squares of side $\epsilon$ needed to cover $\Gamma_n$, denoted $N_n(\epsilon)$, satisfies:
  $$N_n(\epsilon) \ge c \frac{n \log \log n}{\epsilon}$$
• Derivation: By evaluating the curve at $t=0$ and $t=\pi$, the author calculates the distance between these points. Using Mertens' theorem, the sum of coefficients for odd primes yields a growth rate of $n \log \log n$. This large diameter forces a high covering number.

4. Significance

• Rigorous Justification of Numerical Observations: The paper provides the first rigorous analytic proof explaining the "complicated behavior" observed in previous numerical experiments of prime-frequency Fourier curves. It confirms that the visual complexity is not an artifact of discretization but a fundamental property of the arithmetic structure.
• Arithmetic-Geometric Link: It demonstrates a direct, quantifiable link between the distribution of prime numbers (via the Prime Number Theorem and Mertens' Theorem) and the geometric regularity of planar curves.
• Obstruction to Fractal Limits: While the paper does not calculate a specific fractal dimension, it rigorously establishes that the curves cannot stabilize into smooth objects. The unbounded growth of length and derivatives suggests a transition toward fractal-like behavior, though the specific dimension remains an open question.
• Series Context: This work serves as the third part of a series, moving from the introduction of the model ([3]) and experimental study ([4]) to a definitive analytic explanation of the model's limitations.

In conclusion, Vartziotis proves that the Fourier curves generated by prime numbers are inherently "rough" as $n \to \infty$, characterized by diverging lengths, unbounded derivatives, and rapidly growing diameters, all driven by the asymptotic properties of prime numbers.