Lemma 2.4 b) — and are monotone in
ProvedSubmodMFG.lemma_2_4_bfixed-point-theoremsgame-theorylattice-theorymean-field-gamesp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularity
Let be a complete and Dedekind super complete lattice, a topological space of strategies, a projection and a cost functional satisfying Assumptions 2.1 and 2.3. Write for the best-response set.
Then for all with ,
The maps and are therefore monotone self-maps of the complete lattice , to which Tarski's fixed point theorem applies in Theorem 2.6 a).
Differences from the source:
- encoding: cost functional J : E × L → ℝ → curried J : E → L → ℝ, J ν µ = J(ν, µ); reason: Lean convention; the same functions
- encoding: (L, ≤L) complete and Dedekind super complete lattice (Definition A.1) → CompleteLattice L with DedekindSuperComplete L: every nonempty S ⊆ L has countable C, C' ⊆ S with sSup C = sSup S and sInf C' = sInf S; reason: every subset of a complete lattice is bounded, so the boundedness proviso is void; allowing C = ∅ is equivalent (sSup ∅ = sSup S forces S = {⊥}, and C = S works)
- encoding: a subsequence (n_j) and convergence ν^{n_j} → ν (Assumption 2.1 (2)) → φ : ℕ → ℕ with StrictMono φ and Tendsto (ν ∘ φ) atTop (𝓝 ν) in the topology of E; reason: the standard encoding of subsequences and convergence
Preamble
import Mathlib import Definitions.Def_SubmodMFG_DedekindSuperComplete import Definitions.Def_SubmodMFG_argminSet import Definitions.Def_SubmodMFG_bestResponse import Definitions.Def_SubmodMFG_Assumption21 import Definitions.Def_SubmodMFG_Assumption23
Formal statement
namespace SubmodMFG
/-- **Lemma 2.4 b)** — the infimum and the supremum of the best responses
are monotone in the distribution.
Dianetti, Ferrari, Fischer, Nendel, *A Unifying Framework for Submodular Mean Field Games*,
arXiv:2201.07850v1, §2.2, Lemma 2.4 b), p.6: "Under Assumptions 2.1 and 2.3 we have that: b) For all
µ, µ̄ ∈ L with µ ≤^L µ̄, inf R(µ) ≤^L inf R(µ̄) and sup R(µ) ≤^L sup R(µ̄)."
**Formalization Note.** Standing hypotheses of §2 (pp.5–6): `L` is a complete (`CompleteLattice`) and
Dedekind super complete lattice, `E` a topological space, `p : E → L`, and `J : E → L → ℝ`
(curried, `J ν µ = J(ν, µ)`) satisfy Assumptions 2.1 and 2.3. The infimum and supremum are `sInf`/`sSup` in `L`. -/
theorem lemma_2_4_b {E L : Type*} [TopologicalSpace E] [CompleteLattice L] (p : E → L) (J : E → L → ℝ)
(hL : DedekindSuperComplete L) (h21 : Assumption21 p J) (h23 : Assumption23 p J) :
∀ μ μ' : L, μ ≤ μ' →
sInf (bestResponse p J μ) ≤ sInf (bestResponse p J μ') ∧
sSup (bestResponse p J μ) ≤ sSup (bestResponse p J μ') := by sorry
end SubmodMFG
Source
Dianetti, Ferrari, Fischer, Nendel, A Unifying Framework for Submodular Mean Field Games, arXiv:2201.07850v1, §2.2, Lemma 2.4 b), p.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.