Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 103 / 5 / b / i / Solution

A single-box up-move from row $j$ to row $i<j$ changes the partial sum through row $h$ byEvery change is nonnegative, so $\lambda ⊴\mu$ in the dominance order on partitions. Transitivity gives the same conclusion along any chain of up-moves. Thus the existence of the indicated chain implies dominance. A chain of length zero handles equality; each positive-length move must still leave a partition of an integer.