Documentation

MIPRE.Background.QLD.Expanded

The expansion stage: the hatted point observables #

Blueprint lem:qld-expanded-points, the commutation half. The expansion adjoins |EPR_q>^{(x) M} to each player and replaces the point observable by

  W-hat^r(u) = W^r(u) (x) tau^W(r . ind_m(u)) ,

the strategy's own observable tensored with a generalized Pauli on the ancilla. The point of doing so is a single exact cancellation:

So the hatted observables commute up to nothing at all: the two signs multiply to one, and what is left is the strategy's error with no sign in it. Without the ancillas the two bases would only commute up to an error carrying (-1)^gamma, which does not improve with eps.

What makes it cheap #

Three facts, none of them about the Pauli test. The ancilla operator that survives the cancellation is unitary, so it is invisible to the state-norm (BipartiteModel.stateNorm_mul_of_isometry); what is left has an inert ancilla, so it has the same norm on the expanded state as on the original one (BipartiteModel.stateSqNorm_expand_smulKron_one); and the ancilla state is a unit vector (Introspection.registerEPR_norm). The expansion therefore costs exactly the constant of lem:qld-obs-commutation and nothing more.

In a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The strategy is a model M : BipartiteModel ๐’ž ๐’œ โ„ฌ with โ€–M.ฯˆโ€– = 1 and two families of POVMs in the players' ordered algebras, and the expanded state ฯˆ โŠ— |EPR> of the matrix route is the register model M.reg (Anc F m) (MIPRE/Foundations/Introspection/RegisterModel.lean): the EPR register on Anc F m, one half (A') held by the first player, whose operators become the matrices Matrix (Anc F m) (Anc F m) ๐’œ, and the other (A'') by the second, Matrix (Anc F m) (Anc F m) โ„ฌ. A strategy's operator X tensored with an ancilla matrix P is smulKron X P (register outer), so the hatted observable is smulKron (ptObs โ€ฆ) (weylOf โ€ฆ) and the hatted measurements are convolutions of the strategy's POVM with the ancilla's syndrome measurement, POVMs in the register's matrices (kronIn, then POVMIn.map). The Born probability of a product measurement factorizes (BipartiteModel.bornProb_expand_smulKron), and the ancilla's factor is the matrix computation on the EPR vector it was before (sum_bornProb_epr_synOfPOVM), so every constant is kept. On a unit vector ฯˆ : dA ร— dB โ†’ โ„‚ the statements are read at the tensor-product model BipartiteModel.tensor ฯˆ with the families POVM.toIn.

The ancilla #

@[reducible, inline]
abbrev MIPRE.QLD.Anc (F : Type u_5) (m : โ„•) :
Type u_5

The ancilla register: (C^q)^{(x) M} with M = 2^m, indexed by F_q^M --- that is, by the functions the low-degree encoding of def:ld-encoding already uses.

Equations
Instances For
    noncomputable def MIPRE.QLD.weylOf {F : Type u_1} [Field F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} :
    Bas โ†’ Anc F m โ†’ Matrix (Anc F m) (Anc F m) โ„‚

    The Weyl family of a basis.

    Equations
    Instances For
      noncomputable def MIPRE.QLD.ancVec {F : Type u_1} [Field F] {m : โ„•} (ฯ‰ : Omega F m) (W : Bas) :
      Anc F m

      The ancilla vector the expansion attaches to a point question: r_W . ind_m(u_W).

      Equations
      Instances For
        theorem MIPRE.QLD.gam_eq_trDot {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (ฯ‰ : Omega F m) :
        gam ฯ‰ = Weyl.trDot (ancVec ฯ‰ Bas.X) (ancVec ฯ‰ Bas.Z)

        The test's sign is the Weyl form of the two ancilla vectors. This is the identity the cancellation runs on, and it is why the two signs are the same sign.

        theorem MIPRE.QLD.weylOf_isUnitary {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (a : Anc F m) :

        The product that survives the cancellation is unitary.

        The hatted observables and the expanded state #

        noncomputable def MIPRE.QLD.hatObs {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [PartialOrder R] [StarOrderedRing R] (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (W : Bas) (c : Content F m) :
        Matrix (Anc F m) (Anc F m) R

        The hatted point observable W-hat^r(u) = W^r(u) (x) tau^W(r . ind_m(u)): the strategy's observable, an element of the player's algebra R, tensored with the ancilla's generalized Pauli, as a matrix over R on the ancilla register (register outer).

        Equations
        Instances For
          theorem MIPRE.QLD.hatVec_unit {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [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 ๐’ž ๐’œ โ„ฌ} (hM : โ€–M.ฯˆโ€– = 1) :

          The expanded state is a unit vector when the strategy's is: the state of the register model M.reg (Anc F m) is ฯˆ โŠ— |EPR>, the model form of the matrix route's hatVec ฯˆ.

          The cancellation #

          theorem MIPRE.QLD.hatObs_comm_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [PartialOrder R] [StarOrderedRing R] (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (c : Content F m) :

          The two signs cancel. The commutator of the hatted observables is the signed commutator of the strategy's, tensored with a unitary: the ancilla's twisted commutation contributes exactly the sign (-1)^{gamma(omega)} that the strategy's carries.

          theorem MIPRE.QLD.norm_hatVec_hatObs_comm {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 โ„ฌ] [StarModule โ„‚ ๐’œ] (hm : m โˆฃ Fintype.card F) (PA : Question F m โ†’ POVMIn (Answer F m d) ๐’œ) (M : BipartiteModel ๐’ž ๐’œ โ„ฌ) (c : Content F m) :
          (M.reg (Anc F m)).stateSqNorm (hatObs hm PA Bas.X c * hatObs hm PA Bas.Z c - hatObs hm PA Bas.Z c * hatObs hm PA Bas.X c) = M.stateSqNorm (ptObs hm PA Bas.X c * ptObs hm PA Bas.Z c - sgn (gam c.omega) โ€ข (ptObs hm PA Bas.Z c * ptObs hm PA Bas.X c))

          The hatted observables commute on the expanded state, with no sign, at exactly the constant of lem:qld-obs-commutation: the state norm of their commutator on the register model is the state norm of the strategy's signed commutator on the model.

          theorem MIPRE.QLD.hatObs_commutation {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 โ„ฌ] [StarModule โ„‚ ๐’œ] {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) โ„ฌ} {ฮต : โ„} (hM : โ€–M.ฯˆโ€– = 1) (hPA : โˆ€ (q : Question F m), IsPVMIn (PA q).op) (hfail : 1 - M.povmValue (qldGame hm) PA PB โ‰ค ฮต) :
          โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * (M.reg (Anc F m)).stateSqNorm (hatObs hm PA Bas.X c * hatObs hm PA Bas.Z c - hatObs hm PA Bas.Z c * hatObs hm PA Bas.X c) โ‰ค 57676416 * ฮต

          The commutation half of lem:qld-expanded-points. On the expanded state the X-side and Z-side hatted point observables commute --- with no sign, on average over the verifier's content, at the constant of lem:qld-obs-commutation. The sign the strategy carries is cancelled identically by the one the ancilla carries. The first player's measurements are projective, as signed_commutation needs.

          The hatted measurements, and their self-consistency #

          The other item of lem:qld-expanded-points. The hatted measurement is the convolution of the strategy's point measurement with the ancilla's syndrome measurement: the product measurement, coarse-grained by addition of the two field elements. Its self-consistency across the re-bipartitioned parties comes from three things, and nothing else:

          So the whole estimate runs through Born probabilities and is converted to the distance exactly once, at the end, by BipartiteModel.xSqNorm_sum_le_two_mul.

          noncomputable def MIPRE.QLD.synOfPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {C : Type u_5} [Fintype C] [DecidableEq C] (W : Bas) (ฯ† : Anc F m โ†’ C) :
          POVM C (Anc F m)

          The ancilla's basis measurement, coarse-grained by an arbitrary label. Measuring all M qudits in the basis W gives an outcome h; this measurement reports ฯ† h instead. At ฯ† h = โŸจh, ind_m(u)โŸฉ it is the syndrome measurement of a point question, and at ``the restriction of g_h to a line'' it is the line measurement of the expansion stage.

          Equations
          Instances For
            theorem MIPRE.QLD.synOfPOVM_mats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {C : Type u_5} [Fintype C] [DecidableEq C] (W : Bas) (ฯ† : Anc F m โ†’ C) (o : C) :
            โ†‘((synOfPOVM W ฯ†).mats o) = Weyl.synOf (weylOf W) ฯ† o
            theorem MIPRE.QLD.isPVM_synOfPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {C : Type u_5} [Fintype C] [DecidableEq C] (W : Bas) (ฯ† : Anc F m โ†’ C) :
            IsPVM fun (o : C) => โ†‘((synOfPOVM W ฯ†).mats o)

            The coarse-grained basis measurement is projective.

            noncomputable def MIPRE.QLD.synPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (u : LIDT.Point F m) :
            POVM F (Anc F m)

            The syndrome measurement of the ancilla at a point question, as a POVM.

            Equations
            Instances For
              theorem MIPRE.QLD.synPOVM_mats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (u : LIDT.Point F m) (a : F) :
              โ†‘((synPOVM W u).mats a) = Weyl.syn (weylOf W) (LowDegree.indVec u) a
              theorem MIPRE.QLD.isPVM_synPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (u : LIDT.Point F m) :
              IsPVM fun (a : F) => โ†‘((synPOVM W u).mats a)

              The syndrome measurement is projective.

              theorem MIPRE.QLD.weylOf_transpose {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (a : Anc F m) :
              theorem MIPRE.QLD.sum_bornProb_epr_synOfPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {C : Type u_5} [Fintype C] [DecidableEq C] (W : Bas) (ฯ† : Anc F m โ†’ C) :
              โˆ‘ o : C, bornProb Weyl.epr โ†‘((synOfPOVM W ฯ†).mats o) โ†‘((synOfPOVM W ฯ†).mats o) = 1

              The coarse-grained basis measurement is perfectly self-consistent on the maximally entangled state. This is the EPR stabilizer relation at the Born level, and it is the 1 that the expansion contributes to every agreement probability --- exactly 1, not 1 - O(eps).

              theorem MIPRE.QLD.sum_bornProb_epr_synPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (W : Bas) (u : LIDT.Point F m) :
              โˆ‘ a : F, bornProb Weyl.epr โ†‘((synPOVM W u).mats a) โ†‘((synPOVM W u).mats a) = 1

              The syndrome measurement is perfectly self-consistent on the maximally entangled state.

              A POVM of the player times a projective measurement of the register #

              def MIPRE.QLD.kronIn {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {ฮน : Type u_6} {ฮบ : Type u_7} {ฮฑ : Type u_8} [Fintype ฮน] [Fintype ฮบ] [Fintype ฮฑ] [DecidableEq ฮฑ] (P : POVMIn ฮน R) (Q : POVM ฮบ ฮฑ) (hQ : IsPVM fun (k : ฮบ) => โ†‘(Q.mats k)) :
              POVMIn (ฮน ร— ฮบ) (Matrix ฮฑ ฮฑ R)

              A POVM in a player's algebra times a projective measurement of a register, as a POVM in the register's matrices over the algebra (register outer): the element at (i, k) is smulKron (P.op i) Q_k. The model form of POVM.kron when the second factor is a projective measurement of a finite register; its elements are then projections, which is what makes the products nonnegative in the order of the matrices over R (smulKron_nonneg_of_proj).

              Equations
              Instances For
                theorem MIPRE.QLD.kronIn_op {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {ฮน : Type u_6} {ฮบ : Type u_7} {ฮฑ : Type u_8} [Fintype ฮน] [Fintype ฮบ] [Fintype ฮฑ] [DecidableEq ฮฑ] (P : POVMIn ฮน R) (Q : POVM ฮบ ฮฑ) (hQ : IsPVM fun (k : ฮบ) => โ†‘(Q.mats k)) (p : ฮน ร— ฮบ) :
                (kronIn P Q hQ).op p = smulKron (P.op p.1) โ†‘(Q.mats p.2)
                theorem MIPRE.QLD.isPVMIn_kronIn {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {ฮน : Type u_6} {ฮบ : Type u_7} {ฮฑ : Type u_8} [Fintype ฮน] [Fintype ฮบ] [Fintype ฮฑ] [DecidableEq ฮฑ] {P : POVMIn ฮน R} (hP : IsPVMIn P.op) (Q : POVM ฮบ ฮฑ) (hQ : IsPVM fun (k : ฮบ) => โ†‘(Q.mats k)) :
                IsPVMIn (kronIn P Q hQ).op

                A product of projective measurements is projective.

                theorem MIPRE.QLD.kronIn_congr {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {ฮน : Type u_6} {ฮบ : Type u_7} {ฮฑ : Type u_8} [Fintype ฮน] [Fintype ฮบ] [Fintype ฮฑ] [DecidableEq ฮฑ] (P : POVMIn ฮน R) {Q Q' : POVM ฮบ ฮฑ} (h : Q = Q') (hQ : IsPVM fun (k : ฮบ) => โ†‘(Q.mats k)) (hQ' : IsPVM fun (k : ฮบ) => โ†‘(Q'.mats k)) :
                kronIn P Q hQ = kronIn P Q' hQ'

                The product depends on the register's measurement only through its elements.

                theorem MIPRE.QLD.kronIn_map {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {ฮน : Type u_6} {ฮบ : Type u_7} {ฮฑ : Type u_8} [Fintype ฮน] [Fintype ฮบ] [Fintype ฮฑ] [DecidableEq ฮฑ] {ฮน' : Type u_9} {ฮบ' : Type u_10} [Fintype ฮน'] [DecidableEq ฮน'] [Fintype ฮบ'] [DecidableEq ฮบ'] (P : POVMIn ฮน R) (Q : POVM ฮบ ฮฑ) (hQ : IsPVM fun (k : ฮบ) => โ†‘(Q.mats k)) (f : ฮน โ†’ ฮน') (g : ฮบ โ†’ ฮบ') (hQ' : IsPVM fun (k : ฮบ') => โ†‘((POVM.map g Q).mats k)) :
                kronIn (POVMIn.map f P) (POVM.map g Q) hQ' = POVMIn.map (fun (p : ฮน ร— ฮบ) => (f p.1, g p.2)) (kronIn P Q hQ)

                Relabelling the two factors is relabelling the product.

                The hatted measurement #

                noncomputable def MIPRE.QLD.ptValPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (W : Bas) (c : Content F m) :
                POVMIn F R

                The point measurement read as a field element --- the same definition for either player.

                Equations
                Instances For
                  noncomputable def MIPRE.QLD.hatPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (W : Bas) (c : Content F m) :
                  POVMIn F (Matrix (Anc F m) (Anc F m) R)

                  The hatted point measurement: the product of the strategy's point measurement with the ancilla's syndrome measurement, coarse-grained by adding the two field elements. That convolution is the paper's M-hat^{(Point,W),u}_a = sum_{a' + a'' = a} M_{a'} (x) tau^{W,u}_{a''}, a POVM in the register's matrices over the player's algebra.

                  Equations
                  Instances For
                    theorem MIPRE.QLD.sum_xSqNorm_hatPOVM_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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {PA : Question F m โ†’ POVMIn (Answer F m d) ๐’œ} {PB : Question F m โ†’ POVMIn (Answer F m d) โ„ฌ} (hM : โ€–M.ฯˆโ€– = 1) (W : Bas) (c : Content F m) :
                    โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((hatPOVM hm PB W c).op a) โ‰ค 2 * M.condFail (qldGame hm) PA PB (Content.question hm c (Ty.point W)) (Content.question hm c (Ty.point W))

                    The hatted measurements are cross-party consistent, at one content: twice the conditional failure of the (Point, W) subtest, and nothing for the ancilla. The three inputs meet here --- the strategy's consistency, the ancilla's perfect consistency, and Born-level data processing for the convolution.

                    theorem MIPRE.QLD.hatPOVM_consistency {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {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 โ‰ค ฮต) (W : Bas) :
                    โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((hatPOVM hm PB W c).op a) โ‰ค 172 * ฮต

                    The self-consistency half of lem:qld-expanded-points. On average over the verifier's content, the two players' hatted point measurements agree across the re-bipartitioned parties at 172 eps --- the constant of item 1 of lem:qld-win, with the expansion contributing nothing.

                    theorem MIPRE.QLD.expanded_points {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {PA : Question F m โ†’ POVMIn (Answer F m d) ๐’œ} {PB : Question F m โ†’ POVMIn (Answer F m d) โ„ฌ} {ฮต : โ„} (hM : โ€–M.ฯˆโ€– = 1) (hPA : โˆ€ (q : Question F m), IsPVMIn (PA q).op) (hfail : 1 - M.povmValue (qldGame hm) PA PB โ‰ค ฮต) :
                    (โˆ€ (W : Bas), โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((hatPOVM hm PB W c).op a) โ‰ค 172 * ฮต) โˆง โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * (M.reg (Anc F m)).stateSqNorm (hatObs hm PA Bas.X c * hatObs hm PA Bas.Z c - hatObs hm PA Bas.Z c * hatObs hm PA Bas.X c) โ‰ค 57676416 * ฮต

                    lem:qld-expanded-points: both items, on the expanded state. The measurements are the hatted ones; they are cross-party consistent at 172 eps, and their X-side and Z-side observables commute at 57676416 eps with no sign.

                    The line measurements #

                    lem:qld-expanded-lines, the paper's lem:qld-comm-line-cons. The construction is the line analogue of the hatted point measurement: the strategy's line measurement, convolved with an ancilla measurement that reports the restriction of the encoding to the line rather than its value at a point.

                    Three things make it work, and all three are exact.

                    As in the point case the whole estimate runs on Born probabilities and is converted to the state-dependent distance once, at the end. That is what lets the paper's two forms of line-against-point consistency --- comparing outcomes, and comparing the evaluation --- come out of a single inequality: the coarse-graining that relates them is free at the Born level, and fact:data-processing is never needed for ~=.

                    Restriction to a line, in coefficients #

                    noncomputable def MIPRE.QLD.lineCoeffs {F : Type u_1} [Field F] {m : โ„•} (n : โ„•) (uโ‚€ w : LIDT.Point F m) (p : MvPolynomial (Fin m) F) :

                    The restriction of a multivariate polynomial to the line t โ†ฆ uโ‚€ + t w, as a polynomial of degree at most n given by its coefficients.

                    Equations
                    Instances For
                      theorem MIPRE.QLD.eval_lineCoeffs {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {n : โ„•} {p : MvPolynomial (Fin m) F} (hp : p.totalDegree โ‰ค n) (uโ‚€ w : LIDT.Point F m) (t : F) :
                      (lineCoeffs n uโ‚€ w p).eval t = (MvPolynomial.eval (uโ‚€ + t โ€ข w)) p

                      Evaluating the restriction is evaluating along the line.

                      theorem MIPRE.QLD.dotF_indVec {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (h : Anc F m) (u : LIDT.Point F m) :

                      The pairing with ind_m(u) is the encoding evaluated at u, which is what identifies the ancilla's point measurement as a coarse-graining of its basis measurement along g_h(u).

                      def MIPRE.QLD.padLine {F : Type u_1} [Field F] {k : โ„•} (n : โ„•) (f : LIDT.LinePoly F k) :

                      A polynomial of degree at most k, read as one of degree at most n: pad the coefficient vector with zeros. An axis-parallel line answer has degree at most d and has to be added to an ancilla restriction of degree at most m, so the two live in LinePoly F (m d) together.

                      Equations
                      Instances For
                        theorem MIPRE.QLD.linePoly_eval_eq_range {F : Type u_1} [Field F] {k : โ„•} (f : LIDT.LinePoly F k) (t : F) :
                        f.eval t = โˆ‘ j โˆˆ Finset.range (k + 1), (if h : j < k + 1 then f โŸจj, hโŸฉ else 0) * t ^ j

                        The coefficient form of an evaluation, as a sum over range (k+1).

                        theorem MIPRE.QLD.eval_padLine {F : Type u_1} [Field F] {k n : โ„•} (hkn : k โ‰ค n) (f : LIDT.LinePoly F k) (t : F) :
                        (padLine n f).eval t = f.eval t

                        Padding does not change the polynomial.

                        def MIPRE.QLD.rdLine {F : Type u_1} [Field F] {m d : โ„•} (n : โ„•) :
                        Answer F m d โ†’ LIDT.LinePoly F n

                        A line answer read as a polynomial of degree at most n, whichever of the two line formats it has; anything else reads as zero, which the format check makes unreachable.

                        Equations
                        Instances For

                          The ancilla's line measurement #

                          noncomputable def MIPRE.QLD.synLinePOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (n : โ„•) (W : Bas) (uโ‚€ w : LIDT.Point F m) :
                          POVM (LIDT.LinePoly F n) (Anc F m)

                          The ancilla's line measurement ฯ„^{W,โ„“}: measure all M qudits in the basis W, and report the restriction to the line of the low-degree encoding of the outcome.

                          Equations
                          Instances For
                            theorem MIPRE.QLD.isPVM_synLinePOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] (n : โ„•) (W : Bas) (uโ‚€ w : LIDT.Point F m) :
                            IsPVM fun (f : LIDT.LinePoly F n) => โ†‘((synLinePOVM n W uโ‚€ w).mats f)

                            The ancilla's line measurement is projective.

                            theorem MIPRE.QLD.synLinePOVM_map_eval {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : โ„•} [NeZero m] {n : โ„•} (hmn : m โ‰ค n) (W : Bas) (uโ‚€ w : LIDT.Point F m) (t : F) :
                            POVM.map (fun (f : LIDT.LinePoly F n) => f.eval t) (synLinePOVM n W uโ‚€ w) = synPOVM W (uโ‚€ + t โ€ข w)

                            The ancilla's line and point measurements are exactly compatible. Relabelling a line outcome by its value at the point of parameter t gives precisely the point measurement at that point --- not approximately: the two families are the same coarse-graining of the same eigenbasis measurement.

                            The hatted line measurement #

                            noncomputable def MIPRE.QLD.lineAnsPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (n : โ„•) (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (ty : Ty) (c : Content F m) :

                            The strategy's line measurement at a content, read as a polynomial of degree at most n --- the same definition for either player.

                            Equations
                            Instances For
                              noncomputable def MIPRE.QLD.hatLinePOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (n : โ„•) (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (W : Bas) (ty : Ty) (base dir : Content F m โ†’ LIDT.Point F m) (c : Content F m) :
                              POVMIn (LIDT.LinePoly F n) (Matrix (Anc F m) (Anc F m) R)

                              The hatted line measurement Mฬ‚^{(Line,W),โ„“}_f = โˆ‘_{f' + f'' = f} M^{(Line,W),โ„“}_{f'} โŠ— ฯ„^{W,โ„“}_{f''}: the product of the strategy's line measurement with the ancilla's, coarse-grained by adding the two polynomials.

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                theorem MIPRE.QLD.isPVM_hatLinePOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {n : โ„•} {hm : m โˆฃ Fintype.card F} {P : Question F m โ†’ POVMIn (Answer F m d) R} {W : Bas} {ty : Ty} {base dir : Content F m โ†’ LIDT.Point F m} {c : Content F m} (hP : IsPVMIn (P (Content.question hm c ty)).op) :
                                IsPVMIn (hatLinePOVM n hm P W ty base dir c).op

                                The hatted line measurement is projective whenever the strategy's own line measurement is. Projectivity is closed under products and under coarse-graining, and that is all the convolution is; the paper checks the same thing by hand.

                                Self-consistency of the hatted line measurement #

                                theorem MIPRE.QLD.sum_xSqNorm_hatLinePOVM_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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {n : โ„•} {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {PA : Question F m โ†’ POVMIn (Answer F m d) ๐’œ} {PB : Question F m โ†’ POVMIn (Answer F m d) โ„ฌ} (hM : โ€–M.ฯˆโ€– = 1) (W : Bas) (ty : Ty) (base dir : Content F m โ†’ LIDT.Point F m) (c : Content F m) :
                                โˆ‘ f : LIDT.LinePoly F n, (M.reg (Anc F m)).xSqNorm ((hatLinePOVM n hm PA W ty base dir c).op f) ((hatLinePOVM n hm PB W ty base dir c).op f) โ‰ค 2 * M.condFail (qldGame hm) PA PB (Content.question hm c ty) (Content.question hm c ty)

                                The hatted line measurements are cross-party consistent, at one content: twice the conditional failure of the line type's own consistency subtest, and nothing for the ancilla. The three inputs are the same three as in the point case --- the strategy's consistency, the ancilla's perfect consistency, and Born-level data processing for the convolution.

                                theorem MIPRE.QLD.hatLinePOVM_consistency {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {n : โ„•} {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {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 โ‰ค ฮต) (W : Bas) (ty : Ty) (base dir : Content F m โ†’ LIDT.Point F m) :
                                โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ f : LIDT.LinePoly F n, (M.reg (Anc F m)).xSqNorm ((hatLinePOVM n hm PA W ty base dir c).op f) ((hatLinePOVM n hm PB W ty base dir c).op f) โ‰ค 172 * ฮต

                                The self-consistency item of lem:qld-expanded-lines. On average over the verifier's content --- which is the line--point distribution, the line and the point being read off the same sample --- the two players' hatted line measurements agree at 172 eps.

                                Consistency with the expanded point measurements #

                                theorem MIPRE.QLD.Content.omega_pt {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : โ„•} [NeZero m] (c : Content F m) (W : Bas) :
                                c.omega.pt W = c.pt W
                                theorem MIPRE.QLD.hatLinePOVM_map_eval {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {R : Type u_5} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {n : โ„•} (hm : m โˆฃ Fintype.card F) (P : Question F m โ†’ POVMIn (Answer F m d) R) (W : Bas) (ty : Ty) (base dir : Content F m โ†’ LIDT.Point F m) (c : Content F m) (t : F) :
                                POVMIn.map (fun (f : LIDT.LinePoly F n) => f.eval t) (hatLinePOVM n hm P W ty base dir c) = POVMIn.map (fun (p : F ร— F) => p.1 + p.2) (kronIn (POVMIn.map (fun (f : LIDT.LinePoly F n) => f.eval t) (lineAnsPOVM n hm P ty c)) (POVM.map (fun (f : LIDT.LinePoly F n) => f.eval t) (synLinePOVM n W (base c) (dir c))) โ‹ฏ)

                                The hatted line measurement, relabelled by its value at a point of the line, is the product of the two relabelled factors. Evaluation is additive, so it passes through the convolution.

                                theorem MIPRE.QLD.sum_xSqNorm_hatLine_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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {n : โ„•} (hmn : m โ‰ค n) {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {PA : Question F m โ†’ POVMIn (Answer F m d) ๐’œ} {PB : Question F m โ†’ POVMIn (Answer F m d) โ„ฌ} (hM : โ€–M.ฯˆโ€– = 1) (W : Bas) (ty : Ty) (base dir : Content F m โ†’ LIDT.Point F m) (hon : โˆ€ (c : Content F m), base c + LIDT.CL.lineParam (base c) (dir c) (c.pt W) โ€ข dir c = c.pt W) (hsub : โˆ€ (c : Content F m) (a b : Answer F m d), accepts hm (Content.question hm c (Ty.point W)) (Content.question hm c ty) a b = true โ†’ rdVal a = (rdLine n b).eval (LIDT.CL.lineParam (base c) (dir c) (c.pt W))) (c : Content F m) :
                                โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((POVMIn.map (fun (f : LIDT.LinePoly F n) => f.eval (LIDT.CL.lineParam (base c) (dir c) (c.pt W))) (hatLinePOVM n hm PB W ty base dir c)).op a) โ‰ค 2 * M.condFail (qldGame hm) PA PB (Content.question hm c (Ty.point W)) (Content.question hm c ty)

                                The line-against-point item of lem:qld-expanded-lines. At one content: twice the conditional failure of the line subtest, and nothing for the ancilla, whose line and point measurements are exactly compatible (synLinePOVM_map_eval). This single inequality carries both of the paper's two forms --- comparing a line outcome with a point outcome, and comparing the evaluation of the line polynomial at the point --- because at the Born level the coarse-graining that relates them is free.

                                The two line types of the Pauli basis test #

                                The sampled point lies on the line the seeded test reports, at the parameter lineParam computes. The base point is the canonical representative, which differs from the point by an element of the direction's span (MIPRE.CL.sub_canonLin_mem).

                                noncomputable def MIPRE.QLD.abaseOf {F : Type u_1} [Field F] [Fintype F] {m : โ„•} [NeZero m] (hm : m โˆฃ Fintype.card F) (W : Bas) (c : Content F m) :

                                The base point of the axis-parallel line a content presents on the W side.

                                Equations
                                Instances For
                                  noncomputable def MIPRE.QLD.ddirOf {F : Type u_1} [Field F] [Fintype F] {m : โ„•} [NeZero m] (hm : m โˆฃ Fintype.card F) (c : Content F m) :

                                  The direction of the diagonal line a content presents.

                                  Equations
                                  Instances For
                                    noncomputable def MIPRE.QLD.dbaseOf {F : Type u_1} [Field F] [Fintype F] {m : โ„•} [NeZero m] (hm : m โˆฃ Fintype.card F) (W : Bas) (c : Content F m) :

                                    The base point of the diagonal line a content presents on the W side.

                                    Equations
                                    Instances For
                                      theorem MIPRE.QLD.d_le_mul {m d : โ„•} [NeZero m] :
                                      d โ‰ค m * d
                                      theorem MIPRE.QLD.m_le_mul {m d : โ„•} [NeZero m] (hd : 1 โ‰ค d) :
                                      m โ‰ค m * d
                                      theorem MIPRE.QLD.hsub_aline {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} (W : Bas) (c : Content F m) (a b : Answer F m d) (h : accepts hm (Content.question hm c (Ty.point W)) (Content.question hm c (Ty.aline W)) a b = true) :
                                      rdVal a = (rdLine (m * d) b).eval (LIDT.CL.lineParam (abaseOf hm W c) (dirOf hm c) (c.pt W))

                                      The axis-parallel line subtest, as the hypothesis the general estimate needs: the line answer, padded to degree m d and evaluated at the parameter of the sampled point, is the point answer. This is item 2a of lem:qld-win with the padding added.

                                      theorem MIPRE.QLD.hsub_dline {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} (W : Bas) (c : Content F m) (a b : Answer F m d) (h : accepts hm (Content.question hm c (Ty.point W)) (Content.question hm c (Ty.dline W)) a b = true) :
                                      rdVal a = (rdLine (m * d) b).eval (LIDT.CL.lineParam (dbaseOf hm W c) (ddirOf hm c) (c.pt W))

                                      The diagonal line subtest, the same way: item 2b of lem:qld-win.

                                      theorem MIPRE.QLD.hatLinePOVM_point_consistency {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] {n : โ„•} (hmn : m โ‰ค n) {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {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 โ‰ค ฮต) (W : Bas) (ty : Ty) (hadj : adj (Ty.point W) ty = true) (base dir : Content F m โ†’ LIDT.Point F m) (hon : โˆ€ (c : Content F m), base c + LIDT.CL.lineParam (base c) (dir c) (c.pt W) โ€ข dir c = c.pt W) (hsub : โˆ€ (c : Content F m) (a b : Answer F m d), accepts hm (Content.question hm c (Ty.point W)) (Content.question hm c ty) a b = true โ†’ rdVal a = (rdLine n b).eval (LIDT.CL.lineParam (base c) (dir c) (c.pt W))) :
                                      โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((POVMIn.map (fun (f : LIDT.LinePoly F n) => f.eval (LIDT.CL.lineParam (base c) (dir c) (c.pt W))) (hatLinePOVM n hm PB W ty base dir c)).op a) โ‰ค 172 * ฮต

                                      The line-against-point item of lem:qld-expanded-lines, on average over the content.

                                      lem:qld-expanded-lines #

                                      theorem MIPRE.QLD.expanded_lines_aline {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] (hd : 1 โ‰ค d) {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {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 โ‰ค ฮต) (W : Bas) :
                                      โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm ((hatLinePOVM (m * d) hm PA W (Ty.aline W) (abaseOf hm W) (dirOf hm) c).op f) ((hatLinePOVM (m * d) hm PB W (Ty.aline W) (abaseOf hm W) (dirOf hm) c).op f) โ‰ค 172 * ฮต โˆง โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((POVMIn.map (fun (f : LIDT.LinePoly F (m * d)) => f.eval (LIDT.CL.lineParam (abaseOf hm W c) (dirOf hm c) (c.pt W))) (hatLinePOVM (m * d) hm PB W (Ty.aline W) (abaseOf hm W) (dirOf hm) c)).op a) โ‰ค 172 * ฮต

                                      lem:qld-expanded-lines for the axis-parallel line type. The hatted line measurement has outcomes the polynomials of degree at most m d on the line; it is self-consistent over the line--point distribution at 172 eps, and consistent with the expanded point measurements of lem:qld-expanded-points at 172 eps --- in the form that compares the evaluation of the line polynomial at the sampled point, which at the Born level is also the form that compares the outcomes. Projectivity is isPVM_hatLinePOVM, given a projective strategy.

                                      theorem MIPRE.QLD.expanded_lines_dline {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 โ„ฌ] [StarModule โ„‚ ๐’œ] [StarProper ๐’œ] [StarModule โ„‚ โ„ฌ] [StarProper โ„ฌ] (hd : 1 โ‰ค d) {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} {hm : m โˆฃ Fintype.card F} {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 โ‰ค ฮต) (W : Bas) :
                                      โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm ((hatLinePOVM (m * d) hm PA W (Ty.dline W) (dbaseOf hm W) (ddirOf hm) c).op f) ((hatLinePOVM (m * d) hm PB W (Ty.dline W) (dbaseOf hm W) (ddirOf hm) c).op f) โ‰ค 172 * ฮต โˆง โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm ((hatPOVM hm PA W c).op a) ((POVMIn.map (fun (f : LIDT.LinePoly F (m * d)) => f.eval (LIDT.CL.lineParam (dbaseOf hm W c) (ddirOf hm c) (c.pt W))) (hatLinePOVM (m * d) hm PB W (Ty.dline W) (dbaseOf hm W) (ddirOf hm) c)).op a) โ‰ค 172 * ฮต

                                      lem:qld-expanded-lines for the diagonal line type, the same two items.