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
CombinatoricsNumber Theory·Captain: wurtle

A power saving for square-difference-free setsResearch Paper

A set A⊆{1,…,N}A\subseteq\{1,\dots,N\}A⊆{1,…,N} is square-difference-free if no two of its elements differ by a perfect square m2m^2m2 with m≥1m\ge1m≥1. The Furstenberg–Sárközy theorem says such sets have density tending to zero; the question is how fast. Writing s(N)s(N)s(N) for the largest size of a square-difference-free subset of {1,…,N}\{1,\dots,N\}{1,…,N}, the problem is a prototype for polynomial…

4 thms2 active usersReviewed
🏆Completed
Dynamical SystemsFunctional 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
Discrete Geometry·Captain: wurtle

A sharp Fourier certificate for planar circle packingResearch Paper

How densely can equal disks be packed in the plane? The hexagonal arrangement, with centers on the triangular lattice, covers a fraction π/(23)≈0.9069\pi/(2\sqrt3)\approx0.9069π/(23​)≈0.9069 of the plane, and Thue's theorem says no packing does better. In 2003 Cohn and Elkies introduced a linear programming bound for sphere packing: a single auxiliary function whose values are…

264 thms2 active usersReviewed
🏆Completed
Discrete GeometryMathematical Physics·Captain: wurtle

An atomic certificate for triangular-lattice universal optimalityResearch Paper

Which arrangement of points in the plane minimizes interaction energy? For many repulsive interactions the expected answer is the triangular (hexagonal) lattice. Universal optimality, formulated by Cohn and Kumar (2007, doi:10.1090/S0894-0347-06-00546-7), asks for a single configuration that minimizes energy simultaneously for every completely monotone…

5 thms2 active usersReviewed
🏆Completed
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
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
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
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
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
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
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
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 1: The Quantum Fourier Transform Circuit Computes A_q up to Bit ReversalResearch Paper

Shor's factoring and discrete logarithm algorithms (Shor 1997) reduce both problems to sampling from the output of a quantum Fourier transform: a register holding a superposition with a hidden period is transformed, then measured, and the measured value carries information about the period. The whole speed-up rests on one engineering fact: for q=2lq = 2^lq=2l the …

5 thms2 active usersReviewed
🏆Completed
AnalysisPure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables IV: Plurisubharmonic Functions and Hartogs PseudoconvexityTextbook

In one complex variable every open set is the natural domain of some holomorphic function. In several variables this fails: by the Hartogs phenomenon, every function holomorphic on some domains extends to a strictly larger one. The domains that are "natural", the domains of holomorphy, are characterised by a convexity condition on the domain. Since the work…

26 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Analise de Fourier I: Parseval's Theorem for Fourier SeriesTextbook

Periodic signals are the basic objects of audio processing, electrical engineering and the analytic study of partial differential equations, and the standard first-course tool for handling them is the Fourier series: a decomposition of a TTT-periodic signal into sinusoids of frequencies ωn=2πn/T\omega_n = 2\pi n / Tωn​=2πn/T. The identity that makes the decomposition…

11 thms2 active usersReviewed
🏆Completed
Numerical Analysis·Captain: LG

Fast Fourier Transform I: Correctness of the Radix-2 Cooley–Tukey AlgorithmTextbook

The discrete Fourier transform (DFT) is the basic spectral tool of digital signal processing, numerical analysis and computational number theory: it turns a finite sample of a signal into its frequency content, converts convolution into pointwise multiplication, and underlies fast integer and polynomial multiplication. Computed straight from its defining…

11 thms2 active usersReviewed
🏆Completed
Captain: Elsie66

Fejér's TheoremTextbook

The Fourier series of a periodic function decomposes it into sinusoidal components, but the partial sums of that series need not converge to the function even when the function is continuous: du Bois-Reymond exhibited in 1873 a continuous 2π2\pi2π-periodic function whose Fourier partial sums diverge at a point. Fejér's 1904 theorem repairs this failure by…

10 thms2 active usersReviewed
🏆Completed
Functional AnalysisProbability·Captain: Elsie66

Bochner's Theorem: Positive-Definite FunctionsTextbook

Positive-definite functions sit at a crossroads of harmonic analysis, probability, and machine learning. A function f:R→Cf:\mathbb R\to\mathbb Cf:R→C is positive-definite if, for every finite family of points x1,…,xnx_1,\dots,x_nx1​,…,xn​ and complex coefficients c1,…,cnc_1,\dots,c_nc1​,…,cn​, the Hermitian quadratic form ∑i,jci‾cjf(xi−xj)\sum_{i,j}\overline{c_i}c_j f(x_i-x_j)∑i,j​ci​​cj​f(xi​−xj​) is real and nonnegative. This single…

8 thms2 active usersReviewed
🏆Completed
Partial Differential Equations·Captain: Mazecto

Calderón–Zygmund Theory and the L^p Estimate for the Cauchy–Riemann OperatorTextbook

The Cauchy–Riemann operator ∂ˉ=∂s+i ∂t\bar\partial=\partial_s+i\,\partial_t∂ˉ=∂s​+i∂t​ on C\mathbb{C}C is the model elliptic operator of symplectic topology: pseudoholomorphic curves solve nonlinear perturbations of ∂ˉu=0\bar\partial u=0∂ˉu=0, and their regularity, compactness and Fredholm theory all start from an LpL^pLp a priori estimate for ∂ˉ\bar\partial∂ˉ. In Hofer–Wysocki–Zehnder's…

15 thms1 active userReviewed
🏆Completed
Functional AnalysisSymplectic Geometry·Captain: Mazecto

Conley–Zehnder Index II: Asymptotic Operators on the CircleResearch Paper

Let S:S1→R2n×2nS : S^1 \to \mathbb{R}^{2n\times 2n}S:S1→R2n×2n be a loop of symmetric matrices. The asymptotic operator

34 thms1 active userReviewed
🏆Completed
Machine LearningProbability·Captain: Elsie66

ClockRoPE: Random Fourier RotationsResearch Paper

Transformer sequence models modulate attention scores by a function of the relative position between a query and a key: the attention logit between token mmm and token nnn is scaled by a fixed profile f(pm−pn)f(p_m - p_n)f(pm​−pn​). Realizing this modulation the naive way means evaluating fff once per pair (m,n)(m,n)(m,n) and materializing an L×LL\times LL×L adjustment over the whole sequence —…

5 thms1 active userReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: lisamegawatts

Finite Reflection Positivity Methods I: Split Weights and Infrared ModesTextbook

Reflection positivity and infrared bounds form a standard finite-volume route from the geometry of a lattice reflection to quantitative control of long wavelength fluctuations. In the classical argument, reflection positivity supplies a Cauchy--Schwarz inequality for reflected observables, while Fourier diagonalization of the lattice Laplacian identifies…

11 thms1 active userReviewed
PreviousPage 2 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