Topics in Number Theory, Essentially

My Favourite Math Joke

June 4, 2009 · 1 Comment

(I owe this one to Richard Pink.)

A famous number theorist dies and enters heaven. There he has the chance to talk to God, and he asks: “So, I’ve been trying to prove it for my whole life, but in vain… Is it true? Are all the zeroes of the Riemann zeta function on the critical line?”
And God answers: “Yes, the Riemann hypothesis is true!”
The number theorist is excited: “Great! I knew it! But tell me, how does one prove it?”
God chuckles and answers: “Prove it? I don’t know, I just see that all the zeroes ARE on the critical line…”

→ 1 CommentCategories: Uncategorized

A Proof for the Fundamental Theorem of Algebra using nothing but Real Analysis

May 6, 2009 · Leave a Comment

Inspired by Felix’ post I want to show you how to proof the fundamental theorem of algebra using only real analysis. Some steps are quite similar to Felix’ proof, but alas, we must not use the power of holomorphic functions. I’ve seen this proof more than four years ago in my undergraduate Analysis I course at ETH, taught by Dietmar Salamon.

Theorem: Every non-constant polynomial has a complex zero.

Proof: Without loss of generality, let p(z) = z^n + a_{n-1} z^{n-1}+ \cdots + a_0 be a normalized complex polynomial and define A := |a_0| + |a_1| + \cdots + |a_{n-1}| and R := \mathrm{max}\{1, 2A\} and set

r(z) := \frac{a_0}{z^n} +\frac{a_1}{z^{n-1}} + \ldots + \frac{a_{n-1}}{z},

such that p(z) = z^n (1+r(z)) holds. Then we get for |z| \leq R

|r(z)| \leq \frac{|a_0|}{|z|} +\frac{|a_1|}{|z|} + \ldots + \frac{|a_{n-1}|}{|z|} \leq \frac{A}{|z|} \leq \frac12

and hence

|p(z)| = |z|^n |1+r(z)| \geq R \cdot (1 - |r(z)|) \geq \frac{R}{2} \geq A.

This shows that, in general, zeroes of polynomials cannot be too large in terms of their coefficients. But what happens inside the circle? The set B_R := \{z \in \mathbb{C} : |z| \leq R\} is bounded and closed, hence compact by Heine-Borel. Polynomials are continuous, hence |p|  has a minimum at some point z_0 \in B_R. This minimum is even a global minimum, since |p(z_0)| \leq |p(0)| = |a_0| \leq A \leq |p(z)| for all z \notin B_R.

If p(z_0)=0 there is nothing to do. Hence assume that the global minimum is not zero. Then we can define the polynomial

q(w) := \frac{p(z_o + w)}{p(z_0)},

which has the property that it has a global minimum of 1 at w=z_0. Hence there exist a non-zero complex number b and a positive integer k such that

q(w) = 1 + bw^k + O(w^{k+1}).

Let \beta be any complex k-th root of -\frac1b. Then q(w) = 1 - \left( \frac{w}{\beta}\right)^k + O(w^{k+1}). Hence there exists a polynomal s such that

q(\beta w) = 1 - w^k + w^{k+1} s(w).

Since polynomials are continuous, s has to be bounded on B_1, say by c >0. Using this and restricting w to the unit interval we get

q(\beta w)\leq |1-w^k|+|w|^{k+1}|s(w)|\leq 1-w^k+w^{k+1}c=1-w^k(1-wc).

It is now not hard to see that one can choose w small enough to make w^k (1-wc) positive, in turn getting q(\beta w) < 1, in contradiction to the global mininmum of value 1, QED.

→ Leave a CommentCategories: Uncategorized

On the 4-rank of Class Groups of Quadratic Number Fields

March 11, 2009 · Leave a Comment

In their paper, Etienne Fouvry and Jürgen Klüners prove that the 4-rank of class groups of quadratic number fields behave as predicted by the Cohen-Lenstra heuristics und their extension by Gerth. My current task is it to understand the paper thoroughly. I’m doing quite well so far, and I want to describe the key steps in their proof in the easiest case.

Keep reading →

→ Leave a CommentCategories: Uncategorized

Summary on Mihailescu’s Proof of Catalan’s Conjecture

February 28, 2009 · Leave a Comment

I finally submitted my semester project on Catalan’s Conjecture. In this post, I want to give an idea of the concept behind the proof. Keep reading →

→ Leave a CommentCategories: Uncategorized

Announcement [Update!]: A Talk on “Catalan’s Conjecture: A Purely Algebraic Proof”

February 19, 2009 · Leave a Comment

Update: The talk starts at 14.00 sharp, not at 14.15 as announced previously.

Tomorrow at 14.15 14.00 in room HG G43 at ETH Zürich, I will present the results of my semester project on Catalan’s Conjecture that I wrote under the supervision of Prof. E. Kowalski. I know that this announcement comes on a very short notice, but unfortunately we could not get a confirmation earlier.

Catalan’s Conjecture states that the only consecutive powers of integers are 8 and 9. The question remained open for over 150 years and was answered positively only very recently. My talk will cover the main ideas of the complete proof, given by Mihailescu in 2004. Unlike the initial proof, given in 2002 by Mihailescu, that was still dependent on a computer calculation and the theory of linear forms in logarithms, this version of the proof only requires the arithmetic of cyclotomic number fields.

I expect that the non-expert will not be able to follow through every part of my talk. I will do my best to present the ideas behind the propositions and theorems. The final written version of my project should be on-line by the end of February and will contain proofs for nearly all statements.

→ Leave a CommentCategories: Uncategorized