Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Deleting Both Conditional Gates Strictly Reduces Fixed-Interface Realizability

Proved
Monodromy.Structure.conditional_gates_strictly_extend

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

There exists a partial function f:ℕ→Part ℕ realized by some positive-degree native Program under the fixed inputLabels/outputLabels interface, but realized by no positive-degree program whose every table word contains neither zeroLeft nor zeroRight in either direction. Arbitrary finite routing, stopping bits and the remaining signed gates are still allowed in the restricted language.

Statement dependencies: Monodromy.Structure.ProbeFreeRealizable, Monodromy.Structure.Realizable.

Original proof dependencies: Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.ProbeFree, Monodromy.ForwardBoundary.hardFunction, Monodromy.ForwardBoundary.hardFunction_partrec, Monodromy.Structure.Computes, Monodromy.Structure.ProbeFreeRealizable, Monodromy.Structure.Realizable, Monodromy.Structure.no_probeFree_hardFunction, Monodromy.Structure.realizable_of_partrec.

Statement elaboration dependencies: Monodromy.Structure.ProbeFreeRealizable, Monodromy.Structure.Realizable.

Proof elaboration dependencies: Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.ProbeFree, Monodromy.ForwardBoundary.hardFunction, Monodromy.ForwardBoundary.hardFunction_partrec, Monodromy.Structure.Computes, Monodromy.Structure.ProbeFreeRealizable, Monodromy.Structure.Realizable, Monodromy.Structure.no_probeFree_hardFunction, Monodromy.Structure.realizable_of_partrec.

Preamble
module
public import Definitions.Def_Monodromy_Structure
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

open Monodromy
open Monodromy.Structure
open CoupledContinuation NativeInterface

Formal statement
theorem Monodromy.Structure.conditional_gates_strictly_extend :
    ∃ function : ℕ → Part ℕ, Realizable function ∧ ¬ ProbeFreeRealizable function := by sorry
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/Structure.lean (file SHA-256 cdcfb6852947e60cdaf4cef38f43a83b8651973b4e92feec928b6408b60b877e): Monodromy.Structure.conditional_gates_strictly_extend at L107-L113 [UTF-8 4968:5410].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

Write τ=2πi\tau=2\pi iτ=2πi. The memory space M\mathcal MM consists of triples (zL,zR,w)∈(C∗)2×C(z_L,z_R,w)\in(\mathbb C^*)^2\times\mathbb C(zL​,zR​,w)∈(C∗)2×C with ezL=ezR=ee^{z_L}=e^{z_R}=eezL​=ezR​=e and ew=zLzRe^w=z_Lz_Rew=zL​zR​; the integer-labelled point Φ(l,r,c)\Phi(l,r,c)Φ(l,r,c) is (1+τl,1+τr,log⁡(1+τl)+log⁡(1+τr)+τc)(1+\tau l,1+\tau r,\log(1+\tau l)+\log(1+\tau r)+\tau c)(1+τl,1+τr,log(1+τl)+log(1+τr)+τc) with principal complex logarithms. A native program of positive degree ddd consists of ddd finite words and ddd 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 t↦e1+2πitt\mapsto e^{1+2\pi it}t↦e1+2πit or t↦exp⁡(e2πit)t\mapsto\exp(e^{2\pi it})t↦exp(e2πit), or the control coordinate along t↦e2πitt\mapsto e^{2\pi it}t↦e2πit; unmentioned coordinates are constant. A driver acts by lower exponential lifts starting at zL,zRz_L,z_RzL​,zR​, followed by an upper exponential lift starting at www 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 rd=exp⁡((w−log⁡zL−log⁡zR)/d)r_d=\exp((w-\log z_L-\log z_R)/d)rd​=exp((w−logzL​−logzR​)/d) and selects values at the roots ωj=e2πij/d\omega_j=e^{2\pi ij/d}ωj​=e2πij/d by ∑jKd(ωj,rd)vj\sum_j K_d(\omega_j,r_d)v_j∑j​Kd​(ωj​,rd​)vj​, with Kd(r,z)K_d(r,z)Kd​(r,z) the divided slope of z↦zdz\mapsto z^dz↦zd at (r,z)(r,z)(r,z) divided by its derivative at rrr (the divided slope at z=rz=rz=r is the derivative). Advance executes the routed word; the halt signal selects 111 for true stop flags and 000 otherwise. The optional step is absent exactly when this signal is 111, 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 bit0,bit1,cons,consL\mathrm{bit0},\mathrm{bit1},\mathrm{cons},\mathrm{cons}_{L}bit0,bit1,cons,consL​ 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 cons\mathrm{cons}cons 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 {0,…,A−1}\{0,\ldots,A-1\}{0,…,A−1} taking blank to 000, where AAA is its cardinality, and let W(n)W(n)W(n) be this numeric word for the singleton list [n][n][n]. Put r(n)=∑i(W(n).tail)i(A+1)ir(n)=\sum_i(W(n).\mathrm{tail})_i(A+1)^ir(n)=∑i​(W(n).tail)i​(A+1)i and in(n)=(3r(n),0,3 W(n).head)∈Z3\mathrm{in}(n)=(3^{r(n)},0,3\,W(n).\mathrm{head})\in\mathbb Z^3in(n)=(3r(n),0,3W(n).head)∈Z3, using a default-zero head for an empty word. To read an alphabet letter from an accumulator vvv, use 2v2v2v for main-track bit0\mathrm{bit0}bit0, 2v+12v+12v+1 for main-track bit1\mathrm{bit1}bit1, and vvv otherwise, ignoring the marker and other tracks. For any integer label triple (l,r,c)(l,r,c)(l,r,c), let N=max⁡(l,0)N=\max(l,0)N=max(l,0) and kkk be the greatest j≤Nj\le Nj≤N with 3j∣N3^j\mid N3j∣N (so k=0k=0k=0 if N=0N=0N=0). The output out(l,r,c)\mathrm{out}(l,r,c)out(l,r,c) starts with (k,0)(k,0)(k,0) and performs exactly kkk iterations of taking the first component modulo A+1A+1A+1, dividing that component by A+1A+1A+1, and applying the corresponding letter-read operation to the accumulator; the unused residue AAA is interpreted as blank 000, and the final accumulator is the output. Thus this total readout ignores the right and control labels, and negative left labels give output 000. There exists a partial function f:N→Part(N)f:\mathbb N\to\mathrm{Part}(\mathbb N)f:N→Part(N) for which there are a natural kkk and a native program of degree k+1k+1k+1 such that, for every n,v∈Nn,v\in\mathbb Nn,v∈N, f(n)f(n)f(n) is defined with value vvv if and only if the program's partial evaluation from Φ(in(n))\Phi(\mathrm{in}(n))Φ(in(n)) returns Φ(ℓ)\Phi(\ell)Φ(ℓ) for some integer triple ℓ\ellℓ with out(ℓ)=v\mathrm{out}(\ell)=vout(ℓ)=v, but there do not exist any natural kkk and any degree-(k+1)(k+1)(k+1) program satisfying that same graph condition whose every word contains only left shifts, right shifts and control shifts. The prohibited words may contain neither zero-probe gate, in either direction; empty words are allowed, and no single program or particular witnessing partial function is named by this existence assertion.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me