Pythagoras numbers of fields (Q4243744)

The main result of this paper is Theorem 1: Let \(n\geq 1\) be an integer. Let \(F_0\) be a formally real field. Then there exists a formally real field \(F\) over \(F_0\) with Pythagoras number \(p(F)=n\). This is surprising since the only integers \(n\) which where known before to occur as values \(n=p(F)\) of a field \(F\) were of the shape \(n=2^m\) or \(n=2^m+1\). The proof uses an ingenious induction on \(n\) and the fact that all quadratic forms \(q=\langle 1,\dots, 1\rangle\) are excellent. This allows the function field methods of Knebusch and Merkurjev to be adapted to sums of squares. Theorems 2 and 3 concern refinements of Theorem 1: For \(n\geq 2\) with \(2^k+1\leq n\leq 2^{k+1}\), there exists a uniquely ordered field \(F\) with \(p(F)=n\) such that in addition \(\widetilde{u}(F)= u(F)= 2m\), where \(m\) is any integer satisfying \(m\geq 2^k\), or \(m=\infty\). (\(u\) denotes the \(u\)-invariant, \(\widetilde{u}\) denotes the Hasse number).