Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

End of App. B, p. A:45 — the set G\mathcal GG of GGG violating (7) has density smaller than K−δK^{-\delta}K−δ

Proved
ObfImpossibility.PseudoOracle.density_bound

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pseudorandomnessquery-complexity

There is δ0>0\delta_0>0δ0​>0 such that for every 0<δ≤δ00<\delta\le\delta_00<δ≤δ0​ there is K0K_0K0​ with the following property. For all K≥K0K\ge K_0K≥K0​ and L≥K2L\ge K^2L≥K2 and every distinguisher DDD making at most KδK^\deltaKδ oracle queries, let G\mathcal GG be the set of injective G:[K]→[L]G:[K]\to[L]G:[K]→[L] with

∣Pr⁡x∈[K][DG(G(x))=1]−Pr⁡y∈[L][DG(y)=1]∣>1Kδ.\Big|\Pr_{x\in[K]}\big[D^G(G(x))=1\big]-\Pr_{y\in[L]}\big[D^G(y)=1\big]\Big|>\frac1{K^\delta}.​x∈[K]Pr​[DG(G(x))=1]−y∈[L]Pr​[DG(y)=1]​>Kδ1​.

Then the fraction of injective functions [K]→[L][K]\to[L][K]→[L] that lie in G\mathcal GG is smaller than K−δK^{-\delta}K−δ.

This is the sentence that closes Appendix B. It is weaker than Lemma B.1, which bounds the same fraction by 2−Kδ2^{-K^\delta}2−Kδ; the counting bound of Claim B.1.2 supports the stronger conclusion once 1−7δ>δ1-7\delta>\delta1−7δ>δ.

Formalization Note The fraction is ∣G∣|\mathcal G|∣G∣ divided by the number of embeddings Fin K ↪ Fin L. The existence of δ0\delta_0δ0​ renders the paper's "sufficiently small δ\deltaδ".

Preamble
import Mathlib
import Definitions.Def_ObfImpossibility_PseudoOracle_Setting
Formal statement
namespace ObfImpossibility.PseudoOracle

/-- The density bound, p. A:45: for every sufficiently small `δ > 0`, for all large `K`,
all `L ≥ K²` and every `D` making at most `K^δ` queries, the set `𝒢` of injective
`G : [K] → [L]` violating (7) has density smaller than `K^{-δ}`. -/
theorem density_bound :
    ∃ δ₀ : ℝ, 0 < δ₀ ∧ ∀ δ : ℝ, 0 < δ → δ ≤ δ₀ → ∃ K₀ : ℕ, ∀ K L : ℕ, K₀ ≤ K → K ^ 2 ≤ L →
      ∀ D : Fin L → QTree K L, (∀ y, ((D y).depth : ℝ) ≤ (K : ℝ) ^ δ) →
        ((Finset.univ.filter fun G : Fin K ↪ Fin L =>
            1 / (K : ℝ) ^ δ < |prX D G - prY D G|).card : ℝ) /
          (Fintype.card (Fin K ↪ Fin L) : ℝ) < (K : ℝ) ^ (-δ) := by sorry

end ObfImpossibility.PseudoOracle
Source
Barak et al., On the (Im)possibility of Obfuscating Programs, J. ACM 59(2) (2012), author's copy, p. A:45, Appendix B, last paragraph (density of 𝒢)
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