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
Dynamical SystemsMachine LearningProbability·Captain: mikedeng1

Approximation Bounds for Random Neural Networks and Reservoir Systems II: Echo State Networks with Random Weights Approximate Regular Functionals with an Explicit L² Error Bound (Theorem 2)Research Paper

Reservoir computing learns an input/output system from data in two stages. A dynamical system, the reservoir, is driven by the input sequence and its state is recorded; then only a linear readout of that state is trained, by least squares. The echo state network (ESN) is the most widely used reservoir: its state evolves by …

11 thms2 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Approximation Bounds for Random Neural Networks and Reservoir Systems I: Random ReLU Networks with Sampled Inner Weights Approximate Fourier-Represented Functions on a Hilbert Space (Theorem 1)Research Paper

In random-feature models, also called extreme learning machines or random neural networks, the inner weights of a one-hidden-layer network are drawn at random and only the linear readout is trained. Training is then a least-squares problem, which is why such models, and their dynamic counterparts reservoir computing and echo state networks, are used in…

8 thms2 active usersReviewed
AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 1: The Square Function and the Martingale Have Equivalent L^p Norms for 1 < p < ∞Research Paper

A martingale f=(f1,f2,… )f = (f_1, f_2, \dots)f=(f1​,f2​,…) is a sum fn=d1+⋯+dnf_n = d_1 + \cdots + d_nfn​=d1​+⋯+dn​ of increments that are uncorrelated with the past. For sums of independent random variables, sizes are compared through the sum of squares of the summands; for martingales the corresponding object is the square function

11 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations VII: The Heat Kernel and the Linear Heat and Schrödinger EquationsTextbook

The heat equation ut=Δuu_t = \Delta uut​=Δu and the free Schrödinger equation iut=−Δui u_t = -\Delta uiut​=−Δu are the two model evolution equations of linear PDE on Rn\mathbb{R}^nRn. The first describes diffusion and is the prototype of every parabolic equation; the second describes a free quantum particle and is the prototype of dispersive wave equations. Both are solved explicitly by…

12 thms2 active usersReviewed
Machine LearningTheoretical Computer Science·Captain: Shuze Chen

Learning Fourier-Sparse Signals and Multiband SignalsResearch Paper

Many uses of the continuous Fourier transform observe a signal only on a bounded time window. A basic model is the kkk-Fourier-sparse signal x(t)=∑j=1kαje2πifjtx(t)=\sum_{j=1}^k\alpha_je^{2\pi i f_jt}x(t)=∑j=1k​αj​e2πifj​t with complex amplitudes and arbitrary real frequencies in a bandlimit [−F,F][-F,F][−F,F], observed through point samples of y=x+ηy=x+\etay=x+η on [−1,1][-1,1][−1,1] with adversarial noise η\etaη. When the…

24 thms1 active userReviewed
Computational ComplexityProbability·Captain: mikedeng1

Testing Fourier Sparsity Near OptimallyResearch Paper

A Boolean function f:F2n→{−1,+1}f:\mathbb F_2^n\to\{-1,+1\}f:F2n​→{−1,+1} is sss-Fourier-sparse when at most sss of its Fourier coefficients are nonzero. Sparse functions include parities and kkk-juntas (which have at most 2k2^k2k nonzero coefficients), so sparsity is one of the basic "concise representation" classes of learning theory and property testing. A tester for this class reads fff at a…

16 thms1 active userReviewed
CombinatoricsComplexity TheoryProbability+1·Captain: Shuze Chen

Low Soundness Linearity Testing on Subsets of the HypercubeResearch Paper

A linearity test reads a function f:F2n→F2f:\mathbb F_2^n\to\mathbb F_2f:F2n​→F2​ at a few random points and accepts or rejects. It is perfectly complete if it always accepts linear functions. It has low soundness if, whenever it accepts with probability at least (1+δ)/2(1+\delta)/2(1+δ)/2, fff agrees with an affine function on at least a (1+s(δ))/2(1+s(\delta))/2(1+s(δ))/2 fraction of inputs, with s(δ)>0s(\delta)>0s(δ)>0…

22 thms1 active userReviewed
Complexity TheoryLinear algebra·Captain: mikedeng1

Lower Bounds for Memory-Efficient Differentially Private Continual CountingResearch Paper

Differentially private training of machine-learning models repeatedly releases noisy prefix sums of gradients. The mechanism with the best known accuracy for this task is the matrix mechanism: factor the prefix-sum matrix AnA_nAn​ as An=BCA_n=BCAn​=BC, and release B(Cx+z)=Anx+BzB(Cx+z)=A_nx+BzB(Cx+z)=An​x+Bz for Gaussian noise zzz. Fichtenberger, Henzinger and Upadhyay gave a lower-triangular Toeplitz sq…

37 thms1 active userReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

A Quadratic Bogolyubov Theorem and Quantum Worst-Case to Average-Case ReductionsResearch Paper

Bogolyubov's lemma says that if a set A⊆F2nA\subseteq\mathbb F_2^nA⊆F2n​ has density α\alphaα, then the sumset A+A+A+AA+A+A+AA+A+A+A contains a linear subspace of codimension bounded in terms of α\alphaα. It is a basic tool of additive combinatorics, and it underlies additive-combinatorial worst-case to average-case reductions for linear maps: a point of the subspace is a sum of points…

25 thms1 active userReviewed
Quantum InformationRepresentation TheoryTheoretical Computer Science·Captain: iris

Quantum Lazy Sampling and Path Recording for Any GroupResearch Paper

Many arguments in quantum cryptography and query complexity analyse an algorithm that queries a unitary drawn at random from a group: a Haar-random unitary, a random permutation matrix, a random diagonal phase, a random orthogonal matrix. Classically such arguments use lazy sampling: a random function is never fixed in advance, its values are drawn when…

27 thms1 active userReviewed
Numerical AnalysisProbability·Captain: iris

Quasi-Monte Carlo Beyond Hardy–Krause II: (1+ε)n(1 + \varepsilon) n(1+ε)n Samples SufficeResearch Paper

Numerical integration estimates fˉ=∫[0,1)df(z) dz\bar f = \int_{[0,1)^d} f(z)\,dzfˉ​=∫[0,1)d​f(z)dz by the average of fff over an nnn-point set AAA, with error err⁡(A,f)=∣A∣−1∑z∈Af(z)−fˉ\operatorname{err}(A,f) = |A|^{-1}\sum_{z\in A} f(z) - \bar ferr(A,f)=∣A∣−1∑z∈A​f(z)−fˉ​. Monte Carlo (independent uniform points) has mean-squared error σ2(f)/n\sigma^2(f)/nσ2(f)/n, where σ(f)\sigma(f)σ(f) is the standard deviation of fff. Quasi-Monte Carlo uses deterministic…

25 thms1 active userReviewed
Functional AnalysisProbability·Captain: iris

A Class of Gaussian Processes with Fractional Spectral Measures: The Wick-Ito Integral Against the Derivative Process Is the Limit of Wick Riemann SumsResearch Paper

A centered Gaussian process with stationary increments is determined by a spectral measure σ\sigmaσ on R\mathbb RR: its covariance is ∫χt(u)χs(u)‾ dσ(u)\int\chi_t(u)\overline{\chi_s(u)}\,d\sigma(u)∫χt​(u)χs​(u)​dσ(u) with χt(u)=(eitu−1)/u\chi_t(u)=(e^{itu}-1)/uχt​(u)=(eitu−1)/u. Brownian motion corresponds to Lebesgue measure and fractional Brownian motion to a power density. When σ\sigmaσ has a density mmm, a stochastic calculus for…

48 thms1 active userReviewed
Discrete GeometryMathematical Physics·Captain: vatsj

Thomson problem: N = 9, 10 and 32Open Problem

Place NNN distinct points x1,…,xNx_1,\dots,x_Nx1​,…,xN​ on the unit sphere in R3\mathbb{R}^3R3 to minimise the Coulomb energy

6 thms1 active userReviewed
Numerical AnalysisProbability·Captain: mikedeng1

Isotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations III: Karhunen–Loève Truncation Error ≤ κ^{−β} a.s. for β < (α−2)/2Research Paper

An isotropic Gaussian random field is a spatial random quantity whose probability law is unchanged when the sphere is rotated. Such fields model spatially distributed uncertainty when no direction is preferred. The question in this mission is concrete: if a field is simulated by retaining only finitely many spherical harmonic frequencies, how rapidly does…

7 thms1 active userReviewed
Probability·Captain: mikedeng1

Isotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations II: Σ A_ℓ ℓ^{1+β} < ∞ Gives a Continuous Modification, γ-Hölder for γ < β/2Research Paper

A random field on a sphere assigns a random value to every direction. Such fields appear when the underlying data are directional, including spherical models in spatial statistics and geophysics. The covariance of an isotropic field can be recorded by an angular power spectrum: one nonnegative number for each spherical harmonic degree. This changes the…

7 thms1 active userReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations IX: Local Existence for a Semilinear Heat Equation and the Nonlinear Schrödinger EquationTextbook

Reaction–diffusion equations ut=Δu+f(u)u_t = \Delta u + f(u)ut​=Δu+f(u) are the standard model for the interplay of diffusion with local growth or decay: chemical kinetics, population dynamics, and the bifurcation of equilibria of partial differential equations. The special case

7 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