Documentation

MIPRE.Background.QLD.PaddedLines

The padded line measurement's consistency #

Blueprint lem:qld-padded-lines, the analytic half. Combine.lean built the measurement; this file proves it consistent with the padded point measurement on the padded line-point law.

The paper chains three Cauchy--Schwarz claims here. They are not needed for this construction, and reports/padded-lines-product-law.md says why: the joint law of the two sublines-with-points is exactly a product of the two marginals at a fixed padded seed, so the product form of the pairs-of-lines lemma applies directly. What is left is a single coarse-graining step, and that is what this file adds.

The m^2 and the functional form are discussed in the report: it is poly(m) * poly(eps, md/q) rather than the m * poly(eps, md/q) the blueprint statement advertises, which lem:qld-simultaneous's a(md)^a prefactor absorbs.

In a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The pasted line measurement and its coarse-grainings (pasteFib, lineComb) are families of elements of Matrix (Anc F m) (Anc F m) R over a player's ordered โ‹†-algebra, and the consistency bound is an agreement bound in the expanded model M.reg (Anc F m): the combined point measurement is the first player's sandwich M-hat^Z_b M-hat^X_a M-hat^Z_b itself, read along (alpha, beta) (ptComb), not a dilation of it. That is the form pairs_of_lines_prod_of_items now returns, and it is also what the padded strategy measures, so no compression is needed downstream. The exchanged player is the same statement for M.swap, read back through hatVec_swapVec_xSqNorm and hatVec_swapVec_bornProb. Positivity is the model's order: the two coarse-graining lemmas take nonnegative families, and the name posSemidef_pasteFib is kept for a nonnegativity statement.

Coarse-graining a Born sum #

theorem MIPRE.QLD.sum_bornProb_le_fibre {๐’ž : Type u_1} {๐’œ : Type u_2} {โ„ฌ : Type u_3} [Ring ๐’ž] [StarRing ๐’ž] [Algebra โ„‚ ๐’ž] [Ring ๐’œ] [StarRing ๐’œ] [Algebra โ„‚ ๐’œ] [Ring โ„ฌ] [StarRing โ„ฌ] [Algebra โ„‚ โ„ฌ] [PartialOrder ๐’œ] [StarOrderedRing ๐’œ] [PartialOrder โ„ฌ] [StarOrderedRing โ„ฌ] {ฮน : Type u_4} {ฮบ : Type u_5} [Fintype ฮน] [DecidableEq ฮน] [Fintype ฮบ] [DecidableEq ฮบ] (M : BipartiteModel ๐’ž ๐’œ โ„ฌ) (P : ฮน โ†’ ๐’œ) (Q : ฮน โ†’ โ„ฌ) (hP : โˆ€ (i : ฮน), 0 โ‰ค P i) (hQ : โˆ€ (i : ฮน), 0 โ‰ค Q i) (f : ฮน โ†’ ฮบ) :
โˆ‘ i : ฮน, M.bornProb (P i) (Q i) โ‰ค โˆ‘ k : ฮบ, M.bornProb (โˆ‘ i : ฮน with f i = k, P i) (โˆ‘ i : ฮน with f i = k, Q i)

Coarse-graining both sides the same way can only increase agreement. The POVMIn version is BipartiteModel.sum_bornProb_le_map; here the families are bare nonnegative families, which is the shape the pasted line measurement comes in.

theorem MIPRE.QLD.sum_bornProb_diag_le_one {๐’ž : Type u_1} {๐’œ : Type u_2} {โ„ฌ : Type u_3} [Ring ๐’ž] [StarRing ๐’ž] [Algebra โ„‚ ๐’ž] [Ring ๐’œ] [StarRing ๐’œ] [Algebra โ„‚ ๐’œ] [Ring โ„ฌ] [StarRing โ„ฌ] [Algebra โ„‚ โ„ฌ] [PartialOrder ๐’œ] [StarOrderedRing ๐’œ] [PartialOrder โ„ฌ] [StarOrderedRing โ„ฌ] {ฮน : Type u_4} [Fintype ฮน] {M : BipartiteModel ๐’ž ๐’œ โ„ฌ} (hM : โ€–M.ฯˆโ€– = 1) (P : ฮน โ†’ ๐’œ) (Q : ฮน โ†’ โ„ฌ) (hP : โˆ€ (i : ฮน), 0 โ‰ค P i) (hQ : โˆ€ (i : ฮน), 0 โ‰ค Q i) (hPs : โˆ‘ i : ฮน, P i = 1) (hQs : โˆ‘ i : ฮน, Q i = 1) :
โˆ‘ i : ฮน, M.bornProb (P i) (Q i) โ‰ค 1

A Born sum on the diagonal of two POVMs is at most one.

The two coarse-grained families #

def MIPRE.QLD.pasteEval {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (cX cZ : Content F m) (q : LIDT.LinePoly F (m * d) ร— LIDT.LinePoly F (m * d)) :
F ร— F

The pasted line measurement's own outcome map: each side's polynomial read at the parameter of its own subline.

Equations
Instances For
    def MIPRE.QLD.ptComb {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {N : Type u_2} [AddCommMonoid N] (Q : F ร— F โ†’ N) (a b v : F) :
    N

    The combined point measurement along the linear form (a, b): the paper's Q-hat^{x,z,alpha,beta}, as the coarse-graining of a family indexed by pairs, in any additive monoid.

    Equations
    Instances For
      noncomputable def MIPRE.QLD.pasteFib {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_2} [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) (r : F ร— F) :
      Matrix (Anc F m) (Anc F m) R

      The pasted line measurement coarse-grained by that map --- the family the product form of lem:qld-pairs-of-lines bounds.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem MIPRE.QLD.pasteFib_eq {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_2} [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) (r : F ร— F) :
        pasteFib PX PZ d S cX cZ r = โˆ‘ q : LIDT.LinePoly F (m * d) ร— LIDT.LinePoly F (m * d) with pasteEval PX PZ cX cZ q = r, pasteLine PX PZ d S cX cZ q
        theorem MIPRE.QLD.posSemidef_pasteFib {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m โ†’ POVMIn (Answer F m d) R} (hS : โˆ€ (q : Question F m), IsPVMIn (S q).op) (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (cX cZ : Content F m) (r : F ร— F) :
        0 โ‰ค pasteFib PX PZ d S cX cZ r

        Each element of the coarse-grained pasted family is nonnegative.

        theorem MIPRE.QLD.sum_pasteFib {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {S : Question F m โ†’ POVMIn (Answer F m d) R} (hS : โˆ€ (q : Question F m), IsPVMIn (S q).op) (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (cX cZ : Content F m) :
        โˆ‘ r : F ร— F, pasteFib PX PZ d S cX cZ r = 1
        noncomputable def MIPRE.QLD.lineComb {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_2} [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) (a b v : F) :
        Matrix (Anc F m) (Anc F m) R

        The pasted line measurement coarse-grained by the combining map at (a, b). Averaged over the fresh randomness this is padLineMats read at the sampled point; see sum_filter_padLineMats.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem MIPRE.QLD.lineComb_eq_sum_pasteFib {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_2} [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) (a b v : F) :
          lineComb PX PZ d S cX cZ a b v = โˆ‘ r : F ร— F with a * r.1 + b * r.2 = v, pasteFib PX PZ d S cX cZ r

          The line side is a coarse-graining of the fibre family, along the same linear form. This is what lets the two be compared by sum_bornProb_le_fibre.

          The axis-parallel degree bound #

          The degree computation of lem:qld-axis-degree: on an axis-parallel line the expansion adds a polynomial of degree at most one, because the restriction of a multilinear polynomial to u_0 + t e_j is affine in t (natDegree_lineRestrict_single_le), so an outcome built from a legal axis answer has degree at most d as soon as d >= 1.

          What this does not give is the support claim of lem:qld-axis-degree. The strategy's line measurement is indexed by all answers, and a dpoly answer to an axis-parallel question --- which the decider rejects, but for which the measurement still has an element --- produces an outcome of degree up to md. Turning the computation below into the lemma means modifying the measurement to send those answers to a default outcome and paying the format-failure probability, which is not done here; that is why lem:qld-padded-lines states its degree-d clause conditionally on lem:qld-axis-degree.

          theorem MIPRE.QLD.DegLE.add {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {n k : โ„•} {f g : LIDT.LinePoly F n} (hf : DegLE f k) (hg : DegLE g k) :
          DegLE (f + g) k
          theorem MIPRE.QLD.degLE_zero {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {n k : โ„•} :
          DegLE 0 k
          theorem MIPRE.QLD.degLE_padLine {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {k n : โ„•} (f : LIDT.LinePoly F k) :
          DegLE (padLine n f) k
          theorem MIPRE.QLD.degLE_rdLine {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : โ„•} [NeZero m] {n : โ„•} (a : Answer F m d) (hne : โˆ€ (g : LIDT.LinePoly F (m * d)), a โ‰  Answer.dpoly g) :
          DegLE (rdLine n a) d

          A line outcome read off an answer that is not a diagonal-line answer has degree at most d.

          theorem MIPRE.QLD.degLE_lineCoeffs_aline {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m : โ„•} [NeZero m] {n : โ„•} (uโ‚€ : LIDT.Point F m) (j : Fin m) (h : Anc F m) :
          DegLE (lineCoeffs n uโ‚€ (Pi.single j 1) (LowDegree.ldEnc h)) 1

          The expansion adds degree at most one on an axis-parallel line.

          theorem MIPRE.QLD.degLE_hatLine_outcome {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : โ„•} [NeZero m] {n : โ„•} (hd : 1 โ‰ค d) (uโ‚€ : LIDT.Point F m) (j : Fin m) (hh : Anc F m) (a : Answer F m d) (hne : โˆ€ (g : LIDT.LinePoly F (m * d)), a โ‰  Answer.dpoly g) :
          DegLE (rdLine n a + lineCoeffs n uโ‚€ (Pi.single j 1) (LowDegree.ldEnc hh)) d

          The degree computation of lem:qld-axis-degree: a legal axis answer convolved with the expansion's line outcome has degree at most d, for d >= 1.

          The support half of lem:qld-axis-degree #

          The degree computation above says what an outcome built from a legal axis answer looks like. The support claim is that the expanded axis-line measurement has no element anywhere else, and that is false for an arbitrary strategy: a dpoly answer to an axis question is rejected by the decider but still has a measurement element, whose outcome has degree up to m d. For a strategy with LegalSupport --- which legalizeStrat provides at no cost --- it is true and exact: every element of the strategy's factor sits on a legal apoly answer, of degree at most d, and every element of the ancilla's factor sits on a restriction of the multilinear encoding, of degree at most 1. The padded line measurement inherits it through degLE_padCombine_aline.

          theorem MIPRE.QLD.lineAnsPOVM_aline_eq_zero_of_not_degLE {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {n : โ„•} {S : Question F m โ†’ POVMIn (Answer F m d) R} (hleg : LegalSupport S) (W : Bas) (c : Content F m) {f : LIDT.LinePoly F n} (hf : ยฌDegLE f d) :
          (lineAnsPOVM n hm S (Ty.aline W) c).op f = 0

          The strategy's axis-line reading of a legally supported strategy is supported on degree at most d.

          theorem MIPRE.QLD.hatLinePOVM_aline_eq_zero_of_not_degLE {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (hd : 1 โ‰ค d) {n : โ„•} {S : Question F m โ†’ POVMIn (Answer F m d) R} (hleg : LegalSupport S) (W : Bas) (c : Content F m) {f : LIDT.LinePoly F n} (hf : ยฌDegLE f d) :
          (hatLinePOVM n hm S W (Ty.aline W) (abaseOf hm W) (dirOf hm) c).op f = 0

          The support half of lem:qld-axis-degree, at the expanded measurement: for d โ‰ฅ 1 and a legally supported strategy, the expanded axis-parallel line measurement has no element off the polynomials of degree at most d.

          theorem MIPRE.QLD.lineMats_aPres_eq_zero_of_not_degLE {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (hd : 1 โ‰ค d) {S : Question F m โ†’ POVMIn (Answer F m d) R} (hleg : LegalSupport S) (W : Bas) (c : Content F m) {f : LIDT.LinePoly F (m * d)} (hf : ยฌDegLE f d) :
          (aPres hm W).lineMats d S c f = 0

          The same, for the axis-parallel presentation's line measurement.

          theorem MIPRE.QLD.padLineMats_aline_eq_zero_of_not_degLE {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : โ„•} [NeZero m] {hm : m โˆฃ Fintype.card F} {R : Type u_2} [Ring R] [StarRing R] [Algebra โ„‚ R] [StarModule โ„‚ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (hm4 : 4 * m โˆฃ Fintype.card F) (hd : 1 โ‰ค d) {S : Question F m โ†’ POVMIn (Answer F m d) R} (hleg : LegalSupport S) (P : LPData F (4 * m)) {f : LIDT.LinePoly F (m * d + 1)} (hf : ยฌDegLE f d) :

          The support half of lem:qld-axis-degree, at the padded line measurement: on an axis-parallel padded line, the padded line measurement of a legally supported strategy has no element off the polynomials of degree at most d. This is what makes its outcome a legal answer to an axis-parallel line question of the seeded test at (q, 4m, d, 1).

          The consistency bound #

          theorem MIPRE.QLD.padded_lines_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 โ„ฌ] {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) โ„ฌ} {ฮต : โ„} (hm4 : 4 * m โˆฃ Fintype.card F) (hM : โ€–M.ฯˆโ€– = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB โ‰ค ฮต) (hPA : โˆ€ (q : Question F m), IsPVMIn (PA q).op) (hPB : โˆ€ (q : Question F m), IsPVMIn (PB q).op) (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (hfacX : FactorsX PX) (hfacZ : FactorsZ PZ) (hX1 : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm (PX.lineMats d PA c f) (PX.lineMats d PB c f) โ‰ค 172 * ฮต) (hX2 : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm (hatMats PA Bas.X (c.pt Bas.X) a) (PX.lineEvalMats d PB c a) โ‰ค 172 * ฮต) (hZ2 : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ b : F, (M.reg (Anc F m)).xSqNorm (hatMats PA Bas.Z (c.pt Bas.Z) b) (PZ.lineEvalMats d PB c b) โ‰ค 172 * ฮต) {ฮตc : โ„} (hcoll : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * collProb PX d c โ‰ค ฮตc) (ty : LIDT.CL.Ty) (s : F) :
          (1 - avgSubAB hm4 hm ty s fun (a b : F) (cX cZ : LPData F m) => โˆ‘ v : F, (M.reg (Anc F m)).bornProb (ptComb (sand (hatMats PA Bas.X cX.pt) (hatMats PA Bas.Z cZ.pt)) a b v) (lineComb PX PZ d PB (pairCX (cX, cZ)) (pairCZ (cX, cZ)) a b v)) โ‰ค โ†‘m * โ†‘m * deltaPairs ฮต ฮตc

          lem:qld-padded-lines, the consistency bound. On the padded line-point law, at every padded seed and line type, the first player's combined point measurement --- the sandwich of the expanded point measurements, read along (alpha, beta) at the sampled point --- agrees in the expanded model M.reg (Anc F m) with the second player's pasted line measurement coarse-grained by the combining map, up to m^2 * delta_P.

          The proof is the coarse-graining step and then the two domination lemmas: agreement only increases under a common coarse-graining, the padded law is at most m^2 times the product law (avgSub_le_mul_avgAll), and (alpha, beta) is uniform and independent of both sublines (avgSubAB_le_of_forall). The paper's Claims 17-1 to 17-3 are not used; see reports/padded-lines-product-law.md.

          The other register version #

          The paper's lem:qld-4-13 asserts the relation in both orientations. The second is the first applied to the exchanged model M.swap, with the two strategies exchanged, read back through hatVec_swapVec_xSqNorm and hatVec_swapVec_bornProb --- the route Swap.lean takes for the expansion stage's point items. The two mirrored inputs are lem:qld-expanded-lines' second item with the players exchanged.

          theorem MIPRE.QLD.padded_lines_consistency_swap {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 โ„ฌ] {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) โ„ฌ} {ฮต : โ„} (hm4 : 4 * m โˆฃ Fintype.card F) (hM : โ€–M.ฯˆโ€– = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB โ‰ค ฮต) (hPA : โˆ€ (q : Question F m), IsPVMIn (PA q).op) (hPB : โˆ€ (q : Question F m), IsPVMIn (PB q).op) (PX : LinePres F m hm Bas.X) (PZ : LinePres F m hm Bas.Z) (hfacX : FactorsX PX) (hfacZ : FactorsZ PZ) (hX1 : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ f : LIDT.LinePoly F (m * d), (M.reg (Anc F m)).xSqNorm (PX.lineMats d PA c f) (PX.lineMats d PB c f) โ‰ค 172 * ฮต) (hX2' : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ a : F, (M.reg (Anc F m)).xSqNorm (PX.lineEvalMats d PA c a) (hatMats PB Bas.X (c.pt Bas.X) a) โ‰ค 172 * ฮต) (hZ2' : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * โˆ‘ b : F, (M.reg (Anc F m)).xSqNorm (PZ.lineEvalMats d PA c b) (hatMats PB Bas.Z (c.pt Bas.Z) b) โ‰ค 172 * ฮต) {ฮตc : โ„} (hcoll : โˆ‘ c : Content F m, (โ†‘(Fintype.card (Content F m)))โปยน * collProb PX d c โ‰ค ฮตc) (ty : LIDT.CL.Ty) (s : F) :
          (1 - avgSubAB hm4 hm ty s fun (a b : F) (cX cZ : LPData F m) => โˆ‘ v : F, (M.reg (Anc F m)).bornProb (lineComb PX PZ d PA (pairCX (cX, cZ)) (pairCZ (cX, cZ)) a b v) (ptComb (sand (hatMats PB Bas.X cX.pt) (hatMats PB Bas.Z cZ.pt)) a b v)) โ‰ค โ†‘m * โ†‘m * deltaPairs ฮต ฮตc

          lem:qld-padded-lines, the consistency bound in the other register version: the first player's pasted line measurement against the second player's combined point measurement, in the expanded model.