Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Direct Analytic Evaluation Preserves Embedded Integer Results

Proved
Monodromy.AnalyticComparison.eval_embed

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For 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.

Preamble
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]

Formal statement
theorem Monodromy.AnalyticComparison.eval_embed (program : Program degree) (labels : Labels) :
    eval program (embed labels) = embed <$> program.evalInt labels := by sorry
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/Effectiveness.lean (file SHA-256 90d9fd8cedd8839d63110e1673758c66fd34eb170016cb9a2ad4c136d0777dd3): Monodromy.AnalyticComparison.eval_embed at L580-L594 [UTF-8 27331:28088].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For every positive natural number ddd, every program consisting of a finite word WiW_iWi​ and a Boolean stopping flag sis_isi​ for each i∈{0,…,d−1}i\in\{0,\ldots,d-1\}i∈{0,…,d−1}, and every integer triple ℓ=((a,b),c)\ell=((a,b),c)ℓ=((a,b),c), the partial real-valued evaluation begun at ((a,b),c)∈(R2)×R((a,b),c)\in(\mathbb R^2)\times\mathbb R((a,b),c)∈(R2)×R equals the partial integer evaluation followed, when defined, by coordinatewise inclusion into the reals. The integer evaluator chooses i=c mod di=c\bmod di=cmodd using the nonnegative Euclidean residue, stops with the current state when sis_isi​ is true, and otherwise applies WiW_iWi​ and repeats. Words are executed in list order; with displacement ε=−1\varepsilon=-1ε=−1 for a backward atom and +1+1+1 otherwise, their five integer atoms add ε\varepsilonε to aaa, add it to bbb, add it to ccc if a=0a=0a=0, add it to ccc if b=0b=0b=0, or add it unconditionally to ccc, respectively. In the real evaluator the conditional atoms instead add εsinc⁡(πa)\varepsilon\operatorname{sinc}(\pi a)εsinc(πa) or εsinc⁡(πb)\varepsilon\operatorname{sinc}(\pi b)εsinc(πb), with sinc⁡(0)=1\operatorname{sinc}(0)=1sinc(0)=1. Put ωi=e2πi−1/d\omega_i=e^{2\pi i\sqrt{-1}/d}ωi​=e2πi−1​/d and Kf(r,z)=Df(r,z)/f′(r)K_f(r,z)=D_f(r,z)/f'(r)Kf​(r,z)=Df​(r,z)/f′(r), where Df(r,r)=f′(r)D_f(r,r)=f'(r)Df​(r,r)=f′(r) and Df(r,z)=(f(z)−f(r))/(z−r)D_f(r,z)=(f(z)-f(r))/(z-r)Df​(r,z)=(f(z)−f(r))/(z−r) for z≠rz\ne rz=r; the real weights are wi(c)=Re⁡Kz↦zd(ωi,e2πc−1/d)w_i(c)=\operatorname{Re}K_{z\mapsto z^d}(\omega_i,e^{2\pi c\sqrt{-1}/d})wi​(c)=ReKz↦zd​(ωi​,e2πc−1​/d). Its next state is ∑iwi(c)Wi(ℓ)\sum_i w_i(c)W_i(\ell)∑i​wi​(c)Wi​(ℓ) and its stopping signal is ∑iwi(c)1si\sum_iw_i(c)\mathbf1_{s_i}∑i​wi​(c)1si​​, with stopping precisely when that real signal equals 111. 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.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me