Evaluate At Complete At Outcome
ProvedLIDT.MIPStarRE.LDT.Preliminaries.evaluateAt_completeAtOutcomeEvaluation commutes with completion at the induced outcome.
Let H be a polynomial-valued submeasurement, let h0 be a polynomial, and let u be a point. Evaluating the completion of H at h0 is the same as first evaluating H at u and then completing at the field value h0 u:
The equality is at the underlying submeasurement level. It lets pointwise consistency arguments move freely between polynomial completion and evaluated finite-outcome completion.
Formalization credit: Sirui Lu, Ruixuan Deng, Yanqiao Zhu, and Zhengfeng Ji (arXiv:2609.19814). Mathematical source: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (arXiv:2009.12982).
Formalization Note. The source declaration is MIPStarRE.LDT.Preliminaries.evaluateAt_completeAtOutcome; its Lean statement gives the exact quantifier order and all boundary hypotheses.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DistributionAvg import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DistributionUniformSums import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_MeasurementLift import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OperatorExpectations import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFAverages import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFUniformAverages import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementCore import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_TensorPlacement import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_BipartiteSelfConsistency_Core import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_ComparisonCore import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_DistanceBounds import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichMain_Completeness import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_ApproxDelta import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_Core import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_InnerProduct import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_QuantumNonneg import Definitions.Def_LIDT_MIPStarRE_LDT_Test_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing import Mathlib import Mathlib.Analysis.MeanInequalitiesPow import Mathlib.Probability.ProbabilityMassFunction.Integrals import Mathlib.Probability.ProbabilityMassFunction.Monad namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries open LIDT /-! # Preliminary comparison theorems: bipartite self-consistency (completion) Completion-transfer lemmas for bipartite self-consistency. The constant `Unit`-family reductions identify `sddError` and `sscError` with their pointwise forms, and the later lemmas compare a submeasurement with its completion. ## References - `references/ldt-paper/preliminaries.tex` - `blueprint/src/chapter/ch03_preliminaries.tex` -/ @[expose] public section open scoped BigOperators MatrixOrder _root_.Matrix ComplexOrder open LIDT.MIPStarRE.LDT.Preliminaries open MIPStarRE.LDT
lemma LIDT.MIPStarRE.LDT.Preliminaries.evaluateAt_completeAtOutcome
{ι : Type*} [Fintype ι] [DecidableEq ι]
(params : _root_.LIDT.MIPStarRE.LDT.Parameters)
[_root_.LIDT.MIPStarRE.LDT.FieldModel params.q]
(H : _root_.LIDT.MIPStarRE.LDT.SubMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial params) ι)
(h0 : _root_.LIDT.MIPStarRE.LDT.Polynomial params)
(u : _root_.LIDT.MIPStarRE.LDT.Point params) :
_root_.LIDT.MIPStarRE.LDT.evaluateAt params u (_root_.LIDT.MIPStarRE.LDT.Preliminaries.completeAtOutcome H h0).toSubMeas =
(_root_.LIDT.MIPStarRE.LDT.Preliminaries.completeAtOutcome (_root_.LIDT.MIPStarRE.LDT.evaluateAt params u H) (h0 u)).toSubMeas := by sorry