Repdigit Number consisting of Instances of 9 is Kaprekar

Theorem
A repdigit number that consists entirely of the digit $9$ is a Kaprekar number.

Proof
We note as examples:

Now we consider:
 * $\displaystyle \paren {\sum_{k \mathop = 0}^n 9 \times 10^k}^2$