[Math] Algorithm for the class field tower problem

algorithmsclass-field-theorynt.number-theory

This is a spur of the moment algebraic number theory question prompted by a side remark I made in a course I'm teaching:

Let $K$ be a number field. The (Hilbert) class field tower of $K$ is the sequence defined by $K^0 = K$ and for all $n \geq 0$, $K^{n+1}$ is the Hilbert class field of $K^n$. Put $K^{\infty} = \bigcup_n K^n$. We say that the class field tower is infinite if $[K^{\infty}:K] = \infty$ (equivalently $K^{n+1} \supsetneq K^n$ for all $n$). Golod and Shafarevich gave examples of number fields with infinite class field tower, and thus which admit everywhere unramified extensions of infinite degree. It is now known that a number field with "sufficiently many ramified primes" has infinite class field tower.

My question is this: is there a known algorithm which, upon being given a number field, decides whether the Hilbert class field tower of $K$ is infinite?

Best Answer

Not in the slightest! The answer is not even known for quadratic imaginary number fields. In fact, the only known way to show that the Hilbert class field tower of a number field is infinite is to invoke one of a variety of different forms of Golod-Shafarevich, and I don't think it's even seriously conjectured (more like "wondered") that every infinite Hilbert class field tower arises by applying Golod-Shafarevich to some step in the tower (or to some cleverly chosen subfield).

Incidentally, the "sufficiently many primes ramified" business is a bit of a red herring, in my opinion. The real condition is that the $p$-rank of the class group is large for some prime $p$. When $K$ is cyclic of degree $p$, it is only the fact that genus theory relates the $p$-rank of the class group to the number of ramified primes that brings ramified primes into the picture. (For example, the standard Golod-Sharevich examples come from showing the 2-class field tower is infinite by using Gauss' result that many primes ramifying in a quadratic extension imply a large 2-rank). For non-cyclic extensions, the link is more tenuous, and it becomes much more natural to talk strictly in terms of the class group.