The combinatorial selection lemma #
Top-n selection. For every n ≤ card α there is a set of n indices on
which c dominates its values on the complement.
A weighted sum with weights in [0,1] summing to card S is dominated by the
plain sum over a set S on which c dominates its values off S.
The vertices of the hypersimplex. If w : α → [0,1] sums to a natural
number n, the weighted sum ∑ w x * c x is dominated by the sum of c over some
set of exactly n indices.
Sums of rank-one spectral projections #
x P k = λ_k P k.
P k x = λ_k P k.
A sum of distinct rank-one spectral projections is a projection.
A sum of rank-one spectral projections commutes with the second operator.
Each rank-one spectral projection has trace 1.
The trace of a sum of distinct rank-one spectral projections is their number.
x * x in the joint eigenbasis.
Lemma 3.1 in finite dimension #
Lemma 3.1 for B(H), H finite-dimensional. For a POVM (a i) and any
linear functional φ on B(H) there are projections q i commuting with a i,
of total trace dim H, with φ(∑ a i a i) ≤ φ(∑ q i a i) (real parts). The q i
are sums of rank-one spectral projections of a i, selected by
exists_finset_sum_ge.