Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/iii/paper-125/4/b/solution

If is finitely generated, the structure theorem for finitely generated modules over a principal ideal domain immediately makes finite.
Conversely, first replace the given height by a quadratic one. Set
Condition (ii) makes this limit converge and gives
Thus still has finite bounded subsets. Condition (i) also gives a global lower bound for , so . Applying condition (iii) to , dividing by and passing to the limit gives one direction of the parallelogram identity. Applying the same inequality to and , and using , gives the reverse direction. Hence
and induction yields for every integer .
Now suppose is finite and choose representatives . Put . For any , write . Nonnegativity and the parallelogram identity give
so, since ,
Repeated division modulo therefore reaches the finite set . Reversing the recursion expresses every element of using and the finitely many . This is the height descent lemma, and proves

New to topics? Read the docs here!