Lemma EC.1: rejection probability bound
ProvedMinBuying.lemmaEC1_rejection_boundFor a finite independent triangular family with positive parameters and weakly decreasing caps, and a common price no larger than any cap, let be the continuation revenue from pricing at the caps. Then . The empty family is included with product one and continuation zero.
import Definitions.Def_MinBuying_Triangular
namespace MinBuying
/-- Lemma EC.1, PDF p.45: strict-rejection bound for decreasing-cap
triangular items. Includes the empty-product/zero-continuation base case. -/
theorem lemmaEC1_rejection_bound (n : ℕ) (I : TriangularInstance n)
(hOrder : Antitone I.cap) (t : ℝ) (ht : 0 < t)
(hCaps : ∀ i, t ≤ I.cap i) :
triangularRejectionProduct I t ≤ t / (t + triangularContinuation I n) := by
sorry
end MinBuying
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
For every natural number , including , let be arrays of positive real numbers, and assume the cap array is nonincreasing: if then . For every real such that for every index, define and for , in increasing index order. Then . This product is the explicitly given rational product over all coordinates, and is the result of processing all coordinates in the stated recurrence. Equal caps and equality are permitted. At the positivity and ordering requirements on arrays are vacuous, the product is , , and the conclusion is the equality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.