Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Proposition 2: Ωn(2,β;γ)<0\Omega_n(2,\beta;\gamma)<0Ωn​(2,β;γ)<0

Proved
FarmerInfoProvision.proposition_2_proof_omegaN_at_two

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

agricultural-supply-chainsbayesian-nash-equilibriumcournot-competitiongaussian-signalsinformation-provision

For n≥3n\ge3n≥3, α,β>0\alpha,\beta>0α,β>0 and γ≥0\gamma\ge0γ≥0,

Ωn(2,β;γ)=−4β{16α4+8α3(4β+(1+4n)γ)+γ2(2(−3+n)β2+(−9+7n)βγ+2(−1+2n)γ2)+4α2(4β2+(3+8n)βγ+3(−1+4n)γ2)+2αγ(2β2+(−10+15n)βγ+(−5+12n)γ2)},\begin{aligned} \Omega_n(2,\beta;\gamma)=-4\beta\Bigl\{&16\alpha^4+8\alpha^3\bigl(4\beta+(1+4n)\gamma\bigr)+\gamma^2\bigl(2(-3+n)\beta^2+(-9+7n)\beta\gamma+2(-1+2n)\gamma^2\bigr)\\ &+4\alpha^2\bigl(4\beta^2+(3+8n)\beta\gamma+3(-1+4n)\gamma^2\bigr)+2\alpha\gamma\bigl(2\beta^2+(-10+15n)\beta\gamma+(-5+12n)\gamma^2\bigr)\Bigr\}, \end{aligned}Ωn​(2,β;γ)=−4β{​16α4+8α3(4β+(1+4n)γ)+γ2(2(−3+n)β2+(−9+7n)βγ+2(−1+2n)γ2)+4α2(4β2+(3+8n)βγ+3(−1+4n)γ2)+2αγ(2β2+(−10+15n)βγ+(−5+12n)γ2)},​

and this number is negative.

Since Ωn\Omega_nΩn​ is decreasing in n1n_1n1​, the welfare is strictly decreasing for n1≥2n_1\ge2n1​≥2: informing more than two farmers is never optimal.

Differences from the source:

  • generalization: standing assumption n ≥ 4 farmers (p. 8) → 3 ≤ n; reason: the sentence itself states the claim 'as long as n ≥ 3'; the statement specializes to every n ≥ 4
Preamble
import Mathlib
import Definitions.Def_FarmerInfoProvision_OmegaN
Formal statement
namespace FarmerInfoProvision

/-- **Proof of Proposition 2: `Ω_n(2, β; γ) < 0`.**
Zhou, Fan, Chen, Tang, *Information Provision and Farmer Welfare in Developing Economies*,
SSRN 3369334 (June 27, 2019), Appendix A, proof of Proposition 2, unnumbered display, p. 36:
"while evaluating `Ω_n(n1, β; γ)` at `n1 = 2`, `Ω_n(2, β; γ) = −4β{16α⁴ + 8α³(4β + (1 + 4n)γ)
+ γ²(2(−3 + n)β² + (−9 + 7n)βγ + 2(−1 + 2n)γ²) + 4α²(4β² + (3 + 8n)βγ + 3(−1 + 4n)γ²)
+ 2αγ(2β² + (−10 + 15n)βγ + (−5 + 12n)γ²)}`, which is necessarily negative (as long as
`n ≥ 3`)."

For `n ≥ 3` farmers, `α, β > 0` and `γ ≥ 0`, `Ω_n(2, β; γ)` equals the printed expression and
is negative.

**Formalization Note.** The hypothesis `n ≥ 3` is the one printed in this sentence; the
paper's standing assumption is `n ≥ 4`. -/
theorem proposition_2_proof_omegaN_at_two {n : ℕ} (hn : 3 ≤ n) {α β γ : ℝ}
    (hα : 0 < α) (hβ : 0 < β) (hγ : 0 ≤ γ) :
    OmegaN (n : ℝ) 2 α β γ =
      -4 * β * (16 * α ^ 4 + 8 * α ^ 3 * (4 * β + (1 + 4 * (n : ℝ)) * γ) +
        γ ^ 2 * (2 * (-3 + (n : ℝ)) * β ^ 2 + (-9 + 7 * (n : ℝ)) * β * γ +
          2 * (-1 + 2 * (n : ℝ)) * γ ^ 2) +
        4 * α ^ 2 * (4 * β ^ 2 + (3 + 8 * (n : ℝ)) * β * γ + 3 * (-1 + 4 * (n : ℝ)) * γ ^ 2) +
        2 * α * γ * (2 * β ^ 2 + (-10 + 15 * (n : ℝ)) * β * γ +
          (-5 + 12 * (n : ℝ)) * γ ^ 2)) ∧
    OmegaN (n : ℝ) 2 α β γ < 0 := by sorry

end FarmerInfoProvision
Source
Zhou, Fan, Chen, Tang, Information Provision and Farmer Welfare in Developing Economies, SSRN 3369334 (June 27, 2019), Appendix A, proof of Proposition 2, unnumbered display, p. 36

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me