Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.4 — Conjecture A.3 is false: without 1∣M∣1^{|M|}1∣M∣ a simulator with oracle ⟨M⟩\langle M\rangle⟨M⟩ cannot decide every decidable Π\PiΠ closed under [⋅][\cdot][⋅]

Proved
ObfImpossibility.RiceNoSize.theorem_A_4

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilityoracle-machinesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1promise-problemsrice-theorem

Theorem A.4. Conjecture A.3 is false. That is, there is a promise problem Π=(ΠY,ΠN)\Pi=(\Pi_Y,\Pi_N)Π=(ΠY​,ΠN​) — a pair of disjoint sets of Turing machines — that is closed under [⋅][\cdot][⋅] and decidable, such that no oracle machine SSS satisfies

M∈ΠY⇒S⟨M⟩()=1,M∈ΠN⇒S⟨M⟩()=0,M\in\Pi_Y\Rightarrow S^{\langle M\rangle}()=1,\qquad M\in\Pi_N\Rightarrow S^{\langle M\rangle}()=0,M∈ΠY​⇒S⟨M⟩()=1,M∈ΠN​⇒S⟨M⟩()=0,

where S⟨M⟩()S^{\langle M\rangle}()S⟨M⟩() is the output of SSS given oracle access to the step-bounded function ⟨M⟩(1t,x)\langle M\rangle(1^t,x)⟨M⟩(1t,x) and nothing else.

Theorem A.2 shows that such an SSS exists when it is also given 1∣M∣1^{|M|}1∣M∣; Theorem A.4 shows that this extra input cannot be dropped, so the computability analogue of the virtual-black-box simulator needs an upper bound on the size of the program.

Formalization Note Machines are step-counted one-tape Turing machines with unary inputs, ∣M∣|M|∣M∣ is the number of states, and oracle machines are uniform oracle programs run on the fixed input 000 (see the setting file).

Preamble
import Mathlib
import Definitions.Def_ObfImpossibility_RiceNoSize_ProofObjects
Formal statement
namespace ObfImpossibility.RiceNoSize

/-- Theorem A.4 (p. A:42): Conjecture A.3 is false. -/
theorem theorem_A_4 : ¬ ConjectureA3 := by sorry

end ObfImpossibility.RiceNoSize
Source
Barak et al., On the (Im)possibility of Obfuscating Programs, J. ACM 59(2) (2012), author's copy, p. A:42, Theorem A.4
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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