A projection is ≤ 1.
Lemma 3.1 at p as a predicate: for every POVM (aᵢ) of the corner p M p and
every functional positive on M and normal, there are projections qᵢ ≤ p of M
commuting with aᵢ, with ∑ E(qᵢ) = p and φ(∑ aᵢ²) ≤ φ(∑ qᵢ aᵢ).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Lemma 3.1 on the type II₁ part #
Lemma 3.1 on the type II₁ part (paper, Section 3, "The latter case is easier"):
the extreme maximizer of exists_extreme_maximizer consists of projections, since a
non-projection coordinate admits the perturbation of exists_perturbation.
Lemma 3.1 at p from the split p = c + (p − c) #
Lemma 3.1 at p for a fixed functional φ from Lemma 3.1 on the type I part
c M c (hI) and on the type II₁ part (p − c) M (p − c) (hII), for a central
projection c of p M p: the two families of projections are added.
Lemma 3.1 at p (HasSelection) from Lemma 3.1 on the type I part (hI, the
shape of interface field H5) and on the type II₁ part (hII).
Theorem 1.2 at a finite projection from Lemma 3.1 #
Theorem 1.2 at p for a fixed functional: from the projections qᵢ of Lemma 3.1
for φ and the POVM (aᵢ), Lemma 3.2 in M_n(M) and the three-term estimate give the
PVM. The hypotheses hEp, hEtr, hcomp, hpolar are instances of the interface fields
(center_fixed, trace, equiv_of_eq_matrix of IsCenterValuedTrace, and H6 applied
to matrixAlgebra M n).
Theorem 1.2 at a finite projection p for the functionals normal on M, from
Lemma 3.1 at p (hsel).
The finite case under the interface #
Theorem 1.2 at a finite projection p, for the functionals normal on M and the
output set Fin n, under the structure-theory interface: H3 supplies the center-valued
trace of p M p, H1' the split p = c + (p − c) into the type I and type II₁ parts, H5
Lemma 3.1 on the type I part, exists_selection_typeII₁ (with H0) Lemma 3.1 on the type
II₁ part, and H6 (applied to M_n(M)) the polar decomposition of Lemma 3.2.