Proof.
Fix some with . We prove by induction on that . Since by construction , by iterating , we find that for all
Therefore, the statement is true for , and even for when and .
Now let have rank . We assume by induction that the conclusion holds for any such that . Let be the leading term of . Recall that .
We claim that . Let be any monomial in the support of distinct from (if there is no such monomial, then the conclusion is obvious as ). Again , and moreover , since . We have one of or , hence by inductive hypothesis
Moreover, , again by inductive hypothesis. Therefore,
since is an increasing function and for .
Since , we have , or in other words, . Combining the inequalities together,
It follows at once that .
Granted the claim, by inductive hypothesis, . Recall moreover that , since . It follows that , hence , as desired.
∎