Extend the quantum conditional entropy from normalized states to positive operators by
Since , the two terms involving cancel under , so . Thus is positively homogeneous, and part (b) extends its concavity from states to the positive cone.
Apply part (c) with and . Differentiating the matrix logarithm under the trace gives
The inequality from part (c), after moving to the left, becomes
This is the data-processing inequality for quantum relative entropy under partial trace. Tensoring each output with the appropriate maximally mixed state does not change either side, so it also proves data processing under normalized partial traces. Singular follows by approximation on its support.
Apply the assumed data-processing inequality for quantum relative entropy to the normalized partial trace over , with the two input states
The channel sends them to and . Additivity over the common maximally mixed factor reduces data processing to
Expanding the Umegaki relative entropy in terms of Von Neumann entropy gives
After cancelling , this is precisely the Strong subadditivity of Von Neumann entropy
The Umegaki relative entropy is
when the support of is contained in that of , and otherwise. Its additivity of quantum relative entropy is
its superadditivity of quantum relative entropy is
and its data-processing inequality for quantum relative entropy is for every quantum channel .
Additivity follows from the logarithm of a tensor product,
and the analogous identity for . For superadditivity, subtract the two marginal relative entropies from the joint one. The reference-state terms cancel, leaving
This is the nonnegativity of quantum mutual information, equivalently Subadditivity of Von Neumann entropy.