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
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
🏆Completed
Mathematical Physics·Captain: marwahaha

The Mézard–Parisi formula for diluted spin glassesOpen Problem

A diluted spin glass has finitely many interactions per spin on average. The source seeks the exact thermodynamic pressure using a hierarchy of random local-field laws. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Stochastic Systems·Captain: marwahaha

A directional zero–one law under strict ellipticityOpen Problem

A random environment can favor different directions at different sites. The source asks whether escape in one prescribed real direction can have an intermediate probability after averaging over the environment. The source is OpenAI's September 2026 manuscript.

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

Buffered comparison and stopping-band resolution in critical IsingOpen Problem

Conditioning on an explored Ising interface fixes many spins and can create alternating signs. The source develops comparison estimates that remain valid with arbitrary common pinned spins. The source is OpenAI's September 2026 manuscript.

28 thms2 active usersReviewed
🏆Completed
Graph Theory·Captain: marwahaha

Nonuniqueness of percolation on nonamenable quasi-transitive graphsOpen Problem

On an expanding infinite graph, the appearance of an infinite open cluster and the appearance of a unique one can occur at different densities. The source seeks a nonempty interval where infinitely many infinite clusters coexist. The source is OpenAI's September 2026 manuscript.

42 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

Strict convexity and differentiability of the planar exponential first-passage limit shapeOpen Problem

Random edge travel times produce a deterministic large-scale shape. The source studies two distinct regularity questions: corners and flat boundary segments. The available exponential target addresses differentiability and the structure of supporting lines. The source is OpenAI's September 2026 manuscript.

11 thms2 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

The sharp terminal leave in random triangle removalOpen Problem

Random triangle deletion constructs a partial triangle packing. Its terminal uncovered edges measure how efficiently this process covers pairs, and the source seeks the leading constant rather than only the growth exponent. The source is OpenAI's September 2026 manuscript.

5 thms2 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

Talagrand’s discrete-convexity conjectureOpen Problem

High probability under independent coordinate sampling need not give a family any closure under unions. Discrete convexity asks whether a bounded number of its members nevertheless cover most sets in the stronger sense of inexpensive containment certificates. The source is OpenAI's September 2026 manuscript.

20 thms2 active usersReviewed
🏆Completed
Optimization·Captain: marwahaha

Subpolynomial query complexity for well-conditioned log-concave samplingOpen Problem

Sampling costs can be measured by potential and gradient queries independently of the computation between them. This model isolates the information needed for a well-conditioned log-concave distribution. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

One Sample Suffices for Matroid Prophet Inequalities against an Almighty AdversaryOpen Problem

Online selection must commit before all values arrive, while the offline optimum sees the full vector. The mission asks how much one independent sample per item can recover under a matroid feasibility constraint. The source manuscript presents the surrounding research claim.

9 thms2 active usersReviewed
🏆Completed
Functional AnalysisRandom Matrix Theory·Captain: wurtle

A finite-entropy separation of microstates and nonmicrostates free entropyResearch Paper

Free probability treats bounded self-adjoint operators X1,…,XnX_1,\dots,X_nX1​,…,Xn​ in a tracial von Neumann algebra as noncommuting random variables, and the free analogue of independence is freeness. Voiculescu introduced two candidate analogues of Shannon entropy for such tuples. The microstates free entropy χ(X)\chi(X)χ(X) measures how large the set of matrix tuples imitating…

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

Spontaneous magnetization in the quantum Heisenberg ferromagnetResearch Paper

The quantum Heisenberg ferromagnet is the basic quantum model of a magnet: a quantum spin sits at each site of the lattice Zd\mathbb Z^dZd and neighbouring spins prefer to align. Its Hamiltonian is invariant under simultaneous rotation of all spins, so at zero external field no direction is preferred. Spontaneous magnetization asks whether an infinite-volume…

11 thms2 active usersReviewed
🏆Completed
Functional AnalysisMathematical Physics·Captain: wurtle

Ground-state condensation in the dilute hard-sphere gasResearch Paper

Bose–Einstein condensation (BEC) means that a single one-particle state carries a macroscopic fraction of a many-boson system. It was predicted for the ideal gas by Bose and Einstein (1924–1925) and is observed in dilute atomic gases, but for interacting particles in the thermodynamic limit there was no rigorous proof, even in the ground state. The Penrose–O…

11 thms2 active usersReviewed
🏆Completed
Markov ChainRepresentation Theory·Captain: wurtle

Conditional coordinate sweeps and analytic transferResearch Paper

The Thorp shuffle cuts a deck in half, pairs cards in corresponding positions, and lets an independent fair coin order each pair before the pairs are interleaved. On N=2dN=2^dN=2d cards, removing the deterministic rotation of coordinates turns ddd physical shuffles into one binary coordinate sweep: in each coordinate direction, in order, every pair of positions…

10 thms2 active usersReviewed
🏆Completed
Markov ChainRepresentation Theory·Captain: wurtle

Random-subspace tests and trace smoothing for coordinate sweepsResearch Paper

The Thorp shuffle is a simple card-shuffling rule: cut a deck of nnn cards into two equal halves, pair cards in corresponding positions, and let an independent fair coin decide the order within each pair when the pairs are interleaved. It is a standard test case for mixing-time methods and a building block in small-domain enciphering schemes. For n=2dn=2^dn=2d every…

5 thms2 active usersReviewed
🏆Completed
Group TheoryRepresentation Theory·Captain: wurtle

From partial permutation information to Fourier boundsResearch Paper

Many random permutations are analysed through what they do to a few labels at a time: the joint positions of kkk chosen cards in a shuffle, or the images of a list of inputs under a block cipher built from a shuffle. Such partial information does not by itself control the whole permutation. The uniform law on the alternating group already has uniform images…

46 thms2 active usersReviewed
🏆Completed
CombinatoricsMathematical Physics·Captain: wurtle

Critical strip-crossing mass on the honeycomb latticeResearch Paper

At its critical weight, a self-avoiding path on the honeycomb lattice can make long excursions without paying an exponential cost. A basic quantitative question is how much of its total weight reaches the far side of a strip of height NNN. Physics heuristics (Nienhuis's Coulomb gas and the conjectured SLE8/3\mathrm{SLE}_{8/3}SLE8/3​ scaling limit with boundary exponent 5/85/85/8…

14 thms2 active usersReviewed
🏆Completed
Dynamical SystemsMathematical Physics·Captain: wurtle

The sharp factor-of-IID threshold for the free Ising model on regular treesResearch Paper

A random configuration on the vertices of a graph is a factor of IID if it can be produced by a measurable rule from independent uniform labels at the vertices, where the rule commutes with the graph's automorphisms. On trees this notion connects ergodic theory (which invariant processes are "Bernoulli-like"), local algorithms on sparse random graphs…

26 thms2 active usersReviewed
🏆Completed
CombinatoricsMathematical Logic·Captain: wurtle

Computing the Random 3-SAT ThresholdResearch Paper

Random 3-SAT, a conjunction of random three-literal clauses on nnn variables, is the classic test case for the typical behavior of satisfiability. Experiments placed the hardest instances near the density where half the formulas are satisfiable, and statistical physics predicts a sharp satisfiability threshold near 4.2674.2674.267. Once a limiting threshold α3\alpha_3α3​ is…

20 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: wurtle

Variance of the Random k-SAT Hitting TimeResearch Paper

Add random clauses one at a time to a Boolean formula on nnn variables until it first becomes unsatisfiable. The index HnH_nHn​ of that first failure is the satisfiability hitting time of random kkk-SAT. Its mean, divided by nnn, converges to the satisfiability threshold; its variance measures the width of the transition window. Friedgut's sharp-threshold theorem…

32 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: wurtle

A Limiting Satisfiability Threshold for Every Fixed Clause SizeResearch Paper

A random kkk-SAT formula on nnn Boolean variables is a conjunction of mmm independent random clauses, each an OR of kkk literals on distinct variables. As the clause density m/nm/nm/n grows, the formula changes from almost surely satisfiable to almost surely unsatisfiable. Random kkk-SAT is a central model in probabilistic combinatorics, the theory of algorithms and…

20 thms2 active usersReviewed
PreviousPage 50 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