Symmetric rendezvous: (easy half of the HDVZ reduction)
ProvedSymmetricRendezvousLine.symmetric_rendezvous_value_le_discreteThe symmetric rendezvous value on the line is at most its discrete counterpart:
Here is the infimum of the expected meeting time over all mixed strategies (two players at distance , independent random orientations, speed at most , both using ), and is the infimum of the same quantity over the mixed strategies all of whose paths are integer zigzags: paths starting at that move at full speed and change direction only at integer times (see the definition file).
This is the trivial half of the Han–Du–Vera–Zuluaga reduction of the symmetric problem to a discrete one: the strategies admissible in form a subfamily of those admissible in , so the infimum over the larger family is smaller. The substantive half, , is the dominance statement that integer-time full-speed strategies dominate among all strategies.
Formalization Note Both values live in ; the inequality is between the two infima of the definition file.
import Definitions.Def_SymmetricRendezvousLine_defs
namespace SymmetricRendezvousLine
theorem symmetric_rendezvous_value_le_discrete :
symmetricRendezvousValue ≤ discreteSymmetricRendezvousValue := by sorry
end SymmetricRendezvousLine