Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.3 — a symmetric-mean (Maclaurin) inequality for a uniform s-subset

Proved
AcycTesting.NearLinear.lemma_A_3

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

directed-graphsinequalitiesp2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingquery-complexity

Let z1,…,zN≥0z_1,\dots,z_N\ge0z1​,…,zN​≥0 and let I⊆[N]I\subseteq[N]I⊆[N] be a uniformly random subset of size sss (0≤s≤N0\le s\le N0≤s≤N). Then

E∏i∈Izi ≤ (1N∑i=1Nzi)s.\mathbb E\prod_{i\in I}z_i\ \le\ \Big(\frac1N\sum_{i=1}^N z_i\Big)^{s}.Ei∈I∏​zi​ ≤ (N1​i=1∑N​zi​)s.

Equivalently es(z)≤(Ns)(1N∑izi)se_s(z)\le\binom Ns\big(\frac1N\sum_i z_i\big)^ses​(z)≤(sN​)(N1​∑i​zi​)s for the elementary symmetric polynomial ese_ses​. It gives the exponential lower tail of balanced cuts (Lemma A.4).

Differences from the source:

  • encoding: E over a uniform s-subset I ⊆ [N] → the average of ∏_{i∈I} z_i over Finset.powersetCard s (Fin N), i.e. the sum divided by choose N s, with s ≤ N; reason: a uniform s-subset exists exactly when s ≤ N; Fin N for [N]
Preamble
import Mathlib
Formal statement
namespace AcycTesting.NearLinear

/-- Lemma A.3 (a symmetric-mean inequality): for `z₁, …, z_N ≥ 0` and a uniform `s`-subset
`I ⊆ [N]`, `E ∏_{i ∈ I} z_i ≤ ((1/N) ∑_i z_i)^s`. -/
theorem lemma_A_3 (N s : ℕ) (hs : s ≤ N) (z : Fin N → ℝ) (hz : ∀ i, 0 ≤ z i) :
    (∑ I ∈ (Finset.univ : Finset (Fin N)).powersetCard s, ∏ i ∈ I, z i) / (N.choose s : ℝ) ≤
      ((1 / (N : ℝ)) * ∑ i, z i) ^ s := by sorry

end AcycTesting.NearLinear
Source
Czumaj, Peng, Wang, Near-Linear Lower Bounds for Testing Directed Acyclicity, arXiv:2611.04901v1 (sha256 5685fc7b…), p. 39 (PDF 42), Lemma A.3
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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