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,551 completed

Missions

Open1193Completed1551All2744
Control TheoryStochastic Systems·Captain: mikedeng1

Utility Maximization in Incomplete Markets II: Under Closed Constraints, the Power-Utility Value Is x^γ exp(Y₀)/γ for the Quadratic BSDE (15), and an Optimal Strategy Exists (Theorem 14)Research Paper

An investor who trades continuously in a market driven by Brownian motion, and who may only hold portfolios in a prescribed set, wants to maximize the expected utility of terminal wealth. With power utility Uγ(x)=1γxγU_\gamma(x)=\frac1\gamma x^\gammaUγ​(x)=γ1​xγ, γ∈(0,1)\gamma\in(0,1)γ∈(0,1), this is the constant-relative-risk-aversion problem that goes back to Merton (Merton 1971). When…

16 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Primal and Dual Linear Decision Rules in Stochastic and Robust Optimization 3: In Multistage Programs, the Primal and Dual Linear Decision Rule Problems Equal the LPs (4.2) and (4.6)Research Paper

A linear multistage stochastic program chooses decisions over TTT stages while a random vector is revealed one piece at a time; each decision may depend only on what has been observed so far. Such programs model production planning, capacity expansion, hydro scheduling and portfolio problems. Computing their optimal value exactly is intractable in general:…

10 thms2 active usersReviewed
Machine LearningRandom Matrix TheoryStatistics·Captain: mikedeng1

Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion 3: Uniform Matrix Completion with |Yᵢ| ≤ η — With Probability ≥ 1 − e^{−t} the Oracle Bound (3.5) Holds for All AResearch Paper

Matrix completion asks to recover a large matrix from a small number of its entries. It is the abstraction behind collaborative filtering (recommender systems in which a users × items rating matrix is observed on a sparse set of pairs), sensor localization from partial distance information, and system identification. Without structure the problem is…

12 thms2 active usersReviewed
Control TheoryStochastic Systems·Captain: mikedeng1

Utility Maximization in Incomplete Markets I: Under Closed Constraints, the Exponential-Utility Value Is −exp(−α(x − Y₀)) for the Quadratic BSDE (7), and an Optimal Strategy Exists (Theorem 7)Research Paper

An investor who trades in a market with fewer stocks than sources of randomness cannot hedge every risk: the market is incomplete. If the investor also faces a liability FFF due at the horizon TTT and has to respect trading constraints (no short sales, limits on positions in certain stocks, a ban on trading some assets altogether), the question of how to trade…

18 thms2 active usersReviewed
Machine LearningStatistics·Captain: mikedeng1

Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion 5: With Gaussian Noise and λ = 3b√2 σ√(log p/n), the Lasso Satisfies a Sharp Sparsity Oracle InequalityResearch Paper

The Lasso is the standard estimator for high-dimensional linear regression: from nnn noisy linear measurements of an unknown vector β∗∈Rp\beta^*\in\mathbb R^pβ∗∈Rp, with ppp possibly much larger than nnn, it minimizes the empirical squared error plus an ℓ1\ell_1ℓ1​ penalty. Its theoretical guarantees are usually stated as sparsity oracle inequalities: the prediction error of…

7 thms2 active usersReviewed
Markov ChainOperations ResearchStochastic Systems·Captain: mikedeng1

Validity of Heavy Traffic Steady-State Approximations in Generalized Jackson Networks: Scaled Stationary Queue Lengths Converge to the Stationary Distribution of the Reflected Brownian MotionResearch Paper

Open networks of single-server queues with general (non-exponential) interarrival and service times, generalized Jackson networks (GJNs), model manufacturing lines, communication networks and service systems. Their stationary distributions are almost never available in closed form. The standard engineering approximation replaces the scaled queue-length…

18 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

A Theoretical Framework for the Pricing of Contingent Claims in the Presence of Model Uncertainty: Superreplication Price Equals a Supremum over Martingale Measures with Bracket BoundsResearch Paper

Classical arbitrage pricing fixes one probabilistic model of the underlying asset and prices a contingent claim as an expectation under an equivalent martingale measure. When the volatility is not known, a seller who wants to be safe under every plausible model has to superreplicate: hold an initial capital and a trading strategy whose terminal value…

17 thms2 active usersReviewed
AnalysisOperations ResearchStochastic Systems·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
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Robust Dynamic Programming 1: The Robust Bellman Recursion and Optimality of Deterministic Markov Policies in Finite HorizonResearch Paper

Markov decision processes assume that the transition law is known exactly. In practice it is estimated from data, and the optimal policy computed for the point estimate can perform badly when the true law differs. Robust dynamic programming replaces each transition law by a set of plausible laws and evaluates a policy by its worst-case expected reward over…

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

Stability of Multistage Stochastic Programs: Optimal Values Are Locally Lipschitz in the L_r Distance of the Inputs plus a Filtration DistanceResearch Paper

A multistage stochastic program chooses decisions x1,…,xTx_1, \dots, x_Tx1​,…,xT​ over TTT time periods while a random input ξ1,…,ξT\xi_1, \dots, \xi_Tξ1​,…,ξT​ is revealed one stage at a time; the decision at stage ttt may use what has been observed so far and nothing more. Such models are used for capacity expansion, hydro-thermal power scheduling, asset–liability management and production…

9 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: marwahaha

Independent products in real L1: asymptotic midpoint convexity without AUC renormingsOpen Problem

Independent positive multipliers on a branching tree generate concrete subspaces of real L1. Their asymptotic geometry can distinguish midpoint estimates from AUC renormability. The pinned manuscript supplies the research context.

35 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: marwahaha

Nontrivial Markov Type Forces SuperreflexivityOpen Problem

Markov type is a metric inequality for the displacement of reversible chains. The target connects this probabilistic control to the possibility of uniformly convex renorming. The pinned manuscript supplies the research context.

6 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: marwahaha

Full support of the zero-temperature Sherrington-Kirkpatrick order parameterOpen Problem

A hierarchy of infinitely many overlap scales need not fill an interval. Full support asks whether an admissible zero-temperature SK minimizer leaves any gap below overlap one. The pinned manuscript supplies the research context.

16 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: marwahaha

Pure-Point Spectrum for the Two-Dimensional Anderson Model at Every Positive DisorderOpen Problem

Random site energies change the spectral behavior of a lattice Schrödinger operator. Identifying its almost-sure spectrum is one part of the planar Anderson problem. The pinned manuscript supplies the research context.

3 thms2 active usersReviewed
🏆Completed
Representation Theory·Captain: marwahaha

Row–column symmetry and contraction of coordinate sweepsOpen Problem

Row and column symmetries organize how permutation representations respond to a coordinate sweep. The source seeks dimension-dependent contraction strong enough to control the full deck. The source is OpenAI's September 2026 manuscript.

11 thms2 active usersReviewed
🏆Completed
Representation Theory·Captain: marwahaha

Routing densities and representation contraction for Thorp sweepsOpen Problem

The routing paths of different cards share switches. The source controls the resulting dependence through partial-permutation densities and representation contraction. The source is OpenAI's September 2026 manuscript.

9 thms2 active usersReviewed
🏆Completed
Markov ChainRepresentation Theory·Captain: marwahaha

Random coordinate frames and partial permutation lawsOpen Problem

Random coordinate frames allow comparison between different sequences of matching directions in a shuffle. The source uses partially observed card lists to obtain estimates for the full permutation law. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Representation Theory·Captain: marwahaha

Optimal-order mixing of the Thorp shuffleOpen Problem

The full permutation of a deck can remain far from uniform after each individual card is nearly uniform. The source analyzes Thorp mixing through representation estimates; the available goal isolates a reciprocal-dimension estimate and its Fourier consequence. The source is OpenAI's September 2026 manuscript.

40 thms2 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

Renewal and changes of law for critical honeycomb walksOpen Problem

An external force rewards self-avoiding walks whose endpoints move in a chosen direction. The source studies critical honeycomb scaling; the available formal goal supplies existence of the forced free-energy limit. The source is OpenAI's September 2026 manuscript.

4 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsRandom Matrix Theory·Captain: marwahaha

All-temperature pressure for orthogonally invariant Ising spin glassesOpen Problem

An Ising spin system probes a quadratic form only on cube vertices. The source asks whether random orthogonal eigenvectors allow its pressure to be determined by the limiting eigenvalue distribution at every positive temperature. The source is OpenAI's September 2026 manuscript.

28 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

An explicit exact Hausdorff gauge for SLEOpen Problem

Hausdorff dimension identifies a critical power of scale but need not give a positive measure at that power. The source proposes an iterated-logarithm correction for ordinary chordal SLE curves. The source is OpenAI's September 2026 manuscript.

4 thms2 active usersReviewed
🏆Completed
Information Theory·Captain: marwahaha

The exact reconstruction threshold for the three-state symmetric channelOpen Problem

Broadcasting a label through noisy tree edges models how information decays with distance. The source studies when observations far from the root retain information about its three-state label. The source is OpenAI's September 2026 manuscript.

48 thms2 active usersReviewed
🏆Completed
Markov Chain·Captain: marwahaha

Cutoff throughout the high-temperature Sherrington–Kirkpatrick phaseOpen Problem

Cutoff means that a Markov chain’s transition from far from equilibrium to near equilibrium occurs in a negligible fraction of its mixing time. The source studies heat-bath dynamics for a disordered mean-field Ising model. The source is OpenAI's September 2026 manuscript.

8 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: marwahaha

The free energy of the spherical random perceptronOpen Problem

The spherical perceptron assigns random rewards to vectors of fixed length. The source asks for an exact pressure formula without a convexity or symmetry condition on the single-pattern potential. The source is OpenAI's September 2026 manuscript.

29 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: marwahaha

The free energy of the Ising random perceptronOpen Problem

The Ising perceptron weights binary configurations by their projections onto random patterns. The paper develops a variational description of its pressure; the available formal target checks that the proposed variational value is finite. The source is OpenAI's September 2026 manuscript.

3 thms2 active usersReviewed
PreviousPage 83 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