Fixed-Interface Computational Class and Analytic Comparison
DefinitionMonodromy_StructureDefines Computes, Realizable and ProbeFreeRealizable using the fixed native numeric input/output maps. Characterizes the entire positive-degree Program language as exactly the partial-recursive unary functions, proves strict separation after deleting both conditional gates, and equates each native numeric graph with its specified direct analytic comparator.
-- Generated by Lean-fact skeleton subtraction; original source is frozen in imports/monodromy/source.
module
public import Definitions.Def_Monodromy_ForwardBoundary
public import Definitions.Def_Monodromy_NativeIO
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.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.Int.ModEq
public import Mathlib.Data.Nat.Digits.Lemmas
public import Mathlib.Data.Nat.Factorization.Basic
public import Mathlib.Data.Set.Finite.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
/-!
# The computational class of native continuation
Finite words of the five geometric loops, with internal finite-root routing,
realize exactly the partial recursive functions under one fixed numeric
interface. Removing the two zero-conditional loops leaves a finite stopping
quotient and strictly reduces this class.
-/
@[expose] public section
namespace Monodromy.Structure
open CoupledContinuation NativeInterface
/-- The fixed numeric graph is read directly from actual native execution. -/
def Computes {degree : ℕ} [NeZero degree] (native : Program degree)
(function : ℕ → Part ℕ) : Prop :=
∀ input value, value ∈ function input ↔ ∃ labels : Labels,
Labels.prepare labels ∈ native.eval (Labels.prepare (inputLabels input)) ∧
outputLabels labels = value
/-- Positive cover degrees are indexed by their predecessor. -/
def Realizable (function : ℕ → Part ℕ) : Prop :=
∃ degree : ℕ, ∃ native : Program (degree + 1), Computes native function
/-- The same interface defines the sublanguage with both conditional loops removed. -/
def ProbeFreeRealizable (function : ℕ → Part ℕ) : Prop :=
∃ degree : ℕ, ∃ native : Program (degree + 1), native.ProbeFree ∧ Computes native function
end Monodromy.Structure
namespace Monodromy.Structure
open CoupledContinuation NativeInterface
end Monodromy.Structure
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Write . The memory space consists of triples with and ; the integer-labelled point is with principal complex logarithms. A native program of positive degree consists of finite words and Boolean stop flags. Letters are left shift, right shift, left zero probe, right zero probe and control shift, with forward/reverse flags. The respective drivers move one lower base coordinate along or , or the control coordinate along ; unmentioned coordinates are constant. A driver acts by lower exponential lifts starting at , followed by an upper exponential lift starting at over the product of the lower lifts and the control path, and takes the endpoint. Words concatenate these drivers in list order, reversing paths for reversed letters; the empty word is idle. Routing observes and selects values at the roots by , with the divided slope of at divided by its derivative at (the divided slope at is the derivative). Advance executes the routed word; the halt signal selects for true stop flags and otherwise. The optional step is absent exactly when this signal is , and is advance otherwise. Partial evaluation repeatedly takes present steps and returns the first state with absent step; it is undefined if there is no such finite stopping time. The fixed numeric interface uses the four symbols and four tracks main, reverse, auxiliary and stack; its alphabet is a Boolean marker paired with an optional symbol on each track, blank meaning false marker and all tracks empty. To encode a list of naturals, encode each number in binary least-significant-bit first (zero as an empty bit list), append after each number, reverse the resulting symbol list, put its symbols on the main track alone, and set the first letter's marker true (an empty list gives one marked blank). Choose the specified finite alphabet bijection to taking blank to , where is its cardinality, and let be this numeric word for the singleton list . Put and , using a default-zero head for an empty word. To read an alphabet letter from an accumulator , use for main-track , for main-track , and otherwise, ignoring the marker and other tracks. For any integer label triple , let and be the greatest with (so if ). The output starts with and performs exactly iterations of taking the first component modulo , dividing that component by , and applying the corresponding letter-read operation to the accumulator; the unused residue is interpreted as blank , and the final accumulator is the output. Thus this total readout ignores the right and control labels, and negative left labels give output . For any positive natural degree , any degree- program , and any partial function , Computes means exactly that for all natural , membership of in the partial value is equivalent to existence of an integer triple with in the partial result of native complete evaluation from and . Membership means the partial computation is defined with precisely that result, and native complete evaluation returns its first state with absent successor, being undefined if no such state occurs. Realizable means that there exist a natural and a program of degree satisfying Computes, while ProbeFreeRealizable additionally requires each row word to contain no left-zero or right-zero probe, irrespective of their reversal flags; left/right shifts, control turns and empty words remain allowed. The predecessor parameter permits every positive degree, including , and excludes degree ; the definitions quantify over all natural inputs and outputs, all integer triples (including negative coordinates), and all partial functions, including those nowhere defined. No partial-recursiveness assertion is included in these three definitions.
Confirmed by the mission captain (proposal self-audit).