Lemma 6 — Step 3 revenue; equation (31)
DisprovedCloseGaps.DPA.lemma_6Lemma 6. ∑{i=1}^{N^c} ∑{j=1}^{κ_i^c} E[p_{i,j}^c Y_{ij}^c I(⋃{l=1}^{N^u} B_l) I(A_2)] ≥ ∑{i=1}^{N^c} nτ_i^c p^D λ(p^D) P(⋃_{l=1}^{N^u} B_l) − Cnτ_1^c log n. (31)
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.
- 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: A finite sum of expected stage revenues. → The expectation of their finite sum.; reason: The cardinalities are fixed by n on successful traces, and bounded prices and finite Poisson clock horizons ensure summand integrability.
- 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_6 (c : Coefficients) (hc : c.Positive) (x : ℝ) (hx : 0 < x) :
∃ C : ℝ, 0 < C ∧
∀ 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 ∧
(∑ i ∈ Finset.Icc 1 N.Nc,
n * tauC n i * dOpt a x 1 lam * lam (dOpt a x 1 lam) * probability (switched a lam n x N)) -
C * n * tauC n 1 * Real.log n ≤ ∫ E, revenue6 a lam n x N E ∂clockLaw := 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 , and every , there is a constant such that:
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 with Experiment and
Terms.
- , where:
- is the supremum of the maximizers of on ;
- is the supremum of the minimizers of ;
- each is if empty.
- and for .
- , where the switch index is the first u-stage whose c-selected grid point exceeds its u-selected point by more than gaps, or if none. The same probability factor appears in every summand.
.
summed over the grid points and counts of c-stage of the branch after u-stage , with zeros for missing stages.
is intersected with the event that the total counts of u-stages plus the total counts of c-stages of branch are . requires:
- on : in every u-stage interval ;
- on : , and in the intervals of u-stages and of c-stages of branch .
Missing stages give .
Stages. A stage exists only if all hold:
- its size is exactly a positive integer ;
- its duration is positive;
- its interval is ordered;
- on its grid.
Counts are truncated increments of an imported counting process driven by , along clock times advancing by . A c-branch after u-stage starts on and shrinks to gaps around the c-selected point.
Experiment requires all of:
- At horizon , both of:
- almost surely, the complete trace holds;
- almost surely, while 's sales process has fewer than sales strictly before , its posted price is a real price given by the stage schedule. The sales process uses thresholds against the rate integrated since the last sale, capped at .
- Almost surely, all of:
- are exactly the first u- and c-stopping indices, with all stages up to them existing on every branch ;
- ;
- ;
- on .
- , , and the are measurable.
- , , and are integrable.
InClass is as in the model:
- strictly decreasing on , with ;
- and are -Lipschitz;
- an inverse-on- function , -Lipschitz on , with having second derivative in on ;
- .
Degenerate cases.
- If , the inner statement is vacuous.
- Experiment, for every , requires the needed stage sizes and to be exact positive integers. For example, at , must be an integer.
- If , the left side is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.