Documentation

MIPRE.Background.QLD.Legalize

Legalizing a strategy for the Pauli basis test #

The paper's strategies answer each question in the format its type prescribes: a strategy's measurement for a (Point, W) question has outcomes in F_q, for an axis-parallel line question outcomes of degree at most d, and so on. The Lean strategies of MIPRE.QLD are more permissive: one answer type Answer F m d serves every question, so a measurement may have an element on an answer of the wrong format. The decider rejects such an answer before running any rule (Question.fmtOk), so the mass on them is controlled by the failure probability --- but "controlled by O(ε)" is not "zero", and one place needs zero. lem:qld-axis-degree asks that the expanded axis-parallel line measurement be supported on polynomials of degree at most d, which the paper takes from the format and which a dpoly answer to an axis question breaks.

This file makes the paper's convention available at no cost. legalize q a keeps an answer of the right format and replaces any other by a fixed legal default (Question.defaultAns); the legalized strategy legalizeStrat P relabels every measurement along it. Four things hold, and they are all one needs to pass to the legalized strategy without loss of generality:

So every hypothesis of the appendix's chain holds for legalizeStrat PA, legalizeStrat PB when it holds for PA, PB, and the extra property --- legal support --- is what MIPRE/Background/QLD/PaddedLines.lean turns into the exact degree bound of lem:qld-axis-degree. The campaign record had costed that lemma as "coarse-grain and pay the format-failure probability, which changes the constants"; legalizing the strategy first costs nothing and changes no constant.

In a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). A strategy is a family of POVMs P : Question F m → POVMIn (Answer F m d) R in a player's ordered ⋆-algebra R, legalizing is the coarse-graining POVMIn.map along legalize q, and projectivity is IsPVMIn, which a coarse-graining keeps (POVMIn.isPVMIn_map). The value comparison is the model's (BipartiteModel.povmValue), by the same data processing on the Born distribution (BipartiteModel.sum_weight_bornProb_map). The coarse (Pauli, W) measurement is unchanged by legalizeStrat_map at the reading rdPauliVec (rdPauliVec_legalize_pauli, MIPRE/Background/QLD/Soundness.lean). For a projective strategy S : M.ProjStrat (qldGame hm) the legalized strategy is S.adapt (qldGame hm) id id legalize legalize, whose measurements are legalizeStrat S.PA and legalizeStrat S.PB by definition.

theorem MIPRE.QLD.fmtOk_defaultAns {F : Type u_1} [Field F] {m d : ℕ} (q : Question F m) :
def MIPRE.QLD.legalize {F : Type u_1} [Field F] {m d : ℕ} (q : Question F m) (a : Answer F m d) :
Answer F m d

Legalize an answer: keep it if it has the question's format, replace it by the default otherwise.

Equations
Instances For
    theorem MIPRE.QLD.legalize_of_fmtOk {F : Type u_1} [Field F] {m d : ℕ} {q : Question F m} {a : Answer F m d} (h : q.fmtOk a = true) :
    legalize q a = a
    theorem MIPRE.QLD.legalize_of_not_fmtOk {F : Type u_1} [Field F] {m d : ℕ} {q : Question F m} {a : Answer F m d} (h : q.fmtOk a = false) :
    theorem MIPRE.QLD.fmtOk_legalize {F : Type u_1} [Field F] {m d : ℕ} (q : Question F m) (a : Answer F m d) :

    A legalized answer has the question's format.

    The readings are unchanged #

    Each rule of fig:decider_pauli reads an answer through one of the maps of MIPRE/Background/QLD/Win.lean, all of which send an answer of the wrong format to 0; the defaults read as 0 too, so legalizing commutes with every reading at the question type it is made for.

    theorem MIPRE.QLD.rdVal_legalize_point {F : Type u_1} [Field F] {m d : ℕ} (W : Bas) (y : LIDT.Point F m) (a : Answer F m d) :
    theorem MIPRE.QLD.rdPauli_legalize_pauli {F : Type u_1} [Field F] {m d : ℕ} (y : LIDT.Point F m) (W : Bas) (a : Answer F m d) :
    theorem MIPRE.QLD.rdBit_legalize_pairB {F : Type u_1} [Field F] {m d : ℕ} (W : Bas) (ω : Omega F m) (a : Answer F m d) :
    theorem MIPRE.QLD.rdBit_legalize_var {F : Type u_1} [Field F] {m d : ℕ} (j : Fin LCS.MagicSquare.layout.s) (ω : Omega F m) (a : Answer F m d) :
    theorem MIPRE.QLD.rdBitPair_legalize_pair {F : Type u_1} [Field F] {m d : ℕ} (W : Bas) (ω : Omega F m) (a : Answer F m d) :
    theorem MIPRE.QLD.rdProbe_legalize_point {F : Type u_1} [Field F] {m d : ℕ} [Algebra (ZMod 2) F] (r : F) (W : Bas) (y : LIDT.Point F m) (a : Answer F m d) :

    The legalized strategy #

    def MIPRE.QLD.LegalSupport {F : Type u_1} {m d : ℕ} [Fintype F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] (P : Question F m → POVMIn (Answer F m d) R) :

    A strategy is legally supported when it has no measurement element on an answer of the wrong format for the question. This is the paper's standing convention on strategies.

    Equations
    Instances For
      def MIPRE.QLD.legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (P : Question F m → POVMIn (Answer F m d) R) (q : Question F m) :
      POVMIn (Answer F m d) R

      The legalized strategy: each measurement relabelled along legalize.

      Equations
      Instances For
        theorem MIPRE.QLD.isPVM_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {P : Question F m → POVMIn (Answer F m d) R} (hP : ∀ (q : Question F m), IsPVMIn (P q).op) (q : Question F m) :
        theorem MIPRE.QLD.legalizeStrat_mats_eq_zero {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (P : Question F m → POVMIn (Answer F m d) R) {q : Question F m} {a : Answer F m d} (h : q.fmtOk a = false) :
        (legalizeStrat P q).op a = 0

        An answer of the wrong format has no element in the legalized strategy.

        theorem MIPRE.QLD.legalSupport_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (P : Question F m → POVMIn (Answer F m d) R) :
        theorem MIPRE.QLD.legalizeStrat_map {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] (P : Question F m → POVMIn (Answer F m d) R) (q : Question F m) {β : Type u_3} [Fintype β] [DecidableEq β] (rd : Answer F m d → β) (h : ∀ (a : Answer F m d), rd (legalize q a) = rd a) :

        A reading that legalization does not change reads the same measurement.

        theorem MIPRE.QLD.ptPOVM_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] [Algebra (ZMod 2) F] [NeZero m] (hm : m ∣ Fintype.card F) (P : Question F m → POVMIn (Answer F m d) R) (W : Bas) (c : Content F m) :
        ptPOVM hm (legalizeStrat P) W c = ptPOVM hm P W c

        The point-probe measurements of the legalized strategy are the original's.

        theorem MIPRE.QLD.ptObs_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] [Algebra (ZMod 2) F] [NeZero m] (hm : m ∣ Fintype.card F) (P : Question F m → POVMIn (Answer F m d) R) (W : Bas) (c : Content F m) :
        ptObs hm (legalizeStrat P) W c = ptObs hm P W c

        The point observables of the legalized strategy are the original's.

        theorem MIPRE.QLD.hatPtPOVM_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] [Algebra (ZMod 2) F] [NeZero m] [Algebra ℂ R] [StarModule ℂ R] [StarProper R] (P : Question F m → POVMIn (Answer F m d) R) (W : Bas) (u : LIDT.Point F m) :

        The hatted point measurements of the legalized strategy are the original's.

        theorem MIPRE.QLD.hatMats_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] [Algebra (ZMod 2) F] [NeZero m] [Algebra ℂ R] [StarModule ℂ R] [StarProper R] (P : Question F m → POVMIn (Answer F m d) R) (W : Bas) (u : LIDT.Point F m) :

        The value can only go up #

        theorem MIPRE.QLD.povmValue_le_legalizeStrat {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] [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) ℬ) :

        Legalizing both strategies does not decrease the value. The decider rejects an answer of the wrong format before any rule runs, so an accepted pair consists of legal answers, which legalization leaves alone; the accepted mass can only grow.

        theorem MIPRE.QLD.one_sub_povmValue_legalizeStrat_le {F : Type u_1} [Field F] {m d : ℕ} [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] [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) ℬ) {ε : ℝ} (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) :

        The failure probability of the legalized strategies is at most the original's: the form the appendix's hypotheses take.