Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1 — Levin work investment (corrected: k ≥ 2)

Proved
PauliMixedness.Randomized.levin_work_investment

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityquantum-information

Let k≥2k\ge2k≥2 be an integer, XXX uniform on a set of size kkk, f≥0f\ge0f≥0 any real function on that set, and μ∈R\mu\in\mathbb Rμ∈R with Ef(X)≥μ\mathbb E f(X)\ge\muEf(X)≥μ. Set M=⌈log⁡3k⌉M=\lceil\log_3 k\rceilM=⌈log3​k⌉. Then

∃i∈{1,…,M}:Pr⁡[f(X)≥3i−2μ]≥3−iM.\exists i\in\{1,\ldots,M\}:\quad\Pr[f(X)\ge3^{i-2}\mu]\ge\frac{3^{-i}}M.∃i∈{1,…,M}:Pr[f(X)≥3i−2μ]≥M3−i​.

Nonpositive μ\muμ is included. The finite uniform expectation and tail probability are the corresponding sum and count divided by kkk. This work-investment statement supports the Pauli influence lemma at support size 3N3^N3N.

Differences from the source:

  • correction: no exclusion of k=1k=1k=1 → k≥2k\ge2k≥2; reason: at k=1, f(1)=μ=1 satisfies every printed premise but M=0 leaves no possible index; the application k=3^N≥3 is unaffected
  • encoding: [k][k][k], base-three logarithm and uniform probability → Fin⁡k\operatorname{Fin}kFink, ln⁡k/ln⁡3\ln k/\ln3lnk/ln3 and finite counts divided by k; reason: reindexing preserves all values; signed real powers retain i−2 exactly when i=1
Preamble
import Mathlib

open scoped BigOperators
Formal statement
namespace PauliMixedness.Randomized

/-- Lemma A.1 p.24 (corrected: k ≥ 2). At k=1, f=1 and μ=1 the printed
premises hold but the index set [ceil(log₃1)] is empty. μ may be nonpositive. -/
theorem levin_work_investment (k : ℕ) (hk : 2 ≤ k) (f : Fin k → ℝ) (μ : ℝ)
    (hf : ∀ x, 0 ≤ f x) (hmean : μ ≤ (∑ x : Fin k, f x) / k) :
    ∃ i : ℕ, 1 ≤ i ∧ i ≤ ⌈Real.log (k : ℝ) / Real.log 3⌉₊ ∧
      (3 : ℝ) ^ (-(i : ℤ)) / (⌈Real.log (k : ℝ) / Real.log 3⌉₊ : ℝ) ≤
        ((Finset.univ.filter (fun x => (3 : ℝ)^((i : ℤ) - 2) * μ ≤ f x)).card : ℝ) /
          (k : ℝ) := by sorry

end PauliMixedness.Randomized
Source
Abhilash Dharmavarapu, Jayadev Acharya, Nengkun Yu, Yuhan Liu, STOC 2027 submission #231 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/231.pdf, Lemma A.1 p.24
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

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