Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 53 — with no prior click the next click is Bernoulli(pᵢ): the hook probability equals the coupled first-click probability and 1 − ∏(1 − p)

Proved
RankAssort.SimpleLearn.first_click_identity

by mikedeng1 · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

click-modelp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probabilityproduct-ranking

Fix a customer type (p,f,k)(p,f,k)(p,f,k) and a ranking π\piπ (more generally any duplicate-free list of products), and let w=min⁡(k,∣π∣)w = \min(k, |\pi|)w=min(k,∣π∣) be the browsed window. Then the probability that the customer is hooked under the sequential click law with bias equals

  1. the probability, under the coupled first-click law (one Bernoulli(pi)(p_i)(pi​) like-variable LiL_iLi​ per product), that some product in the window is liked:
Pr⁡[H(π)=1∣(p,f,k)]=Pr⁡[∃j≤w: Lπ−1(j)=1];\Pr[H(\pi) = 1 \mid (p,f,k)] = \Pr\bigl[\exists j \le w:\ L_{\pi^{-1}(j)} = 1\bigr];Pr[H(π)=1∣(p,f,k)]=Pr[∃j≤w: Lπ−1(j)​=1];
  1. the closed form
Pr⁡[H(π)=1∣(p,f,k)]=1−∏j=1w(1−pπ−1(j)).\Pr[H(\pi) = 1 \mid (p,f,k)] = 1 - \prod_{j=1}^{w}\bigl(1 - p_{\pi^{-1}(j)}\bigr).Pr[H(π)=1∣(p,f,k)]=1−j=1∏w​(1−pπ−1(j)​).

This is the content of the paper's remark that, conditional on no prior clicks, a click on product iii is a Bernoulli variable with probability pi+fi(∅)=pip_i + f_i(\emptyset) = p_ipi​+fi​(∅)=pi​. It ties the coupled first-click law used in the proofs to the model: every statement phrased with the coupled law is a statement about the sequential click law with bias.

Formalization Note Ranks are 0-based in Lean: the paper's rank rrr is index r−1r-1r−1, a ranking is a duplicate-free list of the nnn products (Fin n), and π−1(j)\pi^{-1}(j)π−1(j) is the list entry at index j−1j-1j−1. The first part is hookProb θ l = coupledProb θ (…), the second the product formula over the window Fin (window θ l). The hypothesis that the list has no duplicates is needed: the coupled law gives every copy of a product the same coin.

Differences from the source:

  • generalization: any ranking π → any duplicate-free list l of products (a ranking or a prefix of one); reason: a full ranking is the case length l = n
  • reading: conditional on no prior clicks, the click on product i is Bernoulli(pᵢ + fᵢ(∅)) = Bernoulli(pᵢ) → the conditional hook probability equals the coupled first-click probability that some window product is liked, and equals 1 − ∏ over the window of (1 − p); reason: the remark is used in the proof of Lemma 1 exactly to replace the sequential law by these forms; the per-click statement is their one-step content
  • encoding: conditional on the customer's type (p, f, k) → a statement for a fixed θ : CustomerType n; reason: the same conditioning
  • encoding: ranks 1..n, a ranking is a permutation π of [n], π⁻¹(j) the product at rank j → 0-based indices, a ranking is a duplicate-free List (Fin n) of length n, π⁻¹(j) is the entry at index j − 1; reason: Lean convention; the same rankings
Preamble
import Mathlib
import Definitions.Def_RankAssort_SimpleLearn_Model
Formal statement
namespace RankAssort.SimpleLearn
theorem first_click_identity {n : ℕ} (θ : CustomerType n) (l : List (Fin n)) (hl : l.Nodup) :
    hookProb θ l =
        coupledProb θ (fun L => ∃ j, ∃ hj : j < l.length, j < θ.k ∧ L (l.get ⟨j, hj⟩) = true) ∧
      hookProb θ l = 1 - ∏ j : Fin (window θ l), (1 - θ.p (windowGet θ l j)) := by sorry
end RankAssort.SimpleLearn
Source
Ferreira, Parthasarathy, Sekar, Learning to Rank an Assortment of Products, SSRN 3395992 author manuscript, p. 53, proof of Lemma 1, 'For any ranking π, we know that conditional on no prior clicks …'
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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