Documentation

MIPRE.Background.QLD.Product

A content, and a product of two independent line-point pairs #

lem:qld-pairs-of-lines is proved on the Pauli basis test's own question distribution: one Content, carrying both sides' points but a single seed and a single raw direction, so the X line and the Z line it presents are not independent. lem:qld-padded-lines needs the same conclusion on a product of two independent line-point laws, which is what lem:qld-sublines delivers.

The transfer is available, and the reason is worth stating before the machinery: no hypothesis of the pasting lemma involves both lines. Each marginal consistency involves one line and the two points; the fine self-consistency and the collision term involve one line only. So the only laws that have to agree are

and each of those has the same law under a content as under a product, because a content's two points and its seed and raw direction are independent and uniform. This file says that three times, and each proof is one line on top of MIPRE.avg_comp_equiv_fst: exhibit the splitting of each sample space that isolates the part the quantity depends on, and the marginals match.

What the file does not claim is that the two laws agree on anything involving both lines --- they do not, and that is the content of the paper's restriction to product distributions.

In a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The laws and splittings are unchanged; the operator statements read the strategies as families of projective measurements PA, PB in the players' algebras and the expanded state as the model M.reg (Anc F m), as MIPRE/Background/QLD/Lines.lean does. The joint point measurement indexed by the pair of points is combined_points_pts_dilated, built with BipartiteModel.exists_projective_joint on the model of the dilation (extHat); combined_points_pts is its agreement form in the expanded model, and the product form of the pairs-of-lines lemma from the game (pairs_of_lines_prod_of_items) is an agreement bound of the sandwich there, the dilation being kept inside its proof. Every constant is the matrix statement's.

Reading a content as line-point data, and back #

def MIPRE.QLD.Content.lpX {F : Type u_1} {m : ℕ} (c : Content F m) :
LPData F m

The X-side line-point data a content carries: its X point, its seed, its raw direction.

Equations
Instances For
    def MIPRE.QLD.Content.lpZ {F : Type u_1} {m : ℕ} (c : Content F m) :
    LPData F m

    The Z-side line-point data a content carries: the same seed and raw direction, with the Z point. That sharing is exactly why a content is not a product of two independent line-point pairs.

    Equations
    Instances For
      def MIPRE.QLD.ofLPX {F : Type u_1} [Field F] {m : ℕ} (d : LPData F m) (uZ : LIDT.Point F m) :

      A content assembled from X-side line-point data and a Z point. The probe registers are irrelevant to every line quantity, so they are set to zero.

      Equations
      Instances For
        def MIPRE.QLD.ofLPZ {F : Type u_1} [Field F] {m : ℕ} (d : LPData F m) (uX : LIDT.Point F m) :

        A content assembled from Z-side line-point data and an X point.

        Equations
        Instances For
          @[simp]
          theorem MIPRE.QLD.lpX_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uZ : LIDT.Point F m) :
          (ofLPX d uZ).lpX = d
          @[simp]
          theorem MIPRE.QLD.lpZ_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uX : LIDT.Point F m) :
          (ofLPZ d uX).lpZ = d
          @[simp]
          theorem MIPRE.QLD.uZ_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uZ : LIDT.Point F m) :
          (ofLPX d uZ).uZ = uZ
          @[simp]
          theorem MIPRE.QLD.uX_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uZ : LIDT.Point F m) :
          (ofLPX d uZ).uX = d.pt
          @[simp]
          theorem MIPRE.QLD.uX_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uX : LIDT.Point F m) :
          (ofLPZ d uX).uX = uX
          @[simp]
          theorem MIPRE.QLD.uZ_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (d : LPData F m) (uX : LIDT.Point F m) :
          (ofLPZ d uX).uZ = d.pt

          The three splittings, on each of the two sample spaces #

          Each pair of equivalences isolates the same part of the sample --- the part a hypothesis of the pasting lemma can depend on --- on the content side and on the product side. avg_comp_equiv_fst then says both uniform averages equal the uniform average over that part.

          def MIPRE.QLD.contentSplitX {F : Type u_1} {m : ℕ} :
          Content F m ≃ (LPData F m × LIDT.Point F m) × F × F

          A content splits as (its X data, its Z point) and its probes.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            def MIPRE.QLD.pairSplitX {F : Type u_1} {m : ℕ} :
            LPData F m × LPData F m ≃ (LPData F m × LIDT.Point F m) × F × LIDT.Point F m

            A pair of line-point data splits as (the X one, the Z one's point) and the Z one's line.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              def MIPRE.QLD.contentSplitZ {F : Type u_1} {m : ℕ} :
              Content F m ≃ (LPData F m × LIDT.Point F m) × F × F

              The mirror of contentSplitX.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                def MIPRE.QLD.pairSplitZ {F : Type u_1} {m : ℕ} :
                LPData F m × LPData F m ≃ (LPData F m × LIDT.Point F m) × F × LIDT.Point F m

                The mirror of pairSplitX.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  def MIPRE.QLD.contentSplitPts {F : Type u_1} {m : ℕ} :

                  A content splits as its two points and everything else.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For
                    def MIPRE.QLD.pairSplitPts {F : Type u_1} {m : ℕ} :

                    A pair of line-point data splits as its two points and the two lines.

                    Equations
                    • One or more equations did not get rendered due to their size.
                    Instances For

                      The three laws that agree #

                      theorem MIPRE.QLD.avg_content_eq_pair_X {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (H : LPData F m → LIDT.Point F m → ℝ) :
                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.lpX c.uZ = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * H p.1 p.2.pt

                      One side's data together with the other side's point has the same law under a content as under a product. The X version: every marginal consistency and every collision term of the pasting lemma at the X line is a quantity of this shape.

                      theorem MIPRE.QLD.avg_content_eq_pair_Z {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (H : LPData F m → LIDT.Point F m → ℝ) :
                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.lpZ c.uX = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * H p.2 p.1.pt

                      The Z version.

                      theorem MIPRE.QLD.avg_content_eq_pair_pts {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (H : LIDT.Point F m → LIDT.Point F m → ℝ) :
                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.uX c.uZ = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * H p.1.pt p.2.pt

                      The two points have the same law under a content as under a product. This is what carries the combined point measurement's consistency across.

                      theorem MIPRE.QLD.avg_content_eq_pair_X' {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (H : LPData F m → ℝ) :
                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.lpX = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * H p.1

                      One side's data on its own, as the special case that ignores the other side's point.

                      theorem MIPRE.QLD.avg_content_eq_pair_Z' {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] (H : LPData F m → ℝ) :
                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.lpZ = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * H p.2

                      The change of variables, at the product #

                      MIPRE.QLD.sum_shift_gen (in Lines.lean, where the content instance of it lives) needs only a finite sample space, a shift action on it, and a direction the shift does not move. So it applies to a pair of line-point data with the shift acting on the X side only, which is what the product form of the pasting lemma's collision term needs; all that is required here is the action and its three properties.

                      The shift on a pair, and what it leaves alone #

                      def MIPRE.QLD.pairShift {F : Type u_1} [Field F] {m : ℕ} (w : LIDT.Point F m) (p : LPData F m × LPData F m) :
                      LPData F m × LPData F m

                      The shift on a pair of line-point data: move the X side's point, leave the Z side alone.

                      Equations
                      Instances For
                        def MIPRE.QLD.pairDirX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PX : LinePres F m hm Bas.X) (p : LPData F m × LPData F m) :

                        The X line's direction, read off a pair through the content the X side presents.

                        Equations
                        Instances For
                          theorem MIPRE.QLD.ofLPX_pairShift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (w : LIDT.Point F m) (p : LPData F m × LPData F m) :
                          ofLPX (pairShift w p).1 (pairShift w p).2.pt = Content.shiftPt Bas.X w (ofLPX p.1 p.2.pt)

                          Shifting the pair shifts the X side's content, which is what the LinePres invariances are stated about.

                          theorem MIPRE.QLD.ofLPZ_pairShift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (w : LIDT.Point F m) (p : LPData F m × LPData F m) :
                          ofLPZ (pairShift w p).2 (pairShift w p).1.pt = Content.shiftPt Bas.X w (ofLPZ p.2 p.1.pt)

                          The same shift moves the Z side's content only in its other point, which the _other invariances say changes nothing on the Z line.

                          @[simp]
                          theorem MIPRE.QLD.pairShift_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (p : LPData F m × LPData F m) :
                          pairShift 0 p = p
                          theorem MIPRE.QLD.pairShift_add {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (w w' : LIDT.Point F m) (p : LPData F m × LPData F m) :
                          pairShift w' (pairShift w p) = pairShift (w + w') p
                          theorem MIPRE.QLD.pairDirX_shift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PX : LinePres F m hm Bas.X) (p : LPData F m × LPData F m) (w : LIDT.Point F m) :
                          theorem MIPRE.QLD.sum_pair_shift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PX : LinePres F m hm Bas.X) (g : LPData F m × LPData F m → ℝ) :
                          ∑ i : (LPData F m × LPData F m) × F, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * (↑(Fintype.card F))⁻¹ * g (pairShift (i.2 • pairDirX PX i.1) i.1) = ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * g p

                          The change of variables at the product: averaging over pairs is averaging over (pair, shift), the shift moving the X point along the X line.

                          lem:qld-pairs-of-lines, at a product of two independent line-point pairs #

                          pairs_of_lines_gen asks for a content per side and a shift both sides see as a shift of the X point. A pair of line-point data supplies exactly that: each side's content is its own point, seed and raw direction, with the other side's point filled in as the content's other point --- which no quantity of that side's line depends on --- and pairShift moves the X point. So the product form is an instance, with nothing to prove beyond the two rfls below.

                          def MIPRE.QLD.pairCX {F : Type u_1} [Field F] {m : ℕ} (p : LPData F m × LPData F m) :

                          The X-side content a pair of line-point data presents: the X side's own line-point data, with the Z side's point as the content's other point.

                          Equations
                          Instances For
                            def MIPRE.QLD.pairCZ {F : Type u_1} [Field F] {m : ℕ} (p : LPData F m × LPData F m) :

                            The Z-side content. Its seed and raw direction are the Z side's own, independent of the X side's --- which is the whole difference from a single content.

                            Equations
                            Instances For
                              @[simp]
                              theorem MIPRE.QLD.pairDirX_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PX : LinePres F m hm Bas.X) (p : LPData F m × LPData F m) :
                              pairDirX PX p = PX.dir (pairCX p)
                              @[simp]
                              theorem MIPRE.QLD.pairCX_pairShift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (w : LIDT.Point F m) (p : LPData F m × LPData F m) :
                              @[simp]
                              theorem MIPRE.QLD.pairCZ_pairShift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (w : LIDT.Point F m) (p : LPData F m × LPData F m) :

                              The combined point measurement, indexed by the pair of points #

                              lem:qld-combined-points is stated over the Pauli basis test's own contents, and the measurement it produces is indexed by them. Every quantity it is bounded against depends on the content only through its two points, so the same construction runs at the pair of points and gives a measurement that any sample space carrying two points can use --- in particular a pair of line-point data, where the content-indexed version would have to be fed contents with zeroed probes and the averages would not match.

                              theorem MIPRE.QLD.sum_uniform_pts {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] :
                              ∑ _x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ = 1
                              theorem MIPRE.QLD.avg_content_eq_pts {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] (H : LIDT.Point F m → LIDT.Point F m → ℝ) :
                              ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * H c.uX c.uZ = ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * H x.1 x.2

                              A quantity of the two points has the same law under a content as under a uniform pair of points.

                              theorem MIPRE.QLD.combined_points_pts_dilated {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {ε : ℝ} (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) :
                              ∃ (QA : LIDT.Point F m × LIDT.Point F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)) (QB : LIDT.Point F m × LIDT.Point F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) ℬ)), (∀ (x : LIDT.Point F m × LIDT.Point F m), IsPVMIn (QA x)) ∧ (∀ (x : LIDT.Point F m × LIDT.Point F m), IsPVMIn (QB x)) ∧ (∀ (x : LIDT.Point F m × LIDT.Point F m) (p : F × F), QA x p (Sum.inl (0, 0)) (Sum.inl (0, 0)) = sand (hatMats PA Bas.X x.1) (hatMats PA Bas.Z x.2) p) ∧ (∀ (x : LIDT.Point F m × LIDT.Point F m) (p : F × F), QB x p (Sum.inl (0, 0)) (Sum.inl (0, 0)) = sand (hatMats PB Bas.X x.1) (hatMats PB Bas.Z x.2) p) ∧ ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (extHat M).xSqNorm (QA x p) (QB x p) ≤ 2 * deltaQ ε ∧ ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (extHat M).xSqNorm (QA x p) (smulKron (hatMats PB Bas.Z x.2 p.2 * hatMats PB Bas.X x.1 p.1) 1) ≤ 4 * deltaQ ε + 115352832 * ε ∧ ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (extHat M).xSqNorm (QA x p) (smulKron (hatMats PB Bas.X x.1 p.1 * hatMats PB Bas.Z x.2 p.2) 1) ≤ 4 * deltaQ ε + 461411328 * ε

                              lem:qld-combined-points, the dilated measurement, indexed by the pair of points. Verbatim combined_points_dilated with the content replaced by the two points it contributes, which is all four inputs of the joint-measurement construction (BipartiteModel.exists_projective_joint) see: for each pair of points a projective measurement on the model of the dilation (extHat), compressing to the sandwich at |inl (0, 0)⟩, self-consistent and consistent with both ordered products, at the constants of the content-indexed statement.

                              theorem MIPRE.QLD.combined_points_pts {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {ε : ℝ} (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) :
                              1 - ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X x.1) (hatMats PA Bas.Z x.2) p) (sand (hatMats PB Bas.X x.1) (hatMats PB Bas.Z x.2) p) ≤ deltaQ ε ∧ 1 - ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X x.1) (hatMats PA Bas.Z x.2) p) (hatMats PB Bas.Z x.2 p.2 * hatMats PB Bas.X x.1 p.1) ≤ (4 * deltaQ ε + 115352832 * ε) / 2 ∧ 1 - ∑ x : LIDT.Point F m × LIDT.Point F m, (↑(Fintype.card (LIDT.Point F m × LIDT.Point F m)))⁻¹ * ∑ p : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X x.1) (hatMats PA Bas.Z x.2) p) (hatMats PB Bas.X x.1 p.1 * hatMats PB Bas.Z x.2 p.2) ≤ (4 * deltaQ ε + 461411328 * ε) / 2

                              lem:qld-combined-points, indexed by the pair of points, as agreement bounds of the sandwiches in the expanded model: combined_points with the content replaced by the two points it contributes, every quantity there depending on the content only through them (avg_content_eq_pts). The dilated measurement indexed by the pair of points is combined_points_pts_dilated.

                              theorem MIPRE.QLD.pairs_of_lines_prod {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) {QA : LPData F m × LPData F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} (hQA : ∀ (p : LPData F m × LPData F m), IsPVMIn (QA p)) (hM : ‖M.ψ‖ = 1) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) {δ η εc : ℝ} (hmargX : ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * ∑ x : F, (extHat M).xSqNorm (∑ q : F, QA p (x, q)) (smulKron (PX.lineEvalMats d PB (pairCX p) x) 1) ≤ δ) (hmargZ : ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * ∑ b : F, (extHat M).xSqNorm (∑ q : F, QA p (q, b)) (smulKron (PZ.lineEvalMats d PB (pairCZ p) b) 1) ≤ δ) (hselfX : ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * ∑ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm (PX.lineMats d PA (pairCX p) f) (PX.lineMats d PB (pairCX p) f) ≤ η) (hcoll : ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * collProb PX d (pairCX p) ≤ εc) :
                              1 - ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * ∑ r : F × F, (extHat M).bornProb (QA p r) (smulKron (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param (pairCX p)) = r.1 ∧ q.2.eval (PZ.param (pairCZ p)) = r.2, pasteLine PX PZ d PB (pairCX p) (pairCZ p) q) 1) ≤ δ / 2 + √(δ / 2) + √(32 * δ + 4 * √η + 2 * εc)

                              lem:qld-pairs-of-lines, on a product of two independent line-point laws. The instance of pairs_of_lines_gen at kX = pairCX, kZ = pairCZ, sh = pairShift: this is the form lem:qld-padded-lines needs, where the X line and the Z line are drawn independently.

                              The line data of one side factors through that side's line-point data #

                              Every quantity of the X line --- the measurement, the parameter, the collision probability --- reads the content only through its X point, its seed and its raw direction, which is exactly Content.lpX. Saying so once is what lets a content-level bound be read as a bound on the product, through avg_content_eq_pair_X: the two laws agree on quantities of (lpX, uZ), and this is the proof that the quantities in question are of that shape.

                              The hypothesis is the three data a LinePres carries. Both line presentations satisfy it by rfl: dirOf and ddirOf read the seed and the raw direction, the base point is the canonical representative of the side's own point, and Content.question at a line type reads nothing else.

                              def MIPRE.QLD.FactorsX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PX : LinePres F m hm Bas.X) :

                              PX reads the content only through its X line-point data.

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                def MIPRE.QLD.FactorsZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} (PZ : LinePres F m hm Bas.Z) :

                                PZ reads the content only through its Z line-point data.

                                Equations
                                • One or more equations did not get rendered due to their size.
                                Instances For
                                  theorem MIPRE.QLD.factorsX_aPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} :
                                  theorem MIPRE.QLD.factorsX_dPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} :
                                  theorem MIPRE.QLD.factorsZ_aPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} :
                                  theorem MIPRE.QLD.factorsZ_dPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} :
                                  theorem MIPRE.QLD.param_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (c : Content F m) (u : LIDT.Point F m) :
                                  PX.param (ofLPX c.lpX u) = PX.param c
                                  theorem MIPRE.QLD.collProb_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (c : Content F m) (u : LIDT.Point F m) :
                                  collProb PX d (ofLPX c.lpX u) = collProb PX d c
                                  theorem MIPRE.QLD.param_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {PZ : LinePres F m hm Bas.Z} (hfac : FactorsZ PZ) (c : Content F m) (u : LIDT.Point F m) :
                                  PZ.param (ofLPZ c.lpZ u) = PZ.param c
                                  theorem MIPRE.QLD.lineMats_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (c : Content F m) (u : LIDT.Point F m) :
                                  PX.lineMats d S (ofLPX c.lpX u) = PX.lineMats d S c
                                  theorem MIPRE.QLD.lineEvalMats_ofLPX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (c : Content F m) (u : LIDT.Point F m) :
                                  PX.lineEvalMats d S (ofLPX c.lpX u) = PX.lineEvalMats d S c
                                  theorem MIPRE.QLD.lineMats_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PZ : LinePres F m hm Bas.Z} (hfac : FactorsZ PZ) (c : Content F m) (u : LIDT.Point F m) :
                                  PZ.lineMats d S (ofLPZ c.lpZ u) = PZ.lineMats d S c
                                  theorem MIPRE.QLD.lineEvalMats_ofLPZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PZ : LinePres F m hm Bas.Z} (hfac : FactorsZ PZ) (c : Content F m) (u : LIDT.Point F m) :
                                  PZ.lineEvalMats d S (ofLPZ c.lpZ u) = PZ.lineEvalMats d S c

                                  The four bounds, read on the product #

                                  Each is the content-level bound with avg_content_eq_pair_X or avg_content_eq_pair_Z applied and the factoring lemmas used to put the summand in the shape those identities need.

                                  theorem MIPRE.QLD.avg_pair_eq_content_X {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (G : LIDT.Point F m → LIDT.Point F m → (F → Matrix (Anc F m) (Anc F m) R) → ℝ) :
                                  ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * G p.1.pt p.2.pt (PX.lineEvalMats d S (pairCX p)) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * G c.uX c.uZ (PX.lineEvalMats d S c)
                                  theorem MIPRE.QLD.avg_pair_eq_content_Z {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m → POVMIn (Answer F m d) R} {PZ : LinePres F m hm Bas.Z} (hfac : FactorsZ PZ) (G : LIDT.Point F m → LIDT.Point F m → (F → Matrix (Anc F m) (Anc F m) R) → ℝ) :
                                  ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * G p.1.pt p.2.pt (PZ.lineEvalMats d S (pairCZ p)) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * G c.uX c.uZ (PZ.lineEvalMats d S c)
                                  theorem MIPRE.QLD.avg_pair_eq_content_X_self {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) (G : (LIDT.LinePoly F (m * d) → Matrix (Anc F m) (Anc F m) 𝒜) → (LIDT.LinePoly F (m * d) → Matrix (Anc F m) (Anc F m) ℬ) → ℝ) :
                                  ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * G (PX.lineMats d PA (pairCX p)) (PX.lineMats d PB (pairCX p)) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * G (PX.lineMats d PA c) (PX.lineMats d PB c)

                                  The fine self-consistency of the X line measurement involves no point at all, so the transfer is the point-free form of the same identity.

                                  theorem MIPRE.QLD.avg_pair_eq_content_X_collProb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {PX : LinePres F m hm Bas.X} (hfac : FactorsX PX) :
                                  ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * collProb PX d (pairCX p) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * collProb PX d c

                                  The collision probability reads only the direction, so it transfers the same way.

                                  lem:qld-pairs-of-lines on the product, from the game #

                                  The product form of the pasting conclusion, with only game-level hypotheses on the X and Z line presentations. Every input is the content-level one of pairs_of_lines_of_items, read on the product through the four transfer identities above; the combined point measurement is the dilated one indexed by the pair of points (combined_points_pts_dilated), which is what makes the reading possible. As in pairs_of_lines_of_items, the dilation stays inside the proof: the conclusion is an agreement bound of the sandwich in the expanded model.

                                  theorem MIPRE.QLD.pairs_of_lines_prod_of_items {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} [NeZero m] [Algebra (ZMod 2) F] {hm : m ∣ Fintype.card F} {d : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {ε : ℝ} (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (hfacX : FactorsX PX) (hfacZ : FactorsZ PZ) (hX1 : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm (PX.lineMats d PA c f) (PX.lineMats d PB c f) ≤ 172 * ε) (hX2 : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA Bas.X (c.pt Bas.X) a) (PX.lineEvalMats d PB c a) ≤ 172 * ε) (hZ2 : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ b : F, (M.reg (Anc F m)).xSqNorm (hatMats PA Bas.Z (c.pt Bas.Z) b) (PZ.lineEvalMats d PB c b) ≤ 172 * ε) {εc : ℝ} (hcoll : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * collProb PX d c ≤ εc) :
                                  1 - ∑ p : LPData F m × LPData F m, (↑(Fintype.card (LPData F m × LPData F m)))⁻¹ * ∑ r : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X p.1.pt) (hatMats PA Bas.Z p.2.pt) r) (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param (pairCX p)) = r.1 ∧ q.2.eval (PZ.param (pairCZ p)) = r.2, pasteLine PX PZ d PB (pairCX p) (pairCZ p) q) ≤ deltaPairs ε εc