This paper was authored by German mathematician Johann Peter Gustav Lejeune Dirichlet and published in 1837. The paper’s title says it all: it contains the first proof of the celebrated Dirichlet’s theorem on primes in arithmetic progression:

If and are relatively prime integers, then there are infinitely many primes in the arithmetic progression

or equivalently,

If and are relatively prime integers, then there are infinitely many primes which are (mod ).

This easy-to-state result has a deep proof (deep in the sense of Hardy, i.e., we have to appeal to real and complex analyses to understand the structure). It is probably the only staple of elementary number theory that does not have an entirely elementary proof.

173 years on, this result remains (in a certain sense) the best possible that we have in the field of prime-valued functions. Despite advances in other prime-related conjectures — the proofs of which remain out of reach in the present state of mathematics — it can be said that our complete understanding of prime numbers only goes so far as to their ‘linear’ structure. We do not even know for sure whether there are infinitely many primes in the form , let alone the far-reaching generalizations of it (cf. Schinzel’s Hypothesis H).

Reading through the original proof gives me a mixed feeling. For one, reading original masterworks, like reading a facsimile of a literary masterpiece, invokes a sense of romance. The feeling comes with an appreciation of the state of mathematics in the early 19th century, allowing us the full appreciation of the brilliance of the proof. Dirichlet did not have access to representation theory and algebraic characters, although he was among the first mathematicians to use the L-series in a truly significant way.

On the other hand, the mathematical anachronism in the paper is mildly amusing. Dirichlet took half a page to explain absolute convergence. Some proofs in the paper can be telescoped into a fraction of their length in a modern textbook.

This is the third proof of this theorem that I have read (my favorite is the one in Cohn’s miniature text Advanced Number Theory, which runs to 5 pages vs Dirichlet’s 22). Although the tools differ, the ideas used are quite similar, relying on properties of the L-series and an accurate estimation of error terms.

This entry was posted on Saturday, December 4th, 2010 at 7:52 pm and is filed under Math and Science. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Participate in the World's Largest Math Competition. Contest Day: 26 March 2015!

BEAVER INFORMATICS COMPETITION

To be held for the first time in Malaysia. Tentative: August 2015. Stay tuned!

Order My Books

Click on image for more details

My Amazon.com Wishlist

Books as gifts

SUHAIMI RAMLY

I am an entrepreneur and educator. I am based in Kuala Lumpur, Malaysia.

Many people know me as Bal. This is the nickname that I am stuck with since high school.

My day job is running two companies I founded in 2007: Aidan Corporation (an IT company) and ArdentEdu (an educational consulting company). Both companies are based in KL.

Since 2006, I have been training the Malaysian national team to the International Mathematical Olympiad (IMO). Also, I volunteer as an MIT Educational Counselor. I conduct interviews for MIT applicants from Malaysia.

I founded the Malaysian Informatics and Programming Society (MIPS) in 2011, to disseminate algorithmic thinking and programming education among high school students. MIPS run the Malaysian Computing Competition, which is open to all Malaysian school students, and the Malaysian Computing Olympiad, which is an invitation-only programming contest.

Since 2012, I am the Director of Kangaroo Math Competition (KMC) Malaysia. KMC is the largest math competition in the world, with more than 6 million participants annually.

To know more about me, click on the About page.

Welcome to my website. Don't forget to leave comments.