Lemma 5 — Uniform downward passage expectation
ProvedMatchingWhileLearning.DEEM.lemma_5Fix a positive integer , a bound , and positive means for . There exists a finite nonnegative constant such that the following holds on every probability space. Take , starts , and real-valued increments IID along time for each walk, with mean and absolute value at most . No independence between walks is required. Set and . Then
The same works for every barrier, start, and admissible step law with the fixed means and bound.
Differences from the source:
- encoding: random variables and their expectations → measurable functions on a probability space, IID within each walk, almost-sure bounds and prescribed integrals; reason: these are the usual random-variable conventions and boundedness supplies integrability
- encoding: T times the indicator of finite passage → extended-natural first-hit time and a nonnegative integral equal to T on finite-hit paths and zero otherwise; reason: this is the source random variable and avoids the zero default of a nonintegrable real integral
- encoding: walks and increments indexed starting at one → walks indexed by Fin V and increments by naturals starting at zero; reason: only the labels of the first V walks and first n increments change
import Definitions.Def_MatchingWhileLearning_DEEM_Stopping open scoped BigOperators ENNReal open Filter MeasureTheory ProbabilityTheory open MatchingWhileLearning.DEEM
namespace MatchingWhileLearning.DEEM
theorem lemma_5 (V : ℕ) (hV : 0 < V) (M : ℝ) (hM : 0 < M)
(means : Fin V → ℝ) (hm : ∀ j, 0 < means j) :
∃ Z : ℝ, 0 ≤ Z ∧ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω),
IsProbabilityMeasure P → ∀ (lower upper : ℝ) (start : Fin V → ℝ),
0 < lower → lower < upper → (∀ j, start j ∈ Set.Ioo lower upper) →
∀ X : Fin V → ℕ → Ω → ℝ,
(∀ j n, Measurable (X j n)) →
(∀ j, iIndepFun (X j) P) →
(∀ j n, IdentDistrib (X j n) (X j 0) P P) →
(∀ j n, ∀ᵐ ω ∂P, |X j n ω| ≤ M) →
(∀ j n, ∫ ω, X j n ω ∂P = means j) →
finiteHitExpectation P X start lower ≤ ENNReal.ofReal Z := by sorry
end MatchingWhileLearning.DEEM
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
This statement does not involve the matching model; the letter here is a real number.
Data.
- with .
- A real .
- Reals with every .
Assertion. There exists a real , depending only on , such that the following holds for:
- every measurable space and every probability measure on it;
- all reals ;
- all starting points (open interval);
- all real processes , , , satisfying:
- each is measurable;
- for each fixed , the family is mutually independent under (nothing is assumed across different );
- each has the same law as ;
- almost surely;
- .
Then
where
is the first time any one walk is below , with if never. Paths with contribute .
The bound is uniform over , , , , , and the laws of the subject to the listed constraints.
Degenerate cases.
- is excluded.
- always, since every .
- The upper level enters only through .
- ranges over types in the base universe.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.