Documentation

MIPRE.Background.LIDT.MIPStarRE.LDT.Test.StrategyPolynomialFamilies

Polynomial-family interfaces for the low individual degree test #

Packaged slice-indexed polynomial-family interfaces extracted from MIPStarRE.LDT.Test.Strategy.

Polynomial-family interfaces #

structure MIPStarRE.LDT.IdxPolyFamily (params : Parameters) [FieldModel params.q] (ι : Type u_1) [Fintype ι] [DecidableEq ι] :
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 PSD 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 MIPStarRE.LDT.IdxPolyFamily.ofSliceMeas {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (meas : IdxProjSubMeas (Fq params) (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 MIPStarRE.LDT.IdxPolyFamily.ofSliceMeas_meas {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) :
      (ofSliceMeas meas).meas = meas
      @[simp]
      theorem MIPStarRE.LDT.IdxPolyFamily.ofSliceMeas_witness {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) (x : Fq params) :
      (ofSliceMeas meas).witness x = (meas x).total
      @[simp]
      theorem MIPStarRE.LDT.IdxPolyFamily.ofSliceMeas_dominationTarget {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) (x : Fq params) (g : Polynomial params) :
      (ofSliceMeas meas).dominationTarget x g = (meas x).outcome g
      noncomputable def MIPStarRE.LDT.IdxPolyFamily.averagedSubMeas {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (family : IdxPolyFamily params ι) :
      SubMeas (Polynomial 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 MIPStarRE.LDT.IdxPolyFamily.evaluatedAtNextPoint {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (family : IdxPolyFamily params ι) :
        IdxSubMeas (Point params.next) (Fq params) ι

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

        Equations
        Instances For
          noncomputable def MIPStarRE.LDT.IdxPolyFamily.averagedPointEvaluationOperator {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params ι) (h : 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 MIPStarRE.LDT.IdxPolyFamily.averagedSlicePointEvaluationOperator {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (x : Fq params) (g : 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 MIPStarRE.LDT.IdxPolyFamily.averagedSliceTotalOperator {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (x : 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]
                theorem MIPStarRE.LDT.IdxPolyFamily.averagedSliceTotalOperator_eq_one {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (x : Fq params) :
                noncomputable def MIPStarRE.LDT.IdxPolyFamily.ofSymStrat {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (meas : IdxProjSubMeas (Fq params) (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 MIPStarRE.LDT.IdxPolyFamily.ofSymStrat_meas {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) :
                  (ofSymStrat strategy meas).meas = meas
                  theorem MIPStarRE.LDT.IdxPolyFamily.ofSymStrat_witness_eq_averagedSliceTotalOperator {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) (x : Fq params) :
                  (ofSymStrat strategy meas).witness x = averagedSliceTotalOperator strategy x
                  @[simp]
                  theorem MIPStarRE.LDT.IdxPolyFamily.ofSymStrat_witness {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) (x : Fq params) :
                  (ofSymStrat strategy meas).witness x = 1
                  @[simp]
                  theorem MIPStarRE.LDT.IdxPolyFamily.ofSymStrat_dominationTarget {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (meas : IdxProjSubMeas (Fq params) (Polynomial params) ι) (x : Fq params) (g : Polynomial params) :
                  structure MIPStarRE.LDT.IdxPolyFamily.Complete {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (family : IdxPolyFamily params ι) (ψ : QuantumState (ι × ι)) (kappa : Error) :
                  Instances For
                    structure MIPStarRE.LDT.IdxPolyFamily.ConsistentWithPoints {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (family : IdxPolyFamily params ι) (strategy : SymStrat params.next ι) (zeta : Error) :
                    Instances For
                      theorem MIPStarRE.LDT.IdxPolyFamily.zeta_nonneg_of_consistentWithPoints {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (family : IdxPolyFamily params ι) {zeta : Error} (hcons : family.ConsistentWithPoints strategy zeta) :
                      0 zeta

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

                      structure MIPStarRE.LDT.IdxPolyFamily.StronglySelfConsistent {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (family : IdxPolyFamily params ι) (ψ : QuantumState (ι × ι)) (zeta : Error) :
                      Instances For
                        structure MIPStarRE.LDT.IdxPolyFamily.SliceBoundednessInput {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] (strategy : SymStrat params.next ι) (family : IdxPolyFamily params ι) (zeta : Error) :

                        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 <psi| (I - G^x) tensor Z^x |psi> <= 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 MIPStarRE.LDT.IdxPolyFamily.SliceBoundednessInput.storedResidual {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] {strategy : SymStrat params.next ι} {family : IdxPolyFamily params ι} {zeta : Error} (_hbound : SliceBoundednessInput strategy family zeta) (G : Fq paramsSubMeas (Polynomial params) ι) (x : 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 MIPStarRE.LDT.IdxPolyFamily.SliceBoundednessInput.storedBoundedResidualBound {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] {strategy : SymStrat params.next ι} {family : IdxPolyFamily params ι} {zeta : Error} (hbound : SliceBoundednessInput strategy family zeta) (G : Fq paramsSubMeas (Polynomial params) ι) (hG : ∀ (x : Fq params), G x = (family.meas x).toSubMeas) :
                            (avgOver (uniformDistribution (Fq params)) fun (x : Fq params) => hbound.storedResidual G x) zeta

                            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 MIPStarRE.LDT.IdxPolyFamily.SliceBoundednessInput.averagedPoint_le_witness {params : Parameters} [FieldModel params.q] {ι : Type u_1} [Fintype ι] [DecidableEq ι] {strategy : SymStrat params.next ι} {family : IdxPolyFamily params ι} {zeta : Error} (hbound : SliceBoundednessInput strategy family zeta) (x : Fq params) (g : 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.