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

Missions

Open1174Completed1570All2744
🏆Completed
Markov ChainStochastic Systems·Captain: naimengye

Introduction to Stochastic Networks II: Kolmogorov's Criterion for ReversibilityTextbook

A Markov process is reversible when, in equilibrium, transitions from xxx to yyy occur at the same average rate as transitions from yyy to xxx. Algebraically this is the detailed balance condition π(x)q(x,y)=π(y)q(y,x)\pi(x)q(x,y)=\pi(y)q(y,x)π(x)q(x,y)=π(y)q(y,x), and it is the single most useful structural property a network process can have: it replaces a global linear system by one equation per pair of…

6 thms2 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: naimengye

Probability Theory and Examples VI: Donsker's TheoremTextbook

The central limit theorem says that Sn/nS_n/\sqrt nSn​/n​ converges to a normal random variable. Donsker's theorem says something much stronger: the whole rescaled path of the random walk converges to the whole path of a Brownian motion, as a random element of C[0,1]C[0,1]C[0,1].

8 thms2 active usersReviewed
🏆Completed
Markov ChainStochastic Systems·Captain: naimengye

Probability Theory and Examples III: The Markov Chain Convergence TheoremTextbook

A Markov chain forgets. Run it long enough and the distribution of its position stops depending on where it started — that is the intuition behind shuffling a deck, behind Markov chain Monte Carlo, behind PageRank, and behind the stationary analyses of every queueing model. Chapter 5 of Rick Durrett's Probability: Theory and Examples (Version 5, 2019) makes…

6 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: naimengye

Stochastic Networks V: Random Access and the Critical Rate of Backoff SchemesTextbook

When many stations share one broadcast channel, something has to decide who transmits. A token passed around the stations works when there are few of them and none is silent for long, but it scales badly and breaks if the token is lost. The alternative is to let stations transmit whenever they like and use randomness to recover from the resulting…

8 thms2 active usersReviewed
🏆Completed
Machine LearningRandom Matrix TheoryStatistics·Captain: mikedeng1

High-Dimensional Probability II: Concentration Inequalities for Sums of Independent Random VariablesTextbook

The central limit theorem tells us that a normalized sum of independent random variables converges in distribution to a Gaussian. For applications — bounding the failure probability of a randomized algorithm, controlling the error of a Monte Carlo estimator, proving a generalization bound in learning theory — a limiting distribution is not enough: what is…

7 thms2 active usersReviewed
🏆Completed
Machine LearningRandom Matrix TheoryStatistics·Captain: mikedeng1

High-Dimensional Probability I: Approximate Carathéodory's TheoremTextbook

Many arguments in high-dimensional geometry, statistics and computer science need to approximate a point of a convex set by an average of a handful of extreme points, rather than represent it exactly. The classical Carathéodory theorem (1907) answers the exact question: every point of the convex hull of a set T⊆RnT \subseteq \mathbb{R}^nT⊆Rn is a convex combination…

2 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: LG

Hairer: A Theory of Regularity Structures I — The Reconstruction TheoremResearch Paper

Several equations of mathematical physics are written down formally but have no classical meaning as stated. The dynamical Φ34\Phi^4_3Φ34​ model ∂tu=Δu−u3+ξ\partial_t u = \Delta u - u^3 + \xi∂t​u=Δu−u3+ξ on the three-dimensional torus, the KPZ equation ∂th=∂x2h+(∂xh)2−∞+ξ\partial_t h = \partial_x^2 h + (\partial_x h)^2 - \infty + \xi∂t​h=∂x2​h+(∂x​h)2−∞+ξ, and the parabolic Anderson model ∂tu=Δu+u ξ\partial_t u = \Delta u + u\,\xi∂t​u=Δu+uξ all…

13 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: burkh4rt

The Bunkbed Conjecture is FalseResearch Paper

Let G=(V,E)G=(V,E)G=(V,E) be a finite connected graph. In Bernoulli bond percolation each edge is independently retained with probability PPP and deleted otherwise, and one writes PP[u↔v]\mathbb{P}_P[u \leftrightarrow v]PP​[u↔v] for the probability that vertices uuu and vvv lie in the same component of the resulting random subgraph. Comparing such connection probabilities is a basic and…

38 thms2 active usersReviewed
🏆Completed
Machine Learning·Captain: naimengye

Speculative Actions: Cost-Latency Analysis for Agentic SpeculationResearch Paper

An LLM agent acting in an environment spends most of its wall-clock time waiting. Each step — a model call, a tool or MCP request, a browser action, sometimes a human reply — must complete before the next can be issued, and the round trips dominate end-to-end latency: a chess game between two reasoning agents runs for hours, and an operating-system tuning…

13 thms2 active usersReviewed
🏆Completed
Optimization·Captain: viratkota

Kelly's Criterion: the optimal fraction for an even-money betResearch Paper

In 1956 Kelly answered a question that looks like gambling and is really about information: if a channel gives you a noisy advance signal about a sequence of bets, how much is that signal worth? His answer was that the maximum exponential rate of growth of a gambler's capital equals the rate of transmission over the channel -- so information rate and…

4 thms2 active usersReviewed
🏆Completed
Functional AnalysisHarmonic Analysis·Captain: Elsie66

Bochner's Theorem: Positive-Definite FunctionsTextbook

Positive-definite functions sit at a crossroads of harmonic analysis, probability, and machine learning. A function f:R→Cf:\mathbb R\to\mathbb Cf:R→C is positive-definite if, for every finite family of points x1,…,xnx_1,\dots,x_nx1​,…,xn​ and complex coefficients c1,…,cnc_1,\dots,c_nc1​,…,cn​, the Hermitian quadratic form ∑i,jci‾cjf(xi−xj)\sum_{i,j}\overline{c_i}c_j f(x_i-x_j)∑i,j​ci​​cj​f(xi​−xj​) is real and nonnegative. This single…

8 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: sr

Erdős (1947): The Probabilistic Ramsey Lower BoundResearch Paper

Ramsey theory asks for the smallest number R(k)R(k)R(k) such that every graph on R(k)R(k)R(k) vertices contains either a clique of size kkk or an independent set of size kkk. Beyond being one of the oldest problems in extremal combinatorics, Ramsey numbers sit at the junction of combinatorics, probability, and computer science: the two-coloring of edges they quantify is…

5 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: Shuze Chen

Dynamic Programming and Optimal Control I: The DP AlgorithmTextbook

Dynamic programming is the backbone of stochastic optimal control, operations research, and reinforcement learning. Its cornerstone — that the backward recursion of Bellman computes the optimal cost of a finite-horizon stochastic control problem — is stated as Proposition 1.3.1 of Bertsekas, Dynamic Programming and Optimal Control, Vol. I (3rd ed., Athena…

5 thms2 active usersReviewed
🏆Completed
Markov ChainStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times XIII: Coupling from the PastTextbook

Every sampling guarantee in this series so far is approximate: run the chain for tmix(ε)t_{\mathrm{mix}}(\varepsilon)tmix​(ε) steps and the output is within ε\varepsilonε of stationarity. In 1996 Propp and Wilson showed that, astonishingly, one can often sample exactly from the stationary distribution of a chain — with no error at all and no knowledge of the mixing time —…

5 thms2 active usersReviewed
🏆Completed
Markov ChainStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times II: The Convergence TheoremTextbook

The first mission of this series established that an irreducible finite Markov chain has a unique stationary distribution π\piπ. The present mission, covering Chapters 3–4 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009), answers the two questions that make that fact useful. First, the inverse problem of sampling: given a target distribution …

14 thms2 active usersReviewed
🏆Completed
Captain: marwahaha

Sklar’s theorem for finite-dimensional probability measuresResearch Paper

Every probability measure on a finite-dimensional real space admits a copula that represents its joint distribution with its marginal distributions.

1 thm1 active userReviewed
Functional AnalysisMathematical Physics·Captain: LG

Wilson Yang-Mills ConstructionResearch Paper

Yang–Mills theory is the gauge-field framework underlying the strong and electroweak interactions. A Euclidean Yang–Mills field is a connection valued in the Lie algebra of a compact group, with action 14∫R4∥F∥2\frac14\int_{\mathbb R^4}\lVert F\rVert^241​∫R4​∥F∥2 for curvature FFF. Physically it is extremely well tested, yet constructing a four-dimensional interacting quantum…

8 thms1 active userReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 9: Applications to Optimal Stopping ProblemsTextbook

Chapter 9 of Andreas Kyprianou's introductory lectures develops optimal stopping and optimal stopping games for Lévy processes, as described in Kyprianou (2006). A stopping problem asks when an observer should exercise a reward that depends on the evolving process. Time discounting competes with the possibility of a more favourable future value. The jumps…

42 thms1 active userReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 7: Lévy Processes at First Passage and Insurance RiskTextbook

First-passage questions concern the first time a stochastic process moves beyond a fixed level and the behaviour at that crossing. For a Lévy process, the barrier may be passed by a jump or reached continuously, so distributions of crossing times, jump overshoots and the last maximum before passage have different features. These quantities are also relevant…

89 thms1 active userReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 6: The Wiener–Hopf FactorisationTextbook

A Lévy process is a stochastic process with stationary independent increments and càdlàg sample paths. Its jumps and its continuous fluctuations can each produce new record maxima. In the bounded-variation examples considered earlier in the book, these records can sometimes be indexed by an elementary counting process. In general, a process may make…

76 thms1 active userReviewed
Machine LearningTheoretical Computer Science·Captain: mikedeng1

Sketching Language Models for Context AttributionResearch Paper

Context attribution asks how parts of a prompt affect a chosen measurement of a language model's output. For a prompt with nnn tokens, leave-one-out attribution records the measurement after deleting each token individually. Direct evaluation takes nnn model calls. Liaw, Mehta, Velegkas and Zhou study when all these values can be estimated with fewer calls,…

20 thms1 active userReviewed
Convex OptimizationMachine LearningOptimization+1·Captain: Shuze Chen

Bias-Reduced and Parallel Heavy-Tailed Stochastic Convex Optimization in ℓp\ell_pℓp​ GeometriesResearch Paper

Stochastic convex optimization (SCO) asks for an approximate minimizer of a convex function that can only be probed through noisy subgradients. Two features of modern instances are not captured by the textbook Euclidean, bounded-variance setting. First, the natural geometry is often an ℓp norm with p>2p>2p>2: the feasible region is an ℓp ball and the Lipschitz…

15 thms1 active userReviewed
Operations ResearchOptimization·Captain: mikedeng1

Random-Order Online Facility Location Beyond Uniform Opening CostsResearch Paper

A facility-location decision trades a one-time setup cost against repeated travel or service costs. In the online facility-location problem, demand points arrive one at a time, and an arriving point must immediately receive service from a facility that has already opened. An expensive facility may be worthwhile for many nearby requests, but those future…

29 thms1 active userReviewed
CombinatoricscryptographyTheoretical Computer Science·Captain: Shuze Chen

Algorithms for Sparse LWE and LPN with Small SecretsResearch Paper

Learning with errors (LWE) asks to tell noisy linear equations b=As+e mod qb = As + e \bmod qb=As+emodq apart from uniformly random right-hand sides; its hardness underlies most lattice-based cryptography (Regev 2005). Sparse LWE, where every row of AAA has only kkk nonzero entries, was introduced by Jain, Lin and Saha (2024) as a source of efficient primitives, and the modulus-qqq ana…

21 thms1 active userReviewed
Computational GeometryOptimizationTheoretical Computer Science·Captain: Shuze Chen

Adversarially Robust Streaming Algorithms for (k,z)(k, z)(k,z)-ClusteringResearch Paper

kkk-Median and kkk-Means are among the most studied clustering problems. Both are cases of (k,z)(k,z)(k,z)-clustering in Rd\mathbb R^dRd: given a dataset PPP, find at most kkk centers that minimise the sum of the zzz-th powers of the Euclidean distances from the points to their nearest center. In the dynamic geometric stream model of Indyk (2004), the data arrive as insertions and…

11 thms1 active userReviewed
PreviousPage 96 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