Arctanh Sums: Analytic Continuation and Prime-Restricted Theory

This paper investigates the analytic continuation and prime-restricted theory of arctanh sums h(k)h(k), establishing their meromorphic extension with specific poles and zeros, deriving Laurent expansions and Mittag-Leffler decompositions, and proving the unconditional transcendence of their prime-restricted analogues hp(2j)h_p(2j) via a π\pi-cancellation mechanism.

Ryan Goulden

Published Tue, 10 Ma
📖 5 min read🧠 Deep dive

Imagine you have a giant, infinite machine that takes a number, kk, and spits out a result by adding up an endless list of tiny calculations. This machine is called h(k)h(k).

In the world of advanced math, this machine is usually only allowed to work when kk is a "big" number (specifically, greater than 1). If you try to feed it a small number, the machine explodes because the sum goes to infinity.

This paper by Ryan Goulden is like a master mechanic who has figured out how to fix the machine so it can run on small numbers, and then discovered a secret "prime-only" version of the machine that reveals deep secrets about the universe of numbers.

Here is the breakdown of what the paper does, using simple analogies:

1. The "Broken" Machine and the Magic Fix (Analytic Continuation)

The Problem: The original machine, h(k)h(k), is defined by adding up terms like arctanh(1/nk)\text{arctanh}(1/n^k). For big kk, the terms get tiny fast, and the sum works. But for small kk (like k=0.5k=0.5), the terms are too big, and the sum explodes.

The Fix: The author uses a mathematical "time machine" (called Analytic Continuation). He finds a secret formula that looks different but gives the same result for big numbers. Because this new formula is smoother, it doesn't explode when kk gets small.

  • The Result: The machine now works for almost any positive number. However, it has "potholes" (called poles) at specific spots like k=1,1/3,1/5k=1, 1/3, 1/5, etc. If you drive the car right over these spots, the engine blows up. But between the potholes, the road is smooth.

2. The "Ghost" Zeros (Where the Machine Hits Zero)

Between every two potholes on the road, the machine's output goes from "infinity" to "negative infinity."

  • The Discovery: Because it goes from positive to negative, it must cross zero somewhere in between. The author proves that in every single gap between the potholes, the machine crosses zero exactly once.
  • The Analogy: Imagine a rollercoaster that goes up a cliff, drops down, and goes up another cliff. It crosses the ground level exactly once between the hills. These "zero crossings" are special points that tell us something about the famous Riemann Zeta function (a giant mathematical puzzle about prime numbers).

3. The "Prime-Only" Machine (The Multiplicative Theory)

The original machine sums over every number (2, 3, 4, 5, 6...).
The author builds a new, smaller machine called hp(k)h_p(k) that only sums over Prime Numbers (2, 3, 5, 7, 11...).

  • Why it matters: Primes are the building blocks of all numbers. By isolating them, the author creates a "pure" version of the math.
  • The Magic Trick: When you plug in even numbers (like 2, 4, 6) into this prime-only machine, something magical happens. The messy, irrational parts of the answer (involving π\pi) cancel each other out perfectly, leaving behind a clean, rational number inside a logarithm.
  • The Big Win: Because the answer is a clean rational number inside a log, the author can prove (using a famous theorem by Baker) that these answers are Transcendental.
    • Translation: These numbers are so weird and complex that they cannot be the solution to any simple algebraic equation. They are "mathematically unique" in a very strong sense.

4. The "Zero Sum" Connection (The Hadamard Product)

The most exciting part of the paper connects the prime-only machine to the non-trivial zeros of the Riemann Zeta function.

  • The Analogy: Think of the Riemann Zeta function as a giant orchestra. The "zeros" are the specific notes where the music stops (silence).
  • The Discovery: The author shows that the value of the prime-only machine (hph_p) can be calculated by adding up a specific contribution from every single one of those silent notes in the orchestra.
  • The Benefit: Usually, adding up these notes is messy and slow. But because of the way the author built the machine (subtracting a specific part), the messy parts cancel out. The sum converges very quickly, making it much easier to calculate and study these mysterious zeros.

5. The "Odd/Even" Split

The paper highlights a funny split in the math world:

  • Even Numbers: When you use even numbers in the prime-only machine, the math is clean, the π\pi's cancel out, and we can prove the results are transcendental.
  • Odd Numbers: When you use odd numbers, the π\pi's don't cancel. The math gets messy, and we don't know if the results are transcendental yet.
  • Why it's cool: This mirrors a famous mystery in math: we know exactly what ζ(2),ζ(4),ζ(6)\zeta(2), \zeta(4), \zeta(6) are (they involve π\pi), but we still don't fully understand ζ(3),ζ(5)\zeta(3), \zeta(5), etc. This paper shows that this "Even vs. Odd" mystery is built right into the structure of these sums.

Summary

Ryan Goulden took a broken math machine, fixed it so it works on small numbers, found exactly where it crosses zero, and then built a "Prime-Only" version that acts like a super-sensor. This sensor can detect the hidden "silent notes" (zeros) of the Riemann Zeta function and prove that certain combinations of prime numbers result in numbers so complex they are mathematically unique.

It's like taking a blurry photo of a complex pattern, sharpening the focus, and realizing that the pattern is actually a perfect map of the most famous unsolved puzzle in mathematics.