Documentation

MIPRE.Background.QLD.Lines

Pairs of lines #

Blueprint lem:qld-pairs-of-lines, the paper's lem:qld-xz-lines. The combined point measurement of lem:qld-combined-points returns both bases' values at the two sampled points; this stage replaces it by a measurement returning a pair of line polynomials, one per basis, which is what the padding stage can then compare with a low-degree test.

The analytic content is the pasting lemma (MIPRE/Foundations/Pasting.lean). What this file supplies is its four hypotheses at the QLD line measurements, and there are three pieces of bookkeeping in the way.

In a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The strategies are families of projective measurements PA, PB in the players' algebras, the expanded model is M.reg (Anc F m), and the line measurements (LinePres.lineMats) and the pasted line measurement (pasteLine) are elements of the register's matrices over a player's algebra. The pasting lemma is the generic one (BipartiteModel.one_sub_sum_bornProb_pasteJ_le), applied on the model of the dilated joint measurement of combined_points_dilated, which must be projective. The dilation is kept inside the proofs of the consequences from the game: the pasted line measurement does not see the dilation register and the dilated measurement compresses to the sandwich M-hat^{Z,z}_b M-hat^{X,x}_a M-hat^{Z,z}_b (BipartiteModel.jointModel_bornProb), so pairs_of_lines_of_items and qld_pairs_of_lines are agreement bounds of the sandwich against the pasted line measurement in the expanded model M.reg (Anc F m). Every constant is the matrix statement's. On a unit vector ψ : dA × dB → ℂ the statements are read at the tensor-product model BipartiteModel.tensor ψ with the families POVM.toIn.

Line polynomials as polynomials #

LinePoly F n is a coefficient vector, which is what makes the answer alphabets finite types. To count the parameters at which two of them agree one wants Mathlib's Polynomial, and the bridge is one definition and three lemmas.

noncomputable def MIPRE.QLD.toPoly {F : Type u_1} [Field F] {n : ℕ} (f : LIDT.LinePoly F n) :

The polynomial a coefficient vector represents.

Equations
Instances For
    theorem MIPRE.QLD.eval_toPoly {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {n : ℕ} (f : LIDT.LinePoly F n) (t : F) :
    theorem MIPRE.QLD.coeff_toPoly {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {n : ℕ} (f : LIDT.LinePoly F n) (i : Fin (n + 1)) :
    (toPoly f).coeff ↑i = f i
    theorem MIPRE.QLD.card_agree_linePoly_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {n : ℕ} {f g : LIDT.LinePoly F n} (h : f ≠ g) :
    {t : F | f.eval t = g.eval t}.card ≤ n

    Two distinct line polynomials of degree at most n agree at at most n parameters. The collision bound the pasting lemma asks of the outcome map, for the map that evaluates a line polynomial at the parameter of the sampled point.

    The parameter of a shifted point #

    theorem MIPRE.QLD.lineParam_add_smul {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} {w : LIDT.Point F m} (hw : ∃ (j : Fin m), w j ≠ 0) (u₀ x : LIDT.Point F m) (t : F) :
    LIDT.CL.lineParam u₀ w (x + t • w) = LIDT.CL.lineParam u₀ w x + t

    Shifting a point along the direction moves its parameter by the shift.

    theorem MIPRE.QLD.rep_add_smul {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} (w x : LIDT.Point F m) (t : F) :
    LIDT.CL.rep w (x + t • w) = LIDT.CL.rep w x

    The canonical representative does not see a shift along the direction: the shifted point is on the same line.

    Shifting the content's point along its line #

    The pasting lemma's collision term needs the point to be uniform on its line once the line is fixed. The content determines both, so the factorization is produced by shifting: for each fixed shift t the map c |-> c + t . dir(c) on the W-point is a bijection of contents, so averaging over contents and averaging over (c, t) give the same thing; the line data is invariant under it; and the parameter of the point moves by exactly t.

    def MIPRE.QLD.Content.shiftPt {F : Type u_1} [Field F] {m : ℕ} (W : Bas) (w : LIDT.Point F m) (c : Content F m) :

    Adding a vector to the content's W-point, leaving everything else alone.

    Equations
    Instances For
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_s {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
      (shiftPt W w c).s = c.s
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_v {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
      (shiftPt W w c).v = c.v
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_pt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
      (shiftPt W w c).pt W = c.pt W + w
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_pt_X_Z {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (w : LIDT.Point F m) (c : Content F m) :
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_pt_Z_X {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (w : LIDT.Point F m) (c : Content F m) :
      @[simp]
      theorem MIPRE.QLD.Content.shiftPt_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (c : Content F m) :
      shiftPt W 0 c = c
      theorem MIPRE.QLD.Content.shiftPt_shiftPt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w w' : LIDT.Point F m) (c : Content F m) :
      shiftPt W w' (shiftPt W w c) = shiftPt W (w + w') c
      def MIPRE.QLD.Content.shiftAlong {F : Type u_1} [Field F] {m : ℕ} (W : Bas) (dir : Content F m → LIDT.Point F m) (t : F) (c : Content F m) :

      The content shifted along a direction it determines itself.

      Equations
      Instances For
        def MIPRE.QLD.Content.shiftV {F : Type u_1} [Field F] {m : ℕ} (w : LIDT.Point F m) (c : Content F m) :

        Adding a vector to the content's diagonal direction, leaving everything else alone. The other shift the argument needs: it is what makes a degenerate diagonal line rare.

        Equations
        Instances For
          @[simp]
          theorem MIPRE.QLD.Content.shiftV_s {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (w : LIDT.Point F m) (c : Content F m) :
          (shiftV w c).s = c.s
          @[simp]
          theorem MIPRE.QLD.Content.shiftV_v {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (w : LIDT.Point F m) (c : Content F m) :
          (shiftV w c).v = c.v + w
          @[simp]
          theorem MIPRE.QLD.Content.shiftV_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (c : Content F m) :
          shiftV 0 c = c
          theorem MIPRE.QLD.Content.shiftV_shiftV {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (w w' : LIDT.Point F m) (c : Content F m) :
          shiftV w' (shiftV w c) = shiftV (w + w') c
          theorem MIPRE.QLD.bijective_shift {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {α : Type u_2} {V : Type u_3} [AddCommGroup V] [Module F V] {sh : V → α → α} (hzero : ∀ (a : α), sh 0 a = a) (hadd : ∀ (w w' : V) (a : α), sh w' (sh w a) = sh (w + w') a) {dir : α → V} (hdir : ∀ (a : α) (w : V), dir (sh w a) = dir a) (t : F) :
          Function.Bijective fun (a : α) => sh (t • dir a) a

          For each fixed shift, shifting is a bijection of contents. Its inverse shifts by -t, which is where the invariance of the direction is used.

          theorem MIPRE.QLD.sum_shift_gen {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {α : Type u_2} [Fintype α] {V : Type u_3} [AddCommGroup V] [Module F V] {sh : V → α → α} (hzero : ∀ (a : α), sh 0 a = a) (hadd : ∀ (w w' : V) (a : α), sh w' (sh w a) = sh (w + w') a) {dir : α → V} (hdir : ∀ (a : α) (w : V), dir (sh w a) = dir a) (g : α → ℝ) :
          ∑ i : α × F, (↑(Fintype.card α))⁻¹ * (↑(Fintype.card F))⁻¹ * g (sh (i.2 • dir i.1) i.1) = ∑ a : α, (↑(Fintype.card α))⁻¹ * g a

          The change of variables, for an arbitrary finite sample space: averaging a quantity is averaging it over (sample, shift) pairs with the shift applied. Nothing here is about contents --- a finite sample space, a shift action on it, and a direction the shift does not move --- which is what lets the same device serve a product of two independent line-point laws.

          theorem MIPRE.QLD.bijective_shift_gen {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {sh : LIDT.Point F m → Content F m → Content F m} (hzero : ∀ (c : Content F m), sh 0 c = c) (hadd : ∀ (w w' : LIDT.Point F m) (c : Content F m), sh w' (sh w c) = sh (w + w') c) {dir : Content F m → LIDT.Point F m} (hdir : ∀ (c : Content F m) (w : LIDT.Point F m), dir (sh w c) = dir c) (t : F) :
          Function.Bijective fun (c : Content F m) => sh (t • dir c) c

          The change of variables at the content distribution: the instance of sum_shift_gen the Pauli basis test's own question distribution gives.

          theorem MIPRE.QLD.sum_content_shift_gen {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {sh : LIDT.Point F m → Content F m → Content F m} (hzero : ∀ (c : Content F m), sh 0 c = c) (hadd : ∀ (w w' : LIDT.Point F m) (c : Content F m), sh w' (sh w c) = sh (w + w') c) {dir : Content F m → LIDT.Point F m} (hdir : ∀ (c : Content F m) (w : LIDT.Point F m), dir (sh w c) = dir c) (g : Content F m → ℝ) :
          ∑ i : Content F m × F, (↑(Fintype.card (Content F m)))⁻¹ * (↑(Fintype.card F))⁻¹ * g (sh (i.2 • dir i.1) i.1) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * g c

          The change of variables. Averaging a quantity over contents is averaging it over (content, shift) pairs with the shift applied --- the content average is the product of the line average and the uniform average along the direction, without any quotient being formed.

          theorem MIPRE.QLD.sum_content_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) {dir : Content F m → LIDT.Point F m} (hdir : ∀ (c : Content F m) (w : LIDT.Point F m), dir (Content.shiftPt W w c) = dir c) (g : Content F m → ℝ) :
          ∑ i : Content F m × F, (↑(Fintype.card (Content F m)))⁻¹ * (↑(Fintype.card F))⁻¹ * g (Content.shiftAlong W dir i.2 i.1) = ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * g c

          The change of variables for a shift of the W-point.

          What the shift leaves alone #

          The line a content presents --- its question, its base point and its direction --- is invariant under shifting the point along that direction, and so therefore is the line measurement. The point's parameter is the only thing that moves.

          @[simp]
          theorem MIPRE.QLD.Content.shiftPt_pt_other {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          (shiftPt W w c).pt W.other = c.pt W.other
          @[simp]
          theorem MIPRE.QLD.Content.shiftPt_other_pt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          (shiftPt W.other w c).pt W = c.pt W
          theorem MIPRE.QLD.Content.shiftAlong_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (dir : Content F m → LIDT.Point F m) (t : F) (c : Content F m) :
          shiftAlong W dir t c = shiftPt W (t • dir c) c
          theorem MIPRE.QLD.dirOf_shiftPt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          dirOf hm (Content.shiftPt W w c) = dirOf hm c
          theorem MIPRE.QLD.ddirOf_shiftPt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          ddirOf hm (Content.shiftPt W w c) = ddirOf hm c
          theorem MIPRE.QLD.abaseOf_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (t : F) (c : Content F m) :
          abaseOf hm W (Content.shiftAlong W (dirOf hm) t c) = abaseOf hm W c
          theorem MIPRE.QLD.dbaseOf_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (t : F) (c : Content F m) :
          dbaseOf hm W (Content.shiftAlong W (ddirOf hm) t c) = dbaseOf hm W c
          theorem MIPRE.QLD.question_aline_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (t : F) (c : Content F m) :
          theorem MIPRE.QLD.question_dline_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (t : F) (c : Content F m) :
          theorem MIPRE.QLD.question_aline_shiftPt_other {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          theorem MIPRE.QLD.question_dline_shiftPt_other {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (w : LIDT.Point F m) (c : Content F m) :
          theorem MIPRE.QLD.hatLinePOVM_congr {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {n : ℕ} (hm : m ∣ Fintype.card F) (S : Question F m → POVMIn (Answer F m d) R) (W : Bas) (ty : Ty) (base dir : Content F m → LIDT.Point F m) {c c' : Content F m} (hq : Content.question hm c ty = Content.question hm c' ty) (hb : base c = base c') (hd : dir c = dir c') :
          hatLinePOVM n hm S W ty base dir c = hatLinePOVM n hm S W ty base dir c'

          The line measurement depends on the content only through the line.

          The line presentations, and the measurements they carry #

          A line presentation on one side is the question type the line is asked at together with its base point and direction as functions of the content, and the six invariances the shift argument needs: shifting either point along the relevant direction changes neither the direction, nor the base point, nor the question. Both line types of both sides are presentations, and the pairs-of-lines lemma is proved once for any pair of them.

          structure MIPRE.QLD.LinePres (F : Type u_2) [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] (m : ℕ) [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
          Type u_2

          A line presentation: what the content tells a player about the line on side W.

          Instances For
            def MIPRE.QLD.LinePres.param {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) (c : Content F m) :
            F

            The parameter of the sampled point on the line.

            Equations
            Instances For
              theorem MIPRE.QLD.LinePres.param_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) {c : Content F m} (hdeg : ∃ (j : Fin m), P.dir c j ≠ 0) (t : F) :
              P.param (Content.shiftAlong W P.dir t c) = P.param c + t

              The parameter of the shifted point is the parameter plus the shift, when the line is not degenerate.

              noncomputable def MIPRE.QLD.LinePres.lineMats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (c : Content F m) :
              LIDT.LinePoly F (m * d) → Matrix (Anc F m) (Anc F m) R

              The expanded line measurement the presentation carries, as a family of elements of the register's matrices over the player's algebra.

              Equations
              Instances For
                noncomputable def MIPRE.QLD.LinePres.lineEvalMats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (c : Content F m) :
                F → Matrix (Anc F m) (Anc F m) R

                The same measurement, coarse-grained by evaluation at the sampled point's parameter.

                Equations
                Instances For
                  theorem MIPRE.QLD.LinePres.isPVM_lineMats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) {S : Question F m → POVMIn (Answer F m d) R} (hS : ∀ (q : Question F m), IsPVMIn (S q).op) (c : Content F m) :
                  IsPVMIn (P.lineMats d S c)
                  theorem MIPRE.QLD.LinePres.isPVM_lineEvalMats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) {S : Question F m → POVMIn (Answer F m d) R} (hS : ∀ (q : Question F m), IsPVMIn (S q).op) (c : Content F m) :
                  theorem MIPRE.QLD.LinePres.lineEvalMats_eq_fibSum {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (c : Content F m) (a : F) :
                  P.lineEvalMats d S c a = fibSumIn (P.lineMats d S c) (fun (f : LIDT.LinePoly F (m * d)) => f.eval (P.param c)) a

                  The coarse-graining, as a fibre sum --- the shape the pasting lemma states its hypotheses in.

                  theorem MIPRE.QLD.LinePres.lineMats_shiftAlong {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (c : Content F m) (t : F) :
                  P.lineMats d S (Content.shiftAlong W P.dir t c) = P.lineMats d S c

                  The line measurement is invariant under the shift, the presentation's three invariances being exactly what the measurement reads.

                  theorem MIPRE.QLD.LinePres.param_shiftPt_other {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) (c : Content F m) (w : LIDT.Point F m) :
                  theorem MIPRE.QLD.LinePres.lineEvalMats_shiftPt_other {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : LinePres F m hm W) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (c : Content F m) (w : LIDT.Point F m) :

                  The four presentations, and the collision count #

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

                  The axis-parallel line presentation on side W.

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

                    The diagonal line presentation on side W.

                    Equations
                    • One or more equations did not get rendered due to their size.
                    Instances For
                      theorem MIPRE.QLD.aPres_dir_ne_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (c : Content F m) :
                      ∃ (j : Fin m), (aPres hm W).dir c j ≠ 0

                      The axis-parallel direction is never degenerate: it is a standard basis vector.

                      noncomputable def MIPRE.QLD.collProb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) (d : ℕ) (c : Content F m) :

                      The collision probability of a presentation: the fraction of parameters at which two distinct line polynomials of degree at most m d can agree. It is m d / q unless the line is degenerate, and then the outcome map separates nothing.

                      Equations
                      Instances For
                        theorem MIPRE.QLD.collProb_nonneg {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) (d : ℕ) (c : Content F m) :
                        0 ≤ collProb P d c
                        theorem MIPRE.QLD.card_collide_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {W : Bas} (P : LinePres F m hm W) (d : ℕ) (c : Content F m) {f f' : LIDT.LinePoly F (m * d)} (hne : f' ≠ f) :
                        ↑{t : F | f'.eval (P.param (Content.shiftAlong W P.dir t c)) = f.eval (P.param (Content.shiftAlong W P.dir t c))}.card ≤ collProb P d c * ↑(Fintype.card F)

                        The collision count. Two distinct line polynomials agree, along the shifted point's parameter, at at most collProb of the shifts.

                        The two sides, uniformly #

                        Both sides of the pairs-of-lines lemma are proved by the same argument, so the side is a parameter and the (X, Z) outcome pair is read through it.

                        def MIPRE.QLD.valOf {F : Type u_1} (W : Bas) (p : F × F) :
                        F

                        The value of an (X, Z) outcome pair on side W.

                        Equations
                        Instances For
                          def MIPRE.QLD.pairEquiv {F : Type u_1} (W : Bas) :
                          F × F ≃ F × F

                          Reading an (X, Z) outcome pair as (this side, the other side).

                          Equations
                          Instances For
                            @[simp]
                            theorem MIPRE.QLD.valOf_pairEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] (W : Bas) (r : F × F) :
                            valOf W ((pairEquiv W) r) = r.1
                            @[simp]
                            theorem MIPRE.QLD.valOf_other_pairEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] (W : Bas) (r : F × F) :
                            valOf W.other ((pairEquiv W) r) = r.2

                            Operators with an inert register #

                            The joint point measurement of lem:qld-combined-points lives on each player's algebra enlarged by one dilation register; the line measurements do not see that register, so they enter the enlarged model as X ⊗ 1 (smulKron X 1). Three facts about such operators are all that is needed: projectivity survives, coarse-graining commutes with the embedding, and so does the pasted sandwich.

                            theorem MIPRE.QLD.isPVMIn_smulKron_one_right {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} [Fintype α] [DecidableEq α] [StarRing R] {ι : Type u_3} [Fintype ι] {P : ι → R} (hP : IsPVMIn P) :
                            IsPVMIn fun (i : ι) => smulKron (P i) 1

                            A projective measurement with an inert register is projective.

                            theorem MIPRE.QLD.fibSum_aOp {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} [Fintype α] [DecidableEq α] {ι : Type u_3} {κ : Type u_4} [Fintype ι] [DecidableEq κ] (G : ι → R) (e : ι → κ) (k : κ) :
                            fibSumIn (fun (i : ι) => smulKron (G i) 1) e k = smulKron (fibSumIn G e k) 1

                            Coarse-graining commutes with adjoining an inert register.

                            theorem MIPRE.QLD.pasteJ_smulKron_one {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} [Fintype α] [DecidableEq α] {R1 : Type u_3} {R2 : Type u_4} {K : Type u_5} [DecidableEq R2] [Fintype K] (Rf : R1 → R) (G : K → R) (e : K → R2) (p : R1 × R2) :
                            pasteJ (fun (a : R1) => smulKron (Rf a) 1) (fun (g : K) => smulKron (G g) 1) e p = smulKron (pasteJ Rf G e p) 1

                            The pasted sandwich of two families with an inert register is the pasted sandwich of the families, with the register adjoined.

                            theorem MIPRE.QLD.xSqNorm_le_two_mul_add {𝒞' : Type u_1} {𝒜' : Type u_2} {ℬ' : Type u_3} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] (N : BipartiteModel 𝒞' 𝒜' ℬ') (a : 𝒜') (b₁ b₂ : ℬ') :
                            N.xSqNorm a b₂ ≤ 2 * N.xSqNorm a b₁ + 2 * N.swap.stateSqNorm (b₁ - b₂)

                            A cross-party deviation through the second player's state norm, in any bipartite model: the model form of the matrix xSqNorm_le_of_stateVecB.

                            The model of the dilated joint measurement #

                            @[reducible, inline]
                            noncomputable abbrev MIPRE.QLD.extHat {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : ℕ} {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) :
                            BipartiteModel (Matrix ((F × F ⊕ F × F) × (F × F ⊕ F × F)) ((F × F ⊕ F × F) × (F × F ⊕ F × F)) (Matrix (Anc F m × Anc F m) (Anc F m × Anc F m) 𝒞)) (Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)) (Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) ℬ))

                            The model the dilated joint point measurement acts on: the expanded model M.reg (Anc F m) with one dilation register (F × F) ⊕ (F × F) adjoined to each player, in the basis state |inl (0, 0)⟩ (BipartiteModel.jointModel). The model form of the matrix route's twice-extended expanded state.

                            Equations
                            Instances For

                              The hypotheses of the pasting lemma, at the line measurements #

                              @[simp]
                              theorem MIPRE.QLD.aPres_ty {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (aPres hm W).ty = Ty.aline W
                              @[simp]
                              theorem MIPRE.QLD.aPres_base {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (aPres hm W).base = abaseOf hm W
                              @[simp]
                              theorem MIPRE.QLD.aPres_dir {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (aPres hm W).dir = dirOf hm
                              @[simp]
                              theorem MIPRE.QLD.dPres_ty {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (dPres hm W).ty = Ty.dline W
                              @[simp]
                              theorem MIPRE.QLD.dPres_base {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (dPres hm W).base = dbaseOf hm W
                              @[simp]
                              theorem MIPRE.QLD.dPres_dir {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) :
                              (dPres hm W).dir = ddirOf hm
                              theorem MIPRE.QLD.sum_content_normSq_point_line_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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {ε : ℝ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (W : Bas) (P : LinePres F m hm W) (hpt : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA W (c.pt W) a) (hatMats PB W (c.pt W) a) ≤ 172 * ε) (hline : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA W (c.pt W) a) (P.lineEvalMats d PB c a) ≤ 172 * ε) :
                              ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).swap.stateSqNorm (hatMats PB W (c.pt W) a - P.lineEvalMats d PB c a) ≤ 2 * (172 * ε) + 2 * (172 * ε)

                              Bob's point measurement against Bob's own line measurement. Alice's point measurement is the bridge: her copy is consistent with both --- with Bob's point measurement by the expansion stage's self-consistency, with Bob's line measurement by its consistency with the points --- so a triangle inequality gives the same-side bound at four times the input.

                              theorem MIPRE.QLD.sum_xSqNorm_marg_point_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 ℬ] {M : BipartiteModel 𝒞 𝒜 ℬ} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ ℬ] [StarProper ℬ] (W : Bas) (c : Content F m) {QA : Content F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} (hQA : ∀ (c : Content F m), IsPVMIn (QA c)) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) :
                              ∑ a : F, (extHat M).xSqNorm (∑ q : F, QA c ((pairEquiv W) (a, q))) (smulKron (hatMats PB W (c.pt W) a) 1) ≤ 10 * ∑ p : F × F, (extHat M).xSqNorm (QA c p) (smulKron (hatMats PB W.other (c.pt W.other) (valOf W.other p) * hatMats PB W (c.pt W) (valOf W p)) 1)

                              The marginal step at the QLD point measurements, at one content: the joint measurement's W-marginal is consistent with Bob's W-point measurement, on the model of the dilation, where Bob's operators carry an inert dilation register.

                              theorem MIPRE.QLD.sum_xSqNorm_marg_line_le_aux {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ ℬ] [StarProper ℬ] (W : Bas) (P : LinePres F m hm W) (c : Content F m) {QA : Content F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} :
                              ∑ a : F, (extHat M).xSqNorm (∑ q : F, QA c ((pairEquiv W) (a, q))) (smulKron (P.lineEvalMats d PB c a) 1) ≤ 2 * ∑ a : F, (extHat M).xSqNorm (∑ q : F, QA c ((pairEquiv W) (a, q))) (smulKron (hatMats PB W (c.pt W) a) 1) + 2 * ∑ a : F, (M.reg (Anc F m)).swap.stateSqNorm (hatMats PB W (c.pt W) a - P.lineEvalMats d PB c a)

                              Replacing Bob's point measurement by his line measurement, at one content: one triangle inequality on the model of the dilation, and the same-side deviation read back on the expanded model, the dilation register being inert.

                              theorem MIPRE.QLD.sum_content_marg_line_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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ ℬ] [StarProper ℬ] (W : Bas) (P : LinePres F m hm W) {κ η : ℝ} {QA : Content F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} (hQA : ∀ (c : Content F m), IsPVMIn (QA c)) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) (hord : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ p : F × F, (extHat M).xSqNorm (QA c p) (smulKron (hatMats PB W.other (c.pt W.other) (valOf W.other p) * hatMats PB W (c.pt W) (valOf W p)) 1) ≤ κ) (hptline : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).swap.stateSqNorm (hatMats PB W (c.pt W) a - P.lineEvalMats d PB c a) ≤ η) :
                              ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (extHat M).xSqNorm (∑ q : F, QA c ((pairEquiv W) (a, q))) (smulKron (P.lineEvalMats d PB c a) 1) ≤ 2 * (10 * κ) + 2 * η

                              The joint measurement's marginal against the line measurement, on average over the content.

                              The pasted line measurement #

                              noncomputable def MIPRE.QLD.pasteLine {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (cX cZ : Content F m) (q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d)) :
                              Matrix (Anc F m) (Anc F m) R

                              The pasted line measurement T^{l_X, l_Z}_{f_X, f_Z}: a player's X-line measurement sandwiching the same player's Z-line measurement, in the register's matrices over the player's algebra.

                              The two lines are read off two contents, one per side. On the Pauli basis test's own question distribution they are the same content, which is how lem:qld-pairs-of-lines uses this; the combining stage needs them independent, and then they are not. Nothing in the pasting lemma forces them to agree --- none of its hypotheses involves both lines --- which is why one definition serves both.

                              Equations
                              Instances For
                                theorem MIPRE.QLD.pasteJ_eq_pasteLine {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {hm : m ∣ Fintype.card F} {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (d : ℕ) (S : Question F m → POVMIn (Answer F m d) R) (cX cZ : Content F m) (p : F × F) :
                                pasteJ (PZ.lineEvalMats d S cZ) (PX.lineMats d S cX) (fun (f : LIDT.LinePoly F (m * d)) => f.eval (PX.param cX)) p = ∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param cX) = p.2 ∧ q.2.eval (PZ.param cZ) = p.1, pasteLine PX PZ d S cX cZ q

                                The pasted family, coarse-grained by the two evaluations, is the pasting lemma's sandwich. Only the distributivity of the sandwich over the inner family's fibre, and the regrouping of a pair of fibres into a fibre of pairs.

                                The lemma #

                                theorem MIPRE.QLD.pairs_of_lines_gen {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {ι : Type u_5} [Fintype ι] [Nonempty ι] (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (kX kZ : ι → Content F m) {sh : LIDT.Point F m → ι → ι} (hzero : ∀ (a : ι), sh 0 a = a) (hadd : ∀ (w w' : LIDT.Point F m) (a : ι), sh w' (sh w a) = sh (w + w') a) (hkX : ∀ (w : LIDT.Point F m) (a : ι), kX (sh w a) = Content.shiftPt Bas.X w (kX a)) (hkZ : ∀ (w : LIDT.Point F m) (a : ι), kZ (sh w a) = Content.shiftPt Bas.X w (kZ a)) {QA : ι → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} (hQA : ∀ (a : ι), IsPVMIn (QA a)) (hM : ‖M.ψ‖ = 1) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) {δ η εc : ℝ} (hmargX : ∑ a : ι, (↑(Fintype.card ι))⁻¹ * ∑ x : F, (extHat M).xSqNorm (∑ q : F, QA a (x, q)) (smulKron (PX.lineEvalMats d PB (kX a) x) 1) ≤ δ) (hmargZ : ∑ a : ι, (↑(Fintype.card ι))⁻¹ * ∑ b : F, (extHat M).xSqNorm (∑ q : F, QA a (q, b)) (smulKron (PZ.lineEvalMats d PB (kZ a) b) 1) ≤ δ) (hselfX : ∑ a : ι, (↑(Fintype.card ι))⁻¹ * ∑ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm (PX.lineMats d PA (kX a) f) (PX.lineMats d PB (kX a) f) ≤ η) (hcoll : ∑ a : ι, (↑(Fintype.card ι))⁻¹ * collProb PX d (kX a) ≤ εc) :
                                1 - ∑ a : ι, (↑(Fintype.card ι))⁻¹ * ∑ p : F × F, (extHat M).bornProb (QA a p) (smulKron (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param (kX a)) = p.1 ∧ q.2.eval (PZ.param (kZ a)) = p.2, pasteLine PX PZ d PB (kX a) (kZ a) q) 1) ≤ δ / 2 + √(δ / 2) + √(32 * δ + 4 * √η + 2 * εc)

                                lem:qld-pairs-of-lines, over an arbitrary question distribution. The sample space is any finite nonempty iota carrying a content for each side --- kX presenting the X line, kZ the Z line --- together with a shift that moves the X point and that both contents see as such. Alice's joint point measurement, a projective measurement on the model of the dilation, agrees with the pasted line measurement (with an inert dilation register), coarse-grained by evaluating each line polynomial at the parameter of the point of its own side, up to delta/2 + sqrt(delta/2) + sqrt(32 delta + 4 sqrt(eta) + 2 eps_c).

                                The three inputs are the two marginal consistencies, the X-line measurement's cross-party self-consistency at the fine level (on the expanded model, the dilation register being inert), and the average collision probability of the X-side outcome map --- and the shift is what turns the question distribution into the product the collision bound needs.

                                Why two contents, and why nothing forces them to agree. Each of the pasting lemma's hypotheses involves one line and the two points; none involves both lines. So the X line may be read off one content and the Z line off another, and the two need share nothing. At kX = kZ = id this is pairs_of_lines, on the Pauli basis test's own distribution, where they are the same content and the two lines are therefore dependent; at a pair of line-point data it is the product form lem:qld-padded-lines needs, where they are independent.

                                theorem MIPRE.QLD.pairs_of_lines {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) {QA : Content F m → F × F → Matrix (F × F ⊕ F × F) (F × F ⊕ F × F) (Matrix (Anc F m) (Anc F m) 𝒜)} (hQA : ∀ (c : Content F m), IsPVMIn (QA c)) (hM : ‖M.ψ‖ = 1) (hPA : ∀ (q : Question F m), IsPVMIn (PA q).op) (hPB : ∀ (q : Question F m), IsPVMIn (PB q).op) {δ η εc : ℝ} (hmargX : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (extHat M).xSqNorm (∑ q : F, QA c (a, q)) (smulKron (PX.lineEvalMats d PB c a) 1) ≤ δ) (hmargZ : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ b : F, (extHat M).xSqNorm (∑ q : F, QA c (q, b)) (smulKron (PZ.lineEvalMats d PB c b) 1) ≤ δ) (hselfX : ∑ 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) ≤ η) (hcoll : ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * collProb PX d c ≤ εc) :
                                1 - ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ p : F × F, (extHat M).bornProb (QA c p) (smulKron (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param c) = p.1 ∧ q.2.eval (PZ.param c) = p.2, pasteLine PX PZ d PB c c q) 1) ≤ δ / 2 + √(δ / 2) + √(32 * δ + 4 * √η + 2 * εc)

                                lem:qld-pairs-of-lines, on the Pauli basis test's own question distribution: the instance of pairs_of_lines_gen at one content per sample, the same one on both sides.

                                The lemma, from the game #

                                noncomputable def MIPRE.QLD.kappaPairs (ε : ℝ) :

                                The larger of the two ordered-product constants of lem:qld-combined-points.

                                Equations
                                Instances For
                                  noncomputable def MIPRE.QLD.deltaPairsD (ε : ℝ) :

                                  The marginal consistency the pasting lemma is fed.

                                  Equations
                                  Instances For
                                    noncomputable def MIPRE.QLD.deltaPairs (ε εc : ℝ) :

                                    The error of lem:qld-pairs-of-lines, the paper's delta_P: poly(eps, eps_c) with eps_c the average collision probability of the outcome map, which for an axis-parallel line is m d / q.

                                    Equations
                                    Instances For
                                      theorem MIPRE.QLD.pairs_of_lines_of_items {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {ε : ℝ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (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) (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 - ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ p : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X c.uX) (hatMats PA Bas.Z c.uZ) p) (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval (PX.param c) = p.1 ∧ q.2.eval (PZ.param c) = p.2, pasteLine PX PZ d PB c c q) ≤ deltaPairs ε εc

                                      lem:qld-pairs-of-lines, from the game: a winning strategy's combined point measurement agrees with the pasted line measurement of any pair of line presentations, up to deltaPairs. The three inputs are the two items of lem:qld-expanded-lines on the X side, its second item on the Z side, and the average collision probability.

                                      The combined point measurement is the dilated one of combined_points_dilated, projective on the model of the dilation, which is what the pasting lemma needs; its compression to the expanded model is the sandwich M-hat^{Z,z}_b M-hat^{X,x}_a M-hat^{Z,z}_b, and the pasted line measurement does not see the dilation register (BipartiteModel.jointModel_bornProb), so the conclusion is an agreement bound of the sandwich in the expanded model M.reg (Anc F m), with the dilation kept inside the proof.

                                      theorem MIPRE.QLD.sum_content_degenerate_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) :
                                      (∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * if ∃ (j : Fin m), ddirOf hm c j ≠ 0 then 0 else 1) ≤ (↑(Fintype.card F))⁻¹

                                      A degenerate diagonal line is rare. Shifting the content's raw direction along the seed's own pivot coordinate moves the diagonal direction's pivot coordinate by the shift, so at most one shift in q makes that direction vanish --- and the same change of variables that produced the point's uniformity on its line gives the bound.

                                      theorem MIPRE.QLD.sum_content_collProb_dPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (d : ℕ) :
                                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * collProb (dPres hm W) d c ≤ ↑m * ↑d / ↑(Fintype.card F) + (↑(Fintype.card F))⁻¹

                                      The diagonal collision probability: m d / q on the non-degenerate lines, and the degenerate ones contribute at most another 1/q.

                                      theorem MIPRE.QLD.sum_content_collProb_aPres {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (hm : m ∣ Fintype.card F) (W : Bas) (d : ℕ) :
                                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * collProb (aPres hm W) d c = ↑m * ↑d / ↑(Fintype.card F)

                                      The axis-parallel collision probability is m d / q, the direction being a standard basis vector and so never degenerate.

                                      The items of lem:qld-expanded-lines, in the shape the assembly wants #

                                      theorem MIPRE.QLD.aPres_items {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {ε : ℝ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (hd : 1 ≤ d) (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (W : Bas) :
                                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm ((aPres hm W).lineMats d PA c f) ((aPres hm W).lineMats d PB c f) ≤ 172 * ε ∧ ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA W (c.pt W) a) ((aPres hm W).lineEvalMats d PB c a) ≤ 172 * ε

                                      The two items for an axis-parallel presentation.

                                      theorem MIPRE.QLD.dPres_items {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {ε : ℝ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (hd : 1 ≤ d) (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (W : Bas) :
                                      ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm ((dPres hm W).lineMats d PA c f) ((dPres hm W).lineMats d PB c f) ≤ 172 * ε ∧ ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA W (c.pt W) a) ((dPres hm W).lineEvalMats d PB c a) ≤ 172 * ε

                                      The two items for a diagonal presentation.

                                      theorem MIPRE.QLD.qld_pairs_of_lines {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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {ε : ℝ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] (hd : 1 ≤ 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 - ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ p : F × F, (M.reg (Anc F m)).bornProb (sand (hatMats PA Bas.X c.uX) (hatMats PA Bas.Z c.uZ) p) (∑ q : LIDT.LinePoly F (m * d) × LIDT.LinePoly F (m * d) with q.1.eval ((aPres hm Bas.X).param c) = p.1 ∧ q.2.eval ((aPres hm Bas.Z).param c) = p.2, pasteLine (aPres hm Bas.X) (aPres hm Bas.Z) d PB c c q) ≤ deltaPairs ε (↑m * ↑d / ↑(Fintype.card F))

                                      lem:qld-pairs-of-lines at the axis-parallel line of each side, with every input discharged from the game: for a projective strategy that wins the Pauli basis test with probability 1 - eps, the sandwich of its expanded point measurements --- the compression of the combined point measurement --- agrees with the pasted line measurement at deltaPairs eps (m d / q).

                                      The other three pairs of line types are the same three lines of proof, with dPres_items in place of aPres_items on the side that changes and sum_content_collProb_dPres in place of sum_content_collProb_aPres when the X side is the diagonal one.