Lemma 2 — Threshold DP outputs are threshold-regulated
ProvedZhangJasinPricing.Cyclic.lemma_2For every feasible terminal price i and integer t≥1, every maximizing word returned at entry (t,i) by the threshold dynamic program (5) is threshold-regulated, including the last-minimum condition. This holds for every real reward table, and all ties are retained.
Differences from the source:
- encoding: finite ordered prices, nonnegative cohort amounts, and a general probability law → zero-based natural-number indices with explicit bounds, real cohort amounts, and a measurable probability space; reason: the same instances are represented; real amounts also include the uniform demands used on p. 28
- reading: Definition 1 mixes a strict maximum set with a non-strict empty-set test → the maximum and fallback use the displayed strict set; reason: the printed cases leave repeated thresholds undefined; this releases a threshold once reached and retains the larger class (I4)
- generalization: the DP is described using its expected revenue parameters → the output property holds for every real reward table; reason: true means and optimistic estimates are both specializations; the output construction has the same structural constraint for every table
import Definitions.Def_ZhangJasinPricing_Cyclic_Analysis open MeasureTheory open scoped BigOperators ENNReal noncomputable section
namespace ZhangJasinPricing.Cyclic
theorem lemma_2 {Ω : Type} [MeasurableSpace Ω] (D : Model Ω)
(r : Parameter → ℝ) (t i : ℕ) (ht : 1 ≤ t) (hi : i < D.M)
(x : Plan) (hx : x ∈ dp .threshold D.K r t t i) :
ThresholdRegulated D.M D.price x.1 := by sorry
end ZhangJasinPricing.Cyclic
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let be any model. It provides:
- and ;
- prices , nonnegative and strictly decreasing for ;
- a probability measure and cohort conditions.
Hypotheses.
- is an arbitrary function from triples in to .
- and are natural numbers with and .
- is a plan in the threshold-mode list , with fuel , length and final index .
The list . It is defined recursively:
- .
- With fuel :
- length gives ;
- length gives ;
- length gives the plans of maximal value among two families, described next.
- Drops: for each and each , the plan .
- Splits: for each , each and each , the plan .
Claim. The word is threshold regulated. That is:
- is nonempty;
- all entries of are ;
- every entry is the last entry;
- for every .
Here , in range and beyond. if ; otherwise is the largest with and , or .
Degenerate cases. The claim holds for every real-valued , with no restriction. It is vacuous whenever is empty. For , it concerns only the word .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.