Direct Analytic Evaluation Preserves Embedded Integer Results
ProvedMonodromy.AnalyticComparison.eval_embedFor every positive natural degree d, every program P:Program d and every integer label triple λ, the direct three-real-coordinate comparator’s partial evaluation from the coordinatewise real embedding of λ equals the real embedding mapped over P.evalInt(λ). Equality includes complete results and undefinedness; the initial states quantified here are embedded integer triples.
Statement dependencies: Monodromy.AnalyticComparison.State, Monodromy.AnalyticComparison.embed, Monodromy.AnalyticComparison.eval, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.evalInt.
Original proof dependencies: Monodromy.AnalyticComparison.State, Monodromy.AnalyticComparison.embed, Monodromy.AnalyticComparison.step, Monodromy.AnalyticComparison.step_embed, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.stepInt.
Statement elaboration dependencies: Monodromy.AnalyticComparison.State, Monodromy.AnalyticComparison.embed, Monodromy.AnalyticComparison.eval, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.evalInt.
Proof elaboration dependencies: Monodromy.AnalyticComparison.State, Monodromy.AnalyticComparison.embed, Monodromy.AnalyticComparison.step, Monodromy.AnalyticComparison.step_embed, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.stepInt.
module
public import Definitions.Def_Monodromy_Effectiveness
public import Lean.Elab.Tactic.Omega
public import Mathlib.Analysis.Analytic.Constructions
public import Mathlib.Analysis.Analytic.IsolatedZeros
public import Mathlib.Analysis.Analytic.Linear
public import Mathlib.Analysis.Calculus.DSlope
public import Mathlib.Analysis.Calculus.Deriv.Add
public import Mathlib.Analysis.Calculus.Deriv.Comp
public import Mathlib.Analysis.Calculus.Deriv.Mul
public import Mathlib.Analysis.Calculus.Deriv.Pow
public import Mathlib.Analysis.Complex.Basic
public import Mathlib.Analysis.Complex.CoveringMap
public import Mathlib.Analysis.Real.Pi.Bounds
public import Mathlib.Analysis.SpecialFunctions.Complex.Analytic
public import Mathlib.Analysis.SpecialFunctions.Complex.Circle
public import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
public import Mathlib.Analysis.SpecialFunctions.Trigonometric.Sinc
public import Mathlib.Computability.PartrecCode
public import Mathlib.Computability.Primrec.Basic
public import Mathlib.Computability.Primrec.List
public import Mathlib.Computability.StateTransition
public import Mathlib.Computability.TuringMachine.PostTuringMachine
public import Mathlib.Data.Fin.Basic
public import Mathlib.Data.Fintype.Card
public import Mathlib.Data.Int.ModEq
public import Mathlib.Data.Nat.Digits.Lemmas
public import Mathlib.Logic.Equiv.Fin.Rotate
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.RingTheory.RootsOfUnity.Complex
public import Mathlib.Tactic.FieldSimp
public import Mathlib.Tactic.FunProp
public import Mathlib.Tactic.Linarith
public import Mathlib.Tactic.Ring
public import Mathlib.Topology.Homotopy.Lifting
@[expose] public section
open Monodromy
open Monodromy.AnalyticComparison
open CoupledContinuation
variable {degree : ℕ} [NeZero degree]
theorem Monodromy.AnalyticComparison.eval_embed (program : Program degree) (labels : Labels) :
eval program (embed labels) = embed <$> program.evalInt labels := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural number , every program consisting of a finite word and a Boolean stopping flag for each , and every integer triple , the partial real-valued evaluation begun at equals the partial integer evaluation followed, when defined, by coordinatewise inclusion into the reals. The integer evaluator chooses using the nonnegative Euclidean residue, stops with the current state when is true, and otherwise applies and repeats. Words are executed in list order; with displacement for a backward atom and otherwise, their five integer atoms add to , add it to , add it to if , add it to if , or add it unconditionally to , respectively. In the real evaluator the conditional atoms instead add or , with . Put and , where and for ; the real weights are . Its next state is and its stopping signal is , with stopping precisely when that real signal equals . Both partial evaluations return the last state at a finite stop and are undefined for a run that never stops; the equality includes equality of definedness and of returned values, for all integer triples including negative coordinates.
Confirmed by the mission captain (proposal self-audit).