Ranked Pairs minimizes the $p$-norm as $p \to \infty$

We prove that Ranked Pairs orders candidates in such a way as to minimize the $p$-norm, in the limit as $p \to \infty$, of those head-to-head margins of victory which go against its ordering.