Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Thm A.4, p. A:42 — Π\PiΠ is decidable

Proved
ObfImpossibility.RiceNoSize.Pi_decidable

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

computabilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1promise-problemsrice-theorem

The promise problem Π=(ΠY,ΠN)\Pi=(\Pi_Y,\Pi_N)Π=(ΠY​,ΠN​) of the proof of Theorem A.4 is decidable: there is a program TTT, run on canonical descriptions ⌜M⌝\ulcorner M\urcorner┌M┐ of machines, such that

M∈ΠY⇒T(⌜M⌝)=1,M∈ΠN⇒T(⌜M⌝)=0.M\in\Pi_Y\Rightarrow T(\ulcorner M\urcorner)=1,\qquad M\in\Pi_N\Rightarrow T(\ulcorner M\urcorner)=0.M∈ΠY​⇒T(┌M┐)=1,M∈ΠN​⇒T(┌M┐)=0.

Outside ΠY∪ΠN\Pi_Y\cup\Pi_NΠY​∪ΠN​ nothing is required of TTT; it may diverge.

This is the second property that makes Π\PiΠ an instance of the hypothesis of Conjecture A.3. The paper's TTT runs MMM on every input x<∣M∣x<|M|x<∣M∣ and outputs 111 exactly when some answer is non-zero.

Formalization Note TTT is a Mathlib Nat.Partrec.Code applied to the natural-number description of MMM, so decidability means decidability by a partial recursive function.

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

/-- p. A:42: the promise problem `Π = (Π_Y, Π_N)` of the proof of Theorem A.4 is decidable:
some program `T`, run on descriptions `⌜M⌝`, outputs `1` on `Π_Y` and `0` on `Π_N`. -/
theorem Pi_decidable : ∃ T : Nat.Partrec.Code, Decides T PiY PiN := 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, proof of Theorem A.4 ("We claim that Π is decidable.")
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