Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6), §3.3, p. 7 (corrected: event π(τ_A(i)) ≠ τ_B(i), not τ_A(π(i)) ≠ τ_B(i)) — P(no rendezvous) = P(X = 0)

Proved
RendezvousKn.Sym.eq_6

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

p2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1random-permutationrendezvous-search

Fix n≥2n\ge2n≥2 and tactics τA,τB\tau_A,\tau_BτA​,τB​; let F={(τA(i),τB(i)):i∈[n]}F=\{(\tau_A(i),\tau_B(i)):i\in[n]\}F={(τA​(i),τB​(i)):i∈[n]} and let X=∣F∩E(π)∣X=|F\cap E(\pi)|X=∣F∩E(π)∣ be the number of pairs (i,j)∈F(i,j)\in F(i,j)∈F with π(i)=j\pi(i)=jπ(i)=j, for a uniformly random binding π\piπ. Then

P(π(τA(i))≠τB(i) for all i∈[n])=P(X=0).(6)\mathbb P\bigl(\pi(\tau_A(i))\neq\tau_B(i)\ \text{for all } i\in[n]\bigr)=\mathbb P(X=0).\qquad(6)P(π(τA​(i))=τB​(i) for all i∈[n])=P(X=0).(6)

This identity translates the no-rendezvous event into the vanishing of the match count XXX, whose moments are then analysed.

Differences from the source:

  • correction: no-rendezvous event τ_A(π(i)) ≠ τ_B(i) for all i ∈ [n] → event π(τ_A(i)) ≠ τ_B(i) for all i (noRdvProb), the event of the game's definition on p. 3 and of the proof (Z > n); reason: the printed event makes the statement false: n ≥ 2, τ_A ≡ 1, τ_B ≡ 2 gives printed probability 1 (take β = 1) while W = 1/n + (n+1)(1 − 1/n) = n < n + 1/2 and P(X = 0) = 1 − 1/n
  • encoding: expectation over a uniformly random binding π: [n] → [n]; rounds 1, …, n; locations [n] → average over all n! elements of Equiv.Perm (Fin n) (avgPerm); rounds and locations are Fin n, Lean round i being round i + 1; reason: the same finite uniform distribution and the same game; no instance changes
Preamble
import Mathlib
import Definitions.Def_RendezvousKn_Sym_Model
Formal statement
namespace RendezvousKn.Sym

theorem eq_6 (n : ℕ) (hn : 2 ≤ n) (τA τB : Tactic n) :
    noRdvProb τA τB = probXZero (pairSet τA τB) := by sorry

end RendezvousKn.Sym
Source
Bonamy, Pilipczuk, Sereni, On the effect of symmetry requirement for rendezvous on the complete graph, arXiv:2002.03764v1, p. 7 (PDF 8), §3.3, equation (6)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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