Symmetric rendezvous: integer-time zigzag strategies suffice
OpenSymmetricRendezvousLine.symmetric_rendezvous_value_eq_discreteTheorem (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
where is the infimum of over mixed strategies all of whose paths are integer zigzags: paths starting at that, on each interval with , move with constant velocity or .
Here is the symmetric rendezvous value on the line: two players start at distance , each with an independently random unknown orientation, both moving at speed at most , both required to use the same mixed strategy , and is the expected first meeting time (see the definition file).
This reduces the continuous problem to a discrete one (a choice of for each unit time step), which is the basis of the numerical bounds on .
Formalization Note Only the equality of the two infima is asserted, which is the consequence of the dominance statement used to reduce the problem.
import Definitions.Def_SymmetricRendezvousLine_defs
namespace SymmetricRendezvousLine
theorem symmetric_rendezvous_value_eq_discrete :
symmetricRendezvousValue = discreteSymmetricRendezvousValue := by sorry
end SymmetricRendezvousLine
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.