Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Analysis

363 missions · 270 completed

Missions

Open93Completed270All363
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: mikedeng1

A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games 2: The Social Optimum Cost, the Wardrop Equilibrium Cost and the Price of Anarchy Are Continuous on the Game SpaceResearch Paper

Traffic users choose routes for themselves, while a planner may choose routes that minimize everyone's combined travel cost. The price of anarchy measures the cost of the users' equilibrium relative to the planner's optimum. Travel demand and arc latency functions are estimated from data and change over time, so a ratio that changes abruptly under a small…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Lightning Network Economics: Channels III: The Minimal Cost of a Symmetric Bidirectional Channel Is 3(2Bλ/r)^{1/3} − B/6 + O(r^{1/3}) as r → 0Research Paper

Payment channels let two parties make repeated transfers while using an on-chain transaction only when a channel needs resetting. They require funds to be committed in advance. The economic choice is therefore between the transaction fees saved by using a channel and the opportunity cost of funds tied up in it. Guasoni, Huberman, and Shikhelman give a…

17 thms3 active users
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality III: The Explicit Lower Bound on the Competitive Ratio Is at Least α* Times pResearch Paper

Optimal stopping with partial information sits between two classical problems. In the secretary problem a decision maker sees values in random order, knows nothing about how they are generated, and must stop on the best one; the optimal guarantee is 1/e1/e1/e. In the i.i.d. prophet inequality the values are independent draws from a known distribution, and the…

14 thms3 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality II: The Optimal Competitive Ratio Tends to the i.i.d. Prophet Constant as p Tends to 1Research Paper

Optimal stopping with samples sits between two classical problems. In the secretary problem a decision maker sees items in random order, knows nothing about their values, and must stop on one; the best guarantee is 1/e1/e1/e. In the i.i.d. prophet inequality the values are independent draws from a known distribution, and the best guarantee against the expected…

14 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Mechanism Design under Approximate Incentive Compatibility 2: Under Local α-Power Envelopes, ε-IC Mechanisms Gain at Most Õ(ε^(α/(2α−1))) RevenueResearch Paper

Classical mechanism design assumes that agents optimize exactly: a buyer facing a menu picks the option that maximizes his utility, however small the advantage over the next-best option. In many settings this is implausible. Agents may face cognitive or computational costs, or the designer may only be able to certify incentives approximately, as in…

12 thms3 active usersReviewed
🏆Completed
Control TheoryEconomicsOperations Research·Captain: mikedeng1

Punish Underperformance with Suspension: Optimal Dynamic Contracts in the Presence of Switching Cost II: Condition 2, High Switching Cost, Not-Hiring Value Functions Meet the Optimality ConditionsResearch Paper

Firms that outsource work to an agent whose effort they cannot observe often punish poor performance by suspending the relationship for a while, even though restarting costs money: a new set-up, re-training, re-mobilisation. Cao, Sun and Tian (Management Science, 2024) study this trade-off in a continuous-time principal–agent model with Poisson arrivals and…

5 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Scores for Multivariate Distributions and Level Sets I: The L² Scoring Rules S and S′ Are Proper, With Divergence the h-Weighted L² Distance Between f_X ∗ w and f_Y ∗ wResearch Paper

A probabilistic forecast issues a whole distribution PXP_XPX​ for an uncertain quantity Y∈RdY\in\mathbb R^dY∈Rd rather than a single number: wind and wave heights at several sites, demand for several products, the joint returns of several assets. Forecasts of this kind are compared and estimated with a scoring rule S(PX,y)S(P_X,y)S(PX​,y), a number assigned to the forecast once the…

8 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios IV: The Tight Ratio 1 − e^{−α⁽¹⁾} Exceeds (1 − 1/e)σ⁽¹⁾ and the Price-Continuum RatioResearch Paper

In online matching with multiple prices, a firm sells nnn items with limited inventories to customers who arrive one at a time; each item can be offered at any price from its own finite price set, and the firm must commit to an offer without knowing future customers. Ma and Simchi-Levi (arXiv:1905.04770, Oper. Res. 2020) show that the best possible competitive…

12 thms3 active usersReviewed
🏆Completed
Dynamical SystemsStochastic Systems·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 2: With Constant Coefficients and σ₃ = 0 the Dominating ODE Has a Bounded Solution for Every T Iff F Has a Suitable Zero or Is LinearResearch Paper

A forward–backward stochastic differential equation (FBSDE) couples a forward diffusion XXX with a backward equation for a pair (Y,Z)(Y,Z)(Y,Z) whose terminal value depends on XTX_TXT​. FBSDEs are the probabilistic form of quasilinear parabolic PDEs and appear in stochastic control (the stochastic maximum principle), in mathematical finance (hedging with large investors,…

10 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamical SystemsOptimization·Captain: mikedeng1

A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights I: The ODE Ẍ + (3/t)Ẋ + ∇f(X) = 0 with X(0) = x₀, Ẋ(0) = 0 Has a Unique Global SolutionResearch Paper

Nesterov’s accelerated gradient method is a discrete procedure for minimizing a smooth convex function. Its iterates use both a gradient step and a momentum term, so the position at the next step depends on recent motion as well as on the current gradient. Su, Boyd, and Candès study a continuous-time model of that behavior: a trajectory whose acceleration…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor 1: Worst-Case Expected Shortage under Known First and αth Moments Equals That of a Regularly Varying Demand of Tail Index αResearch Paper

A newsvendor chooses an order quantity before seeing demand. Unsold units have no salvage value, while demand above the order quantity cannot be filled. If the demand law is unknown but a few moments are known, the decision maker may minimize cost against the worst distribution consistent with those moments. Das, Dhara and Natarajan study this…

12 thms3 active usersReviewed
🏆Completed
Control TheoryDynamical SystemsOperations Research·Captain: mikedeng1

Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications 1: Every Proper Solution of the Discrete-Agent Model Converges to Clusters at Least 1 ApartResearch Paper

Bounded-confidence opinion dynamics model a population in which each individual revises an opinion, represented by a real number, by looking only at opinions close to its own. The best-known example is the discrete-time model of Krause (1997), also called the Hegselmann–Krause model, in which every agent moves to the average of the opinions within distance…

6 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Semismooth and Semiconvex Functions in Constrained Optimization I: The Pointwise Maximum or Minimum over a Compact Family of Continuously Differentiable Functions Is SemismoothResearch Paper

Many objective functions in engineering design, Chebyshev approximation and game-theoretic planning are extremal-valued: they are the pointwise maximum or minimum of a family of smooth functions, E(x)=max⁡u∈Uf(x,u)E(x)=\max_{u\in U} f(x,u)E(x)=maxu∈U​f(x,u). Such a function is typically not differentiable at points where two or more members of the family are active, so gradient methods do not…

16 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Witten 1998: Anti de Sitter Space and Holography — the massive scalar boundary-value problemResearch Paper

In February 1998 Witten's paper Anti de Sitter Space and Holography made precise Maldacena's proposal that large-NNN conformal field theories in ddd dimensions are described by gravity on (d+1)(d+1)(d+1)-dimensional anti de Sitter space AdSd+1\mathrm{AdS}_{d+1}AdSd+1​. The dictionary it proposes identifies boundary values of bulk fields with sources of boundary operators, and reads…

10 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Coupling Constant II: The Beta Function in the Energy Scale and the Running DichotomyTextbook

A coupling constant is the number that fixes the strength of an interaction: in the modern formulation it is the parameter weighting the interaction part of a Lagrangian against its kinetic part. In a quantum field theory such a parameter is not constant. Probing a process at a higher energy resolves more of the virtual activity that dresses the…

12 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Verlinde 2016: Apparent Dark Matter and the Baryonic Tully-Fisher RelationResearch Paper

In emergent gravity proposals, spacetime and gravity are macroscopic descriptions of an underlying quantum system. In Verlinde (2016) it is argued that in de Sitter space (a universe with positive dark energy) the entanglement entropy has, besides the usual area-law part, a thermal volume-law part, and that matter displaces this volume-law entropy. The…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: FormallyCorrect

Ramanujan's Notebooks (Berndt)Textbook

The notebooks Ramanujan kept in India record identities, evaluations, transformations and general principles, usually presented without proofs. They preserve a working mathematician's collection rather than a textbook arranged around a sequence of prerequisite theorems. The Tata Institute of Fundamental Research published an unedited facsimile edition in…

50 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs 1: Every Cluster Point of the e-PSG Iterates Is a Lifted Stationary PointResearch Paper

A fractional program minimizes a ratio f(x)/g(x)f(x)/g(x)f(x)/g(x) over a set SSS. Nonconvex, nonsmooth ratios arise in the scale-invariant sparse signal recovery model min⁡∥x∥1/∥x∥2\min\|x\|_1/\|x\|_2min∥x∥1​/∥x∥2​ over a polyhedron, in robust Sharpe-ratio optimization in finance, and in the Rayleigh quotient x⊤Ax/x⊤Bxx^\top Ax/x^\top Bxx⊤Ax/x⊤Bx over a sphere; with g≡1g\equiv1g≡1 and S=HS=HS=H the problem reduces to composite…

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

A Primal-Dual Interior-Point Algorithm for Nonsymmetric Exponential-Cone Optimization 3: The Exponential-Cone Barrier Does Not Have Negative CurvatureResearch Paper

Interior-point methods for conic optimization are best understood on symmetric cones: the nonnegative orthant, the second-order cone and the cone of positive semidefinite matrices. On these cones the barrier functions are self-scaled, and Nesterov and Todd showed that every primal-dual pair (x,s)(x, s)(x,s) then has a unique scaling point www with s=F′′(w)xs = F''(w)xs=F′′(w)x and …

10 thms3 active usersReviewed
Linear algebraProbabilityRandom Matrix Theory·Captain: mikedeng1

User-Friendly Tail Bounds for Sums of Random Matrices V: The Matrix Azuma Inequality for Adapted Sequences with Semidefinite Bounds on the Squared DifferencesResearch Paper

Sums of random matrices appear throughout numerical linear algebra, statistics, combinatorics and quantum information: randomized sketching and sparsification, covariance estimation, graph sparsifiers, and the analysis of random features all reduce to controlling the largest eigenvalue of a sum of random self-adjoint matrices. Scalar concentration…

10 thms3 active usersReviewed
🏆Completed
Optimal Transport·Captain: marwahaha

A counterexample to the Monge ansatz for the three-marginal Coulomb costOpen Problem

An optimal coupling can exist even when no deterministic transport maps attain its cost. The target separates attainment from equality of infima for a three-marginal repulsive cost. The pinned manuscript supplies the research context.

36 thms3 active usersReviewed
🏆Completed
Discrete Geometry·Captain: marwahaha

Slope-field perturbations of the two-cylinder coveringOpen Problem

A slope-field perturbation of a two-cylinder cover trades a reduction in projected area against the extra overlap needed to maintain coverage. The slope-field manuscript studies when the net cost becomes strictly smaller. The companion radial-sweep manuscript establishes finite triangular approximation with arbitrary tagged equal subdivisions. Both…

32 thms3 active usersReviewed
🏆Completed
Discrete Geometry·Captain: marwahaha

Finite cylinder approximation of ruled setsOpen Problem

A continuously varying family of line segments suggests a low-cost cylinder cover, but a finite approximation must control both gaps and accumulated base area. The source manuscript presents the surrounding research claim.

32 thms3 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

Tree Constructions for the l1 Distortion of Binary Edit DistanceOpen Problem

Embedding edit distance into ℓ₁ would permit algorithms and geometric tools for that normed space. Distortion lower bounds quantify the loss any such representation must incur. The source manuscript presents the surrounding research claim.

70 thms3 active usersReviewed
🏆Completed
Optimal Transport·Captain: wurtle

Sharp One-Third Stability of Brenier MapsResearch Paper

Given a source probability measure ρ\rhoρ and a target μ\muμ on Rd\mathbb R^dRd, Brenier's theorem (Brenier 1991) says that when ρ\rhoρ is absolutely continuous there is a unique map TμT_\muTμ​ pushing ρ\rhoρ to μ\muμ that minimizes the quadratic cost ∫∣x−T(x)∣2 dρ\int|x-T(x)|^2\,d\rho∫∣x−T(x)∣2dρ, and that it is the gradient of a convex function. Fixing ρ\rhoρ, the assignment μ↦Tμ\mu\mapsto T_\muμ↦Tμ​ embeds…

5 thms3 active usersReviewed
PreviousPage 4 of 15Next

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