Definitions of DegreeZero: Section 12 pasting: degree-zero branch Auxiliary constructions for the `d = 0` complementary branch of `thm:ld-pasting`
DefinitionMIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_DegreeZeroThe definitions of the module MIPRE.Background.LIDT.MIPStarRE.LDT.Pasting.Bernoulli.DegreeZero of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). Section 12 pasting: degree-zero branch. Auxiliary constructions for the d = 0 complementary branch of thm:ld-pasting.
The module is vendored read-only, with the authors' permission, from LionSR/MIPStarRE (Sirui Lu and the MIPStarRE contributors, Apache 2.0; commit and upstream path in the file header) by scripts/vendor-lidt.py.
Embedded lemmas (7): the small results the bodies of these definitions need (proof fields, simp rules, decidability and finiteness instances), proved inside the bundle so that it imports no unproved statement: consistentWithPoints_min_one, degreeZero_averagedSlice_liftedVerticalLineConsistency, degreeZero_averagedSlice_liftedVerticalLineConsistency_of_axis_self, degreeZero_averagedSlice_pointConsistency, degreeZero_averagedSlice_pointConsistency_of_axis_self, degreeZero_submeas_error_le_two_nu, polynomialEvaluation_averagedSliceAppendedSubMeas_eq_average.
The bundle holds no definition of its own: it carries the lemmas listed above, which later bundles and proofs import.
Formalization Note The bundle is the module MIPRE.Background.LIDT.MIPStarRE.LDT.Pasting.Bernoulli.DegreeZero (MIPRE/Background/LIDT/MIPStarRE/LDT/Pasting/Bernoulli/DegreeZero.lean) with every declaration not listed removed, imports rewritten to the bundles of the module's import closure; the declarations keep their names, statements and bodies; the source module is split over 111 imported bundle(s).
/-
Copyright (c) 2026 Sirui Lu and the MIPStarRE contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE, with the
authors' permission. Vendored from https://github.com/LionSR/MIPStarRE
(commit 507e8122, 2026-08-25) by scripts/vendor-lidt.py; do not edit by hand.
Upstream path: MIPStarRE/LDT/Pasting/Bernoulli/DegreeZero.lean
-/
/- Generated for Prove2Me from vidick/MIPRE-formalization@70cbf1c, MIPRE/Background/LIDT/MIPStarRE/LDT/Pasting/Bernoulli/DegreeZero.lean (definition bundle: declarations the uploaded statements rest on);
produced mechanically by prove2me/tools/gen.py, never edited by hand. -/
import Mathlib.Algebra.Algebra.Basic
import Mathlib.Algebra.Algebra.Defs
import Mathlib.Algebra.Algebra.Equiv
import Mathlib.Algebra.Algebra.Hom
import Mathlib.Algebra.Algebra.NonUnitalHom
import Mathlib.Algebra.Algebra.Spectrum.Quasispectrum
import Mathlib.Algebra.BigOperators.Field
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.BigOperators.Finsupp.Basic
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Group.Finset.Defs
import Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
import Mathlib.Algebra.BigOperators.GroupWithZero.Action
import Mathlib.Algebra.BigOperators.Intervals
import Mathlib.Algebra.BigOperators.Pi
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.CharP.Defs
import Mathlib.Algebra.CharP.Invertible
import Mathlib.Algebra.CharZero.Defs
import Mathlib.Algebra.Field.Basic
import Mathlib.Algebra.Field.Defs
import Mathlib.Algebra.Field.IsField
import Mathlib.Algebra.Field.Rat
import Mathlib.Algebra.Group.Action.Defs
import Mathlib.Algebra.Group.Action.Pi
import Mathlib.Algebra.Group.Basic
import Mathlib.Algebra.Group.Commute.Defs
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.Group.Finsupp
import Mathlib.Algebra.Group.Hom.Defs
import Mathlib.Algebra.Group.Invertible.Basic
import Mathlib.Algebra.Group.Invertible.Defs
import Mathlib.Algebra.Group.Nat.Defs
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Algebra.Group.Subgroup.Defs
import Mathlib.Algebra.Group.Submonoid.Defs
import Mathlib.Algebra.Group.Subsemigroup.Defs
import Mathlib.Algebra.GroupWithZero.Action.Defs
import Mathlib.Algebra.GroupWithZero.Basic
import Mathlib.Algebra.GroupWithZero.Commute
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.GroupWithZero.Hom
import Mathlib.Algebra.GroupWithZero.Invertible
import Mathlib.Algebra.GroupWithZero.Nat
import Mathlib.Algebra.GroupWithZero.NeZero
import Mathlib.Algebra.GroupWithZero.Units.Basic
import Mathlib.Algebra.Module.BigOperators
import Mathlib.Algebra.Module.Defs
import Mathlib.Algebra.Module.LinearMap.Defs
import Mathlib.Algebra.Module.NatInt
import Mathlib.Algebra.Module.Pi
import Mathlib.Algebra.Module.Submodule.Defs
import Mathlib.Algebra.MonoidAlgebra.Basic
import Mathlib.Algebra.MonoidAlgebra.Defs
import Mathlib.Algebra.MonoidAlgebra.Module
import Mathlib.Algebra.MvPolynomial.Basic
import Mathlib.Algebra.MvPolynomial.CommRing
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.MvPolynomial.Monad
import Mathlib.Algebra.MvPolynomial.Polynomial
import Mathlib.Algebra.MvPolynomial.Rename
import Mathlib.Algebra.MvPolynomial.SchwartzZippel
import Mathlib.Algebra.NeZero
import Mathlib.Algebra.Notation.Defs
import Mathlib.Algebra.Notation.Indicator
import Mathlib.Algebra.Notation.Pi.Defs
import Mathlib.Algebra.Opposites
import Mathlib.Algebra.Order.Archimedean.Real.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset
import Mathlib.Algebra.Order.Field.Basic
import Mathlib.Algebra.Order.Floor.Defs
import Mathlib.Algebra.Order.Group.Abs
import Mathlib.Algebra.Order.Group.Defs
import Mathlib.Algebra.Order.Group.Nat
import Mathlib.Algebra.Order.Group.Unbundled.Abs
import Mathlib.Algebra.Order.Group.Unbundled.Basic
import Mathlib.Algebra.Order.GroupWithZero.Basic
import Mathlib.Algebra.Order.GroupWithZero.Canonical
import Mathlib.Algebra.Order.GroupWithZero.Defs
import Mathlib.Algebra.Order.IsBotOne
import Mathlib.Algebra.Order.Module.Defs
import Mathlib.Algebra.Order.Monoid.Canonical.Defs
import Mathlib.Algebra.Order.Monoid.Defs
import Mathlib.Algebra.Order.Monoid.NatCast
import Mathlib.Algebra.Order.Monoid.Unbundled.Basic
import Mathlib.Algebra.Order.Monoid.Unbundled.Defs
import Mathlib.Algebra.Order.Monoid.Unbundled.ExistsOfLE
import Mathlib.Algebra.Order.Nonneg.Basic
import Mathlib.Algebra.Order.Nonneg.Module
import Mathlib.Algebra.Order.Ring.Abs
import Mathlib.Algebra.Order.Ring.Basic
import Mathlib.Algebra.Order.Ring.Defs
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Algebra.Order.Ring.Unbundled.Basic
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Order.Star.Real
import Mathlib.Algebra.Order.Sub.Basic
import Mathlib.Algebra.Order.Sub.Defs
import Mathlib.Algebra.Order.SuccPred
import Mathlib.Algebra.Order.ZeroLEOne
import Mathlib.Algebra.Polynomial.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polynomial.Degree.Defs
import Mathlib.Algebra.Polynomial.Degree.Lemmas
import Mathlib.Algebra.Polynomial.Degree.Operations
import Mathlib.Algebra.Polynomial.Eval.Coeff
import Mathlib.Algebra.Polynomial.Eval.Defs
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Algebra.QuadraticDiscriminant
import Mathlib.Algebra.Ring.Commute
import Mathlib.Algebra.Ring.Defs
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Algebra.Ring.Hom.Defs
import Mathlib.Algebra.Ring.Int.Defs
import Mathlib.Algebra.Ring.Nat
import Mathlib.Algebra.Ring.Parity
import Mathlib.Algebra.Star.Basic
import Mathlib.Algebra.Star.Module
import Mathlib.Algebra.Star.SelfAdjoint
import Mathlib.Algebra.Star.StarProjection
import Mathlib.Analysis.CStarAlgebra.Classes
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Instances
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.NonUnital
import Mathlib.Analysis.CStarAlgebra.Module.Constructions
import Mathlib.Analysis.CStarAlgebra.Module.Defs
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Complex.Order
import Mathlib.Analysis.Complex.Trigonometric
import Mathlib.Analysis.Convex.Cone.Basic
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.InnerProductSpace.Defs
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.LocallyConvex.WithSeminorms
import Mathlib.Analysis.Matrix.Hermitian
import Mathlib.Analysis.Matrix.HermitianFunctionalCalculus
import Mathlib.Analysis.Matrix.Normed
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.MeanInequalitiesPow
import Mathlib.Analysis.Normed.Field.Basic
import Mathlib.Analysis.Normed.Field.Lemmas
import Mathlib.Analysis.Normed.Group.Basic
import Mathlib.Analysis.Normed.Group.Continuity
import Mathlib.Analysis.Normed.Group.Defs
import Mathlib.Analysis.Normed.Group.Real
import Mathlib.Analysis.Normed.Lp.PiLp
import Mathlib.Analysis.Normed.Lp.WithLp
import Mathlib.Analysis.Normed.Module.Basic
import Mathlib.Analysis.Normed.Ring.Basic
import Mathlib.Analysis.RCLike.Basic
import Mathlib.Analysis.Real.Sqrt
import Mathlib.Analysis.SpecialFunctions.ContinuousFunctionalCalculus.Rpow.Basic
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Complex.BigOperators
import Mathlib.Data.Countable.Defs
import Mathlib.Data.ENNReal.Basic
import Mathlib.Data.ENNReal.BigOperators
import Mathlib.Data.ENNReal.Inv
import Mathlib.Data.ENNReal.Operations
import Mathlib.Data.ENNReal.Real
import Mathlib.Data.Fin.Tuple.Basic
import Mathlib.Data.Finite.Defs
import Mathlib.Data.Finite.Prod
import Mathlib.Data.Finset.Attach
import Mathlib.Data.Finset.BooleanAlgebra
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Defs
import Mathlib.Data.Finset.Empty
import Mathlib.Data.Finset.Erase
import Mathlib.Data.Finset.Filter
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Lattice.Basic
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Finset.Lattice.Lemmas
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Range
import Mathlib.Data.Finsupp.Defs
import Mathlib.Data.Fintype.Basic
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Fintype.CardEmbedding
import Mathlib.Data.Fintype.Defs
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Fintype.Fin
import Mathlib.Data.Fintype.OfMap
import Mathlib.Data.Fintype.Option
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Fintype.Powerset
import Mathlib.Data.Fintype.Prod
import Mathlib.Data.Fintype.Sets
import Mathlib.Data.FunLike.Basic
import Mathlib.Data.FunLike.Embedding
import Mathlib.Data.FunLike.Equiv
import Mathlib.Data.Int.Cast.Basic
import Mathlib.Data.Int.Cast.Defs
import Mathlib.Data.List.Nodup
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Matrix.Basis
import Mathlib.Data.Matrix.Block
import Mathlib.Data.Matrix.Diagonal
import Mathlib.Data.Matrix.Mul
import Mathlib.Data.Multiset.Count
import Mathlib.Data.Multiset.Defs
import Mathlib.Data.Multiset.Filter
import Mathlib.Data.Multiset.MapFold
import Mathlib.Data.NNRat.Defs
import Mathlib.Data.NNReal.Defs
import Mathlib.Data.Nat.Basic
import Mathlib.Data.Nat.Cast.Basic
import Mathlib.Data.Nat.Cast.Commute
import Mathlib.Data.Nat.Cast.Defs
import Mathlib.Data.Nat.Cast.Order.Basic
import Mathlib.Data.Nat.Cast.Order.Ring
import Mathlib.Data.Nat.Choose.Basic
import Mathlib.Data.Nat.Choose.Sum
import Mathlib.Data.Nat.Factorial.Basic
import Mathlib.Data.Nat.Factorial.BigOperators
import Mathlib.Data.Nat.Init
import Mathlib.Data.Nat.Prime.Defs
import Mathlib.Data.Nat.SuccPred
import Mathlib.Data.Prod.Basic
import Mathlib.Data.Rat.Cast.CharZero
import Mathlib.Data.Rat.Cast.Defs
import Mathlib.Data.Rat.Cast.Lemmas
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Rat.Init
import Mathlib.Data.Real.Basic
import Mathlib.Data.Real.Star
import Mathlib.Data.SProd
import Mathlib.Data.Set.CoeSort
import Mathlib.Data.Set.Defs
import Mathlib.Data.Set.Operations
import Mathlib.Data.SetLike.Basic
import Mathlib.Data.Subtype
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.Geometry.Convex.Cone.Pointed
import Mathlib.GroupTheory.GroupAction.Hom
import Mathlib.GroupTheory.GroupAction.Ring
import Mathlib.LinearAlgebra.Complex.Module
import Mathlib.LinearAlgebra.Lagrange
import Mathlib.LinearAlgebra.Matrix.ConjTranspose
import Mathlib.LinearAlgebra.Matrix.Defs
import Mathlib.LinearAlgebra.Matrix.DotProduct
import Mathlib.LinearAlgebra.Matrix.Hermitian
import Mathlib.LinearAlgebra.Matrix.Kronecker
import Mathlib.LinearAlgebra.Matrix.PosDef
import Mathlib.LinearAlgebra.Matrix.Reindex
import Mathlib.LinearAlgebra.Matrix.Trace
import Mathlib.Logic.Basic
import Mathlib.Logic.Embedding.Basic
import Mathlib.Logic.Equiv.Basic
import Mathlib.Logic.Equiv.Defs
import Mathlib.Logic.Equiv.Prod
import Mathlib.Logic.Function.Basic
import Mathlib.Logic.Function.Defs
import Mathlib.Logic.IsEmpty.Basic
import Mathlib.Logic.IsEmpty.Defs
import Mathlib.Logic.Nonempty
import Mathlib.Logic.Nontrivial.Defs
import Mathlib.Logic.Unique
import Mathlib.MeasureTheory.Constructions.BorelSpace.Basic
import Mathlib.MeasureTheory.Function.L1Space.Integrable
import Mathlib.MeasureTheory.Integral.Bochner.Basic
import Mathlib.MeasureTheory.MeasurableSpace.Basic
import Mathlib.MeasureTheory.MeasurableSpace.Defs
import Mathlib.MeasureTheory.MeasurableSpace.Instances
import Mathlib.MeasureTheory.Measure.Dirac
import Mathlib.MeasureTheory.Measure.MeasureSpace
import Mathlib.MeasureTheory.Measure.MeasureSpaceDef
import Mathlib.MeasureTheory.Measure.Typeclasses.Probability
import Mathlib.MeasureTheory.OuterMeasure.AE
import Mathlib.MeasureTheory.OuterMeasure.Defs
import Mathlib.Order.Basic
import Mathlib.Order.BoundedOrder.Basic
import Mathlib.Order.CompleteLattice.Defs
import Mathlib.Order.Defs.LinearOrder
import Mathlib.Order.Defs.PartialOrder
import Mathlib.Order.Filter.Defs
import Mathlib.Order.Interval.Finset.Defs
import Mathlib.Order.Interval.Finset.Nat
import Mathlib.Order.Interval.Set.Defs
import Mathlib.Order.Lattice
import Mathlib.Order.Lattice.Nat
import Mathlib.Order.MinMax
import Mathlib.Order.Nat
import Mathlib.Order.Notation
import Mathlib.Order.RelClasses
import Mathlib.Order.SetNotation
import Mathlib.Probability.Distributions.Bernoulli
import Mathlib.Probability.Distributions.Binomial
import Mathlib.Probability.Distributions.Uniform
import Mathlib.Probability.Moments.Basic
import Mathlib.Probability.Moments.SubGaussian
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Probability.ProbabilityMassFunction.Constructions
import Mathlib.Probability.ProbabilityMassFunction.Integrals
import Mathlib.Probability.ProbabilityMassFunction.Monad
import Mathlib.RingTheory.Henselian
import Mathlib.RingTheory.LocalRing.Defs
import Mathlib.RingTheory.MvPolynomial.Basic
import Mathlib.RingTheory.RegularLocalRing.Defs
import Mathlib.RingTheory.SimpleRing.Basic
import Mathlib.RingTheory.SimpleRing.Principal
import Mathlib.SetTheory.Cardinal.Finite
import Mathlib.Tactic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.CancelDenoms.Core
import Mathlib.Tactic.FieldSimp.Lemmas
import Mathlib.Tactic.Linarith.Lemmas
import Mathlib.Tactic.Linarith.Preprocessing
import Mathlib.Tactic.NormNum.Basic
import Mathlib.Tactic.NormNum.Ineq
import Mathlib.Tactic.NormNum.Inv
import Mathlib.Tactic.NormNum.Pow
import Mathlib.Tactic.NormNum.RealSqrt
import Mathlib.Tactic.NormNum.Result
import Mathlib.Tactic.Positivity.Basic
import Mathlib.Tactic.Positivity.Core
import Mathlib.Tactic.Push
import Mathlib.Tactic.Ring.Basic
import Mathlib.Tactic.Ring.Common
import Mathlib.Tactic.Ring.RingNF
import Mathlib.Topology.Algebra.Field
import Mathlib.Topology.Algebra.InfiniteSum.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Defs
import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
import Mathlib.Topology.Algebra.InfiniteSum.SummationFilter
import Mathlib.Topology.Algebra.Module.ClosedSubmodule
import Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Basic
import Mathlib.Topology.Algebra.Module.LocallyConvex
import Mathlib.Topology.Algebra.Monoid
import Mathlib.Topology.Algebra.Monoid.Defs
import Mathlib.Topology.Algebra.Ring.Basic
import Mathlib.Topology.Algebra.Ring.Real
import Mathlib.Topology.Algebra.Star.Real
import Mathlib.Topology.Bases
import Mathlib.Topology.Basic
import Mathlib.Topology.Constructions
import Mathlib.Topology.Continuous
import Mathlib.Topology.Defs.Basic
import Mathlib.Topology.EMetricSpace.Defs
import Mathlib.Topology.Instances.Matrix
import Mathlib.Topology.MetricSpace.Basic
import Mathlib.Topology.MetricSpace.Defs
import Mathlib.Topology.MetricSpace.Pseudo.Defs
import Mathlib.Topology.Metrizable.Basic
import Mathlib.Topology.Metrizable.Uniformity
import Mathlib.Topology.Order.OrderClosed
import Mathlib.Topology.Order.Real
import Mathlib.Topology.Separation.Hausdorff
import Mathlib.Topology.UniformSpace.Defs
import Mathlib.Topology.UniformSpace.Real
import Mathlib.Topology.UnitInterval
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_Distribution
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_SubMeasurementCore
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_OperatorExpectations
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_PMFAverages
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_Defs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_StrategyCore
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_StrategyRole_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_MainInductionStep_Defs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_Quantum_Measurement
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_MeasurementLift
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_Defs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_ComparisonCore
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_DistanceBounds
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_ConsistencyBridges
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_InnerProduct
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichMain_Completeness
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_BipartiteSelfConsistency_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_CauchySchwarz
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_CompletionTransfer
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_Triangles_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Basic_LinePolynomialEmbedding
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_StrategyPolynomialFamilies
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_StrategyRole_Algebra
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Test_StrategyFailures
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Defs_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Defs_Stability
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Defs_Normalization
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Scaffold_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Scaffold_Products
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_CommutativityPoints_Approximation
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_EvaluatedSliceBounds_PhaseOneThree
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_EvaluatedSliceCommutation_Averages
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_EvaluationSpecialization
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_Pullback
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_Polynomials
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Preliminaries_PolynomialAgreement
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Averages
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Marginalization_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Marginalization_Y
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Machinery_Normalization
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Bridges_Closeness
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_Bridges_QSDD
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Transport_FullSlice_ZeroBounds
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Main_Auxiliary_HEvalTransport
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_Main_Auxiliary_ScalarMarginalization
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_CommutativityPoints_SharedHelpers_SharedLine
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_CommutativityPoints_BridgeTheorems_DropBridges
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_GCommStability_Scalar_RawSecond
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_PaperChainPhaseFive
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_GCommStability_Scalar_First
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_ProcessedG_PhaseTwo
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Commutativity_ScalarApproximation_ProcessedG_MainChain
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Defs_Tuples
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Defs_Families
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Sandwich_Switcheroo
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Sandwich_GHatSandwich
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Sandwich_PastedFamilies
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Statements
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_SwitcherooSetup_Centers
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_SwitcherooSetup_Terms
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_SwitcherooContraction_Split
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_SwitcherooContraction_ScalarTerms
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_SwitcherooCompletion
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_CommutingWithG_Complete
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_GHatFacts
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_Setup_Definitions
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_Setup_StepLemmas_Split
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Base
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Lifting
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_Chain
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_FlatChain
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_CommuteGHalfSandwich_MoveChain_BackChain
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_TruncatedSums
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_Weights
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_Scalar
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_Core_BernoulliTail
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_Core_FactBundles
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_MoveLemmas_Basic
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_StageA0M1
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_Chain_HalfSandwich
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_AdjacentStages_Chain_FinalMove
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_FromHToG_PaperBounds
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_EndpointEquivs
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_Core_LdGbcon
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_Endpoint
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_PrefixMoved
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LdSandwichLineOnePoint_CSSetup
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_Core
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_BadLine
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_LineInterpolation_BadMass
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_HBConsistency
import Definitions.Def_MIPRE_Background_LIDT_MIPStarRE_LDT_Pasting_ComparisonLemmas_HAConsistency
import Theorems.Thm_MIPStarRE_LDT_CommutativityPoints_avgOver_uniform_pointNext_decompose
import Theorems.Thm_MIPStarRE_LDT_ConsRel_mono
import Theorems.Thm_MIPStarRE_LDT_Pasting_bipartiteConsError_uniform_le_one
import Theorems.Thm_MIPStarRE_LDT_Pasting_bipartiteSSCError_uniform_le_one
import Theorems.Thm_MIPStarRE_LDT_Pasting_evaluateAt_averageIdxSubMeas
import Theorems.Thm_MIPStarRE_LDT_Pasting_evaluateAt_averagedSliceAppendedSubMeas
import Theorems.Thm_MIPStarRE_LDT_Pasting_hAConsistency_sqrt_bound_of_pos
import Theorems.Thm_MIPStarRE_LDT_Pasting_ldGbcon_liftedVerticalLine
import Theorems.Thm_MIPStarRE_LDT_Pasting_ldGbcon_liftedVerticalLine_of_axis_self
import Theorems.Thm_MIPStarRE_LDT_Pasting_ldPasting_degreeRatio_nonneg
import Theorems.Thm_MIPStarRE_LDT_Pasting_liftedVerticalLineAnswerFamily_eq_of_same_truncate_degree_zero
import Theorems.Thm_MIPStarRE_LDT_Pasting_pointVerticalLineSdd_liftedVerticalLine_of_axis_self
import Theorems.Thm_MIPStarRE_LDT_Pasting_qBipartiteConsDefect_averageIdxSubMeas_left_le
import Theorems.Thm_MIPStarRE_LDT_Preliminaries_sddRel_symm
import Theorems.Thm_MIPStarRE_LDT_Preliminaries_triangleSub_right
import Theorems.Thm_MIPStarRE_LDT_avgOver_congr
import Theorems.Thm_MIPStarRE_LDT_avgOver_mono
import Theorems.Thm_MIPStarRE_LDT_avgOver_uniform_comm
import Theorems.Thm_MIPStarRE_LDT_avgOver_uniform_const
import Theorems.Thm_MIPStarRE_LDT_consRel_symm_of_density_fixed
set_option backward.isDefEq.respectTransparency false
/-!
# Section 12 pasting: degree-zero branch
Auxiliary constructions for the `d = 0` complementary branch of
`thm:ld-pasting`.
## References
- `references/ldt-paper/ld-pasting.tex`
- `blueprint/src/chapter/ch09_pasting.tex`
-/
namespace MIPStarRE.LDT.Pasting
open MIPStarRE.LDT
open scoped BigOperators MatrixOrder Matrix ComplexOrder
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
/-- Evaluating the degree-zero appended-slice candidate is the height average of
the original evaluated slice family at the same old point. -/
theorem polynomialEvaluation_averagedSliceAppendedSubMeas_eq_average
(params : Parameters)
[FieldModel params.q]
(family : IdxPolyFamily params ι)
(u : Point params.next) :
polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family) u =
averageIdxSubMeas (uniformDistribution (Fq params))
(fun x =>
family.evaluatedAtNextPoint
(appendPoint params (truncatePoint params u) x))
(uniformDistribution_weight_sum_le_one (Fq params)) := by
calc
polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family) u
= evaluateAt params.next u (averagedSliceAppendedSubMeas params family) := rfl
_ = evaluateAt params (truncatePoint params u) family.averagedSubMeas := by
exact evaluateAt_averagedSliceAppendedSubMeas params family u
_ = averageIdxSubMeas (uniformDistribution (Fq params))
(fun x => evaluateAt params (truncatePoint params u)
((family.meas x).toSubMeas))
(uniformDistribution_weight_sum_le_one (Fq params)) := by
exact evaluateAt_averageIdxSubMeas params (truncatePoint params u)
(uniformDistribution (Fq params))
(fun x => (family.meas x).toSubMeas)
(uniformDistribution_weight_sum_le_one (Fq params))
_ = averageIdxSubMeas (uniformDistribution (Fq params))
(fun x =>
family.evaluatedAtNextPoint
(appendPoint params (truncatePoint params u) x))
(uniformDistribution_weight_sum_le_one (Fq params)) := by
congr
funext x
simp [IdxPolyFamily.evaluatedAtNextPoint, truncatePoint_appendPoint,
pointHeight_appendPoint]
/-- The point-consistency hypothesis may be truncated at the trivial unit bound. -/
theorem consistentWithPoints_min_one
(params : Parameters) [FieldModel params.q]
(strategy : SymStrat params.next ι)
(family : IdxPolyFamily params ι) (zeta : Error)
(hcons : family.ConsistentWithPoints strategy zeta) :
family.ConsistentWithPoints strategy (min zeta 1) := by
refine ⟨?_⟩
refine ⟨?_⟩
exact le_min hcons.pointConsistency.offDiagonalBound
(bipartiteConsError_uniform_le_one strategy.state strategy.isNormalized
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
family.evaluatedAtNextPoint)
/-- Scalar absorption for the degree-zero submeasurement consistency error. -/
theorem degreeZero_submeas_error_le_two_nu
(params : Parameters) [FieldModel params.q]
(eps delta gamma zeta : Error) (k : ℕ)
(hk_pos : 1 ≤ k)
(heps_nonneg : 0 ≤ eps)
(hdelta_nonneg : 0 ≤ delta)
(hgamma_nonneg : 0 ≤ gamma)
(hzeta_nonneg : 0 ≤ zeta) :
min zeta 1 +
2 * Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1) ≤
2 * MainInductionStep.ldPastingInInductionNu params k eps delta gamma zeta := by
let C : Error := ((k : Error) ^ (2 : ℕ)) * (params.m : Error)
let epsTerm : Error := Real.rpow eps (1 / (32 : Error))
let deltaTerm : Error := Real.rpow delta (1 / (32 : Error))
let gammaTerm : Error := Real.rpow gamma (1 / (32 : Error))
let zetaTerm : Error := Real.rpow zeta (1 / (32 : Error))
let degreeTerm : Error :=
Real.rpow (((params.d : Error) / (params.q : Error))) (1 / (32 : Error))
let S : Error := epsTerm + deltaTerm + gammaTerm + zetaTerm + degreeTerm
have hC_one : (1 : Error) ≤ C := by
have hkE_one : (1 : Error) ≤ (k : Error) := by exact_mod_cast hk_pos
have hmE_one : (1 : Error) ≤ (params.m : Error) := by
exact_mod_cast (Nat.succ_le_of_lt params.hm)
dsimp [C]
nlinarith [sq_nonneg (k : Error)]
have hC_nonneg : 0 ≤ C := le_trans zero_le_one hC_one
have hepsTerm_nonneg : 0 ≤ epsTerm := by
dsimp [epsTerm]
exact Real.rpow_nonneg heps_nonneg _
have hdeltaTerm_nonneg : 0 ≤ deltaTerm := by
dsimp [deltaTerm]
exact Real.rpow_nonneg hdelta_nonneg _
have hgammaTerm_nonneg : 0 ≤ gammaTerm := by
dsimp [gammaTerm]
exact Real.rpow_nonneg hgamma_nonneg _
have hzetaTerm_nonneg : 0 ≤ zetaTerm := by
dsimp [zetaTerm]
exact Real.rpow_nonneg hzeta_nonneg _
have hdegreeTerm_nonneg : 0 ≤ degreeTerm := by
dsimp [degreeTerm]
exact Real.rpow_nonneg (ldPasting_degreeRatio_nonneg params) _
have hS_nonneg : 0 ≤ S := by
dsimp [S]
nlinarith
have hzeta_min_le_C : min zeta 1 ≤ C * zetaTerm := by
have hmin_nonneg : 0 ≤ min zeta 1 := by positivity
have hmin_le_one : min zeta 1 ≤ 1 := min_le_right _ _
have hzeta_min_le : min zeta 1 ≤ zetaTerm := by
calc
min zeta 1 ≤ Real.rpow (min zeta 1) (1 / (32 : Error)) := by
simpa [Real.rpow_one] using
(Real.rpow_le_rpow_of_exponent_ge' hmin_nonneg hmin_le_one
(show 0 ≤ (1 / (32 : Error)) by norm_num)
(show 1 / (32 : Error) ≤ (1 : Error) by norm_num))
_ ≤ zetaTerm := by
dsimp [zetaTerm]
exact Real.rpow_le_rpow hmin_nonneg (min_le_left _ _) (by positivity)
calc
min zeta 1 ≤ zetaTerm := hzeta_min_le
_ = (1 : Error) * zetaTerm := by ring
_ ≤ C * zetaTerm := by
exact mul_le_mul_of_nonneg_right hC_one hzetaTerm_nonneg
have hsqrt_le_CS :
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1) ≤ 3 * C * S := by
calc
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)
≤ 3 * ((k : Error) ^ (2 : ℕ)) * (params.m : Error) *
(Real.rpow eps (1 / (32 : Error)) + Real.rpow delta (1 / (32 : Error))) :=
hAConsistency_sqrt_bound_of_pos params eps delta k hk_pos
heps_nonneg hdelta_nonneg
_ = 3 * C * (epsTerm + deltaTerm) := by ring
_ ≤ 3 * C * S := by
have hsum_le : epsTerm + deltaTerm ≤ S := by
dsimp [S]
nlinarith
exact mul_le_mul_of_nonneg_left hsum_le (by positivity)
calc
min zeta 1 +
2 * Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)
≤ C * zetaTerm + 2 * (3 * C * S) := by
exact add_le_add hzeta_min_le_C
(mul_le_mul_of_nonneg_left hsqrt_le_CS (by norm_num))
_ ≤ 7 * C * S := by
have hzeta_le_S : zetaTerm ≤ S := by
dsimp [S]
nlinarith
have hCzeta_le_CS : C * zetaTerm ≤ C * S := by
exact mul_le_mul_of_nonneg_left hzeta_le_S hC_nonneg
nlinarith
_ ≤ 200 * C * S := by
have hCS_nonneg : 0 ≤ C * S := mul_nonneg hC_nonneg hS_nonneg
nlinarith
_ = 2 * MainInductionStep.ldPastingInInductionNu params k eps delta gamma zeta := by
simp [MainInductionStep.ldPastingInInductionNu, C, S, epsTerm, deltaTerm,
gammaTerm, zetaTerm, degreeTerm]
ring
/-- The averaged degree-zero pasted submeasurement is consistent with the lifted
vertical-line answers. -/
theorem degreeZero_averagedSlice_liftedVerticalLineConsistency
(params : Parameters) [FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma zeta : Error)
(hgood : strategy.IsGood eps delta gamma)
(family : IdxPolyFamily params ι)
(hcons : family.ConsistentWithPoints strategy zeta)
(hd_zero : params.d = 0) :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(liftedVerticalLineAnswerFamily params strategy)
(min zeta 1 +
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)) := by
let eps' : Error := min eps 1
let delta' : Error := min delta 1
let zeta' : Error := min zeta 1
have haxis_le_one : strategy.axisParallelFailureProbability ≤ 1 := by
simpa [SymStrat.axisParallelFailureProbability] using
bipartiteConsError_uniform_le_one strategy.state strategy.isNormalized
(axisParallelPointAnswerFamily strategy)
(axisParallelLineAnswerFamily strategy)
have hself_le_one : strategy.selfConsistencyFailureProbability ≤ 1 := by
simpa [SymStrat.selfConsistencyFailureProbability] using
bipartiteSSCError_uniform_le_one strategy.state strategy.isNormalized
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
have hgood_small : strategy.IsGood eps' delta' gamma := by
refine ⟨?_, ?_, hgood.diagonalLineTest⟩
· exact le_min hgood.axisParallelTest haxis_le_one
· exact le_min hgood.selfConsistencyTest hself_le_one
have hcons_small : family.ConsistentWithPoints strategy zeta' := by
simpa [zeta'] using consistentWithPoints_min_one params strategy family zeta hcons
have hgb := ldGbcon_liftedVerticalLine params strategy eps' delta' gamma zeta'
hgood_small family hcons_small
let F : Point params → Fq params → Error := fun u x =>
qBipartiteConsDefect strategy.state
(family.evaluatedAtNextPoint (appendPoint params u x))
(liftedVerticalLineAnswerFamily params strategy (appendPoint params u x))
have haverage_to_gb :
avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x)) =
bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := by
calc
avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x))
= avgOver (uniformDistribution (Fq params))
(fun _ => avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x))) := by
simpa [truncatePoint_appendPoint] using
CommutativityPoints.avgOver_uniform_pointNext_decompose params
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x))
_ = avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x)) := by
simpa using avgOver_uniform_const (α := Fq params)
(avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x)))
_ = avgOver (uniformDistribution (Fq params))
(fun x => avgOver (uniformDistribution (Point params)) (fun u => F u x)) := by
exact avgOver_uniform_comm (fun u x => F u x)
_ = avgOver (uniformDistribution (Point params.next))
(fun v => F (truncatePoint params v) (pointHeight params v)) := by
simpa [truncatePoint_appendPoint, pointHeight_appendPoint] using
(CommutativityPoints.avgOver_uniform_pointNext_decompose params
(fun v => F (truncatePoint params v) (pointHeight params v))).symm
_ = bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := by
unfold bipartiteConsError
apply avgOver_congr
intro v
have happend :
appendPoint params (truncatePoint params v) (pointHeight params v) = v := by
exact (CommutativityPoints.pointNextEquiv params).left_inv v
simp [F, happend]
constructor
unfold bipartiteConsError
calc
avgOver (uniformDistribution (Point params.next))
(fun u => qBipartiteConsDefect strategy.state
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family) u)
(liftedVerticalLineAnswerFamily params strategy u))
≤ avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x =>
qBipartiteConsDefect strategy.state
(family.evaluatedAtNextPoint (appendPoint params (truncatePoint params u) x))
(liftedVerticalLineAnswerFamily params strategy u))) := by
apply avgOver_mono
intro u
rw [polynomialEvaluation_averagedSliceAppendedSubMeas_eq_average params family u]
exact qBipartiteConsDefect_averageIdxSubMeas_left_le strategy.state
(uniformDistribution (Fq params))
(fun x => family.evaluatedAtNextPoint
(appendPoint params (truncatePoint params u) x))
(liftedVerticalLineAnswerFamily params strategy u)
(uniformDistribution_weight_sum_le_one (Fq params))
_ = avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x)) := by
apply avgOver_congr
intro u
apply avgOver_congr
intro x
have hline :
liftedVerticalLineAnswerFamily params strategy
(appendPoint params (truncatePoint params u) x) =
liftedVerticalLineAnswerFamily params strategy u := by
exact liftedVerticalLineAnswerFamily_eq_of_same_truncate_degree_zero
params strategy hd_zero (by simp)
simp [F, hline]
_ = bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := haverage_to_gb
_ ≤ zeta' + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta') :=
hgb.offDiagonalBound
_ = min zeta 1 +
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1) := by
simp [eps', delta', zeta']
/-- The averaged degree-zero pasted submeasurement is point-consistent before
completion. -/
theorem degreeZero_averagedSlice_pointConsistency
(params : Parameters) [FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta gamma zeta : Error)
(hgood : strategy.IsGood eps delta gamma)
(family : IdxPolyFamily params ι)
(hcons : family.ConsistentWithPoints strategy zeta)
(hd_zero : params.d = 0) :
ConsRel strategy.state (uniformDistribution (Point params.next))
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(min zeta 1 +
2 * Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)) := by
let eps' : Error := min eps 1
let delta' : Error := min delta 1
let lineMeas : IdxMeas (Point params.next) (Fq params.next) ι := fun u =>
{ toSubMeas := liftedVerticalLineAnswerFamily params strategy u
total_eq_one :=
(strategy.axisParallelMeasurement
{ base := appendPoint params (truncatePoint params u) zeroCoord
direction := lastCoord params }).total_eq_one }
let pointMeas : IdxMeas (Point params.next) (Fq params.next) ι :=
fun u => (strategy.pointMeasurement u).toMeasurement
have hline :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas lineMeas)
(min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
have hline_eq :
IdxMeas.toIdxSubMeas lineMeas =
liftedVerticalLineAnswerFamily params strategy := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
rw [hline_eq]
simpa [eps', delta'] using
degreeZero_averagedSlice_liftedVerticalLineConsistency params strategy
eps delta gamma zeta hgood family hcons hd_zero
have haxis_le_one : strategy.axisParallelFailureProbability ≤ 1 := by
simpa [SymStrat.axisParallelFailureProbability] using
bipartiteConsError_uniform_le_one strategy.state strategy.isNormalized
(axisParallelPointAnswerFamily strategy)
(axisParallelLineAnswerFamily strategy)
have hself_le_one : strategy.selfConsistencyFailureProbability ≤ 1 := by
simpa [SymStrat.selfConsistencyFailureProbability] using
bipartiteSSCError_uniform_le_one strategy.state strategy.isNormalized
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
have hgood_small : strategy.IsGood eps' delta' gamma := by
refine ⟨?_, ?_, hgood.diagonalLineTest⟩
· exact le_min hgood.axisParallelTest haxis_le_one
· exact le_min hgood.selfConsistencyTest hself_le_one
have hpoint_sdd :
SDDRel strategy.state (uniformDistribution (Point params.next))
(IdxSubMeas.liftRight (IdxMeas.toIdxSubMeas lineMeas))
(IdxSubMeas.liftRight (IdxMeas.toIdxSubMeas pointMeas))
(8 * (params.m : Error) * eps' + 4 * delta') := by
have hpublic :=
pointVerticalLineSdd_liftedVerticalLine_of_axis_self params strategy
eps' delta' hgood_small.axisParallelTest hgood_small.selfConsistencyTest
have hline_eq :
IdxMeas.toIdxSubMeas lineMeas =
liftedVerticalLineAnswerFamily params strategy := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
have hpoint_eq :
IdxMeas.toIdxSubMeas pointMeas =
IdxProjMeas.toIdxSubMeas strategy.pointMeasurement := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
rw [hline_eq, hpoint_eq]
exact Preliminaries.sddRel_symm strategy.state
(uniformDistribution (Point params.next)) _ _ _ hpublic
have htri :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas pointMeas)
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
exact Preliminaries.triangleSub_right strategy.state
(uniformDistribution (Point params.next))
strategy.isNormalized
(by simpa using uniformDistribution_weight_sum_le_one (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
lineMeas pointMeas
(min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta'))
(8 * (params.m : Error) * eps' + 4 * delta')
hline hpoint_sdd
have hswap :
ConsRel strategy.state (uniformDistribution (Point params.next))
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
exact consRel_symm_of_density_fixed strategy.state strategy.densityFixed
(uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas pointMeas)
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta'))
htri
exact ConsRel.mono (by
simp [eps', delta']
ring_nf
exact le_rfl) hswap
/-- Axis/self-consistency form of the degree-zero lifted-line consistency
estimate.
The degree-zero averaging argument uses the axis-parallel test and
self-consistency, but not the diagonal-line test. -/
theorem degreeZero_averagedSlice_liftedVerticalLineConsistency_of_axis_self
(params : Parameters) [FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta zeta : Error)
(haxis : strategy.axisParallelFailureProbability ≤ eps)
(hself : strategy.selfConsistencyFailureProbability ≤ delta)
(family : IdxPolyFamily params ι)
(hcons : family.ConsistentWithPoints strategy zeta)
(hd_zero : params.d = 0) :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(liftedVerticalLineAnswerFamily params strategy)
(min zeta 1 +
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)) := by
let eps' : Error := min eps 1
let delta' : Error := min delta 1
let zeta' : Error := min zeta 1
have haxis_le_one : strategy.axisParallelFailureProbability ≤ 1 := by
simpa [SymStrat.axisParallelFailureProbability] using
bipartiteConsError_uniform_le_one strategy.state strategy.isNormalized
(axisParallelPointAnswerFamily strategy)
(axisParallelLineAnswerFamily strategy)
have hself_le_one : strategy.selfConsistencyFailureProbability ≤ 1 := by
simpa [SymStrat.selfConsistencyFailureProbability] using
bipartiteSSCError_uniform_le_one strategy.state strategy.isNormalized
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
have haxis_small : strategy.axisParallelFailureProbability ≤ eps' := by
exact le_min haxis haxis_le_one
have hself_small : strategy.selfConsistencyFailureProbability ≤ delta' := by
exact le_min hself hself_le_one
have hcons_small : family.ConsistentWithPoints strategy zeta' := by
simpa [zeta'] using consistentWithPoints_min_one params strategy family zeta hcons
have hgb := ldGbcon_liftedVerticalLine_of_axis_self params strategy eps' delta' zeta'
haxis_small hself_small family hcons_small
let F : Point params → Fq params → Error := fun u x =>
qBipartiteConsDefect strategy.state
(family.evaluatedAtNextPoint (appendPoint params u x))
(liftedVerticalLineAnswerFamily params strategy (appendPoint params u x))
have haverage_to_gb :
avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x)) =
bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := by
calc
avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x))
= avgOver (uniformDistribution (Fq params))
(fun _ => avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x))) := by
simpa [truncatePoint_appendPoint] using
CommutativityPoints.avgOver_uniform_pointNext_decompose params
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x))
_ = avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x)) := by
simpa using avgOver_uniform_const (α := Fq params)
(avgOver (uniformDistribution (Point params))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x => F u x)))
_ = avgOver (uniformDistribution (Fq params))
(fun x => avgOver (uniformDistribution (Point params)) (fun u => F u x)) := by
exact avgOver_uniform_comm (fun u x => F u x)
_ = avgOver (uniformDistribution (Point params.next))
(fun v => F (truncatePoint params v) (pointHeight params v)) := by
simpa [truncatePoint_appendPoint, pointHeight_appendPoint] using
(CommutativityPoints.avgOver_uniform_pointNext_decompose params
(fun v => F (truncatePoint params v) (pointHeight params v))).symm
_ = bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := by
unfold bipartiteConsError
apply avgOver_congr
intro v
have happend :
appendPoint params (truncatePoint params v) (pointHeight params v) = v := by
exact (CommutativityPoints.pointNextEquiv params).left_inv v
simp [F, happend]
constructor
unfold bipartiteConsError
calc
avgOver (uniformDistribution (Point params.next))
(fun u => qBipartiteConsDefect strategy.state
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family) u)
(liftedVerticalLineAnswerFamily params strategy u))
≤ avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params)) (fun x =>
qBipartiteConsDefect strategy.state
(family.evaluatedAtNextPoint (appendPoint params (truncatePoint params u) x))
(liftedVerticalLineAnswerFamily params strategy u))) := by
apply avgOver_mono
intro u
rw [polynomialEvaluation_averagedSliceAppendedSubMeas_eq_average params family u]
exact qBipartiteConsDefect_averageIdxSubMeas_left_le strategy.state
(uniformDistribution (Fq params))
(fun x => family.evaluatedAtNextPoint
(appendPoint params (truncatePoint params u) x))
(liftedVerticalLineAnswerFamily params strategy u)
(uniformDistribution_weight_sum_le_one (Fq params))
_ = avgOver (uniformDistribution (Point params.next))
(fun u => avgOver (uniformDistribution (Fq params))
(fun x => F (truncatePoint params u) x)) := by
apply avgOver_congr
intro u
apply avgOver_congr
intro x
have hline :
liftedVerticalLineAnswerFamily params strategy
(appendPoint params (truncatePoint params u) x) =
liftedVerticalLineAnswerFamily params strategy u := by
exact liftedVerticalLineAnswerFamily_eq_of_same_truncate_degree_zero
params strategy hd_zero (by simp)
simp [F, hline]
_ = bipartiteConsError strategy.state (uniformDistribution (Point params.next))
family.evaluatedAtNextPoint
(liftedVerticalLineAnswerFamily params strategy) := haverage_to_gb
_ ≤ zeta' + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta') :=
hgb.offDiagonalBound
_ = min zeta 1 +
Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1) := by
simp [eps', delta', zeta']
/-- Axis/self-consistency form of the degree-zero point-consistency estimate
before completion. -/
theorem degreeZero_averagedSlice_pointConsistency_of_axis_self
(params : Parameters) [FieldModel params.q]
(strategy : SymStrat params.next ι)
(eps delta zeta : Error)
(haxis : strategy.axisParallelFailureProbability ≤ eps)
(hself : strategy.selfConsistencyFailureProbability ≤ delta)
(family : IdxPolyFamily params ι)
(hcons : family.ConsistentWithPoints strategy zeta)
(hd_zero : params.d = 0) :
ConsRel strategy.state (uniformDistribution (Point params.next))
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(min zeta 1 +
2 * Real.sqrt (8 * (params.m : Error) * min eps 1 + 4 * min delta 1)) := by
let eps' : Error := min eps 1
let delta' : Error := min delta 1
let lineMeas : IdxMeas (Point params.next) (Fq params.next) ι := fun u =>
{ toSubMeas := liftedVerticalLineAnswerFamily params strategy u
total_eq_one :=
(strategy.axisParallelMeasurement
{ base := appendPoint params (truncatePoint params u) zeroCoord
direction := lastCoord params }).total_eq_one }
let pointMeas : IdxMeas (Point params.next) (Fq params.next) ι :=
fun u => (strategy.pointMeasurement u).toMeasurement
have hline :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas lineMeas)
(min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
have hline_eq :
IdxMeas.toIdxSubMeas lineMeas =
liftedVerticalLineAnswerFamily params strategy := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
rw [hline_eq]
simpa [eps', delta'] using
degreeZero_averagedSlice_liftedVerticalLineConsistency_of_axis_self params strategy
eps delta zeta haxis hself family hcons hd_zero
have haxis_le_one : strategy.axisParallelFailureProbability ≤ 1 := by
simpa [SymStrat.axisParallelFailureProbability] using
bipartiteConsError_uniform_le_one strategy.state strategy.isNormalized
(axisParallelPointAnswerFamily strategy)
(axisParallelLineAnswerFamily strategy)
have hself_le_one : strategy.selfConsistencyFailureProbability ≤ 1 := by
simpa [SymStrat.selfConsistencyFailureProbability] using
bipartiteSSCError_uniform_le_one strategy.state strategy.isNormalized
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
have haxis_small : strategy.axisParallelFailureProbability ≤ eps' := by
exact le_min haxis haxis_le_one
have hself_small : strategy.selfConsistencyFailureProbability ≤ delta' := by
exact le_min hself hself_le_one
have hpoint_sdd :
SDDRel strategy.state (uniformDistribution (Point params.next))
(IdxSubMeas.liftRight (IdxMeas.toIdxSubMeas lineMeas))
(IdxSubMeas.liftRight (IdxMeas.toIdxSubMeas pointMeas))
(8 * (params.m : Error) * eps' + 4 * delta') := by
have hpublic :=
pointVerticalLineSdd_liftedVerticalLine_of_axis_self params strategy
eps' delta' haxis_small hself_small
have hline_eq :
IdxMeas.toIdxSubMeas lineMeas =
liftedVerticalLineAnswerFamily params strategy := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
have hpoint_eq :
IdxMeas.toIdxSubMeas pointMeas =
IdxProjMeas.toIdxSubMeas strategy.pointMeasurement := by
funext u
try rfl -- vendoring compile fix (Lean v4.33): the previous step may close the goal
rw [hline_eq, hpoint_eq]
exact Preliminaries.sddRel_symm strategy.state
(uniformDistribution (Point params.next)) _ _ _ hpublic
have htri :
ConsRel strategy.state (uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas pointMeas)
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
exact Preliminaries.triangleSub_right strategy.state
(uniformDistribution (Point params.next))
strategy.isNormalized
(by simpa using uniformDistribution_weight_sum_le_one (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
lineMeas pointMeas
(min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta'))
(8 * (params.m : Error) * eps' + 4 * delta')
hline hpoint_sdd
have hswap :
ConsRel strategy.state (uniformDistribution (Point params.next))
(IdxProjMeas.toIdxSubMeas strategy.pointMeasurement)
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) := by
exact consRel_symm_of_density_fixed strategy.state strategy.densityFixed
(uniformDistribution (Point params.next))
(polynomialEvaluationFamily params.next
(averagedSliceAppendedSubMeas params family))
(IdxMeas.toIdxSubMeas pointMeas)
((min zeta 1 + Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta')) +
Real.sqrt (8 * (params.m : Error) * eps' + 4 * delta'))
htri
exact ConsRel.mono (by
simp [eps', delta']
ring_nf
exact le_rfl) hswap
end MIPStarRE.LDT.Pasting