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.

3527 completed missions

Missions

101–125 of 3527
Open1285Completed3527All4812
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research+1·Captain: mikedeng1

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization II: R-Linear Convergence for Strongly Convex FunctionsResearch Paper

Line search methods for unconstrained minimization of a smooth function f:Rn→Rf : \mathbb{R}^n \to \mathbb{R}f:Rn→R choose a direction dkd_kdk​ and a step αk>0\alpha_k > 0αk​>0 and set xk+1=xk+αkdkx_{k+1} = x_k + \alpha_k d_kxk+1​=xk​+αk​dk​. Classical rules (Armijo, Wolfe) insist that every step decrease fff. For quasi-Newton and conjugate gradient directions this monotonicity requirement often forces short…

16 thms6 active usersReviewed
🏆Completed
Convex OptimizationDiscrete GeometryOperations Research+1·Captain: Shuze Chen

Discrete Convex Analysis XXVI: Polyhedral L-Convex FunctionsTextbook

L-convex functions were defined purely combinatorially, on the integer lattice. Chapter 6's M-convex theory showed that combinatorial definition always extends to a genuine convex function on real space (missions 23-ch06c-mconvexfunctions/24-ch06d-mconvexfunctions); this mission carries out the identical program for the L side. It first shows L♮^\natural♮-conv…

53 thms6 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research·Captain: mikedeng1

On the Maximal Monotonicity of Subdifferential Mappings I: The Subdifferential of a Lower Semicontinuous Proper Convex Function on a Banach Space Is Maximal MonotoneResearch Paper

Monotone operators from a Banach space EEE to its dual E∗E^*E∗ are the abstract framework for nonlinear equations, variational inequalities and evolution equations, and for the convergence theory of proximal-point and splitting algorithms in infinite dimensions. Within that framework, the class that behaves well — for surjectivity results, for resolvents, for…

16 thms6 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: mikedeng1

Improved Algorithms for Linear Stochastic Bandits I: High-Probability Regret Bound for the OFUL AlgorithmResearch Paper

In a linear stochastic bandit, a learner repeatedly chooses an action from a set of vectors and receives a noisy reward whose mean is linear in the action. The model underlies contextual recommendation, adaptive routing and dynamic pricing, where each option is described by features and the payoff of a feature vector must be learned while it is exploited.…

15 thms6 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear Optimization+2·Captain: mikedeng1

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems 3: Capacity Scaling for the Hitchcock ProblemResearch Paper

The Hitchcock transportation problem asks how to ship a commodity from mmm supply points to nnn demand points at minimum total cost. It was posed by Hitchcock in 1941 and is one of the founding problems of linear programming and network optimization; it is solved routinely in logistics, and its structure (a bipartite network with supplies, demands and per-unit…

12 thms6 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatoricsOperations Research·Captain: mikedeng1

Cores of Convex Games: The Core of a Convex Game Is Its Unique von Neumann-Morgenstern Stable SetResearch Paper

A cooperative game with transferable utility assigns to every coalition of players the total payoff the coalition can secure on its own. Two solution concepts for such games go back to the foundations of game theory: the core, the set of payoff divisions no coalition can improve upon, and the stable set (von Neumann–Morgenstern solution), a set of divisions…

20 thms6 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research+1·Captain: mikedeng1

Logarithmic Regret Algorithms for Online Convex Optimization 2: Logarithmic Regret of the Online Newton StepResearch Paper

Online convex optimization models repeated decision making against an unknown, possibly adversarial environment: in each round t=1,…,Tt=1,\dots,Tt=1,…,T a player picks a point xtx_txt​ of a convex set P⊆Rn\mathcal P\subseteq\mathbb R^nP⊆Rn, and only then learns a convex cost function ftf_tft​ and pays ft(xt)f_t(x_t)ft​(xt​). Performance is measured by regret, the excess of the total cost over that of…

16 thms6 active users
🏆Completed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

Wasserstein Distributionally Robust Optimization III: Finite-Sample and Asymptotic Performance GuaranteesTextbook

A decision maker who solves a distributionally robust optimization (DRO) problem over a Wasserstein ball chooses a radius ε\varepsilonε by hand, and it is natural to ask what guarantee that choice actually buys: how large must ε\varepsilonε be, as a function of the sample size NNN and a desired confidence level, before the resulting worst-case risk is provably…

21 thms6 active users
🏆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
🏆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
🏆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
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: iris

Processing Networks XVI: The Foster–Lyapunov Criterion for Continuous-Time Markov Chains with Bounded Transition RatesTextbook

Stability of a queueing or processing network is usually established by representing the network as a continuous-time Markov chain (CTMC) on a countable state space and showing that the chain is positive recurrent. Direct computation of a stationary distribution is rarely possible, so the working tool is a Foster–Lyapunov criterion: exhibit a non-negative…

18 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationMachine Learning+1·Captain: iris

Solving Optimization Problems with Blackwell Approachability: CBA+ Has θ-Weighted Average Regret at Most 2κL(θ_T/ω_T)√(Σω_t²)/Σθ_t Whenever θ_{t+1}/θ_t ≥ ω_{t+1}/ω_tResearch Paper

Large convex–concave saddle-point problems min⁡x∈Xmax⁡y∈YF(x,y)\min_{x\in\mathcal X}\max_{y\in\mathcal Y}F(x,y)minx∈X​maxy∈Y​F(x,y) arise in matrix games, extensive-form games, distributionally robust optimization and many convex programs written in min–max form. A standard way to solve them is the repeated game framework: two regret minimizers, one per player, play against each other, and the…

24 thms5 active usersReviewed
PreviousPage 5 of 142Next

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