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

651–675 of 3527
Open1285Completed3527All4812
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Inequalities on Partially Ordered Spaces 3: Ornstein's d̄-Distance of Stationary Real Processes Equals ∫ω⁰dP + ∫ω⁰dQ − 2 sup{∫ω⁰dR : R ≺ P, R ≺ Q}Research Paper

Two stationary random sequences can have identical distributions at each individual time while differing in their dependence across time. Comparing only their one-time marginals therefore misses a feature relevant to stochastic-process comparison. Ornstein's dˉ\bar ddˉ measures the cost of matching two whole stationary processes: it minimizes the expected…

16 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand 3: For Any Step Scale γ, Non-Perishable AIM's Excess Cost Λ₂(T) Is Bounded by a Hitting Time and a Busy PeriodResearch Paper

A retailer who stocks a perishable or storable product each period must choose an order-up-to level without knowing the demand distribution. Worse, demand is censored: when the shelf empties, the retailer observes sales, not demand. Huh and Rusmevichientong (Math. Oper. Res. 34(1), 2009) proposed the Adaptive Inventory Management (AIM) algorithm, a…

8 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand 2: Without a Bound on y^NV, Expanding-Projection AIM Has Regret ≤ max{b,h}(T^{δ−1/2} + T^{−1/2} + (y^NV)^{1+2/δ}/T)Research Paper

A retailer who restocks a product every period must pick an order-up-to level without knowing the demand distribution. When a period ends with an empty shelf, the retailer records only its sales, so the true demand above the stock level is censored. The classical newsvendor solution, the critical fractile of the demand distribution, cannot be computed. Huh…

11 thms4 active users
🏆Completed
Linear algebraNumber TheoryTheoretical Computer Science·Captain: mikedeng1

Factoring Polynomials with Rational Coefficients II: The Basis Reduction Algorithm Terminates and Returns a Reduced Basis of the LatticeResearch Paper

A lattice is the set of integer combinations of nnn linearly independent vectors in Rn\mathbb R^nRn. Many computational problems — factoring polynomials over Q\mathbb QQ, simultaneous diophantine approximation, integer programming in fixed dimension, breaking knapsack cryptosystems, and the analysis of lattice-based cryptography — reduce to finding a good basis of…

10 thms4 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationTheoretical Computer Science·Captain: mikedeng1

Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms I: Every Uniform Multicommodity Flow Problem Has Ω(𝒮/log n) ≤ f ≤ 𝒮Research Paper

A multicommodity flow problem asks to route several commodities simultaneously through a capacitated network, each from its own source to its own sink. For a single commodity, the max-flow min-cut theorem of Ford and Fulkerson says that the largest routable flow equals the capacity of the smallest separating cut. For many commodities the natural analogue…

10 thms4 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationTheoretical Computer Science·Captain: mikedeng1

Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms IV: A Uniform Flow of Size Ω(𝒮/log n) on Paths of Length O(C_max log n/(n𝒮))Research Paper

Communication networks must route many source–destination demands through shared edges. A multicommodity flow describes how much of each demand can be carried simultaneously without exceeding an edge's capacity. In an undirected network, a cut bounds the traffic that can pass between two groups of vertices, but many commodities can interfere even when no…

8 thms4 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Shock Models and Wear Processes II: If the Probabilities of Surviving k Shocks Have Decreasing Successive Ratios, the Poisson Shock Life Distribution Is IHRResearch Paper

A component may be exposed to shocks that arrive at random times. Its chance of lasting for a given time depends both on how often shocks arrive and on how likely it is to survive successive shocks. Reliability calculations often begin with the latter, discrete sequence, while replacement and life-testing questions concern the resulting lifetime…

8 thms4 active usersReviewed
🏆Completed
Numerical AnalysisOperations ResearchProbability·Captain: mikedeng1

Multilevel Monte Carlo Path Simulation: The Multilevel Estimator Achieves Mean-Square Error Below ε² at Cost c₄ε⁻², c₄ε⁻²(log ε)² or c₄ε^(−2−(1−β)/α)Research Paper

Pricing a financial derivative, estimating a risk measure, or computing any expected functional of a stochastic differential equation (SDE) by simulation runs into two errors at once: the statistical error of averaging finitely many sampled paths, and the discretisation bias of replacing the exact SDE solution by a numerical scheme with a positive timestep.…

15 thms4 active usersReviewed
🏆Completed
Dynamical SystemsOperations ResearchProbability+1·Captain: mikedeng1

Subadditive Ergodic Theory 5: For a Stationary Sequence in a Banach Algebra with E(log‖Y₁‖)⁺ < ∞, n⁻¹ log‖Y₁⋯Y_n‖ Converges in [−∞, ∞)Research Paper

Products of random linear operators appear wherever a system evolves by repeated application of randomly chosen linear maps: linear recursions with random coefficients, products of random matrices in statistical physics, the growth of random dynamical systems, and population models in random environments. The basic question is the exponential growth rate of…

9 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Dynamic Pricing and Inventory Control of Substitute Products 1: Under Multinomial Logit Choice the Optimal Dynamic Prices Equalize Marginal RevenuesResearch Paper

Retailers selling several related products can change prices as inventory runs down. A sale of one product changes the stock available in later periods, while changing its price also shifts demand toward or away from the other products. Dong, Kouvelis, and Tian study these linked decisions for substitute product variates under a multinomial logit customer…

10 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Dynamic Pricing and Inventory Control of Substitute Products 2: The Optimal Unified Dynamic Price under Multinomial Logit ChoiceResearch Paper

Retailers often sell several variates of one product (colours, sizes or flavours of an otherwise identical item) from a fixed stock over a short season, with no replenishment. Customers substitute among the variates and the no-purchase option, so the price of one variate changes the demand for all of them, and the stock of each variate changes the value of…

9 thms4 active usersReviewed
🏆Completed
Dynamical SystemsOperations ResearchProbability+1·Captain: mikedeng1

Subadditive Ergodic Theory 4: Furstenberg–Kesten — for Stationary Positive Random Matrices, n⁻¹ log [Y₁⋯Y_n]_ij Converges, Independently of i and jResearch Paper

Many systems evolve by repeated multiplication by a random linear map: the state of a linear system with randomly varying coefficients, population vectors in a random environment (Leslie models whose rates change from year to year), the transfer matrices of a disordered one-dimensional medium, and the transition operators of a Markov chain in a random…

10 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationMarkov Chain+2·Captain: mikedeng1

Linear Programming and Finite Markovian Control Problems VI: Constrained Average Reward — the Limit Points of the Expected State-Action Frequencies Form the Linear Programming PolytopeTextbook

A controller of a finite Markov chain often cares about more than one long-run quantity: an inventory manager wants a high average profit while keeping the long-run fraction of stock-outs below a target; a communication network maximizes throughput subject to bounds on average delay or power. Such problems are constrained Markov decision problems: maximize…

13 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningProbability+1·Captain: mikedeng1

Asymptotic Calibration: The Regret-Balancing Randomised Forecast on the Grid {0, 1/k, …, 1} with k ≥ 1/ε² Is ε-Calibrated against Every Adaptive NatureResearch Paper

A probability forecast is useful only when its stated frequencies bear a stable relation to outcomes. If a forecaster repeatedly announces a 70% chance of rain, calibration asks whether rain occurs on about 70% of those days. This is a minimal reliability requirement for probabilistic prediction, even though calibration alone does not rank every pair of…

14 thms4 active usersReviewed
🏆Completed
AnalysisCombinatoricsFunctional Analysis·Captain: mikedeng1

Quick Approximation to Matrices and Applications II: Every Square-Integrable f on [0,1]² Is a Sum of at Most 1/ε² Cut Functions plus an Error of Cut Norm at Most ε‖f‖₂Research Paper

A large matrix, or a large graph, can be approximated in a weak but useful sense by a short sum of very simple pieces. Frieze and Kannan (Combinatorica 19 (1999) 175–220) proved that every real matrix is, up to an error small in the cut norm, a sum of at most 1/ϵ21/\epsilon^21/ϵ2 cut matrices (constant on a combinatorial rectangle, zero elsewhere). This "weak…

5 thms4 active usersReviewed
🏆Completed
Graph TheoryMarkov ChainProbability·Captain: mikedeng1

Geometric Bounds for Eigenvalues of Markov Chains 1: Poincaré Inequality β₁ ≤ 1 − 1/κ for Reversible Chains via Path Lengths |γ_xy|_QResearch Paper

The rate at which a finite Markov chain approaches equilibrium depends on its eigenvalues. For a reversible chain, an upper bound on the second largest eigenvalue gives a lower bound on the spectral gap, which is one of the quantities used to study relaxation toward stationarity. Diaconis and Stroock asked how to estimate this eigenvalue using the geometry…

11 thms4 active usersReviewed
🏆Completed
CombinatoricsLinear algebraTheoretical Computer Science·Captain: mikedeng1

Quick Approximation to Matrices and Applications I: Every Real Matrix Is a Sum of at Most 1/ε² Cut Matrices plus an Error W with |W(S,T)| ≤ ε√(|S||T|)‖A‖_FResearch Paper

Many dense combinatorial optimization problems (Max-Cut, graph bisection, quadratic assignment on dense instances) have objective functions that are sums of matrix entries over rectangles S×TS\times TS×T. If a matrix can be replaced by a simple surrogate that agrees with it on every rectangle up to a small error, such problems can be solved approximately on the…

5 thms4 active usersReviewed
🏆Completed
Functional AnalysisMarkov ChainProbability·Captain: mikedeng1

Logarithmic Sobolev Inequalities for Finite Markov Chains 1: Chi-Square Distance ‖h_t^x − 1‖₂ ≤ e^{1−c} at t = (2α)⁻¹ log log(1/π(x)) + c/λResearch Paper

A finite Markov chain repeatedly applies a transition rule to move among a finite set of states. Its stationary distribution is a probability law that the transition rule leaves unchanged. For algorithms that sample from a target distribution, and for random walks used to model a system, a central question is how long a chain started from one state takes to…

14 thms4 active usersReviewed
🏆Completed
Computational GeometryDiscrete GeometryTheoretical Computer Science·Captain: mikedeng1

An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions: Priority Search in a BBD-Tree Visits at Most ⌈1 + 6d/ε⌉^d Leaf CellsResearch Paper

Nearest neighbor searching asks for a data structure that stores nnn points S⊂RdS\subset\mathbb R^dS⊂Rd and, given a query point qqq, returns a point of SSS closest to qqq. It underlies classification, vector quantization, data compression, pattern recognition and similarity search in databases. In dimension d≥3d\ge 3d≥3, exact methods either use space growing like …

8 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

An Introduction to Timetabling 1: Every Class–Teacher Requirement Matrix Has a Timetable over Any p Days with Every Daily Load and Pair Count Between ⌊r/p⌋ and ⌈r/p⌉Research Paper

School and university timetabling is one of the oldest applications of combinatorial optimization. In his invited review An introduction to timetabling (European Journal of Operational Research, 1985), D. de Werra opens with the class–teacher model: classes meet teachers for a prescribed number of one-period lectures, and the lectures must be placed into…

8 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatoricsMechanism Design·Captain: mikedeng1

Strategy-Proofness and Arrow's Conditions 1: A Strict Voting Procedure with at Least Three Possible Outcomes Is Strategy-Proof Iff It Is DictatorialResearch Paper

A committee that chooses one alternative by voting would like a voting procedure under which no member can gain by misreporting their preferences. Such a procedure is called strategy-proof. Gibbard (Econometrica 41, 1973) and Satterthwaite (J. Econ. Theory 10, 1975) proved independently that, once at least three outcomes are possible, the only…

12 thms4 active usersReviewed
🏆Completed
Functional AnalysisProbability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces XIV: Sums of Vector-Valued Independent Random Variables — a Tail Bound for ‖Σ ε_i X_i‖Textbook

Many limit theorems of probability in Banach spaces, among them the strong law of large numbers and the law of the iterated logarithm for vector-valued random variables, reduce to sharp estimates of the tail probability

6 thms4 active usersReviewed
🏆Completed
Computational GeometryOperations ResearchProbability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces XII: The Euclidean Traveling Salesman Problem — P(|L_N − M| ≥ t) ≤ K e^{−t²/K} for N Uniform Points in the SquareTextbook

The Euclidean traveling salesman problem asks for the shortest closed route through a finite set of points in the plane. Even when the points are placed independently and uniformly in a square, finding an individual shortest route is computationally difficult. A separate probabilistic question is whether the optimal length varies much from one random sample…

7 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability+1·Captain: mikedeng1

Some Aspects of the Sequential Design of Experiments II: Staying on Heads and Switching on Tails Loses at Most 3 − 2√2 per Toss in the Long RunResearch Paper

In 1952 Herbert Robbins asked how a statistician should draw a sample sequentially from two populations when the goal is the largest possible expected total, not a test or an estimate after the fact (Robbins 1952). This is the problem now called the two-armed bandit, and Robbins' paper is the usual starting point of the multi-armed bandit literature that…

12 thms4 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Random Walks in a Random Environment 4: For Z_n = σ_n(1 + Z_{n−1}) with i.i.d. σ_n ≥ 0, (Z_1 + ⋯ + Z_n)/n → Eσ/(1 − Eσ) a.s. if Eσ < 1, and → ∞ if Eσ ≥ 1Research Paper

A random walk in a random environment on Z\mathbb ZZ moves one step right with probability αx\alpha_xαx​ and one step left with probability 1−αx1-\alpha_x1−αx​ from site xxx, where the αx\alpha_xαx​ are themselves i.i.d. random variables. In his 1975 paper, F. Solomon (Ann. Probab. 3(1):1–31, DOI 10.1214/aop/1176996444) decided recurrence and transience of this walk and computed…

9 thms4 active usersReviewed
PreviousPage 27 of 142Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36475424
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