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.

1285 open missions

Missions

901–925 of 1285
Open1285Completed3527All4812
AnalysisOperations ResearchProbability+1·Captain: mikedeng1

Law of Large Numbers Limits for Many-Server Queues 2: The Fluid Age Measure Converges to the Equilibrium Measure (1 − G(x))dxResearch Paper

Large call centers, cloud server farms and hospital wards are modeled as many-server queues: NNN identical servers, customers arriving according to a counting process, each customer served by one server for a random time drawn from a distribution GGG, and customers who find all servers busy waiting in a first-come first-served queue. When NNN is large, the number…

13 thms2 active usersReviewed
Functional AnalysisProbabilityStochastic Systems·Captain: mikedeng1

Affine Processes on Positive Semidefinite Matrices I: Every Affine Process on the PSD Cone Is Regular and Feller, with Generator (2.12) Given by an Admissible Parameter SetResearch Paper

Matrix-valued affine processes on the cone of positive semidefinite matrices are used in finance as models of stochastic covariance: multi-asset option pricing with stochastic volatility and correlation, and fixed-income models with stochastically correlated risk factors and default intensities. The best-known example is the Wishart process of Bru (1991).…

18 thms2 active usersReviewed
Linear algebraMachine LearningStatistics·Captain: mikedeng1

Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion 4: The Estimator Never Overestimates rank(A₀), Recovers It Above a Singular-Value Gap, and Obeys a Matching Lower BoundResearch Paper

Noisy low-rank matrix completion asks to reconstruct an m1×m2m_1\times m_2m1​×m2​ matrix A0A_0A0​ from nnn noisy observations of randomly chosen entries. It is the statistical model behind collaborative filtering (recommender systems), sensor localization and system identification, and the nuclear-norm penalized least-squares estimator is its standard convex method.…

13 thms2 active usersReviewed
Numerical AnalysisProbabilityStochastic Systems·Captain: mikedeng1

A Regression-Based Monte Carlo Method to Solve Backward Stochastic Differential Equations I: Projection Errors of the Picard–Regression Scheme Accumulate AdditivelyResearch Paper

A backward stochastic differential equation (BSDE) prescribes the value of a process at a terminal time and asks for an adapted process that reaches it while following a given drift. In mathematical finance the price of a contingent claim, and its hedging strategy, solve such an equation; when the market has frictions (different borrowing and lending rates,…

9 thms2 active usersReviewed
Numerical AnalysisProbabilityStochastic Systems·Captain: mikedeng1

A Regression-Based Monte Carlo Method to Solve Backward Stochastic Differential Equations II: Simulation Error of the Empirical Regression Scheme in the Number of PathsResearch Paper

Backward stochastic differential equations (BSDEs) describe the price and the hedge of a contingent claim in models with nonlinear pricing rules (differential interest rates, funding costs, reflected or constrained claims), and give probabilistic representations of semilinear parabolic PDEs (El Karoui, Peng and Quenez, 1997). Their numerical solution in…

9 thms2 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Random Graphs with a Given Degree Sequence 5: Uniform Random Graphs with Degree Scaling Limit f in the Interior Converge a.s. to the Graph Limit e^{g(x)+g(y)}/(1+e^{g(x)+g(y)})Research Paper

A standard way to build a random network with a prescribed degree sequence is to choose a graph uniformly at random from the set of all simple graphs with that degree sequence. The model arises in testing whether the exponential family with the degree sequence as sufficient statistic fits network data, in simulating networks with given degrees, and, for…

14 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

Random Graphs with a Given Degree Sequence 4: A Continuum Erdős–Gallai Condition Characterizes the Interior of the Set of Degree-Sequence Scaling LimitsResearch Paper

A uniformly random simple graph with a prescribed degree sequence is a basic null model in network science, statistics and combinatorics: it is what a network "looks like" when nothing but its degrees is known. Chatterjee, Diaconis and Sly (arXiv:1005.1136, Ann. Appl. Probab. 2011) show that when the normalized degree sequences converge to a limiting…

10 thms2 active usersReviewed
Numerical AnalysisOptimizationProbability·Captain: mikedeng1

A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization: With Fixed Sampling Radius ε, Gradient Sampling Almost Surely Stops at or Clusters at a Clarke ε-Stationary PointResearch Paper

Many objective functions in engineering and statistics are nonsmooth and nonconvex: the spectral abscissa of a parametrized matrix, the largest eigenvalue of a symmetric matrix function, the H∞H_\inftyH∞​ norm of a closed-loop system, or a maximum of finitely many smooth functions. Such functions are typically differentiable almost everywhere, yet their…

14 thms2 active usersReviewed
Numerical AnalysisProbabilityStochastic Systems·Captain: mikedeng1

A Numerical Scheme for BSDEs: The Step-Process Scheme Converges in L² at Rate |π| log(1/|π|), and at Rate |π| for L¹-Lipschitz or Markovian Terminal Values (Theorem 6.1)Research Paper

A backward stochastic differential equation (BSDE) prescribes the terminal value of a process instead of its initial value. Pardoux and Peng (1990) proved that a BSDE with Lipschitz driver has a unique adapted solution. Coupled with a forward diffusion it gives a forward–backward SDE (FBSDE), which represents the solution of a semilinear parabolic PDE…

19 thms2 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Linearly Parameterized Bandits 4: For Finitely Many Arms, the Uncertainty Ellipsoid Policy Has Regret at Most a₆|U|‖z‖ + a₇|U| Σᵤ min{log T/Δᵘ(z), TΔᵘ(z)}Research Paper

In a linearly parameterized bandit, the expected rewards of many arms are driven by a small number of unknown parameters. Each arm is a vector u∈Rru \in \mathbb R^ru∈Rr, and its expected reward is the inner product u′Zu'Zu′Z with an unknown parameter vector ZZZ. Problems of this kind arise in marketing and revenue management, where each product is described by rrr features…

12 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Optimal Aggregation of Classifiers in Statistical Learning: The Adaptive Classifier Attains the Optimal Fast Rate up to a Logarithmic Factor Simultaneously on All Classes (Theorem 3)Research Paper

Binary classification asks for a rule that predicts a label Y∈{0,1}Y\in\{0,1\}Y∈{0,1} from a feature vector X∈RdX\in\mathbb R^dX∈Rd, given nnn labelled examples. A classical way to measure how hard this is, due to Mammen and Tsybakov (1999), treats classification as the estimation of a set, the region where label 111 is more likely, and asks how fast the excess misclassification…

19 thms2 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

The Diameter of a Scale-Free Random Graph: For m ≥ 2, Almost Every G_mⁿ Is Connected with Diameter Between (1−ε) log n/log log n and (1+ε) log n/log log nResearch Paper

Barabási and Albert (Science 1999) proposed preferential attachment as a mechanism behind the heavy-tailed degree distributions observed in the web graph and other networks: vertices arrive one at a time and attach to existing vertices with probability proportional to their degree. Empirical work on such networks reported that typical distances are very…

15 thms2 active usersReviewed
Linear algebraOptimizationProbability+1·Captain: mikedeng1

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization 2: Nearly Isometric Random Maps Have δ_r ≤ δ with Probability 1 − e^(−c₁p) Once p ≥ c₀r(m+n)log(mn)Research Paper

Many problems in system identification, collaborative filtering, low-dimensional embedding and model reduction ask for the matrix of least rank in an affine space. Affine rank minimization — given a linear map A:Rm×n→Rp\mathcal A:\mathbb R^{m\times n}\to\mathbb R^pA:Rm×n→Rp and b∈Rpb\in\mathbb R^pb∈Rp, find a matrix of minimum rank with A(X)=b\mathcal A(X)=bA(X)=b — is NP-hard in general.…

9 thms2 active usersReviewed
AlgebraAlgebraic GeometryConvex Optimization+1·Captain: mikedeng1

Semidefinite Programming Relaxations for Semialgebraic Problems 1: A Polynomial System Has No Real Solution if and only if Its Degree-d Positivstellensatz SDP Is Feasible for All Large dResearch Paper

Deciding whether a system of real polynomial equations, inequations and inequalities has a solution is the basic feasibility question behind nonconvex quadratic programming, polynomial optimization, robustness analysis in control, and combinatorial relaxations. Over the complex numbers, Hilbert's Nullstellensatz turns infeasibility into an algebraic…

13 thms2 active usersReviewed
Control TheoryFunctional AnalysisNumerical Analysis+1·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method V: Local Superlinear Convergence in L² under a Norm GapResearch Paper

Optimal control problems with pointwise bounds on the control, such as

9 thms2 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Linearly Parameterized Bandits 1: On the Unit Sphere with a Gaussian Prior, Every Policy Has Bayes Risk at Least 0.006·r√TResearch Paper

In a linearly parameterized bandit, a decision maker repeatedly chooses an arm uuu from a set Ur⊂Rr\mathcal U_r \subset \mathbb R^rUr​⊂Rr and observes a noisy reward whose mean is the inner product u′Zu'Zu′Z with an unknown parameter vector ZZZ. The model covers pricing, assortment and recommendation problems in which arms are described by feature vectors and the number of arms…

7 thms2 active usersReviewed
AnalysisControl TheoryDynamical Systems·Captain: mikedeng1

Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions 2: Under the Small Gain Condition Γ_μ ≱ id, an Ω-Path ExistsResearch Paper

A large control system is often built from many subsystems Σ1,…,Σn\Sigma_1,\dots,\Sigma_nΣ1​,…,Σn​, each of which is input-to-state stable (ISS) with respect to the states of the others. Whether the interconnection is again ISS is decided by a small gain condition on the matrix of interconnection gains. For two subsystems this goes back to Jiang, Teel and Praly (1994) and…

18 thms2 active usersReviewed
Control TheoryOperations ResearchProbability+1·Captain: mikedeng1

On Minimizing the Ruin Probability by Investment and Reinsurance I: An Increasing Solution f of the HJB Equation Is Bounded, δ(u) = f(u)/f(∞), and the Feedback Strategy A*, b* Is OptimalResearch Paper

An insurance company that collects premiums and pays random claims is ruined when its surplus becomes negative. The probability of ultimate ruin is the classical solvency criterion of risk theory, going back to Lundberg and Cramér. Real insurers have two levers on this probability: they can invest part of the surplus in a risky asset, and they can cede part…

12 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 1: Infinite Source Poisson Input Under Slow Growth Converges (fidi) to Totally Skewed α-Stable Lévy MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that the amount of data offered to a link is bursty on every time scale and that the lengths of transmissions (file sizes, connection durations) have heavy, regularly varying tails. Two families of approximations for the cumulative input were proposed: fractional Brownian motion, which has…

12 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

Graph Minors XXIII. Nash-Williams' Immersion Conjecture: In Every Infinite Sequence of Finite Graphs, Some Graph Is Immersed in a Later OneResearch Paper

A well-quasi-order is a reflexive, transitive relation in which every infinite sequence x1,x2,…x_1,x_2,\dotsx1​,x2​,… contains a pair i<ji<ji<j with xi≤xjx_i\le x_jxi​≤xj​. Showing that a class of finite combinatorial objects is well-quasi-ordered by a containment relation is a standard way to prove that every property closed under that containment is characterised by finitely many…

12 thms2 active usersReviewed
Algorithmic Game TheoryMachine LearningProbability·Captain: mikedeng1

A Simple Adaptive Procedure Leading to Correlated Equilibrium 1: Under Regret-Matching (2.2), the Empirical Distributions of Play Converge Almost Surely to the Set of Correlated EquilibriaResearch Paper

A correlated equilibrium (Aumann 1974) is a probability distribution over strategy profiles of a game such that no player gains by deviating from a recommended strategy, given the recommendation. It is the solution concept of choice when players can condition on common signals, and its set is a convex polytope defined by linear inequalities, which makes it…

17 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Consistent Nonparametric Regression II: Nearest-Neighbor Weights with Vanishing Coefficients Are Consistent for Every Distribution of X (Theorem 2)Research Paper

Nonparametric regression estimates the regression function x↦E(Y∣X=x)x \mapsto E(Y \mid X = x)x↦E(Y∣X=x) from i.i.d. observations (X1,Y1),…,(Xn,Yn)(X_1, Y_1), \dots, (X_n, Y_n)(X1​,Y1​),…,(Xn​,Yn​) without assuming a parametric form. The simplest such estimates are local averages: to predict at a point XXX, average the responses YiY_iYi​ of the sample points closest to XXX. Nearest neighbor rules of this kind go back to…

8 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 4: The Density of V_1 under PD(α, θ) Is Determined by the PD(α, α + θ) Law of V_1Research Paper

A random discrete distribution is a random sequence of frequencies V1≥V2≥⋯≥0V_1 \ge V_2 \ge \cdots \ge 0V1​≥V2​≥⋯≥0 with ∑nVn=1\sum_n V_n = 1∑n​Vn​=1. Such sequences model the relative sizes of species in a large population, of allele classes in population genetics, of cycles of a random permutation, of prime factors of a random integer, and of the excursion intervals of a Brownian motion…

13 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

The Two-Parameter Poisson–Dirichlet Distribution Derived from a Stable Subordinator 3: Moments E_{α,θ}(V_n^p) of the n-th Largest PD(α, θ) Frequency as One Integral of φ_α and ψ_αResearch Paper

Random discrete distributions — a random sequence of nonnegative frequencies V1≥V2≥…V_1\ge V_2\ge\dotsV1​≥V2​≥… summing to one — model the relative sizes of species in a population, of cycles in a random permutation, of excursion intervals of a Markov process, and of clusters in Bayesian nonparametric models. The two-parameter Poisson–Dirichlet law …

10 thms2 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 3: A Linear Backward-Forward System with Lipschitz Constant 1 Has No Solution on a Horizon T ≥ 1Research Paper

A forward equation evolves from an initial random value, while a backward equation is constrained by a terminal random value. When the two unknown processes appear in both equations, these boundary conditions can be incompatible. Such coupled systems occur in stochastic control, where a state moves forward and a cost or adjoint variable is determined…

8 thms2 active usersReviewed
PreviousPage 37 of 52Next

Top contributors

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