Exercise 2, § 3
Commutative Algebra, VI, 447
Bourbaki marks this one as harder than the rest.
Let be a totally ordered group and a field.
(a) Let be two subsets of well ordered by the induced ordering; show that the set is well ordered and that, for all , the set of ordered pairs such that is finite. (To prove the first assertion, argue by reductio ad absurdum by showing that otherwise it would be possible to define a strictly decreasing sequence of elements of such that , where , the sequence is strictly increasing and the sequence is strictly decreasing; conclude using Set Theory, Chapter 111, § 4, Exercise 3.)
(b) Let be the set of families such that for all and the set of for which is a well ordered subset of . Show that is an additive subgroup of ; moreover, if are two elements of , the set of for the ordered pairs such that and is well ordered by (a) and, for all , the element is defined in ; if we write for , the element belongs to ; it is denoted by . Show that with this law of composition and addition on the product group the set is a field; moreover, for all of , let be the least of the such that ; if we write (and ), show that is a valuation on with as residue field and as value group. is called the canonical valuation on the field . The field is canonically identified with a subfield of . For all , let denote the element such that for ; for all non-zero , there is then a unique ordered pair such that and . is called the dominant term of .
Solution
No solution has been written yet.