Restricted DLine Dist Eq Map Prod
ProvedMIPStarRE.QPBT.restrictedDLineDist_eq_map_prodThe i-th restricted diagonal-line law is the law of the canonical diagonal line through a uniform point block, in the prefix-projected direction of an independent fresh diagonal direction pair at index i, together with that same point. Blueprint lem:qld-sublines, paper references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1063-1116.
All objects, parameters, typeclass assumptions, and hypotheses are quantified in the accompanying formal statement; each symbol denotes the object of the displayed Lean type with that name. The conclusion is the proposition
This result is an importable reduction step in the formal dependency graph for the quantum Pauli basis test completeness or soundness argument.
Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.
Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.
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_LinePolynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily 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_CommutativityPoints_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Combining_Defs import Definitions.Def_QPBT_QPBT_Combining_Lines_SubLineBlocks import Definitions.Def_QPBT_QPBT_Combining_Lines_SubLineSupport import Definitions.Def_QPBT_QPBT_Games_DistributionAux import Definitions.Def_QPBT_QPBT_Observables_LineDefs import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Independent blocks of the restricted line-point laws This module isolates the independent generating blocks of the restricted line-point laws used by the sampling procedure of the sub-line lemma. A uniformly sampled low-degree vector splits into a point block and a seed-direction block; the coordinate-index event constrains only the second block, so conditioning on it leaves the point block uniform and independent. The conditioned seed-direction block is the fresh diagonal direction pair of the sub-line construction, and the uniform mixture of those pairs over the coordinate index is the unconditioned law. ## References The generating descriptions support `lem:qld-sublines` in blueprint `lem:qld-sublines`, whose source is `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1063-1116`. The restricted laws themselves are `def:ith-restricted-line`, blueprint lines 1209--1228, paper lines 1038--1048. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT /-! ## The block decomposition of an ambient low-degree vector -/ /-! ## Fresh diagonal direction pairs -/ /-! ## Independence of the point block under the coordinate-index event -/ /-! ## Generating form of the restricted line-point laws -/
theorem MIPStarRE.QPBT.restrictedDLineDist_eq_map_prod (L : _root_.MIPStarRE.QPBT.LdParams) (i : Fin L.m) :
_root_.MIPStarRE.QPBT.restrictedDLineDist L i =
(_root_.MIPStarRE.QPBT.Distribution.prod (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin L.m → _root_.MIPStarRE.QPBT.ScalarQ L))
(_root_.MIPStarRE.QPBT.freshDiagonalPairDist L i)).map
(fun w => (_root_.MIPStarRE.QPBT.dLineDescOfBlock L w, w.1)) := by sorry