Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Harmonic Analysis

87 missions · 46 completed

Missions

Open41Completed46All87
🏆Completed
Analytic Number TheoryNumber Theory·Captain: dbenbenn

New large value estimates for Dirichlet polynomials (Guth–Maynard 2026)Research Paper

This mission formalizes L. Guth and J. Maynard, New large value estimates for Dirichlet polynomials, Ann. of Math. (2) 203 (2026) 623–675, doi:10.4007/annals.2026.203.2.6 (arXiv:2405.20552v2, whose page numbers are used).

43 thms7 active usersReviewed
🏆Completed
AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 4: For Convex Φ of Moderate Growth, EΦ(f*) and EΦ(S(f)) Are Comparable for Every MartingaleResearch Paper

Martingale inequalities compare what a fluctuating process does along a path with how large its successive increments are. Such estimates are used in probability and harmonic analysis because a martingale can represent information revealed step by step, while its square function measures accumulated fluctuation. In his 1973 Wald Memorial Lectures,…

17 thms5 active usersReviewed
🏆Completed
AnalysisFunctional 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
Random Matrix TheoryRepresentation Theory·Captain: mikedeng1

The Weingarten Calculus: Haar Integrals of Matrix Elements Are Given by a Basis of Invariant Tensors and Its Weingarten Matrix, I = A W A*Research Paper

Integrals of polynomial functions of the matrix entries of a random element of a compact group appear across mathematical physics and probability: in random matrix theory (moments of Haar-distributed unitary, orthogonal and symplectic matrices), in lattice gauge theory (the link integrals of U(N)U(N)U(N) gauge fields), and in quantum information (averages of…

7 thms4 active usersReviewed
🏆Completed
Numerical AnalysisQuantum Information·Captain: mikedeng1

Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision II: A Discretized Gaussian Fourier Double Sum Is ε-Close to 1/x on [−1, −1/κ] ∪ [1/κ, 1]Research Paper

A quantum algorithm for a system of linear equations must turn operations it can implement into an approximation of the inverse of the system matrix. For a Hermitian matrix, time evolution e−iAte^{-iAt}e−iAt is such an operation. Childs, Kothari and Somma use a Fourier expansion of the scalar reciprocal 1/x1/x1/x to express an approximation to A−1A^{-1}A−1 as a finite linear…

8 thms4 active usersReviewed
🏆Completed
Analysis·Captain: wurtle

The maximal triangular Hilbert transform at the symmetric pointResearch Paper

The triangular Hilbert transform is a bilinear singular integral on the plane that couples translations in two different coordinate directions:

68 thms4 active usersReviewed
🏆Completed
Discrete GeometryProbability·Captain: mikedeng1

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography 2: For r ≥ √2·η_ε(L), ε ≤ 1/10, a Discrete Gaussian Sample Lies Outside Any Proper Subspace with Probability ≥ 1/10Research Paper

Regev's paper (J. ACM 56(6), Article 34, 2009) introduces the learning with errors (LWE) problem and shows that solving it is at least as hard, for quantum algorithms, as approximating standard worst-case lattice problems such as the shortest independent vectors problem (SIVP) and GapSVP. LWE is the basis of most lattice-based public-key cryptography,…

12 thms4 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography 1: A Discrete Gaussian on L + u Plus Continuous Gaussian Noise ν_s Is Within Statistical Distance 4ε of ν_t, t = √(r² + s²)Research Paper

The learning with errors (LWE) problem underlies most of post-quantum public-key cryptography. Its hardness rests on Regev's reduction from worst-case lattice problems to LWE (Regev, J. ACM 2009). The reduction is iterative: it repeatedly turns samples of a discrete Gaussian on a lattice into samples of a narrower one. Its classical step, Lemma 3.11, needs…

11 thms4 active usersReviewed
🏆Completed
AnalysisFunctional AnalysisMathematical Physics+1·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics IX: The Free Schrödinger OperatorTextbook

The free Schrödinger operator H0=−ΔH_0 = -\DeltaH0​=−Δ is the Hamiltonian of a quantum particle, or of NNN non-interacting particles, moving in Rn\mathbb R^nRn without external forces. Every Schrödinger operator H=−Δ+VH = -\Delta + VH=−Δ+V studied in quantum mechanics is a perturbation of it, and each standard tool of the theory refers back to H0H_0H0​: the Kato–Rellich theorem asks that VVV b…

12 thms4 active usersReviewed
🏆Completed
Linear algebraMachine Learning·Captain: mikedeng1

Geometric Deep Learning III: An n × n Matrix Commutes with the Cyclic Shift S if and only if It Is Circulant, So Convolution Is Shift EquivarianceTextbook

Convolutional neural networks process images, audio and time series with layers whose weights are shared across positions. The Geometric Deep Learning programme of Bronstein, Bruna, Cohen and Veličković (arXiv:2104.13478v2) explains this architecture by symmetry: on a grid the relevant symmetry is translation, and a linear layer that respects translations…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

The Sum-of-Squares Hierarchy on the Sphere, and Applications in Quantum Information Theory I: If 0 ⪯ F ⪯ I on S^{d−1} for a Degree-2n Matrix Polynomial F, Then F + C′ₙ(d/ℓ)²·I Is ℓ-SOS for ℓ ≥ CₙdResearch Paper

Maximizing a homogeneous polynomial ppp over the unit sphere, pmax⁡=max⁡x∈Sd−1p(x)p_{\max}=\max_{x\in S^{d-1}}p(x)pmax​=maxx∈Sd−1​p(x), covers the largest stable set of a graph (degree three), the 2→42\to42→4 norm of a matrix (degree four) and the best separable state problem of quantum information. For quadratic ppp it is an eigenvalue problem; for degree at least three it is NP-hard. The sum-of-squares…

23 thms3 active usersReviewed
🏆Completed
Analysis·Captain: wurtle

The Falconer distance conjecture in all dimensionsResearch Paper

For a set E⊂RdE\subset\mathbb R^dE⊂Rd the distance set is Δ(E)={∣x−y∣:x,y∈E}\Delta(E)=\{|x-y|:x,y\in E\}Δ(E)={∣x−y∣:x,y∈E}. Falconer (1985) asked how large a set must be, measured by Hausdorff dimension, to force Δ(E)\Delta(E)Δ(E) to have positive length. Examples built from lattices show that dimension d/2d/2d/2 is not enough in general, and Falconer conjectured that any compact set of dimension strictly greater…

23 thms3 active usersReviewed
🏆Completed
AnalysisProbabilityStochastic Systems·Captain: mikedeng1

Distribution Function Inequalities for Martingales 3: For Brownian Motion Stopped at Any Stopping Time τ, EΦ(X*(τ)) and EΦ(τ^{1/2}) Are ComparableResearch Paper

The size of a martingale can be measured in two ways: by its maximal function, the largest absolute value it reaches, and by a quadratic quantity that records how much it has moved, the square function in discrete time or the elapsed time in the case of Brownian motion. The Burkholder–Davis–Gundy inequalities say that these two measurements are comparable…

7 thms3 active usersReviewed
🏆Completed
AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 2: Gundy's Decomposition of an L¹-Bounded Martingale, with One Stopping TimeResearch Paper

Many operators of harmonic analysis are bounded on L2L^2L2 by an orthogonality argument but fail to be bounded on L1L^1L1; what survives at p=1p=1p=1 is a weak-type estimate λ P(∣Tf∣>λ)≤c ∥f∥1\lambda\,P(|Tf|>\lambda)\le c\,\|f\|_1λP(∣Tf∣>λ)≤c∥f∥1​. For singular integrals the standard route to such an estimate is the Calderón–Zygmund decomposition, which splits a function at height λ\lambdaλ into a bounded…

5 thms3 active usersReviewed
🏆Completed
AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations II: The Newtonian Potential and Hölder Estimates for Poisson's EquationTextbook

Poisson's equation −Δu=f-\Delta u = f−Δu=f is the model elliptic partial differential equation. It describes the electrostatic potential of a charge density, the gravitational potential of a mass density, and the steady temperature of a body with internal heat sources. Its solution on the whole space by convolution with a point-source potential, and the fact that…

36 thms3 active usersReviewed
🏆Completed
Number Theory·Captain: LG

Connes: Weil positivity and the Riemann zeta functionResearch Paper

The Riemann hypothesis (RH) asserts that every zero of the Riemann zeta function ζ\zetaζ in the strip 0<Re⁡s<10 < \operatorname{Re} s < 10<Res<1 has Re⁡s=12\operatorname{Re} s = \tfrac12Res=21​. One of the few reformulations that turns RH into a positivity statement, rather than a statement about the location of points, goes back to A. Weil (1952): the explicit formula expresses a sum…

14 thms3 active usersReviewed
🏆Completed
Number Theory·Captain: LG

Gelbart's Langlands Survey I: Hecke's Correspondence between Automorphic Forms and Dirichlet SeriesResearch Paper

The Langlands program proposes that the arithmetic of number fields is encoded in the representation theory of reductive groups over their adele rings. Its conjectures — reciprocity and functoriality — are stated in the survey this mission formalizes, Gelbart 1984, only after a long preparatory part on the classical results they generalize, and it is that…

12 thms3 active usersReviewed
🏆Completed
Machine Learning·Captain: mikedeng1

The Spectral Cost of Sharpness: Fourier Truncation, the Gibbs Bend, and the Computability of ClassificationResearch Paper

A classifier that is a finite Fourier sum cannot jump. Sharpness, meaning how quickly a classifier passes from confidently negative to confidently positive across a decision boundary, therefore has a price in bandwidth, the largest frequency it uses. Wenwei Li's manuscript The Spectral Cost of Sharpness (STOC 2027 submission #122) puts a number on that…

24 thms2 active usersReviewed
🏆Completed
Analysis·Captain: dbenbenn

The Bochner–Riesz conjecture implies the restriction conjecture (Tao 1999)Research Paper

This mission formalizes Terence Tao, The Bochner–Riesz conjecture implies the restriction conjecture, Duke Math. J. 96 (1999) 363–375 (doi:10.1215/S0012-7094-99-09610-2), from the author's preprint (restriction.dvi), whose page numbers are used throughout.

34 thms2 active usersReviewed
🏆Completed
Group TheoryMachine Learning·Captain: mikedeng1

Geometric Deep Learning IV: Group Convolution (x ⋆ θ)(g) = ⟨x, ρ(g)θ⟩ Against an Invariant Measure Is Equivariant, (ρ(h)x) ⋆ θ = ρ(h)(x ⋆ θ)Textbook

Convolutional networks use the same filter at many locations. A shift of the input then shifts the output in a predictable way, allowing one set of filter coefficients to serve every location. Bronstein, Bruna, Cohen and Veličković, Geometric Deep Learning, §4.3, pp. 40–43 ask how this idea extends when the transformations form a group and the signal domain…

5 thms2 active usersReviewed
🏆Completed
AnalysisMachine LearningProbability+1·Captain: Shuze Chen

The Nature of Statistical Learning Theory VI: Kernels Generating Regularized Fourier ExpansionsTextbook

A support vector machine never computes its feature map. It only evaluates a kernel K(x,y)K(x, y)K(x,y), the inner product of the feature vectors of xxx and yyy. When the features are the first NNN terms of an expansion, or infinitely many terms damped by regularizing weights, the learning algorithm is practical only if that inner product has a closed form. Chapter 6 of V.…

10 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: LG

Schwartz Space (Wikipedia): the Fourier Transform is an Automorphism of 𝒮(ℝⁿ)Textbook

The Schwartz space S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) of smooth, rapidly decreasing functions is the standard domain on which Fourier analysis on Rn\mathbb{R}^nRn works without integrability caveats. Its defining property, singled out in the lead of the source article, is that the Fourier transform maps S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) isomorphically onto itself. By duality…

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

Unbounded Violations of the Square-Root Degree BoundOpen Problem

The linear Fourier coefficients measure a Boolean function’s correlation with individual inputs. The source studies whether their sum can be controlled solely by the square root of the function’s real polynomial degree. The source is OpenAI's September 2026 manuscript.

33 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

Riesz transforms and uniform rectifiability in higher codimensionOpen Problem

Singular integral estimates can detect geometric regularity in a measure whose support has no given parametrization. The mission turns a uniform Riesz-transform bound into uniform pieces of Lipschitz images. The source manuscript presents the surrounding research claim.

13 thms2 active usersReviewed
🏆Completed
Functional AnalysisGroup Theory·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
PreviousPage 1 of 2Next

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