Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetry of W and (2), proof of Theorem 1, p. 5 — W is symmetric and E T⟨σ, σ⟩ splits into passive/active parts

Proved
RendezvousKn.Sym.W_symm

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

bilinear-formp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rendezvous-search

Fix n≥2n\ge2n≥2. (i) The function WWW is symmetric: for all tactics τA,τB\tau_A,\tau_BτA​,τB​,

W(τA,τB)=W(τB,τA).W(\tau_A,\tau_B)=W(\tau_B,\tau_A).W(τA​,τB​)=W(τB​,τA​).

(ii) For every strategy σ\sigmaσ with probability vector aaa, write a=aP+aAa=a^{\mathbf P}+a^{\mathbf A}a=aP+aA, where aPa^{\mathbf P}aP is aaa restricted to passive tactics and aAa^{\mathbf A}aA is aaa restricted to active tactics (both zero elsewhere), and let Φ⟨x,y⟩=∑τA,τBW(τA,τB) xτAyτB\Phi\langle x,y\rangle=\sum_{\tau_A,\tau_B}W(\tau_A,\tau_B)\,x_{\tau_A}y_{\tau_B}Φ⟨x,y⟩=∑τA​,τB​​W(τA​,τB​)xτA​​yτB​​. Then

E T⟨σ,σ⟩=Φ⟨a,a⟩=Φ⟨aP,aP⟩+Φ⟨aA,aA⟩+2 Φ⟨aP,aA⟩.(2)\mathbb E\,T\langle\sigma,\sigma\rangle=\Phi\langle a,a\rangle=\Phi\langle a^{\mathbf P},a^{\mathbf P}\rangle+\Phi\langle a^{\mathbf A},a^{\mathbf A}\rangle+2\,\Phi\langle a^{\mathbf P},a^{\mathbf A}\rangle.\qquad(2)ET⟨σ,σ⟩=Φ⟨a,a⟩=Φ⟨aP,aP⟩+Φ⟨aA,aA⟩+2Φ⟨aP,aA⟩.(2)

The symmetry of WWW is what lets the two mixed terms of the bilinear form be merged in (2), the decomposition on which the proof of Theorem 1 rests.

Formalization Note In Lean Φ⟨x,y⟩\Phi\langle x,y\rangleΦ⟨x,y⟩ is expWait x y, which is defined for arbitrary real vectors. As in the paper (p. 5), aPa^{\mathbf P}aP is supported on the passive tactics, the set the paper denotes ΘA\Theta^{\mathbf A}ΘA.

Differences from the source:

  • encoding: strategy σ ∈ Σ_n, a probability distribution on the tactics [n] → [n]; E T⟨σ_A, σ_B⟩ with independent draws → σ ∈ stdSimplex ℝ (Fin n → Fin n); expWait σ_A σ_B = Σ_{τ_A, τ_B} σ_A(τ_A) σ_B(τ_B) W(τ_A, τ_B); reason: a distribution on a finite set is its probability vector; the double sum is the expectation over independent τ_A ~ σ_A, τ_B ~ σ_B, π uniform (the paper's E T⟨σ_A, σ_B⟩ = Φ⟨a, b⟩, p. 4)
  • 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 W_symm (n : ℕ) (hn : 2 ≤ n) :
    (∀ τA τB : Tactic n, W τA τB = W τB τA) ∧
    (∀ σ : Tactic n → ℝ, σ ∈ stdSimplex ℝ (Tactic n) →
      expWait σ σ =
        expWait (fun τ => if IsPassive τ then σ τ else 0) (fun τ => if IsPassive τ then σ τ else 0) +
        expWait (fun τ => if IsPassive τ then 0 else σ τ) (fun τ => if IsPassive τ then 0 else σ τ) +
        2 * expWait (fun τ => if IsPassive τ then σ τ else 0)
          (fun τ => if IsPassive τ then 0 else σ τ)) := 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. 5 (PDF 6), proof of Theorem 1, 'As W(·,·) is a symmetric function', equation (2)
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