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
ProbabilityRandom 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
Captain: wurtle

Relative generation and the generator problem for finite factorsResearch Paper

A von Neumann algebra is a unital algebra of bounded operators on a Hilbert space that is closed under adjoints and in the weak operator topology. For a set SSS of operators, W∗(S)W^*(S)W∗(S) denotes the smallest von Neumann algebra containing SSS. The generator problem, going back to Kadison's 1967 list of problems, asks whether every von Neumann algebra with separable…

22 thms2 active usersReviewed
🏆Completed
Dynamical Systems·Captain: wurtle

Invariant-projection counterexamples for every irrational rotationResearch Paper

The invariant subspace problem asks whether every bounded operator on a separable infinite-dimensional complex Hilbert space has a nontrivial closed invariant subspace. Inside a finite von Neumann algebra there is a sharper, algebra-relative version: given TTT in a type II1\mathrm{II}_1II1​ factor MMM, is there a projection p∈Mp\in Mp∈M with 0<τ(p)<10<\tau(p)<10<τ(p)<1 and (1−p)Tp=0(1-p)Tp=0(1−p)Tp=0, i.e.…

43 thms2 active usersReviewed
🏆Completed
Captain: wurtle

Tracial projection methods and uniform property GammaResearch Paper

The classification programme for simple nuclear C∗C^*C∗-algebras identifies a class of algebras that are determined by K-theory and traces. Membership in that class is governed by regularity properties: finite nuclear dimension, absorption of the Jiang–Su algebra Z\mathcal ZZ, and strict comparison. Uniform property Γ\GammaΓ, introduced by Castillejos, Evington,…

4 thms2 active usersReviewed
🏆Completed
Analysis·Captain: wurtle

Universal strong Kadison–Kastler stabilityResearch Paper

How rigid is a von Neumann algebra inside B(H)B(H)B(H)? If two algebras M,N⊆B(H)M,N\subseteq B(H)M,N⊆B(H) have unit balls that are uniformly close, must they be the same algebra up to a small change of coordinates? Kadison and Kastler introduced the distance between the unit balls in 1972 (Amer. J. Math. 1972) and asked whether sufficiently close algebras are spatially isomorphic,…

48 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·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
Group TheoryHarmonic Analysis·Captain: wurtle

Unitarizability implies amenability for discrete groupsResearch Paper

A representation π\piπ of a group GGG by bounded invertible operators on a Hilbert space is uniformly bounded if sup⁡g∥π(g)∥<∞\sup_g\|\pi(g)\|<\inftysupg​∥π(g)∥<∞, and unitarizable if after a change of inner product it becomes unitary, i.e. some bounded invertible SSS makes every Sπ(g)S−1S\pi(g)S^{-1}Sπ(g)S−1 unitary. Unitary representations are the ones harmonic analysis knows how to decompose, so it…

30 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: wurtle

Thompson's group F is nonamenableResearch Paper

Thompson's group FFF consists of the increasing piecewise linear homeomorphisms of [0,1][0,1][0,1] with finitely many pieces, dyadic rational breakpoints, and slopes that are integer powers of 222. It is finitely presented, has strong topological finiteness properties, and appears across group theory, dynamics and logic. Whether FFF is amenable, i.e. whether its bounded…

7 thms2 active usersReviewed
🏆Completed
Dynamical SystemsHarmonic Analysis·Captain: wurtle

A smooth three-torus diffeomorphism with simple Lebesgue spectrumResearch Paper

A measure-preserving transformation TTT of a probability space acts on square-integrable functions by the Koopman operator UTg=g∘TU_Tg=g\circ TUT​g=g∘T, a unitary operator. Its spectral type (discrete, singular continuous, absolutely continuous) and its multiplicity are basic invariants of ergodic theory. The Lebesgue spectrum is the spectral type of the shift on …

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

Finite-Circle Obstructions, Binary Codes, and Histogram Embeddings for Edit DistanceResearch Paper

Edit distance ED(x,y)\mathrm{ED}(x,y)ED(x,y), the least number of single-symbol insertions, deletions and substitutions turning xxx into yyy, is the standard distance on strings. Embedding strings into ℓ1\ell_1ℓ1​ with small distortion would make edit distance amenable to the fast nearest-neighbour and sketching tools available for ℓ1\ell_1ℓ1​, so the least achievable distortion is a…

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

Edit Distance in l1: Matching Bounds up to Constants in the ExponentResearch Paper

Edit distance ED(x,y)\mathrm{ED}(x,y)ED(x,y) is the least number of single-symbol insertions, deletions and substitutions transforming a string xxx into yyy. It is the basic similarity measure for strings, but it is expensive to compute and awkward to index. A standard way around this is to embed strings into ℓ1\ell_1ℓ1​ so that ℓ1\ell_1ℓ1​ distances approximate edit distances; the…

3 thms2 active usersReviewed
🏆Completed
AnalysisDiscrete Geometry·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 GeometryProbability·Captain: wurtle

Subpolynomial dimension reduction in LpResearch Paper

The Johnson–Lindenstrauss lemma (1984) says that any nnn points of a Hilbert space can be placed in OD(log⁡n)O_D(\log n)OD​(logn)-dimensional Euclidean space with distortion at most any prescribed D>1D>1D>1. This dimension reduction is used throughout analysis, geometry and algorithm design. Johnson and Lindenstrauss also asked what analogues hold in other Banach spaces. For the…

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

The Mahler Conjecture for General Convex BodiesResearch Paper

The volume product of a convex body measures how large a body and its polar can simultaneously be. For a body without a distinguished centre, the polar is taken about the point that makes it smallest, the Santaló point, so the product is invariant under all invertible affine maps. The Blaschke–Santaló inequality identifies ellipsoids as the maximizers. Mahle…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Duality and Stability in Extremum Problems Involving Convex Functions 2: The Dual Supremum Equals the Lower Limit of the Perturbed Infimum, sup (P*) = lim inf_{z→0} inf (P(z))Research Paper

A convex minimization problem comes with a dual maximization problem, and the dual value never exceeds the primal value. When the two values differ, a duality gap occurs. Dual bounds, Lagrangian relaxations and optimality certificates are then weaker than hoped. Conditions that rule the gap out are constraint qualifications such as Slater's condition and…

8 thms2 active usersReviewed
🏆Completed
AnalysisOperations ResearchOptimization·Captain: mikedeng1

An Implicit-Function Theorem for a Class of Nonsmooth Functions: Strong Approximation by a Function with Lipschitzian Inverse Yields a Unique Lipschitzian Implicit FunctionResearch Paper

The classical implicit-function theorem solves an equation F(x,y)=0F(x, y) = 0F(x,y)=0 for xxx as a function of a parameter yyy near a known solution (x0,y0)(x_0, y_0)(x0​,y0​), provided FFF is (strongly) Fréchet differentiable in xxx with an invertible partial derivative. Much of optimization does not meet that hypothesis. Optimality conditions of constrained problems, complementarity problems…

4 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Régularisation d'inéquations variationnelles par approximations successives I: Every Weak Cluster Point of the Regularized Iterates Solves the Monotone Variational InequalityResearch Paper

The proximal point algorithm is a basic iterative scheme of convex optimization and monotone operator theory. To solve a problem governed by a monotone operator, it replaces the problem by a sequence of better-conditioned problems, each regularized by a quadratic term centred at the previous iterate. Augmented Lagrangian methods, the Douglas–Rachford and…

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

Strongly Regular Generalized Equations I: Implicit-Function Theorem — the Solution x(p) of 0 ∈ f(p, x) + ∂ψ_C(x) Is Locally Unique with ‖x(p) − x(q)‖ ≤ (λ + ε)‖f(p, x(q)) − f(q, x(q))‖Research Paper

Many problems of optimization and equilibrium can be written as one inclusion. Some examples are the Karush–Kuhn–Tucker conditions of a nonlinear program, nonlinear complementarity problems, variational inequalities and the equilibrium conditions of economic and traffic models. In each of them a point xxx has to satisfy 0∈f(x)+∂ψC(x)0 \in f(x) + \partial\psi_C(x)0∈f(x)+∂ψC​(x). In…

6 thms2 active usersReviewed
🏆Completed
Captain: savarin

Sharp diagonal Hlawka constants: lower the cutoff to 80Open 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 thms2 active usersReviewed
🏆Completed
Captain: moona3k

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

This entry lowers the sufficient exponent cutoff for the sharp diagonal Hlawka formula from85 to84. For every real p≥84, the foundation's unchanged cyclic constant is the least constant comparing the triple deficit with the pair-deficit sum for every complex coordinate triple in every finite dimension.

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming 1: The Bregman Proximal Point Algorithm Converges to a Zero of a Maximal Monotone OperatorResearch Paper

The proximal point algorithm is a way to find a zero of a set-valued monotone operator by repeatedly solving a regularized version of that operator equation. Its classical regularizer is quadratic, so the distance from one iterate to the next is Euclidean. In convex optimization, that geometry can be poorly matched to the domain: the natural iterates may be…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Convex Programming in Hilbert Space: Gradient Projection x_{k+1} = P(x_k − ρ_k∇f(x_k)) with σ ≤ ρ_k ≤ 2ρ₀ − σ Stays in the Level Set, and for Convex f Drives f(x_k) to inf_C fResearch Paper

Minimizing a smooth function over a closed convex set is the basic problem of constrained continuous optimization. When the constraint set is simple enough that the nearest point of the set to any given point can be computed (a ball, a box, an orthant, an affine subspace), the most direct method is the gradient projection method: take a gradient step and…

14 thms2 active usersReviewed
🏆Completed
Captain: moona3k

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

This completed entry lowers the sufficient exponent cutoff for the sharp diagonal Hlawka formula from 90 to 87. The goal is already proved in Lean on Prove2Me: for every real p ≥ 87, the foundation's cyclic constant K_p is the least constant that works for every triple of complex coordinate vectors in every finite dimension.

5 thms2 active usersReviewed
🏆Completed
Captain: savarin

Sharp diagonal Hlawka constants: lower the cutoff to 85Open 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.

63 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms II: With F = 0, Iterates Converge Weakly to a Primal–Dual Solution When στ‖L‖² < 1Research Paper

Many problems in imaging, signal processing and statistics are convex minimizations of the form

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