Documentation

MIPRE.Background.QLD.Linear

Linearity in the two combining coefficients (lem:qld-global-linear) #

An outcome g of the global measurement is a polynomial on F^{4m}; read at the padded point u = (x, z, α, β, w) it is a polynomial in (α, β) whose coefficients are polynomials in the other coordinates. The good outcomes are those of the form g = α g₁(x, z) + β g₂(x, z): linear in (α, β) with no constant term and no other monomial. This file bounds the weight of the others (IsLinAB fails) from the ordered-product estimate of lem:qld-global-products for the order X_a Z_b.

The polynomial side #

LowIndDegPoly.coef g T t is the coefficient vector, in the variables outside T, of the monomial pattern t on the coordinates T (eval_eq_sum_coef): g(u) = ∑_t u^t_T · coef(u). Those generic facts are in MIPRE/Background/LIDT/Coefficients.lean. With T = {aIdx, bIdx} the patterns are pairs (i, j), and pAB g u₀ is the bivariate polynomial (α, β) ↦ g(setAB u₀ α β) as a coefficient vector on Fin 2 (eval_pAB). If g is not of the good form, some coefficient G_{i₀ j₀} with (i₀, j₀) ∉ {(1, 0), (0, 1)} is a nonzero polynomial, so by Schwartz--Zippel it vanishes at a uniform u₀ with probability at most 4md/q (sum_uniform_eval_eq_zero_le); where it does not vanish, pAB g u₀ differs from every linear form α a + β b (pAB_ne_linAB), so they agree at a uniform (α, β) with probability at most 2d/q (sum_agree_two_le).

The operator side #

For β ≠ 0 the fibre {αa + βb = c} has one b per a, so ‖(G_g ⊗ ∑_{fibre} X_a Z_b) Φ‖² = ∑_{fibre} ‖(G_g ⊗ X_a Z_b) Φ‖² (Pythagoras, the X_a being orthogonal projectors), and the weights W_g(a, b) = ‖(G_g ⊗ X_a Z_b) Φ‖² do not depend on (α, β) and sum to ⟨G_g⟩. Averaging over (α, β) and then over the other coordinates (sum_uniform_setAB reads the uniform padded point as a uniform base point with a fresh uniform pair), an outcome that is not of the good form has E_u ‖(G_g ⊗ B_u(g(u))) Φ‖² ≤ η ⟨G_g⟩ with η = (1 + 2d + 4md)/q (sum_uniform_snorm_sq_ordComb_le_of_not_isLinAB). On the other hand ⟨G_g⟩ ≤ 2 ‖(G_g ⊗ B_u) Φ‖² + 2 ‖(G_g ⊗ (1 - B_u)) Φ‖² for every u, and the second terms are what the product estimate bounds by Δ in total; hence (1 - 2η) · (weight of the bad outcomes) ≤ 2Δ (sum_bad_linear_mass_le). This is the linear bound the paper's cnote at eq:qld-g-prime-bound describes, rather than the displayed √Δ.

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 outcome G_g is a projection of the first player's algebra and the families X, Z projective measurements of the second player's, so G_g ⊗ D is K.πA (G.op g) * K.πB D and its squared state norm K.snorm (…) ^ 2. Pythagoras over the orthogonal X_a is the state model's orthogonality lemma (StateModel.snorm_sq_sum_orthogonal', on the images K.πB (X_a)), and the weight of an outcome is the Born probability K.bornProb (G.op g) 1. The polynomial half is unchanged.

The polynomial in the two combining coefficients #

def MIPRE.QLD.abSet {m : ℕ} [NeZero m] :
Finset (Fin (4 * m))

The two combining coordinates.

Equations
Instances For
    theorem MIPRE.QLD.mem_abSet {m : ℕ} [NeZero m] {k : Fin (4 * m)} :
    k ∈ abSet ↔ k = aIdx m ∨ k = bIdx m
    theorem MIPRE.QLD.xIdx_notMem_abSet {m : ℕ} [NeZero m] (i : Fin m) :
    xIdx m i ∉ abSet
    theorem MIPRE.QLD.zIdx_notMem_abSet {m : ℕ} [NeZero m] (i : Fin m) :
    zIdx m i ∉ abSet
    def MIPRE.QLD.patAB {m d : ℕ} [NeZero m] (i j : Fin (d + 1)) :
    Fin (4 * m) → Fin (d + 1)

    The pattern with exponents i at α and j at β.

    Equations
    Instances For
      @[simp]
      theorem MIPRE.QLD.patAB_aIdx {m d : ℕ} [NeZero m] (i j : Fin (d + 1)) :
      patAB i j (aIdx m) = i
      @[simp]
      theorem MIPRE.QLD.patAB_bIdx {m d : ℕ} [NeZero m] (i j : Fin (d + 1)) :
      patAB i j (bIdx m) = j
      theorem MIPRE.QLD.patAB_of_notMem {m d : ℕ} [NeZero m] (i j : Fin (d + 1)) {k : Fin (4 * m)} (hk : k ∉ abSet) :
      patAB i j k = 0
      theorem MIPRE.QLD.patAB_injective {m d : ℕ} [NeZero m] :
      Function.Injective fun (t2 : Fin 2 → Fin (d + 1)) => patAB (t2 0) (t2 1)
      def MIPRE.QLD.pAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (g : LIDT.LowIndDegPoly) (u₀ : LIDT.Point F (4 * m)) :

      The outcome read at (α, β), with the other coordinates fixed at those of u₀: a polynomial in two variables, as a coefficient vector.

      Equations
      Instances For
        theorem MIPRE.QLD.eval_coef_abSet_setAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (g : LIDT.LowIndDegPoly) (t : Fin (4 * m) → Fin (d + 1)) (u₀ : LIDT.Point F (4 * m)) (α β : F) :
        (g.coef abSet t).eval (setAB u₀ α β) = (g.coef abSet t).eval u₀

        The coefficient vectors on abSet do not read α, β.

        theorem MIPRE.QLD.eval_pAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (g : LIDT.LowIndDegPoly) (u₀ : LIDT.Point F (4 * m)) (α β : F) :
        (pAB g u₀).eval ![α, β] = g.eval (setAB u₀ α β)

        pAB g u₀ evaluated at (α, β) is g at setAB u₀ α β.

        Linear forms in the two combining coefficients #

        theorem MIPRE.QLD.vec_two_eq {α : Type u_2} (v : Fin 2 → α) :
        ![v 0, v 1] = v
        def MIPRE.QLD.fin2Equiv (α : Type u_2) :
        (Fin 2 → α) ≃ α × α

        Pairs as functions on two indices.

        Equations
        Instances For
          def MIPRE.QLD.e10 {d : ℕ} (hd : 1 ≤ d) :
          Fin 2 → Fin (d + 1)

          The pattern α^1 β^0.

          Equations
          Instances For
            def MIPRE.QLD.e01 {d : ℕ} (hd : 1 ≤ d) :
            Fin 2 → Fin (d + 1)

            The pattern α^0 β^1.

            Equations
            Instances For
              theorem MIPRE.QLD.e10_ne_e01 {d : ℕ} (hd : 1 ≤ d) :
              e10 hd ≠ e01 hd
              def MIPRE.QLD.linAB {F : Type u_1} [Field F] {d : ℕ} (hd : 1 ≤ d) (a b : F) :

              The linear form α a + β b, as a coefficient vector on two variables.

              Equations
              Instances For
                theorem MIPRE.QLD.eval_linAB {F : Type u_1} [Field F] {d : ℕ} (hd : 1 ≤ d) (a b α β : F) :
                (linAB hd a b).eval ![α, β] = α * a + β * b
                theorem MIPRE.QLD.sum_agree_two_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {d : ℕ} {p q : LIDT.LowIndDegPoly} (hpq : p ≠ q) :
                (∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * if p.eval ![ab.1, ab.2] = q.eval ![ab.1, ab.2] then 1 else 0) ≤ 2 * ↑d / ↑(Fintype.card F)

                Schwartz--Zippel on two variables: two different coefficient vectors agree at a uniform pair with probability at most 2d/q.

                The linear outcomes and the two probability bounds #

                def MIPRE.QLD.IsLinAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (g : LIDT.LowIndDegPoly) :

                Linear in (α, β): every monomial of g has exponents (1, 0) or (0, 1) on the two combining coordinates, so g = α g₁ + β g₂ with g₁, g₂ not reading α, β.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  @[instance_reducible]
                  Equations
                  • One or more equations did not get rendered due to their size.
                  theorem MIPRE.QLD.patAB_eq_maskOn {m d : ℕ} [NeZero m] (e : Fin (4 * m) → Fin (d + 1)) :
                  patAB (e (aIdx m)) (e (bIdx m)) = LIDT.maskOn abSet e
                  theorem MIPRE.QLD.exists_bad_coef {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] {g : LIDT.LowIndDegPoly} (hg : ¬IsLinAB g) :
                  ∃ (e₀ : Fin (4 * m) → Fin (d + 1)), ¬(↑(e₀ (aIdx m)) = 1 ∧ ↑(e₀ (bIdx m)) = 0 ∨ ↑(e₀ (aIdx m)) = 0 ∧ ↑(e₀ (bIdx m)) = 1) ∧ g.coef abSet (patAB (e₀ (aIdx m)) (e₀ (bIdx m))) ≠ 0

                  An outcome that is not linear in (α, β) has a nonzero coefficient vector at a non-linear pattern.

                  theorem MIPRE.QLD.pAB_ne_linAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g : LIDT.LowIndDegPoly} {e₀ : Fin (4 * m) → Fin (d + 1)} (hpat : ¬(↑(e₀ (aIdx m)) = 1 ∧ ↑(e₀ (bIdx m)) = 0 ∨ ↑(e₀ (aIdx m)) = 0 ∧ ↑(e₀ (bIdx m)) = 1)) {u₀ : LIDT.Point F (4 * m)} (hu : (g.coef abSet (patAB (e₀ (aIdx m)) (e₀ (bIdx m)))).eval u₀ ≠ 0) (a b : F) :
                  pAB g u₀ ≠ linAB hd a b

                  Where a non-linear coefficient does not vanish, the outcome read at (α, β) differs from every linear form.

                  theorem MIPRE.QLD.sum_uniform_eval_eq_zero_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {G : LIDT.LowIndDegPoly} (hG : G ≠ 0) :
                  (∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * if G.eval u = 0 then 1 else 0) ≤ 4 * ↑m * ↑d / ↑(Fintype.card F)

                  The bad base points: a nonzero coefficient vector vanishes at a uniform padded point with probability at most 4md/q.

                  The operator side: the fibre weights #

                  def MIPRE.QLD.fibMap {F : Type u_1} [Field F] (α β c a : F) :
                  F × F

                  The fibre {αa + βb = c} parametrized by a, for β ≠ 0.

                  Equations
                  Instances For
                    theorem MIPRE.QLD.fibMap_injective {F : Type u_1} [Field F] (α β c : F) :
                    theorem MIPRE.QLD.fiber_eq_image {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {α β c : F} (hβ : β ≠ 0) :
                    {p : F × F | α * p.1 + β * p.2 = c} = Finset.image (fibMap α β c) Finset.univ
                    theorem MIPRE.QLD.ordComb_ordXZ_bet_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] {X' Z' : F → R} (hZ : IsPVMIn Z') (α c : F) :
                    ptComb (ordXZ X' Z') α 0 c = fibSumIn X' (fun (a : F) => α * a) c

                    For β = 0 the combination is a sub-sum of X.

                    theorem MIPRE.QLD.card_filter_snd_eq_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] :
                    {ab : F × F | ab.2 = 0}.card = Fintype.card F

                    The pairs with β = 0 number q.

                    theorem MIPRE.QLD.sum_snorm_sq_ordXZ_eq {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 → ℬ} (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : IsPVMIn X') (hZ : IsPVMIn Z') :
                    ∑ p : F × F, K.snorm (K.πA S * K.πB (X' p.1 * Z' p.2)) ^ 2 = K.bornProb S 1

                    The weights sum to the outcome's mass: ∑_{a,b} ‖(S ⊗ X_a Z_b) Φ‖² = ⟨S ⊗ 1⟩.

                    theorem MIPRE.QLD.snorm_sq_ordComb_ordXZ_of_ne {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X' Z' : F → ℬ} (K : BipartiteModel 𝒞 𝒜 ℬ) (S : 𝒜) (hX : IsPVMIn X') {α β c : F} (hβ : β ≠ 0) :
                    K.snorm (K.πA S * K.πB (ptComb (ordXZ X' Z') α β c)) ^ 2 = ∑ p : F × F with α * p.1 + β * p.2 = c, K.snorm (K.πA S * K.πB (X' p.1 * Z' p.2)) ^ 2

                    Pythagoras on the fibre: for β ≠ 0 the fibre has one b per a, and the X_a are orthogonal projections.

                    theorem MIPRE.QLD.sum_filter_snorm_sq_ordComb_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X' Z' : F → ℬ} (K : BipartiteModel 𝒞 𝒜 ℬ) (S : 𝒜) (hX : IsPVMIn X') (v : F × F → F) :
                    ∑ ab : F × F with ¬ab.2 = 0, K.snorm (K.πA S * K.πB (ptComb (ordXZ X' Z') ab.1 ab.2 (v ab))) ^ 2 = ∑ p : F × F, ∑ ab : F × F with ¬ab.2 = 0, (if ab.1 * p.1 + ab.2 * p.2 = v ab then 1 else 0) * K.snorm (K.πA S * K.πB (X' p.1 * Z' p.2)) ^ 2

                    The fibre weights over β ≠ 0, exchanged: each pair (a, b) is counted once for every (α, β) that puts it on the sampled fibre {αa + βb = v(α, β)}.

                    theorem MIPRE.QLD.snorm_sq_ordComb_ordXZ_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {X' Z' : F → ℬ} [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : IsPVMIn X') (hZ : IsPVMIn Z') (α β c : F) :
                    K.snorm (K.πA S * K.πB (ptComb (ordXZ X' Z') α β c)) ^ 2 ≤ K.bornProb S 1

                    The combination is a contraction: ‖(S ⊗ B) Φ‖² ≤ ⟨S ⊗ 1⟩ for every (α, β, c).

                    Reading a padded point as a base point and a fresh combining pair #

                    theorem MIPRE.QLD.sum_setAB {F : Type u_1} [Fintype F] {m : ℕ} [NeZero m] (f : LIDT.Point F (4 * m) → ℝ) :
                    ∑ u₀ : LIDT.Point F (4 * m), ∑ ab : F × F, f (setAB u₀ ab.1 ab.2) = ↑(Fintype.card F) * ↑(Fintype.card F) * ∑ u : LIDT.Point F (4 * m), f u

                    The map (u₀, α, β) ↦ setAB u₀ α β is q²-to-one.

                    theorem MIPRE.QLD.sum_uniform_setAB {F : Type u_1} [Field F] [Fintype F] {m : ℕ} [NeZero m] (f : LIDT.Point F (4 * m) → ℝ) :
                    ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * f u = ∑ u₀ : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u₀ * ∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * f (setAB u₀ ab.1 ab.2)

                    The uniform padded point is a uniform base point with a fresh uniform combining pair.

                    The two averages and the assembly #

                    theorem MIPRE.QLD.sum_ab_snorm_sq_ordComb_le_of_good {F : Type u_1} [Field F] [Fintype F] [DecidableEq 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' : F → ℬ} (hd : 1 ≤ d) (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : IsPVMIn X') (hZ : IsPVMIn Z') {g : LIDT.LowIndDegPoly} {e₀ : Fin (4 * m) → Fin (d + 1)} (hpat : ¬(↑(e₀ (aIdx m)) = 1 ∧ ↑(e₀ (bIdx m)) = 0 ∨ ↑(e₀ (aIdx m)) = 0 ∧ ↑(e₀ (bIdx m)) = 1)) {u₀ : LIDT.Point F (4 * m)} (hu : (g.coef abSet (patAB (e₀ (aIdx m)) (e₀ (bIdx m)))).eval u₀ ≠ 0) :
                    ∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * K.snorm (K.πA S * K.πB (ptComb (ordXZ X' Z') ab.1 ab.2 ((pAB g u₀).eval ![ab.1, ab.2]))) ^ 2 ≤ (1 + 2 * ↑d) / ↑(Fintype.card F) * K.bornProb S 1

                    A good base point: where a non-linear coefficient of g does not vanish, the average over the combining pair (α, β) of ‖(S ⊗ B_{α,β}(g(setAB u₀ α β))) Φ‖² is at most (1 + 2d)/q · ⟨S ⊗ 1⟩: the pairs with β = 0 contribute 1/q, and for β ≠ 0 each weight W(a, b) is counted with the probability, at most 2d/q, that (α, β) puts (a, b) on the sampled fibre.

                    theorem MIPRE.QLD.sum_uniform_snorm_sq_ordComb_le_of_not_isLinAB {F : Type u_1} [Field F] [Fintype F] [DecidableEq 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 → ℬ} (hd : 1 ≤ d) (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : ∀ (x : LIDT.Point F m), IsPVMIn (X x)) (hZ : ∀ (z : LIDT.Point F m), IsPVMIn (Z z)) {g : LIDT.LowIndDegPoly} (hg : ¬IsLinAB g) :
                    ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * K.snorm (K.πA S * K.πB (ordComb ordXZ X Z u (g.eval u))) ^ 2 ≤ (1 + 2 * ↑d + 4 * ↑m * ↑d) / ↑(Fintype.card F) * K.bornProb S 1

                    A bad outcome carries little of its own weight through B_u: if g is not linear in (α, β), then E_u ‖(S ⊗ B_u(g(u))) Φ‖² ≤ (1 + 2d + 4md)/q · ⟨S ⊗ 1⟩, the 4md/q being the probability that the witnessing non-linear coefficient vanishes at the base point.

                    theorem MIPRE.QLD.sum_bad_linear_mass_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq 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 → ℬ} (hd : 1 ≤ d) (K : BipartiteModel 𝒞 𝒜 ℬ) (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)) {Δ : ℝ} (hprod : ∑ 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 ≤ Δ) :
                    (1 - 2 * ((1 + 2 * ↑d + 4 * ↑m * ↑d) / ↑(Fintype.card F))) * ∑ g : LIDT.LowIndDegPoly with ¬IsLinAB g, K.bornProb (G.op g) 1 ≤ 2 * Δ

                    lem:qld-global-linear, abstract form. If the global measurement G satisfies the X_a Z_b products estimate ∑_g E_u ‖(G_g ⊗ (1 - B_u(g(u)))) Φ‖² ≤ Δ, then the outcomes that are not linear in the combining coordinates (α, β) have total weight W ≤ 2Δ / (1 - 2η), η = (1 + 2d + 4md)/q: for each of them ⟨G_g⟩ ≤ 2 ‖(G_g ⊗ B_u) Φ‖² + 2 ‖(G_g ⊗ (1 - B_u)) Φ‖², and the first term averages to at most 2η ⟨G_g⟩.