Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Entanglement bound with a shared global state

Open
MarkovEntanglement.shared_state_local_transition_deviation

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

entanglementerror-boundmarkov-chainsmulti-agent-systemstotal-variation

Statement

Theorem. For an NNN-agent Markov system with a shared global coordinate, if agent iii's marginalised transition differs from a candidate local transition PiP_iPi​ by at most E\mathcal{E}E entrywise, then

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

Notes

The shared-state analogue of the local transition bound, and the step that carries the whole entanglement machinery over to systems with a common coordinate. The factor 222 has the same origin as in the product case: passing from a distance measured on distributions to a uniform entrywise bound.

Together with the previous proposition this gives the shared-state theory its two halves — an exact decomposition when the system is separable, and a controlled error when it is not.

Search terms: marginalised transition with shared state, agent-wise total variation, global coordinate multi-agent MDP, entrywise transition bound.

Preamble
import Mathlib
import Definitions.Def_markov_entanglement_multi

open scoped BigOperators
open MarkovEntanglement
Formal statement
namespace MarkovEntanglement

theorem shared_state_local_transition_deviation
    {N : ℕ} {S : Fin N → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    {Z : Type*} [Fintype Z] [DecidableEq Z]
    (P : Matrix (JointZ S Z) (JointZ S Z) ℝ) (hP : IsTransitionMatrix P)
    (i : Fin N) (E : ℝ)
    (Pi Ptrue : Matrix (S i × Z) (S i × Z) ℝ) (hPi : IsTransitionMatrix Pi)
    (htrue : ∀ p t, marginalZ i P p t = Ptrue (p.1 i, p.2) t)
    (hE : ∀ p t, |marginalZ i P p t - Pi (p.1 i, p.2) t| ≤ E) :
    ∀ s t, |Ptrue s t - Pi s t| ≤ 2 * E := by
  sorry

end MarkovEntanglement
Source
Shuze Chen and Tianyi Peng, *Multi-agent Markov Entanglement*, arXiv:2506.02385v3, Theorem 9, p. 46
Read-back

What the Lean code literally says, in plain math · claude-opus-5

Read-back: shared_state_local_transition_deviation

What the statement asserts

Fix a natural number NNN (implicit), a family of types S0,…,SN−1S_0,\dots,S_{N-1}S0​,…,SN−1​ indexed by j∈Fin Nj \in \mathrm{Fin}\,Nj∈FinN (implicit), each assumed finite with decidable equality, and a further type ZZZ (implicit), also finite with decidable equality. The bundle's joint space with a shared coordinate is

JZ  =  (∏j∈Fin NSj)×Z,\mathcal{J}_Z \;=\; \Big(\prod_{j \in \mathrm{Fin}\,N} S_j\Big) \times Z ,JZ​=(j∈FinN∏​Sj​)×Z,

with elements p=(p1,p2)p = (p_1,p_2)p=(p1​,p2​), p1p_1p1​ a dependent tuple with p1(j)∈Sjp_1(j) \in S_jp1​(j)∈Sj​, and p2∈Zp_2 \in Zp2​∈Z.

The data are: a real matrix PPP indexed by JZ\mathcal{J}_ZJZ​ on both sides, assumed (hP) row-stochastic in the bundle's sense (IsTransitionMatrix: all entries ≥0\ge 0≥0 and every row summing to 111); an index i∈Fin Ni \in \mathrm{Fin}\,Ni∈FinN; a real number EEE (with no sign hypothesis — EEE may be negative); and two real matrices PlocP^{\mathrm{loc}}Ploc and PtrueP^{\mathrm{true}}Ptrue indexed by Si×ZS_i \times ZSi​×Z on both sides. Only PlocP^{\mathrm{loc}}Ploc is assumed (hPi) to be row-stochastic; PtrueP^{\mathrm{true}}Ptrue carries no such assumption.

The bundle's marginal marginalZ is, for p∈JZp \in \mathcal{J}_Zp∈JZ​ and t=(t1,t2)∈Si×Zt = (t_1,t_2) \in S_i \times Zt=(t1​,t2​)∈Si​×Z,

margi(P)(p,t)  =  ∑q∈JZ[ q1(i)=t1 ∧ q2=t2 ] P(p,q),\mathrm{marg}_i(P)(p,t) \;=\; \sum_{q \in \mathcal{J}_Z} \big[\, q_1(i) = t_1 \ \wedge\ q_2 = t_2 \,\big]\, P(p,q),margi​(P)(p,t)=q∈JZ​∑​[q1​(i)=t1​ ∧ q2​=t2​]P(p,q),

the transition mass from ppp into all joint points whose iii-th coordinate is t1t_1t1​ and whose shared coordinate is t2t_2t2​. The two remaining hypotheses are:

  • (htrue) for all p∈JZp \in \mathcal{J}_Zp∈JZ​ and all t∈Si×Zt \in S_i \times Zt∈Si​×Z:   margi(P)(p,t)=Ptrue((p1(i),p2), t)\;\mathrm{marg}_i(P)(p,t) = P^{\mathrm{true}}\big((p_1(i),p_2),\,t\big)margi​(P)(p,t)=Ptrue((p1​(i),p2​),t) — an exact equality, so this marginal depends on ppp only through the pair (p1(i),p2)(p_1(i), p_2)(p1​(i),p2​);
  • (hE) for all p∈JZp \in \mathcal{J}_Zp∈JZ​ and all t∈Si×Zt \in S_i \times Zt∈Si​×Z:   ∣ margi(P)(p,t)−Ploc((p1(i),p2), t) ∣≤E\;\big|\,\mathrm{marg}_i(P)(p,t) - P^{\mathrm{loc}}\big((p_1(i),p_2),\,t\big)\,\big| \le E​margi​(P)(p,t)−Ploc((p1​(i),p2​),t)​≤E — an entrywise bound (not a total-variation or row-summed bound), with non-strict inequality.

Conclusion. For all s,t∈Si×Zs, t \in S_i \times Zs,t∈Si​×Z,

∣ Ptrue(s,t)−Ploc(s,t) ∣  ≤  2E.\big|\,P^{\mathrm{true}}(s,t) - P^{\mathrm{loc}}(s,t)\,\big| \;\le\; 2E .​Ptrue(s,t)−Ploc(s,t)​≤2E.

This is again an entrywise, non-strict bound, with the constant 2E2E2E (twice the constant appearing in (hE), not EEE itself), and it is quantified over all row indices s∈Si×Zs \in S_i \times Zs∈Si​×Z, not only those arising as (p1(i),p2)(p_1(i), p_2)(p1​(i),p2​) for some p∈JZp \in \mathcal{J}_Zp∈JZ​.

Quantification, satisfiability, and degenerate cases

  • Every variable occurring in the conclusion is bound by the theorem's binders (NNN, SSS, ZZZ, PPP, iii, EEE, PlocP^{\mathrm{loc}}Ploc, PtrueP^{\mathrm{true}}Ptrue, plus the typeclass assumptions), and s,ts,ts,t are universally quantified inside the conclusion. However, the constraints on those bound variables are uneven: PtrueP^{\mathrm{true}}Ptrue is pinned down by (htrue) and EEE by (hE) only on rows of the form (p1(i),p2)(p_1(i), p_2)(p1​(i),p2​) with p∈JZp \in \mathcal{J}_Zp∈JZ​, whereas the conclusion ranges over all rows sss.
  • The hypotheses are jointly satisfiable, so the statement is not vacuous overall. Example: N=1N = 1N=1, S0S_0S0​ and ZZZ any nonempty finite types, PPP the identity matrix on JZ\mathcal{J}_ZJZ​, PtrueP^{\mathrm{true}}Ptrue and PlocP^{\mathrm{loc}}Ploc both the corresponding identity on S0×ZS_0 \times ZS0​×Z, E=0E = 0E=0.
  • The supplied index i∈Fin Ni \in \mathrm{Fin}\,Ni∈FinN forces N≥1N \ge 1N≥1; the N=0N = 0N=0 instance does not exist.
  • When ∏jSj\prod_j S_j∏j​Sj​ is nonempty (equivalently, every SjS_jSj​ is nonempty), every pair (a,z)∈Si×Z(a,z) \in S_i \times Z(a,z)∈Si​×Z arises as (p1(i),p2)(p_1(i), p_2)(p1​(i),p2​) for some ppp — one may take any tuple and overwrite its iii-th entry with aaa — so (htrue) and (hE) do constrain every row sss, and (hE) then forces E≥0E \ge 0E≥0.
  • When ∏jSj\prod_j S_j∏j​Sj​ is empty but Si×ZS_i \times ZSi​×Z is not, the hypotheses constrain nothing while the conclusion still asserts something. Concretely: take N=2N = 2N=2, Si=Fin 1S_i = \mathrm{Fin}\,1Si​=Fin1, Sj=∅S_j = \varnothingSj​=∅ for the other index jjj, and Z=Fin 1Z = \mathrm{Fin}\,1Z=Fin1. Then JZ\mathcal{J}_ZJZ​ is empty, so (hP), (htrue) and (hE) hold vacuously for any value of EEE (including E=−1E = -1E=−1) and any matrix PtrueP^{\mathrm{true}}Ptrue, while Si×ZS_i \times ZSi​×Z is a one-element type on which (hPi) forces Ploc=(1)P^{\mathrm{loc}} = (1)Ploc=(1). The conclusion then asserts ∣Ptrue(s,t)−1∣≤2E|P^{\mathrm{true}}(s,t) - 1| \le 2E∣Ptrue(s,t)−1∣≤2E for the unique s,ts,ts,t, with PtrueP^{\mathrm{true}}Ptrue and EEE unconstrained — e.g. Ptrue=(5)P^{\mathrm{true}} = (5)Ptrue=(5), E=0E = 0E=0 gives 4≤04 \le 04≤0, and E=−1E = -1E=−1 gives a negative right-hand side against a nonnegative left-hand side. So there are instantiations of the binders satisfying all hypotheses in which the conclusion's inequality fails.
  • EEE is a free real parameter with no nonnegativity hypothesis. Whenever JZ\mathcal{J}_ZJZ​ is empty, (hE) imposes no lower bound on EEE at all, and 2E2E2E can be negative.
  • PtrueP^{\mathrm{true}}Ptrue is not assumed row-stochastic, nonnegative, or bounded; its only constraint is (htrue), which is vacuous when JZ\mathcal{J}_ZJZ​ is empty.
  • If Si×ZS_i \times ZSi​×Z is empty (i.e. SiS_iSi​ or ZZZ empty), the conclusion is vacuously true.
  • The hypothesis (htrue) is an exact identity, not an approximation, and is imposed for all ppp and ttt simultaneously; it is a strong structural restriction on PPP (its iii-marginal must factor through (p1(i),p2)(p_1(i), p_2)(p1​(i),p2​)), though it is satisfied e.g. by product-form and identity transitions, so it does not by itself make the statement vacuous.
Human review
  • Endorsed by Shuze Chen · Aug 7, 2026

  • Endorsed by tianyipeng · Aug 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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