Words Without Conditional Gates Act by Their Translation at Zero
ProvedMonodromy.CoupledContinuation.Word.evalInt_translationFor every finite signed gate word W containing neither zeroLeft nor zeroRight in either direction, and every integer label triple λ, . The addition is coordinatewise on ℤ³; the empty word and arbitrary negative label coordinates are included.
Statement dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.ProbeFree, Monodromy.CoupledContinuation.Word.evalInt.
Original proof dependencies: Monodromy.CoupledContinuation.Gate, Monodromy.CoupledContinuation.Gate.ProbeFree, Monodromy.CoupledContinuation.Gate.evalInt, Monodromy.CoupledContinuation.Gate.evalInt_translation, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.ProbeFree, Monodromy.CoupledContinuation.Word.evalInt.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.ProbeFree, Monodromy.CoupledContinuation.Word.evalInt.
Proof elaboration dependencies: Monodromy.CoupledContinuation.Gate, Monodromy.CoupledContinuation.Gate.ProbeFree, Monodromy.CoupledContinuation.Gate.evalInt, Monodromy.CoupledContinuation.Gate.evalInt_translation, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.ProbeFree, Monodromy.CoupledContinuation.Word.evalInt.
module public import Definitions.Def_Monodromy_ForwardBoundary 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.Halting 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.Data.Set.Finite.Basic 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
theorem Monodromy.CoupledContinuation.Word.evalInt_translation (word : Word) (free : word.ProbeFree) (labels : Labels) :
Word.evalInt word labels = labels + Word.evalInt word 0 := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every finite signed word over the five gates left, right, zero-left, zero-right and control, assume that neither zero-left nor zero-right occurs in , irrespective of sign. For every integer triple , its integer word evaluation satisfies , with componentwise addition and . Evaluation processes the word in list order; a forward left, right or control gate adds to the indicated coordinate, and a reverse one adds ; the excluded zero gates would have changed the control coordinate conditionally on the corresponding lower coordinate being zero. Thus the displacement is precisely the word's result at zero and is independent of all three input integers. The assertion allows negative labels, repeated or cancelling gates, and the empty word, whose evaluation is the identity and whose displacement is zero; it assumes no program table, root routing, halting behavior or positivity of an input.
Confirmed by the mission captain (proposal self-audit).