The finite Turing configuration encoding is injective
ProvedMonodromy.Counter.TuringCompiler.encode_injectiveFor every positive alphabet size a and arbitrary natural state count q, the three-counter encoding of a TM0 configuration is injective. It stores the machine state and current tape symbol in the dispatch address, the left and right blank-tailed tape codes in counters 0 and 1 using base a+1, and 0 in the scratch counter. No nonzero assumption on q is required.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.TuringCompiler.encode, Monodromy.Counter.TuringCompiler.size.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.TuringCompiler.Row, Monodromy.Counter.TuringCompiler.dispatch_injective, Monodromy.Counter.TuringCompiler.encode, Monodromy.Counter.TuringCompiler.size, Monodromy.TapeCode.encode, Monodromy.TapeCode.encode_injective.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.TuringCompiler.encode, Monodromy.Counter.TuringCompiler.size.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.TuringCompiler.Row, Monodromy.Counter.TuringCompiler.dispatch_injective, Monodromy.Counter.TuringCompiler.encode, Monodromy.Counter.TuringCompiler.size, Monodromy.TapeCode.encode, Monodromy.TapeCode.encode_injective.
module public import Definitions.Def_Monodromy_Counter 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.Data.Fin.Basic public import Mathlib.Data.Fintype.Card public import Mathlib.Data.Fintype.EquivFin 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.Counter open Monodromy.Counter.TuringCompiler open Turing variable (a q : ℕ) [NeZero a] [NeZero q] omit [NeZero q]
theorem Monodromy.Counter.TuringCompiler.encode_injective : Function.Injective (encode a q) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural number and every natural number , the following map is injective on all configurations of the Turing model with alphabet , blank symbol , and controls . A configuration consists of its control , scanned symbol , and two half-tapes that are finite lists modulo adjoining trailing blanks. Encode each half-tape with digits by the natural number , put the left and right codes in registers and , put in register , and use the dispatch control tagged by in the finite control set , identified with its cardinality by a fixed finite enumeration. Equality of these encoded configurations implies equality of the complete original configurations, including both blank-padded half-tapes. There is no nonzero assumption on in this declaration: at there are no source configurations and injectivity is vacuous. The case , in which every tape cell is blank, is included.
Confirmed by the mission captain (proposal self-audit).