Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetric rendezvous: integer-time zigzag strategies suffice

Open
SymmetricRendezvousLine.symmetric_rendezvous_value_eq_discrete

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

rendezvoussearch-games

Theorem (Han–Du–Vera–Zuluaga). Strategies in which the players move at maximum speed and change direction only at integer times dominate among all strategies; in particular

R=Rdisc,R=R_{\mathrm{disc}},R=Rdisc​,

where RdiscR_{\mathrm{disc}}Rdisc​ is the infimum of E(S,S)E(S,S)E(S,S) over mixed strategies SSS all of whose paths are integer zigzags: paths starting at 000 that, on each interval [n,n+1][n,n+1][n,n+1] with n∈Nn\in\mathbb Nn∈N, move with constant velocity +1+1+1 or −1-1−1.

Here R=inf⁡SE(S,S)R=\inf_S E(S,S)R=infS​E(S,S) is the symmetric rendezvous value on the line: two players start at distance 222, each with an independently random unknown orientation, both moving at speed at most 111, both required to use the same mixed strategy SSS, and E(S,S)E(S,S)E(S,S) is the expected first meeting time (see the definition file).

This reduces the continuous problem to a discrete one (a choice of ±1\pm1±1 for each unit time step), which is the basis of the numerical bounds on RRR.

Formalization Note Only the equality of the two infima is asserted, which is the consequence of the dominance statement used to reduce the problem.

Preamble
import Definitions.Def_SymmetricRendezvousLine_defs
Formal statement
namespace SymmetricRendezvousLine

theorem symmetric_rendezvous_value_eq_discrete :
    symmetricRendezvousValue = discreteSymmetricRendezvousValue := by sorry

end SymmetricRendezvousLine
Source
Open Problem Garden, 'Rendezvous on a line' (posted by mdevos, 2007), http://www.openproblemgarden.org/op/rendezvous_on_a_line ("Han, Du, Vera, and Zuluaga [HDVZ] have shown that strategies in which the players move at maximum speed and only change direction at integer times dominate among all possible strategies - thus reducing this problem to a discrete one"); Q. Han, D. Du, J. C. Vera, L. F. Zuluaga, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research 56(3) (2008).
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