Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.2, part 2 — T(π, a, k) is MLR-monotone in π iff πP^a is

Proved
LovejoyPOMDP.Monotone.lemma_1_2_2

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bayesian-updatelikelihood-ratio-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pomdp

Consider a finite POMDP as in §2 of the paper, with rjka>0r^a_{jk}>0rjka​>0 for all j,k,aj,k,aj,k,a. For every action a∈Aa\in Aa∈A and observation k∈Ok\in Ok∈O, the following are equivalent:

  1. T(π,a,k)≥rT(π′,a,k)T(\pi,a,k)\ge_r T(\pi',a,k)T(π,a,k)≥r​T(π′,a,k) for all π≥rπ′\pi\ge_r\pi'π≥r​π′ in Π(S)\Pi(S)Π(S);
  2. πPa≥rπ′Pa\pi P^a\ge_r\pi' P^aπPa≥r​π′Pa for all π≥rπ′\pi\ge_r\pi'π≥r​π′ in Π(S)\Pi(S)Π(S).

The Bayes update preserves the MLR order of priors exactly when the prediction step does. Together with Lemma 1.3(1) this gives the monotonicity of the posterior in the prior used in Proposition 1.

Formalization Note The equivalence relies on the standing assumption rjka>0r^a_{jk}>0rjka​>0 (a field of the model), which makes σ(k;π,a)>0\sigma(k;\pi,a)>0σ(k;π,a)>0 on Π(S)\Pi(S)Π(S).

Preamble
import Mathlib
import Definitions.Def_LovejoyPOMDP_Monotone_Model
Formal statement
namespace LovejoyPOMDP.Monotone

/-- Lovejoy, *Some Monotonicity Results for Partially Observed Markov Decision Processes*, Oper. Res. 35(5):736–743 (1987), DOI 10.1287/opre.35.5.736, pp. 738–739, Lemma 1.2, part 2.

For any `a ∈ A` and `k ∈ O`: `T(π, a, k) ≥r T(π', a, k)` for all `π ≥r π'` in `Π(S)` if and only
if `πP^a ≥r π'P^a` for all `π ≥r π'` in `Π(S)`.

**Formalization Note.** The equivalence uses the standing assumption `r^a_{jk} > 0`, which is a
field of `POMDP`. -/
theorem lemma_1_2_2 {S O A : Type*} [Fintype S] [Fintype O] [Fintype A]
    [LinearOrder S] [LinearOrder O] [LinearOrder A] [Nonempty S] [Nonempty O] [Nonempty A]
    (M : POMDP S O A) (a : A) (k : O) :
    (∀ π π' : S → ℝ, π ∈ stdSimplex ℝ S → π' ∈ stdSimplex ℝ S → MLRGE π π' →
        MLRGE (M.bayes π a k) (M.bayes π' a k)) ↔
      (∀ π π' : S → ℝ, π ∈ stdSimplex ℝ S → π' ∈ stdSimplex ℝ S → MLRGE π π' →
        MLRGE (M.predict π a) (M.predict π' a)) := by sorry

end LovejoyPOMDP.Monotone
Source
Lovejoy, Some Monotonicity Results for Partially Observed Markov Decision Processes, Oper. Res. 35(5):736–743 (1987), DOI 10.1287/opre.35.5.736, pp. 738–739, Lemma 1.2, part 2
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me