Entanglement bound with a shared global state
OpenMarkovEntanglement.shared_state_local_transition_deviationStatement
Theorem. For an -agent Markov system with a shared global coordinate, if agent 's marginalised transition differs from a candidate local transition by at most entrywise, then
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 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.
import Mathlib import Definitions.Def_markov_entanglement_multi open scoped BigOperators open MarkovEntanglement
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 MarkovEntanglementRead-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 (implicit), a family of types indexed by (implicit), each assumed finite with decidable equality, and a further type (implicit), also finite with decidable equality. The bundle's joint space with a shared coordinate is
with elements , a dependent tuple with , and .
The data are: a real matrix indexed by on both sides, assumed (hP) row-stochastic in the bundle's sense (IsTransitionMatrix: all entries and every row summing to ); an index ; a real number (with no sign hypothesis — may be negative); and two real matrices and indexed by on both sides. Only is assumed (hPi) to be row-stochastic; carries no such assumption.
The bundle's marginal marginalZ is, for and ,
the transition mass from into all joint points whose -th coordinate is and whose shared coordinate is . The two remaining hypotheses are:
- (htrue) for all and all : — an exact equality, so this marginal depends on only through the pair ;
- (hE) for all and all : — an entrywise bound (not a total-variation or row-summed bound), with non-strict inequality.
Conclusion. For all ,
This is again an entrywise, non-strict bound, with the constant (twice the constant appearing in (hE), not itself), and it is quantified over all row indices , not only those arising as for some .
Quantification, satisfiability, and degenerate cases
- Every variable occurring in the conclusion is bound by the theorem's binders (, , , , , , , , plus the typeclass assumptions), and are universally quantified inside the conclusion. However, the constraints on those bound variables are uneven: is pinned down by (htrue) and by (hE) only on rows of the form with , whereas the conclusion ranges over all rows .
- The hypotheses are jointly satisfiable, so the statement is not vacuous overall. Example: , and any nonempty finite types, the identity matrix on , and both the corresponding identity on , .
- The supplied index forces ; the instance does not exist.
- When is nonempty (equivalently, every is nonempty), every pair arises as for some — one may take any tuple and overwrite its -th entry with — so (htrue) and (hE) do constrain every row , and (hE) then forces .
- When is empty but is not, the hypotheses constrain nothing while the conclusion still asserts something. Concretely: take , , for the other index , and . Then is empty, so (hP), (htrue) and (hE) hold vacuously for any value of (including ) and any matrix , while is a one-element type on which (hPi) forces . The conclusion then asserts for the unique , with and unconstrained — e.g. , gives , and 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.
- is a free real parameter with no nonnegativity hypothesis. Whenever is empty, (hE) imposes no lower bound on at all, and can be negative.
- is not assumed row-stochastic, nonnegative, or bounded; its only constraint is (htrue), which is vacuous when is empty.
- If is empty (i.e. or empty), the conclusion is vacuously true.
- The hypothesis (htrue) is an exact identity, not an approximation, and is imposed for all and simultaneously; it is a strong structural restriction on (its -marginal must factor through ), though it is satisfied e.g. by product-form and identity transitions, so it does not by itself make the statement vacuous.
Confirmed by the mission captain (proposal self-audit).