Multi-step concentration of the configuration (Lem. 10, Gast et al. 2023)
ProvedMarkovEntanglement.rmab_multi_step_concentrationThere is a constant , independent of the system size , such that for every horizon and every the configuration of the -agent chain after steps stays close to the -th iterate of the explicit mean-field map applied to the starting configuration:
where is the explicit mean-field map at the system's exact activation fraction . The iterate must be that of the explicit map: a map merely characterised on the configurations the -agent system can occupy leaves that lattice after one step, and off the lattice the characterisation says nothing, so no bound of this shape could hold for it.
Two effects are being combined. Each single step contributes a deviation of size with failure probability — Hoeffding's inequality for the conditionally independent indicators that make up the next configuration, applied coordinatewise and union-bounded over the coordinates. And a deviation incurred at step is then transported forward by the remaining applications of the mean-field map, which is Lipschitz with some constant uniformly in the activation fraction; the geometric sum is the accumulated amplification.
Taken alone this bound degrades with the horizon whenever . What rescues it is the local stability of Lemma 11: near the mean-field fixed point the dynamics contract, so the amplification stops compounding and the horizon can be chosen uniformly. The two lemmas are used together, never separately.
The formalized bound weakens the source's constants: the exponent is rather than (the per-step tail is proved by a sub-Gaussian chord bound — convexity of the exponential plus — rather than Hoeffding's lemma), and the prefactor is per step because the sup-norm event union-bounds over two tails for each coordinate. The functional form, and with it the rate of Theorem 7, is unchanged.
import Mathlib import Definitions.Def_markov_entanglement_meanfield open scoped BigOperators open MarkovEntanglement
namespace MarkovEntanglement
variable {S : Type*} [Fintype S] [DecidableEq S]
/-- Lemma 10 (Multi-step Concentration; Lemma C.4 of Gast, Gaujal and Yan 2023). There is a
constant `K`, independent of `N`, such that for every horizon `t` and every `δ > 0` the
configuration after `t` steps stays within `(1 + K + ⋯ + Kᵗ) δ` of the `t`-th iterate of the
explicit mean-field map, except on an event of probability at most `2 t |S| e^{−Nδ²/2}`.
The exponent constant is weakened from the source's `2Nδ²` to `Nδ²/2` (a sub-Gaussian
chord bound in place of Hoeffding's lemma) and the prefactor doubled (two tails per
coordinate); neither affects the `1/√N` rate downstream.
The iterate must be that of the **explicit** map at the system's exact activation fraction
`⌊αN⌋ / N`: a map merely characterised on the configurations of the `N`-agent system leaves
the lattice after one step, where the characterisation says nothing. The error amplifies
geometrically in `t` because each step's deviation is transported by the (Lipschitz) explicit
map, while the per-step failure probability is the Hoeffding bound for `N` conditionally
independent indicators. -/
theorem rmab_multi_step_concentration
(P0 P1 : Matrix S S ℝ) (hP0 : IsTransitionMatrix P0) (hP1 : IsTransitionMatrix P1)
(ν : S → ℝ) (hν : Function.Injective ν) (α : ℝ) (hα : 0 < α) (hα1 : α < 1) :
∃ K : ℝ, 0 ≤ K ∧
∀ (N : ℕ), 0 < N →
∀ (π : (Fin N → S) → (Fin N → Bool) → ℝ),
IsIndexPolicy ν ⌊α * (N : ℝ)⌋₊ π →
∀ (s0 : Fin N → S) (t : ℕ) (δ : ℝ), 0 < δ →
∑ s ∈ Finset.univ.filter (fun s : Fin N → S =>
(∑ j ∈ Finset.range (t + 1), K ^ j) * δ ≤
supNorm (fun x => configuration s x
- meanFieldIterate
(meanFieldMap P0 P1 ν ((⌊α * (N : ℝ)⌋₊ : ℝ) / (N : ℝ)))
t (configuration s0) x)),
rmabLaw P0 P1 π s0 t s
≤ 2 * (t : ℝ) * (Fintype.card S : ℝ)
* Real.exp (-(N : ℝ) * δ ^ 2 / 2) := by
sorry
/-! ### M6 — Lemma 11, local stability (Gast, Gaujal and Yan) -/
end MarkovEntanglementRead-back
What the Lean code literally says, in plain math · claude-opus-5
Fix a finite type of states with decidable equality (nothing forces to be nonempty). Given
- two real matrices , each assumed to be a transition matrix, meaning every entry satisfies and every row satisfies ;
- a priority function assumed injective (distinct states get distinct priority values);
- a real number with ;
the statement asserts the existence of a real constant with , depending only on the data just listed (, , , , ) and on nothing quantified later, such that for every natural number with , for every function that is an index policy with budget (the natural-number floor of ; since this is an integer with , and when ), for every initial joint state , for every and for every real , the inequality
holds, where the ingredients are the following, all spelled out from their definitions.
" is an index policy with budget " means the conjunction of three conditions: (i) for all joint states and all action profiles , and for every (the sum ranging over all profiles); (ii) for all , if then activates exactly agents, i.e. ; (iii) for every joint state and every agent index , the marginal activation probability
equals , where for , writing for the number of agents in state and for the number of agents in strictly higher-priority states,
with denoting truncated natural subtraction (it is whenever ). Nothing in the statement asserts that such a exists for a given ; for any admitting no such the inner claim is vacuous.
is the law of the joint state after steps started deterministically at , defined recursively by if and otherwise, and , where one step is
i.e. the agents draw a joint action profile from and then move independently, agent using if activated and otherwise.
is the set of joint states satisfying
a non-strict inequality with the geometric factor on the left, the sum running over (so it has terms and equals when , since ). Here:
- is the empirical configuration (real division; is assumed);
- , a real supremum, which is when is empty;
- with activation fraction — the rounded fraction, not itself — and is the -fold composite ( being the identity, so at the comparison point is itself). The map acts on an arbitrary function (no constraint that be a probability vector is imposed by the definition) by
The right-hand side is , with and cast to reals, the constant appearing nowhere in it, and entering only through . In particular, at the right-hand side is exactly , so the claim there is that the total -mass of is ; if is empty and then there are no joint states at all, both sides are , and the whole statement is degenerate. For large the set may be empty, making the left side an empty sum equal to . The quantifier order is essential: a single must work simultaneously for all , all admissible , all starting states , all horizons , and all .
Confirmed by the mission captain (proposal self-audit).