Stufe (algebra)

From testwiki
Jump to navigation Jump to search

In field theory, a branch of mathematics, the Stufe (/ʃtuːfə/; German: level) s(F) of a field F is the least number of squares that sum to −1. If −1 cannot be written as a sum of squares, s(F) = . In this case, F is a formally real field. Albrecht Pfister proved that the Stufe, if finite, is always a power of 2, and that conversely every power of 2 occurs.[1]

Powers of 2

If s(F) then s(F)=2k for some natural number k.[1][2]

Proof: Let k be chosen such that 2ks(F)<2k+1. Let n=2k. Then there are s=s(F) elements e1,,esF{0} such that

0=1+e12++en12=:a+en2++es2=:b.

Both a and b are sums of n squares, and a0, since otherwise s(F)<2k, contrary to the assumption on k.

According to the theory of Pfister forms, the product ab is itself a sum of n squares, that is, ab=c12++cn2 for some ciF. But since a+b=0, we also have a2=ab, and hence

1=aba2=(c1a)2++(cna)2,

and thus s(F)=n=2k.

Positive characteristic

Any field F with positive characteristic has s(F)2.[3]

Proof: Let p=char(F). It suffices to prove the claim for 𝔽p.

If p=2 then 1=1=12, so s(F)=1.

If p>2 consider the set S={x2:x𝔽p} of squares. S{0} is a subgroup of index 2 in the cyclic group 𝔽p× with p1 elements. Thus S contains exactly p+12 elements, and so does 1S. Since 𝔽p only has p elements in total, S and 1S cannot be disjoint, that is, there are x,y𝔽p with Sx2=1y21S and thus 1=x2+y2.

Properties

The Stufe s(F) is related to the Pythagoras number p(F) by p(F) ≤ s(F) + 1.[4] If F is not formally real then s(F) ≤ p(F) ≤ s(F) + 1.[5][6] The additive order of the form (1), and hence the exponent of the Witt group of F is equal to 2s(F).[7][8]

Examples

Notes

Template:Reflist

References

Further reading

  1. 1.0 1.1 Rajwade (1993) p.13
  2. Lam (2005) p.379
  3. 3.0 3.1 Rajwade (1993) p.33
  4. Rajwade (1993) p.44
  5. Rajwade (1993) p.228
  6. Lam (2005) p.395
  7. 7.0 7.1 Milnor & Husemoller (1973) p.75
  8. 8.0 8.1 8.2 Lam (2005) p.380
  9. 9.0 9.1 Lam (2005) p.381
  10. Template:Cite journal