Documentation

MIPRE.Background.QLD.Products

Ordered products with global outcome multipliers (lem:qld-global-products) #

The global measurement of lem:qld-global-pvm is consistent, on average over a uniform padded point u = (x, z, α, β, w), with the sandwich combination P_u(c) = ∑_{αa + βb = c} Z_b X_a Z_b of Bob's expanded point measurements. Stage 4b needs the same statement for the two ordered products ∑_{αa + βb = c} Z_b X_a and ∑_{αa + βb = c} X_a Z_b, in the state-distance form: with v_g = (G_g ⊗ 1) Φ, ∑_g E_u ‖v_g - (1 ⊗ B_u(g(u))) v_g‖² ≤ 2δ + 2κ, where δ is the consistency error and κ the average commutator weight E_{x,z} ∑_{a,b} ‖(1 ⊗ [X_a, Z_b]) Φ‖² of Bob's two measurements.

The argument #

Two steps. (1 ⊗ (1 - P)) v_g is controlled by the consistency itself, because 0 ≤ P ≤ 1 gives (1 - P)² ≤ 1 - P and so ∑_g E ‖(G_g ⊗ (1 - P_u(g(u)))) Φ‖² ≤ ∑_g E ⟨G_g ⊗ (1 - P_u(g(u)))⟩ ≤ δ. (1 ⊗ (P - B)) v_g is controlled by the commutators: grouping the outcomes by their value c = g(u) and dropping the projector ∑_{g(u) = c} G_g ≤ 1 leaves ∑_c ‖(1 ⊗ (P_u(c) - B_u(c))) Φ‖², a fibre-summed family of the deviations sand - ord; these sum to zero over (a, b), so Parseval over F_q (BipartiteModel.sum_avg_stateSqNorm_fibre_eq) turns the average over (α, β) of the fibre sums into (1 - 1/q) ∑_{a,b} ‖(1 ⊗ (sand - ord)(a, b)) Φ‖² with no loss of a factor q, and each deviation is a contraction of a commutator: Z X Z - Z X = Z [X, Z] and Z X Z - X Z = -(1 - Z) [X, Z].

Everything here is stated for abstract projective families X x, Z z of the second player, with the consistency and the commutator weight as hypotheses; lem:qld-global-pvm and lem:qld-combined-points supply them for the padded strategy.

Stated in a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The state is that of a bipartite model K (the model in which the low individual degree test is applied, padModel, or any other), the global measurement G is a projective POVM in the first player's algebra, and the two families X x, Z z are projective measurements in the second player's. A Kronecker product G_g ⊗ D is K.πA (G.op g) * K.πB D, its state norm is K.snorm, and the second player's squared norm ‖(1 ⊗ D) Φ‖² is K.swap.stateSqNorm D. The ordered products, the commutator and the combinations are defined in any ring. The step (1 - P)² ≤ 1 - P is taken on the represented operators, where the functional calculus lives (mul_self_le_self_of_le_one), and Parseval is the model's (BipartiteModel.sum_avg_stateSqNorm_fibre_eq in K.swap).

theorem MIPRE.IsPVMIn.le_one {R : Type u_1} {Λ : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] [Fintype Λ] {P : Λ → R} (h : IsPVMIn P) (a : Λ) :
P a ≤ 1

An element of a projective measurement is at most one, in a star-ordered ring.

theorem MIPRE.one_sub_proj_conjTranspose_mul_self_le_one {R : Type u_1} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {P : R} (hsa : star P = P) (hidem : P * P = P) :
star (1 - P) * (1 - P) ≤ 1

The complement of a projection is a contraction, in a star-ordered ring.

theorem MIPRE.snorm_sq_add_le {𝒞 : Type u_1} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) (T T' : 𝒞) :
M.snorm (T + T') ^ 2 ≤ 2 * M.snorm T ^ 2 + 2 * M.snorm T' ^ 2

‖T + T'‖² ≤ 2 ‖T‖² + 2 ‖T'‖² in the state norm of a state model.

theorem MIPRE.mul_self_le_self_of_le_one {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : 0 ≤ S) {Q : ℬ} (h0 : 0 ≤ Q) (h1 : Q ≤ 1) :
M.bornProb S (Q * Q) ≤ M.bornProb S Q

Q² ≤ Q for 0 ≤ Q ≤ 1, read through a Born probability: against a nonnegative element of the first player, ⟨S ⊗ Q²⟩ ≤ ⟨S ⊗ Q⟩. The inequality Q² ≤ Q is taken on the represented operator (Op.mul_self_le_self), where the functional calculus lives; the second player's algebra need not have one.

theorem MIPRE.bornProb_mono_left {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {X X' : 𝒜} (h : X ≤ X') {Y : ℬ} (hY : 0 ≤ Y) :
M.bornProb X Y ≤ M.bornProb X' Y

The Born probability is monotone in the first player's operator when the second player's is nonnegative.

theorem MIPRE.bornProb_one_eq_normSq_stateVecB {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (D : ℬ) :

⟨ψ| 1 ⊗ D⋆ D |ψ⟩ = ‖(1 ⊗ D) ψ‖²: the second player's squared state norm.

theorem MIPRE.sum_snorm_sq_aOp_mul_bOp_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {Λ : Type u_4} {C : Type u_5} [Fintype Λ] [Fintype C] [DecidableEq C] {G : Λ → 𝒜} (hG : IsPVMIn G) (f : Λ → C) (D : C → ℬ) :
∑ g : Λ, M.snorm (M.πA (G g) * M.πB (D (f g))) ^ 2 ≤ ∑ c : C, M.swap.stateSqNorm (D c)

The deviation of a projective outcome family from a family of the second player, grouped by a value map: the first player's projection ∑_{f g = c} G_g ≤ 1 is dropped.

The two ordered products and the commutator #

def MIPRE.QLD.ordZX {F : Type u_1} {R : Type u_2} [Mul R] (X Z : F → R) (p : F × F) :
R

The ordered product, X then Z (applied right to left: Z_b X_a).

Equations
Instances For
    def MIPRE.QLD.ordXZ {F : Type u_1} {R : Type u_2} [Mul R] (X Z : F → R) (p : F × F) :
    R

    The ordered product, Z then X: X_a Z_b.

    Equations
    Instances For
      def MIPRE.QLD.comm {F : Type u_1} {R : Type u_2} [Ring R] (X Z : F → R) (p : F × F) :
      R

      The commutator X_a Z_b - Z_b X_a.

      Equations
      Instances For
        theorem MIPRE.QLD.sum_ordZX {F : Type u_1} {R : Type u_2} [Fintype F] [Ring R] [StarRing R] {X Z : F → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) :
        ∑ p : F × F, ordZX X Z p = 1
        theorem MIPRE.QLD.sum_ordXZ {F : Type u_1} {R : Type u_2} [Fintype F] [Ring R] [StarRing R] {X Z : F → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) :
        ∑ p : F × F, ordXZ X Z p = 1
        theorem MIPRE.QLD.sand_sub_ordZX {F : Type u_1} {R : Type u_2} [Fintype F] [Ring R] [StarRing R] {X Z : F → R} (hZ : IsPVMIn Z) (p : F × F) :
        sand X Z p - ordZX X Z p = Z p.2 * comm X Z p

        Z X Z - Z X = Z [X, Z].

        theorem MIPRE.QLD.sand_sub_ordXZ {F : Type u_1} {R : Type u_2} [Fintype F] [Ring R] [StarRing R] {X Z : F → R} (hZ : IsPVMIn Z) (p : F × F) :
        sand X Z p - ordXZ X Z p = -((1 - Z p.2) * comm X Z p)

        Z X Z - X Z = -(1 - Z) [X, Z].

        theorem MIPRE.QLD.norm_stateVecB_sand_sub_ordZX_le {F : Type u_1} [Fintype F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X Z : F → ℬ} (hZ : IsPVMIn Z) (K : BipartiteModel 𝒞 𝒜 ℬ) (p : F × F) :
        K.swap.stateNorm (sand X Z p - ordZX X Z p) ≤ K.swap.stateNorm (comm X Z p)

        The deviation of the sandwich from the order Z_b X_a is at most the commutator, in the second player's state norm.

        theorem MIPRE.QLD.norm_stateVecB_sand_sub_ordXZ_le {F : Type u_1} [Fintype F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X Z : F → ℬ} [PartialOrder ℬ] [StarOrderedRing ℬ] (hZ : IsPVMIn Z) (K : BipartiteModel 𝒞 𝒜 ℬ) (p : F × F) :
        K.swap.stateNorm (sand X Z p - ordXZ X Z p) ≤ K.swap.stateNorm (comm X Z p)

        The deviation of the sandwich from the order X_a Z_b is at most the commutator, in the second player's state norm.

        The averaged fibre bound #

        theorem MIPRE.QLD.sum_avg_fibre_sand_sub_ord_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X Z : F → ℬ} (hX : IsPVMIn X) (hZ : IsPVMIn Z) (K : BipartiteModel 𝒞 𝒜 ℬ) {ord : (F → ℬ) → (F → ℬ) → F × F → ℬ} (hord1 : ∑ p : F × F, ord X Z p = 1) (hordle : ∀ (p : F × F), K.swap.stateNorm (sand X Z p - ord X Z p) ≤ K.swap.stateNorm (comm X Z p)) :
        ∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * ∑ c : F, K.swap.stateSqNorm (ptComb (fun (p : F × F) => sand X Z p - ord X Z p) ab.1 ab.2 c) ≤ ∑ p : F × F, K.swap.stateSqNorm (comm X Z p)

        The fibre sums of sand - ord are controlled by the commutators, on average over the combining coefficients and without a factor q, for either order.

        The uniform padded point as its blocks and combining coefficients #

        def MIPRE.QLD.setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
        LIDT.Point F (4 * m)

        Setting the two combining coordinates of a padded point.

        Equations
        Instances For
          theorem MIPRE.QLD.xBlk_setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
          xBlk (setAB u α β) = xBlk u
          theorem MIPRE.QLD.zBlk_setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
          zBlk (setAB u α β) = zBlk u
          theorem MIPRE.QLD.alph_setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
          alph (setAB u α β) = α
          theorem MIPRE.QLD.bet_setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
          bet (setAB u α β) = β
          theorem MIPRE.QLD.setAB_setAB {F : Type u_1} {m : ℕ} [NeZero m] (u : LIDT.Point F (4 * m)) (α β : F) :
          setAB (setAB u α β) (alph u) (bet u) = u
          def MIPRE.QLD.abSwap {F : Type u_1} {m : ℕ} [NeZero m] :
          LIDT.Point F (4 * m) × F × F ≃ LIDT.Point F (4 * m) × F × F

          The involution of (point, α, β) exchanging the combining coordinates with (α, β).

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem MIPRE.QLD.sum_pad_ab {F : Type u_1} [Fintype F] {m : ℕ} [NeZero m] (f : LIDT.Point F m → LIDT.Point F m → F → F → ℝ) :
            ∑ p : LIDT.Point F (4 * m) × F × F, f (xBlk p.1) (zBlk p.1) p.2.1 p.2.2 = ↑(Fintype.card F) * ↑(Fintype.card F) * ∑ u : LIDT.Point F (4 * m), f (xBlk u) (zBlk u) (alph u) (bet u)

            Reading a padded point's blocks and combining coordinates is reading its blocks and a fresh uniform pair.

            theorem MIPRE.QLD.sum_uniform_pad4 {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (f : LIDT.Point F m → LIDT.Point F m → F → F → ℝ) :
            ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * f (xBlk u) (zBlk u) (alph u) (bet u) = ∑ x : LIDT.Point F m, ∑ z : LIDT.Point F m, uniform (LIDT.Point F m) x * uniform (LIDT.Point F m) z * ∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * f x z ab.1 ab.2

            The uniform padded point, read through its blocks and combining coordinates: the average over u ∈ F^{4m} of a function of (xBlk u, zBlk u, alph u, bet u) is the average over independent uniform x, z ∈ F^m and (α, β) ∈ F².

            The lemma #

            def MIPRE.QLD.sandComb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] (X Z : LIDT.Point F m → F → R) (u : LIDT.Point F (4 * m)) (c : F) :
            R

            The sandwich combination at a padded point, P_u(c) = ∑_{αa + βb = c} Z_b X_a Z_b, for abstract point measurements X x, Z z in a ring.

            Equations
            Instances For
              def MIPRE.QLD.ordComb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] (ord : (F → R) → (F → R) → F × F → R) (X Z : LIDT.Point F m → F → R) (u : LIDT.Point F (4 * m)) (c : F) :
              R

              An ordered-product combination at a padded point, ∑_{αa + βb = c} ord(a, b).

              Equations
              Instances For
                theorem MIPRE.QLD.ptComb_posSemidef {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {Q : F × F → R} (hQ : ∀ (p : F × F), 0 ≤ Q p) (a b c : F) :
                0 ≤ ptComb Q a b c
                theorem MIPRE.QLD.ptComb_le_one {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {Q : F × F → R} (hQ : ∀ (p : F × F), 0 ≤ Q p) (hsum : ∑ p : F × F, Q p = 1) (a b c : F) :
                ptComb Q a b c ≤ 1
                theorem MIPRE.QLD.ptComb_conjTranspose {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] {Q : F × F → R} (hQ : ∀ (p : F × F), star (Q p) = Q p) (a b c : F) :
                star (ptComb Q a b c) = ptComb Q a b c
                theorem MIPRE.QLD.sandComb_posSemidef {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {X Z : LIDT.Point F m → F → R} (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) (u : LIDT.Point F (4 * m)) (c : F) :
                0 ≤ sandComb X Z u c
                theorem MIPRE.QLD.sandComb_le_one {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {X Z : LIDT.Point F m → F → R} (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) (u : LIDT.Point F (4 * m)) (c : F) :
                sandComb X Z u c ≤ 1
                theorem MIPRE.QLD.sandComb_conjTranspose {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] [StarRing R] {X Z : LIDT.Point F m → F → R} (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) (u : LIDT.Point F (4 * m)) (c : F) :
                star (sandComb X Z u c) = sandComb X Z u c
                theorem MIPRE.QLD.sandComb_sub_ordComb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] {R : Type u_2} [Ring R] {X Z : LIDT.Point F m → F → R} (ord : (F → R) → (F → R) → F × F → R) (u : LIDT.Point F (4 * m)) (c : F) :
                sandComb X Z u c - ordComb ord X Z u c = ptComb (fun (p : F × F) => sand (X (xBlk u)) (Z (zBlk u)) p - ord (X (xBlk u)) (Z (zBlk u)) p) (alph u) (bet u) c
                theorem MIPRE.QLD.sum_snorm_sq_ordComb_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] {X Z : LIDT.Point F m → F → ℬ} {K : BipartiteModel 𝒞 𝒜 ℬ} (hK : ‖K.ψ‖ = 1) (G : POVMIn LIDT.LowIndDegPoly 𝒜) (hG : IsPVMIn G.op) (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) {ord : (F → ℬ) → (F → ℬ) → F × F → ℬ} (hord1 : ∀ (x z : LIDT.Point F m), ∑ p : F × F, ord (X x) (Z z) p = 1) (hordle : ∀ (x z : LIDT.Point F m) (p : F × F), K.swap.stateNorm (sand (X x) (Z z) p - ord (X x) (Z z) p) ≤ K.swap.stateNorm (comm (X x) (Z z) p)) {δ κ : ℝ} (hcons : 1 - δ ≤ ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.bornProb (G.op g) (sandComb X Z u (g.eval u))) (hcomm : ∑ x : LIDT.Point F m, ∑ z : LIDT.Point F m, uniform (LIDT.Point F m) x * uniform (LIDT.Point F m) z * ∑ p : F × F, K.swap.stateSqNorm (comm (X x) (Z z) p) ≤ κ) :
                ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.snorm (K.πA (G.op g) * K.πB (1 - ordComb ord X Z u (g.eval u))) ^ 2 ≤ 2 * δ + 2 * κ

                lem:qld-global-products, for an abstract ordered product. Let G be a projective measurement of the first player with outcomes polynomials on F^{4m}, consistent with error δ, on average over a uniform padded point, with the sandwich combination of two projective families X x, Z z of the second player whose average commutator weight is κ; and let ord be an ordered product of the two families summing to one and deviating from the sandwich by a contraction of the commutator. Then ∑_g E_u ‖(G_g ⊗ (1 - ∑_{αa + βb = g(u)} ord(a, b))) Φ‖² ≤ 2δ + 2κ.

                theorem MIPRE.QLD.sum_snorm_sq_ordZX_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] {X Z : LIDT.Point F m → F → ℬ} {K : BipartiteModel 𝒞 𝒜 ℬ} (hK : ‖K.ψ‖ = 1) (G : POVMIn LIDT.LowIndDegPoly 𝒜) (hG : IsPVMIn G.op) (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) {δ κ : ℝ} (hcons : 1 - δ ≤ ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.bornProb (G.op g) (sandComb X Z u (g.eval u))) (hcomm : ∑ x : LIDT.Point F m, ∑ z : LIDT.Point F m, uniform (LIDT.Point F m) x * uniform (LIDT.Point F m) z * ∑ p : F × F, K.swap.stateSqNorm (comm (X x) (Z z) p) ≤ κ) :
                ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.snorm (K.πA (G.op g) * K.πB (1 - ordComb ordZX X Z u (g.eval u))) ^ 2 ≤ 2 * δ + 2 * κ

                lem:qld-global-products for the order Z_b X_a.

                theorem MIPRE.QLD.sum_snorm_sq_ordXZ_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] {X Z : LIDT.Point F m → F → ℬ} {K : BipartiteModel 𝒞 𝒜 ℬ} (hK : ‖K.ψ‖ = 1) (G : POVMIn LIDT.LowIndDegPoly 𝒜) (hG : IsPVMIn G.op) (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) {δ κ : ℝ} (hcons : 1 - δ ≤ ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.bornProb (G.op g) (sandComb X Z u (g.eval u))) (hcomm : ∑ x : LIDT.Point F m, ∑ z : LIDT.Point F m, uniform (LIDT.Point F m) x * uniform (LIDT.Point F m) z * ∑ p : F × F, K.swap.stateSqNorm (comm (X x) (Z z) p) ≤ κ) :
                ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * ∑ g : LIDT.LowIndDegPoly, K.snorm (K.πA (G.op g) * K.πB (1 - ordComb ordXZ X Z u (g.eval u))) ^ 2 ≤ 2 * δ + 2 * κ

                lem:qld-global-products for the order X_a Z_b.