Appendix A.4, p. 20 — without accelerability and with Aβη > 1, every UC optimum satisfies u′(R)λ = 1
ProvedAccelScal.FCMonopoly.uc_first_orderLet satisfy the standing assumptions, let , and suppose (not accelerable), (scalable) and . Let be the set of maximizers of the UC value of (5) over .
Then every UC optimum satisfies the first-order condition
This is the UC side of the paper's first-order-condition comparison in Appendix A.4; it is the benchmark against which (A.25) is compared.
Formalization Note. The page states the condition at without qualification; it fails at the corner when (then and ). The milestone therefore carries Corollary 1's disclosed hypothesis , under which the sentence holds at every UC optimum as printed (no optimum sits at either end of ). " and " is encoded as and . The UC value is the reduced problem (5), taken as the definition, as in the paper's proof.
import Mathlib import Definitions.Def_AccelScal_FCMonopoly_Setting
namespace AccelScal.FCMonopoly
theorem uc_first_order (T : Tech) (hT : T.Standing) (r : ℝ) (hr : 0 < r) (hγ : T.γ = 0)
(hβ : 0 < T.β) (hint : 1 < T.A * T.β * T.η) :
∀ R ∈ RstarUC T r, deriv T.u R * T.lam R - 1 = 0 := by sorry
end AccelScal.FCMonopoly
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.