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
Dynamical Systems·Captain: wurtle

Two limit cycles for quintic Liénard systemsResearch Paper

A limit cycle of a planar vector field is a periodic orbit that is isolated among periodic orbits. The second part of Hilbert's sixteenth problem asks how many limit cycles a polynomial vector field of a given degree can have, and it is open even for quadratic fields. The classical Liénard systems

9 thms2 active usersReviewed
🏆Completed
Discrete GeometryFunctional Analysis·Captain: wurtle

A doubling Hilbert subset with no finite-dimensional bi-Lipschitz embeddingResearch Paper

A metric space is doubling if every ball can be covered by a bounded number of balls of half the radius. Every subset of a finite-dimensional Euclidean space is doubling, so doubling is a necessary condition for a metric space to embed bi-Lipschitzly into some Rk\mathbb R^kRk. Whether it is also sufficient, for subsets of Hilbert space, is the Lang–Plaut problem…

25 thms2 active usersReviewed
🏆Completed
Discrete Geometry·Captain: wurtle

The logarithmic Brunn–Minkowski conjectureResearch Paper

The Brunn–Minkowski inequality ∣(1−λ)K+λL∣≥∣K∣1−λ∣L∣λ|(1-\lambda)K+\lambda L|\ge|K|^{1-\lambda}|L|^\lambda∣(1−λ)K+λL∣≥∣K∣1−λ∣L∣λ is a cornerstone of convex geometry, with consequences ranging from the isoperimetric inequality to concentration of measure. The LpL_pLp​ Brunn–Minkowski theory of Firey and Lutwak replaces the Minkowski combination, whose support function is (1−λ)hK+λhL(1-\lambda)h_K+\lambda h_L(1−λ)hK​+λhL​, by a ppp-m…

12 thms2 active usersReviewed
🏆Completed
Discrete Geometry·Captain: wurtle

Petty’s projection-volume conjecture in dimensions at least fourResearch Paper

The projection body ΠK\Pi KΠK of a convex body K⊂RnK\subset\mathbb R^nK⊂Rn packages the areas of all shadows of KKK into a single convex body: its support function in direction uuu is the (n−1)(n-1)(n−1)-dimensional volume of the orthogonal projection of KKK onto u⊥u^\perpu⊥. The normalized volume ∣ΠK∣/∣K∣n−1|\Pi K|/|K|^{n-1}∣ΠK∣/∣K∣n−1 is invariant under translations and invertible linear maps, so asking for…

8 thms2 active usersReviewed
🏆Completed
Harmonic Analysis·Captain: wurtle

An Endpoint Gradient Bound for the Centered Disk Maximal OperatorResearch Paper

The Hardy–Littlewood maximal function replaces a function by the largest of its averages around each point. It is the basic tool for differentiation theorems and singular integrals, and it is bounded on LpL^pLp for p>1p>1p>1 but not on L1L^1L1. Kinnunen showed that it also preserves first-order Sobolev regularity: it is bounded on W1,p(Rn)W^{1,p}(\mathbb R^n)W1,p(Rn) for 1<p<∞1<p<\infty1<p<∞,…

13 thms2 active usersReviewed
🏆Completed
Harmonic Analysis·Captain: wurtle

A uniform Hilbert transform estimate for Lipschitz directionsResearch Paper

The Hilbert transform Hf(x)=p.v.∫f(x−t) dttHf(x)=\mathrm{p.v.}\int f(x-t)\,\frac{dt}{t}Hf(x)=p.v.∫f(x−t)tdt​ is the basic singular integral of harmonic analysis. In the plane one can take it along a line through each point, with the direction of the line allowed to depend on the point: given a unit vector field v:R2→S1v:\mathbb R^2\to S^1v:R2→S1, integrate fff along the segment through xxx in direction v(x)v(x)v(x). Whether…

9 thms2 active usersReviewed
🏆Completed
Geometry & Topology·Captain: wurtle

Koebe's Circle-Domain ConjectureResearch Paper

The Riemann mapping theorem says that every simply connected proper domain in the plane is conformally equivalent to the unit disk. For domains with more complicated complements one needs a model with many "holes". Koebe's Kreisnormierungsproblem (1908) asks whether every domain in the Riemann sphere is conformally equivalent to a circle domain, one whose…

9 thms2 active usersReviewed
🏆Completed
Geometry & Topology·Captain: wurtle

Removable Boundaries and Rigidity of Circle DomainsResearch Paper

A circle domain is a domain in the Riemann sphere whose complementary components are round disks or points. Koebe asked in 1908 whether every domain is conformally equivalent to a circle domain (existence). A second question is rigidity: when is that circle-domain model unique up to Möbius transformations? For finitely and countably connected domains the…

14 thms2 active usersReviewed
🏆Completed
Algebraic GeometryDifferential Geometry·Captain: wurtle

Symmetry of semialgebraic bounded domains with compact quotientResearch Paper

A bounded symmetric domain is a bounded connected open set in Cm\mathbb C^mCm with, at every point, a holomorphic involution having that point as an isolated fixed point. Examples are the ball, the polydisc and the Siegel upper half-spaces in their bounded realizations. They are the universal covers of compact locally symmetric varieties, such as compact…

11 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re(s) > 7/8Research Paper

The Riemann zeta function ζ(s)=∑n≥1n−s\zeta(s) = \sum_{n\ge1} n^{-s}ζ(s)=∑n≥1​n−s (ℜs>1\Re s > 1ℜs>1), continued meromorphically to C\mathbb{C}C, encodes the distribution of primes through its zeros. Riemann (1859) conjectured that all nontrivial zeros lie on ℜs=1/2\Re s = 1/2ℜs=1/2. Hadamard and de la Vallée Poussin (1896) proved there are no zeros on ℜs=1\Re s = 1ℜs=1, which gives the prime number theorem,…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Law of Large Numbers Limits for Many-Server Queues 1: The Fluid Equations Have at Most One Solution, Given Explicitly by the Age Representation (3.11)Research Paper

Large service systems such as call centers and hospital wards are modelled as many-server queues: NNN identical servers, customers arriving according to a general process, service requirements drawn independently from a general distribution GGG, and a single first-come-first-served queue. When GGG is not exponential the number of customers in system is not…

10 thms2 active usersReviewed
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

On Minimizing the Ruin Probability by Investment and Reinsurance II: Equation (5) for g = f′ Has a Unique Strictly Decreasing Solution on [0, ∞)Research Paper

An insurance company whose surplus falls below zero is ruined. The probability of ruin is the classical measure of solvency risk in actuarial mathematics. A company can lower it in two ways: it can invest part of its surplus in a risky asset, and it can pass part of each claim to a reinsurer in exchange for part of the premium. Which mix of investment and…

10 thms2 active usersReviewed
Control TheoryDynamical Systems·Captain: mikedeng1

Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions 2: Under the Small Gain Condition Γ_μ ≱ id, an Ω-Path ExistsResearch Paper

A large control system is often built from many subsystems Σ1,…,Σn\Sigma_1,\dots,\Sigma_nΣ1​,…,Σn​, each of which is input-to-state stable (ISS) with respect to the states of the others. Whether the interconnection is again ISS is decided by a small gain condition on the matrix of interconnection gains. For two subsystems this goes back to Jiang, Teel and Praly (1994) and…

18 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

The G/GI/N Queue in the Halfin–Whitt Regime 2: The Diffusion-Limit Equation Is Equivalent to a Renewal-Function Equation, Which Has a Unique Càdlàg SolutionResearch Paper

A G/GI/N queue has NNN identical servers, a general arrival process, a first-come-first-served waiting room and i.i.d. service times with a general distribution FFF of mean 111. In the Halfin–Whitt regime the number of servers grows while the traffic intensity ρN\rho^NρN approaches 111 at rate N(1−ρN)→β∈R\sqrt N(1-\rho^N)\to\beta\in\mathbb RN​(1−ρN)→β∈R; this is the standard asymptotic model…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 2: Addition, Supremum and the Reflecting Barrier Preserve J₁ Convergence of Linearly Centered PathsResearch Paper

Queueing models often represent work arriving to and leaving a server by a real-valued input path. The resulting workload cannot fall below a barrier. Functional limit theorems describe what happens to such paths under scaling, but a limit for the input path is useful only when it can be carried through the workload transformation. Ward Whitt’s 1980 paper…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Values of Large Games II: Oceanic Games 2: Oceanic Values Are Limits of Values of Finite Weighted Majority GamesResearch Paper

Weighted voting models assign a coalition a win when its combined vote reaches a quota. The Shapley value measures a player's contribution by averaging the change it makes when added to every possible predecessor coalition. This is straightforward to define for a finite list of voters, but a voting body may contain a few major holders and a very large…

8 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 8: For Concave Φ, EΦ(Σ z_k) ≤ 2·EΦ(Σ E(z_k | 𝒜_{k−1})) for Nonnegative z_kResearch Paper

A recurring task in martingale theory is to compare a sum of nonnegative random variables z1,z2,…z_1, z_2, \dotsz1​,z2​,… with the sum of their predictable projections E(zk∣Ak−1)E(z_k \mid \mathcal A_{k-1})E(zk​∣Ak−1​): the conditional expectation of each term given the information available one step earlier. Such comparisons are the step that turns a statement about the conditional square…

6 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 7: A Martingale of Bounded Mean Oscillation Satisfies E exp(tS²(f)) ≤ (1 − t)⁻¹Research Paper

A martingale can have individually well behaved increments while the sum of their squares remains large on rare sample paths. The square function records that accumulated variation. Bounds on its distribution tell probabilists how much a martingale can fluctuate even when a terminal value alone gives little pathwise information. In Section 19 of Distribution…

5 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 9: EΦ(f*) Is Controlled by the Conditional Square Function and the Largest Jump, for Every Φ of Moderate GrowthResearch Paper

A martingale f=(f1,f2,… )f=(f_1,f_2,\dots)f=(f1​,f2​,…) is a sum of increments dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​ each of which has conditional mean zero given the past. Most quantitative statements about martingales compare the size of the maximal function f∗=sup⁡n∣fn∣f^*=\sup_n|f_n|f∗=supn​∣fn​∣ with some measure of the size of the increments. Two such measures are classical: the square function S(f)=(∑kdk2)1/2S(f)=(\sum_k d_k^2)^{1/2}S(f)=(∑k​dk2​)1/2,…

5 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 6: For a Nonnegative Martingale, EΦ(S(f)) ≤ c·EΦ(f*) for Every Φ of Moderate GrowthResearch Paper

The square function S(f)=(∑kdk2)1/2S(f)=\big(\sum_k d_k^2\big)^{1/2}S(f)=(∑k​dk2​)1/2 of a martingale fff with differences dkd_kdk​ and its maximal function f∗=sup⁡n∣fn∣f^*=\sup_n|f_n|f∗=supn​∣fn​∣ are the two basic size measures of a martingale. Inequalities comparing them, EΦ(S(f))≤c EΦ(f∗)E\Phi(S(f))\le c\,E\Phi(f^*)EΦ(S(f))≤cEΦ(f∗) and the reverse, are used throughout probability and harmonic analysis: they control stochastic sums by their…

7 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 5: A Nonnegative Martingale's Square Function, Stopped Before |f_n| Exceeds λ, Is Exponentially Square IntegrableResearch Paper

Martingale estimates describe how a process built from successive, conditionally fair increments can fluctuate. A basic object is its square function: the square root of the sum of the squared increments along a sample path. Square functions are useful because they record accumulated variation even when positive and negative increments cancel in the…

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

Vertical Integration and Antitrust Policy: Integrating Successive Monopolies Lowers the Final Price and Raises Output, Joint Profit and Consumer SurplusResearch Paper

In 1950 the United States Supreme Court appeared to be moving toward treating corporate integration, horizontal or vertical, as illegal per se under the antitrust laws. Joseph J. Spengler's note in the Journal of Political Economy argued that this conflates two different things: horizontal integration can suppress competition, but vertical integration, the…

7 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Estimating Variance From High, Low and Closing Prices II: Under the Overshoot Law (9), E(Z ∨ Z′) = aσ√h and E(Z ∨ Z′)² = bσ²hResearch Paper

Volatility estimates from daily high, low and closing prices have been used since Parkinson (1980) and Garman and Klass (1980): the range of a day's log-price carries much more information about the volatility σ\sigmaσ than the close alone. Rogers and Satchell (1991) propose an estimator, S1(S1−X1)+I1(I1−X1)S_1(S_1-X_1)+I_1(I_1-X_1)S1​(S1​−X1​)+I1​(I1​−X1​), that is unbiased for σ2\sigma^2σ2 whatever the…

8 thms2 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces I: Control by One Point — ∫ e^{t f(A,x)} dP ≤ P(A)^{−α} exp(Nt²(1+1/α)/8) for the Hamming Distance to ATextbook

Concentration of measure is the observation that, on a high-dimensional product probability space, any set that is not too small already contains most of the space within a small neighbourhood. For functions of many independent random variables this yields Gaussian-type tail bounds without any explicit computation of the distribution, and these bounds are…

8 thms2 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces III: Penalties — Exponential Moments of the Penalized Distance f_h(A, x)Textbook

Concentration of measure in a product space ΩN\Omega^NΩN asks how much of the space lies close to a set AAA of non-negligible probability. In the simplest setting closeness is the Hamming distance: the number of coordinates of xxx that cannot be matched by a point of AAA. Talagrand's 1995 memoir in Publications Mathématiques de l'IHÉS develops a family of such…

8 thms2 active usersReviewed
PreviousPage 11 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