LIDT definitions: LDT / Pasting / ComparisonLemmas / LdSandwichLineOnePoint / EndpointEquivs
DefinitionLIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_EndpointEquivslidt
This bundle defines equivalences that reorganize one-point Ld sandwich-line questions and outcomes. It also supplies postprocessing of submeasurements into measurements, allowing endpoint expressions to be split, reassociated, rotated, and reversed in the order required by the comparison proof.
Principal definitions:
postprocessMeasurement: turns a postprocessed submeasurement into a measurement.sandwichedLineQuestionSplitAtEquiv: splits a sandwich-line question at a selected slice coordinate.sandwichedLineQuestionPrefixEquiv: separates the prefix and tail of a sandwich-line question.prodPrefixReassocEquiv: reassociates a nested product with the prefix first.sandwichedLineQuestionPrefixFstEquiv: views the prefix as the first product coordinate.pointTupleLastFrontEquiv: rotates the last point coordinate to the front.gHatTupleOutcomeLastFrontEquiv: performs the analogous rotation for completed outcomes.pointTupleLastReverseEquiv: moves the last coordinate to the front and reverses the preceding prefix.
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).
Definition code
-- Generated from MIPStarRE/LDT/Pasting/ComparisonLemmas/LdSandwichLineOnePoint/EndpointEquivs.lean by skeleton subtraction.
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_LinePolynomialEmbedding
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_CommutativityPoints_Approximation
import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_SharedHelpers_SharedLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Defs_Normalization
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Defs_Stability
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_EvaluatedSliceBounds_PhaseOneThree
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_GCommStability_Scalar_First
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_GCommStability_Scalar_RawSecond
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Main_Auxiliary_HEvalTransport
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Main_Auxiliary_ScalarMarginalization
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Scaffold_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Scaffold_Products
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_PaperChainPhaseFive
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_ProcessedG_MainChain
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_ProcessedG_PhaseTwo
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Averages
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Marginalization_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Marginalization_Y
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Normalization
import Definitions.Def_LIDT_MIPStarRE_LDT_Commutativity_Transport_Pullback
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_BackChain
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Base
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Chain
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_FlatChain
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Lifting
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_Setup_Definitions
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Tuples
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Sandwich_GHatSandwich
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Sandwich_PastedFamilies
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Sandwich_Switcheroo
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Statements
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_SwitcherooContraction_ScalarTerms
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_SwitcherooContraction_Split
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_SwitcherooSetup_Centers
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_SwitcherooSetup_Terms
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_BipartiteSelfConsistency_Completion
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_BipartiteSelfConsistency_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_BipartiteSelfConsistency_Local
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_CauchySchwarz
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_ComparisonCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_CompletionTransfer
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_DistanceBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_PolynomialAgreement
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_Polynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SelfConsistency_Extensions
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_LDT_Test_StrategyFailures
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyPolynomialFamilies
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyRole_Algebra
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyRole_Core
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 Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
import Mathlib
import Mathlib.Algebra.MvPolynomial.CommRing
import Mathlib.Algebra.MvPolynomial.SchwartzZippel
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.MeanInequalitiesPow
import Mathlib.Probability.ProbabilityMassFunction.Integrals
import Mathlib.Probability.ProbabilityMassFunction.Monad
import Mathlib.RingTheory.MvPolynomial.Basic
namespace LIDT
namespace MIPStarRE.LDT
end MIPStarRE.LDT
namespace MIPStarRE.LDT.Commutativity
end MIPStarRE.LDT.Commutativity
namespace MIPStarRE.LDT.Commutativity.GCommStability.Scalar
end MIPStarRE.LDT.Commutativity.GCommStability.Scalar
namespace MIPStarRE.LDT.CommutativityPoints
end MIPStarRE.LDT.CommutativityPoints
namespace MIPStarRE.LDT.Pasting
end MIPStarRE.LDT.Pasting
namespace MIPStarRE.LDT.Preliminaries
end MIPStarRE.LDT.Preliminaries
/-!
# Section 12 pasting: line one-point transport — endpoint equivalences
Internal helper module; part of the file-split for `#1127`.
## References
- `references/ldt-paper/ld-pasting.tex`
- `blueprint/src/chapter/ch09_pasting.tex`
-/
@[expose] public section
namespace MIPStarRE.LDT.Pasting
open MIPStarRE.LDT
open MIPStarRE.LDT.ExpansionHypercubeGraph
open MIPStarRE.LDT.CommutativityPoints
open scoped BigOperators MatrixOrder _root_.Matrix ComplexOrder
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
/-- Turn a postprocessed submeasurement from a measurement into a measurement. -/
noncomputable def postprocessMeasurement
{α β : Type*} {ι : Type*}
[Fintype α] [Fintype β] [Fintype ι] [DecidableEq ι]
(B : Measurement α ι) (f : α → β) : Measurement β ι where
toSubMeas := postprocess B.toSubMeas f
total_eq_one := (postprocess_total B.toSubMeas f).trans B.total_eq_one
/-- Split a sandwiched-line question at one selected slice coordinate. -/
noncomputable def sandwichedLineQuestionSplitAtEquiv
(params : Parameters) [FieldModel params.q]
{k : ℕ} (i : Fin k) :
SandwichedLineQuestion params k ≃
(Point params × Fq params) × ({j : Fin k // j ≠ i} → Fq params) where
toFun q := ((q.1, q.2 i), fun j => q.2 j.1)
invFun q :=
(q.1.1, (Equiv.funSplitAt i (Fq params)).symm (q.1.2, q.2))
left_inv := fun ⟨u, xs⟩ => by
simpa [Equiv.funSplitAt] using
congrArg (fun ys : PointTuple params k => (u, ys))
((Equiv.funSplitAt i (Fq params)).left_inv xs)
right_inv := fun ⟨⟨u, x⟩, xs⟩ => by
simp only [ne_eq, Equiv.funSplitAt_symm_apply, ↓reduceDIte, Subtype.coe_eta, dite_eq_ite,
Prod.mk.injEq, true_and]
funext j
simp [j.2]
/-- Split a sandwiched-line question into the prefix through `i` and the tail. -/
noncomputable def sandwichedLineQuestionPrefixEquiv
(params : Parameters) [FieldModel params.q]
{k i : ℕ} (hi : i < k) :
SandwichedLineQuestion params k ≃
(Point params × PointTuple params (i + 1)) × ({j : Fin k // i < j.1} → Fq params) where
toFun q := ((q.1, fun j => q.2 ⟨j.1, by omega⟩), fun j => q.2 j.1)
invFun q :=
(q.1.1, fun j =>
if hji : j.1 ≤ i then
q.1.2 ⟨j.1, by omega⟩
else
q.2 ⟨j, by omega⟩)
left_inv := fun ⟨u, xs⟩ => by simp
right_inv := fun ⟨⟨u, xsPrefix⟩, xsRest⟩ => by
simp only [Fin.eta, Subtype.coe_eta, Prod.mk.injEq, true_and]
constructor
· funext j
have hji : (j : ℕ) ≤ i := by omega
simp [hji]
· funext j
have hji : ¬ (j.1.1 ≤ i) := by omega
simp [hji]
/-- Reassociate a nested product so the prefix coordinate becomes first. -/
def prodPrefixReassocEquiv (α β γ : Type*) : ((α × β) × γ) ≃ β × (α × γ) where
toFun q := (q.1.2, (q.1.1, q.2))
invFun q := ((q.2.1, q.1), q.2.2)
left_inv := fun _ => rfl
right_inv := fun _ => rfl
/-- View the prefix of a sandwiched-line question as the first product coordinate. -/
noncomputable def sandwichedLineQuestionPrefixFstEquiv
(params : Parameters) [FieldModel params.q]
{k i : ℕ} (hi : i < k) :
SandwichedLineQuestion params k ≃
PointTuple params (i + 1) × (Point params × ({j : Fin k // i < j.1} → Fq params)) :=
(sandwichedLineQuestionPrefixEquiv params hi).trans
(prodPrefixReassocEquiv (Point params) (PointTuple params (i + 1))
({j : Fin k // i < j.1} → Fq params))
/-- Rotate the last coordinate of a prefix tuple to the front. -/
def pointTupleLastFrontEquiv
(params : Parameters) (i : ℕ) :
PointTuple params (i + 1) ≃ PointTuple params (i + 1) where
toFun xs := Fin.cons (xs ⟨i, Nat.lt_succ_self i⟩) (fun j => xs ⟨j.1, by omega⟩)
invFun xs := fun j =>
if hji : j.1 = i then
xs 0
else
xs ⟨j.1 + 1, by omega⟩
left_inv := fun xs => by
funext j
by_cases hji : j.1 = i
· have hj : j = ⟨i, Nat.lt_succ_self i⟩ := Fin.ext hji
subst j
simp
· have hjlt : j.1 < i := by omega
simp only [hji, ↓reduceDIte]
rw [show (⟨j.1 + 1, by omega⟩ : Fin (i + 1)) = Fin.succ ⟨j.1, hjlt⟩ by
ext
rfl]
simp only [Fin.succ_mk]
exact congrArg xs (Fin.ext rfl)
right_inv := fun xs => by
funext j
cases j using Fin.cases with
| zero => simp
| succ j =>
have hne : ¬ j.1 = i := by omega
simp only [hne, ↓reduceDIte, Fin.cons_succ]
exact congrArg xs (Fin.ext rfl)
/-- Rotate the last completed-slice outcome of a prefix tuple to the front. -/
def gHatTupleOutcomeLastFrontEquiv
(params : Parameters) [FieldModel params.q] (i : ℕ) :
GHatTupleOutcome params (i + 1) ≃ GHatTupleOutcome params (i + 1) where
toFun gs := Fin.cons (gs ⟨i, Nat.lt_succ_self i⟩) (fun j => gs ⟨j.1, by omega⟩)
invFun gs := fun j =>
if hji : j.1 = i then
gs 0
else
gs ⟨j.1 + 1, by omega⟩
left_inv := fun gs => by
funext j
by_cases hji : j.1 = i
· have hj : j = ⟨i, Nat.lt_succ_self i⟩ := Fin.ext hji
subst j
simp
· have hjlt : j.1 < i := by omega
simp only [hji, ↓reduceDIte]
rw [show (⟨j.1 + 1, by omega⟩ : Fin (i + 1)) = Fin.succ ⟨j.1, hjlt⟩ by
ext
rfl]
simp only [Fin.succ_mk]
exact congrArg gs (Fin.ext rfl)
right_inv := fun gs => by
funext j
cases j using Fin.cases with
| zero => simp
| succ j =>
have hne : ¬ j.1 = i := by omega
simp only [hne, ↓reduceDIte, Fin.cons_succ]
exact congrArg gs (Fin.ext rfl)
/-- Move the last coordinate to the front and reverse the preceding prefix. -/
def pointTupleLastReverseEquiv
(params : Parameters) (i : ℕ) :
PointTuple params (i + 1) ≃ PointTuple params (i + 1) where
toFun xs := Fin.cons (xs ⟨i, Nat.lt_succ_self i⟩)
(fun j => xs ⟨i - 1 - j.1, by omega⟩)
invFun xs := fun j =>
if hji : j.1 = i then
xs 0
else
xs ⟨i - j.1, by omega⟩
left_inv := fun xs => by
funext j
by_cases hji : j.1 = i
· have hj : j = ⟨i, Nat.lt_succ_self i⟩ := Fin.ext hji
subst j
simp
· simp only [hji, ↓reduceDIte]
have hjlt : j.1 < i := by omega
rw [show (⟨i - (j : ℕ), by omega⟩ : Fin (i + 1)) =
Fin.succ ⟨i - 1 - (j : ℕ), by omega⟩ by
ext
change i - (j : ℕ) = i - 1 - (j : ℕ) + 1
omega]
simp only [Fin.cons_succ]
have hle : (j : ℕ) ≤ i - 1 := by omega
exact congrArg xs (Fin.ext (Nat.sub_sub_self hle))
right_inv := fun xs => by
funext j
cases j using Fin.cases with
| zero => simp
| succ j =>
have hne : ¬ i - 1 - j.1 = i := by omega
simp only [Fin.cons_succ, hne, ↓reduceDIte]
have hle : (j : ℕ) ≤ i - 1 := by omega
exact congrArg xs (Fin.ext (by
change i - (i - 1 - (j : ℕ)) = (j : ℕ) + 1
omega))
/-- Move the last completed-slice outcome to the front and reverse the preceding prefix. -/
def gHatTupleOutcomeLastReverseEquiv
(params : Parameters) [FieldModel params.q] (i : ℕ) :
GHatTupleOutcome params (i + 1) ≃ GHatTupleOutcome params (i + 1) where
toFun gs := Fin.cons (gs ⟨i, Nat.lt_succ_self i⟩)
(fun j => gs ⟨i - 1 - j.1, by omega⟩)
invFun gs := fun j =>
if hji : j.1 = i then
gs 0
else
gs ⟨i - j.1, by omega⟩
left_inv := fun gs => by
funext j
by_cases hji : j.1 = i
· have hj : j = ⟨i, Nat.lt_succ_self i⟩ := Fin.ext hji
subst j
simp
· simp only [hji, ↓reduceDIte]
have hjlt : j.1 < i := by omega
rw [show (⟨i - (j : ℕ), by omega⟩ : Fin (i + 1)) =
Fin.succ ⟨i - 1 - (j : ℕ), by omega⟩ by
ext
change i - (j : ℕ) = i - 1 - (j : ℕ) + 1
omega]
simp only [Fin.cons_succ]
have hle : (j : ℕ) ≤ i - 1 := by omega
exact congrArg gs (Fin.ext (Nat.sub_sub_self hle))
right_inv := fun gs => by
funext j
cases j using Fin.cases with
| zero => simp
| succ j =>
have hne : ¬ i - 1 - j.1 = i := by omega
simp only [Fin.cons_succ, hne, ↓reduceDIte]
have hle : (j : ℕ) ≤ i - 1 := by omega
exact congrArg gs (Fin.ext (by
change i - (i - 1 - (j : ℕ)) = (j : ℕ) + 1
omega))
/-- Split a completed-slice outcome tuple into the first `n` coordinates and the last one. -/
def gHatTupleOutcomePrefixLastEquiv
(params : Parameters) [FieldModel params.q] (n : ℕ) :
GHatTupleOutcome params (n + 1) ≃ GHatTupleOutcome params n × GHatOutcome params where
toFun gs := (fun j => gs ⟨j.1, by omega⟩, gs ⟨n, Nat.lt_succ_self n⟩)
invFun p := fun j =>
if hj : j.1 < n then p.1 ⟨j.1, hj⟩ else p.2
left_inv := fun gs => by
funext j
by_cases hj : j.1 < n
· simp [hj]
· have hjeq : j.1 = n := by omega
have hfin : j = ⟨n, Nat.lt_succ_self n⟩ := Fin.ext hjeq
subst j
simp
right_inv := fun ⟨gs, g⟩ => by
simp only [Prod.mk.injEq]
constructor
· funext j
simp [j.2]
· simp
end MIPStarRE.LDT.Pasting
end
end LIDT
Source