MY ATTEMPT
For even perfect numbers $2^{p-1}(2^p - 1)$, I get
$$D(2^p - 1)D(2^{p-1}) = (2(2^p - 1) - (2^p))(1) = 2^{p+1} - 2 - 2^p = 2^p - 2$$
$$2s(2^p - 1)s(2^{p-1}) = 2(2^p - (2^p - 1))(2^p - 1 - 2^{p-1}) = 2(1)(2^{p-1} - 1) = 2^p - 2.$$
Thus, the equation
$$D(2^p - 1)D(2^{p-1}) = 2s(2^p - 1)s(2^{p-1}) = 2^p - 2$$
is true.
Therefore, the required relationship
$$D(q^k)D(n^2) = 2s(q^k)s(n^2)$$
holds for both even and odd perfect numbers.
Here is my question:
Does this proof suffice?
Added October 02 2018
Note that it would appear as though we have the corresponding equation
$$D(q^k)D(n^2) = 2s(q^k)s(n^2) = q^k - 1$$
for odd perfect numbers. We show here that this assumption is false.
Assuming that $D(q^k)D(n^2) = 2s(q^k)s(n^2) = q^k - 1$, we get
$$\frac{2(q^k - 1)}{(q - 1)}s(n^2) = q^k - 1,$$
since $s(q^k) = \sigma(q^k) - q^k = \sigma(q^{k-1})$.
This simplifies to
$$s(n^2) = \frac{q-1}{2}$$
or
$$\frac{\sigma(n^2)}{n^2} - 1 = \frac{s(n^2)}{n^2} = \frac{q-1}{2n^2}.$$
Using the following results from this paper:
$$\frac{8}{5} < \frac{\sigma(n^2)}{n^2}$$
and
$$\frac{q}{n^2} \leq \frac{q^k}{n^2} < \frac{2}{3},$$
we get a contradiction, as follows:
$$\frac{3}{5} = \frac{8}{5} - 1 < \frac{\sigma(n^2)}{n^2} - 1 = \frac{s(n^2)}{n^2} = \frac{q-1}{2n^2} < \frac{q}{2n^2} \leq \frac{q^k}{2n^2} < \frac{1}{2}\cdot\frac{2}{3} = \frac{1}{3}.$$