Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Thm A.4, p. A:42 — KC([M])≤∣M∣\mathrm{KC}([M])\le|M|KC([M])≤∣M∣

Proved
ObfImpossibility.RiceNoSize.KC_le_size

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

computabilitykolmogorov-complexityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

For every machine MMM, the size of the smallest machine computing the same function as MMM is at most the size of MMM:

KC([M])≤∣M∣.\mathrm{KC}([M])\le |M|.KC([M])≤∣M∣.

The proof of Theorem A.4 uses this inequality to show that the decider TTT, which only tries the inputs x<∣M∣x<|M|x<∣M∣, finds the input x<KC([M])x<\mathrm{KC}([M])x<KC([M]) witnessing M∈ΠYM\in\Pi_YM∈ΠY​.

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

/-- p. A:42: `KC([M]) ≤ |M|` for every machine `M`. -/
theorem KC_le_size (M : Machine) : KC (fn M) ≤ size M := 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 ("x < KC([M]) ≤ |M|")
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