A live configuration advances to a nonzero phase
ProvedMonodromy.CounterContinuation.advance_live_phaseFor every positive m, two-counter program P with m addresses, and configuration s whose instruction is not halt, the total native advance from encode(s) is one of prepare(s.counter₀,s.counter₁,3·s.pc+1) and prepare(s.counter₀,s.counter₁,3·s.pc+2). This disjunction preserves both source counter values and does not choose between the two phases.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.prepare.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.CounterContinuation.advance_dec_first, Monodromy.CounterContinuation.advance_inc_first, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.prepare.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.prepare.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.CounterContinuation.advance_dec_first, Monodromy.CounterContinuation.advance_inc_first, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.prepare.
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.CounterContinuation
open CoupledContinuation
variable {m : ℕ} [NeZero m]
theorem Monodromy.CounterContinuation.advance_live_phase (program : Counter.Program 2 m) (state : Counter.Configuration 2 m)
(live : program state.pc ≠ .halt) :
(compile program).advance (encode state) =
prepare (state.counters 0 : ℤ) (state.counters 1 : ℤ) (label state.pc 1) ∨
(compile program).advance (encode state) =
prepare (state.counters 0 : ℤ) (state.counters 1 : ℤ) (label state.pc 2) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For each positive natural number , every two-counter natural-number program with labels, and every configuration such that is not halt, one total geometric advance of the compiled -entry word table from its encoding is equal either to or to . Here are cast to integers, , is the retained memory point in the fiber over of , and the encoding is . The compiled table uses phases for each source label; total advance selects the entry from the th root and executes its geometric word. An increment has a phase-zero word consisting of one control loop; a decrement has that loop followed by its register's zero-conditional loop. The conclusion is an inclusive disjunction, with no assertion selecting which alternative holds, and imposes no positivity on either counter and no condition on later execution.
Confirmed by the mission captain (proposal self-audit).