The Argument for the Theorem
Lemma 1: During the execution of a sequence of UNION operations, a node of rank r must have at least 2r descendants, including itself.
Lemma 2: The number of nodes of rank r is no more than n/2r.
Lemma 3: During execution, the ranks of nodes on a path from a leaf to the root increase monotonically.