Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Functional Analysis

301 missions · 216 completed

Missions

Open85Completed216All301
🏆Completed
Pure Mathematics·Captain: wenxinzhang

Positive definite matrix integral inequalityOpen Problem

The source defines a two-variable integral on strictly positive-definite real matrices. Its numerator is the absolute bilinear form of A minus B on two unit vectors, while the denominator uses the quadratic forms of A and B. The desired inequality says that componentwise matrix addition is nonexpansive for this quantity, with the larger of the two input…

42 thms16 active usersReviewed
🏆Completed
Graph Theory·Captain: mikedeng1

Improved Embedding of kkk-Outerplanar Metrics into ℓ1\ell_1ℓ1​Research Paper

A shortest-path metric records the least total edge length needed to travel between two vertices of a weighted graph. Representing these distances as sums of absolute coordinate differences connects graph geometry with routing and partitioning. In particular, the connection between metric embeddings and the fractional flow-cut gap makes distortion bounds…

26 thms8 active usersReviewed
🏆Completed
Graph TheoryProbabilityRandom Matrix Theory·Captain: dbenbenn

A new approach to strong convergence (Chen–Garza-Vargas–Tropp–van Handel 2026)Research Paper

This mission formalizes C.-F. Chen, J. Garza-Vargas, J. A. Tropp and R. van Handel, A new approach to strong convergence, Ann. of Math. (2) 203 (2026) 555–602, doi:10.4007/annals.2026.203.2.4 (arXiv:2405.16026v3, whose page numbers are used).

103 thms7 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

From Classical to Quantum Shannon Theory IX: Relative Entropy Decrease Bounds the Averaged Fidelity of Rotated Petz RecoveryTextbook

The monotonicity of quantum relative entropy, D(ρ∥σ)≥D(N(ρ)∥N(σ))D(\rho\|\sigma)\ge D(\mathcal N(\rho)\|\mathcal N(\sigma))D(ρ∥σ)≥D(N(ρ)∥N(σ)) for every quantum channel N\mathcal NN, is the inequality from which the converse parts of the coding theorems of quantum Shannon theory are derived: strong subadditivity, concavity of conditional entropy, joint convexity of relative entropy and the Holevo…

23 thms7 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

On the Maximal Monotonicity of Subdifferential Mappings I: The Subdifferential of a Lower Semicontinuous Proper Convex Function on a Banach Space Is Maximal MonotoneResearch Paper

Monotone operators from a Banach space EEE to its dual E∗E^*E∗ are the abstract framework for nonlinear equations, variational inequalities and evolution equations, and for the convergence theory of proximal-point and splitting algorithms in infinite dimensions. Within that framework, the class that behaves well — for surjectivity results, for resolvents, for…

16 thms6 active usersReviewed
🏆Completed
Captain: savarin

Sharp diagonal Hlawka constants: lower the cutoff to 16Open Problem

The Hlawka inequality for Schatten ppp-norms is a cousin of the triangle inequality: it relates the norms of three matrices to the norms of their pairwise sums and their total sum. The question is how large a comparison constant is needed to make this inequality hold.

90 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees 1: A Value Pacing-Based Symmetric First Price Equilibrium ExistsResearch Paper

Most online advertising is sold by auction, one impression at a time, to advertisers who manage a budget over many auctions rather than a value for a single one. Since 2019 the major ad exchanges have moved from second price to first price auctions, in which the winner pays its own bid. A budget-constrained advertiser in a first price auction must therefore…

20 thms5 active usersReviewed
🏆Completed
Captain: savarin

Sharp diagonal Hlawka constants: lower the cutoff to 50Open Problem

The Hlawka inequality for Schatten ppp-norms is a cousin of the triangle inequality: it relates the norms of three matrices to the norms of their pairwise sums and their total sum. The question is how large a comparison constant is needed to make this inequality hold.

64 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Stochastic Graphon Games: I. The Static Case 1: If the State Map b Is Bounded and √c_z‖W‖ < 1, the Graphon Game Has at Least One Nash EquilibriumResearch Paper

Games with many interacting players appear in economics, epidemiology and network engineering: firms competing in a market, individuals deciding whether to vaccinate, agents in a social network choosing an effort level. When every player interacts with every other player symmetrically, mean field game theory replaces the finite game by a limit with a…

11 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: mikedeng1

Logarithmic Sobolev Inequalities for Finite Markov Chains 5: The Log-Sobolev Constant of K(x, y) = π(y) Is (1 − 2π_)/log(1/π_ − 1)Research Paper

The log-Sobolev constant α\alphaα of a finite Markov chain controls how fast the chain forgets its starting point in relative entropy and in ℓ2\ell^2ℓ2, and it gives sharper mixing-time bounds than the spectral gap λ\lambdaλ when the stationary distribution has very small atoms. Diaconis and Saloff-Coste (Ann. Appl. Probab. 6 (1996)) made this constant a standard…

16 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: mikedeng1

Logarithmic Sobolev Inequalities for Finite Markov Chains 4: The Metropolis Chain for the Binomial Distribution Is Within e^{1−c} of Stationarity after (n/2)(log n + 2c) StepsResearch Paper

The Metropolis algorithm turns a simple random walk into a Markov chain with a prescribed stationary distribution, by accepting or rejecting the walk's proposals. It is the basic tool of Markov chain Monte Carlo, and the practical question it raises is quantitative: how many steps are needed before the chain's distribution is close to the target? For most…

23 thms5 active usersReviewed
🏆Completed
AnalysisHarmonic AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics III: The Herglotz Representation and Stieltjes InversionTextbook

In spectral theory the resolvent of a self-adjoint operator AAA is studied through scalar functions Fψ(z)=⟨ψ,(A−z)−1ψ⟩F_\psi(z) = \langle \psi, (A - z)^{-1}\psi\rangleFψ​(z)=⟨ψ,(A−z)−1ψ⟩, defined for non-real zzz. Each FψF_\psiFψ​ is holomorphic on the upper half plane and maps it into itself. The spectral theorem, in the form presented in G. Teschl's Mathematical Methods in Quantum Mechanics (AMS…

28 thms5 active usersReviewed
🏆Completed
AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations IV: Extension, Trace and the Rellich–Kondrachov TheoremTextbook

Existence theory for elliptic, parabolic and nonlinear PDEs mostly runs through one argument: build approximate solutions, bound them in a Sobolev norm, extract a convergent subsequence, and pass to the limit. The extraction step needs a compact embedding: a bound on derivatives must buy convergence of the functions themselves in a weaker norm. On a bounded…

88 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

On the Maximal Monotonicity of Subdifferential Mappings II: Subdifferentials Are Exactly the Maximal Cyclically Monotone Operators, Unique up to an Additive ConstantResearch Paper

A differentiable convex function on Rn\mathbb{R}^nRn is determined, up to an additive constant, by its gradient, and a vector field is a gradient of a convex function exactly when it satisfies a monotonicity condition along closed cycles. Convex analysis and optimization need the same statement for nonsmooth and extended-valued functions on infinite-dimensional…

16 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Dual Stochastic Dominance and Related Mean-Risk Models 2: Mean–Gini Optimal Portfolios Exist and Are SSD-EfficientResearch Paper

Portfolio selection and other decisions under risk are routinely solved as mean–risk models: maximize the expected outcome minus a multiple of a risk measure over the feasible set. Such a model is computationally convenient, but it is only defensible if its answers agree with the preferences of risk-averse decision makers. The standard formal expression of…

13 thms5 active usersReviewed
🏆Completed
AnalysisCalculus of VariationsPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations V: Weak Solutions of Elliptic PDEs and the Fredholm AlternativeTextbook

Second-order elliptic equations in divergence form, such as −∇⋅(A∇u)+b⋅∇u+cu=f-\nabla\cdot(A\nabla u) + b\cdot\nabla u + cu = f−∇⋅(A∇u)+b⋅∇u+cu=f, model steady diffusion, electrostatics in inhomogeneous media and linear elasticity. They are also the stationary part of every parabolic and hyperbolic problem studied later in the same notes. When the coefficients are only bounded and measurable,…

14 thms5 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

Markov Processes: Characterization and Convergence 15: Diffusions in smooth bounded regionsTextbook

Diffusion models in a bounded region need a rule for what happens when a path reaches the boundary. Two standard mechanisms are absorption, where the boundary kills the generator contribution, and oblique reflection, where a prescribed vector field pushes the process back into the region. Ethier and Kurtz treat these mechanisms as neighboring variants of…

46 thms5 active usersReviewed
🏆Completed
Linear algebraQuantum Information·Captain: mikedeng1

The Quantum Chernoff Bound: Tr[A^s B^{1−s}] ≥ Tr[A + B − |A − B|]/2 for All Positive Trace-Class Operators A, B and All 0 ≤ s ≤ 1Research Paper

Suppose a quantum system has been prepared nnn times, either always in the state ρ0\rho_0ρ0​ (with prior probability π0\pi_0π0​) or always in the state ρ1\rho_1ρ1​ (with prior π1\pi_1π1​), and the task is to guess which. Helstrom's formula gives the smallest error probability over all measurements,

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk II: Dual Representation of Acceptability FunctionalsTextbook

Risk functionals assign a number to an uncertain profit and are used as objectives and constraints in portfolio selection, insurance and energy planning. Since the axiomatization of coherent risk measures by Artzner, Delbaen, Eber and Heath (Math. Finance 1999), the standard way to understand such a functional is through a dual representation: the…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems: The Primal Shadows Converge Weakly, and in Value, to a Solution of the Normal ProblemResearch Paper

The Douglas–Rachford algorithm is one of the most widely used splitting methods for minimizing a sum f+gf + gf+g of two convex functions, or more generally for finding a zero of a sum A+BA + BA+B of two maximally monotone operators. It touches each summand only through its proximal mapping (resolvent), which is why it underlies ADMM and a large share of first-order…

29 thms4 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

Projected Reflected Gradient Methods for Monotone Variational Inequalities 2: Under Strong Monotonicity the Projected Reflected Gradient Method Converges R-LinearlyResearch Paper

A variational inequality asks for a point of a convex set at which a vector field points "inward" against every feasible direction. It is the common form of convex minimization (with FFF a gradient), of saddle-point problems (with FFF the monotone operator of a convex–concave function), of Nash equilibria of convex games, of complementarity problems and of…

12 thms4 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

Projected Reflected Gradient Methods for Monotone Variational Inequalities 1: The Projected Reflected Gradient Method Converges Weakly to a SolutionResearch Paper

Many problems in optimization, game theory and mechanics come down to a variational inequality: find a point of a convex set at which a given vector field points "inward" against every feasible direction. Constrained convex minimization (where the field is a gradient), saddle-point problems (where it is the gradient of a convex–concave function with one…

12 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research+1·Captain: mikedeng1

Kernel Distributionally Robust Optimization: Generalized Duality Theorem and Stochastic Approximation: The Worst-Case Risk over an RKHS Ambiguity Set Equals Its Support-Function DualResearch Paper

Distributionally robust optimization (DRO) chooses a decision θ\thetaθ that minimizes the expected loss under the worst distribution in an ambiguity set K\mathcal KK of plausible distributions, min⁡θsup⁡P∈K∫l(θ,ξ) dP(ξ)\min_\theta\sup_{P\in\mathcal K}\int l(\theta,\xi)\,dP(\xi)minθ​supP∈K​∫l(θ,ξ)dP(ξ). It sits between stochastic optimization, which trusts a single distribution, and worst-case robust…

15 thms4 active usersReviewed
🏆Completed
Captain: marwahaha

Bi-Lipschitz Absorption of c0 Without a Linear Copy of c0Open Problem

Metric absorption asks whether adjoining a null-sequence component changes a space up to controlled distances. Linear absorption imposes a different requirement. The pinned manuscript supplies the research context.

41 thms4 active usersReviewed
🏆Completed
Graph Theory·Captain: wurtle

Distortion of countably branching diamonds from midpoint and tree energiesResearch Paper

How well can a graph be drawn inside a Banach space without stretching some distances much more than others? The distortion of the best such drawing measures the mismatch between the graph's metric and the geometry of the space. Diamond graphs are a standard test family: each edge is repeatedly replaced by parallel two-edge paths, so the graph contains many…

27 thms4 active usersReviewed
PreviousPage 1 of 9Next

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