For any orthonormal basis and Hermitian operator, . In the trace-norm variational principle for Hermitian operators, choose the diagonal whose entries are the signs of these diagonal entries. This bounds the total distinguishability visible in one fixed measurement basis.
The constraints are in the order of Hermitian operators. They imply . Using the spectral decomposition of ,
Choose , with eigenvalues on the positive spectral subspace, on the negative spectral subspace, and zero on the kernel. It satisfies the constraints and attains equality. The trace-norm variational principle for Hermitian operators is therefore
To prove the Holevo–Helstrom theorem, write a binary POVM as , where , and associate the first outcome with . Any larger outcome set followed by a binary decision can be grouped into this form. Put . Its success probability is
The substitution bijects the allowed effects with the interval . Since ,
Choosing as the positive spectral projection of attains this value, with an arbitrary decision on its kernel. This proves the optimal success probability and constructs an optimal measurement.
Write , which is real because is a Hermitian operator. Set
with . This Hermitian operator satisfies . The trace-norm variational principle for Hermitian operators gives the diagonal absolute-sum bound for the trace norm:
For , with , extend to an orthonormal basis . Put . The first diagonal entry is , and all the others are nonnegative. Their sum is , because . The bound therefore yields . Using the definitions of trace distance and quantum fidelity,
This pure-target lower bound on trace distance is attained whenever has no coherence between and its orthogonal complement. The proof used the trace-norm variational principle for Hermitian operators, together with positivity and normalization of a density operator.