dp_threshold
def
Given a measurable space Ω, a measure P on Ω, a natural number n, a sequence of functions X : Fin n → Ω → ℝ, a real parameter r, and an item index i : Fin n, dp_threshold P n X r i is defined as dp_suffix_val P n X r (i.val + 1).
Statement
open MeasureTheory ProbabilityTheory in noncomputable def dp_threshold {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) (n : ℕ) (X : Fin n → Ω → ℝ) (r : ℝ) (i : Fin n) : ℝ
- Defined in
- arXiv:2611.15711, Section 2.2
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Built on 1
- dp_suffix_valThe dynamic programming value v_i(r) for the suffix from item i in {0, ..., n} under subsampling rate r, satisfying v_i(r) = v_{i+1}(r) +…
Read back from the Lean
dp_threshold is a definition that takes a type Ω equipped with a measurable space, a measure P on Ω, a natural number n, a family of functions X : Fin n → Ω → ℝ, a real number r, and an index i : Fin n, and produces a real number defined as dp_suffix_val P n X r (i.val + 1).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
open MeasureTheory ProbabilityTheory in /-- Optimal continuation threshold tau_i(r) = v_{i+1}(r) at item i. -/ noncomputable def dp_threshold {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) (n : ℕ) (X : Fin n → Ω → ℝ) (r : ℝ) (i : Fin n) : ℝ := dp_suffix_val P n X r (i.val + 1)