Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 (first statement), p. 6 — if λ′ = 0 and u′ > 0, then R*_fc < R*_uc

Proved
AccelScal.FCMonopoly.corollary_1

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

comparative-staticsfinancial-constraintsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1r-and-dunderinvestment

Let the project technology (A,β,η,γ)(A,\beta,\eta,\gamma)(A,β,η,γ) satisfy the standing assumptions, let r>0r>0r>0 be the discount rate, and let the FC firm's AIP cash flow have drift μ∈R\mu\in\mathbb Rμ∈R, volatility σ>0\sigma>0σ>0 and level X≥1X\ge1X≥1 at the project's arrival. Suppose the project is not accelerable (γ=0\gamma=0γ=0, i.e. λ′=0\lambda'=0λ′=0) but scalable (β>0\beta>0β>0, i.e. u′>0u'>0u′>0), and that Aβη>1A\beta\eta>1Aβη>1.

Let Ruc∗R^*_{uc}Ruc∗​ be the set of maximizers of VucV_{uc}Vuc​ of (5) over [1,Rˉ][1,\bar R][1,Rˉ] and Rfc∗R^*_{fc}Rfc∗​ the set of maximizers of VfcV_{fc}Vfc​ of (6) over [1,min⁡{Rˉ,X}][1,\min\{\bar R,X\}][1,min{Rˉ,X}]. Then both sets are nonempty, and every FC optimum lies strictly below every UC optimum:

x<yfor all x∈Rfc∗, y∈Ruc∗.x<y\qquad\text{for all } x\in R^*_{fc},\ y\in R^*_{uc}.x<yfor all x∈Rfc∗​, y∈Ruc∗​.

In words: when investment cannot speed up discovery, financial constraints lead to under-investment, Rfc∗<Ruc∗R^*_{fc}<R^*_{uc}Rfc∗​<Ruc∗​. This is the first statement of the paper's Corollary 1; its second statement (possible over-investment when λ′>0\lambda'>0λ′>0) rests on numerical exercises and is not posed.

Formalization Note. (i) The two firms' problems are the reduced values (5) and (6) of Lemma 1, taken as definitions; the derivation of (6) from the GBM model (3) is not posed. (ii) Aβη>1A\beta\eta>1Aβη>1 is a disclosed, necessary addition: it says the unconstrained optimum is interior; if Aβη≤1A\beta\eta\le1Aβη≤1 both optimal sets equal {1}\{1\}{1} and the strict inequality fails. (iii) X≥1X\ge1X≥1 keeps the FC range [1,min⁡{Rˉ,X}][1,\min\{\bar R,X\}][1,min{Rˉ,X}] of (7) nonempty. (iv) The paper's single-valued R∗R^*R∗ is read as a set of maximizers; the inequality is claimed for every pair of optima and the sets are asserted nonempty, so no clause is vacuous. (v) No sign condition on μ\muμ is imposed.

Preamble
import Mathlib
import Definitions.Def_AccelScal_FCMonopoly_Setting
Formal statement
namespace AccelScal.FCMonopoly
theorem corollary_1 (T : Tech) (hT : T.Standing) (r : ℝ) (hr : 0 < r) (μ σ X : ℝ) (hσ : 0 < σ)
    (hX : 1 ≤ X) (hγ : T.γ = 0) (hβ : 0 < T.β) (hint : 1 < T.A * T.β * T.η) :
    (RstarUC T r).Nonempty ∧ (RstarFC T r μ σ X).Nonempty ∧
    ∀ x ∈ RstarFC T r μ σ X, ∀ y ∈ RstarUC T r, x < y := by sorry
end AccelScal.FCMonopoly
Source
Lin, Accelerability vs. Scalability: R&D Investment Under Financial Constraints and Competition, Management Science, Articles in Advance (2022), doi:10.1287/mnsc.2022.4503, p. 6, Corollary 1 (first statement); proof Appendix A.4, p. 20
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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