Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 — general causal policy with arbitrary private probability space

Definition
KTaxi_Competitive_Supplement_PrivatePolicy

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

online-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitytaxi-problem

A general causal randomized policy has a private seed ω\omegaω drawn from an arbitrary probability space (Ω,μ)(\Omega,\mu)(Ω,μ), a visible-history input hhh, a current query qqq, and a response a(ω,h,q)a(\omega,h,q)a(ω,h,q). For each fixed h,qh,qh,q, the response is measurable in ω\omegaω. The types of histories, queries and responses are parameters of the definition.

The seed can contain the whole private random tape, including continuous randomness and unbounded internal memory. No future query or comparator action is supplied. On the countable integer-line histories used here, this per-history measurability gives well-defined nonnegative finite-horizon expectations. This general policy interface is separated from the taxi model for reuse.

Definition code
import Mathlib

open MeasureTheory

namespace KTaxi.Competitive.Supplement

universe u

/-- A general causal randomized policy: draw a private seed from an arbitrary probability
space, then respond to the visible history h and current query q. All private memory,
including continuous randomness and the entire random tape, can be encoded in the seed.
Measurability is required only in the private seed for each fixed h,q. -/
structure PrivatePolicy (H Q R : Type*) [MeasurableSpace R] where
  Seed : Type u
  seedSpace : MeasurableSpace Seed
  law : @Measure Seed seedSpace
  probability : @IsProbabilityMeasure Seed seedSpace law
  act : Seed → H → Q → R
  measurable_act : ∀ h q, @Measurable Seed R seedSpace _ (fun ω => act ω h q)

end KTaxi.Competitive.Supplement
Source
Christian Coester, Yichen Huang, Tze-Yang Poon, STOC 2027 submission #96 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/96.pdf, §2, PDF p. 4 (printed p. 3); Appendix A, PDF p. 17 (printed p. 16)

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