Lemma 3 — Optimal-price containment and regime switch
DisprovedCloseGaps.DPA.lemma_3Lemma 3. Let p^D be the optimal price for the deterministic problem. Define A_0 to be the event satisfying the following conditions:
- If we never enter Step 3, then p^D ∈ I_i^u for all i = 1, 2, …, N^u.
- If Step 2 stops at i_0 and the algorithm enters Step 3, then p^c ≥ p^u, p^D ∈ I_i^u for all i = 1, 2, …, i_0 and p^D ∈ I_j^c for all j = 1, 2, …, N^c. Then P(A_0) = 1 − O(1/n).
Differences from the source:
- encoding: Continuous-time controlled Poisson sales with an off action. → A measurable price rule on sale histories, exponential interarrivals and Option-valued actions.; reason: The off action has zero intensity and revenue; the history rule cannot access the unknown demand.
- reading: The size parameter n is written without an integrality restriction. → n is real.; reason: This retains the displayed domain, including every integer size.
- encoding: The DPA objects are constructed by the displayed algorithm. → Partial stage construction and successful construction in the conclusion.; reason: Definedness is asserted in the conclusion at the source sizes: every printed real grid count must be an exact positive integer, each stage duration positive, and each stopping minimum attained; no rounding or restriction to executable sizes is introduced.
- encoding: P(A_0) = 1 - O(1/n). → One positive constant and threshold bound the complement probability by C/n.; reason: This expresses the asymptotic notation, without an exact probability equality.
- reading: Stage counts appear as fixed summation limits and deterministic factors outside expectations in section 5, although the interval widths are random. → A common pair of deterministic counts satisfies the actual stopping tests almost surely on the constructed virtual traces.; reason: This is the literal fixed-count reading of the printed formulas; nominal-width equalities are not assumed, and successful construction is asserted in the conclusion.
- encoding: Grid prices have indices j=1,...,κ_i. → Grid indices are j=0,...,k-1, with price lo+j(hi-lo)/k.; reason: The same left endpoints are enumerated; only the index origin changes.
- reading: The empirical argmax and argmin do not specify a tie rule. → Choose the least grid index attaining each finite optimum.; reason: This fixes an observable deterministic selection from the source argmax or argmin, without demand information.
- reading: The base-instance estimator is count/Δ and its inventory target is x/T. → For the size-n normalized instance, estimate base demand by count/(nΔ) and compare with x.; reason: Instantiating the pseudocode with inventory nx and dividing its rate estimate and target by n gives this rule; normalized time has horizon one.
import Definitions.Def_CloseGaps_DPA_RevenueEvents open MeasureTheory Set open scoped Classical
namespace CloseGaps.DPA
theorem lemma_3 (c : Coefficients) (hc : c.Positive) (x : ℝ) (hx : 0 < x) :
∃ C n₀ : ℝ, 0 < C ∧ 3 ≤ n₀ ∧
∀ a : Market, a.Valid → a.hi - a.lo = 1 →
∃ π : ℝ → PriceRule, ∀ n : ℝ, 3 ≤ n →
∀ lam : ℝ → ℝ, InClass c a x 1 lam →
∃ N : StageCounts, Experiment a lam n x (π n) N ∧
(n₀ ≤ n → probability (A0 a lam n x N)ᶜ ≤ C / n) := by sorry
end CloseGaps.DPA
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. For all coefficients with all four entries , and every real , there exist reals and with the following property.
For every market with and , there is a family of price rules , chosen before and , such that for every real and every with InClass, there exist stage counts with:
and do not depend on , or . The rule family depends on (and , ) but not on .
InClass. As in the model, with :
- strictly decreasing on , with ;
- and are -Lipschitz on ;
- some satisfies:
- on ;
- is -Lipschitz on ;
- is twice differentiable at each , with the derivative function defaulting to where undefined, and ;
- , where:
- is the supremum of the maximizers of on ;
- is the supremum of the minimizers of on ;
- each is if empty.
Stages and switch index. For noise with law (infinite product of rate-1 exponentials), stages are built as follows.
A stage on an interval with duration and size exists only if all hold:
- is exactly a positive integer ;
- ;
- the interval is ordered;
- at the grid points.
It records counts (truncated increments of an imported counting process along rate-scaled clock times), its gap, a u-selected index (revenue-maximizing) and a c-selected index (closest rate to ), and the end clock.
The u-stages have parameters and shrink around the center (larger selected point) to . The c-branches start after u-stage on , with , shrinking to .
The switch index is the first u-stage whose c-selected point exceeds its u-selected point by more than , or if none.
Event . On , requires to lie in the interval of every u-stage . On , it requires all of:
- ;
- in the intervals of u-stages ;
- in the intervals of c-stages of branch .
A missing stage is replaced by the interval . is its complement, and is evaluated as a real number.
Experiment requires all of:
-
Generated at horizon 1. Since the width is , the normalized market and demand coincide with and . This means both of:
- almost surely, the complete trace below holds;
- almost surely, for every where 's sales process has fewer than sales strictly before , the posted price is a real price with either an experimental or a final posting.
The sales process: the -th sale is the first attained time at which since the last sale reaches , capped at sales. An experimental posting means is in the -th subinterval of u-stage , offset by , or (if ) of c-stage of branch , offset by , and is its -th grid point. A final posting means one of:
- , , and of u-stage ;
- , , and is the c-selected point of c-stage of branch .
-
Almost surely, all of:
- the complete trace: and are exactly the first u- and c-stopping indices (gap, respectively gap), for every branch , with all intermediate stages existing;
- ;
- for all ;
- on .
-
, , and every are measurable.
-
The revenue terms , , and () are integrable.
Degenerate cases.
- If , no qualifies, and the statement reduces to the existence of , and some rule family.
- Experiment must hold for every , not only for . Its almost-sure complete trace requires, deterministically, that each () and () is exactly a positive integer. For example, at , must be an integer.
- If , the posting clause is vacuous.
- If , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.