Documentation

MIPRE.Background.LIDT.Co.Test.StrategyPolynomialFamilies

Polynomial-family interfaces for the low individual degree test #

Packaged slice-indexed polynomial families x ↦ G^x with their witness operators and domination targets, and the predicates (completeness, consistency with points, strong self-consistency, boundedness) that the induction step asks of them: the counterpart of MIPRE/Background/LIDT/MIPStarRE/LDT/Test/StrategyPolynomialFamilies.lean in the port of planning/c6b-plan.md (milestone M4, section "Port conventions").

A family IdxPolyFamily params 𝔓 lives in the local C*-algebra 𝔓 (the vendored Op ΞΉ); the predicates that read a state take the symmetric model S : SymModel 𝔓 K in place of the vendored ψ : QuantumState (ΞΉ Γ— ΞΉ), or a symmetric strategy SymStrat params.next 𝔓 K, and place the local operators on the two factors by S.L and S.R (the vendored leftTensor (ΞΉβ‚‚ := ΞΉ), rightTensor (ι₁ := ΞΉ)).

Not ported #

Every declaration of the vendored file has a counterpart here.

References #

In LionSR/MIPStarRE at commit 507e8122, not in this repository:

Polynomial-family interfaces #

structure MIPRE.LIDT.Co.IdxPolyFamily (params : MIPStarRE.LDT.Parameters) [MIPStarRE.LDT.FieldModel params.q] (𝔓 : Type u_1) [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] :
Type (max u_1 u_2)

A packaged family x ↦ G^x together with its witness operators and domination targets.

The witness and dominationTarget fields store the per-slice positive operator Z^x and per-slice, per-polynomial operator E_u A^{u,x}_{g(u)} appearing in the paper's boundedness hypothesis (references/ldt-paper/commutativity-G.tex, item data-processed-boundedness). We store these operators explicitly rather than hiding them behind ambient defaults, so each constructor must choose an honest witness/target pair.

Callers without access to an ambient strategy can use ofSliceMeas, which takes Z^x := βˆ‘_g G^x_g and dominationTarget x g := G^x_g. Callers with access to a symmetric strategy should prefer the constructor ofSymStrat, which derives both fields from the strategy itself.

Instances For
    def MIPRE.LIDT.Co.IdxPolyFamily.ofSliceMeas {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) :
    IdxPolyFamily params 𝔓

    Honest local constructor when only the slice family x ↦ G^x is available.

    This uses the slice total βˆ‘_g G^x_g as the witness operator and the concrete outcome G^x_g as the domination target.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      @[simp]
      theorem MIPRE.LIDT.Co.IdxPolyFamily.ofSliceMeas_meas {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) :
      (ofSliceMeas meas).meas = meas

      The slice family of ofSliceMeas meas is meas.

      @[simp]
      theorem MIPRE.LIDT.Co.IdxPolyFamily.ofSliceMeas_witness {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) (x : MIPStarRE.LDT.Fq params) :
      (ofSliceMeas meas).witness x = (meas x).total

      The witness of ofSliceMeas meas is the slice total.

      @[simp]

      The domination target of ofSliceMeas meas is the slice outcome.

      noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.averagedSubMeas {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (family : IdxPolyFamily params 𝔓) :

      The averaged submeasurement G = E_x G^x: average the slice measurements over the uniform distribution on slice heights x ∈ F_q.

      Equations
      Instances For
        noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.evaluatedAtNextPoint {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (family : IdxPolyFamily params 𝔓) :

        Evaluate the slice family at a point (u, x) in F_q^{m+1}.

        Equations
        Instances For
          noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.averagedPointEvaluationOperator {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params 𝔓 K) (h : MIPStarRE.LDT.Polynomial params) :
          𝔓

          Averaged point operator E_u A^u_{h(u)} appearing in source-style boundedness assumptions.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.averagedSlicePointEvaluationOperator {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (x : MIPStarRE.LDT.Fq params) (g : MIPStarRE.LDT.Polynomial params) :
            𝔓

            Slice-wise averaged point operator E_u A^{u,x}_{g(u)} from the paper's boundedness hypothesis.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.averagedSliceTotalOperator {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (x : MIPStarRE.LDT.Fq params) :
              𝔓

              Slice-wise averaged total operator E_u \sum_a A^{u,x}_a.

              For a genuine symmetric strategy this simplifies to 1, but keeping the strategy-shaped formula explicit records where the witness comes from.

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

                The slice-wise averaged total operator of a symmetric strategy is 1.

                noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.ofSymStrat {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) :
                IdxPolyFamily params 𝔓

                Paper-facing constructor: bundle a slice submeasurement with a symmetric strategy so that both the domination target and the witness are derived from the strategy itself.

                Concretely, dominationTarget x g is the averaged slice-point evaluation operator E_u A^{u,x}_{g(u)} from references/ldt-paper/commutativity-G.tex, and witness x is the corresponding averaged slice-total operator E_u \sum_a A^{u,x}_a. Since point measurements are genuine measurements, this witness simplifies to 1, but its stored definition keeps the provenance explicit.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  @[simp]
                  theorem MIPRE.LIDT.Co.IdxPolyFamily.ofSymStrat_meas {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) :
                  (ofSymStrat strategy meas).meas = meas

                  The slice family of ofSymStrat strategy meas is meas.

                  The witness of ofSymStrat strategy meas is the averaged slice-total operator.

                  @[simp]
                  theorem MIPRE.LIDT.Co.IdxPolyFamily.ofSymStrat_witness {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) (x : MIPStarRE.LDT.Fq params) :
                  (ofSymStrat strategy meas).witness x = 1

                  The witness of ofSymStrat strategy meas is 1.

                  @[simp]
                  theorem MIPRE.LIDT.Co.IdxPolyFamily.ofSymStrat_dominationTarget {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (meas : IdxProjSubMeas (MIPStarRE.LDT.Fq params) (MIPStarRE.LDT.Polynomial params) 𝔓) (x : MIPStarRE.LDT.Fq params) (g : MIPStarRE.LDT.Polynomial params) :

                  The domination target of ofSymStrat strategy meas is the averaged slice-point evaluation operator.

                  structure MIPRE.LIDT.Co.IdxPolyFamily.Complete {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (family : IdxPolyFamily params 𝔓) (S : SymModel 𝔓 K) (kappa : ℝ) :

                  Completeness of a family: its averaged submeasurement, placed on the first factor, has mass at least 1 - kappa.

                  Instances For
                    structure MIPRE.LIDT.Co.IdxPolyFamily.ConsistentWithPoints {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (family : IdxPolyFamily params 𝔓) (strategy : SymStrat params.next 𝔓 K) (zeta : ℝ) :

                    Consistency of a family with the point measurements of a strategy on F_q^{m+1}.

                    Instances For
                      theorem MIPRE.LIDT.Co.IdxPolyFamily.zeta_nonneg_of_consistentWithPoints {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (family : IdxPolyFamily params 𝔓) {zeta : ℝ} (hcons : family.ConsistentWithPoints strategy zeta) :
                      0 ≀ zeta

                      A family point-consistency witness forces the displayed point-consistency error parameter ΞΆ to be nonnegative.

                      structure MIPRE.LIDT.Co.IdxPolyFamily.StronglySelfConsistent {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (family : IdxPolyFamily params 𝔓) (S : SymModel 𝔓 K) (zeta : ℝ) :

                      Strong self-consistency of a family: its left and right placements are zeta-close in state-dependent distance, on average over the slices.

                      Instances For
                        structure MIPRE.LIDT.Co.IdxPolyFamily.SliceBoundednessInput {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (family : IdxPolyFamily params 𝔓) (zeta : ℝ) :

                        Paper-faithful boundedness input for slice-indexed polynomial families.

                        This structure encodes the boundedness item in references/ldt-paper/commutativity-G.tex and references/ldt-paper/ld-pasting.tex. It consists of positive witnesses Z^x, the averaged residual bound E_x ⟨Ψ| (I - G^x) βŠ— Z^x |Ψ⟩ ≀ zeta, and the domination condition Z^x β‰₯ E_u A^{u,x}_{g(u)}.

                        The domination condition is stated directly against the averaged point operator from the strategy. It is not mediated through family.dominationTarget, so this public input does not contain an additional identification bridge.

                        Instances For
                          noncomputable def MIPRE.LIDT.Co.IdxPolyFamily.SliceBoundednessInput.storedResidual {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] {strategy : SymStrat params.next 𝔓 K} {family : IdxPolyFamily params 𝔓} {zeta : ℝ} (_hbound : SliceBoundednessInput strategy family zeta) (G : MIPStarRE.LDT.Fq params β†’ SubMeas (MIPStarRE.LDT.Polynomial params) 𝔓) (x : MIPStarRE.LDT.Fq params) :

                          The boundedness residual obtained from a concrete slice family G.

                          Paper origin: references/ldt-paper/inductive_step.tex:461-551 (\label{thm:self-improvement-in-induction-section}), especially the boundedness field of the slice-wise self-improvement output.

                          This is the induction-oriented Z^x βŠ— (I - G^x) term after replacing the abstract slice family by the concrete G, written in the paper's (I - G^x) βŠ— Z^x orientation.

                          Equations
                          Instances For
                            theorem MIPRE.LIDT.Co.IdxPolyFamily.SliceBoundednessInput.storedBoundedResidualBound {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] {strategy : SymStrat params.next 𝔓 K} {family : IdxPolyFamily params 𝔓} {zeta : ℝ} (hbound : SliceBoundednessInput strategy family zeta) (G : MIPStarRE.LDT.Fq params β†’ SubMeas (MIPStarRE.LDT.Polynomial params) 𝔓) (hG : βˆ€ (x : MIPStarRE.LDT.Fq params), G x = (family.meas x).toSubMeas) :

                            Stored residual half of the boundedness hypothesis.

                            This is exactly the paper's (I-G^x) βŠ— Z^x residual bound from references/ldt-paper/commutativity-G.tex.

                            theorem MIPRE.LIDT.Co.IdxPolyFamily.SliceBoundednessInput.averagedPoint_le_witness {𝔓 : Type u_1} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type u_2} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] {params : MIPStarRE.LDT.Parameters} [MIPStarRE.LDT.FieldModel params.q] {strategy : SymStrat params.next 𝔓 K} {family : IdxPolyFamily params 𝔓} {zeta : ℝ} (hbound : SliceBoundednessInput strategy family zeta) (x : MIPStarRE.LDT.Fq params) (g : MIPStarRE.LDT.Polynomial params) :

                            Paper-faithful domination half of the boundedness hypothesis.

                            This is the line Z^x β‰₯ E_u A^{u,x}_{g(u)} from references/ldt-paper/commutativity-G.tex.