Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The OR Formalization Drive

A coordinated effort to formalize the mathematics of operations research in Lean 4.

Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.

4812 missions

Missions

126–150 of 4812
Open1285Completed3527All4812
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

High-Dimensional Statistics XII: An Oracle Inequality for Nonparametric Least SquaresTextbook

Regression is usually taught with a fixed parametric model: linear regression fits a ddd-dimensional coefficient vector, and the estimation error is controlled by d/nd/nd/n. Many regression problems in practice have no such finite-dimensional description — the regressor is only known to be, say, convex, monotone, or smooth, and the estimator is a least-squares fit…

9 thms6 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

High-Dimensional Statistics IX: Nuclear-Norm Regularization for Low-Rank Matrix RegressionTextbook

Many estimation problems are naturally posed over matrices rather than vectors: recommender systems (Netflix-style matrix completion), multivariate regression with correlated responses, vector autoregressive time series, and phase retrieval all reduce to estimating an unknown matrix Θ∗\Theta^*Θ∗ that is low-rank, or well approximated by one. A rank constraint…

22 thms6 active users
🏆Completed
Machine LearningProbabilityStatistics+1·Captain: mikedeng1

Foundations of Machine Learning VI: AdaBoost and Margin TheoryTextbook

Weak learning — a base classifier only slightly better than random guessing — is easy to come by; strong learning, in the PAC sense of Chapter 2, is not. Boosting is the technique that turns the first into the second: combine many weak classifiers, each trained on a reweighted version of the sample that emphasizes previously misclassified points, into a…

20 thms6 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

High-Dimensional Statistics I: Gaussian Concentration of Lipschitz FunctionsTextbook

A recurring question in high-dimensional statistics is how tightly a scalar quantity built from many random inputs concentrates around its mean, even as the number of inputs grows without bound. Two classical answers organize the whole toolkit: martingale methods, which control a sum of dependent increments one conditional step at a time, and…

9 thms6 active usersReviewed
🏆Completed
Machine LearningReinforcement LearningStatistics·Captain: mikedeng1

Foundations of Reinforcement Learning III: Structured Bandits and the Decision-Estimation CoefficientTextbook

Every algorithm in the first three chapters of Foster and Rakhlin's Foundations of Reinforcement Learning and Interactive Decision Making — ε-Greedy and UCB for the multi-armed bandit, Inverse Gap Weighting and SquareCB for contextual bandits — is a special case of the same two-step recipe: estimate a model of the world with an online regression oracle,…

10 thms6 active usersReviewed
Linear OptimizationOperations ResearchOptimization+1·Captain: ORdos

Smale's Ninth Problem: Strongly Polynomial Linear ProgrammingOpen Problem

The linear feasibility problem takes a matrix A∈Rm×nA \in \mathbb{R}^{m\times n}A∈Rm×n and a vector b∈Rmb \in \mathbb{R}^mb∈Rm and asks whether the system of mmm linear inequalities in nnn real unknowns

29 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times XI: The Cutoff Phenomenon and Lamplighter WalksTextbook

For many natural chains, convergence to stationarity is not gradual: the distance stays near its maximum for a long time and then collapses to zero in a comparatively negligible window. A deck of cards under riffle shuffles is "not at all mixed" for six shuffles and "essentially mixed" after eight. This abrupt transition is the cutoff phenomenon, discovered…

18 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times X: Martingales and Evolving SetsTextbook

Every mixing bound in Missions II–IX ultimately leaned on either coupling or the spectrum, and the spectral route demanded reversibility. Chapter 17 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) opens a third route: martingales — processes whose conditional expected increment vanishes — and the beautiful evolving-set process of Morris…

14 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times IX: The Ising ModelTextbook

The Ising model is statistical mechanics' fruit fly: spins ±1\pm1±1 on the vertices of a graph, neighbours preferring to agree, a single parameter — the inverse temperature β\betaβ — tuning the strength of that preference. Chapter 15 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) studies the Glauber dynamics for this model and exhibits, on…

17 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times V: Shuffling CardsTextbook

How many shuffles does a deck of cards need? The question created the modern theory of mixing times: Diaconis and Shahshahani's analysis of random transpositions (1981) and the Bayer–Diaconis "seven shuffles suffice" analysis of the riffle shuffle (1992) are its founding results. Chapters 8 and 16 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS,…

19 thms6 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Convex Optimization VI: Self-Concordance and the Barrier MethodTextbook

Why do interior-point methods solve convex programs in O(mlog⁡(1/ε))O(\sqrt{m}\log(1/\varepsilon))O(m​log(1/ε)) Newton steps? Nesterov and Nemirovskii's answer is self-concordance: a convex function whose third derivative is controlled by its second, ∣φ′′′(t)∣≤2 φ′′(t)3/2|\varphi'''(t)| \le 2\,\varphi''(t)^{3/2}∣φ′′′(t)∣≤2φ′′(t)3/2 along every line, admits a Newton analysis with absolute constants and no condition number —…

20 thms6 active users
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research·Captain: Shuze Chen

Bandit Algorithms XVI: Markov Decision Processes and UCRL2Textbook

The final step from bandits to reinforcement learning: actions now change the state of the world. Chapter 38 of Lattimore–Szepesvári studies online learning in an unknown Markov decision process with SSS states, AAA actions and rewards in [0,1][0,1][0,1]. The optimism principle of Mission II scales up: UCRL2 maintains confidence sets over transition kernels, solves an ext…

35 thms6 active users
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research·Captain: Shuze Chen

Bandit Algorithms VII: Lower Bounds for Finite-Armed BanditsTextbook

How well can any algorithm possibly do? Chapters 13–17 of Lattimore–Szepesvári answer with three matching impossibility results. The divergence decomposition identifies the information a policy collects: D(Pνπ,Pν′π)=∑iE[Ti(n)]D(Pi,Pi′)D(\mathbb{P}_{\nu\pi}, \mathbb{P}_{\nu'\pi}) = \sum_i \mathbb{E}[T_i(n)] D(P_i, P_i')D(Pνπ​,Pν′π​)=∑i​E[Ti​(n)]D(Pi​,Pi′​). Feeding it into the Bretagnolle–Huber inequality of Mission VI…

13 thms6 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryOperations Research+1·Captain: iris

Pancake Flipping Is Hard: Sorting by Prefix Reversals, and Deciding Whether a Stack Sorts in One Flip per Breakpoint, Are NP-HardResearch Paper

The pancake problem was posed in 1975: a stack of nnn pancakes of distinct sizes is to be sorted, smallest on top, by repeatedly inserting a spatula and flipping the pancakes above it. Mathematically the stack is a permutation of ⟦1;n⟧\llbracket 1;n\rrbracket[[1;n]] and a move is a prefix reversal. Two questions arise: the diameter f(n)f(n)f(n) of the resulting pancake network (t…

39 thms5 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: iris

Markov Decision Processes with Applications to Finance IX: Multiperiod Indifference Prices under Exponential Utility Are Given by a Backward RecursionTextbook

In a complete market every contingent claim has one arbitrage-free price, the cost of replicating it. When part of the risk sits in an asset that cannot be traded, replication fails and arbitrage arguments leave an interval of prices. Indifference pricing selects a price from the seller's preferences: the price at which an investor with a given utility…

31 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization+1·Captain: iris

Markov Decision Processes with Applications to Finance IV: A One-Period Market Has an Optimal Portfolio for Every Wealth If and Only If It Admits No ArbitrageTextbook

Every portfolio problem in discrete-time mathematical finance starts from a market model and asks two questions: is the market free of arbitrage, and does an investor with a given utility function have an optimal portfolio? The two questions are linked. If a riskless strategy with a chance of gain exists, an investor with strictly increasing utility can…

23 thms5 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: iris

Markov Decision Processes with Applications to Finance I: Under the Structure Assumption the Value Functions Solve the Bellman Equation and Every Sequence of Maximizers Is an Optimal PolicyTextbook

Sequential decisions under uncertainty appear in inventory control, portfolio choice, consumption planning and optimal stopping. The common model is the Markov Decision Model: a controller observes a state, picks an action, collects a reward, and the system moves at random to a new state. The standard solution method, backward induction, goes back to…

29 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: iris

Markov Decision Processes with Applications to Finance VII: The Multiperiod Mean-Variance Problem Has an Explicit Efficient Frontier and Optimal PortfolioTextbook

Mean-variance portfolio selection, introduced by Markowitz in 1952 (and slightly earlier by de Finetti), measures the risk of a portfolio by the variance of its return: among all portfolios that reach at least a prescribed expected return, choose one of smallest variance. The single-period problem was solved in the 1950s and is still the standard tool of…

12 thms5 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOptimization+1·Captain: iris

Markov Decision Processes with Applications to Finance III: The Stochastic Linear-Quadratic Problem Has Quadratic Value Functions and Linear Optimal Controls Given by a Riccati RecursionTextbook

A linear-quadratic (LQ) problem asks for a control that keeps a linear stochastic system close to zero at quadratic cost. It is the one model of sequential decision making under uncertainty with general Euclidean state and action spaces whose optimal value and optimal policy are known in closed form, which is why it serves as the reference model of control…

19 thms5 active usersReviewed
Operations ResearchProbabilityTheoretical Computer Science·Captain: iris

Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders: Algorithm 1 Is a (1+ln⁡q)(1 + \ln q)(1+lnq)-Competitive Rounding Scheme with Runtime O(qK)O(qK)O(qK)Research Paper

An online retailer that holds inventory in many fulfillment centres (FCs) decides, for each item of an order, where to ship it from. A linear program solved over all orders gives, for each item, a probability distribution over FCs that is right on average. The difficulty is correlation: items sent to different FCs ship in separate packages, so an order is…

22 thms5 active usersReviewed
Operations ResearchProbabilityStatistics·Captain: iris

Optimal Impact Portfolios with General Dependence and Marginals: induced order statistics equal g(U_{i:N}, V_i) in law for every N if and only if the copula is linearly interpolatingResearch Paper

An impact investor ranks NNN assets by an observable impact factor XiX_iXi​ (an ESG score, a carbon intensity) and puts weight wiw_iwi​ on the asset whose score ranks iii-th. What the portfolio earns is then driven by the vector of induced order statistics (also called concomitants) θ[X]=(θ[1:N],…,θ[N:N])\theta_{[X]} = (\theta_{[1:N]}, \dots, \theta_{[N:N]})θ[X]​=(θ[1:N]​,…,θ[N:N]​): θ[i:N]\theta_{[i:N]}θ[i:N]​ is the residual…

35 thms5 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: iris

Approximately Stationary Bandits with Knapsacks: Algorithm 1 Earns ρ+σr(σc−ρ)+\rho + \sigma_r(\sigma_c - \rho)^+ρ+σr​(σc​−ρ)+ of OPTFD\mathrm{OPT}_{FD}OPTFD​ Against Adaptive (σr,σc)(\sigma_r, \sigma_c)(σr​,σc​)-Stationary AdversariesResearch Paper

In Bandits with Knapsacks (BwK) a player repeatedly picks one of KKK actions; each choice yields a reward and consumes ddd limited resources, and play stops as soon as a budget runs out. The model covers dynamic pricing with limited inventory, ad auctions with a spending cap and crowdsourcing with a payment budget (Badanidiyuru, Kleinberg, Slivkins 2018). Its…

17 thms5 active usersReviewed
Machine LearningOperations ResearchOptimization·Captain: iris

Global Convergence of Inexact Augmented Lagrangian Method for Zero-One Composite Optimization: Under Full Row Rank and Strong Convexity, the Whole IALM Sequence Converges to a Local MinimizerResearch Paper

Binary classification, multi-label classification and rank correlation estimation all score a model by counting the samples on which a linear score has the wrong sign. The natural penalty is the zero-one loss, which is 111 on positive numbers and 000 on the rest. Support vector machines, multi-label classification and the maximum rank correlation estimator are…

23 thms5 active usersReviewed
Algorithmic Game TheoryMachine LearningOperations Research+1·Captain: iris

On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning: Mean-Based Monotonic Play Cannot Converge Almost Surely to the Nash Equilibrium of a Competitive 2×2 GameResearch Paper

No-regret algorithms such as multiplicative weights and online mirror descent are the standard model of learning agents in repeated games. A classical fact is that when two such agents play a zero-sum game, the time-average of their mixed strategies converges to a Nash equilibrium (Freund and Schapire, 1999), and in general games the average play converges…

18 thms5 active usersReviewed
Algorithmic Game TheoryBandit AlgorithmsConvex Optimization·Captain: iris

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback: Barrier Bandit Mirror Descent Reaches the Nash Equilibrium at Last-Iterate Rate O~(nT−1/2)\tilde O(nT^{-1/2})O~(nT−1/2)Research Paper

In many operations problems several decision makers act repeatedly on a shared system and see only the payoff they receive: firms setting quantities in a Cournot market observe the market price, sellers in a pricing game observe their revenue, bidders in a Kelly auction observe their allocation. None of them knows the reward functions or their gradients. Ban…

18 thms5 active usersReviewed
PreviousPage 6 of 193Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36415412
5NINickrobbins953286155
6VEvebis25800
7FIfizzyinc321725
8SHshivm17490
9SCShuze Chen9455324
10KMkmehltretter82895261

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