Documentation

MIPRE.Background.LIDT.Co.MainInductionStep.Theorems.AvgSliceErrors.Successor

Section 6 β€” Averaged Slice Error Bounds: Successor Outputs #

The recursive answer-valued slice measurements of the successor step, the self-improvement outputs on those slices, and the comparison of the self-improvement error ΞΆ with the next-stage induction parameter Ξ½. This is the counterpart of MIPRE/Background/LIDT/MIPStarRE/LDT/MainInductionStep/Theorems/AvgSliceErrors/Successor.lean in the port of planning/c6b-plan.md (milestone M12, section "Port conventions").

Translation #

A strategy is a SymStrat params.next 𝔓 K or an AnswerSymStrat params.next 𝔓 K (Co/Test/StrategyCore.lean), whose state is the symmetric model strategy.state : SymModel 𝔓 K; Polynomial params is MIPStarRE.LDT.Polynomial params, MIPStarRE.Quantum.Op ΞΉ is 𝔓, Error is ℝ, H.toSubMeas.liftLeft is H.toSubMeas.liftLeft strategy.state, leftPlacedSubMeas (ΞΉB := ΞΉ) is strategy.state.leftPlacedSubMeas (and rightPlacedSubMeas), and the relations (ConsRel, BipartiteSSCRel, SDDRel, CompletenessAtLeast) are read on strategy.state. The error functions (mainInductionError, mainInductionNu, selfImprovementInInductionError, sliceConditioningLoss) and dq_ratio_le_one are the vendored classical declarations, reached through explicit open lists. No vendored statement here has a swap, density or normalization hypothesis, so none is dropped. The vendored file-wide respectTransparency false is not needed: the file sets no option.

Threaded hypotheses #

answerSuccessorRecursiveSliceMeasurements_ofMainInductionHypothesis applies Co answerSuccessorRestrictedSliceConclusions, which takes the model hypotheses hS : strategy.state.toBipartite.IsFinitePair and hA : NoAbelianProj strategy.state.toBipartite.opsA of the predecessor AnswerMainInductionHypothesis; so it takes hS hA right after strategy. answerSuccessorSelfImprovementOutputs_ofMainInductionHypothesis also runs selfImprovementInInductionSection_of_axisParallel_selfConsistency (Co SelfImprovementAssembly/Core) on each slice carrier, so it takes hS hA and hd : 1 ≀ params.d right after strategy. The slice carrier answerSelfImprovementCarrier params (xRestrictedAnswerSymStratOfAnswer params strategy x) has the ambient state by definition, so hS and hA pass to it unchanged; hd is a hypothesis on params. The universe binder of the induction hypothesis is AnswerMainInductionHypothesis.{uF, uP, uK}, with 𝔓 : Type uP and K : Type uK, where the vendored one is .{uF, uΞΉ}. The two ΞΆ ≀ Ξ½ lemmas take no new hypothesis.

Proofs that differ from the vendored ones #

Not ported #

Every declaration of the vendored file has a counterpart here.

References #

In LionSR/MIPStarRE at commit 507e8122, not in this repository:

theorem MIPRE.LIDT.Co.MainInductionStep.answerSuccessorRecursiveSliceMeasurements_ofMainInductionHypothesis {𝔓 : Type uP} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type uK} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] (params : MIPStarRE.LDT.Parameters) [MIPStarRE.LDT.FieldModel params.q] (strategy : AnswerSymStrat params.next 𝔓 K) (hS : strategy.state.toBipartite.IsFinitePair) (hA : NoAbelianProj strategy.state.toBipartite.opsA) (eps delta gamma : ℝ) (k : β„•) (hgood : strategy.IsGood eps delta gamma) (hinduction : AnswerMainInductionHypothesis params) (hk_next : 400 * params.next.m * params.next.d ≀ k) (hsmall : MIPStarRE.LDT.MainInductionStep.mainInductionError params.next k eps delta gamma < 1) :

Extract the recursive answer-valued slice measurements and their averaged main-induction error bound.

Paper origin: references/ldt-paper/inductive_step.tex:441-551. After the restricted-probabilities theorem and the predecessor answer-valued induction hypothesis are applied to the restricted slices, this theorem packages the resulting measurements G^x and proves the displayed bound \mathbb E_x \sigma_x \leq \sigma.

Lean-only: This is an internal construction theorem for the simultaneous answer-valued successor route tracked in issue #1507; it does not add a predecessor conclusion as an assumption to any source-facing theorem. Discharge: proved here from the restricted-probabilities theorem and the answer-valued predecessor induction hypothesis. The model hypotheses hS hA are those the predecessor hypothesis requires of each slice (module docstring).

theorem MIPRE.LIDT.Co.MainInductionStep.answerSuccessorSelfImprovementOutputs_ofMainInductionHypothesis {𝔓 : Type uP} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type uK} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] (params : MIPStarRE.LDT.Parameters) [MIPStarRE.LDT.FieldModel params.q] (strategy : AnswerSymStrat params.next 𝔓 K) (hS : strategy.state.toBipartite.IsFinitePair) (hA : NoAbelianProj strategy.state.toBipartite.opsA) (hd : 1 ≀ params.d) (eps delta gamma : ℝ) (k : β„•) (hgood : strategy.IsGood eps delta gamma) (hinduction : AnswerMainInductionHypothesis params) (hk_next : 400 * params.next.m * params.next.d ≀ k) (hsmall : MIPStarRE.LDT.MainInductionStep.mainInductionError params.next k eps delta gamma < 1) :
βˆƒ (profile : AnswerSuccessorRestrictedFailureProfile params strategy) (sliceError : MIPStarRE.LDT.Fq params β†’ ℝ) (sliceMeasurement : MIPStarRE.LDT.Fq params β†’ Measurement (MIPStarRE.LDT.Polynomial params) 𝔓) (sliceProj : MIPStarRE.LDT.Fq params β†’ ProjSubMeas (MIPStarRE.LDT.Polynomial params) 𝔓) (sliceWitness : MIPStarRE.LDT.Fq params β†’ 𝔓), averageAnswerSuccessorRestrictedAxisParallelError params profile ≀ MIPStarRE.LDT.MainInductionStep.sliceConditioningLoss params * eps ∧ averageAnswerSuccessorRestrictedSelfConsistencyError params profile ≀ delta ∧ averageAnswerSuccessorRestrictedDiagonalError params profile ≀ MIPStarRE.LDT.MainInductionStep.sliceConditioningLoss params * gamma ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), strategy.state.ConsRel (MIPStarRE.LDT.uniformDistribution (MIPStarRE.LDT.Point params)) (xRestrictedAnswerSymStratOfAnswer params strategy x).pointMeasurement.toIdxSubMeas (polynomialEvaluationFamily params (sliceMeasurement x).toSubMeas) (sliceError x)) ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), sliceError x ≀ MIPStarRE.LDT.MainInductionStep.mainInductionError params k (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x)) ∧ MIPStarRE.LDT.avgOver (MIPStarRE.LDT.uniformDistribution (MIPStarRE.LDT.Fq params)) sliceError ≀ ↑params.m ^ 2 * (MIPStarRE.LDT.MainInductionStep.mainInductionNu params.next k eps delta gamma + Real.exp (-(↑k / (80000 * ↑params.m ^ 2)))) ∧ (MIPStarRE.LDT.avgOver (MIPStarRE.LDT.uniformDistribution (MIPStarRE.LDT.Fq params)) fun (x : MIPStarRE.LDT.Fq params) => MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x)) ≀ MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params.next eps delta gamma ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), strategy.state.CompletenessAtLeast (SubMeas.liftLeft strategy.state (sliceProj x).toSubMeas) (1 - sliceError x - MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x))) ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), strategy.state.ConsRel (MIPStarRE.LDT.uniformDistribution (MIPStarRE.LDT.Point params)) (xRestrictedAnswerSymStratOfAnswer params strategy x).pointMeasurement.toIdxSubMeas (polynomialEvaluationFamily params (sliceProj x).toSubMeas) (MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x))) ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), strategy.state.BipartiteSSCRel (MIPStarRE.LDT.uniformDistribution Unit) (constSubMeasFamily (sliceProj x).toSubMeas) (MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x))) ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), strategy.state.SDDRel (MIPStarRE.LDT.uniformDistribution Unit) (constSubMeasFamily (strategy.state.leftPlacedSubMeas (sliceProj x).toSubMeas)) (constSubMeasFamily (strategy.state.rightPlacedSubMeas (sliceProj x).toSubMeas)) (MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x))) ∧ (βˆ€ (x : MIPStarRE.LDT.Fq params), tensorFailureExpectation strategy.state (sliceWitness x) (sliceProj x).toSubMeas ≀ MIPStarRE.LDT.MainInductionStep.selfImprovementInInductionError params (profile.axisParallel x) (profile.selfConsistency x) (profile.diagonal x)) ∧ βˆ€ (x : MIPStarRE.LDT.Fq params) (h : MIPStarRE.LDT.Polynomial params), IdxPolyFamily.averagedSlicePointEvaluationOperator (answerSelfImprovementCarrier params.next strategy) x h ≀ sliceWitness x

Apply self-improvement to the recursive answer-valued successor slices.

Paper origin: references/ldt-paper/inductive_step.tex:461-551. Starting from the recursive answer-valued slice measurements supplied by the predecessor induction hypothesis, this theorem constructs the projective slice submeasurements \widehat G^x and witnesses Z^x, proves their four self-improvement outputs, and keeps the averaged \zeta_x and \sigma_x bounds available.

Lean-only: The ordinary carrier appears only in the domination field, where its point measurement is the same last-coordinate restriction of the ambient answer-valued point measurement. The proof invokes only the axis-parallel/self-consistency form of self-improvement, and therefore does not claim that the carrier's dummy diagonal measurement is a good diagonal realization of the answer-valued strategy. This internal construction is tracked in issue #1507. Discharge: proved here from the recursive slice measurements and the formal self-improvement theorem. The hypotheses hS hA hd are those of the predecessor hypothesis and of the ported self-improvement theorem (module docstring).

theorem MIPRE.LIDT.Co.MainInductionStep.selfImprovementInInductionError_le_mainInductionNu {𝔓 : Type uP} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type uK} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] (params : MIPStarRE.LDT.Parameters) [MIPStarRE.LDT.FieldModel params.q] (strategy : SymStrat params.next 𝔓 K) (eps delta gamma : ℝ) (k : β„•) (hgood : strategy.IsGood eps delta gamma) (hsmall : MIPStarRE.LDT.MainInductionStep.mainInductionError params.next k eps delta gamma < 1) (heps_le_one : eps ≀ 1) (hdelta_le_one : delta ≀ 1) (hdq_le_q : params.d ≀ params.q) :

Paper's \eqref{eq:zeta-smaller-than-nu}: under the small-parameter hypotheses, the averaged self-improvement interface error \zeta is bounded by the next-stage induction parameter \nu.

theorem MIPRE.LIDT.Co.MainInductionStep.answer_selfImprovementInInductionError_le_mainInductionNu {𝔓 : Type uP} [CStarAlgebra 𝔓] [PartialOrder 𝔓] [StarOrderedRing 𝔓] {K : Type uK} [NormedAddCommGroup K] [InnerProductSpace β„‚ K] [CompleteSpace K] (params : MIPStarRE.LDT.Parameters) [MIPStarRE.LDT.FieldModel params.q] (strategy : AnswerSymStrat params.next 𝔓 K) (eps delta gamma : ℝ) (k : β„•) (hgood : strategy.IsGood eps delta gamma) (hsmall : MIPStarRE.LDT.MainInductionStep.mainInductionError params.next k eps delta gamma < 1) (heps_le_one : eps ≀ 1) (hdelta_le_one : delta ≀ 1) (hdq_le_q : params.d ≀ params.q) :

Answer-valued analogue of selfImprovementInInductionError_le_mainInductionNu.

This is the scalar part of the successor proof for an ambient answer-valued strategy. It uses only the answer-valued goodness bounds and does not replace the answer-valued diagonal measurement by an ordinary one.