In the 18th century, Euler found a powerful connection between number theory, primarily the study of primes, and analysis, the study of Taylor series and infinite expansions. This link between two previously unrelated subjects created the basis for modern analytic number theory, and it appears in the title. At a first glance this is relating the Riemann Zeta function, , to an infinite product involving primes. This is a strong hint that this function is closely connected to prime numbers.
As it turns out, it really is! A relatively simple consequence is finding the infinite harmonic sum of prime numbers, or , which diverges thanks to Euler's product formula. A more significant implication is the prime number theorem, whose proof eventually relies on the zeta function having no zeroes on a certain strip. Finally, there's an exact formula relating the number of primes below a given number involving the zeroes of , suggested (but not proved!) by Riemann.
Where represents the prime counting function, is the Möbius function and are all non-trivial zeroes of . This creates a far more explicit connection between zeroes of and primes, though it is way more complicated and very hard to prove.
Returning back to our main topic, the examples above all start from a common point: the identity known as the Euler product formula.
To really understand what's going on, we should isolate the righthand side and set . Doing that won't change the results at all, it will just be easier to write everything out.
We can expand out each term by using the Taylor expansion to give us
This looks like a wildly complicated expression, but bear with me here. We know that every integer can be written as the unique product of its prime factors, , and likewise that every possible combination of prime factors leads to a unique integer. This fact is the fundamental theorem of arithmetic. How can we write every possible combination of prime factors in this case?
An easy way is to make the observation that essentially tries every possible combination of terms from both parentheses. This can be generalized to an arbitrary number of terms so that every term on the right side is a unique multiplicative combination of one term each. Since an integer is a unique multiplicative combination of primes and their powers, this suggests that we can "construct" all possible integers by using
Where every term on the righthand side can be written as a unique combination of one term from each parenthesized sum. For example, a number such as can be constructed by choosing from the first term, from the second term, from the third, and from all other terms. This holds for reciprocals as well, where any number can be expressed as a unique combination of terms from
Generalizing this to arbitrary powers leads us back to the product formula
Which we now know relies on the fundamental theorem of arithmetic. I'll say more about this at the end of the note.
We can also prove this equality starting from the lefthand side. This is how Euler originally proved this formula.
Dividing by a prime will "pick out" the terms with as a prime factor. Here's an example of what this leads to
It's generally not advised to add or subtract infinite sums, but we end up being justified doing so here. We can now use this to "remove" all multiples of a given prime from the series expansion of .
We can repeat this again for
This is essentially the Sieve of Eratosthenes. We can sieve up to a prime to get the right-hand side to the form
As as , we get the equality
Which returns us back to the Euler product formula. Believe it or not, this argument also requires the fundamental theorem of arithmetic, but in a less explicit way related to the Sieve of Eratosthenes. In some sense, given the ubiquity of this formula in number theory and the study of zeta functions, maybe it could be argued that this is "the" main consequence of the fundamental theorem of arithmetic. It has some competition.
If you're familiar with logic, you may be able to know that logical sentences can be encoded in an unambiguous way into the natural numbers. For example, take the sentence , . We can break it up into each symbol
And assign values to each symbol such as . Creating a number
Which, while very large, 'encodes' that particular sentence in logic into a number - known as its Gödel code - where it is now in the realm of arithmetic. This might not seem very useful, but thanks to the fundamental theorem of arithmetic we can go in the opposite direction to find what logical sentence any arbitrary number represents via its unique prime factorization. This eventually leads to defining arithmetic functions which can extract meta-information about a given logical sentence. With a far more careful coding scheme than the one I showed here, Gödel managed to fully encode logic into arithmetic. This had severe consequences though: he managed to define provability as an arithmetical function and, using a fixed-point lemma, found the existence of a sentence that is true if and only if it isn't provable in arithmetic. This was his first incompleteness theorem - the result that in any mathematical system in which the fundamental theorem of arithmetic holds, that system must have theorems which are unprovable within it.