Integral approximation: when
ProvedClassicalSecretary.tendsto_successProb_cutoffRuleoptimal-stoppingprobabilitysecretary-problem
Let be cutoffs with for all large , and suppose for some . Then
where the right-hand side is read as at .
This is the passage from the exact finite formula to its continuous limit.
Formalization Note The limit is written as -x * Real.log x. Since Real.log 0 = 0, this equals at , which is the correct limit there.
Preamble
import Mathlib import Definitions.Def_ClassicalSecretary_Model open Finset Filter Topology
Formal statement
namespace ClassicalSecretary
theorem tendsto_successProb_cutoffRule (r : ℕ → ℕ) (x : ℝ) (hx : x ∈ Set.Icc (0 : ℝ) 1)
(hr : ∀ᶠ n in atTop, 1 ≤ r n ∧ r n ≤ n)
(hlim : Tendsto (fun n : ℕ => (r n : ℝ) / (n : ℝ)) atTop (𝓝 x)) :
Tendsto (fun n : ℕ => successProb n (cutoffRule (r n))) atTop
(𝓝 (-x * Real.log x)) := by sorry
end ClassicalSecretary
Source
Wikipedia, "Secretary problem", https://en.wikipedia.org/wiki/Secretary_problem, section "Deriving the optimal policy", paragraph "Letting n tend to infinity, writing x as the limit of (r−1)/n ... the sum can be approximated by the integral P(x) = x∫_x^1 (1/t) dt = −x ln(x)".
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.