Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,744 missions · 1,561 completed

Missions

Open1183Completed1561All2744
🏆Completed
Combinatorics·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces IV: Control by q Points — ∫ q^{f(A_1,…,A_q,x)} dP ≤ 1/∏ P(A_i)Textbook

A recurring phenomenon in probability is concentration of measure: on a product of many probability spaces, a set of non-negligible measure has a neighbourhood that carries almost all of the mass. M. Talagrand's 1995 memoir Concentration of measure and isoperimetric inequalities in product spaces developed a systematic method — induction over the number of…

9 thms2 active usersReviewed
🏆Completed
Analysis·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces III: Penalties — Exponential Moments of the Penalized Distance f_h(A, x)Textbook

Concentration of measure in a product space ΩN\Omega^NΩN asks how much of the space lies close to a set AAA of non-negligible probability. In the simplest setting closeness is the Hamming distance: the number of coordinates of xxx that cannot be matched by a point of AAA. Talagrand's 1995 memoir in Publications Mathématiques de l'IHÉS develops a family of such…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Some Aspects of the Sequential Design of Experiments III: Optional Stopping — P(Sₙ > αn^½ for Some n₁ ≤ n ≤ n₂) < (1 − Φ(α))/(1 − Φ(α(λ^½ − 1)/(λ − 1)^½))Research Paper

Section 4 of Herbert Robbins's 1952 address Some aspects of the sequential design of experiments (Bull. Amer. Math. Soc. 58, 527–535, doi:10.1090/S0002-9904-1952-09620-8) isolates a problem that every user of significance tests meets: if the sample size is not fixed in advance, an experimenter can keep sampling until the test rejects. Robbins shows that a…

4 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables I: A Median Threshold Rule Achieves EX* ≤ 2E⁺X_τResearch Paper

In a finite stopping problem, a decision maker observes rewards one at a time and must accept one without seeing the future. A fully informed observer takes the maximum. This comparison is often called a prophet inequality. The abstract bound that an optimal stopping rule can secure at least half the expected maximum does not say how to choose a simple…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOperations ResearchTheoretical Computer Science·Captain: mikedeng1

The Weighted Majority Algorithm 6: Under the Weak Independence Condition, the Randomized Master WMR Has E(m) ≤ E(ln(w_init/w_fin))/(1−β)Research Paper

Prediction with expert advice asks a learner to predict a binary label in each of a sequence of trials, having seen the predictions of a pool of nnn prediction algorithms (the experts), and to make not many more mistakes than the best of them, with no probabilistic assumption on how the instances and labels are generated. Littlestone and Warmuth's Weighted…

3 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: dbenbenn

Erschler–Zheng: growth of periodic Grigorchuk groupsResearch Paper

This mission formalizes A. Erschler and T. Zheng, Growth of periodic Grigorchuk groups, Invent. Math. 219 (2020) 1069–1155 (doi:10.1007/s00222-019-00922-0). Page and result numbers are those of arXiv:1802.09077v2.

67 thms2 active usersReviewed
Operations ResearchOptimizationStatistics·Captain: mikedeng1

Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming: Generalized M-Estimates Converge in Distribution to the Inverse Contingent Derivative at a GaussianResearch Paper

Maximum likelihood estimates, least-squares fits and sample-average approximations of stochastic programs solve 0=fˉν(x)0 = \bar f^\nu(x)0=fˉ​ν(x), where fˉν\bar f^\nufˉ​ν averages a random integrand over ν\nuν observations. Their classical asymptotic theory rests on the implicit function theorem and needs a smooth, unconstrained problem.

10 thms2 active usersReviewed
🏆Completed
Statistics·Captain: mikedeng1

The Tight Constant in the Dvoretzky–Kiefer–Wolfowitz Inequality II: Binomial Tail Bound P(S − np > nε) ≤ exp(−nε²/(2(p + ε/3)(q − ε/3))) for 0 < ε ≤ qResearch Paper

Exponential bounds for the tails of the binomial distribution are among the most frequently used tools in probability, statistics and the analysis of algorithms: they control the number of successes in independent trials, the deviation of an empirical frequency from its mean, and, through counting arguments, the empirical distribution function itself. The…

5 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

The Theory of Queues with a Single Server: The Waiting-Time Distribution Has a Proper Limit iff E(u) < 0 or u = 0 Almost SurelyResearch Paper

The single-server queue with general independent interarrival and service times (the GI/G/1 queue) is the basic model of congestion in operations research: customers arrive at a service facility, wait if the server is busy, are served in order of arrival, and leave. The first question about any such system is whether it settles down. If customers keep…

11 thms2 active usersReviewed
🏆Completed
Dynamical SystemsStochastic Systems·Captain: mikedeng1

Subadditive Ergodic Theory 2: For Every Increasing Γ There Is a C^∞ Process with Stationary Increments and P{|y_t| ≤ Γ(t) for All Large t} = 0Research Paper

Kingman's subadditive ergodic theorem (Theorem 1 of Kingman 1973, first proved in Kingman 1968) says that for a discrete-parameter subadditive process x=(xst)x=(x_{st})x=(xst​) the ratio x0t/tx_{0t}/tx0t​/t converges with probability one and in mean. Applications in first-passage percolation, products of random matrices and longest increasing subsequences often come with a…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationOperations Research+2·Captain: mikedeng1

Linear Programming and Finite Markovian Control Problems IX: Discounted Semi-Markov Decision Processes — the Value Vector Is the Smallest Superharmonic VectorTextbook

A decision maker may choose an action whenever a system changes state, even though the time until the next change is random. Maintenance and replacement decisions are examples: a repair choice changes both the next operating state and the length of time before another choice is available. A discrete-time Markov decision model gives every decision epoch the…

6 thms2 active usersReviewed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Mean-Variance Hedging in Continuous Time: The Feedback Futures Strategy Φ(G*) Minimizes the Expected Squared Deviation of Terminal Wealth from Any Target LevelResearch Paper

A firm that will receive or deliver a quantity of a commodity, currency or security at a future date carries price risk until that date. When the asset itself cannot be traded in the meantime, the standard instrument for reducing that risk is a futures contract on a correlated asset: the firm takes a position in futures and adjusts it over time, and the…

12 thms2 active usersReviewed
AnalysisHarmonic Analysis·Captain: mikedeng1

Distribution Function Inequalities for Martingales 1: The Square Function and the Martingale Have Equivalent L^p Norms for 1 < p < ∞Research Paper

A martingale f=(f1,f2,… )f = (f_1, f_2, \dots)f=(f1​,f2​,…) is a sum fn=d1+⋯+dnf_n = d_1 + \cdots + d_nfn​=d1​+⋯+dn​ of increments that are uncorrelated with the past. For sums of independent random variables, sizes are compared through the sum of squares of the summands; for martingales the corresponding object is the square function

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Scheduling Deteriorating Jobs on a Single Processor II: If E(X_j)/α_j and α_j/[c_j(1+α_j)] Both Increase in j, the Order 1, …, N Minimizes the Weighted Expected Completion Time (Proposition 2)Research Paper

On one processor, the completion time of a job normally depends on how much work precedes it. In the model of Browne and Yechiali (1990), waiting also changes the job's own processing requirement: a job that starts later takes longer. The sequence therefore changes both when each job starts and how long subsequent jobs must wait. This matters when the goal…

6 thms2 active usersReviewed
Control TheoryStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 1: A Backward Equation Driven by a Bounded-Variation Integrator Has a Unique Adapted Solution in L¹(μ) Under Integrability AloneResearch Paper

Backward stochastic differential equations (BSDEs) prescribe a process by its terminal value rather than its initial value: the unknown VVV must be adapted to the information flow, yet must reach a given random variable YYY at the horizon TTT. They arise in mathematical finance (pricing and hedging, where YYY is a contingent claim), in stochastic control (adjoint…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Residual Life Time at Great Age 4: α₁ ≤ tF′(t)/(1 − F(t)) ≤ α₂ for t ≥ t₀ Sandwiches P{(X − t)/t ≤ x | X > t} Between Γ_{α₁}(x) and Γ_{α₂}(x)Research Paper

The residual life time of a lifetime XXX at age ttt is the remaining life X−tX - tX−t given survival past ttt. Its distribution at great age is a basic object in reliability, insurance and the statistics of extremes: excess-of-loss reinsurance prices the part of a claim above a retention level, and peaks-over-threshold methods fit a model to the observations exceeding…

4 thms2 active usersReviewed
🏆Completed
Graph TheoryOperations Research·Captain: mikedeng1

Expected Critical Path Lengths in PERT Networks: With Bundle-Independent Arc Lengths, the Mean-Length Estimate g, Fulkerson's Recursion f and the Expected Critical Path Length e Satisfy g ≤ f ≤ eResearch Paper

PERT (Program Evaluation and Review Technique) and the critical path method model a project as a directed acyclic network whose arcs are jobs and whose nodes are events; the duration of the project is the length of a longest path from the origin to the terminal. When job durations are random, the quantity a planner wants is the expected duration. Computing…

11 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Supply Chain Coordination with Contracts X: Under Forced Compliance, Options Contracts with Shares λ_l and min{λ_h, λ̂_h} Separate the Two Demand Types and Coordinate CapacityTextbook

A manufacturer launching a new product often depends on a single supplier for a critical component, and the supplier must build capacity before demand is known. The manufacturer usually knows more about demand than the supplier does: her sales force, market research and order history give her a forecast the supplier cannot verify, and she has a reason to…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Supply Chain Coordination with Contracts VIII: In the Two-Location Base-Stock Model the Linear Transfers (39)–(41) Make the Optimal Base Stocks the Unique Nash EquilibriumTextbook

In a supply chain with stock at two locations, a supplier holds inventory that replenishes a retailer, and the retailer serves customers. Each firm sets its own inventory level to minimize its own cost. The retailer bears only part of the cost of customer backorders, and the supplier bears none of the retailer's holding cost, so their incentives differ. The…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Supply Chain Coordination with Contracts III: With Effort-Dependent Demand, Buy-Backs, Quantity Flexibility and Revenue Sharing Under-Reward Effort, While a Quantity Discount Gives λΠ(q, e°)Textbook

A supplier selling through a retailer earns more when the retailer works harder at selling. Examples are a better shelf position, more knowledgeable sales staff, local advertising and keeping the display in order. These activities cost the retailer, raise demand, and usually cannot be observed or verified by the supplier, so no contract can be written on…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

Quantifying Distributional Model Risk via Optimal Transport 3: A Worst-Case Transport Plan Exists in a Locally Compact Normed Space under Growth Conditions on c and fResearch Paper

In distributionally robust modelling, a baseline probability model μ\muμ on a space SSS is distrusted, and the analyst reports the largest expected loss over every model within a budget of μ\muμ. Blanchet and Murthy (arXiv:1604.01446; Math. Oper. Res. 44(2), 2019, doi:10.1287/moor.2018.0936) measure the budget with an optimal transport cost and prove strong…

20 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

Quantifying Distributional Model Risk via Optimal Transport 2: The Worst-Case Probability of a Closed Set A Equals the Baseline Probability of Its Inflation {x : c(x, A) ≤ 1/λ*}Research Paper

A probability model μ\muμ for a risk quantity, such as the reserve process of an insurer or the path of a queue, is usually chosen for tractability or fitted to limited data, and the true law of the system is unknown. Distributional model risk asks how large a probability of interest could be if the true law were any model "close" to μ\muμ. When closeness is…

17 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Scheduling Deteriorating Jobs on a Single Processor I: Under Linear Deterioration, Sequencing by Increasing E(X_i)/α_i Minimizes the Expected MakespanResearch Paper

In classical single-machine stochastic scheduling, NNN jobs with independent random processing requirements XiX_iXi​ are processed one after another, and the makespan (the completion time of the last job) is the same for every schedule that never idles: it is X1+⋯+XNX_1+\dots+X_NX1​+⋯+XN​. Research therefore concentrated on weighted flow times and rewards. Browne and Yechiali (Ope…

6 thms2 active usersReviewed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

From Predictive to Prescriptive Analytics 1: The k-Nearest-Neighbor Predictive Prescription Is Asymptotically Optimal and ConsistentResearch Paper

Operations research has long studied the stochastic problem min⁡z∈ZE[c(z;Y)]\min_{z\in\mathcal Z}\mathbb E[c(z;Y)]minz∈Z​E[c(z;Y)]: choose a decision zzz before an uncertain quantity YYY (demand, prices, returns) is revealed. In practice the decision maker also observes covariates XXX before deciding (web-search volume before stocking a product, weather before routing a shipment) and should…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems 2: On the Non-Symmetric Uniform Simplex, the Robust Optimum Is at Least n + 1 Times the Stochastic OneResearch Paper

Many operations problems are decided in two stages: a first-stage decision is fixed before an uncertain quantity is revealed, and a second-stage (recourse) decision is chosen afterwards. Two classical ways to optimize such a problem differ in how they treat the uncertainty. Two-stage stochastic optimization minimizes the expected cost under a probability…

11 thms2 active usersReviewed
PreviousPage 89 of 110Next

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