Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: unique optimal intensity under cap-and-trade

Proved
CarbonPolicy.TaxVsCap.lemma_2

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

cap-and-tradecarbon-taxcorrelated-uncertaintyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1technology-investment

Under Assumption 1 and the standing conditions, the unique optimal emission intensity under cap-and-trade is

γC∗={4bβγ+−aˉkˉ−ρσDσ4bβ−kˉ2−σ2,aˉkˉ+ρσDσ>(kˉ2+σ2)γ+,γ+,aˉkˉ+ρσDσ≤(kˉ2+σ2)γ+.\gamma_C^*=\begin{cases}\dfrac{4b\beta\gamma^+-\bar a\bar k-\rho\sigma_D\sigma}{4b\beta-\bar k^2-\sigma^2},&\bar a\bar k+\rho\sigma_D\sigma>(\bar k^2+\sigma^2)\gamma^+,\\\gamma^+,&\bar a\bar k+\rho\sigma_D\sigma\le(\bar k^2+\sigma^2)\gamma^+.\end{cases}γC∗​=⎩⎨⎧​4bβ−kˉ2−σ24bβγ+−aˉkˉ−ρσD​σ​,γ+,​aˉkˉ+ρσD​σ>(kˉ2+σ2)γ+,aˉkˉ+ρσD​σ≤(kˉ2+σ2)γ+.​

The second branch is the boundary solution to the first-stage cap-and-trade problem on [0,γ+][0,\gamma^+][0,γ+].

Formalization Note The theorem states both existence and uniqueness of the maximizing intensity.

Preamble
import Mathlib
import Definitions.Def_CarbonPolicy_TaxVsCap_Setting

open ProbabilityTheory MeasureTheory
Formal statement
namespace CarbonPolicy.TaxVsCap

theorem lemma_2 {Ω : Type} [MeasurableSpace Ω] (M : Model Ω)
    (b β γp w : ℝ) (hb : 0 < b) (hγp : 0 < γp)
    (hA : Assumption1 M b β γp) :
    OptimalCap M b β γp w (gammaC0 b β γp (abar M.P M.a) (kbar M.P M.k) (sigmaD M.P M.a) (sigma M.P M.k) (rho M.P M.a M.k)) ∧
    ∀ γ : ℝ, OptimalCap M b β γp w γ → γ = gammaC0 b β γp (abar M.P M.a) (kbar M.P M.k) (sigmaD M.P M.a) (sigma M.P M.k) (rho M.P M.a M.k) := by sorry

end CarbonPolicy.TaxVsCap
Source
Fan, Chen, Chen, Is Price Commitment a Better Solution to Control Carbon Emissions and Promote Technology Investment?, SSRN 3817235 (version of November 15, 2021), p. 12, Lemma 2 and equation (5)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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