Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
🏆Completed
Combinatorics·Captain: mikedeng1

Bounded Relative Boundary Implies Narrow DNF ApproximationResearch Paper

A Boolean function records a yes-or-no property of a collection of binary coordinates. In sparse random structures, acceptance can have a short witness without being determined by a small fixed set of coordinates. A triangle in a random graph, for example, is certified by its three edges, although it can occur at many locations. This distinction matters in…

22 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: Shuze Chen

Robust Analysis of First-Price Auctions with Large SupplyResearch Paper

Auctions that sell many identical units to many bidders, such as treasury bills, emission permits and advertising slots, are often run as multi-unit first-price auctions: the highest bids win and each winner pays its own bid. Bidders then shade their bids below their values. In equilibrium, a bidder with a higher value can lose to one with a lower value, so…

18 thms4 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

Linear Hashing Is PoissonesqueResearch Paper

Hashing assigns a collection of objects to bins. Expected bin loads matter when the cost of an assignment depends on unusually crowded bins, or when nearly empty groups signal uneven coverage. A linear hash function assigns binary vectors using a matrix over the two-element field. Such maps have a concise algebraic description, but their outputs are…

26 thms4 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Approximate Counting of kkk-Paths in O∗(2k)O^*(2^k)O∗(2k) TimeResearch Paper

A directed kkk-path in a directed graph is an ordered tuple (v1,…,vk)(v_1,\dots,v_k)(v1​,…,vk​) of pairwise distinct vertices in which every consecutive pair (vi,vi+1)(v_i,v_{i+1})(vi​,vi+1​) is an arc. Deciding whether a kkk-path exists is a benchmark problem of parameterized algorithms, while counting kkk-paths exactly is #W[1]-hard for directed and undirected graphs (Flum–Grohe 2004). Approximate…

46 thms4 active usersReviewed
🏆Completed
Graph TheoryInformation Theory·Captain: mikedeng1

Entropy-Weighted Soundness for Multi-Answer Birthday GraphsResearch Paper

A collection of small partial assignments can encode a complete satisfying assignment: retain every restriction of that assignment to a fixed number of coordinates. The converse question asks whether a comparably large collection of local assignments can be densely compatible when no global assignment satisfies most constraints. This question concerns the De…

34 thms4 active usersReviewed
🏆Completed
CombinatoricsMarkov Chain·Captain: mikedeng1

Transposition achieves OPT+O(1) in polynomial time for IID list updateResearch Paper

A linked list charges for how far an item lies from its front. When requests repeatedly favor a few items, placing those items first can substantially reduce search cost. The IID list update problem asks how a list can organize itself when requests are independent samples from a fixed, unknown probability vector. Recording estimates of every request…

19 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Persuasion by PartsResearch Paper

An information designer may know the distribution of a system's total benefit while each observer sees only one contribution. A supplier can grade its own component; a regional office can evaluate its own market. A receiver combines these reports before deciding whether the total justifies action. The designer can commit to reporting rules in advance, but…

16 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: iris

Markov Decision Processes with Applications to Finance VIII: The Binomial Mean-Risk Problem with Average-Value-at-Risk Has an Explicit Value and a Stationary Optimal PolicyTextbook

Markowitz's mean-variance criterion measures the risk of a portfolio by the variance of its terminal wealth. The variance penalizes gains and losses alike, which is one of its drawbacks as a measure of risk. The axiomatic theory of coherent risk measures (Artzner, Delbaen, Eber and Heath, 1999) replaced it in much of risk management by quantities that look…

13 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: iris

Markov Decision Processes with Applications to Finance XI: Contracting Models Satisfy Value Iteration, Have a Unique Fixed Point and an Optimal Stationary PolicyTextbook

Infinite-horizon Markov Decision Processes with discounted rewards are the standard model for sequential decisions under uncertainty in operations research, economics and finance: inventory and cash management, consumption and investment, dividend payout, replacement and maintenance. Whether the problem has a usable solution depends on two questions. Is the…

12 thms4 active usersReviewed
🏆Completed
Information Theory·Captain: iris

From Classical to Quantum Shannon Theory X: The Private Information of Classical Wiretap Channels Is AdditiveTextbook

A dynamic information measure assigns a number to a channel rather than to a fixed random variable: the largest amount of some kind of correlation that one use of the channel can create. Such a measure is useful as a capacity formula only if it is additive, meaning that the value for two independent channels used together equals the sum of the individual…

20 thms4 active usersReviewed
🏆Completed
Information Theory·Captain: iris

From Classical to Quantum Shannon Theory XX: Feedback Does Not Increase the Capacity of a Classical ChannelTextbook

A sender who could watch the receiver's screen while transmitting would seem to have an advantage: after each channel use the sender knows exactly which symbol arrived and could adapt the next input to correct errors. Feedback of this kind does help in practice (it simplifies coding schemes and improves error exponents), and it does increase the capacity of…

25 thms4 active usersReviewed
🏆Completed
Information Theory·Captain: iris

From Classical to Quantum Shannon Theory XIII: Shannon’s Channel Capacity Theorem: C(N)=max⁡pXI(X;Y)C(\mathcal N) = \max_{p_X} I(X;Y)C(N)=maxpX​​I(X;Y)Textbook

A classical channel is the simplest model of a noisy communication link: a sender feeds a letter xxx into it and the receiver sees a letter yyy drawn at random according to a fixed conditional distribution pY∣X(y∣x)p_{Y|X}(y|x)pY∣X​(y∣x). Telephone lines, storage media and radio links are modelled this way, and the question of how fast information can be sent through such a link…

24 thms4 active usersReviewed
🏆Completed
Information Theory·Captain: iris

From Classical to Quantum Shannon Theory XII: Shannon Compression: The Entropy Is the Smallest Achievable RateTextbook

How many bits per symbol does it take to store the output of a random source so that it can be recovered with vanishing error? Shannon answered this in 1948: the entropy of the source, and no fewer (Shannon 1948). The answer is the first operational meaning of entropy, and every later coding theorem in classical and quantum information theory, channel…

12 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: iris

Cloud Cost Optimization: Model, Bounds, and Asymptotics: The Newsvendor Policy π* Has Optimality Gap at Most √θ Times the Bound (14), So It Is Asymptotically Optimal as Demand Scales by θResearch Paper

Cloud providers sell computing capacity in two ways: reserved resources, paid for every period whether used or not, and on-demand resources, rented one period at a time at a higher price. A firm that runs a stream of computing jobs with deadlines must decide how much capacity to reserve once, how much to rent each period, and which job runs on which…

48 thms4 active usersReviewed
🏆Completed
Machine LearningOperations Research·Captain: iris

Learning Optimal Forecast Aggregation in Partial Evidence Environments: A Prior-Aware Aggregator Learns the Bayes-Optimal Forecast with O~(nσ−1T)\tilde O(n\sigma^{-1}\sqrt{T})O~(nσ−1T​) Regret in a Dynamic EnvironmentResearch Paper

Weather services, medical teams and forecasting platforms routinely receive several probability forecasts for the same binary event and must combine them into one. When the forecasters are Bayesian and their information overlaps, simple rules such as averaging are not optimal: two experts who saw the same piece of evidence should not count it twice, while…

27 thms4 active usersReviewed
🏆Completed
Operations Research·Captain: iris

Taming the Long Tail: The Gambler's Fallacy in Intermittent Demand Management: the finite-horizon relative bias of the arrival-after-arrival estimate is strictly decreasing in ppp and in nnnResearch Paper

Spare parts, slow-moving retail items and humanitarian relief stock share a demand pattern: most periods see no demand, and a demand arrives only now and then. Planners of such long-tail or intermittent-demand items estimate the inter-arrival distribution from a finite observed history and feed it into an inventory policy. Bi, He and Teo (MSOM 2023) observe…

7 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation IX: Jensen and generalized Edmundson–Madansky bounds sharpen on every partition of the support boxTextbook

In a two-stage stochastic linear program the objective contains the expected recourse Q(x)=Eξ[Q(x;T(ξ),h(ξ))]\mathcal Q(x)=\mathbb E_\xi[Q(x;T(\xi),h(\xi))]Q(x)=Eξ​[Q(x;T(ξ),h(ξ))], the expectation of a second-stage LP value over a random vector ξ∈Rr\xi\in\mathbb R^rξ∈Rr. For a continuous distribution this is an rrr-dimensional integral of a function that is itself defined by an optimization problem, and it…

25 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: Shuze Chen

Markov Decision Processes (Puterman) VIII: Average Optimality for Semi-Markov ModelsTextbook

A controller may make decisions whenever a machine fails, a customer arrives, or a service finishes. The time between two decisions then depends on the state and the chosen action. Counting decisions alone does not measure elapsed operating time: a policy earning a large reward per decision may spend so long between decisions that its reward per unit time…

7 thms4 active usersReviewed
🏆Completed
Analysis·Captain: WillR

Financial Derivatives II: One-Period Arbitrage, Complete Replication and Risk-Neutral PricingTextbook

The absence of arbitrage is the central economic reason that a derivative's value can be inferred from a trading strategy. In a one-period market with two possible terminal stock prices, holdings in the stock and a risk-free cash account can reproduce every contingent claim. The holdings determine a unique replication cost. When stock growth lies strictly…

55 thms4 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: WillR

Feynman–Kac Formula: Diffusion PDE Representation and UniquenessTextbook

The Feynman–Kac formula links solutions of parabolic partial differential equations to expectations of functionals of diffusion processes. It provides the probabilistic meaning of a differential equation containing drift, diffusion, discounting and a source term. The Feynman–Kac article presents the one-dimensional terminal-value formula and a martingale…

45 thms4 active usersReviewed
🏆Completed
Quantum InformationRepresentation Theory·Captain: mikedeng1

Estimating the spectrum of a density operator: Normalized Young Frames Y/N Converge to the Spectrum of ρ, with Large-Deviation Rate the Relative Entropy Σ s_j ln(s_j/r_j)Research Paper

A density operator ρ\rhoρ on Cd\mathbb C^dCd describes a quantum system completely, but it cannot be read off a single copy: it has to be estimated from many identically prepared copies. Its spectrum r1≥⋯≥rd≥0r_1 \ge \dots \ge r_d \ge 0r1​≥⋯≥rd​≥0, ∑αrα=1\sum_\alpha r_\alpha = 1∑α​rα​=1, is the part of ρ\rhoρ that does not depend on a basis. It determines the entropy and purity of the state and the…

13 thms4 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Optimal Pricing with a Single Point: Closed-Form Maximin Ratio and Optimal Deterministic Price Against Regular and MHR DistributionsResearch Paper

A seller who has posted a price www for some time usually knows one number about demand: the conversion rate qqq, the fraction of customers who bought at www. Whether that single number is enough to price well, and how well, is a basic question of data-driven pricing. Allouah, Bahamou and Besbes (arXiv:2103.05611, Management Science 2023) answer it in a robust,…

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

Stochastic First-Order Methods for Average-Reward Markov Decision Processes: Stochastic Policy Mirror Descent Attains Expected Average-Cost Gap κ√(log|A|/K) + ς on Mixing AMDPsResearch Paper

Many control problems in operations research have no natural horizon and no natural discount rate: a queue, an inventory system or a communication network runs indefinitely, and what matters is the cost it incurs per period in the long run. The average-reward Markov decision process (AMDP) is the standard model for these problems (Puterman, 2014, Ch. 8).…

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

On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph: Symmetric Strategies Wait at Least (n+1)/2 + 2⁻³⁶nResearch Paper

Rendezvous search asks how two agents who cannot communicate should move so as to meet as soon as possible. Alpern posed the problem in 1976, and it became a standard topic in search games (Alpern and Gal, The Theory of Search Games and Rendezvous, 2003). Its simplest discrete version is played on the complete graph KnK_nKn​: there are nnn locations, every…

15 thms4 active usersReviewed
🏆Completed
Markov ChainReinforcement LearningStatistics·Captain: mikedeng1

Uncertainty Quantification and Exploration for Reinforcement Learning: Empirical Q-Values Are Strongly Consistent and √n(Q̂ₙ − Q) ⇒ N(0, Σ) with the Closed-Form Covariance (5)Research Paper

A reinforcement-learning agent that learns a Markov decision process (MDP) from data ends up with point estimates of the Q-values: the long-run discounted reward of taking an action in a state and acting optimally afterwards. Point estimates say nothing about their own reliability. Choosing between two actions whose estimated values differ by a small…

10 thms4 active usersReviewed
PreviousPage 7 of 62Next

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