LIDT definitions: LDT / MainInductionStep / Theorems / StageDataConstructors
DefinitionLIDT_MIPStarRE_LDT_MainInductionStep_Theorems_StageDataConstructorslidt
This bundle contains constructors that convert answer-valued restricted slice data into the ordinary restriction, induction, and self-improvement records. The constructors preserve the stored failure probabilities and error bounds while forgetting auxiliary answer labels when appropriate.
Principal definitions:
- The restriction-data constructors build ordinary and answer-valued slice records from their probability conclusions.
- The per-slice induction constructors package recursive, main-induction, and hypothesis data.
- The self-improvement constructor transports the answer-valued data into the ordinary record.
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/MainInductionStep/Theorems/StageDataConstructors.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_SqrtBounds
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_ExpansionHypercubeGraph_Defs_Fourier
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_MatrixRealization_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_MatrixRealization_TraceForms
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Theorems_Foundations
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Theorems_Matrix
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Theorems_Results
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Families
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Operators
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_AlgebraicIdentity
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_Averaging
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_CollisionExpansion
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_MainTheorems
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_PolynomialSumBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_SelfConsistencyTransportSum
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_SelfConsistencyTransport_Point
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_SelfConsistencyTransport_PointLine
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_SelfConsistencyTransport_Utilities
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_Statements
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_TransportChain_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Theorems_TransportChain_SumForm
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Statements
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_InductionParameterBounds_MainError
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_InductionParameterBounds_Preliminaries
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_RestrictedProbabilities_AnswerValued
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_RestrictedProbabilities_Axis
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_RestrictedProbabilities_Base
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_RestrictedProbabilities_Diagonal
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_SelfImprovementAssembly_AnswerSlice
import Definitions.Def_LIDT_MIPStarRE_LDT_MainInductionStep_Theorems_SelfImprovementAssembly_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_LocalityPreservingRepair
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_NaimarkCore
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Orthonormalization
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Orthonormalization_Completion
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Orthonormalization_ErrorBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Orthonormalization_RestrictSome
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Projectivization
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_ProjectivizationChain_Basic
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayerIdentities_LayerAlgebra
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayerIdentities_PositiveGram_Completion
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayerIdentities_PositiveGram_Rows
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayerIdentities_PositiveGram_Sigma
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayerIdentities_ProjectorApprox
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_AlmostProjective
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_QCompleteness
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_RankReduction_LowRank
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_RankReduction_Sigma
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_QXPLayer_TruncationCombinatorics
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_SpectralTruncation_Conversion
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_SpectralTruncation_ProjectiveNonMeasurement
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Statements
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_Chain_FinalMove
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_Chain_HalfSandwich
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_StageA0M1
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_Core_BernoulliTail
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_Core_FactBundles
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_MoveLemmas_Basic
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_PaperBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_Scalar
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_ComparisonLemmas_LdSandwichLineOnePoint_CSSetup
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_Endpoint
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_EndpointEquivs
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_PrefixMoved
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_BadLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_BadMass
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_OverAllOutcomes_NonglobalDecomposition
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Core_LdGbcon
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_Completion
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_DataProcessing
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_Preliminaries_Triangles_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Base
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Canonical
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_CanonicalPrimal
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Canonical_Saturated
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Canonical_StrongDuality_Basic
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Canonical_StrongDuality_Separation
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_MatrixRealization_Canonical_Witness
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_AddInUFullStatement
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUDiagonalAndDefs_Residual
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUDiagonalAndDefs_ScalarChain
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUDiagonalAndDefs_Selection
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUPointConsistency
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep12_Algebra
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep12_Raw
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep12_Selected
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep34AndTransfer_Factored
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep34AndTransfer_Selected
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep34AndTransfer_Transfer
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_AddInUStep34AndTransfer_Variance
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_BoundednessTransport_BoundednessGap
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_BoundednessTransport_Decomposition
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_BoundednessTransport_PointConsistency
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_BoundednessTransport_PointConsistencyLiteral
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_CommonHelpers
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperCompleteness_Bracketed
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperCompleteness_FiberBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperCompleteness_InputSdp
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperCompleteness_Linearized
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperSSC_Assembly
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperSSC_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_HelperSSC_PostDeleteA
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_SdpMatrixBridge
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_SelfImprovementTop_Completeness
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_SelfImprovementTop_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_SelfImprovementTop_FinalFields
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Results_SelfImprovementTop_SelfCloseness
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Statements
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Thresholds_Final
import Definitions.Def_LIDT_MIPStarRE_LDT_SelfImprovement_Theorems_Thresholds_Helper
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_LdtSimp
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_LdtSimpAttr
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_FiniteConicDuality
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteHilbert
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 Definitions.Def_LIDT_MIPStarRE_Quantum_ProjectorONB
import Lean.Elab.Tactic
import Mathlib
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.MvPolynomial.CommRing
import Mathlib.Algebra.MvPolynomial.SchwartzZippel
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Order
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Convex.Cone.Dual
import Mathlib.Analysis.Convex.SpecificFunctions.Pow
import Mathlib.Analysis.Fourier.ZMod
import Mathlib.Analysis.InnerProductSpace.Adjoint
import Mathlib.Analysis.InnerProductSpace.GramMatrix
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.LocallyConvex.WithSeminorms
import Mathlib.Analysis.Matrix.HermitianFunctionalCalculus
import Mathlib.Analysis.Matrix.Normed
import Mathlib.Analysis.Matrix.Spectrum
import Mathlib.Analysis.MeanInequalitiesPow
import Mathlib.Analysis.Real.Sqrt
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Data.Finset.Max
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Nat.Choose.Sum
import Mathlib.Probability.Distributions.Binomial
import Mathlib.Probability.Moments.SubGaussian
import Mathlib.Probability.ProbabilityMassFunction.Integrals
import Mathlib.Probability.ProbabilityMassFunction.Monad
import Mathlib.RingTheory.MvPolynomial.Basic
import Mathlib.Tactic.Attr.Register
import Mathlib.Topology.Algebra.Module.ContinuousLinearMap.PiProd
import Mathlib.Topology.Bases
import Mathlib.Topology.Instances.Matrix
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.MainInductionStep
end MIPStarRE.LDT.MainInductionStep
namespace MIPStarRE.LDT.MakingMeasurementsProjective
end MIPStarRE.LDT.MakingMeasurementsProjective
namespace MIPStarRE.LDT.Pasting
end MIPStarRE.LDT.Pasting
namespace MIPStarRE.LDT.Preliminaries
end MIPStarRE.LDT.Preliminaries
/-!
# Section 6 — Stage-Data Constructors
Constructors for the slice restriction, per-slice induction, self-improvement,
and averaged pasting stage records: `SliceRestrictionData.ofRestrictedProbabilities`,
`AnswerSliceRestrictionData.ofRestrictedProbabilities`,
`SliceRestrictionData.ofAnswer`, `PerSliceInductionData.ofRecursion`,
`AnswerPerSliceInductionData.*`, `SelfImprovementData.ofAnswerForPerSliceInductionData`,
`SelfImprovementData.ofAnswer`, `AnswerSelfImprovementData.ofSelfImprovementData`,
`AveragedPastingData.invokeLdPasting`, and `mainInductionFromStageData`.
## References
- `blueprint/src/chapter/ch10_induction.tex`
-/
@[expose] public section
namespace MIPStarRE.LDT.MainInductionStep
open MIPStarRE.LDT
open scoped MatrixOrder
universe uι
variable {ι : Type uι} [Fintype ι] [DecidableEq ι]
/-! ## Stage-data constructors and theorem composition -/
/-- Extract a concrete answer-valued slice-restriction data record from the
answer-valued restricted-probabilities bookkeeping statement.
Paper origin: `references/ldt-paper/inductive_step.tex:374-412`
(`\label{lem:restricted-probabilities}`), with the answer-valued restriction
interface used for the recursive slice call. -/
noncomputable def AnswerSliceRestrictionData.ofRestrictedProbabilities
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(hrestricted : AnswerRestrictedProbabilitiesStatement params strategy eps delta gamma) :
AnswerSliceRestrictionData params strategy eps delta gamma := by
classical
let profile := Classical.choose hrestricted.profileExists
let hprofile := Classical.choose_spec hrestricted.profileExists
rcases hprofile with ⟨haxisAverage, hselfAverage, hdiagonalAverage⟩
exact
{ profile := profile
axisAverageBound := haxisAverage
selfAverageBound := hselfAverage
diagonalAverageBound := hdiagonalAverage }
/-- Forget the answer-valued diagonal alphabet after recording the verifier-visible
failure probabilities. The three tests agree with the ordinary restricted
strategy at the sampled answer level.
Paper origin: `references/ldt-paper/inductive_step.tex:441-454`; this is a
formalization-only transport between two encodings of the same restricted slice
call. -/
noncomputable def SliceRestrictionData.ofAnswer
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(answerPkg : AnswerSliceRestrictionData params strategy eps delta gamma) :
SliceRestrictionData params strategy eps delta gamma where
profile :=
{ axisParallel := answerPkg.profile.axisParallel
selfConsistency := answerPkg.profile.selfConsistency
diagonal := answerPkg.profile.diagonal
restrictedGood := fun x =>
let hgood := answerPkg.profile.restrictedGood x
{ axisParallelTest :=
answerRestricted_axisParallelFailureProbability_eq params strategy x ▸
hgood.axisParallelTest
selfConsistencyTest :=
answerRestricted_selfConsistencyFailureProbability_eq params strategy x ▸
hgood.selfConsistencyTest
diagonalLineTest :=
answerRestricted_diagonalFailureProbability_eq params strategy x ▸
hgood.diagonalLineTest } }
axisAverageBound := answerPkg.axisAverageBound
selfAverageBound := answerPkg.selfAverageBound
diagonalAverageBound := answerPkg.diagonalAverageBound
/-- Turn answer-valued recursive slice-wise induction witnesses into explicit
slice data `x ↦ (σ_x, G^x)`.
Paper origin: `references/ldt-paper/inductive_step.tex:441-454`. -/
noncomputable def AnswerPerSliceInductionData.ofRecursion
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(k : ℕ)
(restrictionPkg : AnswerSliceRestrictionData params strategy eps delta gamma)
(hrec :
∀ x,
∃ error : Error, ∃ G : Measurement (Polynomial params) ι,
ConsRel strategy.state (uniformDistribution (Point params))
(IdxProjMeas.toIdxSubMeas
(xRestrictedAnswerSymStrat params strategy x).pointMeasurement)
(polynomialEvaluationFamily params G.toSubMeas)
error ∧
error ≤
mainInductionError params k
(restrictionPkg.profile.axisParallel x)
(restrictionPkg.profile.selfConsistency x)
(restrictionPkg.profile.diagonal x)) :
AnswerPerSliceInductionData params strategy eps delta gamma restrictionPkg k := by
classical
let sliceError : Fq params → Error := fun x => Classical.choose (hrec x)
let sliceMeasurement : Fq params → Measurement (Polynomial params) ι :=
fun x => Classical.choose (Classical.choose_spec (hrec x))
let hslice :
∀ x,
ConsRel strategy.state (uniformDistribution (Point params))
(IdxProjMeas.toIdxSubMeas
(xRestrictedAnswerSymStrat params strategy x).pointMeasurement)
(polynomialEvaluationFamily params (sliceMeasurement x).toSubMeas)
(sliceError x) ∧
sliceError x ≤
mainInductionError params k
(restrictionPkg.profile.axisParallel x)
(restrictionPkg.profile.selfConsistency x)
(restrictionPkg.profile.diagonal x) := by
intro x
simpa [sliceError, sliceMeasurement] using
(Classical.choose_spec (Classical.choose_spec (hrec x)))
exact
{ sliceError := sliceError
sliceMeasurement := sliceMeasurement
pointConsistency := fun x => (hslice x).1
error_le := fun x => (hslice x).2 }
/-- Build an answer-valued per-slice induction data record from exact
main-induction conclusions for the answer-restricted slices.
Paper origin: `references/ldt-paper/inductive_step.tex:441-454`.
This is the data record form of the paper's invocation of the induction hypothesis in
`inductive_step.tex`, lines 441--454. The hypotheses already have the exact
restricted-profile `mainInductionError` bound, so the proof only records those
witnesses in the `AnswerPerSliceInductionData` structure. -/
noncomputable def AnswerPerSliceInductionData.ofMainInductionConclusions
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(k : ℕ)
(restrictionPkg : AnswerSliceRestrictionData params strategy eps delta gamma)
(hinduction :
∀ x,
AnswerMainInductionConclusion params
(xRestrictedAnswerSymStrat params strategy x)
(restrictionPkg.profile.axisParallel x)
(restrictionPkg.profile.selfConsistency x)
(restrictionPkg.profile.diagonal x)
k) :
AnswerPerSliceInductionData params strategy eps delta gamma restrictionPkg k := by
refine AnswerPerSliceInductionData.ofRecursion params strategy eps delta gamma k
restrictionPkg ?_
intro x
rcases hinduction x with ⟨G, hG⟩
refine ⟨_, G, hG, le_rfl⟩
/-- Build an answer-valued per-slice induction data record from a predecessor
answer-valued main-induction hypothesis.
Paper origin: `references/ldt-paper/inductive_step.tex:441-454`.
The restriction data record already records that every `xRestrictedAnswerSymStrat`
is good with the slice profile. The large-`k` side condition is the predecessor
side condition `400 * params.m * params.d ≤ k`, matching the application of the
induction hypothesis in `inductive_step.tex`, lines 441--442. The condition
`1 ≤ k` is supplied by the surrounding nontrivial branch; in the successor proof
it follows from `mainInductionError < 1`, not from an artificial assumption
`0 < params.d`. -/
noncomputable def AnswerPerSliceInductionData.ofMainInductionHypothesis
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(k : ℕ)
(restrictionPkg : AnswerSliceRestrictionData params strategy eps delta gamma)
(hinduction : AnswerMainInductionHypothesis params)
(hk_pos : 1 ≤ k)
(hk : 400 * params.m * params.d ≤ k) :
AnswerPerSliceInductionData params strategy eps delta gamma restrictionPkg k :=
AnswerPerSliceInductionData.ofMainInductionConclusions params strategy eps delta gamma k
restrictionPkg fun x =>
hinduction ι (xRestrictedAnswerSymStrat params strategy x)
(restrictionPkg.profile.axisParallel x)
(restrictionPkg.profile.selfConsistency x)
(restrictionPkg.profile.diagonal x)
k (restrictionPkg.profile.restrictedGood x) hk_pos hk
/-- Forgetting outcomes identifies the point measurements of the two restricted strategies. -/
private theorem restrictedPointSubMeasurement_eq_answer
(params : Parameters) [FieldModel params.q] (strategy : SymStrat params.next ι)
(x : Fq params) :
IdxProjMeas.toIdxSubMeas (xRestrictedStrategy params strategy x).pointMeasurement =
IdxProjMeas.toIdxSubMeas
(xRestrictedAnswerSymStrat params strategy x).pointMeasurement := by
funext u
rfl
/-- View answer-valued recursive slice-wise induction witnesses as ordinary
per-slice induction data after forgetting the answer-valued diagonal alphabet.
Paper origin: `references/ldt-paper/inductive_step.tex:441-454`. The point
measurements of `xRestrictedAnswerSymStrat` and `xRestrictedStrategy` are
definitionally the same slice of the ambient point measurement, so the
consistency witnesses and error bounds transport without changing the
mathematical content. -/
noncomputable def PerSliceInductionData.ofAnswer
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(k : ℕ)
(restrictionPkg : AnswerSliceRestrictionData params strategy eps delta gamma)
(answerInduction :
AnswerPerSliceInductionData params strategy eps delta gamma restrictionPkg k) :
PerSliceInductionData params strategy eps delta gamma
(SliceRestrictionData.ofAnswer params strategy eps delta gamma restrictionPkg) k where
sliceError := answerInduction.sliceError
sliceMeasurement := answerInduction.sliceMeasurement
pointConsistency := fun x => by
rw [restrictedPointSubMeasurement_eq_answer params strategy x]
exact answerInduction.pointConsistency x
error_le := fun x => by
simpa [SliceRestrictionData.ofAnswer] using answerInduction.error_le x
/-- View answer-valued self-improvement data as the self-improvement data
over the answer-forgotten per-slice induction record.
Paper origin: `references/ldt-paper/inductive_step.tex:461-551`. This is the
direct conversion needed by the source proof of `thm:main-induction`: the
recursive induction hypothesis naturally produces answer-valued restricted
slices, while the existing pasting assembly consumes the ordinary slice family.
The conversion changes only the formal restricted-strategy interface, not the
slice projective measurements, witnesses, or inequalities. -/
noncomputable def SelfImprovementData.ofAnswer
(params : Parameters)
[FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma : Error)
(k : ℕ)
(restrictionPkg : AnswerSliceRestrictionData params strategy eps delta gamma)
(answerInduction :
AnswerPerSliceInductionData params strategy eps delta gamma restrictionPkg k)
(answerSelf :
AnswerSelfImprovementData params strategy eps delta gamma k restrictionPkg
answerInduction) :
SelfImprovementData params strategy eps delta gamma k
(SliceRestrictionData.ofAnswer params strategy eps delta gamma restrictionPkg)
(PerSliceInductionData.ofAnswer params strategy eps delta gamma k
restrictionPkg answerInduction) where
sliceProj := answerSelf.sliceProj
sliceWitness := answerSelf.sliceWitness
completeness := fun x => by
simpa [PerSliceInductionData.ofAnswer, SliceRestrictionData.ofAnswer,
sliceSelfImprovementError, answerSliceSelfImprovementError]
using answerSelf.completeness x
pointConsistency := fun x => by
rw [restrictedPointSubMeasurement_eq_answer params strategy x]
simpa [PerSliceInductionData.ofAnswer, SliceRestrictionData.ofAnswer,
sliceSelfImprovementError, answerSliceSelfImprovementError]
using answerSelf.pointConsistency x
strongSelfConsistency := fun x => by
simpa [SliceRestrictionData.ofAnswer, sliceSelfImprovementError,
answerSliceSelfImprovementError]
using answerSelf.strongSelfConsistency x
selfCloseness := fun x => by
simpa [SliceRestrictionData.ofAnswer, sliceSelfImprovementError,
answerSliceSelfImprovementError]
using answerSelf.selfCloseness x
bounded := fun x => by
simpa [SliceRestrictionData.ofAnswer, sliceSelfImprovementError,
answerSliceSelfImprovementError]
using answerSelf.bounded x
dominatesAveragePointOperator := answerSelf.dominatesAveragePointOperator
end MIPStarRE.LDT.MainInductionStep
end
end LIDT
Source