Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integral approximation: Pn(rn)→−xlog⁡xP_n(r_n) \to -x\log xPn​(rn​)→−xlogx when rn/n→xr_n/n \to xrn​/n→x

Proved
ClassicalSecretary.tendsto_successProb_cutoffRule

by Lucas · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimal-stoppingprobabilitysecretary-problem

Let (rn)(r_n)(rn​) be cutoffs with 1≤rn≤n1 \le r_n \le n1≤rn​≤n for all large nnn, and suppose rn/n→xr_n/n \to xrn​/n→x for some x∈[0,1]x \in [0,1]x∈[0,1]. Then

lim⁡n→∞Pn(cutoff rn)=x∫x1dtt=−xlog⁡x,\lim_{n\to\infty} P_n(\text{cutoff } r_n) = x\int_x^1\frac{dt}{t} = -x\log x,n→∞lim​Pn​(cutoff rn​)=x∫x1​tdt​=−xlogx,

where the right-hand side is read as 000 at x=0x = 0x=0.

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 000 at x=0x=0x=0, 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
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me