Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 (p. 445): the expected cost of the circuit process cannot be less than zero

Proved
MDPComplexity.CircuitValue.expCost_nonneg

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

markov-decision-processp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reduction

Let CCC be a circuit with k≥1k\ge1k≥1 triples and let MMM be the Markov decision process built from CCC in the proof of Theorem 1 (initial state: the last triple kkk; horizon kkk). Then for every policy δ(s,t)\delta(s,t)δ(s,t),

Jk(δ)=Eδ[∑t=0kc(st,δ(st,t))] ≥ 0.J_k(\delta)=\mathbb E_\delta\Bigl[\sum_{t=0}^{k}c\bigl(s_t,\delta(s_t,t)\bigr)\Bigr]\ \ge\ 0 .Jk​(δ)=Eδ​[t=0∑k​c(st​,δ(st​,t))] ≥ 0.

This is the remark "(it cannot be less)" in the proof of Theorem 1: every cost of MMM is 000 or 111, so the optimal expected cost is at most 000 exactly when it equals 000.

Formalization Note The expected cost is the sum over trajectories of the model definition, with the paper's §2 horizon convention ∑t=0T\sum_{t=0}^{T}∑t=0T​ and T=kT=kT=k.

Preamble
import Mathlib
import Definitions.Def_MDPComplexity_CircuitValue_Model
import Definitions.Def_MDPComplexity_CircuitValue_Circuit
import Definitions.Def_MDPComplexity_CircuitValue_Reduction
Formal statement
namespace MDPComplexity.CircuitValue

theorem expCost_nonneg {k : ℕ} [NeZero k] (C : Circuit k) (δ : C.toMDP.Policy) :
    0 ≤ C.toMDP.expCost (some (Circuit.lastIdx k)) δ k := by sorry

end MDPComplexity.CircuitValue
Source
Papadimitriou and Tsitsiklis, The Complexity of Markov Decision Processes, Math. Oper. Res. 12(3) (1987), p. 445, §3, proof of Theorem 1
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