Native Partial Evaluation Equals Prepared Integer Evaluation
ProvedMonodromy.CoupledContinuation.Program.eval_prepareIntFor every positive natural degree d, every finite word-and-stop program P of degree d, and every integer label triple λ∈ℤ³, . This is equality of partial complete-state results, including undefinedness, rather than only equality of one-step transitions.
Statement dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.evalInt.
Original proof dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.Program.stepInt, Monodromy.CoupledContinuation.Program.step_prepareInt.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.evalInt.
Proof elaboration dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.Program.stepInt, Monodromy.CoupledContinuation.Program.step_prepareInt.
module
public import Definitions.Def_Monodromy_Continuation
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.Computability.StateTransition
public import Mathlib.Data.Fin.Basic
public import Mathlib.Data.Fintype.Card
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.CoupledContinuation
open Monodromy
open Monodromy.CoupledContinuation
open Monodromy.CoupledContinuation.Program
variable {degree : ℕ} [NeZero degree]
theorem Monodromy.CoupledContinuation.Program.eval_prepareInt (program : Program degree) (labels : Labels) :
program.eval (Labels.prepare labels) = Labels.prepare <$> 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 geometric program consisting of a word and a Boolean stop flag at each , and every integer triple , partial evaluation from the prepared memory equals preparation applied to the partial integer evaluation from . Here , , and memory is the fiber over of . An integer step selects as the nonnegative Euclidean residue of modulo , returns no successor if is true, and otherwise evaluates from left to right: a forward left or right gate adds to the corresponding lower label, a control gate adds to , and a zero-left or zero-right gate adds to exactly when that lower label is zero; reverse gates use . The geometric step selects the same word by the root and normalized divided differences of at its th roots of unity, and either stops at signal or executes its coupled covering-space lifts. Both evaluators return their last state at a finite halt and are undefined for infinite execution. The equality of partial values therefore includes both matching domains and the entire prepared final state, for all negative, zero and positive integer labels, and includes immediate stopping and .
Confirmed by the mission captain (proposal self-audit).