Proposition 1, first claim (§A.1, first paragraph) — the optimal price dominates the myopic price: p*(r) ≥ p̃(r)
ProvedReferencePricing.Myopic.myopicPrice_le_optPriceUnder the standing assumptions of §4 (, , , Assumptions 1–3, , differentiable), for every reference price ,
where both argmax are largest maximizers.
The myopic firm underprices at every state: taking into account the future value of a higher reference price can only raise the price. This is the first sentence of Proposition 1, stated separately as the base case of the path comparison.
Formalization Note. Both policies are largest maximizers (the paper's convention); with arbitrary maximizers the inequality can fail. Differentiability of is added as in the rest of §4.
import Mathlib import Definitions.Def_ReferencePricing_Myopic_Assumptions import Definitions.Def_ReferencePricing_Myopic_optPrice import Definitions.Def_ReferencePricing_Myopic_myopicPrice
namespace ReferencePricing.Myopic
/-- Proposition 1, first sentence, as proved in §A.1, first paragraph (pp. 418, 425): for every
reference price `r ∈ P`, the myopic price is at most the optimal price, `p̃(r) ≤ p*(r)`
(both the largest maximizers of their objectives over `P = [0, p̄]`). -/
theorem myopicPrice_le_optPrice (d : ℝ → ℝ) (R : ℝ → ℝ → ℝ) (α β pbar : ℝ)
(hpbar : 0 < pbar) (hα₀ : 0 ≤ α) (hα₁ : α < 1) (hβ₀ : 0 < β) (hβ₁ : β < 1)
(hR0 : ∀ r, R 0 r = 0) (hd : Differentiable ℝ d)
(hA1 : Assumption1 d R pbar) (hA2 : Assumption2 R) (hA3 : Assumption3 d R pbar) :
∀ r ∈ Set.Icc (0 : ℝ) pbar,
myopicPrice (profit d R) pbar r ≤ optPrice (profit d R) α β pbar r := by sorry
end ReferencePricing.Myopic
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data.
- and are arbitrary functions.
- are reals, and .
- and .
- and .
- is the derivative of at , or if it does not exist.
The two prices being compared are defined as follows.
- Myopic price : the supremum of the set of maximizers over of , or if that set is empty.
- Value : the supremum over all sequences in of , along , . A non-summable series counts as , and an unbounded-above supremum as .
- Bellman objective .
- Optimal price : the supremum of the set of maximizers over of , or if that set is empty.
Hypotheses.
- ;
- ;
- ;
- for all real ;
- is differentiable everywhere;
- Assumption 1: on , is nonnegative, bounded above and jointly continuous; it is non-increasing in and non-decreasing in ; and is non-decreasing on for each ;
- Assumption 2: is differentiable on , and so is its derivative map;
- Assumption 3:
- is neither non-decreasing nor non-increasing on , and is concave on ;
- is strictly decreasing on ;
- is concave on for each ;
- has increasing differences on , as in the inequality of the previous declaration.
Conclusion. For every :
Degenerate cases:
- and the ranges of exclude the empty price set, , and . is permitted.
- The comparison is between the two numbers exactly as defined. If had no maximizer on , would be the junk value , and the statement would then require , i.e. .
- inside carries its own conventions: non-summable sums count as , and an unbounded supremum counts as .
- Neither price is asserted to be an actual maximizer.
- Only a weak inequality is claimed, and only for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.