The Native First-Return Macro Returns the Exact Optional Turing Step
ProvedMonodromy.NativeTuring.macroStep_iotaFor positive naturals a,q, every Turing machine m over Fin a and Fin q, and every complete configuration x, the causally executed native macro at its specified encoding I(x) is the defined partial value obtained by mapping I over TM0.step(m,x). It therefore returns the optional result none for a halted configuration and some I(y) for a successful source step to y.
Statement dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.NativeTuring.iota, Monodromy.NativeTuring.macroStep.
Original proof dependencies: Monodromy.Counter.Compression.size, Monodromy.Counter.TuringCompiler.size, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.step, Monodromy.NativeTuring.FirstReturn, Monodromy.NativeTuring.InternalReaches, Monodromy.NativeTuring.boundaryProgram, Monodromy.NativeTuring.boundary_iota, Monodromy.NativeTuring.boundary_stops, Monodromy.NativeTuring.internal_marked_reaches, Monodromy.NativeTuring.iota, Monodromy.NativeTuring.macroStep, Monodromy.NativeTuring.program, Monodromy.NativeTuring.source2_nonempty, Monodromy.NativeTuring.source3, Monodromy.NativeTuring.step_firstReturn, Monodromy.NativeTuring.step_halt.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.NativeTuring.iota, Monodromy.NativeTuring.macroStep.
Proof elaboration dependencies: Monodromy.Counter.Compression.size, Monodromy.Counter.TuringCompiler.size, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.step, Monodromy.NativeTuring.FirstReturn, Monodromy.NativeTuring.InternalReaches, Monodromy.NativeTuring.boundaryProgram, Monodromy.NativeTuring.boundary_iota, Monodromy.NativeTuring.boundary_stops, Monodromy.NativeTuring.internal_marked_reaches, Monodromy.NativeTuring.iota, Monodromy.NativeTuring.macroStep, Monodromy.NativeTuring.program, Monodromy.NativeTuring.source2_nonempty, Monodromy.NativeTuring.source3, Monodromy.NativeTuring.step_firstReturn, Monodromy.NativeTuring.step_halt.
module public import Definitions.Def_Monodromy_FormalCompilation 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.Computability.TuringMachine.PostTuringMachine public import Mathlib.Computability.TuringMachine.ToPartrec public import Mathlib.Data.Fin.Basic public import Mathlib.Data.Fintype.Card public import Mathlib.Data.Fintype.EquivFin public import Mathlib.Data.Fintype.Sets public import Mathlib.Data.Nat.Digits.Lemmas public import Mathlib.Data.Nat.Factorization.Basic public import Mathlib.Logic.Equiv.Fin.Basic public import Mathlib.Logic.Equiv.Fin.Rotate public import Mathlib.Logic.Function.Basic public import Mathlib.Logic.Function.Conjugate public import Mathlib.RingTheory.RootsOfUnity.Complex public import Mathlib.Tactic.FieldSimp public import Mathlib.Tactic.FinCases 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.NativeTuring open Turing CoupledContinuation variable (a q : ℕ) [NeZero a] [NeZero q]
theorem Monodromy.NativeTuring.macroStep_iota (machine : TM0.Machine (Fin a) (Fin q)) (state : TM0.Cfg (Fin a) (Fin q)) :
macroStep a q machine (iota a q machine state) =
Part.some ((TM0.step machine state).map (iota a q machine)) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For positive natural numbers , every partial Turing table on controls and symbols, and every complete configuration , the native macro computation at its encoded memory is a defined partial value equal to some applied to the optional result of one Turing step, with any successor encoded. More explicitly, encode the two blank-padded half-tapes in base , giving , put into a three-counter configuration at the dispatch tagged by the scanned symbol and source control, compress those registers to at the corresponding nested dispatch, then prepare the memory with lower coordinates and upper coordinate , where is that compressed finite control index. The native table is the three-phase geometric word compilation of the compressed counter table: Turing moves use multiplication by , bounded digit addition and division; compression replaces increments by multiplication by the corresponding prime and decrements by division and conditional restoration. The macro first attempts one native step: if it has no successor it immediately returns the defined optional result none; otherwise it evaluates the same words from that successor, replacing the stop flags by marks exactly at phase-zero nested source dispatches, and wraps the resulting memory in some. The equality says this latter partial evaluation always terminates on these encodings, returns the encoding of the exact Turing successor when one exists, and gives a defined none when the source step halts. It is not a claim that an entire Turing execution terminates; arbitrary tapes, blank symbols and the case are included.
Confirmed by the mission captain (proposal self-audit).