Documentation

MIPRE.Background.QLD.Separate

Separating the two point variables (lem:qld-global-separate) #

An outcome g = α g₁ + β g₂ of the global measurement that is linear in the combining coordinates (IsLinAB, lem:qld-global-linear) is good when g₁ reads only the x block and g₂ only the z block: g = α g_X(x) + β g_Z(z) (IsGood). This file bounds the weight of the linear outcomes that are not good, from the two ordered-product estimates of lem:qld-global-products: the order X_a Z_b controls the outcomes whose g₂ reads a coordinate outside the z block, and the order Z_b X_a those whose g₁ reads a coordinate outside the x block.

The argument #

For a linear outcome and a base point u₀, the fibre {αa + βb = α g₁(u₀) + β g₂(u₀)} always contains the diagonal pair (g₁(u₀), g₂(u₀)), and contains any other pair for at most q of the q² values of (α, β). So the average over (α, β) of ‖(S ⊗ B_u(g(u))) Φ‖² is at most 2/q · ⟨S⟩ + W(g₁(u₀), g₂(u₀)), with W(a, b) = ‖(S ⊗ X_a Z_b) Φ‖² ≤ ⟨S ⊗ Z_b⟩. Averaging over u₀, read as a uniform z block with the other coordinates uniform and independent (sum_uniform_mixOn): for fixed z, u ↦ g₂(u) is a polynomial in the other coordinates (LowIndDegPoly.restrictOff) which, if g₂ reads a coordinate outside the z block, is non-constant except for a set of z of probability at most 4md/q (Schwartz--Zippel on a nonzero coefficient), and where it is non-constant each value b is taken with probability at most 4md/q, so E ⟨S ⊗ Z_{g₂(u)}(z)⟩ ≤ 8md/q · ⟨S⟩. Altogether E_u ‖(S ⊗ B_u(g(u))) Φ‖² ≤ η ⟨S⟩ with η = (2 + 8md)/q, and the assembly of lem:qld-global-linear gives (1 - 2η) · (weight of these outcomes) ≤ 2Δ. The other block is the mirror image, with the roles of (X, a, α) and (Z, b, β) exchanged.

Stated in a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). As in MIPRE/Background/QLD/Linear.lean, 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, the families X, Z are projective measurements of the second player's, G_g ⊗ D is K.πA (G.op g) * K.πB D, and the expectations ⟨S ⊗ D⟩ are Born probabilities K.bornProb S D. The diagonal weight bound Z X Z ≤ Z holds in any star-ordered ring, Z (1 - X) Z being a conjugate of a nonnegative element. The polynomial half is unchanged.

Coefficient vectors: constants, differences, restriction to a block #

theorem MIPRE.LIDT.LowIndDegPoly.eval_zero {F : Type u_1} [Field F] {n d : ℕ} (u : Point F n) :
eval 0 u = 0
def MIPRE.LIDT.LowIndDegPoly.const {F : Type u_1} [Field F] {n d : ℕ} (c : F) :

The constant coefficient vector.

Equations
Instances For
    theorem MIPRE.LIDT.LowIndDegPoly.eval_const {F : Type u_1} [Field F] {n d : ℕ} (c : F) (u : Point F n) :
    (const c).eval u = c
    theorem MIPRE.LIDT.LowIndDegPoly.coef_eq_zero_of_not {F : Type u_1} [Field F] {n d : ℕ} (g : LowIndDegPoly) {T : Finset (Fin n)} {t : Fin n → Fin (d + 1)} (h : ¬∀ k ∉ T, t k = 0) :
    g.coef T t = 0

    A coefficient vector on a pattern not supported in T is zero.

    def MIPRE.LIDT.LowIndDegPoly.restrictOff {F : Type u_1} [Field F] {n d : ℕ} (g : LowIndDegPoly) (T : Finset (Fin n)) (z : Point F n) :

    Substituting the coordinates in T by those of z: the coefficient vector, in the variables off T, of u ↦ g(z on T, u off T).

    Equations
    Instances For
      theorem MIPRE.LIDT.LowIndDegPoly.restrictOff_apply_of {F : Type u_1} [Field F] {n d : ℕ} (g : LowIndDegPoly) (T : Finset (Fin n)) (z : Point F n) {e : Fin n → Fin (d + 1)} (h : ∀ k ∈ T, e k = 0) :
      g.restrictOff T z e = (g.coef Tᶜ e).eval z
      theorem MIPRE.LIDT.LowIndDegPoly.eval_restrictOff {F : Type u_1} [Field F] {n d : ℕ} (g : LowIndDegPoly) (T : Finset (Fin n)) (z u : Point F n) :
      (g.restrictOff T z).eval u = g.eval fun (k : Fin n) => if k ∈ T then z k else u k

      The restricted vector evaluates as g at the point with the T coordinates from z.

      def MIPRE.LIDT.LowIndDegPoly.DepOutside {F : Type u_1} [Field F] {n d : ℕ} (g : LowIndDegPoly) (T : Finset (Fin n)) :

      Dependence on a coordinate outside T: some monomial of g has a nonzero exponent off T.

      Equations
      Instances For
        theorem MIPRE.LIDT.LowIndDegPoly.exists_coef_ne_zero_of_depOutside {F : Type u_1} [Field F] {n d : ℕ} {g : LowIndDegPoly} {T : Finset (Fin n)} (h : g.DepOutside T) :
        ∃ (t : Fin n → Fin (d + 1)), (∀ k ∈ T, t k = 0) ∧ t ≠ 0 ∧ g.coef Tᶜ t ≠ 0

        A vector depending on a coordinate off T has a nonzero coefficient vector at a nonzero pattern supported off T.

        @[instance_reducible]
        Equations

        Exchanging a block of coordinates #

        def MIPRE.QLD.mixOn {F : Type u_1} {m : ℕ} (T : Finset (Fin (4 * m))) (u u' : LIDT.Point F (4 * m)) :
        LIDT.Point F (4 * m)

        The point with the coordinates in T taken from u' and the others from u.

        Equations
        Instances For
          theorem MIPRE.QLD.mixOn_mixOn {F : Type u_1} {m : ℕ} (T : Finset (Fin (4 * m))) (u u' : LIDT.Point F (4 * m)) :
          mixOn T (mixOn T u u') (mixOn T u' u) = u
          def MIPRE.QLD.mixOnSwap {F : Type u_1} {m : ℕ} (T : Finset (Fin (4 * m))) :
          LIDT.Point F (4 * m) × LIDT.Point F (4 * m) ≃ LIDT.Point F (4 * m) × LIDT.Point F (4 * m)

          The involution of pairs of points that exchanges their coordinates in T.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem MIPRE.QLD.sum_mixOn {F : Type u_1} [Fintype F] {m : ℕ} (T : Finset (Fin (4 * m))) (f : LIDT.Point F (4 * m) → ℝ) :
            ∑ u' : LIDT.Point F (4 * m), ∑ u : LIDT.Point F (4 * m), f (mixOn T u u') = ↑(Fintype.card (LIDT.Point F (4 * m))) * ∑ u : LIDT.Point F (4 * m), f u
            theorem MIPRE.QLD.sum_uniform_mixOn {F : Type u_1} [Field F] [Fintype F] {m : ℕ} (T : Finset (Fin (4 * 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' * ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * f (mixOn T u u')

            A uniform point is a uniform block with the other coordinates uniform and independent.

            theorem MIPRE.QLD.eval_mixOn {F : Type u_1} [Field F] {m d : ℕ} (g : LIDT.LowIndDegPoly) (T : Finset (Fin (4 * m))) (u u' : LIDT.Point F (4 * m)) :
            g.eval (mixOn T u u') = (g.restrictOff T u').eval u
            def MIPRE.QLD.zSet {m : ℕ} [NeZero m] :
            Finset (Fin (4 * m))

            The positions of the z block.

            Equations
            Instances For
              def MIPRE.QLD.xSet {m : ℕ} [NeZero m] :
              Finset (Fin (4 * m))

              The positions of the x block.

              Equations
              Instances For
                theorem MIPRE.QLD.zIdx_mem_zSet {m : ℕ} [NeZero m] (i : Fin m) :
                theorem MIPRE.QLD.xIdx_mem_xSet {m : ℕ} [NeZero m] (i : Fin m) :
                theorem MIPRE.QLD.zBlk_mixOn_zSet {F : Type u_1} {m : ℕ} [NeZero m] (u u' : LIDT.Point F (4 * m)) :
                zBlk (mixOn zSet u u') = zBlk u'
                theorem MIPRE.QLD.xBlk_mixOn_xSet {F : Type u_1} {m : ℕ} [NeZero m] (u u' : LIDT.Point F (4 * m)) :
                xBlk (mixOn xSet u u') = xBlk u'

                The two coefficient polynomials of a linear outcome #

                def MIPRE.QLD.oneD {d : ℕ} (hd : 1 ≤ d) :
                Fin (d + 1)

                The exponent 1.

                Equations
                Instances For
                  def MIPRE.QLD.gA {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) (g : LIDT.LowIndDegPoly) :

                  The coefficient of α in an outcome: a polynomial in the coordinates other than α, β.

                  Equations
                  Instances For
                    def MIPRE.QLD.gB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) (g : LIDT.LowIndDegPoly) :

                    The coefficient of β in an outcome.

                    Equations
                    Instances For
                      theorem MIPRE.QLD.patch_abSet_aIdx {m d : ℕ} [NeZero m] (t e : Fin (4 * m) → Fin (d + 1)) :
                      LIDT.patch abSet t e (aIdx m) = t (aIdx m)
                      theorem MIPRE.QLD.patch_abSet_bIdx {m d : ℕ} [NeZero m] (t e : Fin (4 * m) → Fin (d + 1)) :
                      LIDT.patch abSet t e (bIdx m) = t (bIdx m)
                      theorem MIPRE.QLD.coef_patAB_eq_zero_of_isLinAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] {g : LIDT.LowIndDegPoly} (hg : IsLinAB g) {i j : Fin (d + 1)} (hij : ¬(↑i = 1 ∧ ↑j = 0 ∨ ↑i = 0 ∧ ↑j = 1)) :
                      g.coef abSet (patAB i j) = 0

                      A linear outcome has no coefficient at a non-linear pattern.

                      theorem MIPRE.QLD.pAB_eq_linAB_of_isLinAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g : LIDT.LowIndDegPoly} (hg : IsLinAB g) (u₀ : LIDT.Point F (4 * m)) :
                      pAB g u₀ = linAB hd ((gA hd g).eval u₀) ((gB hd g).eval u₀)

                      A linear outcome read at the combining coordinates is the linear form of its two coefficients.

                      theorem MIPRE.QLD.eval_setAB_of_isLinAB {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g : LIDT.LowIndDegPoly} (hg : IsLinAB g) (u₀ : LIDT.Point F (4 * m)) (α β : F) :
                      g.eval (setAB u₀ α β) = α * (gA hd g).eval u₀ + β * (gB hd g).eval u₀
                      def MIPRE.QLD.IsGood {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (g : LIDT.LowIndDegPoly) :

                      The good outcomes: g = α g_X(x) + β g_Z(z), with g_X reading only the x block and g_Z only the z block.

                      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.isGood_of {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g : LIDT.LowIndDegPoly} (hlin : IsLinAB g) (hA : ¬(gA hd g).DepOutside xSet) (hB : ¬(gB hd g).DepOutside zSet) :

                        A linear outcome whose coefficient of α reads only the x block and whose coefficient of β reads only the z block is good.

                        theorem MIPRE.QLD.not_isGood_cases {F : Type u_1} [Field F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g : LIDT.LowIndDegPoly} (hg : ¬IsGood g) :

                        An outcome that is not good is not linear, or is linear with a coefficient reading a coordinate outside its block.

                        The linear fibre and the diagonal weight #

                        theorem MIPRE.QLD.card_filter_linear_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {c₁ c₂ : F} (h : ¬(c₁ = 0 ∧ c₂ = 0)) :
                        {ab : F × F | ab.1 * c₁ + ab.2 * c₂ = 0}.card ≤ Fintype.card F

                        A nontrivial linear form on F² vanishes on at most q pairs.

                        theorem MIPRE.QLD.ptComb_ordZX_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] (X' Z' : F → R) (α β c : F) :
                        ptComb (ordZX X' Z') α β c = ptComb (ordXZ Z' X') β α c

                        The order Z_b X_a along (α, β) is the order X_a Z_b with the roles exchanged.

                        theorem MIPRE.QLD.snorm_sq_ordXZ_le_bornProb {F : Type u_1} [Fintype F] {𝒞 : 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 → ℬ} (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : IsPVMIn X') (hZ : IsPVMIn Z') (a b : F) :
                        K.snorm (K.πA S * K.πB (X' a * Z' b)) ^ 2 ≤ K.bornProb S (Z' b)

                        The diagonal weight: ‖(S ⊗ X_a Z_b) Φ‖² = ⟨S ⊗ Z_b X_a Z_b⟩ ≤ ⟨S ⊗ Z_b⟩.

                        theorem MIPRE.QLD.sum_ab_snorm_sq_ordComb_le_of_lin {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 ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] {X' Z' : F → ℬ} (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : IsStarProjection S) (hX : IsPVMIn X') (hZ : IsPVMIn Z') (a₀ b₀ : F) :
                        ∑ ab : F × F, (↑(Fintype.card F))⁻¹ * (↑(Fintype.card F))⁻¹ * K.snorm (K.πA S * K.πB (ptComb (ordXZ X' Z') ab.1 ab.2 (ab.1 * a₀ + ab.2 * b₀))) ^ 2 ≤ 2 / ↑(Fintype.card F) * K.bornProb S 1 + K.snorm (K.πA S * K.πB (X' a₀ * Z' b₀)) ^ 2

                        The linear fibre: for the linear form α a₀ + β b₀, the fibre always contains the diagonal pair (a₀, b₀), and any other pair for at most q of the q² values of (α, β); so the average over (α, β) of the fibre weights is at most 2/q · ⟨S ⊗ 1⟩ plus the diagonal weight.

                        Conditioning on a block, the two averages and the assembly #

                        theorem MIPRE.QLD.sum_uniform_bornProb_readOn_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] {T : Finset (Fin (4 * m))} {Op : LIDT.Point F (4 * m) → F → ℬ} (hOp : ∀ (u u' : LIDT.Point F (4 * m)), Op (mixOn T u u') = Op u') (hpvm : ∀ (u : LIDT.Point F (4 * m)), IsPVMIn (Op u)) {H : LIDT.LowIndDegPoly} (hH : H.DepOutside T) (K : BipartiteModel 𝒞 𝒜 ℬ) {S : 𝒜} (hS : 0 ≤ S) :
                        ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * K.bornProb S (Op u (H.eval u)) ≤ 8 * ↑m * ↑d / ↑(Fintype.card F) * K.bornProb S 1

                        Conditioning on a block: if Op reads only the coordinates in T and the polynomial H reads some coordinate outside T, then E_u ⟨S ⊗ Op_u(H(u))⟩ ≤ 8md/q · ⟨S ⊗ 1⟩: for fixed T coordinates, H is a non-constant polynomial in the others except with probability 4md/q, and a non-constant polynomial takes each value with probability at most 4md/q.

                        theorem MIPRE.QLD.sum_uniform_snorm_sq_ordComb_XZ_le_of_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} (hlin : 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 ≤ 2 / ↑(Fintype.card F) * K.bornProb S 1 + ∑ u₀ : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u₀ * K.bornProb S (Z (zBlk u₀) ((gB hd g).eval u₀))

                        A linear outcome against the order X_a Z_b: the fibre contributes 2/q · ⟨S ⊗ 1⟩ beyond its diagonal pair, whose weight is at most E_{u₀} ⟨S ⊗ Z_{g₂(u₀)}(z)⟩.

                        theorem MIPRE.QLD.sum_uniform_snorm_sq_ordComb_XZ_le_of_depB {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} (hlin : IsLinAB g) (hB : (gB hd g).DepOutside zSet) :
                        ∑ 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 ≤ (2 + 8 * ↑m * ↑d) / ↑(Fintype.card F) * K.bornProb S 1

                        A linear outcome whose β coefficient reads a coordinate outside the z block, against the order X_a Z_b: E_u ‖(S ⊗ B_u(g(u))) Φ‖² ≤ (2 + 8md)/q · ⟨S ⊗ 1⟩.

                        theorem MIPRE.QLD.sum_uniform_snorm_sq_ordComb_ZX_le_of_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} (hlin : IsLinAB g) :
                        ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * K.snorm (K.πA S * K.πB (ordComb ordZX X Z u (g.eval u))) ^ 2 ≤ 2 / ↑(Fintype.card F) * K.bornProb S 1 + ∑ u₀ : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u₀ * K.bornProb S (X (xBlk u₀) ((gA hd g).eval u₀))

                        A linear outcome against the order Z_b X_a: the mirror image, with the roles of (X, a, α) and (Z, b, β) exchanged.

                        theorem MIPRE.QLD.sum_uniform_snorm_sq_ordComb_ZX_le_of_depA {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} (hlin : IsLinAB g) (hA : (gA hd g).DepOutside xSet) :
                        ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * K.snorm (K.πA S * K.πB (ordComb ordZX X Z u (g.eval u))) ^ 2 ≤ (2 + 8 * ↑m * ↑d) / ↑(Fintype.card F) * K.bornProb S 1

                        A linear outcome whose α coefficient reads a coordinate outside the x block, against the order Z_b X_a.

                        theorem MIPRE.QLD.sum_bad_mass_le_of_avg {F : Type u_1} [Field F] [Fintype F] {m d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] (K : BipartiteModel 𝒞 𝒜 ℬ) (G : POVMIn LIDT.LowIndDegPoly 𝒜) (hG : IsPVMIn G.op) (B : LIDT.Point F (4 * m) → F → ℬ) (bad : LIDT.LowIndDegPoly → Prop) [DecidablePred bad] {η Δ : ℝ} (havg : ∀ (g : LIDT.LowIndDegPoly), bad g → ∑ u : LIDT.Point F (4 * m), uniform (LIDT.Point F (4 * m)) u * K.snorm (K.πA (G.op g) * K.πB (B u (g.eval u))) ^ 2 ≤ η * K.bornProb (G.op g) 1) (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 - B u (g.eval u))) ^ 2 ≤ Δ) :
                        (1 - 2 * η) * ∑ g : LIDT.LowIndDegPoly with bad g, K.bornProb (G.op g) 1 ≤ 2 * Δ

                        The assembly, abstractly: if every bad outcome has E_u ‖(G_g ⊗ B_u(g(u))) Φ‖² ≤ η ⟨G_g⟩ and the products estimate ∑_g E_u ‖(G_g ⊗ (1 - B_u(g(u)))) Φ‖² ≤ Δ holds, then (1 - 2η) · (weight of the bad outcomes) ≤ 2Δ.

                        theorem MIPRE.QLD.sum_not_isGood_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)) {Δ₁ Δ₂ : ℝ} (hXZ : ∑ 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 ≤ Δ₁) (hZX : ∑ 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 ≤ Δ₂) :
                        (1 - 2 * ((2 + 2 * ↑d + 8 * ↑m * ↑d) / ↑(Fintype.card F))) * ∑ g : LIDT.LowIndDegPoly with ¬IsGood g, K.bornProb (G.op g) 1 ≤ 2 * Δ₁ + 2 * Δ₂

                        lem:qld-global-separate, abstract form. With η = (2 + 2d + 8md)/q, if the two ordered-product estimates hold with bounds Δ₁ (order X_a Z_b) and Δ₂ (order Z_b X_a), then (1 - 2η) · (weight of the outcomes that are not good) ≤ 2Δ₁ + 2Δ₂.