Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Local transition deviates by at most twice the ATV measure of entanglement

Proved
MarkovEntanglement.local_transition_deviation_le_two_atv_entanglement

by Shuze Chen · Aug 7, 2026 · Mathlib c5ea003 (Lean v4.30.0)

markov-decision-processmarkov-entanglementmulti-agent

Theorem 8, first part (Chen and Peng, p. 40), NNN-agent form on the supremum row of Table 1.

Consider an NNN-agent MDP with joint transition P1:NπP^\pi_{1:N}P1:Nπ​ and a policy π\piπ, with occupancy measure μ\muμ strictly positive and stationary. Fix an agent iii, let PiπP^\pi_iPiπ​ be the local (marginalized) transition induced by P1:NπP^\pi_{1:N}P1:Nπ​ and μ\muμ via Eq. (2), and let PiP_iPi​ attain the measure of Markov entanglement of agent iii with respect to the unweighted agent-wise total variation distance.

Then the local transition deviates from that optimal independent approximation by at most twice the entanglement, uniformly over local state-action pairs:

∥Piπ−Pi∥∞≤2 Ei(P1:Nπ).\big\|P^\pi_i - P_i\big\|_\infty \le 2\,\mathcal{E}_i\big(P^\pi_{1:N}\big).​Piπ​−Pi​​∞​≤2Ei​(P1:Nπ​).

The measure here is the supremum-based one, Ei=inf⁡Pisup⁡s,a12∑t∣Pimarg(t∣s,a)−Pi(t∣si,ai)∣\mathcal{E}_i = \inf_{P_i} \sup_{s,a} \tfrac12\sum_t |P_i^{\text{marg}}(t\mid s,a) - P_i(t\mid s_i,a_i)|Ei​=infPi​​sups,a​21​∑t​∣Pimarg​(t∣s,a)−Pi​(t∣si​,ai​)∣. This pairing matters: Table 1 (p. 20) matches the unweighted distances with ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ and the μ\muμ-weighted ones with ∥⋅∥μ\|\cdot\|_\mu∥⋅∥μ​, and the uniform conclusion is false if the entanglement is measured in the μ\muμ-weighted distance, since a rarely visited local state can contribute almost nothing to a μ\muμ-average while its conditional deviation stays of constant order.

Strict positivity of μ\muμ forces the joint space to be nonempty, hence every local state-action pair has positive marginal — which is what licenses passing from the conditional average defining PiπP^\pi_iPiπ​ to a uniform bound.

Preamble
import Mathlib
import Definitions.Def_markov_entanglement_multi_atv

open scoped BigOperators
open MarkovEntanglement
Formal statement
namespace MarkovEntanglement

theorem local_transition_deviation_le_two_atv_entanglement
    {N : ℕ} {S : Fin N → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (P : Matrix (Joint S) (Joint S) ℝ) (hP : IsTransitionMatrix P)
    (μ : Joint S → ℝ) (hμ : IsPositiveDist μ) (hstat : IsStationary P μ) (i : Fin N)
    (Pi Ptrue : Matrix (S i) (S i) ℝ)
    (hPi : IsTransitionMatrix Pi)
    (hopt : agentTVDistN i P Pi = agentEntanglementWith i (agentTVDistN i) P)
    (hPtrue : IsTransitionMatrix Ptrue) (htrue : IsLocalTransitionN i P μ Ptrue) :
    ∀ s t, |Ptrue s t - Pi s t| ≤ 2 * agentEntanglementWith i (agentTVDistN i) P := by
  sorry

end MarkovEntanglement
Source
Shuze Chen and Tianyi Peng, 'Multi-agent Markov Entanglement', arXiv:2506.02385v3, Theorem 8, p. 40 (first part), with the distance/norm pairing of Table 1, p. 20

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me