Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(a): investment comparison at R0R_0R0​

Proved
CarbonPolicy.TaxVsCap.proposition_1a

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

Let γT∗\gamma_T^*γT∗​ and γC∗\gamma_C^*γC∗​ be arbitrary maximizing emission intensities under the two policies. With R0=(σ/σD)γT∗R_0=(\sigma/\sigma_D)\gamma_T^*R0​=(σ/σD​)γT∗​, the firm invests more in clean technology under the tax precisely when the correlation is below R0R_0R0​:

γT∗<γC∗⟺ρ<R0.\gamma_T^*<\gamma_C^*\quad\Longleftrightarrow\quad\rho<R_0.γT∗​<γC∗​⟺ρ<R0​.

Lower emission intensity means greater clean-technology investment. The threshold uses the closed-form tax maximizer from Lemma 1, while the comparison quantifies over arbitrary maximizers.

Preamble
import Mathlib
import Definitions.Def_CarbonPolicy_TaxVsCap_Setting

open ProbabilityTheory MeasureTheory
Formal statement
namespace CarbonPolicy.TaxVsCap

theorem proposition_1a {Ω : Type} [MeasurableSpace Ω] (M : Model Ω)
    (b β γp w : ℝ) (hb : 0 < b) (hγp : 0 < γp)
    (hA : Assumption1 M b β γp)
    (γT γC : ℝ) (hT : OptimalTax M b β γp w γT)
    (hC : OptimalCap M b β γp w γC) :
    γT < γC ↔ rho M.P M.a M.k < R0 b β γp (abar M.P M.a) (kbar M.P M.k) (sigmaD M.P M.a) (sigma M.P 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. 15, Proposition 1(a)
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