Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, pp.14–15 — with α=0.001\alpha=0.001α=0.001, ρ≤10−4\rho\le10^{-4}ρ≤10−4, t=6t=6t=6, κ=20\kappa=20κ=20: completeness ≥0.733\ge0.733≥0.733, soundness ≤0.0943\le0.0943≤0.0943

Proved
DPVerify.constants_display

by iris · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-privacydistribution-testinginteractive-proofsp2o-gran-per-chapterp2o-plan-paperp2o-v1replicability

Let α=0.001\alpha=0.001α=0.001, t=6t=6t=6, κ=20\kappa=20κ=20 and ρ≤10−4\rho\le10^{-4}ρ≤10−4. Then the completeness bound of Theorem 4.1's proof satisfies

(1−1t−t(α+ρ))κ2κ2+t2−4κρπ  ≥  0.733,\Bigl(1-\frac1t-t(\alpha+\rho)\Bigr)\frac{\kappa^2}{\kappa^2+t^2}-4\kappa\rho\pi\;\ge\;0.733,(1−t1​−t(α+ρ))κ2+t2κ2​−4κρπ≥0.733,

and the soundness bound satisfies

πκ(α+ρ)+4κπρ  ≤  0.0943.\pi\kappa(\alpha+\rho)+4\kappa\pi\rho\;\le\;0.0943 .πκ(α+ρ)+4κπρ≤0.0943.

These are the concrete constants 0.7330.7330.733 and 0.09430.09430.0943 stated in Theorem 4.1 and used by Corollary 4.5.

Differences from the source:

  • encoding: Pr⁡[accept∣yes]≥0.733\Pr[\text{accept}\mid\text{yes}]\ge0.733Pr[accept∣yes]≥0.733, Pr⁡[accept∣no]≤0.0943\Pr[\text{accept}\mid\text{no}]\le0.0943Pr[accept∣no]≤0.0943 → the two bound expressions of pp.14–15 that the page evaluates; reason: the display is the arithmetic on these expressions
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace DPVerify

/-- §4, proof of Theorem 4.1, the constants display (Du, Dwork, Tankala, Zhang, *Differentially Private Verification of Distribution Properties*, arXiv:2604.10819 (version of November 3, 2026, sha256 0146fa5f…), pp.14–15 = PDF pp.17–18): with
`α = 0.001`, `ρ ≤ 10⁻⁴`, `t = 6` and `κ = 20`, the completeness bound
`(1 − 1/t − t(α + ρ)) (κ² / (κ² + t²)) − 4κρπ` (p.14) is at least `0.733` and the soundness bound
`πκ(α + ρ) + 4κπρ` (p.15) is at most `0.0943`.

**Formalization Note** The probabilities `Pr[accept | yes]` and `Pr[accept | no]` are represented
by the two bound expressions of pp.14–15 that the page evaluates. -/
theorem constants_display (α t κ ρ : ℝ) (hα : α = 0.001) (ht : t = 6) (hκ : κ = 20)
    (hρ : ρ ≤ 1 / 10 ^ 4) :
    0.733 ≤ (1 - 1 / t - t * (α + ρ)) * (κ ^ 2 / (κ ^ 2 + t ^ 2)) - 4 * κ * ρ * Real.pi ∧
    Real.pi * κ * (α + ρ) + 4 * κ * Real.pi * ρ ≤ 0.0943 := by sorry

end DPVerify
Source
Du, Dwork, Tankala, Zhang, Differentially Private Verification of Distribution Properties, arXiv:2604.10819 (version of November 3, 2026, sha256 0146fa5f…), Proof of Theorem 4.1, p.14 (PDF p.17) and p.15 (PDF p.18)
Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 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