Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

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

Harmonic Analysis

58 missions · 29 completed

Missions

Open29Completed29All58
🏆Completed
Analysis·Captain: wurtle

The maximal triangular Hilbert transform at the symmetric pointResearch Paper

Motivation: the triangular Hilbert transform

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

B(F,G)(x,y)=p.v. ⁣∫RF(x+t,y) G(x,y+t) dtt.B(F,G)(x,y)=\mathrm{p.v.}\!\int_{\mathbb R}F(x+t,y)\,G(x,y+t)\,\frac{dt}{t}.B(F,G)(x,y)=p.v.∫R​F(x+t,y)G(x,y+t)tdt​.

Paired with a third function, it becomes a trilinear form whose three inputs depend on the three pairs of variables of (a,b,c)(a,b,c)(a,b,c). This "triangular" or entangled structure defeats the time–frequency methods that handle the one-dimensional bilinear Hilbert transform. Boundedness of this operator is a model problem for multilinear singular integrals with simplex structure, and is closely tied to norm convergence and variation of ergodic averages for two commuting transformations. Thiele listed the symmetric case (L3×L3×L3L^3\times L^3\times L^3L3×L3×L3) as Problem 13 in the 2017 collection Some problems in harmonic analysis.

Timeline

  • 2010 — Demeter and Thiele study the two-dimensional bilinear Hilbert transform and highlight the flat triangular operator (Amer. J. Math.).
  • 2012 — Kovač proves boundedness of the twisted paraproduct, a bipartite relative of the triangular form, by energy telescoping (Rev. Mat. Iberoam.).
  • 2015 — Kovač, Thiele and Zorin-Kranich prove bounds for a Walsh (dyadic) model with one structurally restricted input (Forum Math. Sigma).
  • 2016–2017 — Tao proves sublogarithmic cancellation for multilinear Hilbert transforms (Collect. Math.); Zorin-Kranich extends it to simplex Hilbert transforms (Math. Res. Lett.); Thiele's problem appears in Grafakos et al. (arXiv:1701.06637).
  • 2019 — Durcik, Kovač, Škreb and Thiele obtain square-root cancellation across finitely many smooth scales (Ergodic Theory Dynam. Systems); Durcik, Kovač and Thiele prove power-type cancellation with hard truncations, still growing like log⁡(R/ε)\sqrt{\log(R/\varepsilon)}log(R/ε)​ at the symmetric point (J. Anal. Math.).
  • 2021 — Durcik and Roos bound averages over directions (Proc. AMS); Christ, Durcik and Roos treat the curved variant along (t,t2)(t,t^2)(t,t2) (Adv. Math.).
  • 2026 — An OpenAI preprint, The maximal triangular Hilbert transform at the symmetric point (OpenAI Math Release, September 24, 2026), claims the scale-free L3×L3→L3/2L^3\times L^3\to L^{3/2}L3×L3→L3/2 bound for the maximal truncated operator. It has not been peer reviewed, and its proof is not formally verified.

Setting

For complex functions F,GF,GF,G on R2\mathbb R^2R2 and 0<ε<R<∞0<\varepsilon<R<\infty0<ε<R<∞, the hard truncation is

Bε,R(F,G)(x,y)=∫ε<∣t∣<RF(x+t,y) G(x,y+t) dtt,B_{\varepsilon,R}(F,G)(x,y)=\int_{\varepsilon<|t|<R}F(x+t,y)\,G(x,y+t)\,\frac{dt}{t},Bε,R​(F,G)(x,y)=∫ε<∣t∣<R​F(x+t,y)G(x,y+t)tdt​,

and the maximal truncation is

B∗(F,G)(x,y)=sup⁡0<ε<R<∞∣Bε,R(F,G)(x,y)∣.B_*(F,G)(x,y)=\sup_{0<\varepsilon<R<\infty}\bigl|B_{\varepsilon,R}(F,G)(x,y)\bigr| .B∗​(F,G)(x,y)=0<ε<R<∞sup​​Bε,R​(F,G)(x,y)​.

For F,G∈L3(R2)F,G\in L^3(\mathbb R^2)F,G∈L3(R2) the finite truncations converge absolutely outside a common null set, and B∗B_*B∗​ is measurable (Lemma 7.1 of the source).

Formalization targets

Goal: the maximal triangular Hilbert transform is bounded at the symmetric point (Theorem 1.1)

There is an absolute constant CCC such that, for all complex F,G∈L3(R2)F,G\in L^3(\mathbb R^2)F,G∈L3(R2),

∥B∗(F,G)∥L3/2(R2)≤C ∥F∥L3(R2)∥G∥L3(R2).\|B_*(F,G)\|_{L^{3/2}(\mathbb R^2)}\le C\,\|F\|_{L^3(\mathbb R^2)}\|G\|_{L^3(\mathbb R^2)} .∥B∗​(F,G)∥L3/2(R2)​≤C∥F∥L3(R2)​∥G∥L3(R2)​.

The Lean goal also includes the measure-theoretic preliminaries of Lemma 7.1: almost every point is a point where all finite truncations converge absolutely, and B∗B_*B∗​ is almost-everywhere measurable. The goal statement is published on the platform with status Open.

Significance

The result itself. A uniform bound for the maximal operator controls a truncation chosen independently at each point, which is stronger than a uniform bound on each Bε,RB_{\varepsilon,R}Bε,R​. It yields existence of the joint principal value B(F,G)B(F,G)B(F,G) almost everywhere and in L3/2L^{3/2}L3/2 (Theorem 7.2). By duality and a determinant-one change of variables, it gives endpoint-uniform bounds for the symmetric trilinear triangular form ∭G0(a,b)G1(b,c)G2(c,a) da db dca+b+c\iiint G_0(a,b)G_1(b,c)G_2(c,a)\,\frac{da\,db\,dc}{a+b+c}∭G0​(a,b)G1​(b,c)G2​(c,a)a+b+cdadbdc​, which resolves Thiele's Problem 13 positively. Earlier bounds all grew with the number of scales.

Formalizing it. The estimate is a clean statement in Mathlib's LpL^pLp and lower-integral language. Its proof combines matrix trace inequalities, Gaussian heat-flow energies and discretization limits, all of which would have to be built. The finite-dimensional matrix inequalities (Sections 2–3 of the source) are self-contained and reusable for other entangled multilinear forms.

Difficulty

Time–frequency analysis, which handles the one-dimensional bilinear Hilbert transform, does not adapt to the triangular form because its three inputs are entangled: each depends on a different pair of variables, so no single frequency-localization serves all three. Energy and telescoping methods (Kovač; Durcik) work for bipartite forms, but the triangular cycle is the documented obstruction. Previous cancellation estimates lose a factor depending on the number of scales log⁡(R/ε)\log(R/\varepsilon)log(R/ε). The maximal version adds a further difficulty: the truncation endpoints vary from point to point, so the energy argument must tolerate entries that switch on and off at independently chosen scales, without losses depending on the number of scales or on matrix dimensions.

Formalization scope

  • Functions are ℝ × ℝ → ℂ with Lebesgue measure; hypotheses are MemLp F 3 and MemLp G 3 (which include a.e. strong measurability).
  • truncation F G E z is the Bochner integral of F(x+t,y)G(x,y+t)/tF(x+t,y)G(x,y+t)/tF(x+t,y)G(x,y+t)/t over {ε<∣t∣<R}\{\varepsilon<|t|<R\}{ε<∣t∣<R}, with endpoints packaged as Endpoints (0<ε<R0<\varepsilon<R0<ε<R).
  • GoodPoint requires integrability on the annuli 1/(n+2)<∣t∣<n+21/(n+2)<|t|<n+21/(n+2)<∣t∣<n+2 for all nnn, hence on every finite annulus. maximal is the ℝ≥0∞-valued supremum over all endpoint pairs at good points, and 000 elsewhere. The goal asserts that almost every point is good, so this junk value cannot help.
  • The norm is (∫−B∗3/2)2/3\bigl(\int^- B_*^{3/2}\bigr)^{2/3}(∫−B∗3/2​)2/3 in ℝ≥0∞, compared with eLpNorm F 3 * eLpNorm G 3. The constant is an existential ℝ≥0, so it is finite and independent of F,GF,GF,G.
  • Needed infrastructure: discretization of L3L^3L3 functions, finite-dimensional trace inequalities for tr⁡((R∗R)3/2)\operatorname{tr}((R^*R)^{3/2})tr((R∗R)3/2), Gaussian heat-flow monotonicity, one-dimensional Hardy–Littlewood maximal bounds, and limits of smooth truncations. Contributions on the matrix inequalities or the jump-control lemma are welcome.

Selected references

  • C. Demeter and C. Thiele, On the two-dimensional bilinear Hilbert transform, Amer. J. Math. (2010). https://doi.org/10.1353/ajm.0.0101
  • V. Kovač, Boundedness of the twisted paraproduct, Rev. Mat. Iberoam. https://doi.org/10.4171/RMI/707
  • V. Kovač, C. Thiele and P. Zorin-Kranich, Dyadic triangular Hilbert transform of two general functions and one not too general function, Forum Math. Sigma (2015). https://doi.org/10.1017/fms.2015.25
  • T. Tao, Cancellation for the multilinear Hilbert transform, Collect. Math. (2016). https://arxiv.org/abs/1505.06479v3
  • P. Zorin-Kranich, Cancellation for the simplex Hilbert transform, Math. Res. Lett. (2017). https://doi.org/10.4310/MRL.2017.v24.n2.a16
  • L. Grafakos, D. Oliveira e Silva, M. Pramanik, A. Seeger and B. Stovall, Some problems in harmonic analysis (2017), Section 9, Problem 13. https://arxiv.org/abs/1701.06637v1
  • P. Durcik, V. Kovač, K. A. Škreb and C. Thiele, Norm-variation of ergodic averages with respect to two commuting transformations, Ergodic Theory Dynam. Systems (2019). https://doi.org/10.1017/etds.2017.48
  • P. Durcik, V. Kovač and C. Thiele, Power-type cancellation for the simplex Hilbert transform, J. Anal. Math. (2019). https://doi.org/10.1007/s11854-019-0052-4
  • OpenAI, The maximal triangular Hilbert transform at the symmetric point, OpenAI Math Release preprint, September 24, 2026 (Theorem 1.1, p. 2; Lemma 7.1, p. 24). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-maximal-triangular-Hilbert-transform-at-the-symmetric-point-September-24-2026/paper.pdf
68 thms4 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

Motivation

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, Burkholder developed distribution function inequalities that cover many choices of size measure at once, extending the power norm comparisons treated earlier in the paper. Burkholder, 1973

The target of this mission is Theorem 15.1 of that paper: a two sided comparison for every convex function of moderate growth. The paper attributes the decomposition of a martingale into small and large jumps to Davis, and cites a convex comparison lemma introduced in earlier work and subsequently treated by Garsia and Neveu. These attributions matter to the scope of the mission: the decomposition and lemma are separate, named milestones, while Burkholder's printed two sided inequality is the goal. Burkholder, 1973, §§14–16

Setting

Work on a probability space (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) with an increasing sequence of sub sigma fields A0,A1,…\mathcal A_0,\mathcal A_1,\ldotsA0​,A1​,…. A real martingale f=(f1,f2,…)f=(f_1,f_2,\ldots)f=(f1​,f2​,…) is observed from time 111 onward. Following the paper, put f0=0f_0=0f0​=0 in the formulas for its differences: d1=f1d_1=f_1d1​=f1​ and dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​ for k≥2k\ge2k≥2. This convention differs from the index zero value required for a Lean martingale, which is discussed below.

The square function S(f)S(f)S(f) and maximal function f∗f^*f∗ are pathwise quantities:

S(f)=(∑k=1∞dk2)1/2,f∗=sup⁡k≥1∣fk∣.S(f)=\left(\sum_{k=1}^{\infty}d_k^2\right)^{1/2}, \qquad f^*=\sup_{k\ge1}|f_k|.S(f)=(k=1∑∞​dk2​)1/2,f∗=k≥1sup​∣fk​∣.

Either quantity can be infinite. Their finite versions stop at nnn: Sn(f)S_n(f)Sn​(f) sums the first nnn squared differences, and fn∗f_n^*fn∗​ takes the maximum through time nnn. For a positive exponent ppp, the paper writes ∥f∥p=sup⁡n≥1(E∣fn∣p)1/p\|f\|_p=\sup_{n\ge1}(E|f_n|^p)^{1/p}∥f∥p​=supn≥1​(E∣fn​∣p)1/p. The notation EΦ(Y)E\Phi(Y)EΦ(Y) means the expectation of a nonnegative transform of a nonnegative random variable YYY.

A function of moderate growth is a nondecreasing continuous Φ:[0,∞]→[0,∞]\Phi:[0,\infty]\to[0,\infty]Φ:[0,∞]→[0,∞] with Φ(0)=0\Phi(0)=0Φ(0)=0 and

Φ(2x)≤c(6.1)Φ(x)(x>0)\Phi(2x)\le c_{(6.1)}\Phi(x)\qquad(x>0)Φ(2x)≤c(6.1)​Φ(x)(x>0)

for some nonnegative growth constant c(6.1)c_{(6.1)}c(6.1)​. The target adds convexity on finite nonnegative arguments. The examples Φ(x)=x\Phi(x)=xΦ(x)=x and Φ(x)=xp\Phi(x)=x^pΦ(x)=xp for p≥1p\ge1p≥1 satisfy these conditions. The paper sets aside Φ≡0\Phi\equiv0Φ≡0 as trivial; the Lean statements allow it because every displayed comparison still holds.

Formalization targets

The two sided convex comparison

The goal is precisely the form printed as Theorem 15.1:

C1EΦ(S(f))≤EΦ(f∗)≤C2EΦ(S(f)),C1,C2>0.C_1 E\Phi(S(f))\le E\Phi(f^*)\le C_2 E\Phi(S(f)), \qquad C_1,C_2>0.C1​EΦ(S(f))≤EΦ(f∗)≤C2​EΦ(S(f)),C1​,C2​>0.

The constants depend only on c(6.1)c_{(6.1)}c(6.1)​, and are uniform over the probability space, filtration, martingale, and particular choice of Φ\PhiΦ with that growth bound. The statement includes both sides; the paper writes a proof for the right side and says the left side follows by the same pattern. No integrability or boundedness is imposed on fff or on the two expectations. Burkholder, 1973, Theorem 15.1, pp. 33–34

Supporting statements

The milestones record the paper's good λ\lambdaλ lemma, Doob's cited maximal estimate, the predictable jump inequalities of §12, the quasi subadditivity of Φ\PhiΦ, Davis's decomposition and its jump bounds, and the convexity lemma of §16. The latter compares a sum of nonnegative random variables with the sum of their conditional expectations. Its two Neveu statements are retained as cited intermediate targets. These results identify distinct mathematical interfaces that a solver can formalize and reuse; the milestone text is transcribed from the indicated pages of the article.

Significance

The theorem lets one replace the expected convex transform of a path's maximum by the expected transform of its quadratic fluctuation, up to constants controlled by a single growth parameter. Choosing Φ(x)=x\Phi(x)=xΦ(x)=x recovers the L1L^1L1 comparison displayed after Davis's decomposition; choosing a convex power gives the p≥1p\ge1p≥1 power cases. The assertion is useful even when one or both expectations are infinite, because it gives a uniform relation across the whole class of admissible martingales and functions. Burkholder, 1973, §§14–15

The result is proved in the paper. This mission asks for a machine checked Lean proof of the known theorem and of the selected statements that support it. The definitions for square and maximal functions, moderate growth, and nonnegative conditional projections can be reused in other martingale comparisons. A previously posed platform theorem about Robbins–Monro noise sums has the shape of one power function instance, but its process and time window differ; it does not supply this general result.

Difficulty

The size of a single martingale increment can dominate both a maximum and a square function. A direct comparison of the two pathwise expressions therefore gives no uniform expectation bound for arbitrary martingales and convex Φ\PhiΦ. The §12 estimates require predictable control of jumps, while the target has no such hypothesis. Davis's decomposition exposes the small and large jump contributions as different objects, and the §16 convexity lemma is needed to compare the conditional terms arising from large jumps. Convexity is essential for that lemma and for Theorem 15.1; the §12 good λ\lambdaλ statements themselves assume only moderate growth. Burkholder, 1973, §§12, 14–16

Formalization scope

Lean uses Mathlib's Martingale f ℱ P for a process indexed by natural numbers. The article begins at 111 and uses f0=0f_0=0f0​=0 only in its difference formulas. The definitions of dkd_kdk​, S(f)S(f)S(f), f∗f^*f∗, and ∥f∥p\|f\|_p∥f∥p​ therefore read positive indices and insert zero in the article's formulas; Lean's actual f(0)f(0)f(0) is the compatible conditional expectation extension needed by Mathlib. Davis's partial sums also begin at 111, and the decomposition theorem specifies the index zero extensions for its two martingales.

The square function, maximal function, LpL^pLp norm, and all nonnegative expectations take values in [0,∞][0,\infty][0,∞]. This retains unbounded sample paths and nonintegrable expectations. For a nonnegative variable zkz_kzk​, E(zk∣Ak−1)E(z_k\mid\mathcal A_{k-1})E(zk​∣Ak−1​) is the extended conditional expectation condLExp, so a nonintegrable zkz_kzk​ cannot silently become zero. Davis's signed yky_kyk​ is integrable, so its real conditional expectation uses Mathlib's ordinary conditional expectation. Predictable bounds such as ∣dk∣≤wk|d_k|\le w_k∣dk​∣≤wk​ and the resulting claims are stated almost everywhere at each positive index.

The Lean predicate for moderate growth states the doubling law at zero and infinity as well as positive finite xxx; zero is automatic from Φ(0)=0\Phi(0)=0Φ(0)=0, and the endpoint at infinity follows by continuity in the nontrivial case. Convexity is read from finite real arguments. The zero function is included. A valid formalization must retain both inequalities in the goal and choose its constants before the martingale and Φ\PhiΦ; choosing constants after the data would make the goal much weaker.

The development needs finite and infinite square function sums, maximal functions, stopping and tail events, Mathlib martingales, conditional expectations, and convexity on the nonnegative reals. Contributions proving or improving any of the named milestones are welcome, including independent proofs of the cited Doob and Neveu statements. No extra boundedness or integrability assumption should be inserted into the goal to simplify a proof.

Selected references

  • D. L. Burkholder, Distribution Function Inequalities for Martingales, The Annals of Probability 1(1), 1973, pp. 19–42. DOI.
16 thms4 active usersReviewed
🏆Completed
AnalysisFunctional AnalysisMathematical Physics+1·Captain: mikedeng1

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

Motivation

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 be relatively bounded with respect to H0H_0H0​, Weyl's theorem compares essential spectra with that of H0H_0H0​, and scattering theory compares the dynamics e−itHe^{-itH}e−itH with the free dynamics e−itH0e^{-itH_0}e−itH0​. Knowing exactly what H0H_0H0​ is (its domain, its self-adjointness, its spectrum and its time evolution) is therefore the base case of the spectral theory of Schrödinger operators.

All of this is obtained from one tool, the Fourier transform, which turns differentiation into multiplication. This mission follows Chapter 7 of G. Teschl, Mathematical Methods in Quantum Mechanics (AMS GSM 99, 2009), doi:10.1090/gsm/099. The chapter first develops the Fourier transform on the Schwartz space, on L1L^1L1 and on L2L^2L2, and then applies it to H0H_0H0​. The same material appears in Reed–Simon (Vol. II, Sec. IX.1 and IX.7).

Setting

Write Rn\mathbb R^nRn for Euclidean space with px=∑jpjxjpx = \sum_j p_j x_jpx=∑j​pj​xj​ and x2=∣x∣2x^2 = |x|^2x2=∣x∣2. For an integrable f:Rn→Cf : \mathbb R^n \to \mathbb Cf:Rn→C the Fourier transform and its inverse are

f^(p)=F(f)(p)=1(2π)n/2∫Rne−ipxf(x) dnx,gˇ(x)=1(2π)n/2∫Rneipxg(p) dnp.\hat f(p) = \mathcal F(f)(p) = \frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n} e^{-ipx} f(x)\,d^nx, \qquad \check g(x) = \frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n} e^{ipx} g(p)\,d^np .f^​(p)=F(f)(p)=(2π)n/21​∫Rn​e−ipxf(x)dnx,gˇ​(x)=(2π)n/21​∫Rn​eipxg(p)dnp.

The Schwartz space S(Rn)\mathcal S(\mathbb R^n)S(Rn) consists of the smooth functions all of whose derivatives decay faster than any polynomial. L1(Rn)L^1(\mathbb R^n)L1(Rn) and L2(Rn)L^2(\mathbb R^n)L2(Rn) are the usual Lebesgue spaces, and C∞(Rn)C_\infty(\mathbb R^n)C∞​(Rn) denotes the continuous functions vanishing at infinity. The convolution of f,g∈L1f, g \in L^1f,g∈L1 is (f∗g)(x)=∫f(y)g(x−y) dny(f*g)(x) = \int f(y)g(x-y)\,d^ny(f∗g)(x)=∫f(y)g(x−y)dny.

The Sobolev space is H2(Rn)={ψ∈L2∣p2ψ^(p)∈L2}H^2(\mathbb R^n) = \{\psi \in L^2 \mid p^2\hat\psi(p) \in L^2\}H2(Rn)={ψ∈L2∣p2ψ^​(p)∈L2}. The free Schrödinger operator is

H0ψ=−Δψ=F−1(p2ψ^(p)),D(H0)=H2(Rn),H_0\psi = -\Delta\psi = \mathcal F^{-1}\big(p^2\hat\psi(p)\big), \qquad \mathfrak D(H_0) = H^2(\mathbb R^n),H0​ψ=−Δψ=F−1(p2ψ^​(p)),D(H0​)=H2(Rn),

in units with ℏ=1\hbar = 1ℏ=1 and mass m=1/2m = 1/2m=1/2. Its time evolution is e−itH0ψ=F−1(e−itp2ψ^)e^{-itH_0}\psi = \mathcal F^{-1}(e^{-itp^2}\hat\psi)e−itH0​ψ=F−1(e−itp2ψ^​). For a linear operator AAA with domain D(A)\mathfrak D(A)D(A), the resolvent set ρ(A)\rho(A)ρ(A) is the set of z∈Cz \in \mathbb Cz∈C for which A−zA - zA−z maps D(A)\mathfrak D(A)D(A) bijectively onto the Hilbert space with a bounded inverse RA(z)R_A(z)RA​(z), and the spectrum is σ(A)=C∖ρ(A)\sigma(A) = \mathbb C\setminus\rho(A)σ(A)=C∖ρ(A). For self-adjoint AAA and a vector ψ\psiψ, the spectral measure μψ\mu_\psiμψ​ is the finite Borel measure on R\mathbb RR with ⟨ψ,RA(z)ψ⟩=∫(λ−z)−1 dμψ(λ)\langle\psi, R_A(z)\psi\rangle = \int (\lambda - z)^{-1}\,d\mu_\psi(\lambda)⟨ψ,RA​(z)ψ⟩=∫(λ−z)−1dμψ​(λ) for all z∉Rz \notin \mathbb Rz∈/R. The absolutely continuous, singular continuous and pure point spectra σac,σsc,σpp\sigma_{ac}, \sigma_{sc}, \sigma_{pp}σac​,σsc​,σpp​ are the spectra of AAA restricted to the vectors whose spectral measures are of the respective type. A subspace D⊆D(A)D \subseteq \mathfrak D(A)D⊆D(A) is a core if the closure of A∣DA|_DA∣D​ is AAA.

Formalization targets

Goal: Theorem 7.8

For n≥1n \ge 1n≥1, H0H_0H0​ is self-adjoint and

σ(H0)=σac(H0)=[0,∞),σsc(H0)=σpp(H0)=∅.\sigma(H_0) = \sigma_{ac}(H_0) = [0,\infty), \qquad \sigma_{sc}(H_0) = \sigma_{pp}(H_0) = \emptyset .σ(H0​)=σac​(H0​)=[0,∞),σsc​(H0​)=σpp​(H0​)=∅.

In the Lean statement the spectral-type part is the equivalent assertion that every spectral measure μψ\mu_\psiμψ​ of H0H_0H0​ is absolutely continuous with respect to Lebesgue measure.

Milestones

  • Gaussians (Lemma 7.3). For Re⁡z>0\operatorname{Re} z > 0Rez>0, e−zx2/2∈S(Rn)e^{-zx^2/2} \in \mathcal S(\mathbb R^n)e−zx2/2∈S(Rn) and F(e−zx2/2)(p)=z−n/2e−p2/(2z)\mathcal F(e^{-zx^2/2})(p) = z^{-n/2} e^{-p^2/(2z)}F(e−zx2/2)(p)=z−n/2e−p2/(2z), with zn/2=(z)nz^{n/2} = (\sqrt z)^nzn/2=(z​)n for the principal root.
  • Inversion on S\mathcal SS (Theorem 7.4). F\mathcal FF is a bijection of S(Rn)\mathcal S(\mathbb R^n)S(Rn) with inverse g↦gˇg \mapsto \check gg↦gˇ​, and F2f(x)=f(−x)\mathcal F^2 f(x) = f(-x)F2f(x)=f(−x), so F4=I\mathcal F^4 = \mathbb IF4=I.
  • Plancherel (Theorem 7.5). F\mathcal FF extends to a unitary operator on L2(Rn)L^2(\mathbb R^n)L2(Rn) with σ(F)={1,−1,i,−i}\sigma(\mathcal F) = \{1,-1,i,-i\}σ(F)={1,−1,i,−i}.
  • Riemann–Lebesgue (Lemma 7.6). F:L1→C∞\mathcal F : L^1 \to C_\inftyF:L1→C∞​ is injective and ∥f^∥∞≤(2π)−n/2∥f∥1\|\hat f\|_\infty \le (2\pi)^{-n/2}\|f\|_1∥f^​∥∞​≤(2π)−n/2∥f∥1​.
  • Convolution (Lemma 7.7). f∗g∈L1f * g \in L^1f∗g∈L1, ∥f∗g∥1≤∥f∥1∥g∥1\|f*g\|_1 \le \|f\|_1\|g\|_1∥f∗g∥1​≤∥f∥1​∥g∥1​ and (f∗g)∧=(2π)n/2f^g^(f*g)^\wedge = (2\pi)^{n/2}\hat f\hat g(f∗g)∧=(2π)n/2f^​g^​.
  • Core (Lemma 7.9). Cc∞(Rn)C_c^\infty(\mathbb R^n)Cc∞​(Rn) is a core for H0H_0H0​.
  • Asymptotics (Lemma 7.10). For ψ∈L2\psi \in L^2ψ∈L2, e−itH0ψ(x)−(2it)−n/2eix2/(4t)ψ^(x/(2t))→0e^{-itH_0}\psi(x) - (2it)^{-n/2} e^{ix^2/(4t)}\hat\psi(x/(2t)) \to 0e−itH0​ψ(x)−(2it)−n/2eix2/(4t)ψ^​(x/(2t))→0 in L2L^2L2 as ∣t∣→∞|t|\to\infty∣t∣→∞.

Significance

The result. Theorem 7.8 says that a free quantum particle has no bound states and that its energy spectrum is purely absolutely continuous and fills [0,∞)[0,\infty)[0,∞). Combined with the RAGE theorem this gives the escape of every free wave packet from bounded regions, and Lemma 7.10 makes the escape quantitative: at large times the position distribution is the momentum distribution rescaled by 2t2t2t. The self-adjointness of H0H_0H0​ on H2(Rn)H^2(\mathbb R^n)H2(Rn) and the core Cc∞(Rn)C_c^\infty(\mathbb R^n)Cc∞​(Rn) are the inputs to the Kato–Rellich treatment of atomic Hamiltonians, and σess(H0)=[0,∞)\sigma_{ess}(H_0) = [0,\infty)σess​(H0​)=[0,∞) is the reference spectrum of Weyl's theorem and of the HVZ theorem.

Formalizing it. The results are classical. Mathlib contains the Fourier transform on L1L^1L1, Schwartz space and L2L^2L2 in the normalization e−2πi⟨x,ξ⟩e^{-2\pi i\langle x,\xi\rangle}e−2πi⟨x,ξ⟩ (including Fourier inversion, Riemann–Lebesgue and the L2L^2L2 isometry), and the Prove2Me corpus holds several of these as FamousTheorems in that normalization. What is missing is Teschl's normalization with its constants, the spectrum of the L2L^2L2 Fourier transform, the operator H0H_0H0​ as an unbounded self-adjoint operator, its resolvent spectrum and spectral type, and the free dynamics. This mission produces these objects in a form the later chapters (Kato–Rellich for atoms, Weyl, HVZ, scattering) can build on.

Difficulty

The Fourier-analytic milestones are close to Mathlib but not in it: every constant has to be transported from the 2π2\pi2π-in-the-exponent convention to Teschl's (2π)−n/2(2\pi)^{-n/2}(2π)−n/2 convention, including the branch of zn/2z^{n/2}zn/2 in Lemma 7.3 and the phase (2it)−n/2(2it)^{-n/2}(2it)−n/2 in Lemma 7.10. The lower bound σ(F)⊇{1,−1,i,−i}\sigma(\mathcal F) \supseteq \{1,-1,i,-i\}σ(F)⊇{1,−1,i,−i} in Theorem 7.5 needs an eigenfunction for each fourth root of unity, which the book defers to the Hermite functions of Section 8.3.

For the goal, self-adjointness and σ(H0)=[0,∞)\sigma(H_0) = [0,\infty)σ(H0​)=[0,∞) require working with the resolvent spectrum of an unbounded LinearPMap, which Mathlib does not provide, and transporting self-adjointness and resolvents through the unitary Fourier transform. The spectral-type statement requires identifying the spectral measure μψ\mu_\psiμψ​ of an unbounded operator from its resolvent alone, without a spectral theorem in the library, and showing that it has a density for every ψ∈L2\psi \in L^2ψ∈L2, not only for nice ψ\psiψ. Lemma 7.9 is a statement about the graph norm of −Δ-\Delta−Δ, which is not controlled by the L2L^2L2 norm alone.

Formalization scope

Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n), so that pxpxpx and x2x^2x2 are the Euclidean ones, and L2(Rn)L^2(\mathbb R^n)L2(Rn) is Lp ℂ 2 volume. fourier and fourierInv are Teschl's integrals (7.3) and (7.8) with the prefactor (2π)−n/2(2\pi)^{-n/2}(2π)−n/2. The L2L^2L2 transform ψ^\hat\psiψ^​ (fourierL2) is Mathlib's unitary L2L^2L2 transform rescaled by ψ^(p)=(2π)−n/2(FMψ)(p/2π)\hat\psi(p) = (2\pi)^{-n/2}(\mathcal F_{\mathrm M}\psi)(p/2\pi)ψ^​(p)=(2π)−n/2(FM​ψ)(p/2π), and Theorem 7.5 asserts that it is the unitary extension of (7.3). H0H_0H0​ (freeHamiltonian) and e−itH0e^{-itH_0}e−itH0​ (timeEvolution) are defined as Fourier conjugates of the maximal multiplication operator by the symbol of −Δ-\Delta−Δ and of multiplication by e−itp2e^{-itp^2}e−itp2, written with Mathlib's L2L^2L2 transform, where the symbol is 4π2∣ξ∣24\pi^2|\xi|^24π2∣ξ∣2. These are the same operators as Teschl's, and the domain is exactly H2(Rn)H^2(\mathbb R^n)H2(Rn). Unbounded operators are Mathlib LinearPMaps, self-adjointness is Mathlib's IsSelfAdjoint, and the resolvent and spectrum are the bijective-with-bounded-inverse notions of Teschl, p. 73, not Mathlib's Banach-algebra spectrum, which is used only for the bounded operator F\mathcal FF in Theorem 7.5. Statements that need it carry n≥1n \ge 1n≥1, which the book leaves implicit.

No projection-valued measure or functional calculus is taken as data. The spectral types in (7.25) are expressed through the spectral measures μψ\mu_\psiμψ​, and these are pinned down intrinsically by their Borel transforms ⟨ψ,RH0(z)ψ⟩\langle\psi, R_{H_0}(z)\psi\rangle⟨ψ,RH0​​(z)ψ⟩.

A trivializing formalization is ruled out: σ(H0)\sigma(H_0)σ(H0​) is the resolvent spectrum of the operator, not the essential range of p2p^2p2, so σ(H0)=[0,∞)\sigma(H_0) = [0,\infty)σ(H0​)=[0,∞) is not a computation on a multiplication symbol. The absolutely continuous measure in the goal must reproduce the actual resolvent matrix elements, so it cannot be chosen freely, and e−itH0e^{-itH_0}e−itH0​ is not defined by its integral kernel (7.30).

A complete development needs change of normalization lemmas for the Fourier transform, the Hermite eigenfunctions of F\mathcal FF, unitary equivalence of LinearPMaps and its effect on adjoints and resolvents, self-adjointness of maximal real multiplication operators, polar coordinates on Rn\mathbb R^nRn, and graph-norm approximation by cut-offs. The normalization bridge and the multiplication-operator results are reusable across the series. Contributions of either are welcome.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, Graduate Studies in Mathematics 99, AMS, 2009, Chapter 7. https://doi.org/10.1090/gsm/099
  • M. Reed and B. Simon, Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness, Academic Press, 1975, Sections IX.1 and IX.7.
  • E. M. Stein and G. Weiss, Introduction to Fourier Analysis on Euclidean Spaces, Princeton University Press, 1971, Chapter I. https://doi.org/10.1515/9781400883899
12 thms4 active usersReviewed
🏆Completed
AnalysisFunctional AnalysisMathematical Physics·Captain: mikedeng1

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

Motivation

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 Graduate Studies in Mathematics 99, 2009), comes down to the converse: a function of this kind with the right growth is the Cauchy–Stieltjes transform of a finite measure on R\mathbb{R}R, and that measure is the spectral measure of ψ\psiψ. In the other direction, the absolutely continuous, singularly continuous and pure point spectra of Schrödinger operators are identified by looking at the boundary values of FψF_\psiFψ​ on the real axis. This mission formalizes the appendix to Chapter 3 of Teschl's book (Section 3.4, The Herglotz theorem, pp. 106–110) and Theorem 3.10, the measure-theoretic layer that the rest of the book's spectral analysis stands on.

The representation goes back to G. Herglotz (1911) for the disc and R. Nevanlinna (1922) for the half plane. The inversion formula is due to T. J. Stieltjes (1894). The link between boundary values and the Lebesgue decomposition of the measure is classical harmonic analysis on the half plane (Fatou, de la Vallée Poussin) and is the tool behind the spectral-type results of Gilbert–Pearson subordinacy theory and Aronszajn–Donoghue rank-one perturbation theory.

Setting

Write C+={z∈C∣Im⁡(z)>0}\mathbb{C}_+ = \{z \in \mathbb{C} \mid \operatorname{Im}(z) > 0\}C+​={z∈C∣Im(z)>0}. A Herglotz function is a holomorphic map FFF on C+\mathbb{C}_+C+​ with Im⁡F(z)>0\operatorname{Im} F(z) > 0ImF(z)>0 for every z∈C+z \in \mathbb{C}_+z∈C+​ (IsHerglotz).

For a Borel measure μ\muμ on R\mathbb{R}R, its Borel transform is

F(z)=∫Rdμ(λ)λ−zF(z) = \int_{\mathbb{R}} \frac{d\mu(\lambda)}{\lambda - z}F(z)=∫R​λ−zdμ(λ)​

(borelTransform μ). The spectrum of μ\muμ is its set of growth points, σ(μ)={λ∣μ((λ−ε,λ+ε))>0 for all ε>0}\sigma(\mu) = \{\lambda \mid \mu((\lambda-\varepsilon,\lambda+\varepsilon)) > 0 \text{ for all } \varepsilon > 0\}σ(μ)={λ∣μ((λ−ε,λ+ε))>0 for all ε>0} (measureSpectrum).

With Bε(x)=(x−ε,x+ε)B_\varepsilon(x) = (x - \varepsilon, x + \varepsilon)Bε​(x)=(x−ε,x+ε) and ∣⋅∣|\cdot|∣⋅∣ Lebesgue measure, the upper and lower derivatives of μ\muμ are (D‾μ)(x)=lim sup⁡ε↓0μ(Bε(x))/∣Bε(x)∣(\overline{D}\mu)(x) = \limsup_{\varepsilon\downarrow0} \mu(B_\varepsilon(x))/|B_\varepsilon(x)|(Dμ)(x)=limsupε↓0​μ(Bε​(x))/∣Bε​(x)∣ and (D‾μ)(x)=lim inf⁡ε↓0μ(Bε(x))/∣Bε(x)∣(\underline{D}\mu)(x) = \liminf_{\varepsilon\downarrow0} \mu(B_\varepsilon(x))/|B_\varepsilon(x)|(D​μ)(x)=liminfε↓0​μ(Bε​(x))/∣Bε​(x)∣, values in [0,∞][0,\infty][0,∞] (upperDeriv, lowerDeriv). The derivative (Dμ)(x)(D\mu)(x)(Dμ)(x) is the limit when it exists, possibly ∞\infty∞ (HasMeasureDeriv μ x d).

A set AAA is a support of μ\muμ if μ(R∖A)=0\mu(\mathbb{R}\setminus A) = 0μ(R∖A)=0 (IsSupport). A support MMM is a minimal support if every Borel M0⊆MM_0 \subseteq MM0​⊆M with μ(M0)=0\mu(M_0) = 0μ(M0​)=0 is Lebesgue-null (IsMinimalSupport). The Lebesgue decomposition dμ=dμac+dμsd\mu = d\mu_{ac} + d\mu_sdμ=dμac​+dμs​ with respect to Lebesgue measure refines to dμs=dμsc+dμppd\mu_s = d\mu_{sc} + d\mu_{pp}dμs​=dμsc​+dμpp​, where μpp\mu_{pp}μpp​ lives on the atoms of μ\muμ. The absolutely continuous part μac\mu_{ac}μac​ and the singularly continuous part μsc\mu_{sc}μsc​ are acPart μ and scPart μ.

Formalization targets

Goal: Herglotz representation (Theorem 3.20)

If FFF is a Herglotz function and ∣F(z)∣≤M/Im⁡(z)|F(z)| \le M/\operatorname{Im}(z)∣F(z)∣≤M/Im(z) for all z∈C+z \in \mathbb{C}_+z∈C+​, then there is a Borel measure μ\muμ on R\mathbb{R}R with μ(R)≤M\mu(\mathbb{R}) \le Mμ(R)≤M and

F(z)=∫Rdμ(λ)λ−z,z∈C+.F(z) = \int_{\mathbb{R}} \frac{d\mu(\lambda)}{\lambda - z}, \qquad z \in \mathbb{C}_+ .F(z)=∫R​λ−zdμ(λ)​,z∈C+​.

Milestones

  1. Theorem 3.10. For a finite Borel measure μ\muμ, the transform is holomorphic on C∖σ(μ)\mathbb{C}\setminus\sigma(\mu)C∖σ(μ), is a Herglotz function when μ≠0\mu \ne 0μ=0, and satisfies F(z∗)=F(z)∗F(z^*) = F(z)^*F(z∗)=F(z)∗ and ∣F(z)∣≤μ(R)/Im⁡(z)|F(z)| \le \mu(\mathbb{R})/\operatorname{Im}(z)∣F(z)∣≤μ(R)/Im(z) on C+\mathbb{C}_+C+​.
  2. Theorem 3.21. μ\muμ is determined by its transform on C+\mathbb{C}_+C+​, and for λ1<λ2\lambda_1 < \lambda_2λ1​<λ2​
12(μ((λ1,λ2))+μ([λ1,λ2]))=lim⁡ε↓01π∫λ1λ2Im⁡F(λ+iε) dλ.\tfrac12\bigl(\mu((\lambda_1,\lambda_2)) + \mu([\lambda_1,\lambda_2])\bigr) = \lim_{\varepsilon\downarrow0}\frac1\pi\int_{\lambda_1}^{\lambda_2}\operatorname{Im}F(\lambda+i\varepsilon)\,d\lambda .21​(μ((λ1​,λ2​))+μ([λ1​,λ2​]))=ε↓0lim​π1​∫λ1​λ2​​ImF(λ+iε)dλ.
  1. Theorem 3.22. For every λ\lambdaλ, (D‾μ)(λ)≤lim inf⁡ε↓01πIm⁡F(λ+iε)≤lim sup⁡ε↓01πIm⁡F(λ+iε)≤(D‾μ)(λ)(\underline D\mu)(\lambda) \le \liminf_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon) \le \limsup_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon) \le (\overline D\mu)(\lambda)(D​μ)(λ)≤liminfε↓0​π1​ImF(λ+iε)≤limsupε↓0​π1​ImF(λ+iε)≤(Dμ)(λ).
  2. Theorem 3.23. lim⁡ε↓01πIm⁡F(λ+iε)\lim_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon)limε↓0​π1​ImF(λ+iε) exists in [0,∞][0,\infty][0,∞] for μ\muμ-a.e. and Lebesgue-a.e. λ\lambdaλ, equals (Dμ)(λ)(D\mu)(\lambda)(Dμ)(λ) wherever the latter exists; the set where it is ∞\infty∞ supports μsc\mu_{sc}μsc​, and the set where it lies in (0,∞)(0,\infty)(0,∞) is a minimal support of μac\mu_{ac}μac​.
  3. Corollary 3.24. If lim sup⁡ε↓0Im⁡F(λ+iε)<∞\limsup_{\varepsilon\downarrow0}\operatorname{Im}F(\lambda+i\varepsilon) < \inftylimsupε↓0​ImF(λ+iε)<∞ for all λ\lambdaλ in a Borel set III, then μ∣I\mu|_Iμ∣I​ is absolutely continuous.
  4. Corollary 3.25. lim⁡ε↓0F(λ+iε)\lim_{\varepsilon\downarrow0}F(\lambda+i\varepsilon)limε↓0​F(λ+iε) exists (finite or ∞\infty∞) μ\muμ-a.e. and Lebesgue-a.e., and is finite Lebesgue-a.e.

Significance

Theorem 3.20 together with Theorem 3.10 is a bijection between finite Borel measures on R\mathbb{R}R and Herglotz functions of bounded growth Im⁡(z)∣F(z)∣\operatorname{Im}(z)|F(z)|Im(z)∣F(z)∣. In Teschl's development it produces the spectral measures μψ\mu_\psiμψ​ from the resolvent, and hence the projection-valued measure of an unbounded self-adjoint operator. Theorems 3.21–3.25 turn spectral questions into boundary-value questions. The later chapters on Sturm–Liouville operators and one-dimensional Schrödinger operators decide which spectral type an operator has by reading Im⁡F(λ+i0)\operatorname{Im} F(\lambda + i0)ImF(λ+i0) for the Weyl–Titchmarsh function.

These are textbook results with complete published proofs. Mathlib has the upper half plane as a type, Lebesgue decomposition, Radon–Nikodym derivatives and Vitali-family differentiation of measures, but it has no Borel (Cauchy–Stieltjes) transform of a measure on R\mathbb{R}R, no Herglotz representation on the half plane, and no Stieltjes inversion. The remaining work is to formalize the known proofs against Mathlib's measure theory and complex analysis. No machine-checked version of these statements is known to exist on Prove2Me.

Difficulty

For the goal, the measure has to be built: nothing in the hypothesis names it. A Herglotz function gives no measure directly, only a family of absolutely continuous approximations coming from the boundary values of Im⁡F\operatorname{Im} FImF slightly above the real axis. The difficulty is to pass to a limit that is only a measure (it may have atoms and singular parts), and to identify the limit's transform with FFF itself, not just its imaginary part. The uniform bound is what makes the limit exist and keeps its mass at most MMM. Without it the general Nevanlinna representation carries an extra linear term and a non-finite measure, and the statement here fails.

For the boundary-value theorems, the pointwise behaviour of the Poisson integral has to be compared with the symmetric derivatives of μ\muμ at each point, including points where μ\muμ is singular. The almost-everywhere statements for both μ\muμ and Lebesgue measure need the differentiation theory of measures in its singular form: the derivative is infinite μs\mu_sμs​-almost everywhere, not only finite Lebesgue-almost everywhere.

Formalization scope

Measures are MeasureTheory.Measure ℝ on the Borel σ-algebra. Every theorem assumes IsFiniteMeasure μ, except the goal, whose conclusion μ Set.univ ≤ ENNReal.ofReal M makes μ finite. Functions on the half plane are ℂ → ℂ, constrained only on {z | 0 < z.im}. The Borel transform is a Bochner integral. Every claim evaluates it where the integrand is bounded, so Mathlib's convention that a non-integrable integral is 000 never enters.

Limits as ε↓0\varepsilon \downarrow 0ε↓0 are taken along 𝓝[>] 0. The quantities that may be infinite (derivatives of measures, boundary values of Im⁡F\operatorname{Im}FImF) live in ℝ≥0∞, with Im⁡F(λ+iε)\operatorname{Im}F(\lambda+i\varepsilon)ImF(λ+iε), which is nonnegative for ε>0\varepsilon > 0ε>0, embedded by ENNReal.ofReal. An infinite limit of FFF itself is Tendsto … (Bornology.cobounded ℂ). The lower and upper derivatives, the supports and the parts μac\mu_{ac}μac​, μsc\mu_{sc}μsc​ are defined in the mission's namespace exactly as in the book (Sec. A.8, Sec. 3.2).

Three readings of the printed text are fixed. Theorem 3.22 is stated for Im⁡F(λ+iε)\operatorname{Im}F(\lambda+i\varepsilon)ImF(λ+iε), which is what its proof estimates. Theorem 3.23's identity takes the factor 1/π1/\pi1/π once, consistent with Theorem 3.22. Theorem 3.10's Herglotz conclusion is stated for μ≠0\mu \ne 0μ=0: the book's Herglotz functions map into the open half plane, and the zero measure's transform is identically zero.

A Herglotz function is defined analytically (holomorphic, positive imaginary part), never as "a Borel transform"; the latter would make the goal a tautology. No object is taken as data. The chunk uses no Hilbert space, no operator, and no projection-valued measure.

Useful infrastructure: UpperHalfPlane, Cauchy's integral formula on rectangles and semicircles, weak compactness of finite measures on R\mathbb{R}R (Helly/Prokhorov), Mathlib's VitaliFamily.ae_tendsto_rnDeriv and Measure.singularPart. A reusable Poisson-kernel library for the half plane would be a welcome by-product, as would the vague-convergence lemmas of the book's Appendix A.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, Graduate Studies in Mathematics 99, American Mathematical Society, 2009, Sec. 3.2, Sec. 3.4 and Sec. A.8. https://doi.org/10.1090/gsm/099
  • G. Herglotz, Über Potenzreihen mit positivem, reellen Teil im Einheitskreis, Berichte über die Verhandlungen der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, Math.-Phys. Klasse 63 (1911), 501–511.
  • R. Nevanlinna, Asymptotische Entwicklungen beschränkter Funktionen und das Stieltjessche Momentenproblem, Annales Academiae Scientiarum Fennicae A 18 (1922).
  • T. J. Stieltjes, Recherches sur les fractions continues, Annales de la Faculté des Sciences de Toulouse 8 (1894), J1–J122. https://doi.org/10.5802/afst.108
  • F. Gesztesy, E. Tsekanovskii, On matrix-valued Herglotz functions, Mathematische Nachrichten 218 (2000), 61–138. https://doi.org/10.1002/1522-2616(200010)218:1<61::AID-MANA61>3.0.CO;2-D
28 thms4 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

Motivation

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 part and a part supported on a small set. Martingale theory has the same need: square functions, martingale transforms and maximal operators of martingales are bounded on L2L^2L2 for orthogonality reasons, and their behaviour on L1L^1L1-bounded martingales is the delicate endpoint.

R. F. Gundy (1968) supplied the martingale analogue: an L1L^1L1-bounded martingale can be written as the sum of three martingales, one bounded in L2L^2L2, one whose differences are absolutely summable in L1L^1L1, and one that is non-zero only on an event of small probability (Gundy 1968). Gundy's construction used several stopping times. In his 1971 Wald Memorial Lectures, published as Distribution Function Inequalities for Martingales (Burkholder 1973), D. L. Burkholder gave a simplified version of the decomposition in which only one stopping time is used, with explicit constants 222, 444 and 111. This mission formalizes that version, Theorem 4.1 of the lectures, together with the facts its proof rests on.

Timeline:

  • 1953. J. L. Doob's Stochastic Processes establishes almost-everywhere convergence of L1L^1L1-bounded martingales and the maximal inequality.
  • 1966. D. G. Austin proves that the integral of S2(f)S^2(f)S2(f) over {f∗≤λ}\{f^*\le\lambda\}{f∗≤λ} is finite for an L1L^1L1-bounded martingale (Austin 1966).
  • 1968. Gundy proves the decomposition theorem for L1L^1L1-bounded martingales, with applications to weak-type estimates.
  • 1973. Burkholder's Lemma 2.1, a refinement of Austin's theorem, yields a one-stopping-time proof of Gundy's decomposition with explicit constants.

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space and A0⊆A1⊆⋯\mathcal A_0\subseteq\mathcal A_1\subseteq\cdotsA0​⊆A1​⊆⋯ a nondecreasing sequence of sub-σ\sigmaσ-fields of A\mathcal AA. A martingale relative to A1,A2,…\mathcal A_1,\mathcal A_2,\dotsA1​,A2​,… is a sequence f=(f1,f2,… )f=(f_1,f_2,\dots)f=(f1​,f2​,…) of integrable random variables with fnf_nfn​ An\mathcal A_nAn​-measurable and E(fn+1∣An)=fnE(f_{n+1}\mid\mathcal A_n)=f_nE(fn+1​∣An​)=fn​. Its difference sequence is d=(d1,d2,… )d=(d_1,d_2,\dots)d=(d1​,d2​,…) with fn=∑k=1ndkf_n=\sum_{k=1}^n d_kfn​=∑k=1n​dk​, i.e. d1=f1d_1=f_1d1​=f1​, dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​ (the convention is f0=0f_0=0f0​=0).

The maximal function is f∗=sup⁡n≥1∣fn∣f^*=\sup_{n\ge1}|f_n|f∗=supn≥1​∣fn​∣, the square function is S(f)=[∑k≥1dk2]1/2S(f)=\big[\sum_{k\ge1}d_k^2\big]^{1/2}S(f)=[∑k≥1​dk2​]1/2, and Sn(f)S_n(f)Sn​(f) is its nnn-th partial version. For 0<p<∞0<p<\infty0<p<∞,

∥f∥p=sup⁡n≥1∥fn∥p,∥fn∥p=(E∣fn∣p)1/p,\|f\|_p=\sup_{n\ge1}\|f_n\|_p,\qquad \|f_n\|_p=(E|f_n|^p)^{1/p},∥f∥p​=n≥1sup​∥fn​∥p​,∥fn​∥p​=(E∣fn​∣p)1/p,

and fff is LpL^pLp-bounded when ∥f∥p<∞\|f\|_p<\infty∥f∥p​<∞. For λ>0\lambda>0λ>0, the exit time μ=inf⁡{n≥1:∣fn∣>λ}\mu=\inf\{n\ge1:|f_n|>\lambda\}μ=inf{n≥1:∣fn​∣>λ} (with inf⁡∅=∞\inf\emptyset=\inftyinf∅=∞) is the first index at which ∣fn∣|f_n|∣fn​∣ exceeds λ\lambdaλ; fμf_\mufμ​, fμ−1f_{\mu-1}fμ−1​, Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f) denote evaluation at the random index, with f∞=lim⁡nfnf_\infty=\lim_n f_nf∞​=limn​fn​.

The Lean development names these objects dseq (ddd), sqFnN/sqFn (Sn(f)S_n(f)Sn​(f), S(f)S(f)S(f)), maxFnN/maxFn (fn∗f_n^*fn∗​, f∗f^*f∗), pNorm (∥f∥p\|f\|_p∥f∥p​), exitTime (μ\muμ) and valAt/sqFnAt (evaluation at an index in {0,1,…,∞}\{0,1,\dots,\infty\}{0,1,…,∞}), all in the namespace BurkholderDFI.Gundy.

Formalization targets

Goal: Theorem 4.1 (p. 23)

For every L1L^1L1-bounded martingale fff and every λ>0\lambda>0λ>0 there are martingales X,Y,ZX,Y,ZX,Y,Z relative to the same σ\sigmaσ-fields, with difference sequences x,y,zx,y,zx,y,z, such that

f=X+Y+Z,∥X∥22≤2λ∥f∥1,∥∑k=1∞∣yk∣∥1≤4∥f∥1,P(Z∗>0)≤∥f∥1/λ.f=X+Y+Z,\qquad \|X\|_2^2\le2\lambda\|f\|_1,\qquad \Big\|\sum_{k=1}^\infty|y_k|\Big\|_1\le4\|f\|_1,\qquad P(Z^*>0)\le\|f\|_1/\lambda.f=X+Y+Z,∥X∥22​≤2λ∥f∥1​,​k=1∑∞​∣yk​∣​1​≤4∥f∥1​,P(Z∗>0)≤∥f∥1​/λ.

The three bounds hold together; each alone is trivial (f=0+0+ff=0+0+ff=0+0+f satisfies the first two, f=0+f+0f=0+f+0f=0+f+0 the first and last).

Milestones

  1. Doob's facts (cited, §1, p. 20). An L1L^1L1-bounded martingale or nonnegative submartingale converges almost everywhere, and ∥fμ∥1≤∥f∥1\|f_\mu\|_1\le\|f\|_1∥fμ​∥1​≤∥f∥1​ for every stopping time μ\muμ.
  2. (1.5) (p. 20). λpP(f∗>λ)≤∥f∥pp\lambda^pP(f^*>\lambda)\le\|f\|_p^pλpP(f∗>λ)≤∥f∥pp​ for 1≤p<∞1\le p<\infty1≤p<∞.
  3. Lemma 2.1 (p. 21). For the exit time μ\muμ above λ\lambdaλ,
∥Sμ−1(f)∥22+∥fμ−1∥22≤2Efμfμ−1≤2λ∥f∥1,\|S_{\mu-1}(f)\|_2^2+\|f_{\mu-1}\|_2^2\le2Ef_\mu f_{\mu-1}\le2\lambda\|f\|_1,∥Sμ−1​(f)∥22​+∥fμ−1​∥22​≤2Efμ​fμ−1​≤2λ∥f∥1​,

with equality on the left for martingales.

Significance

The result. The decomposition is the standard device for passing from L2L^2L2 to weak-type (1,1)(1,1)(1,1) estimates for martingale operators: an operator that is bounded on L2L^2L2, controlled by total variation on the second piece, and local in the sense that it vanishes where the third piece vanishes, is of weak type (1,1)(1,1)(1,1). Applications of the decomposition are given in Gundy's papers of 1968 and 1969 (On the class Llog⁡LL\log LLlogL, martingales, and singular integrals, Studia Math. 33), which the lectures cite for this purpose. The explicit constants 222, 444, 111 make every such weak-type constant explicit.

Formalizing it. The theorem is classical and proved; the remaining work is its formalization. As far as is known, no machine-checked proof of Gundy's decomposition, of Lemma 2.1, or of the weak-type maximal inequality in the form (1.5) for real martingales exists in Mathlib or on this platform. Mathlib provides almost-everywhere convergence of L1L^1L1-bounded submartingales and Doob's maximal inequality for nonnegative submartingales; the stopped-value bound for unbounded stopping times, the square-function identity of Lemma 2.1 and the decomposition itself are new. The milestones are shared with other missions of this series (Lemma 2.1 is also used for Burkholder's weak-type square function inequality and his exponential estimates), so each proof is reused.

Difficulty

The obvious attempt imitates the Calderón–Zygmund cut directly: truncate fff at height λ\lambdaλ, or stop it when it first exceeds λ\lambdaλ. Neither produces the required pieces. Truncation destroys the martingale property, and whatever restores it adds terms that must themselves be controlled in the right norm. Stopping at the exit time produces a martingale bounded by λ\lambdaλ only up to the overshoot at the exit, which is not bounded and lives on an event that is small only in probability. The L2L^2L2 estimate (4.2) is therefore not a consequence of boundedness; it needs a quantitative square-function bound for the martingale up to the exit, which is the content of Lemma 2.1, and that lemma in turn needs the limit f∞f_\inftyf∞​ and the stopped values fμf_\mufμ​ on {μ=∞}\{\mu=\infty\}{μ=∞} — so Doob's convergence theorem cannot be avoided.

Formalization scope

Processes are functions f : ℕ → Ω → ℝ with a Mathlib Filtration ℕ and Mathlib's Martingale/Submartingale. The paper indexes from 111; Lean's index 000 is never read by any quantity in the statements, which use the paper's convention f0=0f_0=0f0​=0. Mathlib's martingale definition additionally constrains f0=E(f1∣A0)f_0=E(f_1\mid\mathcal A_0)f0​=E(f1​∣A0​); this is no restriction, since every martingale indexed from 111 extends this way. The goal asserts that X,Y,ZX,Y,ZX,Y,Z are Mathlib martingales for the same filtration as fff, and the identity fn=Xn+Yn+Znf_n=X_n+Y_n+Z_nfn​=Xn​+Yn​+Zn​ is required for n≥1n\ge1n≥1.

Further committed conventions:

  • S(f)S(f)S(f), f∗f^*f∗, Z∗Z^*Z∗, ∥⋅∥p\|\cdot\|_p∥⋅∥p​ and all expectations of nonnegative quantities take values in [0,∞][0,\infty][0,∞] (lower Lebesgue integral), so no infinite value is silently replaced by 000.
  • ∥X∥2=sup⁡n≥1∥Xn∥2\|X\|_2=\sup_{n\ge1}\|X_n\|_2∥X∥2​=supn≥1​∥Xn​∥2​, not the norm of a limit; Z∗=sup⁡n≥1∣Zn∣Z^*=\sup_{n\ge1}|Z_n|Z∗=supn≥1​∣Zn​∣; ∥∑k∣yk∣∥1\|\sum_k|y_k|\|_1∥∑k​∣yk​∣∥1​ is the integral of the series with y1=Y1y_1=Y_1y1​=Y1​.
  • The exit time takes values in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞} and μ−1\mu-1μ−1 is truncated, with ∞−1=∞\infty-1=\infty∞−1=∞; the a.e. limit f∞f_\inftyf∞​ is a function supplied with its convergence hypothesis (Lemma 2.1) or asserted to exist (Doob's facts).
  • "Nonnegative submartingale" means fn≥0f_n\ge0fn​≥0 almost surely for n≥1n\ge1n≥1.
  • Ω\OmegaΩ is an arbitrary measurable space with a probability measure.

A formalization in which the existential could choose its own filtration, or in which the norms were Bochner integrals (which vanish on non-integrable functions), would trivialize the goal; both are excluded by the statement above.

Infrastructure needed: stopped values at unbounded stopping times and their L1L^1L1 bound; square-function identities for stopped martingales (orthogonality of martingale differences up to a stopping time); conditional-expectation compensators of predictable truncations. The definitions file is shared with the other eight missions of this series and is reusable for any work on discrete-time square and maximal functions. Proofs of the milestones, alternative arguments, and sharper constants are all welcome.

Selected references

  • D. L. Burkholder, Distribution function inequalities for martingales, The Annals of Probability 1(1), 19–42, 1973. https://doi.org/10.1214/aop/1176997023
  • R. F. Gundy, A decomposition for L¹-bounded martingales, The Annals of Mathematical Statistics 39(1), 134–138, 1968. https://doi.org/10.1214/aoms/1177698510
  • D. G. Austin, A sample function property of martingales, The Annals of Mathematical Statistics 37(5), 1396–1397, 1966. https://doi.org/10.1214/aoms/1177699283
  • J. L. Doob, Stochastic Processes, Wiley, New York, 1953.
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

Motivation

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 this solution has exactly two more derivatives than the data when smoothness is measured in Hölder norms, are the starting point of the regularity theory of second-order elliptic equations.

This mission formalizes §2.6–2.7 of J. K. Hunter's Notes on Partial Differential Equations (UC Davis, revised 6/18/2014), which follow the classical line: the fundamental solution, the Newtonian potential, an integral representation of its second derivatives, and the Hölder estimate. The estimate goes back to J. Schauder (1934), who used it to build an existence theory for elliptic equations with Hölder continuous coefficients, now called Schauder theory (Gilbarg–Trudinger, Ch. 4 and 6). The singular integral operators that appear in the second derivatives were later placed in a general framework by A. P. Calderón and A. Zygmund (1952), whose theory gives the LpL^pLp analogue.

Setting

Throughout, n≥2n \ge 2n≥2 and Rn\mathbb{R}^nRn carries the Euclidean norm ∣x∣|x|∣x∣ and Lebesgue measure. Let αn\alpha_nαn​ be the volume of the open unit ball. The fundamental solution of Laplace's equation is

Γ(x)=1n(n−2)αn 1∣x∣n−2(n≥3),Γ(x)=−12πlog⁡∣x∣(n=2),\Gamma(x) = \frac{1}{n(n-2)\alpha_n}\,\frac{1}{|x|^{n-2}} \quad (n \ge 3), \qquad \Gamma(x) = -\frac{1}{2\pi}\log|x| \quad (n = 2),Γ(x)=n(n−2)αn​1​∣x∣n−21​(n≥3),Γ(x)=−2π1​log∣x∣(n=2),

defined for x≠0x \neq 0x=0. With this sign convention (as in Evans, opposite to Gilbarg–Trudinger) Γ\GammaΓ is harmonic away from the origin and −ΔΓ=δ-\Delta\Gamma = \delta−ΔΓ=δ in the sense of distributions. Γ\GammaΓ is locally integrable, and so is its gradient, but its second derivatives behave like ∣x∣−n|x|^{-n}∣x∣−n and are not.

For a smooth function fff with compact support, f∈Cc∞(Rn)f \in C_c^\infty(\mathbb{R}^n)f∈Cc∞​(Rn), the Newtonian potential of fff is the convolution

u(x)=(Γ∗f)(x)=∫RnΓ(x−y) f(y) dy.u(x) = (\Gamma * f)(x) = \int_{\mathbb{R}^n} \Gamma(x - y)\, f(y)\, dy.u(x)=(Γ∗f)(x)=∫Rn​Γ(x−y)f(y)dy.

Partial derivatives are written ∂i\partial_i∂i​, with ∂ij=∂i∂j\partial_{ij} = \partial_i \partial_j∂ij​=∂i​∂j​, and δij\delta_{ij}δij​ is the Kronecker delta. For 0<α≤10 < \alpha \le 10<α≤1 the Hölder seminorm of v:Rn→Rv : \mathbb{R}^n \to \mathbb{R}v:Rn→R is

[v]0,α=sup⁡x≠y∣v(x)−v(y)∣∣x−y∣α∈[0,∞].[v]_{0,\alpha} = \sup_{x \neq y} \frac{|v(x) - v(y)|}{|x - y|^{\alpha}} \in [0, \infty].[v]0,α​=x=ysup​∣x−y∣α∣v(x)−v(y)∣​∈[0,∞].

In the Lean development these objects are fundamentalSolution n, unitBallVolume n, newtonianPotential n f, partialDeriv u i, secondPartial u i j and holderSeminorm α Set.univ v, all in the namespace HunterPDE.Newtonian.

Formalization targets

Goal: the Hölder estimate (Theorem 2.28)

For 0<α<10 < \alpha < 10<α<1 there is a constant CCC, depending only on α\alphaα and nnn, such that for every f∈Cc∞(Rn)f \in C_c^\infty(\mathbb{R}^n)f∈Cc∞​(Rn) and all indices i,ji, ji,j,

[∂ij(Γ∗f)]0,α≤C [f]0,α.[\partial_{ij}(\Gamma * f)]_{0,\alpha} \le C\,[f]_{0,\alpha}.[∂ij​(Γ∗f)]0,α​≤C[f]0,α​.

The constant is not specified: the goal asserts the shape of the estimate, not a numerical value.

Milestones

  1. Eq. (2.14). Γ\GammaΓ is C∞C^\inftyC∞ on Rn∖{0}\mathbb{R}^n \setminus \{0\}Rn∖{0} and ∂iΓ(x)=−1nαn1∣x∣n−1xi∣x∣\partial_i\Gamma(x) = -\dfrac{1}{n\alpha_n}\dfrac{1}{|x|^{n-1}}\dfrac{x_i}{|x|}∂i​Γ(x)=−nαn​1​∣x∣n−11​∣x∣xi​​ for x≠0x \neq 0x=0.
  2. Eq. (2.23). Γ∗(Δf)=−f\Gamma * (\Delta f) = -fΓ∗(Δf)=−f for f∈Cc∞(Rn)f \in C_c^\infty(\mathbb{R}^n)f∈Cc∞​(Rn).
  3. Theorem 2.25. u=Γ∗fu = \Gamma * fu=Γ∗f is well defined, u∈C∞(Rn)u \in C^\infty(\mathbb{R}^n)u∈C∞(Rn), and −Δu=f-\Delta u = f−Δu=f.
  4. Corollary 2.27. For every xxx and every open ball BR(x)B_R(x)BR​(x) containing the support of fff,
∂iju(x)=∫BR(x)∂ijΓ(x−y) [f(y)−f(x)] dy−1nf(x) δij,\partial_{ij} u(x) = \int_{B_R(x)} \partial_{ij}\Gamma(x - y)\,[f(y) - f(x)]\,dy - \frac{1}{n} f(x)\,\delta_{ij},∂ij​u(x)=∫BR​(x)​∂ij​Γ(x−y)[f(y)−f(x)]dy−n1​f(x)δij​,

with the integral absolutely convergent.

Significance

Theorem 2.25 is the existence theorem for Poisson's equation on the whole space. Corollary 2.27 expresses D2uD^2 uD2u as a singular integral operator applied to fff plus a multiple of fff; it is the prototype of the representations behind both the Hölder (Schauder) and the LpL^pLp (Calderón–Zygmund) theories. Theorem 2.28 is the first Schauder estimate. With it, a priori estimates for equations with variable Hölder coefficients follow by freezing the coefficients, and existence follows by the method of continuity. The notes point out that the Hölder scale is essential: there are continuous compactly supported fff for which Γ∗f\Gamma * fΓ∗f is not C2C^2C2, so no estimate of D2uD^2 uD2u by the maximum of ∣f∣|f|∣f∣ holds. The endpoint α=1\alpha = 1α=1 is excluded from the theorem.

All four statements are classical and proved in the notes; none is new mathematics. As far as the Prove2Me corpus and Mathlib show, none has been machine-checked. Mathlib has the Laplacian on inner product spaces, convolution, and the volume of Euclidean balls, but no fundamental solution of the Laplacian in general dimension, no Newtonian potential, and no Hölder estimates for it. A formalization would supply reusable infrastructure: the fundamental solution with its derivative formulas, differentiation under the integral sign with a locally integrable kernel, and estimates for kernels homogeneous of degree −n-n−n with mean zero on spheres.

Difficulty

The obvious route to the second derivatives, differentiating twice under the integral sign, fails: ∂ijΓ\partial_{ij}\Gamma∂ij​Γ is of order ∣x∣−n|x|^{-n}∣x∣−n near the origin and is not locally integrable, so ∫∂ijΓ(x−y)f(y) dy\int \partial_{ij}\Gamma(x-y) f(y)\,dy∫∂ij​Γ(x−y)f(y)dy need not exist. Corollary 2.27 is precisely the statement that the correct formula carries a subtracted value f(x)f(x)f(x) and a boundary contribution −1nf(x)δij-\frac1n f(x)\delta_{ij}−n1​f(x)δij​, and computing that contribution needs integrals over spheres, which Mathlib supports only indirectly. For the goal, a pointwise bound on the kernel is not enough. Estimating ∣∂ijΓ(x−y)∣ ∣f(y)−f(x)∣|\partial_{ij}\Gamma(x-y)|\,|f(y)-f(x)|∣∂ij​Γ(x−y)∣∣f(y)−f(x)∣ in absolute value gives a bound that grows with the radius of the ball containing the support of fff, while the theorem's constant must be uniform over all fff, all indices and all pairs of points. The estimate depends on cancellation in the kernel, and the maximum-norm version of the same statement is false.

Formalization scope

  • Rn\mathbb{R}^nRn is EuclideanSpace ℝ (Fin n) with volume. Every theorem assumes 2 ≤ n; the definition of Γ\GammaΓ returns junk values for n=0,1n = 0, 1n=0,1, which the book excludes.
  • Γ(0)\Gamma(0)Γ(0) is undefined in the book; in Lean it equals 000 (from 1/0=01/0 = 01/0=0 and log⁡0=0\log 0 = 0log0=0), one point of measure zero.
  • Coordinates are 0-based (i : Fin n). ∂iu(x)\partial_i u(x)∂i​u(x) is fderiv ℝ u x (EuclideanSpace.single i 1), and ∂iju=∂i(∂ju)\partial_{ij} u = \partial_i(\partial_j u)∂ij​u=∂i​(∂j​u). fderiv is 000 where uuu is not differentiable, so ∂ijΓ(x−y)\partial_{ij}\Gamma(x-y)∂ij​Γ(x−y) in Corollary 2.27 has an arbitrary value at the single point y=xy = xy=x.
  • "Smooth" is ContDiff ℝ ∞ (C∞C^\inftyC∞). In this Mathlib ContDiff ℝ ⊤ means analytic, and it is not used. Compact support is HasCompactSupport, and "the support of fff" is the closed support tsupport f.
  • Δ\DeltaΔ is Mathlib's InnerProductSpace.laplacian.
  • The convolution Γ∗f\Gamma * fΓ∗f is the Lebesgue integral ∫Γ(x−y)f(y) dy\int \Gamma(x-y) f(y)\,dy∫Γ(x−y)f(y)dy, with no integrability assumed of Γ\GammaΓ. Lean's Bochner integral is 000 for a non-integrable integrand, so Theorem 2.25 asserts integrability of y↦Γ(x−y)f(y)y \mapsto \Gamma(x-y)f(y)y↦Γ(x−y)f(y) for every xxx, and Corollary 2.27 asserts integrability of its integrand on the ball. Both are true and are implicit in the book's formulas; they rule out reading an identity between junk values as the theorem.
  • The Hölder seminorm is a supremum in [0,∞][0,\infty][0,∞] over all pairs of distinct points of Rn\mathbb{R}^nRn, not Mathlib's HolderWith, which fixes a constant. In the goal CCC is a finite nonnegative real quantified before fff, iii and jjj. The inequality therefore also asserts that ∂iju\partial_{ij} u∂ij​u is uniformly α\alphaα-Hölder, because [f]0,α<∞[f]_{0,\alpha} < \infty[f]0,α​<∞ for f∈Cc∞f \in C_c^\inftyf∈Cc∞​. A formalization that takes CCC after fff, lets it depend on the support of fff, or includes the excluded endpoint α=1\alpha = 1α=1 is not the theorem.
  • Theorem 2.26 of the notes (the same representation over an arbitrary smooth domain, with a surface integral over ∂Ω\partial\Omega∂Ω) is not stated, because a faithful statement needs a surface measure on general smooth boundaries. The singular-integral discussion of §2.8 is commentary and is not stated.

Useful infrastructure, all reusable beyond this mission: differentiation of Γ\GammaΓ away from the origin; integration in polar coordinates and integrals of ∣x∣−a|x|^{-a}∣x∣−a over balls and annuli; surface integrals over spheres, or the divergence theorem on balls; differentiation under the integral sign for convolutions with a locally integrable kernel. Contributions of any of these as separate lemmas are welcome.

Selected references

  • J. K. Hunter, Notes on Partial Differential Equations, UC Davis lecture notes, revised 6/18/2014, §2.6–2.8 and Definition 1.1. https://www.math.ucdavis.edu/~hunter/pdes/pde_notes.pdf
  • L. C. Evans, Partial Differential Equations, 2nd ed., Graduate Studies in Mathematics 19, AMS, 2010, §2.2. https://doi.org/10.1090/gsm/019
  • D. Gilbarg and N. S. Trudinger, Elliptic Partial Differential Equations of Second Order, Springer, 2001 (reprint of the 1998 ed.), Ch. 4. https://doi.org/10.1007/978-3-642-61798-0
  • J. Schauder, Über lineare elliptische Differentialgleichungen zweiter Ordnung, Mathematische Zeitschrift 38 (1934), 257–282. https://doi.org/10.1007/BF01170635
  • A. P. Calderón and A. Zygmund, On the existence of certain singular integrals, Acta Mathematica 88 (1952), 85–139. https://doi.org/10.1007/BF02392130
36 thms3 active usersReviewed
🏆Completed
Number Theory·Captain: Lucas

Connes: Weil positivity and the Riemann zeta functionResearch Paper

Motivation

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 over the zeros of ζ\zetaζ as a sum of local contributions over the places of Q\mathbb{Q}Q, and RH is equivalent to the resulting functional being positive on elements of the form g⋆g∗g \star g^{*}g⋆g∗.

Connes' 1999 programme paper Noncommutative geometry and the Riemann zeta function takes this reformulation as its endpoint. It builds a geometric framework — the adele class space X=A/k∗X = \mathbb{A}/k^{*}X=A/k∗ carrying an action of the idele class group CkC_kCk​ — in which the explicit formula appears as a Lefschetz formula, the zeros of LLL-functions appear spectrally, and the paper's concluding assertion (§3, p. 22) is that the validity of the global trace formula implies, and is in fact equivalent to, positivity of the Weil distribution, i.e. RH for all LLL-functions with Grössencharakter.

This mission formalizes the arithmetic core of that endpoint in its simplest instance: the global field k=Qk = \mathbb{Q}k=Q with trivial Grössencharakter, so that the LLL-function is ζ\zetaζ itself. Concretely it asks for (i) the Riemann–Weil explicit formula for ζ\zetaζ in the shape of Connes' equation (11), and (ii) both directions of the equivalence between positivity of the resulting Weil distribution and RH.

A rough timeline of the statements involved: Riemann (1859) gave the first explicit formula; von Mangoldt (1895) proved it rigorously; Weil (Sur les "formules explicites" de la théorie des nombres premiers, 1952) extended it to all global fields and isolated the positivity criterion; Bombieri (Remarks on Weil's quadratic functional in the theory of prime numbers, 2000) studied the associated quadratic functional in detail; Connes (1996–1999) gave the trace-formula interpretation formalized in part here.

Setting

All objects live on the group R+∗\mathbb{R}^{*}_{+}R+∗​, the module of the idele class group of Q\mathbb{Q}Q, written additively through u=etu = e^{t}u=et, d∗u=dtd^{*}u = dtd∗u=dt.

A test function is a map g:R→Cg : \mathbb{R} \to \mathbb{C}g:R→C that is C∞C^{\infty}C∞ and has compact support (IsTest).

Its transform is

g^(z)  =  ∫Rg(t) e(z−1/2) t dt,\widehat{g}(z) \;=\; \int_{\mathbb{R}} g(t)\, e^{(z - 1/2)\,t}\, dt ,g​(z)=∫R​g(t)e(z−1/2)tdt,

which is Connes' h^(z)=∫Ckh(u) ∣u∣z d∗u\widehat h(z) = \int_{C_k} h(u)\,|u|^{z}\,d^{*}uh(z)=∫Ck​​h(u)∣u∣zd∗u in the coordinate u=etu = e^{t}u=et, shifted by 12\tfrac1221​ so that zzz is the variable of ζ\zetaζ (mellinHat). On the critical line, g^(12+ir)=∫Rg(t)eirt dt\widehat{g}(\tfrac12 + i r) = \int_{\mathbb{R}} g(t) e^{irt}\,dtg​(21​+ir)=∫R​g(t)eirtdt is the ordinary Fourier transform.

The involution is g∗(t)=g(−t)‾g^{*}(t) = \overline{g(-t)}g∗(t)=g(−t)​, i.e. h∗(u)=h(u−1)‾h^{*}(u) = \overline{h(u^{-1})}h∗(u)=h(u−1)​ (starInv), and convolution is (g1⋆g2)(t)=∫Rg1(s) g2(t−s) ds(g_1 \star g_2)(t) = \int_{\mathbb{R}} g_1(s)\, g_2(t-s)\, ds(g1​⋆g2​)(t)=∫R​g1​(s)g2​(t−s)ds (conv).

The Weil distribution of a test function ggg collects the pole terms, the finite places and the archimedean place:

W(g)  =  g^(0)+g^(1)  −  ∑n≥2Λ(n)n(g(log⁡n)+g(−log⁡n))  +  12π∫Rg^(12+ir)(Re⁡ψ(14+ir2)−log⁡π)dr,W(g) \;=\; \widehat{g}(0) + \widehat{g}(1) \;-\; \sum_{n \ge 2} \frac{\Lambda(n)}{\sqrt{n}}\bigl(g(\log n) + g(-\log n)\bigr) \;+\; \frac{1}{2\pi}\int_{\mathbb{R}} \widehat{g}\left(\tfrac12 + ir\right)\Bigl(\operatorname{Re}\psi\left(\tfrac14 + \tfrac{ir}{2}\right) - \log \pi\Bigr) dr ,W(g)=g​(0)+g​(1)−n≥2∑​n​Λ(n)​(g(logn)+g(−logn))+2π1​∫R​g​(21​+ir)(Reψ(41​+2ir​)−logπ)dr,

where Λ\LambdaΛ is the von Mangoldt function and ψ=Γ′/Γ\psi = \Gamma'/\Gammaψ=Γ′/Γ (weilDistribution, with the three pieces named mellinHat, primeSum, archTerm). The middle sum is Weil's contribution of the finite places v=pv = pv=p, the last integral the contribution of the real place.

The spectral side is

Z(g)  =  ∑ρmρ g^(ρ),Z(g) \;=\; \sum_{\rho} m_{\rho}\, \widehat{g}(\rho),Z(g)=ρ∑​mρ​g​(ρ),

the sum over the zeros ρ\rhoρ of ζ\zetaζ with 0<Re⁡ρ<10 < \operatorname{Re}\rho < 10<Reρ<1, each counted with its multiplicity mρm_\rhomρ​ (zeroSum, IsCriticalZero, zeroMult).

Formalization targets

Goal — positivity of the Weil distribution implies RH

(∀ g test:  Re⁡W(g⋆g∗)≥0)  ⟹  (∀ρ, ζ(ρ)=0, 0<Re⁡ρ<1  ⇒  Re⁡ρ=12).\Bigl(\forall\, g \text{ test}:\; \operatorname{Re} W\bigl(g \star g^{*}\bigr) \ge 0\Bigr) \;\Longrightarrow\; \bigl(\forall \rho,\ \zeta(\rho) = 0,\ 0 < \operatorname{Re}\rho < 1 \;\Rightarrow\; \operatorname{Re}\rho = \tfrac12\bigr).(∀g test:ReW(g⋆g∗)≥0)⟹(∀ρ, ζ(ρ)=0, 0<Reρ<1⇒Reρ=21​).

This is the direction that yields RH, and it is the weakest form of the endpoint of the paper: it fixes no rate, no test-function normalization beyond Cc∞C_c^{\infty}Cc∞​, and no numerical constant.

Milestone — the explicit formula (Connes (11))

∑ρmρ g^(ρ)  =  W(g)for every test function g,\sum_{\rho} m_\rho\,\widehat g(\rho) \;=\; W(g) \qquad \text{for every test function } g,ρ∑​mρ​g​(ρ)=W(g)for every test function g,

with the sum over zeros asserted to be (unconditionally) summable.

Milestone — the converse direction

RH  ⟹  ∀ g test: Re⁡W(g⋆g∗)≥0.\text{RH} \;\Longrightarrow\; \forall\, g \text{ test}:\ \operatorname{Re} W\bigl(g \star g^{*}\bigr) \ge 0 .RH⟹∀g test: ReW(g⋆g∗)≥0.

Together with the goal this is the equivalence asserted on p. 22 of the paper, in the case k=Qk = \mathbb{Q}k=Q, trivial Grössencharakter.

Supporting statements

The ∗*∗-identity g⋆g∗^(12+ir)=∣g^(12+ir)∣2\widehat{g \star g^{*}}\left(\tfrac12 + ir\right) = \bigl|\widehat g\left(\tfrac12+ir\right)\bigr|^{2}g⋆g∗​(21​+ir)=​g​(21​+ir)​2 on the critical line, and the fact that g⋆g∗g \star g^{*}g⋆g∗ is again a test function.

Significance

Weil's positivity criterion is one of the standard equivalent forms of RH, and the only one in which the arithmetic input (the primes, through Λ\LambdaΛ) and the archimedean input (the Γ\GammaΓ-factor) enter as separate, explicitly computable local terms. Formalizing it produces a machine-checked bridge between the zeros of ζ\zetaζ and prime sums: the explicit formula milestone is the reusable object here, since essentially every analytic application of zeta zeros — zero-density estimates, prime-counting error terms, pair-correlation statistics — is an instance of it.

Status honesty: neither RH nor the positivity statement is known; the explicit formula and both implications relating positivity to RH are classical theorems, proved but not, as far as the catalog shows, formalized in Lean. Mathlib currently provides ζ\zetaζ, its functional equation, the von Mangoldt function and Γ\GammaΓ, but no explicit formula of any kind. What this mission adds on top of the paper is therefore the formal proof of known results, not new mathematics.

Difficulty

The obvious route to the explicit formula — integrate −ζ′/ζ(s)g^(s)-\zeta'/\zeta(s)\widehat g(s)−ζ′/ζ(s)g​(s) over a vertical line, move the contour to the reflected line, collect residues — fails to be routine at exactly two points. First, moving the contour requires control of ζ′/ζ\zeta'/\zetaζ′/ζ on horizontal segments between zeros, which is where the classical proof invests most of its work; Mathlib has bounds near Re⁡s=1\operatorname{Re} s = 1Res=1 but nothing of this shape inside the strip. Second, the sum over zeros must be shown to converge unconditionally, which needs a zero-counting bound of Riemann–von Mangoldt type (N(T)≪Tlog⁡TN(T) \ll T\log TN(T)≪TlogT) that is not in Mathlib either.

For the goal implication, the naive idea — pick a test function whose transform is supported near a hypothetical off-line zero — is unavailable: g^\widehat gg​ is entire whenever ggg has compact support, so it cannot be localized. The classical argument instead exploits the symmetry ρ↦1−ρˉ\rho \mapsto 1-\bar\rhoρ↦1−ρˉ​ of the zero set and makes the off-line quadruple contribute a negative amount in the limit along a family of test functions.

Formalization scope

Conventions the Lean statements commit to. Test functions are C\mathbb{C}C-valued on R\mathbb{R}R, ContDiff ℝ (⊤ : ℕ∞) (so C∞C^{\infty}C∞, not analytic) with HasCompactSupport; the multiplicative group R+∗\mathbb{R}^{*}_{+}R+∗​ is always written additively. The transform carries the 12\tfrac1221​-shift shown above, so the critical line is Re⁡z=12\operatorname{Re} z = \tfrac12Rez=21​ and g^(0),g^(1)\widehat{g}(0), \widehat{g}(1)g​(0),g​(1) are the two pole terms. Zeros are indexed by the subtype {s:0<Re⁡s<1, ζ(s)=0}\{s : 0 < \operatorname{Re} s < 1,\ \zeta(s) = 0\}{s:0<Res<1, ζ(s)=0} and weighted by (analyticOrderAt riemannZeta s).toNat; the trivial zeros are excluded. Integrals are Bochner integrals and sums are tsum, so both take the junk value 000 when the integrand is not integrable or the family is not summable — for that reason the explicit formula is stated as a HasSum, which carries summability, rather than as an equation between tsums. The archimedean term is written with Re⁡ψ\operatorname{Re}\psiReψ, ψ=\psi = ψ= logDeriv Complex.Gamma, rather than as a principal value, to avoid a second regularization convention.

The goal is not trivially satisfiable: its hypothesis quantifies over a nonempty class (smooth bump functions exist), and its conclusion is RH for ζ\zetaζ, so no vacuous reading is available.

Infrastructure a complete development needs, all reusable beyond this mission: growth bounds for ζ′/ζ\zeta'/\zetaζ′/ζ inside the critical strip, a Riemann–von Mangoldt zero-counting bound, Fourier analysis of Cc∞C^\infty_cCc∞​ functions (Paley–Wiener style decay of g^\widehat gg​), and the Hadamard product / functional equation package for the completed zeta function.

Out of scope, and deliberately so: Connes' operator-theoretic trace formula (equations (41) and (45) of the paper) and the spectral realization theorem of p. 17. Both are statements about traces of operators on Hilbert space, and Mathlib presently has no trace-class operator theory to state them faithfully. The mission therefore formalizes the arithmetic side of the paper's endpoint; contributions that build the missing operator theory, or that extend the statements from ζ\zetaζ to Dirichlet LLL-functions and Hecke LLL-functions with Grössencharakter, are welcome.

Selected references

  • A. Connes, Noncommutative geometry and the Riemann zeta function, in Mathematics: Frontiers and Perspectives, AMS (2000) — the source of this mission (§3, equations (11) and (45), and the concluding assertion on p. 22).
  • A. Connes, Trace formula in noncommutative geometry and the zeros of the Riemann zeta function, Selecta Math. (N.S.) 5 (1999) — reference [9] of the source. https://arxiv.org/abs/math/9811068
  • A. Weil, Sur les "formules explicites" de la théorie des nombres premiers, Comm. Sém. Math. Univ. Lund (1952) — reference [27] of the source.
  • E. Bombieri, Remarks on Weil's quadratic functional in the theory of prime numbers, I (2000).
  • H. Iwaniec and E. Kowalski, Analytic Number Theory, AMS Colloquium Publications 53 (2004), Chapter 5 (explicit formulas).
14 thms3 active usersReviewed
🏆Completed
AnalysisMachine LearningProbability+1·Captain: Shuze Chen

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

Motivation

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. N. Vapnik, The Nature of Statistical Learning Theory (2nd ed., Springer 2000, doi:10.1007/978-1-4757-3264-1), §6.3–6.5, gives such closed forms for the kernels generating orthogonal-polynomial, spline and Fourier expansions. It also states Theorem 6.1, which lifts any one-dimensional kernel to nnn dimensions. The book prints these identities without proof and cites classical sources (Mikhlin 1964; Gradshtein and Ryzhik 1980). Several of them, as printed, are off by a constant factor, which a formal check settles.

Setting

Kernels in this mission are real functions of two real variables (or of two vectors of Rn\mathbb R^nRn) of the form K(x,y)=∑iri ψi(x) ψi(y)K(x, y) = \sum_i r_i\, \psi_i(x)\, \psi_i(y)K(x,y)=∑i​ri​ψi​(x)ψi​(y), a finite or convergent sum over basis functions ψi\psi_iψi​ with weights ri≥0r_i \ge 0ri​≥0.

  • Orthonormal polynomials. P1,P2,…P_1, P_2, \dotsP1​,P2​,… are real polynomials with deg⁡Pk=k−1\deg P_k = k - 1degPk​=k−1 that are orthonormal for a measure μ\muμ on R\mathbb RR with finite moments. Kn(x,y)=∑k=1nPk(x)Pk(y)K_n(x, y) = \sum_{k=1}^n P_k(x) P_k(y)Kn​(x,y)=∑k=1n​Pk​(x)Pk​(y) is the kernel of the first nnn of them.
  • Hermite. Pk(x)=(−1)kex2(d/dx)ke−x2P_k(x) = (-1)^k e^{x^2} (d/dx)^k e^{-x^2}Pk​(x)=(−1)kex2(d/dx)ke−x2, and Hk(x)=μkPk(x)e−x2H_k(x) = \mu_k P_k(x) e^{-x^2}Hk​(x)=μk​Pk​(x)e−x2 with normalization constants μk\mu_kμk​ (6.23). The regularized kernel is ∑i≥0qiHi(x)Hi(y)\sum_{i \ge 0} q^i H_i(x) H_i(y)∑i≥0​qiHi​(x)Hi​(y) with 0≤q<10 \le q < 10≤q<1.
  • Tensor products. Given coordinatewise basis functions bib_ibi​ on a set XXX, the nnn-dimensional basis is bi1…in(x)=bi1(x1)⋯bin(xn)b_{i_1 \dots i_n}(x) = b_{i_1}(x^1) \cdots b_{i_n}(x^n)bi1​…in​​(x)=bi1​​(x1)⋯bin​​(xn) (6.25).
  • Splines. The truncated power (x−t)+d(x - t)^d_+(x−t)+d​ is 000 for x≤tx \le tx≤t and (x−t)d(x - t)^d(x−t)d for x>tx > tx>t. The spline kernel with infinitely many nodes on (0,a)(0, a)(0,a) is ∫0a(xj−t)+d(xi−t)+d dt+∑r=0dxjrxir\int_0^a (x_j - t)^d_+ (x_i - t)^d_+\, dt + \sum_{r=0}^d x_j^r x_i^r∫0a​(xj​−t)+d​(xi​−t)+d​dt+∑r=0d​xjr​xir​ for xj,xi∈[0,a]x_j, x_i \in [0, a]xj​,xi​∈[0,a].
  • Fourier. KN(x,xi)=12+∑k=1N(sin⁡kxsin⁡kxi+cos⁡kxcos⁡kxi)K_N(x, x_i) = \tfrac12 + \sum_{k=1}^N (\sin kx \sin kx_i + \cos kx \cos kx_i)KN​(x,xi​)=21​+∑k=1N​(sinkxsinkxi​+coskxcoskxi​) is the kernel of the trigonometric polynomials of degree NNN. Its regularized versions damp the kkk-th harmonic by qkq^kqk (0<q<10 < q < 10<q<1) or by 1/(1+γ2k2)1/(1 + \gamma^2 k^2)1/(1+γ2k2) (γ>0\gamma > 0γ>0).

Formalization targets

Goal: Eq. (6.33)

For γ>0\gamma > 0γ>0 and real xi,xjx_i, x_jxi​,xj​ with 0≤∣xi−xj∣≤2π0 \le |x_i - x_j| \le 2\pi0≤∣xi​−xj​∣≤2π, the series converges and

12+∑k=1∞cos⁡kxicos⁡kxj+sin⁡kxisin⁡kxj1+γ2k2=π2γ cosh⁡π−∣xi−xj∣γsinh⁡πγ.\frac12 + \sum_{k=1}^{\infty} \frac{\cos kx_i \cos kx_j + \sin kx_i \sin kx_j}{1 + \gamma^2 k^2} = \frac{\pi}{2\gamma}\, \frac{\cosh\frac{\pi - |x_i - x_j|}{\gamma}}{\sinh\frac{\pi}{\gamma}} .21​+k=1∑∞​1+γ2k2coskxi​coskxj​+sinkxi​sinkxj​​=2γπ​sinhγπ​coshγπ−∣xi​−xj​∣​​.

The only numbered theorem of the section, Theorem 6.1, is close to an unfolding of the definitions. The goal is therefore the deepest identity of the section that is correct as printed.

Milestones

  1. (6.21), Christoffel–Darboux. There is a constant ana_nan​ such that Kn(x,y)=anPn+1(x)Pn(y)−Pn(x)Pn+1(y)x−yK_n(x, y) = a_n \frac{P_{n+1}(x)P_n(y) - P_n(x)P_{n+1}(y)}{x - y}Kn​(x,y)=an​x−yPn+1​(x)Pn​(y)−Pn​(x)Pn+1​(y)​ for x≠yx \ne yx=y and Kn(x,x)=an[Pn+1′(x)Pn(x)−Pn′(x)Pn+1(x)]K_n(x, x) = a_n[P'_{n+1}(x)P_n(x) - P'_n(x)P_{n+1}(x)]Kn​(x,x)=an​[Pn+1′​(x)Pn​(x)−Pn′​(x)Pn+1​(x)].
  2. (6.24), Hermite kernel. For some constants μk\mu_kμk​: ∑i≥0qiHi(x)Hi(y)=1π(1−q2)exp⁡{2xyq1+q−(x−y)2q21−q2}\sum_{i \ge 0} q^i H_i(x)H_i(y) = \frac{1}{\sqrt{\pi(1-q^2)}} \exp\{\frac{2xyq}{1+q} - \frac{(x-y)^2q^2}{1-q^2}\}∑i≥0​qiHi​(x)Hi​(y)=π(1−q2)​1​exp{1+q2xyq​−1−q2(x−y)2q2​} for all 0≤q<10 \le q < 10≤q<1 and real x,yx, yx,y.
  3. Theorem 6.1. ∑(i1,…,in)bi1…in(x) bi1…in(y)=∏k=1n∑ibi(xk)bi(yk)\sum_{(i_1, \dots, i_n)} b_{i_1 \dots i_n}(x)\, b_{i_1 \dots i_n}(y) = \prod_{k=1}^n \sum_i b_i(x^k) b_i(y^k)∑(i1​,…,in​)​bi1​…in​​(x)bi1​…in​​(y)=∏k=1n​∑i​bi​(xk)bi​(yk), for finite bases or bases whose one-dimensional kernel converges.
  4. (6.26). ∏i=1n1π(1−q2)exp⁡{⋯ }=1(1−q2)n/2exp⁡{2(x∗y)q1+q−∣x−y∣2q21−q2}\prod_{i=1}^n \frac{1}{\sqrt{\pi(1-q^2)}} \exp\{\cdots\} = \frac{1}{(1-q^2)^{n/2}} \exp\{\frac{2(x*y)q}{1+q} - \frac{|x-y|^2q^2}{1-q^2}\}∏i=1n​π(1−q2)​1​exp{⋯}=(1−q2)n/21​exp{1+q2(x∗y)q​−1−q2∣x−y∣2q2​}.
  5. (6.30), splines. For d≥0d \ge 0d≥0, the spline kernel equals ∑r=0dCdr2d−r+1(xj∧xi)2d−r+1∣xj−xi∣r+∑r=0dxjrxir\sum_{r=0}^d \frac{C_d^r}{2d - r + 1} (x_j \wedge x_i)^{2d-r+1} |x_j - x_i|^r + \sum_{r=0}^d x_j^r x_i^r∑r=0d​2d−r+1Cdr​​(xj​∧xi​)2d−r+1∣xj​−xi​∣r+∑r=0d​xjr​xir​. For d=1d = 1d=1 this is 1+xjxi+12∣xj−xi∣(xj∧xi)2+(xj∧xi)3/31 + x_jx_i + \frac12|x_j - x_i|(x_j \wedge x_i)^2 + (x_j \wedge x_i)^3/31+xj​xi​+21​∣xj​−xi​∣(xj​∧xi​)2+(xj​∧xi​)3/3.
  6. Dirichlet kernel (p. 197). KN(x,xi)=12+∑k=1Ncos⁡k(x−xi)=sin⁡(2N+1)(x−xi)2/sin⁡x−xi2K_N(x, x_i) = \frac12 + \sum_{k=1}^N \cos k(x - x_i) = \sin\frac{(2N+1)(x - x_i)}{2} \big/ \sin\frac{x - x_i}{2}KN​(x,xi​)=21​+∑k=1N​cosk(x−xi​)=sin2(2N+1)(x−xi​)​/sin2x−xi​​ for x−xi∉2πZx - x_i \notin 2\pi\mathbb Zx−xi​∈/2πZ.
  7. (6.32), Poisson kernel. For 0<q<10 < q < 10<q<1: 12+∑k≥1qkcos⁡k(xi−xj)=1−q22(1−2qcos⁡(xi−xj)+q2)\frac12 + \sum_{k \ge 1} q^k \cos k(x_i - x_j) = \frac{1 - q^2}{2(1 - 2q\cos(x_i - x_j) + q^2)}21​+∑k≥1​qkcosk(xi​−xj​)=2(1−2qcos(xi​−xj​)+q2)1−q2​.

Milestones 2, 4 and 6 are stated exactly as printed and are believed false (see Formalization scope). A disproof of each is a complete answer.

Significance

The result itself. Each closed form replaces an infinite or high-dimensional inner product by a constant number of elementary operations. That is what makes the regularized Fourier, Hermite and spline kernels usable in an SVM. Theorem 6.1 is the mechanism by which every multidimensional kernel of Chapter 6 is obtained from a one-dimensional one. The constants matter in practice. A wrong prefactor rescales the kernel matrix, and so the effective regularization of the SVM solution.

Formalizing it. The identities themselves are classical (Christoffel 1858, Darboux 1878, Mehler 1866, and the Fourier series of cosh⁡\coshcosh on [0,2π][0, 2\pi][0,2π]). As far as a search of the platform shows, none is stated on Prove2Me in these forms. SpikedWishart.Separated.eq_299 (Open) is one Christoffel–Darboux instance for a specific Hermite family. AronszajnRK.Product.direct_product_kernel concerns reproducing-kernel Hilbert spaces, not finite or summable feature sums. The mission produces machine-checked versions of the book's catalogue, together with a formal verdict on the three displays that are off by a constant.

Difficulty

The goal and (6.32) are infinite-series identities with no ready-made counterpart in the library, and the goal holds only on ∣xi−xj∣≤2π|x_i - x_j| \le 2\pi∣xi​−xj​∣≤2π. Outside that range the left side is 2π2\pi2π-periodic and the right side is not, so no argument that ignores the range can succeed. The Christoffel–Darboux formula needs a theory of orthogonal polynomials for a general measure, which Mathlib does not yet provide. (6.24) involves the iterated derivatives of e−x2e^{-x^2}e−x2 and a doubly infinite parameter family. The spline identity requires evaluating a piecewise-polynomial integral exactly. Theorem 6.1 for infinite bases requires summability over a product index set ιn\iota^nιn. The three false displays (2, 4, 6) hide their error in a constant factor. Two of them still reduce to an identity a solver may expect to hold.

Formalization scope

Everything is over R\mathbb RR. Series are stated with HasSum, or as Summable together with an equation for tsum. A divergent series therefore never reads as 000. Sums over k≥1k \ge 1k≥1 are written over k∈Nk \in \mathbb Nk∈N with k+1k + 1k+1 in place of kkk. The Christoffel–Darboux polynomials are indexed as in the book (P1P_1P1​ is the constant), they are orthonormal up to Pn+1P_{n+1}Pn+1​, and the measure has all moments finite. The Hermite PkP_kPk​ is the physicists' family, defined through iteratedDeriv. It is not Mathlib's probabilists' Polynomial.hermite. The normalization constants of (6.24) are existentially quantified, since the book does not give them. The range of qqq in (6.24) and (6.26) is 0≤q<10 \le q < 10≤q<1: the book's 0≤q≤10 \le q \le 10≤q≤1 without the singular point q=1q = 1q=1. The Dirichlet display is stated where sin⁡x−xi2≠0\sin\frac{x - x_i}{2} \ne 0sin2x−xi​​=0. The goal adds γ>0\gamma > 0γ>0, which the page leaves unstated. Spline points lie in [0,a][0, a][0,a] with a>0a > 0a>0. In Theorem 6.1, the multidimensional kernel is the sum over multi-indices of products of basis functions, a statement to be proved and not the product of kernels by definition. A formalization that defined the nnn-dimensional kernel as ∏kK(xk,yk)\prod_k K(x^k, y^k)∏k​K(xk,yk) would make the theorem trivial, and is ruled out.

Beyond the paper. Three corrected variants sit beside the faithful statements. Each changes one clause only. dirichlet_kernel_corrected (finding F1) uses the denominator 2sin⁡x−xi22\sin\frac{x - x_i}{2}2sin2x−xi​​, since at N=0N = 0N=0 and x−xi=πx - x_i = \pix−xi​=π the printed display reads 12=1\frac12 = 121​=1. hermite_kernel_corrected (F2) takes Hk=μkPkH_k = \mu_k P_kHk​=μk​Pk​ without the Gaussian factor. At q=0q = 0q=0 the printed (6.24) forces μ02e−x2−y2=π−1/2\mu_0^2 e^{-x^2-y^2} = \pi^{-1/2}μ02​e−x2−y2=π−1/2 for all x,yx, yx,y, and the corrected form is Mehler's formula. hermite_kernel_multidim_corrected (F3) uses the prefactor (π(1−q2))−n/2(\pi(1 - q^2))^{-n/2}(π(1−q2))−n/2, since at n=1n = 1n=1, x=y=0x = y = 0x=y=0, q=0q = 0q=0 the printed (6.26) reads π−1/2=1\pi^{-1/2} = 1π−1/2=1. One further observation is recorded without a variant: (6.33) also holds for γ<0\gamma < 0γ<0, because both sides are even in γ\gammaγ.

Reusable beyond this mission are the two definitions (the physicists' Hermite functions and the truncated power) and any proof of the summable form of Theorem 6.1. Proofs, disproofs of the three false milestones, and general lemmas on Fourier series of cosh⁡\coshcosh and qkcos⁡kθq^k\cos k\thetaqkcoskθ are all welcome.

Selected references

  • V. N. Vapnik, The Nature of Statistical Learning Theory, 2nd ed., Springer, 2000. doi:10.1007/978-1-4757-3264-1
  • I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, Academic Press, 1980 (7th ed. 2007). doi:10.1016/C2009-0-22516-5
  • G. Szegő, Orthogonal Polynomials, AMS Colloquium Publications 23, 1939 (Christoffel–Darboux formula, §3.2). doi:10.1090/coll/023
  • F. G. Mehler, Ueber die Entwicklung einer Function von beliebig vielen Variablen nach Laplaceschen Functionen höherer Ordnung, J. reine angew. Math. 66 (1866), 161–176. doi:10.1515/crll.1866.66.161
  • S. G. Mikhlin, Variational Methods in Mathematical Physics, Pergamon, 1964.
10 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: Lucas

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

Motivation

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 this allows the Fourier transform to be defined on the dual space S′(Rn)\mathcal{S}'(\mathbb{R}^n)S′(Rn) of tempered distributions, which is the setting of the modern theory of linear partial differential equations (Hörmander, Vol. I) and of much of mathematical physics (Reed–Simon, Vol. I). The space is named after Laurent Schwartz.

This mission formalizes the definition and the elementary analytic properties of S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) exactly as stated in the Wikipedia article Schwartz space (revision 1360762580), with the Fourier-automorphism property as the goal.

Setting

Write Rn\mathbb{R}^nRn for the coordinate space with the Euclidean norm ∣x∣=(x12+⋯+xn2)1/2|x| = (x_1^2 + \dots + x_n^2)^{1/2}∣x∣=(x12​+⋯+xn2​)1/2 and Lebesgue measure. A multi-index is a tuple α=(α1,…,αn)∈Nn\alpha = (\alpha_1, \dots, \alpha_n) \in \mathbb{N}^nα=(α1​,…,αn​)∈Nn, and xα=x1α1⋯xnαnx^\alpha = x_1^{\alpha_1} \cdots x_n^{\alpha_n}xα=x1α1​​⋯xnαn​​. For a function f:Rn→Cf : \mathbb{R}^n \to \mathbb{C}f:Rn→C, ∂if\partial_i f∂i​f denotes the partial derivative in the iii-th coordinate direction and

Dβf=∂1β1⋯∂nβnf.D^\beta f = \partial_1^{\beta_1} \cdots \partial_n^{\beta_n} f .Dβf=∂1β1​​⋯∂nβn​​f.

For α,β∈Nn\alpha, \beta \in \mathbb{N}^nα,β∈Nn put

∥f∥α,β=sup⁡x∈Rn∣xα(Dβf)(x)∣∈[0,∞].\|f\|_{\alpha,\beta} = \sup_{x \in \mathbb{R}^n} \bigl| x^\alpha (D^\beta f)(x) \bigr| \in [0, \infty].∥f∥α,β​=x∈Rnsup​​xα(Dβf)(x)​∈[0,∞].

The Schwartz space is

S(Rn,C)={f∈C∞(Rn,C):∥f∥α,β<∞ for all α,β∈Nn}.\mathcal{S}(\mathbb{R}^n, \mathbb{C}) = \bigl\{ f \in C^\infty(\mathbb{R}^n, \mathbb{C}) : \|f\|_{\alpha,\beta} < \infty \text{ for all } \alpha, \beta \in \mathbb{N}^n \bigr\}.S(Rn,C)={f∈C∞(Rn,C):∥f∥α,β​<∞ for all α,β∈Nn}.

Informally, fff and all its derivatives decay at infinity faster than any reciprocal power of ∣x∣|x|∣x∣.

The Fourier transform of f:Rn→Cf : \mathbb{R}^n \to \mathbb{C}f:Rn→C is

(Ff)(ξ)=∫Rne−2πi⟨x,ξ⟩f(x) dx.(\mathcal{F} f)(\xi) = \int_{\mathbb{R}^n} e^{-2\pi i \langle x, \xi \rangle} f(x) \, dx .(Ff)(ξ)=∫Rn​e−2πi⟨x,ξ⟩f(x)dx.

In the Lean development these objects are SchwartzSpaceWiki.monomial, partialDeriv, iteratedPartialDeriv, schwartzSeminorm, schwartzSpace n and fourierTransform.

Formalization targets

Goal: the Fourier transform is an automorphism of S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn)

F:S(Rn)→S(Rn) is a linear bijection.\mathcal{F} : \mathcal{S}(\mathbb{R}^n) \to \mathcal{S}(\mathbb{R}^n) \text{ is a linear bijection.}F:S(Rn)→S(Rn) is a linear bijection.

Formally: Set.BijOn fourierTransform (schwartzSpace n) (schwartzSpace n) together with F(f+cg)=Ff+c Fg\mathcal{F}(f + c g) = \mathcal{F} f + c\,\mathcal{F} gF(f+cg)=Ff+cFg for f,g∈S(Rn)f, g \in \mathcal{S}(\mathbb{R}^n)f,g∈S(Rn) and c∈Cc \in \mathbb{C}c∈C.

Milestones (in the order of the source)

  1. S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) is a complex linear subspace of C∞(Rn,C)C^\infty(\mathbb{R}^n, \mathbb{C})C∞(Rn,C).
  2. xαe−a∣x∣2∈S(Rn)x^\alpha e^{-a|x|^2} \in \mathcal{S}(\mathbb{R}^n)xαe−a∣x∣2∈S(Rn) for every multi-index α\alphaα and every a>0a > 0a>0.
  3. Cc∞(Rn)⊆S(Rn)C_c^\infty(\mathbb{R}^n) \subseteq \mathcal{S}(\mathbb{R}^n)Cc∞​(Rn)⊆S(Rn): smooth compactly supported functions are Schwartz functions.
  4. P(x)e−a∣x∣2∈S(Rn)P(x) e^{-a|x|^2} \in \mathcal{S}(\mathbb{R}^n)P(x)e−a∣x∣2∈S(Rn) for every polynomial PPP and a>0a > 0a>0, and P↦Pe−a∣x∣2P \mapsto P e^{-a|x|^2}P↦Pe−a∣x∣2 is injective.
  5. f,g∈S(Rn)⇒fg∈S(Rn)f, g \in \mathcal{S}(\mathbb{R}^n) \Rightarrow fg \in \mathcal{S}(\mathbb{R}^n)f,g∈S(Rn)⇒fg∈S(Rn).
  6. If f∈S(Rn)f \in \mathcal{S}(\mathbb{R}^n)f∈S(Rn) and ggg is smooth and bounded with all its derivatives, then fg∈S(Rn)fg \in \mathcal{S}(\mathbb{R}^n)fg∈S(Rn).
  7. Every f∈S(Rn)f \in \mathcal{S}(\mathbb{R}^n)f∈S(Rn) is Lipschitz, hence uniformly continuous.
  8. For 1≤p<∞1 \le p < \infty1≤p<∞, S(Rn)⊆Lp(Rn)\mathcal{S}(\mathbb{R}^n) \subseteq L^p(\mathbb{R}^n)S(Rn)⊆Lp(Rn) and it is dense there.

Significance

The result itself. The automorphism property is what makes S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) the natural test-function space for tempered distributions: the Fourier transform of a tempered distribution TTT is defined by ⟨FT,φ⟩=⟨T,Fφ⟩\langle \mathcal{F} T, \varphi \rangle = \langle T, \mathcal{F} \varphi \rangle⟨FT,φ⟩=⟨T,Fφ⟩, which only makes sense because Fφ\mathcal{F}\varphiFφ is again a Schwartz function. Density in LpL^pLp (milestone 8) is what lets identities proved on Schwartz functions, such as Plancherel's theorem, extend to L2L^2L2 and other LpL^pLp spaces. The closure properties (milestones 1, 5, 6) say that S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) is an algebra and a module over smooth functions with bounded derivatives.

Formalizing it. All results here are classical. Mathlib contains a Schwartz-space type SchwartzMap built on iterated Fréchet derivatives and the norm ∥x∥k\|x\|^k∥x∥k, together with a Fourier transform on it. This mission instead states everything for the concrete, coordinate-wise multi-index definition used in the source. A complete development therefore includes a proof that the two definitions agree, which is reusable on its own.

Difficulty

The multi-index seminorms sup⁡∣xαDβf∣\sup |x^\alpha D^\beta f|sup∣xαDβf∣ are coordinate-wise, while the standard library works with the total derivative and the full norm ∣x∣k|x|^k∣x∣k. The comparison needs inequalities in both directions between ∣xα∣|x^\alpha|∣xα∣ and powers of ∣x∣|x|∣x∣, and between the iterated partial derivatives DβfD^\beta fDβf and the norm of the kkk-th Fréchet derivative. For the goal, surjectivity is the hard part: it needs the Fourier inversion formula on S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn), not only the fact that F\mathcal{F}F preserves decay and smoothness. For milestone 8, density requires approximating arbitrary LpL^pLp functions, e.g. by compactly supported smooth functions, and this does not follow from the definition of S\mathcal{S}S alone.

Formalization scope

  • Rn\mathbb{R}^nRn is EuclideanSpace ℝ (Fin n) (Euclidean norm, Lebesgue volume). Functions take values in C\mathbb{C}C. n=0n = 0n=0 is allowed.
  • Smoothness is ContDiff ℝ (⊤ : ℕ∞), i.e. C∞C^\inftyC∞ (not analyticity).
  • ∂if(x)\partial_i f(x)∂i​f(x) is fderiv ℝ f x (EuclideanSpace.single i 1), and DβD^\betaDβ applies ∂1β1,…,∂nβn\partial_1^{\beta_1}, \dots, \partial_n^{\beta_n}∂1β1​​,…,∂nβn​​ in a fixed order. For smooth fff the order does not matter.
  • The seminorm ∥f∥α,β\|f\|_{\alpha,\beta}∥f∥α,β​ is a supremum in [0,∞][0, \infty][0,∞] (ℝ≥0∞), so "<∞< \infty<∞" really means bounded. A real-valued supremum would return 000 on unbounded sets and trivialize the definition.
  • The source does not fix a Fourier normalisation. The convention e−2πi⟨x,ξ⟩e^{-2\pi i\langle x,\xi\rangle}e−2πi⟨x,ξ⟩ is used. fourierTransform is a Bochner integral, which is 000 for non-integrable integrands. Every target only applies it to Schwartz functions, which are integrable.
  • The goal is stated as a bijection of the set schwartzSpace n onto itself plus linearity on it. It does not presuppose that schwartzSpace n has been given a module structure.
  • Not included: the topological statements of the source (that S(Rn)\mathcal{S}(\mathbb{R}^n)S(Rn) is a nuclear Montel Fréchet space, ultrabornological, reflexive, etc., and the corresponding facts for its strong dual). They require equipping the set with its seminorm topology, which this mission does not define. They are natural follow-up missions.

Contributions welcome: the equivalence with Mathlib's SchwartzMap, coordinate–norm comparison lemmas for xαx^\alphaxα, and the Leibniz rule for iteratedPartialDeriv.

Selected references

  • Wikipedia contributors, Schwartz space, revision 1360762580. https://en.wikipedia.org/w/index.php?title=Schwartz_space&oldid=1360762580
  • L. Hörmander, The Analysis of Linear Partial Differential Operators I, 2nd ed., Springer, 1990. ISBN 3-540-52343-X.
  • M. Reed, B. Simon, Methods of Modern Mathematical Physics I: Functional Analysis, revised ed., Academic Press, 1980. ISBN 0-12-585050-6.
  • E. M. Stein, R. Shakarchi, Fourier Analysis: An Introduction, Princeton University Press, 2003. ISBN 0-691-11384-X.
  • F. Trèves, Topological Vector Spaces, Distributions and Kernels, Dover, 2006 [1967]. ISBN 978-0-486-45352-1.
10 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

Unbounded Violations of the Square-Root Degree BoundOpen Problem

Motivation

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.

Setting

A Boolean function here takes values in {−1,1}\{-1,1\}{−1,1} on a finite sign cube. Fourier coefficients use the uniform distribution. The Fourier degree is the largest support size of a nonzero coefficient; it is unrelated to degree over a field of characteristic two.

Formalization targets

∀C>0 ∃f:∑if^({i})>Cdeg⁡f,{∑i∣f^({i})∣deg⁡f:deg⁡f>0} is unbounded above.\forall C>0\ \exists f:\quad\sum_i\widehat f(\{i\})>C\sqrt{\deg f},\qquad \left\{\frac{\sum_i|\widehat f(\{i\})|}{\sqrt{\deg f}}:\deg f>0\right\}\text{ is unbounded above}.∀C>0 ∃f:i∑​f​({i})>Cdegf​,{degf​∑i​∣f​({i})∣​:degf>0} is unbounded above.

Two things about real Fourier analysis on Boolean cubes, where a Boolean input is read as a sign (false is +1, true is -1), averages are uniform, and degree is the ordinary real Fourier degree, meaning the largest size of a subset s with nonzero Fourier coefficient, the coefficient being the average of f(x) times the product of the signs of the coordinates in s. First, SignedViolations holds: for every real C>0 there is a positive integer n and a function f from {false,true}^n to the reals that takes only the values -1 and 1, is nonconstant, and satisfies C·√(deg f) < Σᵢ f̂({i}), the plain signed sum of its degree-one Fourier coefficients over single coordinates. Second, the set of ratios (Σᵢ |f̂({i})|)/√(deg f), taken over all positive n and all Boolean-valued f on n coordinates with positive Fourier degree, is not bounded above in the reals, so the supremum of these ratios is infinite.

The goal is OAI.SquareRootDegree.main.

Significance

Both signed violations and unbounded absolute ratios are retained. The result concerns failure of every constant multiple, which is stronger than exhibiting one violation of a proposed constant-one inequality. The manuscript presents a mathematical argument; the attached goal currently has status Open, so the requested contribution is a Lean proof of the displayed formal target.

Difficulty

A large ambient dimension is not itself a violation: the denominator depends on degree. The function must remain Boolean and nonconstant while its linear coefficient sum outgrows that denominator.

Formalization scope

Inputs are Fin n → Bool, with false interpreted as +1+1+1 and true as −1-1−1. The first clause requires positive dimension and a nonconstant function. The second restricts to positive Fourier degree and uses ¬ BddAbove, avoiding a real-valued infinity convention.

The shared definitions are supplied by SquareRootDegree. The target uses Lean 4.33.1 with the pinned Mathlib environment. Contributions should preserve the existing statement and develop reusable supporting lemmas in its definitions.

Selected references

  • OpenAI, Unbounded Violations of the Square-Root Degree Bound, preprint, September 2026. Manuscript.
  • OpenAI, accompanying Lean statement. Pinned source.
33 thms2 active usersReviewed
🏆Completed
Functional AnalysisGroup Theory·Captain: wurtle

Unitarizability implies amenability for discrete groupsResearch Paper

Motivation

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 matters which groups have only unitarizable uniformly bounded representations. Day and Dixmier showed in 1950 that every amenable group (one with an invariant mean) has this property, and Dixmier asked whether the converse holds. Dixmier's unitarizability problem has driven work in operator algebras, ℓ2\ell^2ℓ2-invariants and measured group theory for seven decades.

Timeline

  • 1947. Sz.-Nagy proves that an invertible operator with uniformly bounded powers is similar to a unitary.
  • 1950. Day and Dixmier prove that amenable groups are unitarizable; Dixmier asks whether the converse holds (doi:10.2307/1990358).
  • 1955. Ehrenpreis and Mautner give nonunitarizable uniformly bounded representations of SL2(R)\mathrm{SL}_2(\mathbb R)SL2​(R) (doi:10.1073/pnas.41.4.231); Følner gives his finite-set criterion for amenability (doi:10.7146/math.scand.a-10442).
  • 1986. Pytlik and Szwarc construct explicit nonunitarizable families for free groups, settling all groups containing F2F_2F2​ (doi:10.1007/BF02392596).
  • 1998. Pisier characterizes amenability by a quantitative similarity bound with exponent <3<3<3 (The similarity degree of an operator algebra, Algebra i Analiz, 1998).
  • 2009. Epstein and Monod use invariant random forests to prove nonunitarizability for residually finite groups with positive first ℓ2\ell^2ℓ2-Betti number (doi:10.1093/imrn/rnp090); Osin obtains nonunitarizable groups without free subgroups.
  • 2010. Monod and Ozawa prove that the wreath products A≀GA\wr GA≀G with AAA infinite abelian are unitarizable exactly when GGG is amenable (doi:10.1016/j.jfa.2009.06.029), using the Gaboriau–Lyons theorem (doi:10.1007/s00222-009-0187-5).
  • 2018–2025. Gerasimova, Gruber, Monod and Thom relate unitarizability to Cheeger constants (doi:10.1016/j.jfa.2019.108457); Alpeev and Vergara obtain further cases.

The source of this mission, an OpenAI preprint dated September 23, 2026, answers Dixmier's question affirmatively for all discrete groups.

Setting

Let GGG be a discrete group. GGG is amenable if there is a linear functional mmm on the bounded functions G→CG\to\mathbb CG→C with m(1)=1m(1)=1m(1)=1, m(f)≥0m(f)\ge0m(f)≥0 for f≥0f\ge0f≥0, and m(Lgf)=m(f)m(L_gf)=m(f)m(Lg​f)=m(f), where (Lgf)(x)=f(g−1x)(L_gf)(x)=f(g^{-1}x)(Lg​f)(x)=f(g−1x).

A representation is a homomorphism π:G→B(K)\pi:G\to\mathcal B(\mathcal K)π:G→B(K) into bounded operators on a complex Hilbert space K\mathcal KK (each π(g)\pi(g)π(g) is then invertible). It is similar to a unitary representation if there is a bounded invertible SSS with Sπ(g)S−1S\pi(g)S^{-1}Sπ(g)S−1 unitary for every ggg. GGG is unitarizable if every uniformly bounded representation on every complex Hilbert space is similar to a unitary representation; the similarity may depend on the representation.

Formalization targets

Milestone: countable case

Every countable nonamenable GGG has a representation on a separable Hilbert space with sup⁡g∥π(g)∥≤101\sup_g\|\pi(g)\|\le101supg​∥π(g)∥≤101 that is not similar to a unitary representation.

Goal: Theorem 1.1

G amenable  ⟺  G unitarizable,G\ \text{amenable}\iff G\ \text{unitarizable},G amenable⟺G unitarizable,

and for nonamenable GGG and every ε>0\varepsilon>0ε>0 there is π\piπ with sup⁡g∥π(g)∥≤1+ε\sup_g\|\pi(g)\|\le1+\varepsilonsupg​∥π(g)∥≤1+ε not similar to a unitary representation, on a separable space when GGG is countable. The Lean statement OAI.Dixmier.current_main_theorem is open on the platform.

Significance

Theorem 1.1 characterizes amenability of discrete groups by a purely Hilbert-space property, without any quantitative bound on similarities, and shows that nonunitarizable representations can be chosen with uniform bound arbitrarily close to 111. Earlier results produced witnesses for groups with free subgroups, for residually finite groups with positive ℓ2\ell^2ℓ2-Betti number, or for wreath-product extensions of GGG; the theorem gives a witness for every nonamenable GGG itself. The paper also derives a consequence for group C∗^*∗-algebras using a companion similarity result.

The result is proved in an OpenAI preprint; it has not been peer reviewed, and no machine-checked proof exists. The amenable direction (Day–Dixmier averaging) is classical and a natural first formalization step; the converse needs the paper's new operator construction.

Difficulty

A witness must be one representation for which no similarity exists, with no a priori control of the condition number of a putative unitarizer; quantitative criteria such as Pisier's do not apply. Nonamenable groups need not contain free subgroups and need not be residually finite, so the earlier free-group, random-forest and ℓ2\ell^2ℓ2-Betti routes do not cover them. The paper builds bounded operator cocycles with no bounded implementer, which requires operators whose conjugation differences under translation are uniformly bounded while their distance from the translation commutant tends to infinity.

Formalization scope

  • Amenability is stated for G with the discrete topology, using G →ᵇ ℂ for ℓ∞(G)\ell^\infty(G)ℓ∞(G); positivity is required on functions with nonnegative real values.
  • Representations are monoid homomorphisms G →* (H →L[ℂ] H) with [InnerProductSpace ℂ H] [CompleteSpace H]; SimilarToUnitary π asks for S : H ≃L[ℂ] H with ∥Sπ(g)S−1x∥=∥x∥\|S\pi(g)S^{-1}x\|=\|x\|∥Sπ(g)S−1x∥=∥x∥ for all g,xg,xg,x.
  • Unitarizability quantifies over Hilbert spaces in universe max u v, and the witness is built there; since the theorem holds for every v, this covers all Hilbert spaces.
  • Separability of the witness is required only for countable G, as in the paper.

A complete development needs bounded operator cocycles and triangular representations, Hilbert direct sums, Hilbert–Schmidt estimates, Følner's criterion, induction of representations from subgroups, and invariant means. Contributions formalizing the Day–Dixmier direction, Proposition 2.2 (direct-sum obstruction) and Lemma 5.1 (induction from a subgroup) are welcome.

Selected references

  • OpenAI, Unitarizability implies amenability for discrete groups, preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Unitarizability-Implies-Amenability-for-Countable-Groups-September-23-2026/paper.pdf
  • M. M. Day, Means for the bounded functions and ergodicity of the bounded representations of semi-groups, Trans. Amer. Math. Soc., 1950. https://doi.org/10.2307/1990358
  • J. Dixmier, Les moyennes invariantes dans les semi-groupes et leurs applications, Acta Sci. Math. (Szeged), 1950.
  • G. Pisier, Are unitarizable groups amenable?, preprint, 2004. https://arxiv.org/abs/math/0405282
  • I. Epstein, N. Monod, Nonunitarizable representations and random forests, IMRN, 2009. https://doi.org/10.1093/imrn/rnp090
  • N. Monod, N. Ozawa, The Dixmier problem, lamplighters and Burnside groups, J. Funct. Anal., 2010. https://doi.org/10.1016/j.jfa.2009.06.029
  • D. Gaboriau, R. Lyons, A measurable-group-theoretic solution to von Neumann's problem, Invent. Math., 2009. https://doi.org/10.1007/s00222-009-0187-5
  • T. Pytlik, R. Szwarc, An analytic family of uniformly bounded representations of free groups, Acta Math., 1986. https://doi.org/10.1007/BF02392596
  • M. Gerasimova, D. Gruber, N. Monod, A. Thom, Asymptotics of Cheeger constants and unitarisability of groups, J. Funct. Anal., 2020. https://doi.org/10.1016/j.jfa.2019.108457
30 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

Motivation

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 function s(f)s(f)s(f) of a martingale into a statement about the martingale itself, and they recur in the proofs of the Burkholder–Davis–Gundy inequalities and of their conditional variants.

In his 1971 Wald Memorial Lectures, published as Distribution Function Inequalities for Martingales (Burkholder 1973), D. L. Burkholder proves two such comparisons for a function Φ\PhiΦ applied to the sums. For convex Φ\PhiΦ of moderate growth, the sum of predictable projections is controlled by the sum itself, up to a constant (Lemma 16.1, the "convexity lemma", §16). For concave Φ\PhiΦ, §20 proves the reverse comparison, with the explicit constant 222. This mission is the concave case, Theorem 20.1.

The same section derives Theorem 20.2 from it: for a martingale fff and concave Φ\PhiΦ, EΦ((f∗)2)≤5 EΦ(s2(f))E\Phi((f^*)^2) \le 5\,E\Phi(s^2(f))EΦ((f∗)2)≤5EΦ(s2(f)). For the concave powers Φ(λ)=λp\Phi(\lambda) = \lambda^pΦ(λ)=λp, 0<p≤10 < p \le 10<p≤1, that bound had been proved by another method in Burkholder, Davis and Gundy 1972. Comparisons of the same kind between an increasing process and its compensator were later systematized as the Lenglart domination principle (Lenglart 1977).

Setting

Let (Ω,A,P)(\Omega, \mathcal A, P)(Ω,A,P) be a probability space and A0⊆A1⊆⋯\mathcal A_0 \subseteq \mathcal A_1 \subseteq \cdotsA0​⊆A1​⊆⋯ a non-decreasing sequence of sub-σ\sigmaσ-fields of A\mathcal AA. In Lean this is a probability measure P together with a filtration ℱ : Filtration ℕ mΩ, ℱ k =Ak= \mathcal A_k=Ak​.

Let z1,z2,…z_1, z_2, \dotsz1​,z2​,… be nonnegative measurable functions on (Ω,A)(\Omega, \mathcal A)(Ω,A), with values in [0,∞][0, \infty][0,∞]. They need not be integrable, and they need not be adapted: zkz_kzk​ is only A\mathcal AA-measurable. For a nonnegative function the conditional expectation E(zk∣Ak−1)E(z_k \mid \mathcal A_{k-1})E(zk​∣Ak−1​) always exists as an Ak−1\mathcal A_{k-1}Ak−1​-measurable function with values in [0,∞][0, \infty][0,∞], determined up to null sets by ∫AE(zk∣Ak−1) dP=∫Azk dP\int_A E(z_k \mid \mathcal A_{k-1})\,dP = \int_A z_k\,dP∫A​E(zk​∣Ak−1​)dP=∫A​zk​dP for A∈Ak−1A \in \mathcal A_{k-1}A∈Ak−1​. Put

Z=∑k=1∞zk,W=∑k=1∞E(zk∣Ak−1),Z = \sum_{k=1}^\infty z_k, \qquad W = \sum_{k=1}^\infty E(z_k \mid \mathcal A_{k-1}),Z=k=1∑∞​zk​,W=k=1∑∞​E(zk​∣Ak−1​),

and, for 0≤n≤∞0 \le n \le \infty0≤n≤∞, the partial sums ZnZ_nZn​, WnW_nWn​ over 1≤k≤n1 \le k \le n1≤k≤n.

A function Φ:[0,∞]→[0,∞]\Phi : [0, \infty] \to [0, \infty]Φ:[0,∞]→[0,∞] is concave as above in the paper's sense if it is non-decreasing and continuous on [0,∞][0, \infty][0,∞], Φ(0)=0\Phi(0) = 0Φ(0)=0, it satisfies the growth condition Φ(2λ)≤c Φ(λ)\Phi(2\lambda) \le c\,\Phi(\lambda)Φ(2λ)≤cΦ(λ) for λ>0\lambda > 0λ>0, and it is concave on [0,∞)[0, \infty)[0,∞). Concavity alone already gives Φ(2λ)≤2Φ(λ)\Phi(2\lambda) \le 2\Phi(\lambda)Φ(2λ)≤2Φ(λ). Examples: Φ(λ)=λp\Phi(\lambda) = \lambda^pΦ(λ)=λp for 0<p≤10 < p \le 10<p≤1, Φ(λ)=λ∧a\Phi(\lambda) = \lambda \wedge aΦ(λ)=λ∧a, Φ(λ)=log⁡(1+λ)\Phi(\lambda) = \log(1 + \lambda)Φ(λ)=log(1+λ).

For a martingale f=(f1,f2,… )f = (f_1, f_2, \dots)f=(f1​,f2​,…) with differences dk=fk−fk−1d_k = f_k - f_{k-1}dk​=fk​−fk−1​ (f0=0f_0 = 0f0​=0), the maximal function is f∗=sup⁡n∣fn∣f^* = \sup_n |f_n|f∗=supn​∣fn​∣ and the conditional square function is s(f)=[∑k=1∞E(dk2∣Ak−1)]1/2s(f) = \bigl[\sum_{k=1}^\infty E(d_k^2 \mid \mathcal A_{k-1})\bigr]^{1/2}s(f)=[∑k=1∞​E(dk2​∣Ak−1​)]1/2.

Formalization targets

Goal: Theorem 20.1 (p. 38)

EΦ(∑k=1∞zk)≤2 EΦ(∑k=1∞E(zk∣Ak−1))E\Phi\Bigl(\sum_{k=1}^\infty z_k\Bigr) \le 2\,E\Phi\Bigl(\sum_{k=1}^\infty E(z_k \mid \mathcal A_{k-1})\Bigr)EΦ(k=1∑∞​zk​)≤2EΦ(k=1∑∞​E(zk​∣Ak−1​))

for every Φ\PhiΦ concave as above and all nonnegative measurable z1,z2,…z_1, z_2, \dotsz1​,z2​,…. The constant 222 is universal: it does not depend on Φ\PhiΦ, on the growth constant ccc, on the probability space or on the zkz_kzk​.

Milestones

  1. (§20, proof of Theorem 20.1.) For τ=inf⁡{n≥0:Wn+1>λ}\tau = \inf\{n \ge 0 : W_{n+1} > \lambda\}τ=inf{n≥0:Wn+1​>λ}: EZτ=EWτ≤E(W∧λ)EZ_\tau = EW_\tau \le E(W \wedge \lambda)EZτ​=EWτ​≤E(W∧λ) and E[λI(τ<∞)]=λP(W>λ)≤E(W∧λ)E[\lambda I(\tau < \infty)] = \lambda P(W > \lambda) \le E(W \wedge \lambda)E[λI(τ<∞)]=λP(W>λ)≤E(W∧λ).
  2. (20.2) The truncated inequality
E(Z∧λ)≤2 E(W∧λ),λ>0.E(Z \wedge \lambda) \le 2\,E(W \wedge \lambda), \qquad \lambda > 0.E(Z∧λ)≤2E(W∧λ),λ>0.
  1. (§20, proof of Theorem 20.1.) Inequality (20.2) implies (20.1). This is stated for arbitrary measurable [0,∞][0, \infty][0,∞]-valued ZZZ and WWW, since the paper's argument uses nothing about ZZZ and WWW beyond (20.2).

Further result: Theorem 20.2 (p. 39)

For a martingale fff and Φ\PhiΦ concave as above,

EΦ((f∗)2)≤5 EΦ(s2(f)).E\Phi\bigl((f^*)^2\bigr) \le 5\,E\Phi\bigl(s^2(f)\bigr).EΦ((f∗)2)≤5EΦ(s2(f)).

It is posed as a separate theorem and is not a milestone of the goal.

Significance

Theorem 20.1 holds without any integrability and without adaptedness, so it applies to arbitrary nonnegative sequences. With zk=dk2z_k = d_k^2zk​=dk2​ it compares the square function S2(f)=∑dk2S^2(f) = \sum d_k^2S2(f)=∑dk2​ of a martingale with s2(f)s^2(f)s2(f): for concave Φ\PhiΦ, EΦ(S2(f))≤2EΦ(s2(f))E\Phi(S^2(f)) \le 2E\Phi(s^2(f))EΦ(S2(f))≤2EΦ(s2(f)). Together with the Burkholder–Davis–Gundy comparison of S(f)S(f)S(f) and f∗f^*f∗, this is one route from the conditional square function to the maximal function in the range of exponents p≤2p \le 2p≤2, where the convex methods of the rest of the paper do not apply. Theorem 20.2 is the result of this kind that the paper states.

The paper proves Theorem 20.1 in about half a page. As far as is known, neither Theorem 20.1 nor Theorem 20.2 has been formalized in any proof assistant. Mathlib provides the [0,∞][0, \infty][0,∞]-valued conditional expectation (condLExp), filtrations, stopping times and Lebesgue integrals of extended nonnegative functions. It has no comparison theorem of this type between a sum and its predictable projections. A formal proof would therefore add a new, reusable tool to Mathlib's discrete-time martingale library, one that an eventual formal Lenglart inequality or conditional BDG inequality would need.

Difficulty

The obvious first idea is Jensen's inequality for conditional expectations. For concave Φ\PhiΦ it gives E(Φ(zk)∣Ak−1)≤Φ(E(zk∣Ak−1))E(\Phi(z_k) \mid \mathcal A_{k-1}) \le \Phi(E(z_k \mid \mathcal A_{k-1}))E(Φ(zk​)∣Ak−1​)≤Φ(E(zk​∣Ak−1​)) term by term, but Φ\PhiΦ of a sum is not the sum of the Φ\PhiΦ's, and summing the termwise bounds loses the comparison. Another first idea, comparing EZEZEZ and EWEWEW (which are equal by the tower property), handles only linear Φ\PhiΦ, and both sides may be infinite.

The content lies in two places. The first is the truncated inequality for Φ(t)=t∧λ\Phi(t) = t \wedge \lambdaΦ(t)=t∧λ, where neither ZZZ nor WWW is integrable in general and the comparison must hold level by level. The second is the passage from the truncated family to an arbitrary concave Φ\PhiΦ. It needs a representation of concave Φ\PhiΦ through the truncations t∧λt \wedge \lambdat∧λ, including the cases t=0t = 0t=0 and t=∞t = \inftyt=∞ and a possibly infinite right derivative at 000 (as for λp\lambda^pλp). Both steps must be carried out in [0,∞][0, \infty][0,∞] arithmetic.

Formalization scope

  • Values in [0,∞][0, \infty][0,∞]. zkz_kzk​, the sums ZZZ, WWW, Φ\PhiΦ and all expectations are ℝ≥0∞-valued; expectations are lower Lebesgue integrals ∫⁻. The conditional expectation is Mathlib's condLExp (notation P⁻[z | ℱ k]), never the Bochner P[z | ℱ k]. The Bochner version is 000 on non-integrable functions and would make the goal false (take W=0W = 0W=0).
  • Indexing. z (k+1) is zk+1z_{k+1}zk+1​ and is paired with ℱ k =Ak= \mathcal A_k=Ak​, so z1z_1z1​ is conditioned on A0\mathcal A_0A0​, as in the paper. z 0 is unused.
  • "Concave as above" is IsPhi Φ c for an arbitrary constant c, together with IsConcavePhi Φ: concavity of t↦Φ(t)t \mapsto \Phi(t)t↦Φ(t) on [0,∞)[0, \infty)[0,∞), read through real values. This is honest because IsPhi forces Φ\PhiΦ to be finite on finite arguments. The growth condition is required for every x∈[0,∞]x \in [0, \infty]x∈[0,∞], which is equivalent to (6.1) by continuity. The paper's exclusion of Φ≡0\Phi \equiv 0Φ≡0 is dropped, since the conclusion is trivial there.
  • Measurability. The zkz_kzk​ are A\mathcal AA-measurable and are not assumed adapted. λ\lambdaλ in (20.2) is a positive real (l : ℝ≥0).
  • Theorem 20.2 uses Mathlib's Martingale f ℱ P. It reads f n only for n≥1n \ge 1n≥1, with the paper's convention f0=0f_0 = 0f0​=0. Mathlib's extra constraint on f 0 is no restriction, since every martingale of the paper extends by f0:=E(f1∣A0)f_0 := E(f_1 \mid \mathcal A_0)f0​:=E(f1​∣A0​).
  • Ruled out. Assuming the zkz_kzk​ integrable or square integrable, using the Bochner conditional expectation, or letting the constant depend on Φ\PhiΦ would each change the theorem. None of them is used.
  • Infrastructure. A complete development needs the tower and pull-out properties of condLExp for indicators of Ak−1\mathcal A_{k-1}Ak−1​-sets, monotone convergence for condLExp, and the integral representation of a concave non-decreasing Φ\PhiΦ with Φ(0)=0\Phi(0) = 0Φ(0)=0 as a mixture of the functions t↦t∧λt \mapsto t \wedge \lambdat↦t∧λ plus a linear part. The last is reusable well beyond this mission. Contributions to any of these are welcome.

Selected references

  • D. L. Burkholder, Distribution Function Inequalities for Martingales, Annals of Probability 1(1), 19–42, 1973. https://doi.org/10.1214/aop/1176997023
  • D. L. Burkholder, B. J. Davis and R. F. Gundy, Integral inequalities for convex functions of operators on martingales, Proc. Sixth Berkeley Symp. Math. Statist. Prob. 2, 223–240, 1972. https://projecteuclid.org/proceedings/berkeley-symposium-on-mathematical-statistics-and-probability/Proceedings-of-the-Sixth-Berkeley-Symposium-on-Mathematical-Statistics-and/Chapter/Integral-inequalities-for-convex-functions-of-operators-on-martingales/bsmsp/1200514225
  • E. Lenglart, Relation de domination entre deux processus, Annales de l'Institut Henri Poincaré B 13(2), 171–179, 1977. http://www.numdam.org/item/AIHPB_1977__13_2_171_0/
  • A. Zygmund, Trigonometric Series, Vol. I, Cambridge University Press, 1959 (the concave-function representation the paper cites, p. 24). https://doi.org/10.1017/CBO9781316036587
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

Motivation

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 Function Inequalities for Martingales, D. L. Burkholder studies a conditional tail bound for squared increments and obtains an explicit exponential moment for the entire square function. The result is Theorem 19.1, with a one-parameter constant fixed exactly as (1−t)−1(1-t)^{-1}(1−t)−1 for 0<t<10<t<10<t<1 (Burkholder 1973, p. 37).

The paper calls the linear span of martingales satisfying this normalized tail condition BMO, and notes that bounded martingales belong to it after a suitable scaling. It connects this martingale notion to bounded mean oscillation of functions, introduced by John and Nirenberg, and to the surrounding work on the duality with H1H^1H1 (Burkholder 1973, p. 38). The mission isolates the article's concrete exponential estimate, which can be read and used without developing the whole later theory of BMO.

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space and let (An)n≥0(\mathcal A_n)_{n\ge0}(An​)n≥0​ be an increasing sequence of sub-sigma-fields. A real martingale is written f=(fn)n≥1f=(f_n)_{n\ge1}f=(fn​)n≥1​ relative to (An)n≥1(\mathcal A_n)_{n\ge1}(An​)n≥1​. Following the article's convention, put f0=0f_0=0f0​=0 for its difference sequence, so d1=f1d_1=f_1d1​=f1​ and dn=fn−fn−1d_n=f_n-f_{n-1}dn​=fn​−fn−1​ for n≥2n\ge2n≥2. The partial square function and the full square function are

Sn(f)=(∑k=1ndk2)1/2,S(f)=(∑k=1∞dk2)1/2=sup⁡n≥1Sn(f).S_n(f)=\left(\sum_{k=1}^{n}d_k^2\right)^{1/2},\qquad S(f)=\left(\sum_{k=1}^{\infty}d_k^2\right)^{1/2}=\sup_{n\ge1}S_n(f).Sn​(f)=(k=1∑n​dk2​)1/2,S(f)=(k=1∑∞​dk2​)1/2=n≥1sup​Sn​(f).

These are nonnegative random variables and the full one may initially take the value +∞+\infty+∞. The paper fixes this notation in Section 1 (Burkholder 1973, p. 20).

The condition used here is a bound on the expected squared-increment tail after conditioning on the information An\mathcal A_nAn​ available at time nnn:

E[∑k=n∞dk2 | An]≤1almost surely, for every n≥1.(19.1)\mathbf E\left[\sum_{k=n}^{\infty}d_k^2\,\middle|\,\mathcal A_n\right]\le1\quad\text{almost surely, for every }n\ge1.\tag{19.1}E[k=n∑∞​dk2​​An​]≤1almost surely, for every n≥1.(19.1)

The sum starts at k=nk=nk=n, including dn2d_n^2dn2​, and the conditioning sigma-field is An\mathcal A_nAn​. Both indices matter; shifting either changes the hypothesis. The value 111 is a normalization, not an unnamed bound whose choice can depend on the martingale (Burkholder 1973, p. 37).

Formalization targets

Tail integral estimate

The first milestone is the distribution estimate displayed in the proof of Theorem 19.1. For every a>0a>0a>0,

∫a∞P(S(f)2>x) dx≤P(S(f)2>a).\int_a^\infty P\big(S(f)^2>x\big)\,dx\le P\big(S(f)^2>a\big).∫a∞​P(S(f)2>x)dx≤P(S(f)2>a).

It records exactly the quantitative link between the conditional hypothesis and the distribution of the full square function (Burkholder 1973, p. 37).

Exponential-moment lemma

The second milestone is Lemma 18.1. For a nonnegative measurable ggg and a constant α>0\alpha>0α>0, suppose

∫a∞P(g>x) dx≤αP(g>a)(a>0).\int_a^\infty P(g>x)\,dx\le\alpha P(g>a)\quad(a>0).∫a∞​P(g>x)dx≤αP(g>a)(a>0).

Then ggg has an exponential moment at every 0<t<α−10<t<\alpha^{-1}0<t<α−1, bounded by (1−αt)−1(1-\alpha t)^{-1}(1−αt)−1. The lemma is stated for any probability space and any nonnegative measurable ggg, so it is reusable beyond martingale square functions (Burkholder 1973, p. 36).

Goal: Theorem 19.1

Under (19.1), the goal is the article's explicit estimate

E[exp⁡(tS(f)2)]≤(1−t)−1,0<t<1.(19.2)\mathbf E\big[\exp(tS(f)^2)\big]\le(1-t)^{-1},\qquad 0<t<1.\tag{19.2}E[exp(tS(f)2)]≤(1−t)−1,0<t<1.(19.2)

In particular, S(f)S(f)S(f) is finite almost surely. The exact coefficient and the whole open interval for ttt are part of the target (Burkholder 1973, p. 37).

Significance

The conclusion gives more than finiteness of the square function or any fixed moment: one conditional second-moment tail condition yields a family of exponential bounds for its square. The paper points out that bounded martingales meet the condition after scaling, placing a familiar class within this BMO framework (Burkholder 1973, pp. 37–38). The constant (1−t)−1(1-t)^{-1}(1−t)−1 makes the normalization of (19.1) visible and allows later users to choose a value of ttt without recovering an unspecified constant.

Formalizing this result produces a reusable interface between conditional expectations of nonnegative series, tail probabilities, and exponential moments. The exact Theorem 19.1 and Lemma 18.1 are posed as Lean statements here; their proofs are not yet machine checked in this mission. Mathlib supplies probability measures, filtrations, martingales, extended nonnegative integrals, and generalized conditional expectation. Completing the mission would establish the paper's stated quantitative bound in that setting, while the standalone exponential lemma could also be imported by developments with different stochastic objects.

Difficulty

The hypothesis bounds a conditional expectation of the entire future squared-increment tail at every time. It does not bound S(f)2S(f)^2S(f)2 pointwise: rare paths may accumulate a large sum while the conditional average remains controlled. A direct attempt to bound the exponential term by bounding each increment separately loses the dependence across times and does not yield the stated coefficient. The central mathematical gap is therefore the passage from time-indexed conditional tail information to a global distribution estimate that is strong enough for the exact exponential constant (Burkholder 1973, pp. 36–37).

Formalization scope

The Lean development represents dnd_ndn​ and Sn(f)S_n(f)Sn​(f) by explicit definitions and S(f)S(f)S(f) as the supremum of its partial square functions, valued in [0,∞][0,\infty][0,∞]. Thus a divergent square function has value +∞+\infty+∞, rather than a default real supremum. Probability tails and expectations of nonnegative functions use extended nonnegative measures and integrals. Condition (19.1) uses generalized conditional expectation of the nonnegative series; ordinary real conditional expectation could return a default zero on a non-integrable tail and make the assumption empty. The inequality holds almost everywhere, as conditional expectations are determined only up to null sets.

The article starts its martingale at index one and sets f0=0f_0=0f0​=0 for differences. Mathlib's martingale is indexed from zero. Its index-zero value can be supplied by a conditional expectation of f1f_1f1​; the shared difference-sequence definition still reads the paper's f0=0f_0=0f0​=0. The squared tail begins at n≥1n\ge1n≥1 and is conditioned on An\mathcal A_nAn​. The goal states almost-sure finiteness of S(f)S(f)S(f) as a conclusion before applying the real exponential to its finite value. This avoids treating +∞+\infty+∞ as zero through an extended-real conversion. No finiteness of S(f)S(f)S(f), integrability of its square, or exponential moment is assumed at the outset. The zero martingale on a one-point probability space satisfies the condition, so the hypotheses admit a concrete instance.

The common martingale definitions also include maximal functions, stopped values, LpL^pLp norms, a conditional square function, and the class of moderate-growth functions Φ\PhiΦ used by other missions from this article. The reusable contributions especially welcome here are the tail integral lemma for extended nonnegative functions and results connecting generalized conditional expectation with a nonnegative infinite sum. The exact source indices, constants, and boundary conventions are fixed by the source pages cited above.

Selected references

  • D. L. Burkholder, Distribution Function Inequalities for Martingales, The Annals of Probability 1(1), 19–42, 1973. DOI: 10.1214/aop/1176997023.
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

Motivation

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, which sums the realized squared increments, and the conditional square function s(f)=(∑kE(dk2∣Ak−1))1/2s(f)=(\sum_k E(d_k^2\mid\mathcal A_{k-1}))^{1/2}s(f)=(∑k​E(dk2​∣Ak−1​))1/2, which sums their predicted conditional variances. The conditional square function is the discrete analogue of the predictable quadratic variation ⟨M⟩\langle M\rangle⟨M⟩ of a continuous-time martingale, and it is the quantity that appears in martingale central limit theorems, Freedman- and Bernstein-type exponential bounds, and in the analysis of stochastic approximation algorithms, where the noise is typically described through its conditional variance.

This mission formalizes Theorem 21.1 of D. L. Burkholder's 1971 Wald Memorial Lectures, Distribution Function Inequalities for Martingales (Ann. Probability 1 (1973) 19–42). The theorem bounds EΦ(f∗)E\Phi(f^*)EΦ(f∗) by EΦ(s(f))E\Phi(s(f))EΦ(s(f)) and the size of the largest jump, for every Φ\PhiΦ of moderate growth.

Timeline. Rosenthal (1970) proved, for sums of independent mean-zero random variables and 2≤p<∞2\le p<\infty2≤p<∞, that the ppp-th moment of the sum is comparable to (∑kEdk2)p/2+∑kE∣dk∣p(\sum_k Ed_k^2)^{p/2}+\sum_k E|d_k|^p(∑k​Edk2​)p/2+∑k​E∣dk​∣p (Israel J. Math. 8 (1970)). Burkholder and Gundy (1970, [6] in the paper) developed extrapolation methods for martingale operators, including Example 8.2, which shows that EΦ(S(f))≤cEΦ(s(f))E\Phi(S(f))\le cE\Phi(s(f))EΦ(S(f))≤cEΦ(s(f)) fails for general Φ\PhiΦ (Acta Math. 124 (1970)). Theorem 21.1 follows from Theorem 3.1 of Burkholder, Davis and Gundy (1972, [5] in the paper), as remarked at the top of p. 553 of Burkholder's 1970 ICM address ([4] in the paper). In the Wald lectures Burkholder gives a direct proof by a distribution function inequality, which this mission formalizes.

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space and A0⊆A1⊆⋯\mathcal A_0\subseteq\mathcal A_1\subseteq\cdotsA0​⊆A1​⊆⋯ a nondecreasing sequence of sub-σ\sigmaσ-fields of A\mathcal AA. Let f=(f1,f2,… )f=(f_1,f_2,\dots)f=(f1​,f2​,…) be a martingale relative to A1,A2,…\mathcal A_1,\mathcal A_2,\dotsA1​,A2​,…, and set f0=0f_0=0f0​=0, so that the difference sequence is d1=f1d_1=f_1d1​=f1​ and dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​ for k≥2k\ge2k≥2. Define

f∗=sup⁡n≥1∣fn∣,d∗=sup⁡k≥1∣dk∣,s(f)=[∑k=1∞E(dk2∣Ak−1)]1/2.f^*=\sup_{n\ge1}|f_n|,\qquad d^*=\sup_{k\ge1}|d_k|,\qquad s(f)=\Big[\sum_{k=1}^\infty E\big(d_k^2\mid\mathcal A_{k-1}\big)\Big]^{1/2}.f∗=n≥1sup​∣fn​∣,d∗=k≥1sup​∣dk​∣,s(f)=[k=1∑∞​E(dk2​∣Ak−1​)]1/2.

The first conditional expectation is taken with respect to A0\mathcal A_0A0​. All three quantities may be infinite.

A function Φ:[0,∞]→[0,∞]\Phi:[0,\infty]\to[0,\infty]Φ:[0,∞]→[0,∞] satisfies the conditions of Section 7 if it is nondecreasing and continuous, Φ(0)=0\Phi(0)=0Φ(0)=0, and it has moderate growth:

Φ(2λ)≤c Φ(λ),λ>0.(6.1)\Phi(2\lambda)\le c\,\Phi(\lambda),\qquad\lambda>0. \tag{6.1}Φ(2λ)≤cΦ(λ),λ>0.(6.1)

The constant c=c(6.1)c=c_{(6.1)}c=c(6.1)​ is the growth constant. The powers Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp, 0<p<∞0<p<\infty0<p<∞, are the basic examples; Φ\PhiΦ need not be convex.

In Lean the shared layer is BurkholderDFI.CondSquare.Martingale: dseq f is ddd, maxFn f is f∗f^*f∗, maxFn (dseq f) is d∗d^*d∗, condSqFn ℱ P f is s(f)s(f)s(f) and IsPhi Φ c is the class above.

Formalization targets

Goal: Theorem 21.1

For every growth constant c(6.1)c_{(6.1)}c(6.1)​ there is a constant ccc such that for every martingale fff and every Φ\PhiΦ satisfying the conditions of Section 7,

EΦ(f∗)≤c EΦ(s(f))+c EΦ(d∗).(21.1)E\Phi(f^*)\le c\,E\Phi(s(f))+c\,E\Phi(d^*). \tag{21.1}EΦ(f∗)≤cEΦ(s(f))+cEΦ(d∗).(21.1)

The constant depends only on c(6.1)c_{(6.1)}c(6.1)​, and no value for it is fixed, so the goal remains valid under any improvement of the constant.

Milestones

  1. Doob's weak-type inequality (1.5): λpP(f∗>λ)≤∥f∥pp\lambda^pP(f^*>\lambda)\le\|f\|_p^pλpP(f∗>λ)≤∥f∥pp​ for 1≤p<∞1\le p<\infty1≤p<∞.
  2. The distribution function inequality (21.2): for β>1\beta>1β>1, 0<δ<β−10<\delta<\beta-10<δ<β−1 and λ>0\lambda>0λ>0,
P(f∗>βλ, s(f)∨d∗≤δλ)≤δ2(β−δ−1)2P(f∗>λ).P\big(f^*>\beta\lambda,\ s(f)\vee d^*\le\delta\lambda\big)\le\frac{\delta^2}{(\beta-\delta-1)^2}P(f^*>\lambda).P(f∗>βλ, s(f)∨d∗≤δλ)≤(β−δ−1)2δ2​P(f∗>λ).
  1. Lemma 7.1, which turns an inequality of the form P(g>βλ, f≤δλ)≤εP(g>λ)P(g>\beta\lambda,\ f\le\delta\lambda)\le\varepsilon P(g>\lambda)P(g>βλ, f≤δλ)≤εP(g>λ) into EΦ(g)≤γη1−γεEΦ(f)E\Phi(g)\le\frac{\gamma\eta}{1-\gamma\varepsilon}E\Phi(f)EΦ(g)≤1−γεγη​EΦ(f).

Further statements

Two consequences recorded in §21 are included as draft theorems: (21.5), EΦ(f∗)≤cEΦ(s(f))+c∑kEΦ(∣dk∣)E\Phi(f^*)\le cE\Phi(s(f))+c\sum_kE\Phi(|d_k|)EΦ(f∗)≤cEΦ(s(f))+c∑k​EΦ(∣dk​∣), and the upper half (21.4) of Rosenthal's inequality for independent mean-zero sums.

Significance

The result. Theorem 21.1 controls the maximal function by predictable information (the conditional variances) plus the single largest jump, for every Φ\PhiΦ of moderate growth, convex or not. The jump term cannot be dropped: the paper notes that an inequality of the form EΦ(S(f))≤cEΦ(s(f))E\Phi(S(f))\le cE\Phi(s(f))EΦ(S(f))≤cEΦ(s(f)) fails for general Φ\PhiΦ (Example 8.2 of Burkholder–Gundy 1970), so some account of large individual increments is necessary. Specialized to independent increments, s(f)s(f)s(f) becomes the deterministic (∑kEdk2)1/2(\sum_kEd_k^2)^{1/2}(∑k​Edk2​)1/2 and the theorem yields the upper half of Rosenthal's inequality. The martingale version applies wherever increments are dependent but their conditional variances are controlled, as in stochastic approximation.

Formalizing it. The result is proved in the paper; to our knowledge neither Theorem 21.1 nor Rosenthal's inequality has a machine-checked proof. Mathlib has Doob's maximal inequality and martingale convergence, but not the conditional square function, good-λ\lambdaλ inequalities, or Φ\PhiΦ-moment inequalities with moderate growth. A complete development produces all three, together with the stopping-time manipulations (a martingale started at one stopping time and stopped at another) that most of the paper's arguments reuse.

Difficulty

The obvious approach is to use L2L^2L2 theory: Efn2=Esn2(f)E f_n^2=E s_n^2(f)Efn2​=Esn2​(f) for a square-integrable martingale, so f∗f^*f∗ and s(f)s(f)s(f) are comparable in L2L^2L2. This identity gives nothing for other Φ\PhiΦ, and in particular for Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp with p<2p<2p<2 or p>2p>2p>2 there is no direct comparison of f∗f^*f∗ and s(f)s(f)s(f): s(f)s(f)s(f) can be small while one increment is huge. A bound for general Φ\PhiΦ must therefore handle the event where a single increment dominates, and it must work for every level λ\lambdaλ simultaneously, using nothing about Φ\PhiΦ beyond monotonicity and the growth condition (6.1). Without convexity of Φ\PhiΦ, no Jensen- or duality-type argument applies.

Formalization scope

The Lean conventions committed to are:

  • f∗f^*f∗, d∗d^*d∗, s(f)s(f)s(f), ∥f∥p\|f\|_p∥f∥p​ and every expectation EΦ(⋅)E\Phi(\cdot)EΦ(⋅) take values in [0,∞][0,\infty][0,∞] (ℝ≥0∞, lower Lebesgue integrals), so infinite values are meaningful and no junk value 000 arises.
  • The conditional expectations E(dk2∣Ak−1)E(d_k^2\mid\mathcal A_{k-1})E(dk2​∣Ak−1​) are Mathlib's extended conditional expectations condLExp, which need no integrability of dk2d_k^2dk2​. The Bochner conditional expectation or condVar would return 000 on non-integrable dk2d_k^2dk2​ and must not be substituted.
  • The filtration ℱ : Filtration ℕ _ is indexed from 000, with ℱ k =Ak=\mathcal A_k=Ak​; the kkk-th summand of s(f)s(f)s(f) pairs dk+1d_{k+1}dk+1​ with ℱ k. The paper states that fff is a martingale relative to A1,A2,…\mathcal A_1,\mathcal A_2,\dotsA1​,A2​,…; the formalization states that fff is a Mathlib martingale, which also constrains the index-000 term. This is no restriction, since the extension f0:=E(f1∣A0)f_0:=E(f_1\mid\mathcal A_0)f0​:=E(f1​∣A0​) is always possible, and all definitions use the paper's f0=0f_0=0f0​=0, never Lean's f 0.
  • IsPhi Φ c imposes (6.1) for every x∈[0,∞]x\in[0,\infty]x∈[0,∞], which is equivalent to the paper's condition by continuity. The paper's hypothesis that Φ\PhiΦ is not identically zero is dropped, since every inequality is trivial for Φ≡0\Phi\equiv0Φ≡0.
  • "The choice of ccc depends only on c(6.1)c_{(6.1)}c(6.1)​" is the quantifier order ∀c ∃C>0 ∀(Ω,P,A,f,Φ)\forall c\ \exists C>0\ \forall(\Omega,P,\mathcal A,f,\Phi)∀c ∃C>0 ∀(Ω,P,A,f,Φ), with Ω\OmegaΩ in Type. A constant chosen after fff or Φ\PhiΦ would trivialize the goal whenever the right-hand side is positive, and that formalization is ruled out.
  • Lemma 7.1 takes [0,∞][0,\infty][0,∞]-valued f,gf,gf,g and nonnegative γ,η\gamma,\etaγ,η. Rosenthal's inequality assumes integrable, mutually independent dkd_kdk​ with mean zero.

Needed infrastructure, reusable beyond this mission: the conditional square function and its basic properties for stopped martingales; a good-λ\lambdaλ lemma for moderate-growth Φ\PhiΦ (Lemma 7.1, shared with the other missions of this series); and the layer-cake formula EΦ(h)=∫0∞P(h>λ) dΦ(λ)E\Phi(h)=\int_0^\infty P(h>\lambda)\,d\Phi(\lambda)EΦ(h)=∫0∞​P(h>λ)dΦ(λ) for a Lebesgue–Stieltjes Φ\PhiΦ. Proofs of the milestones, proofs of (21.5) and Rosenthal's inequality from the goal, and independent proofs of any of them are all welcome.

Selected references

  • D. L. Burkholder, Distribution Function Inequalities for Martingales, The Annals of Probability 1(1), 1973, 19–42. https://doi.org/10.1214/aop/1176997023
  • D. L. Burkholder, R. F. Gundy, Extrapolation and interpolation of quasi-linear operators on martingales, Acta Mathematica 124, 1970, 249–304. https://doi.org/10.1007/BF02394573
  • D. L. Burkholder, Inequalities for operators on martingales, Proc. International Congress of Mathematicians (Nice, 1970), vol. 2, Gauthier-Villars, 1971, 551–557.
  • D. L. Burkholder, B. J. Davis, R. F. Gundy, Integral inequalities for convex functions of operators on martingales, Proc. Sixth Berkeley Symp. Math. Statist. Probab. 2, 1972, 223–240.
  • H. P. Rosenthal, On the subspaces of LpL^pLp (p>2p>2p>2) spanned by sequences of independent random variables, Israel Journal of Mathematics 8, 1970, 273–303. https://doi.org/10.1007/BF02771562
  • J. L. Doob, Stochastic Processes, Wiley, New York, 1953.
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

Motivation

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 quadratic variation, give LpL^pLp bounds for martingale transforms, and transfer to singular integrals and area integrals in classical analysis.

D. L. Burkholder's 1971 Wald Memorial Lectures, published as Distribution Function Inequalities for Martingales (Ann. Probability 1 (1973) 19–42), organise these comparisons around distribution function (good-λ\lambdaλ) inequalities. Chapter IV of the paper begins with "some of the consequences of nonnegativity". This mission formalizes one of them: for a nonnegative martingale, the square function is controlled by the maximal function in every moment of moderate growth, convex or not.

A short history of the comparison:

  • 1966: Burkholder proves cp∥S(f)∥p≤∥f∥p≤Cp∥S(f)∥pc_p\|S(f)\|_p\le\|f\|_p\le C_p\|S(f)\|_pcp​∥S(f)∥p​≤∥f∥p​≤Cp​∥S(f)∥p​ for 1<p<∞1<p<\infty1<p<∞ (Martingale transforms, Ann. Math. Statist. 37).
  • 1970: Burkholder and Gundy introduce good-λ\lambdaλ inequalities and extend the comparison of S(f)S(f)S(f) and f∗f^*f∗ to 0<p<∞0<p<\infty0<p<∞ under regularity conditions (Acta Math. 124); Davis proves the case p=1p=1p=1 for all martingales (Israel J. Math. 8).
  • 1972: Burkholder, Davis and Gundy prove EΦ(S(f))≍EΦ(f∗)E\Phi(S(f))\asymp E\Phi(f^*)EΦ(S(f))≍EΦ(f∗) for every convex Φ\PhiΦ of moderate growth and every martingale (Proc. Sixth Berkeley Symp. 2, 223–240). The comparison fails for general martingales when Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp with 0<p<10<p<10<p<1, because of large jumps (Example 8.1 of that paper; recalled in §10 of the 1973 paper, p. 29).
  • 1973: Theorem 18.3 of the present paper shows that for nonnegative martingales one direction, EΦ(S(f))≤c EΦ(f∗)E\Phi(S(f))\le c\,E\Phi(f^*)EΦ(S(f))≤cEΦ(f∗), holds for every Φ\PhiΦ of moderate growth.

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space and A0⊆A1⊆⋯\mathcal A_0\subseteq\mathcal A_1\subseteq\cdotsA0​⊆A1​⊆⋯ a filtration. A nonnegative martingale is a sequence f=(f1,f2,… )f=(f_1,f_2,\dots)f=(f1​,f2​,…) of integrable random variables with fn≥0f_n\ge0fn​≥0, fnf_nfn​ measurable with respect to An\mathcal A_nAn​, and E(fn+1∣An)=fnE(f_{n+1}\mid\mathcal A_n)=f_nE(fn+1​∣An​)=fn​. With f0=0f_0=0f0​=0, its difference sequence is dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​, k≥1k\ge1k≥1. The objects compared are

S(f)=(∑k=1∞dk2)1/2∈[0,∞],f∗=sup⁡n≥1∣fn∣∈[0,∞].S(f)=\Big(\sum_{k=1}^\infty d_k^2\Big)^{1/2}\in[0,\infty],\qquad f^*=\sup_{n\ge1}|f_n|\in[0,\infty].S(f)=(k=1∑∞​dk2​)1/2∈[0,∞],f∗=n≥1sup​∣fn​∣∈[0,∞].

In Lean these are sqFn f and maxFn f; the finite versions Sn(f)S_n(f)Sn​(f) and fn∗f_n^*fn∗​ are sqFnN f n and maxFnN f n.

For λ>0\lambda>0λ>0, the exit time μ=inf⁡{n≥1:∣fn∣>λ}\mu=\inf\{n\ge1:|f_n|>\lambda\}μ=inf{n≥1:∣fn​∣>λ} (with inf⁡∅=∞\inf\emptyset=\inftyinf∅=∞) is exitTime f λ, and Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f), the square function of fff stopped just before it first exceeds λ\lambdaλ, is sqFnAt f (exitTime f λ - 1), with S0(f)=0S_0(f)=0S0​(f)=0 and S∞(f)=S(f)S_\infty(f)=S(f)S∞​(f)=S(f).

A function Φ:[0,∞]→[0,∞]\Phi:[0,\infty]\to[0,\infty]Φ:[0,∞]→[0,∞] satisfies the conditions of Section 7 (IsPhi Φ c) if it is non-decreasing and continuous, Φ(0)=0\Phi(0)=0Φ(0)=0, and it has moderate growth:

Φ(2λ)≤c Φ(λ),λ>0.(6.1)\Phi(2\lambda)\le c\,\Phi(\lambda),\qquad\lambda>0.\tag{6.1}Φ(2λ)≤cΦ(λ),λ>0.(6.1)

The powers Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp, 0<p<∞0<p<\infty0<p<∞, are the model examples.

Formalization targets

Goal: Theorem 18.3 (p. 36)

For every growth constant c(6.1)c_{(6.1)}c(6.1)​ there is ccc, depending only on c(6.1)c_{(6.1)}c(6.1)​, such that for every nonnegative martingale fff and every Φ\PhiΦ satisfying the conditions of Section 7,

EΦ(S(f))≤c EΦ(f∗).E\Phi(S(f))\le c\,E\Phi(f^*).EΦ(S(f))≤cEΦ(f∗).

The goal fixes no value of the constant, so it is the statement that survives any later improvement of ccc.

Milestones

  1. Lemma 2.1 (p. 21): for fff a martingale or nonnegative submartingale with ∥f∥1<∞\|f\|_1<\infty∥f∥1​<∞,
∥Sμ−1(f)∥22+∥fμ−1∥22≤2Efμfμ−1≤2λ∥f∥1,\|S_{\mu-1}(f)\|_2^2+\|f_{\mu-1}\|_2^2\le2Ef_\mu f_{\mu-1}\le2\lambda\|f\|_1,∥Sμ−1​(f)∥22​+∥fμ−1​∥22​≤2Efμ​fμ−1​≤2λ∥f∥1​,

with equality on the left for martingales. 2. (18.5) (p. 37): for a nonnegative martingale and a>0a>0a>0,

∫a+λ2∞P(Sμ−12(f)>s) ds≤2λ2P(Sμ−12(f)>a).\int_{a+\lambda^2}^\infty P\big(S^2_{\mu-1}(f)>s\big)\,ds\le2\lambda^2P\big(S^2_{\mu-1}(f)>a\big).∫a+λ2∞​P(Sμ−12​(f)>s)ds≤2λ2P(Sμ−12​(f)>a).
  1. The stopped inclusion (proof of Theorem 18.2, p. 37): with μ\muμ the exit time above δλ\delta\lambdaδλ,
P(S(f)>βλ, f∗≤δλ)≤P(Sμ−1(f)>βλ).P\big(S(f)>\beta\lambda,\ f^*\le\delta\lambda\big)\le P\big(S_{\mu-1}(f)>\beta\lambda\big).P(S(f)>βλ, f∗≤δλ)≤P(Sμ−1​(f)>βλ).
  1. Theorem 18.2 (p. 35): for β>1\beta>1β>1, 0<δ<(β2−1)1/20<\delta<(\beta^2-1)^{1/2}0<δ<(β2−1)1/2 and a nonnegative martingale,
P(S(f)>βλ, f∗≤δλ)≤2δ2β2−δ2−1 P(S(f)>λ),λ>0.P\big(S(f)>\beta\lambda,\ f^*\le\delta\lambda\big)\le\frac{2\delta^2}{\beta^2-\delta^2-1}\,P\big(S(f)>\lambda\big),\qquad\lambda>0.P(S(f)>βλ, f∗≤δλ)≤β2−δ2−12δ2​P(S(f)>λ),λ>0.
  1. Lemma 7.1 (p. 26): a good-λ\lambdaλ inequality P(g>βλ,f≤δλ)≤εP(g>λ)P(g>\beta\lambda,f\le\delta\lambda)\le\varepsilon P(g>\lambda)P(g>βλ,f≤δλ)≤εP(g>λ), with Φ(βλ)≤γΦ(λ)\Phi(\beta\lambda)\le\gamma\Phi(\lambda)Φ(βλ)≤γΦ(λ), Φ(δ−1λ)≤ηΦ(λ)\Phi(\delta^{-1}\lambda)\le\eta\Phi(\lambda)Φ(δ−1λ)≤ηΦ(λ) and γε<1\gamma\varepsilon<1γε<1, gives EΦ(g)≤γη1−γεEΦ(f)E\Phi(g)\le\frac{\gamma\eta}{1-\gamma\varepsilon}E\Phi(f)EΦ(g)≤1−γεγη​EΦ(f).

Significance

The result. Theorem 18.3 removes the convexity hypothesis from one half of the Burkholder–Davis–Gundy comparison, at the price of nonnegativity. It covers the concave powers λp\lambda^pλp, 0<p<10<p<10<p<1, and every other Φ\PhiΦ of moderate growth, including those that are neither convex nor concave. Nonnegative martingales are the natural objects in likelihood ratios, branching processes and Radon–Nikodym densities. For Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp, 1<p<∞1<p<\infty1<p<∞, the paper derives from Theorem 18.2 and Lemma 7.1 the bound ∥S(f)∥p≤cp1/2∥f∗∥p\|S(f)\|_p\le cp^{1/2}\|f^*\|_p∥S(f)∥p​≤cp1/2∥f∗∥p​ with the order p1/2p^{1/2}p1/2 in the constant (p. 37). Theorem 18.2 is the distribution function inequality behind the theorem and is itself a sharper statement than any moment inequality it yields.

Formalizing it. The result is proved in the paper. As far as is known it has no machine-checked proof, and Mathlib has neither the martingale square function nor any good-λ\lambdaλ machinery. A formalization produces reusable components: the square function and stopped square function of a discrete martingale, Lemma 2.1, and Lemma 7.1, which is shared by every Φ\PhiΦ inequality in the paper and many outside it.

Difficulty

For general martingales, a good-λ\lambdaλ inequality bounding P(S(f)>βλ, f∗≤δλ)P(S(f)>\beta\lambda,\ f^*\le\delta\lambda)P(S(f)>βλ, f∗≤δλ) by a small multiple of P(S(f)>λ)P(S(f)>\lambda)P(S(f)>λ) is false: a single large jump dkd_kdk​ can make S(f)S(f)S(f) large while the martingale is stopped before f∗f^*f∗ grows, which is why the general results need convexity or a jump bound. The first idea, transferring the convex case of Burkholder–Davis–Gundy, does not work for concave Φ\PhiΦ: the convex proof uses convexity of Φ\PhiΦ in an essential way (Lemma 16.1 of the paper), and for general martingales the conclusion itself is false for λp\lambda^pλp, p<1p<1p<1. A bound on ESμ−12(f)E S^2_{\mu-1}(f)ESμ−12​(f) alone, as in Lemma 2.1, is also not enough; the good-λ\lambdaλ inequality needs control of the tail of Sμ−12(f)S^2_{\mu-1}(f)Sμ−12​(f) above every level aaa, which is where nonnegativity enters. Passing from the distribution inequality to all Φ\PhiΦ at once also requires care with infinite values of S(f)S(f)S(f) and f∗f^*f∗.

Formalization scope

  • Martingales. Mathlib's Martingale f ℱ P with f : ℕ → Ω → ℝ and ℱ : Filtration ℕ mΩ, ℱ k = 𝒜_k. Statements read f n only for n≥1n\ge1n≥1, with the paper's f0=0f_0=0f0​=0; Mathlib's additional constraint at index 000 is no restriction, since any martingale relative to A1,A2,…\mathcal A_1,\mathcal A_2,\dotsA1​,A2​,… extends to one by f0:=E(f1∣A0)f_0:=E(f_1\mid\mathcal A_0)f0​:=E(f1​∣A0​). Nonnegativity is "almost surely, for n≥1n\ge1n≥1".
  • Values in [0,∞][0,\infty][0,∞]. S(f)S(f)S(f), f∗f^*f∗, Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f), Φ\PhiΦ and all expectations EΦ(⋅)E\Phi(\cdot)EΦ(⋅) are ℝ≥0∞-valued (∫⁻), so both sides of the goal may be infinite and no junk value 000 arises from a non-integrable function.
  • Φ\PhiΦ. IsPhi Φ c imposes the growth condition at every x∈[0,∞]x\in[0,\infty]x∈[0,∞], which is equivalent to (6.1) for λ>0\lambda>0λ>0. The paper's exclusion of Φ≡0\Phi\equiv0Φ≡0 is dropped (the inequalities are trivial then). No convexity is assumed anywhere in this mission.
  • Constants. The goal quantifies ∀ c, ∃ C > 0, ∀ Ω P ℱ f Φ, with Ω\OmegaΩ in Type: the constant may depend on c(6.1)c_{(6.1)}c(6.1)​ only, never on Φ\PhiΦ, fff or PPP. A constant chosen after the data would make the goal trivial whenever its right-hand side is positive; that reading is ruled out by the quantifier order.
  • Theorem 18.2 states δ<(β2−1)1/2\delta<(\beta^2-1)^{1/2}δ<(β2−1)1/2 with Real.sqrt; with δ>0\delta>0δ>0 this is β2−δ2−1>0\beta^2-\delta^2-1>0β2−δ2−1>0.
  • Lemma 2.1 takes the almost-everywhere limit f∞f_\inftyf∞​ as a supplied function with a convergence hypothesis; μ−1\mu-1μ−1 is truncated subtraction on {1,…,∞}\{1,\dots,\infty\}{1,…,∞} with ∞−1=∞\infty-1=\infty∞−1=∞.
  • Lemma 7.1 allows f,gf,gf,g to take the value ∞\infty∞ (needed for g=S(f)g=S(f)g=S(f), f=f∗f=f^*f=f∗) and takes γ,η≥0\gamma,\eta\ge0γ,η≥0, which loses nothing since (7.2) forces γ,η≥1\gamma,\eta\ge1γ,η≥1 unless Φ≡0\Phi\equiv0Φ≡0.

The shared definitions file declares the series-wide layer (including s(f)s(f)s(f), convexity and concavity predicates used by other missions of the series). Proofs of any milestone are welcome, as are auxiliary lemmas on the stopped square function, on the Stieltjes representation EΦ(h)=∫0∞P(h>λ) dΦ(λ)E\Phi(h)=\int_0^\infty P(h>\lambda)\,d\Phi(\lambda)EΦ(h)=∫0∞​P(h>λ)dΦ(λ), and on the layer-cake formula in ℝ≥0∞.

Selected references

  • D. L. Burkholder, Distribution function inequalities for martingales, Ann. Probability 1 (1973), 19–42. https://doi.org/10.1214/aop/1176997023
  • D. L. Burkholder, Martingale transforms, Ann. Math. Statist. 37 (1966), 1494–1504. https://doi.org/10.1214/aoms/1177699141
  • D. L. Burkholder and R. F. Gundy, Extrapolation and interpolation of quasi-linear operators on martingales, Acta Math. 124 (1970), 249–304. https://doi.org/10.1007/BF02394573
  • B. Davis, On the integrability of the martingale square function, Israel J. Math. 8 (1970), 187–190. https://doi.org/10.1007/BF02771313
  • D. L. Burkholder, B. J. Davis and R. F. Gundy, Integral inequalities for convex functions of operators on martingales, Proc. Sixth Berkeley Symp. Math. Statist. Prob. 2 (1972), 223–240. https://doi.org/10.1525/9780520423671-018
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

Motivation

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 martingale itself. Burkholder's 1973 lectures study the distributions of square functions and maximal functions and compare their moments under several kinds of hypotheses (Burkholder 1973, §1).

The present mission concerns a sharper phenomenon for a nonnegative martingale. If the process is stopped just before its absolute value first exceeds a fixed threshold, the resulting square function has an exponential moment of its square. The distinction matters: a second moment controls one scale of variation, while an exponential square moment controls a range of larger deviations. Burkholder states the second-moment stopped estimate in Lemma 2.1 and the exponential estimate in Theorem 18.1 (Burkholder 1973, pp. 21, 35).

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space with an increasing sequence of sub-σ\sigmaσ-fields A0,A1,…\mathcal A_0,\mathcal A_1,\ldotsA0​,A1​,…. A martingale f=(fn)n≥1f=(f_n)_{n\ge1}f=(fn​)n≥1​ is observed relative to A1,A2,…\mathcal A_1,\mathcal A_2,\ldotsA1​,A2​,…. Burkholder sets f0=0f_0=0f0​=0 for the purpose of defining its difference sequence: d1=f1d_1=f_1d1​=f1​ and dk=fk−fk−1d_k=f_k-f_{k-1}dk​=fk​−fk−1​ for k≥2k\ge2k≥2. For each n≥0n\ge0n≥0 let

Sn(f)=(∑k=1ndk2)1/2,S(f)=sup⁡n≥0Sn(f),S0(f)=0.S_n(f)=\left(\sum_{k=1}^{n}d_k^2\right)^{1/2}, \qquad S(f)=\sup_{n\ge0}S_n(f), \qquad S_0(f)=0.Sn​(f)=(k=1∑n​dk2​)1/2,S(f)=n≥0sup​Sn​(f),S0​(f)=0.

Fix λ>0\lambda>0λ>0. The exit time is μ=inf⁡{n≥1:∣fn∣>λ}\mu=\inf\{n\ge1:|f_n|>\lambda\}μ=inf{n≥1:∣fn​∣>λ}, with μ=∞\mu=\inftyμ=∞ if the set is empty. The quantity in this mission is Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f). On a path with μ=n<∞\mu=n<\inftyμ=n<∞ it includes differences only through n−1n-1n−1; on a path with μ=∞\mu=\inftyμ=∞ it is S(f)S(f)S(f). Nonnegative means fn≥0f_n\ge0fn​≥0 almost surely for every n≥1n\ge1n≥1. These conventions are those of §§1, 2 and 18 of the paper (Burkholder 1973, pp. 20–21, 35).

Formalization targets

The goal is Theorem 18.1. For every nonnegative martingale and every λ>0\lambda>0λ>0, Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f) is finite almost everywhere and

Eexp⁡(tSμ−1(f)2)≤11−3tλ2,0<t<13λ2.E\exp\left(tS_{\mu-1}(f)^2\right) \le \frac{1}{1-3t\lambda^2}, \qquad 0<t<\frac{1}{3\lambda^2}.Eexp(tSμ−1​(f)2)≤1−3tλ21​,0<t<3λ21​.

The constant 333 and the full range of ttt are part of the target; replacing the claim by the existence of one positive exponential parameter would lose the paper's quantitative conclusion (Burkholder 1973, Theorem 18.1, p. 35).

The milestone path contains four statements from the paper. Lemma 2.1 bounds the second moment of the stopped square function and stopped value. Display (18.5) bounds an integrated tail past a+λ2a+\lambda^2a+λ2 by 2λ22\lambda^22λ2 times the tail at aaa. The paragraph following it gives the full integrated-tail bound with 3λ23\lambda^23λ2. Lemma 18.1 converts an integrated-tail condition for a nonnegative measurable function into an exponential moment estimate. The milestone order follows their role in Theorem 18.1, while the tail-to-moment lemma also stands independently of martingales (Burkholder 1973, pp. 21, 36–37).

Significance

The theorem gives a uniform quantitative bound for the square function accumulated before a nonnegative martingale crosses λ\lambdaλ. It strengthens the L2L^2L2 conclusion available from Lemma 2.1 under L1L^1L1 boundedness. The tail-to-moment lemma has a second use later in the paper: Burkholder invokes it for the square function of a martingale satisfying a bounded conditional-tail condition in Theorem 19.1 (Burkholder 1973, §§18–19).

The mathematical result is proved in the paper. This mission asks for a machine-checked development of its precise statements. That development would make the stopped square function, its exit-time convention, the integrated-tail estimates and the exponential-moment implication available as individually reusable objects. No machine-checked proof of these statements is known on Prove2Me; the related martingale inequalities already there (Doob's LpL^pLp maximal inequality, an LpL^pLp bound for Robbins–Monro noise sums) have different data and conclusions.

Difficulty

The first obvious estimate, Lemma 2.1, gives a second moment but does not by itself give an exponential moment. The exit time also depends on the same martingale path whose variation is being measured, so a fixed-time estimate does not immediately describe Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f). Nonnegativity is essential to the stronger statement: the paper contrasts the general L1L^1L1-bounded case, where it states only L2L^2L2 control, with the nonnegative case, where it asserts exponential square integrability (Burkholder 1973, pp. 21, 35).

Formalization scope

Lean uses Mathlib's filtration and martingale predicates for a real-valued process indexed by natural numbers. The paper starts at index 111 and fixes f0=0f_0=0f0​=0 only in its difference sequence. Mathlib's martingale predicate also constrains an auxiliary value at index 000; any paper martingale can be extended there by a conditional expectation. Every square function and exit time in this mission ignores that auxiliary value. Nonnegativity is almost everywhere at each positive index. The convergence value f∞f_\inftyf∞​ in Lemma 2.1 is supplied with an almost-everywhere convergence hypothesis, recording explicitly the convergence that follows from the paper's L1L^1L1 boundedness assumption.

Square functions, norms, tail probabilities and their nonnegative integrals take values in [0,∞][0,\infty][0,∞]. This represents a genuinely infinite square function without a default real-valued supremum. At μ=∞\mu=\inftyμ=∞, subtraction of one in N∞\mathbb N_\inftyN∞​ leaves ∞\infty∞, as the paper intends. The exponential-moment statements assert almost-everywhere finiteness before converting an extended value to a real exponent; otherwise the conversion of ∞\infty∞ to zero could make a false bound look true. The threshold λ\lambdaλ is positive, and the same λ\lambdaλ appears in the stopping time and in every bound.

The shared definition layer also records the paper's maximal function, LpL^pLp norm, conditional square function and class of functions Φ\PhiΦ of moderate growth for reuse across this nine-mission series. The conditional square function uses generalized nonnegative conditional expectation. Its Φ\PhiΦ condition includes the endpoints 000 and ∞\infty∞; these add no restriction under the paper's continuity and zero-at-zero conventions. The zero function Φ\PhiΦ is allowed, since the inequalities in which it appears then hold trivially. Contributions establishing the four milestones, the needed stopping-time measurability facts, or the goal theorem are within scope. A version that assumes the desired exponential moment, or replaces Sμ−1(f)S_{\mu-1}(f)Sμ−1​(f) by a fixed-time square function, would miss the target.

Selected references

  • D. L. Burkholder, Distribution Function Inequalities for Martingales, The Annals of Probability 1(1), 1973, pp. 19–42. DOI: 10.1214/aop/1176997023.
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

Motivation

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 q×qq \times qq×q Fourier matrix, which has q2=4lq^2 = 4^lq2=4l entries, can be applied by a quantum circuit of only O(l2)O(l^2)O(l2) elementary gates, each acting on one or two bits.

That circuit was found independently by Coppersmith (IBM RC 19642, 1994) and Deutsch, and Shor's §4 presents it following Ekert and Jozsa (Rev. Mod. Phys. 68, 1996). It is the quantum analogue of the radix-2 fast Fourier transform, and it reappears in phase estimation, in the hidden subgroup algorithms for abelian groups, and in every textbook account of quantum computation. This mission formalizes Shor's statement that the circuit computes the Fourier matrix, up to a reversal of the output bits, together with the two displayed steps of its verification.

Setting

A register of lll bits has one basis state ∣a⟩=∣al−1al−2…a0⟩|a\rangle = |a_{l-1} a_{l-2} \dots a_0\rangle∣a⟩=∣al−1​al−2​…a0​⟩ for every bit string, with a0a_0a0​ the least significant bit; the string encodes the integer

a=∑j=0l−12jaj,0≤a<q=2l.a = \sum_{j=0}^{l-1} 2^j a_j, \qquad 0 \le a < q = 2^l .a=j=0∑l−1​2jaj​,0≤a<q=2l.

A state is a vector of complex amplitudes, one per basis state. A gate is a matrix whose rows are indexed by input basis vectors and whose columns are indexed by output basis vectors (§2, p. 1489). A gate on some of the bits acts on those bits through its matrix and leaves the others alone (§2, p. 1490): the output amplitude at a string bbb is the sum, over the possible input values uuu of the acted-on bits, of the input amplitude at bbb with those bits replaced by uuu, times the matrix entry from uuu to the corresponding bits of bbb.

The Fourier matrix AqA_qAq​ (eq. (4.1)) is the q×qq \times qq×q matrix with (a,c)(a, c)(a,c) entry q−1/2exp⁡(2πi ac/q)q^{-1/2}\exp(2\pi i\,ac/q)q−1/2exp(2πiac/q); it takes ∣a⟩|a\rangle∣a⟩ to q−1/2∑c=0q−1exp⁡(2πi ac/q) ∣c⟩q^{-1/2}\sum_{c=0}^{q-1}\exp(2\pi i\,ac/q)\,|c\rangleq−1/2∑c=0q−1​exp(2πiac/q)∣c⟩.

The circuit uses two gates (eqs. (4.2), (4.3)):

  • RjR_jRj​ acts on bit jjj with matrix 12(111−1)\frac{1}{\sqrt 2}\begin{pmatrix} 1 & 1 \\ 1 & -1\end{pmatrix}2​1​(11​1−1​);
  • Sj,kS_{j,k}Sj,k​, for j<kj < kj<k, acts on bits jjj and kkk with matrix diag(1,1,1,eiθk−j)\mathrm{diag}(1, 1, 1, e^{i\theta_{k-j}})diag(1,1,1,eiθk−j​), where θk−j=π/2k−j\theta_{k-j} = \pi / 2^{k-j}θk−j​=π/2k−j; it multiplies the amplitude of a basis state by eiθk−je^{i\theta_{k-j}}eiθk−j​ when bits jjj and kkk are both 111.

The circuit is the gate sequence (4.4), applied from left to right:

Rl−1 Sl−2,l−1 Rl−2 Sl−3,l−1 Sl−3,l−2 Rl−3⋯R1 S0,l−1 S0,l−2⋯S0,2 S0,1 R0,R_{l-1}\, S_{l-2,l-1}\, R_{l-2}\, S_{l-3,l-1}\, S_{l-3,l-2}\, R_{l-3} \cdots R_1\, S_{0,l-1}\, S_{0,l-2} \cdots S_{0,2}\, S_{0,1}\, R_0 ,Rl−1​Sl−2,l−1​Rl−2​Sl−3,l−1​Sl−3,l−2​Rl−3​⋯R1​S0,l−1​S0,l−2​⋯S0,2​S0,1​R0​,

that is, for j=l−1,…,0j = l-1, \dots, 0j=l−1,…,0 it applies Sj,l−1,…,Sj,j+1S_{j,l-1}, \dots, S_{j,j+1}Sj,l−1​,…,Sj,j+1​ and then RjR_jRj​. On three bits it is R2S1,2R1S0,2S0,1R0R_2 S_{1,2} R_1 S_{0,2} S_{0,1} R_0R2​S1,2​R1​S0,2​S0,1​R0​.

The bit reversal of a string bbb is the string ccc with ck=bl−1−kc_k = b_{l-1-k}ck​=bl−1−k​.

Formalization targets

Goal: the circuit computes AqA_qAq​ up to bit reversal (§4, p. 1496)

For every l≥0l \ge 0l≥0 and every basis state ∣a⟩|a\rangle∣a⟩, with q=2lq = 2^lq=2l,

circuit ∣a⟩=1q1/2∑bexp⁡(2πi ac/q) ∣b⟩,c=bit reversal of b.\text{circuit}\,|a\rangle = \frac{1}{q^{1/2}}\sum_{b}\exp(2\pi i\,ac/q)\,|b\rangle, \qquad c = \text{bit reversal of } b .circuit∣a⟩=q1/21​b∑​exp(2πiac/q)∣b⟩,c=bit reversal of b.

The sum runs over all lll-bit strings bbb. Reading the output register in reverse order therefore yields Aq∣a⟩A_q|a\rangleAq​∣a⟩.

Milestone 1: the amplitude along the circuit (§4, eq. (4.5), p. 1496)

The amplitude of ∣b⟩|b\rangle∣b⟩ in circuit ∣a⟩\text{circuit}\,|a\ranglecircuit∣a⟩ is

2−l/2exp⁡(i(∑0≤j<lπajbj+∑0≤j<k<lπ2k−jajbk)).2^{-l/2}\exp\Big(i\Big(\sum_{0\le j<l}\pi a_jb_j + \sum_{0\le j<k<l}\frac{\pi}{2^{k-j}}a_jb_k\Big)\Big).2−l/2exp(i(0≤j<l∑​πaj​bj​+0≤j<k<l∑​2k−jπ​aj​bk​)).

Milestone 2: the phase identity (§4, eqs. (4.6)–(4.10), pp. 1496–1497)

For bit strings a,ba, ba,b, with ccc the bit reversal of bbb and a,ca, ca,c their values,

exp⁡(i(∑0≤j<lπajbj+∑0≤j<k<lπ2k−jajbk))=exp⁡(2πi ac/q).\exp\Big(i\Big(\sum_{0\le j<l}\pi a_jb_j + \sum_{0\le j<k<l}\frac{\pi}{2^{k-j}}a_jb_k\Big)\Big) = \exp(2\pi i\,ac/q).exp(i(0≤j<l∑​πaj​bj​+0≤j<k<l∑​2k−jπ​aj​bk​))=exp(2πiac/q).

Significance

The result. The goal says that AqA_qAq​, a dense unitary on 2l2^l2l amplitudes, is realized by lll one-bit gates and l(l−1)/2l(l-1)/2l(l−1)/2 two-bit gates, followed by a relabelling of the output. This is what makes the Fourier sampling step of the factoring algorithm (§5) and of the discrete logarithm algorithm (§6) polynomial in the number of bits. Without it, the analyses of those sections describe measurements of states that no efficient circuit is known to prepare. The bit reversal is a real part of the statement: the circuit does not compute AqA_qAq​ itself for l≥2l \ge 2l≥2, and an implementation must either permute the output bits or read them in reverse order.

Formalizing it. The identity is classical and its proof is short on paper; its content lies in bookkeeping that is easy to get wrong: which bit a gate touches, which of the input or output value a bit holds when a phase gate acts, and the order in which the gates are applied. A machine-checked version fixes all of these conventions explicitly and yields a reusable model of gate-level circuits on bit strings. To the drafter's knowledge there is no Lean formalization of this circuit on Prove2Me; the platform's FastFourierTransform rows state the classical Cooley–Tukey recursion for the unnormalized transform with the opposite sign, which is a different object.

Difficulty

Multiplying out the gate matrices is not an argument beyond tiny lll: the difficulty is to control the whole product of l(l+1)/2l(l+1)/2l(l+1)/2 gates symbolically. The paper's argument (§4, p. 1496) is informal at exactly the points a formal proof must make precise: that only one sequence of intermediate basis states from ∣a⟩|a\rangle∣a⟩ to ∣b⟩|b\rangle∣b⟩ carries nonzero amplitude, and that at the moment Sj,kS_{j,k}Sj,k​ acts, bit kkk already holds its output value bkb_kbk​ while bit jjj still holds its input value aja_jaj​. Both facts depend on the order (4.4); applying the same gates in the reverse order gives a different unitary, whose phase pairs bjb_jbj​ with aka_kak​. The phase identity then holds only modulo 2π2\pi2π, not as an equality of real numbers, so it cannot be closed by rearranging sums alone.

Formalization scope

  • States. A bit string on lll bits is Fin l → Fin 2, with bit j equal to aja_jaj​ and value ∑j2jaj\sum_j 2^j a_j∑j​2jaj​ (least significant bit first). A state is a function from bit strings to ℂ. The case l=0l = 0l=0 (q=1q = 1q=1, empty circuit) is included.
  • Gate application follows the row = input convention: a one-bit gate MMM on bit jjj sends ψ\psiψ to b↦∑uψ(b[j↦u]) Mu,bjb \mapsto \sum_u \psi(b[j\mapsto u])\,M_{u, b_j}b↦∑u​ψ(b[j↦u])Mu,bj​​, and a two-bit gate acts analogously on the pair (bit jjj, bit kkk).
  • The circuit is the gate list (4.4) — an explicit list of constructors R j and S j k — run by a left fold, so the leftmost gate acts first. It is not defined as the matrix AqA_qAq​ or by its entries; a definition of that kind would make the goal true by unfolding and is ruled out.
  • Angles. θk−j=π/2k−j\theta_{k-j} = \pi/2^{k-j}θk−j​=π/2k−j uses natural-number subtraction, which is exact because the list only contains Sj,kS_{j,k}Sj,k​ with j<kj < kj<k.
  • Normalization. The prefactor q−1/2q^{-1/2}q−1/2 is written (2l)−1(\sqrt{2^l})^{-1}(2l​)−1.
  • Basis form. The goal is stated on basis states, as on the page; by linearity it determines the circuit on every state.
  • Not stated. The gate count: the paper's sentence "we thus need to use l(l−1)/2l(l-1)/2l(l−1)/2 quantum gates" (p. 1496) counts only the gates Sj,kS_{j,k}Sj,k​; the sequence (4.4) also contains the lll gates RjR_jRj​, l(l+1)/2l(l+1)/2l(l+1)/2 gates in all. The approximate transform of Coppersmith and the one-bit construction of Griffiths and Niu (p. 1497) are out of scope, as is the polynomial-time claim.

Welcome contributions: proofs of the two milestones and the goal; general lemmas about one- and two-bit gate actions on Fin l → Fin 2 states (commutation of gates on disjoint bits, linearity, action on basis states), which are reusable for any gate-level circuit; and a proof that the circuit is unitary.

Selected references

  • P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM J. Comput. 26(5):1484–1509, 1997. https://doi.org/10.1137/S0097539795293172
  • D. Coppersmith, An approximate Fourier transform useful in quantum factoring, IBM Research Report RC 19642, 1994. https://arxiv.org/abs/quant-ph/0201067
  • A. Ekert and R. Jozsa, Quantum computation and Shor's factoring algorithm, Rev. Mod. Phys. 68:733–753, 1996. https://doi.org/10.1103/RevModPhys.68.733
  • R. B. Griffiths and C.-S. Niu, Semiclassical Fourier transform for quantum computation, Phys. Rev. Lett. 76:3228–3231, 1996. https://doi.org/10.1103/PhysRevLett.76.3228
5 thms2 active usersReviewed
🏆Completed
AnalysisPure Mathematics·Captain: mikedeng1

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

Motivation

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 of Levi (1910), Hartogs, Oka and Cartan–Thullen (1932), the way to state that condition intrinsically has been pseudoconvexity. The tool that makes it work is the plurisubharmonic function, the complex analogue of a convex function.

This mission formalizes the part of that theory that needs no partial differential equations: harmonic, subharmonic and plurisubharmonic functions; smoothing of plurisubharmonic functions; the characterizations of Hartogs pseudoconvexity; and the Cartan–Thullen theorem. The source is §2.4–2.6 of Jiří Lebl's open textbook Tasty Bits of Several Complex Variables (version 4.4, 2026), pp. 78–103.

Timeline, as the book presents it:

  • Hartogs (1906) found the extension phenomenon.
  • Levi (1910) found the boundary condition now called Levi pseudoconvexity.
  • Cartan and Thullen (1932) proved that domains of holomorphy are exactly the holomorphically convex domains.
  • Oka (1942–1953), Bremermann and Norguet (1954) solved the Levi problem: every pseudoconvex domain is a domain of holomorphy. The book states this result (its Theorem 2.6.2) but does not prove it.

Setting

Throughout, Cn\mathbb{C}^nCn carries the Euclidean norm ∥z∥=(∣z1∣2+⋯+∣zn∣2)1/2\|z\| = (|z_1|^2 + \dots + |z_n|^2)^{1/2}∥z∥=(∣z1​∣2+⋯+∣zn​∣2)1/2. A domain is a nonempty connected open set. For K,U⊂CnK, U \subset \mathbb{C}^nK,U⊂Cn, K⊂⊂UK \subset\subset UK⊂⊂U means that KKK is relatively compact in UUU: its closure is compact and contained in UUU.

Harmonic and subharmonic functions (one variable). A C2C^2C2 function fff on an open U⊂CU \subset \mathbb{C}U⊂C is harmonic if ∇2f=0\nabla^2 f = 0∇2f=0. A function f:U→R∪{−∞}f : U \to \mathbb{R} \cup \{-\infty\}f:U→R∪{−∞} is subharmonic if it is upper-semicontinuous and, for every disc Br(a)B_r(a)Br​(a) with Br(a)‾⊂U\overline{B_r(a)} \subset UBr​(a)​⊂U and every ggg continuous on Br(a)‾\overline{B_r(a)}Br​(a)​ and harmonic inside it, f≤gf \le gf≤g on ∂Br(a)\partial B_r(a)∂Br​(a) implies f≤gf \le gf≤g on Br(a)B_r(a)Br​(a).

Plurisubharmonic functions. For U⊂CnU \subset \mathbb{C}^nU⊂Cn open, f:U→R∪{−∞}f : U \to \mathbb{R} \cup \{-\infty\}f:U→R∪{−∞} is plurisubharmonic if it is upper-semicontinuous and ξ↦f(a+bξ)\xi \mapsto f(a + b\xi)ξ↦f(a+bξ) is subharmonic on {ξ:a+bξ∈U}\{\xi : a + b\xi \in U\}{ξ:a+bξ∈U} for all a,b∈Cna, b \in \mathbb{C}^na,b∈Cn.

Hulls and convexity. For a class F\mathcal{F}F of extended-real functions on UUU and K⊂UK \subset UK⊂U, the hull is

K^={x∈U:f(x)≤sup⁡y∈Kf(y) for all f∈F}.\widehat{K} = \{x \in U : f(x) \le \sup_{y \in K} f(y) \text{ for all } f \in \mathcal{F}\}.K={x∈U:f(x)≤y∈Ksup​f(y) for all f∈F}.

UUU is convex with respect to F\mathcal{F}F if K⊂⊂UK \subset\subset UK⊂⊂U implies K^⊂⊂U\widehat{K} \subset\subset UK⊂⊂U. For F={∣f∣:f∈O(U)}\mathcal{F} = \{|f| : f \in \mathcal{O}(U)\}F={∣f∣:f∈O(U)} this is holomorphic convexity, with hull K^U\widehat{K}_UKU​.

Hartogs pseudoconvexity. f:U→Rf : U \to \mathbb{R}f:U→R is an exhaustion function if {z∈U:f(z)<r}⊂⊂U\{z \in U : f(z) < r\} \subset\subset U{z∈U:f(z)<r}⊂⊂U for every rrr. A domain is Hartogs pseudoconvex if it admits a continuous plurisubharmonic exhaustion function.

Analytic discs. A closed analytic disc is a nonconstant holomorphic φ:D→Cn\varphi : \mathbb{D} \to \mathbb{C}^nφ:D→Cn that extends continuously to D‾\overline{\mathbb{D}}D. Its image is Δ=φ(D)\Delta = \varphi(\mathbb{D})Δ=φ(D) and its boundary is ∂Δ=φ(∂D)\partial\Delta = \varphi(\partial\mathbb{D})∂Δ=φ(∂D).

Formalization targets

Goal: Theorem 2.5.6

For a domain U⊊CnU \subsetneq \mathbb{C}^nU⊊Cn with ρ(z)=dist⁡(z,∂U)\rho(z) = \operatorname{dist}(z, \partial U)ρ(z)=dist(z,∂U), the following are equivalent:

(i) −log⁡ρ is plurisubharmonic;(ii) U is Hartogs pseudoconvex;\text{(i) } -\log\rho \text{ is plurisubharmonic};\quad \text{(ii) } U \text{ is Hartogs pseudoconvex};(i) −logρ is plurisubharmonic;(ii) U is Hartogs pseudoconvex; (iii) U is convex w.r.t. plurisubharmonic functions on U;(iv) ⋃α∂Δα⊂⊂U⇒⋃αΔα⊂⊂U\text{(iii) } U \text{ is convex w.r.t. plurisubharmonic functions on } U;\quad \text{(iv) } \textstyle\bigcup_\alpha \partial\Delta_\alpha \subset\subset U \Rightarrow \bigcup_\alpha \Delta_\alpha \subset\subset U(iii) U is convex w.r.t. plurisubharmonic functions on U;(iv) ⋃α​∂Δα​⊂⊂U⇒⋃α​Δα​⊂⊂U

for every collection of closed analytic discs Δα⊂U\Delta_\alpha \subset UΔα​⊂U.

Milestones

  • Proposition 2.4.3. A continuous fff is harmonic iff it has the mean-value property. An upper-semicontinuous fff is subharmonic iff f(a)≤12π∫02πf(a+reiθ) dθf(a) \le \frac{1}{2\pi}\int_0^{2\pi} f(a + re^{i\theta})\,d\thetaf(a)≤2π1​∫02π​f(a+reiθ)dθ whenever Δr(a)‾⊂U\overline{\Delta_r(a)} \subset UΔr​(a)​⊂U.
  • Proposition 2.4.7. Finite suprema of subharmonic functions are subharmonic, and so are arbitrary suprema that are finite and upper-semicontinuous.
  • Proposition 2.4.9. A C2C^2C2 function is plurisubharmonic iff its complex Hessian [∂2f/∂zˉk∂zℓ][\partial^2 f/\partial\bar z_k \partial z_\ell][∂2f/∂zˉk​∂zℓ​] is positive semidefinite.
  • Theorem 2.4.10. Every plurisubharmonic fff is the pointwise limit of smooth plurisubharmonic fϵ≥ff_\epsilon \ge ffϵ​≥f on Uϵ={z∈U:dist⁡(z,∂U)>ϵ}U_\epsilon = \{z \in U : \operatorname{dist}(z, \partial U) > \epsilon\}Uϵ​={z∈U:dist(z,∂U)>ϵ}.
  • Theorem 2.5.2 (Kontinuitätssatz, second version): (iii) implies (iv).
  • Lemma 2.5.7. Hartogs pseudoconvexity is a local property of the boundary.
  • Theorem 2.4.12 (Radó): a continuous function holomorphic off its zero set is holomorphic.
  • Theorem 2.6.3 (Cartan–Thullen): for a domain U⊊CnU \subsetneq \mathbb{C}^nU⊊Cn, being a domain of holomorphy, dist⁡(K,∂U)=dist⁡(K^U,∂U)\operatorname{dist}(K, \partial U) = \operatorname{dist}(\widehat{K}_U, \partial U)dist(K,∂U)=dist(KU​,∂U) for all K⊂⊂UK \subset\subset UK⊂⊂U, and holomorphic convexity are equivalent.

Significance

The result. Theorem 2.5.6 makes pseudoconvexity checkable. Condition (i) involves one explicitly given function of the domain's geometry. Condition (iv) involves only families of discs. Condition (ii) is the form the Levi problem and Hörmander's L2L^2L2 theory need. From these equivalences one gets, for example, that intersections and increasing unions of pseudoconvex domains are pseudoconvex, that pseudoconvexity is a biholomorphic invariant, and, with Lemma 2.5.7, that it is a local boundary property. In the smooth case that local property is Levi pseudoconvexity (Theorem 2.5.8, chapter III of this series). Cartan–Thullen supplies the other half of the picture for domains of holomorphy.

Formalizing it. All of these results are classical and proved in the book, apart from routine steps left as exercises. As far as is known, none of them is formalized in any proof assistant. Mathlib has harmonic functions (InnerProductSpace.HarmonicOnNhd) and the circle average, but no subharmonic or plurisubharmonic functions, no hulls and no pseudoconvexity. The Prove2Me corpus holds a one-variable subharmonic definition based on the sub-mean-value property and the one-directional mean-value property of harmonic functions; neither is the book's definition or statement. The mission would give Lean a first library of plurisubharmonic functions in Cn\mathbb{C}^nCn, with the definition matching the textbook.

Difficulty

The obvious route to (iv) ⇒ (i) of the goal would show −log⁡ρ-\log\rho−logρ is plurisubharmonic by computing a complex Hessian (Proposition 2.4.9). That fails: ρ\rhoρ is in general not even differentiable, so no Hessian is available. Several other steps also need measure theory with extended-real values. The sub-mean-value property requires Lebesgue integrals of upper-semicontinuous functions that may equal −∞-\infty−∞ on large sets. Smoothing requires convolution of such functions with a mollifier, and pointwise convergence in [−∞,∞)[-\infty, \infty)[−∞,∞). Suprema of families lose upper semicontinuity in general, which is why Proposition 2.4.7 carries that hypothesis. In Cartan–Thullen, holomorphic convexity alone must produce a holomorphic function on UUU that extends across no boundary point. Nothing in the hypothesis supplies such a function directly.

Formalization scope

  • Cn\mathbb{C}^nCn is EuclideanSpace ℂ (Fin n), so balls, ρ(z)\rho(z)ρ(z) = Metric.infDist z (frontier U), UϵU_\epsilonUϵ​ and dist⁡(K,∂U)\operatorname{dist}(K, \partial U)dist(K,∂U) are all Euclidean, as in the book. They are not sup-norm polydisc quantities.
  • Functions with values in R∪{−∞}\mathbb{R} \cup \{-\infty\}R∪{−∞} are EReal-valued with +∞+\infty+∞ excluded on UUU. Upper semicontinuity is UpperSemicontinuousOn for the order of EReal.
  • Hulls take suprema in EReal, and holomorphic hulls in [0,∞][0, \infty][0,∞], so no supremum takes a junk value. Set distances are infima in [0,∞][0, \infty][0,∞] (Metric.infEDist).
  • The circle mean in Proposition 2.4.3 (ii) is the Lebesgue integral of the positive part minus that of the negative part.
  • Holomorphic on an open set is DifferentiableOn ℂ, which is equivalent to the book's Definition 1.1.2 there.
  • A domain is IsOpen U ∧ IsConnected U. Relative compactness is compact closure contained in UUU.
  • Harmonic and subharmonic functions are defined only on open subsets of C=R2\mathbb{C} = \mathbb{R}^2C=R2. The book defines them on Rn\mathbb{R}^nRn, but only uses n=2n = 2n=2. This is the one restriction of scope.
  • A collection of analytic discs is a set of parametrizing maps, and Δα=φα(D)\Delta_\alpha = \varphi_\alpha(\mathbb{D})Δα​=φα​(D) as in Definition 1.4.5.
  • Definitions 1.4.5 and 2.1.1 are restated locally in the namespace LeblSCV.Pseudoconvex.

Several trivializing formalizations are ruled out. Plurisubharmonicity is not defined through the Hessian condition, so the mission does not reduce to C2C^2C2 functions. Nor is it defined by the sub-mean-value property, which would make Proposition 2.4.3 (ii) a tautology. ρ\rhoρ is not the sup-norm distance. Suprema, infima and integrals are nowhere allowed to default to 000 on empty, unbounded or non-integrable input.

A complete development needs:

  • mean values of upper-semicontinuous functions and the Poisson integral on discs (Theorem 2.4.2, not a milestone);
  • convolution with a radial mollifier on Cn\mathbb{C}^nCn;
  • Cauchy estimates on polydiscs.

The subharmonic and plurisubharmonic layer is reusable beyond this mission. Chapters on the Levi problem, the ∂ˉ\bar\partial∂ˉ-problem and Bergman kernels would all build on it. Proofs of the smaller milestones, and alternative arguments for the goal, are welcome.

Selected references

  • J. Lebl, Tasty Bits of Several Complex Variables: A Whirlwind Tour of the Subject, version 4.4, 2026. https://www.jirka.org/scv/scv.pdf
  • L. Hörmander, An Introduction to Complex Analysis in Several Variables, 3rd ed., North-Holland Mathematical Library 7, 1990 (the book's reference [H] for the Levi problem).
  • H. Cartan and P. Thullen, "Zur Theorie der Singularitäten der Funktionen mehrerer komplexen Veränderlichen: Regularitäts- und Konvergenzbereiche", Mathematische Annalen 106 (1932), 617–647.
26 thms2 active usersReviewed
🏆Completed
Analysis·Captain: Lucas

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

Motivation

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 quantitatively useful is Parseval's theorem: the average power of the signal equals the sum of the squared moduli of its Fourier coefficients, so energy can be accounted for frequency by frequency.

This mission formalizes the chain of results leading to that identity exactly as it is presented in the open-access undergraduate textbook Análise de Fourier — Um Livro Colaborativo (Esequia Sauter and Fabio Souto de Azevedo, orgs., UFRGS/REAMAT, 2022): the orthogonality relations of the trigonometric system (Teorema 3.2.1), the coefficient formulas (Teorema 3.2.2), the passage to the exponential form (§4.2), and the Parseval identity itself (Teorema 5.1.1).

Setting

Fix a period T>0T > 0T>0 and write

ωn  =  2πnT,n∈Z.\omega_n \;=\; \frac{2\pi n}{T}, \qquad n \in \mathbb{Z}.ωn​=T2πn​,n∈Z.

For a real-valued fff integrable on [0,T][0,T][0,T] the book defines the trigonometric Fourier coefficients (eq. 3.23)

an  =  2T∫0Tf(t)cos⁡(ωnt) dt,bn  =  2T∫0Tf(t)sin⁡(ωnt) dt,a_n \;=\; \frac{2}{T}\int_0^T f(t)\cos(\omega_n t)\,dt, \qquad b_n \;=\; \frac{2}{T}\int_0^T f(t)\sin(\omega_n t)\,dt,an​=T2​∫0T​f(t)cos(ωn​t)dt,bn​=T2​∫0T​f(t)sin(ωn​t)dt,

and for a complex-valued fff the exponential coefficients (§4.2, eq. 4.8)

Cn  =  1T∫0Tf(t) e−iωnt dt,n∈Z,C_n \;=\; \frac{1}{T}\int_0^T f(t)\,e^{-i\omega_n t}\,dt, \qquad n \in \mathbb{Z},Cn​=T1​∫0T​f(t)e−iωn​tdt,n∈Z,

which for real fff satisfy Cn=(an−ibn)/2C_n = (a_n - i b_n)/2Cn​=(an​−ibn​)/2. The average power of a TTT-periodic signal is (Definição 5.1.1)

Pf  =  1T∫0T∣f(t)∣2 dt.P_f \;=\; \frac{1}{T}\int_0^T |f(t)|^2\,dt .Pf​=T1​∫0T​∣f(t)∣2dt.

A trigonometric polynomial of degree NNN (Definição 3.2.1) is

a02+∑n=1N[ancos⁡(ωnt)+bnsin⁡(ωnt)].\frac{a_0}{2} + \sum_{n=1}^{N}\bigl[a_n\cos(\omega_n t) + b_n\sin(\omega_n t)\bigr].2a0​​+n=1∑N​[an​cos(ωn​t)+bn​sin(ωn​t)].

Formalization targets

Goal — Teorema 5.1.1 (Teorema de Parseval)

For T>0T > 0T>0 and f:R→Cf : \mathbb{R} \to \mathbb{C}f:R→C continuous and TTT-periodic,

1T∫0T∣f(t)∣2 dt  =  ∑n=−∞∞∣Cn∣2.\frac{1}{T}\int_0^T |f(t)|^2\,dt \;=\; \sum_{n=-\infty}^{\infty} |C_n|^2 .T1​∫0T​∣f(t)∣2dt=n=−∞∑∞​∣Cn​∣2.

The book states the identity for a periodic function "representable by a Fourier series"; the mission fixes continuity as the concrete sufficient regularity hypothesis, which keeps the statement non-vacuous and true, and leaves the sum as an unordered sum over Z\mathbb{Z}Z so that no summation order is smuggled in.

Supporting targets

  1. Teorema 3.2.1 — the three orthogonality relations of {cos⁡(ωnt),sin⁡(ωnt)}\{\cos(\omega_n t), \sin(\omega_n t)\}{cos(ωn​t),sin(ωn​t)} on [0,T][0,T][0,T], including the degenerate index n=m=0n = m = 0n=m=0.
  2. §4.2 — the orthogonality relation in exponential form, ∫0Teiωnte−iωmt dt=T\int_0^T e^{i\omega_n t}e^{-i\omega_m t}\,dt = T∫0T​eiωn​te−iωm​tdt=T for n=mn = mn=m and 000 otherwise, n,m∈Zn, m \in \mathbb{Z}n,m∈Z.
  3. Teorema 3.2.2 — recovery of the coefficients of a trigonometric polynomial by the integral formulas (3.23).
  4. Eq. (4.8) — Cn=(an−ibn)/2C_n = (a_n - i b_n)/2Cn​=(an​−ibn​)/2 for a real integrable fff.
  5. Bessel's inequality and summability — every finite partial sum of ∣Cn∣2|C_n|^2∣Cn​∣2 is at most PfP_fPf​, and the family (∣Cn∣2)n∈Z(|C_n|^2)_{n \in \mathbb{Z}}(∣Cn​∣2)n∈Z​ is summable. Summability is what gives the goal's infinite sum a meaning independent of any ordering.

Significance

Parseval's identity converts an integral estimate into a coefficientwise one: it is the bridge between the time domain and the frequency domain, underlies the RMS computations of the book's own electrical-engineering examples (Exemplo 5.1.2), and yields closed-form evaluations of numerical series (the book's Exemplo 5.1.3 computes a series of reciprocal odd squares this way).

Mathlib already contains the abstract Hilbert-space form of the identity for the Fourier basis on the circle AddCircle T. What this mission adds is the concrete, classroom-level layer that an engineering or physics reader recognizes: coefficients written as interval integrals of a function on R\mathbb{R}R with an explicit period TTT, the real (an,bn)(a_n, b_n)(an​,bn​) form, the exponential CnC_nCn​ form and the dictionary between them, and the orthogonality relations as free-standing computations. That layer is reusable by any later mission in this series (transformada de Fourier, equação do calor, equação da onda).

Difficulty

The obvious route — expand ∣f∣2=ffˉ|f|^2 = f\bar f∣f∣2=ffˉ​, substitute the Fourier series, and integrate term by term — is exactly the book's proof, and it is the step that a formal development cannot take for granted: interchanging the integral with an infinite sum requires a convergence theorem that the book explicitly places outside its scope (the remark after Definição 3.2.3), and pointwise convergence of the Fourier series of a merely continuous function is false in general. A complete proof must run through L2L^2L2 convergence rather than pointwise convergence, so the central task is to connect the interval-integral coefficients on [0,T][0,T][0,T] with the Hilbert-space machinery for the circle, including the change of variables and the normalization of Haar measure.

Formalization scope

The development commits to the following conventions, all fixed in the definition bundle so that every statement shares them:

  • The period is an explicit real parameter TTT with the hypothesis 0<T0 < T0<T written into each statement; at T=0T = 0T=0 the definitions would divide by zero and nothing is claimed.
  • Integrals are interval integrals over [0,T][0,T][0,T] of functions defined on all of R\mathbb{R}R; the book's alternative window [−T/2,T/2][-T/2, T/2][−T/2,T/2] is not used.
  • Coefficient indices range over Z\mathbb{Z}Z; ana_nan​ and bnb_nbn​ are defined for negative nnn as well, matching eq. (4.7) of the book.
  • an,bna_n, b_nan​,bn​ act on real-valued functions, CnC_nCn​ and the average power on complex-valued ones; a real signal enters the complex statements through the coercion of its values.
  • Sums over Z\mathbb{Z}Z are unordered sums, so the goal asserts convergence of the family, not of a symmetric partial-sum limit.
  • The sign convention is e−iωnte^{-i\omega_n t}e−iωn​t in the coefficient and e+iωnte^{+i\omega_n t}e+iωn​t in the synthesis, as in §4.2.

The goal is not trivializable: the hypotheses (a positive period, a continuous periodic function) are satisfiable, and both sides of the identity are non-degenerate already for f(t)=cos⁡(2πt/T)f(t) = \cos(2\pi t/T)f(t)=cos(2πt/T).

Useful infrastructure beyond the mission: the dictionary between the interval-integral coefficients on [0,T][0,T][0,T] and Mathlib's fourierCoeff on AddCircle T, and the orthogonality relations as standalone integral computations.

Selected references

  • Esequia Sauter, Fabio Souto de Azevedo (orgs.), Análise de Fourier — Um Livro Colaborativo, UFRGS/REAMAT, 26 July 2022. https://www.ufrgs.br/reamat/TransformadasIntegrais/livro-af/main.html
11 thms2 active usersReviewed
🏆Completed
Numerical Analysis·Captain: Lucas

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

Motivation

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 sum, a transform of length nnn costs Θ(n2)\Theta(n^2)Θ(n2) arithmetic operations. The fast Fourier transform (FFT) is any method that computes the same values in O(nlog⁡n)O(n \log n)O(nlogn) operations, and the radix-2 Cooley–Tukey algorithm is the most widely used of them.

The history is long and worth stating precisely. Gauss used an equivalent divide-and-conquer scheme in unpublished work of 1805 on the orbits of Pallas and Juno, without any complexity analysis. Danielson and Lanczos (1942) published the doubling step — the even/odd splitting identity that the recursion rests on — for x-ray crystallography. Good (1958) gave the prime-factor algorithm for coprime factorizations. Cooley and Tukey (1965) published the general composite-size algorithm together with the O(nlog⁡n)O(n \log n)O(nlogn) analysis that made the method famous. What is not known is a matching lower bound: whether a DFT of length nnn can be computed in o(nlog⁡n)o(n \log n)o(nlogn) arithmetic operations is open.

Setting

Fix a length n∈Nn \in \mathbb{N}n∈N and a sequence of complex samples x0,x1,x2,…x_0, x_1, x_2, \dotsx0​,x1​,x2​,…, modelled as a function x:N→Cx : \mathbb{N} \to \mathbb{C}x:N→C. The DFT of length nnn evaluated at frequency index kkk is

dft(n,x)(k)  =  ∑m=0n−1xm e−2πi mk/n,\mathrm{dft}(n, x)(k) \;=\; \sum_{m=0}^{n-1} x_m \, e^{-2\pi i\, m k / n},dft(n,x)(k)=m=0∑n−1​xm​e−2πimk/n,

and the inverse transform of a spectrum XXX is

idft(n,X)(m)  =  1n∑k=0n−1Xk e+2πi mk/n.\mathrm{idft}(n, X)(m) \;=\; \frac{1}{n} \sum_{k=0}^{n-1} X_k \, e^{+2\pi i\, m k / n}.idft(n,X)(m)=n1​k=0∑n−1​Xk​e+2πimk/n.

Only the first nnn samples x0,…,xn−1x_0, \dots, x_{n-1}x0​,…,xn−1​ enter the sum; the frequency index kkk is an arbitrary natural number, and the transform is nnn-periodic in it.

The radix-2 Cooley–Tukey algorithm is the recursion on the exponent ppp, with n=2pn = 2^pn=2p:

fft(0,x)(k)=x0,fft(p+1,x)(k)=E ⁣(k mod 2p)+e−2πik/2p+1⋅O ⁣(k mod 2p),\mathrm{fft}(0, x)(k) = x_0, \qquad \mathrm{fft}(p+1, x)(k) = E\!\left(k \bmod 2^p\right) + e^{-2\pi i k / 2^{p+1}} \cdot O\!\left(k \bmod 2^p\right),fft(0,x)(k)=x0​,fft(p+1,x)(k)=E(kmod2p)+e−2πik/2p+1⋅O(kmod2p),

where E=fft(p,m↦x2m)E = \mathrm{fft}(p, m \mapsto x_{2m})E=fft(p,m↦x2m​) is the transform of the even-indexed subsequence and O=fft(p,m↦x2m+1)O = \mathrm{fft}(p, m \mapsto x_{2m+1})O=fft(p,m↦x2m+1​) that of the odd-indexed one. The factor e−2πik/2p+1e^{-2\pi i k/2^{p+1}}e−2πik/2p+1 is the twiddle factor of the merge stage.

The arithmetic cost of that recursion is modelled by two counters. At the merge stage of a transform of 2p+12^{p+1}2p+1 points there are 2p2^p2p butterflies; each butterfly performs one twiddle-factor multiplication and two complex additions, and the two recursive calls are on 2p2^p2p points each:

M(0)=0,M(p+1)=2M(p)+2p,A(0)=0,A(p+1)=2A(p)+2p+1.M(0) = 0, \quad M(p+1) = 2M(p) + 2^p, \qquad A(0) = 0, \quad A(p+1) = 2A(p) + 2^{p+1}.M(0)=0,M(p+1)=2M(p)+2p,A(0)=0,A(p+1)=2A(p)+2p+1.

Formalization targets

Goal

∀ p∈N, ∀ x:N→C, ∀ k∈N:fft(p,x)(k)  =  dft(2p,x)(k).\forall\, p \in \mathbb{N},\ \forall\, x : \mathbb{N} \to \mathbb{C},\ \forall\, k \in \mathbb{N}: \quad \mathrm{fft}(p, x)(k) \;=\; \mathrm{dft}(2^p, x)(k).∀p∈N, ∀x:N→C, ∀k∈N:fft(p,x)(k)=dft(2p,x)(k).

The goal fixes no operation count and no rate: it asserts only that the recursion computes exactly the transform it is supposed to compute, at every frequency index, for every input. That is the statement an implementation's correctness rests on, and it stays true whatever the cost analysis of the algorithm turns out to be.

Supporting targets

The milestones are the intermediate statements the source separates out: nnn-periodicity of the transform in the frequency index; the Danielson–Lanczos even/odd splitting

dft(2N,x)(k)=dft(N,m↦x2m)(k)+e−2πik/(2N)⋅dft(N,m↦x2m+1)(k)(N≥1);\mathrm{dft}(2N, x)(k) = \mathrm{dft}(N, m \mapsto x_{2m})(k) + e^{-2\pi i k/(2N)} \cdot \mathrm{dft}(N, m \mapsto x_{2m+1})(k) \qquad (N \ge 1);dft(2N,x)(k)=dft(N,m↦x2m​)(k)+e−2πik/(2N)⋅dft(N,m↦x2m+1​)(k)(N≥1);

Fourier inversion idft(n,dft(n,x))(m)=xm\mathrm{idft}(n, \mathrm{dft}(n, x))(m) = x_midft(n,dft(n,x))(m)=xm​ for m<nm < nm<n; the conjugate symmetry Xn−k=Xk‾X_{n-k} = \overline{X_k}Xn−k​=Xk​​ of the spectrum of a real input; and the closed forms M(p)=n2log⁡2nM(p) = \tfrac{n}{2}\log_2 nM(p)=2n​log2​n and A(p)=nlog⁡2nA(p) = n\log_2 nA(p)=nlog2​n of the two cost recursions, with n=2pn = 2^pn=2p.

Significance

Fourier inversion and the splitting identity are the two facts that make the transform usable at all: the first says no information is lost, the second is the single algebraic step from which every Cooley–Tukey variant — mixed radix, split radix, iterative bit-reversed implementations — is assembled. The operation counts are what justify the claim that the algorithm is O(nlog⁡n)O(n\log n)O(nlogn) rather than Θ(n2)\Theta(n^2)Θ(n2): for n=220n = 2^{20}n=220 they are the difference between roughly 101210^{12}1012 and roughly 2×1072 \times 10^72×107 complex multiplications.

None of this is open mathematics; all of it is classical. What this mission produces is a self-contained machine-checked development of the radix-2 algorithm against an explicit definition of the DFT: a recursive algorithm, a proof that it agrees with the defining sum at every index, and a proof of its arithmetic cost. Mathlib carries Fourier theory for characters of finite abelian groups and for Z/nZ\mathbb{Z}/n\mathbb{Z}Z/nZ, but the mission is stated against the elementary sum above so that the statements can be read, and audited, without that background.

Difficulty

The obvious induction on ppp does not close by itself. Unfolding the recursion gives the even and odd sub-transforms evaluated at the reduced index k mod 2pk \bmod 2^pkmod2p, while the splitting identity produces them at kkk. Closing the gap needs periodicity of the length-NNN transform in its frequency index — which is why periodicity is a milestone rather than a step inside the main proof. The second recurring obstacle is bookkeeping with the exponential: e−2πi(2m)k/(2N)=e−2πimk/Ne^{-2\pi i (2m)k/(2N)} = e^{-2\pi i mk/N}e−2πi(2m)k/(2N)=e−2πimk/N and e−2πim=1e^{-2\pi i m} = 1e−2πim=1 are the only analytic inputs, but they must be applied under a finite sum with natural-number casts, where N\mathbb{N}N-subtraction and division by a cast nnn that may be zero are easy to get wrong.

Formalization scope

Sequences are total functions N→C\mathbb{N} \to \mathbb{C}N→C, not vectors of a fixed length: the length nnn appears only as the range of the defining sum, so the transform of length nnn ignores xmx_mxm​ for m≥nm \ge nm≥n. The frequency index ranges over all of N\mathbb{N}N, and the goal is asserted for every such index, not only for k<2pk < 2^pk<2p — the periodicity of both sides makes this the stronger, and cleaner, statement.

Degenerate inputs are inside the statements, not excluded by hypothesis. The length-000 transform is the empty sum 000; division by the cast (n:C)=0(n : \mathbb{C}) = 0(n:C)=0 follows Lean's convention z/0=0z/0 = 0z/0=0, which is why inversion carries the hypothesis 0<n0 < n0<n and the splitting identity carries 0<N0 < N0<N. The real-input symmetry is stated for k≤nk \le nk≤n, with N\mathbb{N}N-subtraction in n−kn - kn−k.

There is no trivializing reading: the FFT recursion is defined without ever mentioning the DFT, the cost counters are defined by their own recursions, and every hypothesis in the list above is satisfiable.

A complete development needs: the geometric-sum evaluation of ∑k<nζk\sum_{k<n} \zeta^k∑k<n​ζk for an nnn-th root of unity ζ≠1\zeta \ne 1ζ=1 (for inversion), the even/odd reindexing of a sum over {0,…,2N−1}\{0,\dots,2N-1\}{0,…,2N−1}, and the periodicity computations above. All of these are reusable beyond this mission; the splitting identity in particular is the entry point for a mixed-radix or split-radix sequel.

Selected references

  • J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation 19 (1965), 297–301. https://doi.org/10.1090/S0025-5718-1965-0178586-1
  • G. C. Danielson and C. Lanczos, Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids, Journal of the Franklin Institute 233 (1942), 365–380 and 435–452. https://doi.org/10.1016/S0016-0032(42)90767-1
  • M. T. Heideman, D. H. Johnson and C. S. Burrus, Gauss and the history of the fast Fourier transform, Archive for History of Exact Sciences 34 (1985), 265–277. https://doi.org/10.1007/BF00348431
  • Fast Fourier transform, Wikipedia. https://en.wikipedia.org/wiki/Fast_Fourier_transform
11 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: Lucas

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

Motivation

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 classical part (Part II of the survey) that admits precise formal statements today.

The classical engine is a theorem of Hecke (1936): a holomorphic function on the upper half-plane, given by a Fourier expansion in e2πinz/he^{2\pi i n z/h}e2πinz/h, transforms in a prescribed way under z↦−1/zz \mapsto -1/zz↦−1/z exactly when the Dirichlet series built from its Fourier coefficients continues analytically and satisfies a functional equation. One side of the equivalence is a symmetry of an analytic object on the upper half-plane; the other is an analytic property of a series assembled from arithmetic data. Gelbart presents this as the prototype of the "reciprocity" that the Langlands conjectures extend to GLnGL_nGLn​ and beyond.

Timeline of the material covered here.

  • 1859: Riemann derives the functional equation of ζ(s)\zeta(s)ζ(s) from the transformation law of the Jacobi theta function, via the Mellin transform (Gelbart, §II.B.2, p. 187).
  • 1920s: Hasse and Minkowski establish the local-global principle for rational quadratic forms (Gelbart, §II.A, p. 186).
  • 1936: Hecke proves the equivalence that is this mission's goal, and characterizes Euler products among Dirichlet series of automorphic forms (Gelbart, §II.B.2, Theorems 1 and 2).
  • 1967: Weil extends Hecke's theorem to congruence subgroups; Langlands formulates functoriality.

Setting

Fix a sequence of complex numbers a0,a1,a2,…a_0, a_1, a_2, \dotsa0​,a1​,a2​,… subject to the growth condition an=O(nc)a_n = O(n^c)an​=O(nc) for some c>0c > 0c>0, a period h>0h > 0h>0, a weight k>0k > 0k>0, and a sign C=±1C = \pm 1C=±1. Three objects are attached to this data.

  • The form: f(z)=∑n≥0ane2πinz/h\displaystyle f(z) = \sum_{n \ge 0} a_n e^{2\pi i n z/h}f(z)=n≥0∑​an​e2πinz/h, holomorphic on the upper half-plane {z:Im⁡z>0}\{z : \operatorname{Im} z > 0\}{z:Imz>0}.
  • The Dirichlet series: φ(s)=∑n≥1anns\displaystyle \varphi(s) = \sum_{n \ge 1} \frac{a_n}{n^s}φ(s)=n≥1∑​nsan​​, absolutely convergent for Re⁡s>c+1\operatorname{Re} s > c+1Res>c+1.
  • The completed series: Φ(s)=(2πh)−sΓ(s) φ(s)\displaystyle \Phi(s) = \left(\frac{2\pi}{h}\right)^{-s} \Gamma(s)\, \varphi(s)Φ(s)=(h2π​)−sΓ(s)φ(s).

Two conditions on this data are compared.

(A)Φ(s)+a0s+Ca0k−s extends to an entire function, bounded in every vertical strip, and Φ(k−s)=C Φ(s).\textbf{(A)}\quad \Phi(s) + \frac{a_0}{s} + \frac{C a_0}{k-s} \ \text{extends to an entire function, bounded in every vertical strip, and}\ \Phi(k-s) = C\,\Phi(s).(A)Φ(s)+sa0​​+k−sCa0​​ extends to an entire function, bounded in every vertical strip, and Φ(k−s)=CΦ(s). (B)f(−1/z)=C(zi)kf(z)(Im⁡z>0).\textbf{(B)}\quad f(-1/z) = C\left(\frac{z}{i}\right)^{k} f(z) \qquad (\operatorname{Im} z > 0).(B)f(−1/z)=C(iz​)kf(z)(Imz>0).

Condition (B) says that fff is automorphic of weight kkk for the group of transformations generated by z↦z+hz \mapsto z + hz↦z+h and z↦−1/zz \mapsto -1/zz↦−1/z; invariance under z↦z+hz \mapsto z+hz↦z+h is built into the Fourier expansion.

Formalization targets

Goal — Theorem 1 (Hecke), p. 188

(A)  ⟺  (B)\textbf{(A)} \iff \textbf{(B)}(A)⟺(B)

for every coefficient sequence of polynomial growth and all h,k>0h, k > 0h,k>0, C=±1C = \pm 1C=±1. The goal fixes no particular group, no level and no arithmetic input: it is the general equivalence, from which the classical examples follow by specialization.

Milestones

The milestone list follows the survey: the local-global principle of §II.A, the Riemann–theta computation that motivates Hecke's proof (§II.B.2, p. 187), the Mellin representation of Φ\PhiΦ, the two implications of Theorem 1 separately, and the Euler-product criterion of Theorem 2 (p. 189).

Significance

Hecke's theorem is what makes "this LLL-function is automorphic" a checkable assertion: it converts a statement about analytic continuation and a functional equation — often the only handle one has on an arithmetically defined Dirichlet series — into the existence of an automorphic form with prescribed Fourier coefficients. Weil's converse theorem, the modularity of elliptic curves, and the automorphy criteria used throughout the Langlands program are descendants of this statement. Downstream of it sit the classical applications listed in the survey: the functional equations of ζ\zetaζ and of Dirichlet LLL-functions, and the identification of theta series of quadratic forms with modular forms.

Status. Hecke's theorem is a classical, fully proved result (Hecke 1936; a textbook treatment is Ogg, Modular forms and Dirichlet series, Ch. 1). Hasse–Minkowski is likewise classical. Neither has a formalization in Mathlib at the pinned revision: Mathlib supplies the completed Riemann zeta function and its functional equation, the Jacobi theta transformation law, LSeries and its abscissa theory, the Gamma function and the Mellin transform, and modular forms with SlashAction, but no converse theorem and no local-global principle for quadratic forms. What this mission produces is therefore new formal mathematics on top of an old result, not a re-derivation of something already machine-checked.

Difficulty

The forward implication (B) ⇒\Rightarrow⇒ (A) is Riemann's argument: split ∫0∞(f(iy)−a0)ys−1 dy\int_0^\infty (f(iy) - a_0) y^{s-1}\,dy∫0∞​(f(iy)−a0​)ys−1dy at y=1y = 1y=1, substitute y↦1/yy \mapsto 1/yy↦1/y in the lower piece, and use (B). The obstacle is not the algebra but the analysis that licenses it: exchanging the sum defining fff with the integral, controlling f(iy)−a0f(iy) - a_0f(iy)−a0​ as y→0+y \to 0^{+}y→0+, where the naive termwise bound diverges, and showing the result is entire and bounded on vertical strips rather than merely holomorphic on a half-plane.

The reverse implication (A) ⇒\Rightarrow⇒ (B) is harder, and it is where the first idea fails: one cannot simply run the computation backwards, because the Mellin inversion integral 12πi∫(σ)Φ(s)y−s ds\frac{1}{2\pi i}\int_{(\sigma)} \Phi(s) y^{-s}\,ds2πi1​∫(σ)​Φ(s)y−sds converges only once boundedness in vertical strips is combined with Stirling decay of Γ\GammaΓ, and the contour shift that produces the a0a_0a0​ terms needs both. Mathlib has the Mellin transform and an inversion theorem, under hypotheses that are not met verbatim here; supplying that bridge is the main work.

Formalization scope

Conventions committed to in Lean, all of them invisible in the prose.

  • fff is defined as an unconditional tsum over n≥0n \ge 0n≥0, so it takes the junk value 000 where the series fails to converge; every statement about fff is guarded by Im⁡z>0\operatorname{Im} z > 0Imz>0, and a separate item asserts summability there.
  • φ\varphiφ is Mathlib's LSeries, whose n=0n = 0n=0 term is 000 by definition, so a0a_0a0​ never enters the Dirichlet series — only the correction terms a0/sa_0/sa0​/s and Ca0/(k−s)C a_0/(k-s)Ca0​/(k−s).
  • "Entire" is rendered as differentiability on all of C\mathbb{C}C; "bounded in every vertical strip" as: for all reals σ1,σ2\sigma_1, \sigma_2σ1​,σ2​ there is an MMM bounding the function on σ1≤Re⁡s≤σ2\sigma_1 \le \operatorname{Re} s \le \sigma_2σ1​≤Res≤σ2​.
  • The functional equation is imposed on the continued function FFF as F(k−s)=C F(s)F(k-s) = C\,F(s)F(k−s)=CF(s); for C=±1C = \pm 1C=±1 this is equivalent to Φ(k−s)=C Φ(s)\Phi(k-s) = C\,\Phi(s)Φ(k−s)=CΦ(s) on the half-plane of convergence.
  • Complex powers (2π/h)−s(2\pi/h)^{-s}(2π/h)−s, (z/i)k(z/i)^{k}(z/i)k and ys−1y^{s-1}ys−1 are principal-branch cpow; on the upper half-plane z/iz/iz/i has positive real part, so no branch ambiguity arises.
  • The growth hypothesis is ∥an∥≤Knc\lVert a_n \rVert \le K n^{c}∥an​∥≤Knc for n≥1n \ge 1n≥1 with c>0c > 0c>0, and the abscissa used throughout is σ=c+1\sigma = c+1σ=c+1.
  • The printed source reads Φ(s)+a0/s+C/(k−s)\Phi(s) + a_0/s + C/(k-s)Φ(s)+a0​/s+C/(k−s); the term Ca0/(k−s)C a_0/(k-s)Ca0​/(k−s) used here is the standard form of the correction (see Ogg, Ch. 1), and the two agree when a0=0a_0 = 0a0​=0.

No trivializing reading is available: condition (A) requires the entire function to agree with Φ(s)+a0/s+Ca0/(k−s)\Phi(s) + a_0/s + C a_0/(k-s)Φ(s)+a0​/s+Ca0​/(k−s) on Re⁡s>c+1\operatorname{Re} s > c+1Res>c+1, where Φ\PhiΦ is genuinely defined, so it is not satisfied by an arbitrary entire function; and the hypotheses of the goal are satisfiable — the Jacobi theta coefficients with h=2h = 2h=2, k=1/2k = 1/2k=1/2, C=1C = 1C=1 are an instance, recorded as its own item.

A complete development needs: summability and holomorphy of qqq-expansions of polynomial growth; the Mellin transform of an exponentially decaying series; entirety and strip-boundedness of the continued Φ\PhiΦ; Mellin inversion with Stirling control of Γ\GammaΓ; and, for the Euler-product item, the passage from multiplicativity to an Euler product for LSeries. All of these are reusable beyond this mission. Contributions to any single item are welcome; the two implications of the goal are independently valuable and are listed as separate milestones for that reason.

Selected references

  • S. Gelbart, An elementary introduction to the Langlands program, Bull. Amer. Math. Soc. (N.S.) 10 (1984), 177–219. https://doi.org/10.1090/S0273-0979-1984-15237-6
  • E. Hecke, Über die Bestimmung Dirichletscher Reihen durch ihre Funktionalgleichung, Math. Ann. 112 (1936), 664–699. https://doi.org/10.1007/BF01565437
  • A. Ogg, Modular forms and Dirichlet series, W. A. Benjamin, 1969.
  • R. P. Langlands, Problems in the theory of automorphic forms, Lectures in Modern Analysis and Applications III, Lecture Notes in Math. 170 (1970), 18–61. https://doi.org/10.1007/BFb0079065
  • J.-P. Serre, A course in arithmetic, Springer GTM 7, 1973 (Ch. IV: Hasse–Minkowski).
12 thms2 active usersReviewed
🏆Completed
Captain: Elsie66

Fejér's TheoremTextbook

Motivation

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 replacing the partial sums with their Cesàro (arithmetic) averages: for every continuous periodic function, these averages converge to the function, uniformly, with no smoothness hypothesis beyond continuity. This was the first universally valid summation method for Fourier series, and its underlying technique — averaging against a kernel whose mass concentrates at the origin — became the template for what is now called a good kernel or approximate identity, the basic device used throughout harmonic analysis (heat-kernel smoothing, Poisson summation, Fourier-inversion arguments) [Stein & Shakarchi, 2003].

Timeline.

  • 1873 — du Bois-Reymond constructs a continuous 2π2\pi2π-periodic function whose Fourier series diverges at a point, showing continuity alone cannot guarantee convergence of the partial sums themselves.
  • 1904 — Fejér proves that the Cesàro means of the Fourier series of any continuous periodic function converge to it uniformly (Fejér, 1904).
  • The good-kernel method Fejér introduced was later systematized as the general framework for approximate identities in harmonic analysis (Stein & Shakarchi, 2003, Ch. 2, §5).

Setting

Let f:R→Cf : \mathbb{R} \to \mathbb{C}f:R→C be continuous and 2π2\pi2π-periodic, i.e. f(x+2π)=f(x)f(x + 2\pi) = f(x)f(x+2π)=f(x) for every x∈Rx \in \mathbb{R}x∈R. Its nnn-th Fourier coefficient, for n∈Zn \in \mathbb{Z}n∈Z, is

f^(n)=12π∫−ππf(θ) e−inθ dθ.\hat f(n) = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(\theta)\, e^{-in\theta}\, d\theta.f^​(n)=2π1​∫−ππ​f(θ)e−inθdθ.

Its NNN-th partial sum is SN(f)(θ)=∑n=−NNf^(n) einθS_N(f)(\theta) = \sum_{n=-N}^{N} \hat f(n)\, e^{in\theta}SN​(f)(θ)=∑n=−NN​f^​(n)einθ, and its NNN-th Cesàro (Fejér) mean is the arithmetic average of the first N+1N+1N+1 partial sums,

σN(f)(θ)=1N+1∑k=0NSk(f)(θ).\sigma_N(f)(\theta) = \frac{1}{N+1}\sum_{k=0}^{N} S_k(f)(\theta).σN​(f)(θ)=N+11​k=0∑N​Sk​(f)(θ).

Formalization targets

Fejér's theorem

σN(f)⟶funiformly on R as N→∞.\sigma_N(f) \longrightarrow f \quad \text{uniformly on } \mathbb{R} \text{ as } N \to \infty.σN​(f)⟶funiformly on R as N→∞.

This is the full 1904 statement: no restriction to pointwise convergence, and no extra regularity assumed on fff beyond continuity.

Significance

The result itself. Fejér's theorem gives the first universally valid summation method for the Fourier series of a continuous function, closing the gap left open by pointwise convergence tests that need extra regularity. It also yields, essentially for free, a proof of the Weierstrass approximation theorem on the circle — the trigonometric polynomials σN(f)\sigma_N(f)σN​(f) are dense in the continuous 2π2\pi2π-periodic functions under the uniform norm — and it is the historical prototype of the good-kernel/approximate-identity method underlying Poisson summation, heat-kernel smoothing, and L1L^1L1 Fourier-inversion arguments.

Formalizing it. Mathlib currently has no infrastructure for this at all. Mathlib.Analysis.Fourier.AddCircle defines Fourier coefficients on the circle and proves L2L^2L2 convergence (Parseval's identity, via the orthonormal Fourier basis), but it has no notion of a partial sum, no Dirichlet or Fejér kernel, and no pointwise or uniform convergence result for Fourier series of any kind. This mission builds that classical convergence theory — the Fejér kernel, its closed form and positivity, the good-kernel estimates, and the uniform convergence theorem itself — from first principles.

Difficulty

The obvious first attempt is to bound ∣σN(f)(θ)−f(θ)∣|\sigma_N(f)(\theta) - f(\theta)|∣σN​(f)(θ)−f(θ)∣ termwise from the individual Fourier coefficients. This fails outright: a continuous function's Fourier coefficients need not be absolutely summable, which is exactly the mechanism behind du Bois-Reymond's divergence example. The real difficulty is representing σN(f)\sigma_N(f)σN​(f) as a convolution,

σN(f)(θ)=12π∫−ππf(θ−φ) FN(φ) dφ,\sigma_N(f)(\theta) = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(\theta - \varphi)\, F_N(\varphi)\, d\varphi,σN​(f)(θ)=2π1​∫−ππ​f(θ−φ)FN​(φ)dφ,

against the Fejér kernel FNF_NFN​, and then proving FNF_NFN​ is a good kernel: nonnegative, integrating to 111 over one period, and — the genuinely quantitative step — with its mass outside any fixed neighborhood of 000 vanishing as N→∞N \to \inftyN→∞. That last estimate needs the closed form

FN(θ)=1N+1(sin⁡((N+1)θ/2)sin⁡(θ/2))2,F_N(\theta) = \frac{1}{N+1}\left(\frac{\sin((N+1)\theta/2)}{\sin(\theta/2)}\right)^2,FN​(θ)=N+11​(sin(θ/2)sin((N+1)θ/2)​)2,

which carries a removable singularity at θ=0\theta = 0θ=0 that must be handled carefully, together with a genuine decay estimate — via a lower bound on ∣sin⁡(θ/2)∣|\sin(\theta/2)|∣sin(θ/2)∣ — valid uniformly outside any fixed δ\deltaδ-neighborhood of the origin.

Formalization scope

fff is complex-valued, and only continuity together with exact 2π2\pi2π-periodicity is assumed — no differentiability, no bounded variation, no realness. Uniform convergence is stated with Mathlib's TendstoUniformly. The period is fixed at 2π2\pi2π, matching the classical circle-group convention, rather than a general T>0T > 0T>0; the TTT-periodic statement is a routine rescaling of this one and is not separately targeted here. One route to a trivializing formalization is worth ruling out explicitly: assuming any extra regularity on fff (differentiability, bounded variation, Lipschitz continuity) would let the uniform-convergence conclusion follow from the much easier Dirichlet-kernel estimates, and would no longer be Fejér's theorem — the entire content of the result is that continuity alone suffices.

The needed infrastructure is the four definitions above (Fourier coefficient, partial sum, Cesàro mean, Fejér kernel) and the milestone lemmas below, culminating in the goal. The Fejér kernel's closed form, positivity, and good-kernel estimates are reusable well beyond this mission: directly for a Lean proof of the Weierstrass approximation theorem on the circle, and for any future development that needs an explicit approximate identity on the circle group. Contributions are welcome at every milestone; the concentration estimate is the analytic heart of the mission and a natural place to start.

Selected references

  • L. Fejér, "Untersuchungen über Fouriersche Reihen," Mathematische Annalen 58 (1904), 51–69.
  • E. M. Stein and R. Shakarchi, Fourier Analysis: An Introduction, Princeton Lectures in Analysis I, Princeton University Press, 2003, Chapter 2, §5 ("Good Kernels") and Theorem 5.2.
  • Wikipedia, "Fejér's theorem." https://en.wikipedia.org/wiki/Fej%C3%A9r%27s_theorem
10 thms2 active usersReviewed
🏆Completed
Functional AnalysisProbability·Captain: Elsie66

Bochner's Theorem: Positive-Definite FunctionsTextbook

Motivation

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 algebraic condition is exactly what makes fff realizable as: the covariance kernel of a stationary stochastic process; the characteristic function of a random variable (up to normalization); a valid Mercer/RBF kernel in machine learning; or a valid random-features/spectral density in random-feature kernel approximation methods.

Bochner's theorem (1932) is the structural reason all of these examples work: it says positive-definiteness is not merely a necessary condition for such a representation, but exactly characterizes it. A continuous, normalized (f(0)=1f(0)=1f(0)=1) function is positive-definite if and only if it is the Fourier–Stieltjes transform of some probability measure ν\nuν on R\mathbb RR — i.e. fff is the characteristic function of a random variable. This mission asks for a machine-checked proof of that theorem, together with its most useful corollary: the case where fff is additionally Lebesgue-integrable, so that ν\nuν has an explicit continuous density given directly by the ordinary Fourier transform of fff.

Setting

Fix IsPositiveDefinite f as above, for f:R→Cf:\mathbb R\to\mathbb Cf:R→C (not restricted to real-valued kernels — the standard, fully general statement). A positive-definite function is automatically Hermitian-symmetric, f(−x)=f(x)‾f(-x)=\overline{f(x)}f(−x)=f(x)​ (IsPositiveDefinite.conj_neg), which is exactly what makes a representation by a genuine (positive) probability measure possible, rather than a signed or complex one. The theorem works with f continuous and normalized. No further hypothesis (in particular, no integrability of f) is assumed for the general representation theorem: the representing measure ν\nuν need not be absolutely continuous (e.g. for a periodic fff, ν\nuν is a discrete measure supported on the harmonics of the period — this is Herglotz's 1911 theorem, the periodic special case). Under the extra hypothesis that f is Lebesgue-integrable, the representing measure becomes absolutely continuous with a continuous density: this density is fourierTransform f, the (real part of the) Fourier transform of f — automatically real-valued, again by Hermitian symmetry — and Fourier inversion recovers f from it.

Formalization targets

Goal — Bochner's theorem, general case

f continuous, positive-definite, f(0)=1  ⟹  ∃ ν a probability measure on R,  ∀x,  f(x)=∫Rei2πξx dν(ξ).f \text{ continuous, positive-definite, } f(0)=1 \;\Longrightarrow\; \exists\, \nu \text{ a probability measure on } \mathbb R,\; \forall x,\; f(x) = \int_{\mathbb R} e^{i2\pi\xi x}\,d\nu(\xi).f continuous, positive-definite, f(0)=1⟹∃ν a probability measure on R,∀x,f(x)=∫R​ei2πξxdν(ξ).

The central representation theorem: no integrability hypothesis on fff, so ν\nuν may be any probability measure, not necessarily a density.

Milestone — Bochner's theorem, L¹ (density) case

f continuous, integrable, positive-definite, f(0)=1  ⟹  τ:=fourierTransform f is continuous,  τ≥0,  ∫τ=1, and f(x)=∫ei2πξxτ(ξ) dξ.f \text{ continuous, integrable, positive-definite, } f(0)=1 \;\Longrightarrow\; \tau:=\text{fourierTransform } f \text{ is continuous}, \;\tau \ge 0,\; \int \tau = 1, \text{ and } f(x) = \int e^{i2\pi\xi x}\tau(\xi)\,d\xi.f continuous, integrable, positive-definite, f(0)=1⟹τ:=fourierTransform f is continuous,τ≥0,∫τ=1, and f(x)=∫ei2πξxτ(ξ)dξ.

The special case where the representing measure of the goal theorem is absolutely continuous with an explicit density — the form most directly usable in applications. Provable independently of the general goal theorem via classical Fourier-inversion machinery, so it is a natural, self-contained first target.

Significance

Bochner's theorem is one of the load-bearing structural results of 20th-century harmonic analysis: it underlies Bochner–Minlos-type theorems for random fields, the entire theory of stationary Gaussian processes, kernel methods in statistics and machine learning, and (via its periodic specialization, Herglotz's theorem) the spectral theory of stationary time series. Formalizing it gives the platform a reusable, general-purpose characterization of positive-definite functions that any future mission on kernel methods, random features, or characteristic functions can build on directly.

Difficulty

The general representation theorem is the harder target: the standard proof (see the Wikipedia article linked below) constructs, from f, a strongly continuous unitary representation of R\mathbb RR on a Hilbert space via a GNS-type construction, then invokes Stone's theorem and the spectral theorem to extract the representing measure — a substantial functional-analytic argument, since f need not be integrable and ν\nuν need not have a density. The L¹ milestone is comparatively more tractable: it can be attacked directly via Mathlib's existing Fourier-transform and Fourier-inversion machinery for integrable functions, plus the elementary fact (already available for reuse: IsPositiveDefinite.conj_neg) that a positive-definite function is Hermitian-symmetric.

Formalization scope

IsPositiveDefinite is formalized exactly as the finite Hermitian-form condition above, over Fin n → ℝ point families and Fin n → ℂ coefficients, matching the standard convention in the literature, with f : ℝ → ℂ — the fully general, complex-valued statement, not restricted to real-valued kernels. fourierTransform f ξ is defined as the real part of ∫ Complex.exp(-i2πξ x) * f(x) dx; this is provably the exact (not merely real-part-of) Fourier transform once f is positive-definite, since Hermitian symmetry forces the integral to be real already.

Selected references

  • Bochner's theorem, Wikipedia — states the general locally-compact-abelian-group form and sketches the unitary-representation proof; a good map of the territory before diving into either target.
  • Salomon Bochner, Vorlesungen über Fouriersche Integrale, Akademische Verlagsgesellschaft, 1932.
  • Gustav Herglotz, Über Potenzreihen mit positivem, reellem Teil im Einheitskreis, Berichte über die Verhandlungen der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, 1911.
  • Walter Rudin, Fourier Analysis on Groups, Interscience, 1962, Chapter 1.
8 thms2 active usersReviewed
🏆Completed
Partial Differential Equations·Captain: Mazecto

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

Motivation

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 asymptotic analysis of pseudoholomorphic curves in symplectisations, this estimate appears as formula (49): on a disc BBB of radius RRR, every smooth map φ\varphiφ supported in the interior of BBB satisfies

∥φ∥Wk,p(B)≤M(k,p,R) ∥∂ˉφ∥Wk−1,p(B),k≥1, p>1.\|\varphi\|_{W^{k,p}(B)}\le M(k,p,R)\,\|\bar\partial\varphi\|_{W^{k-1,p}(B)},\qquad k\ge1,\ p>1 .∥φ∥Wk,p(B)​≤M(k,p,R)∥∂ˉφ∥Wk−1,p(B)​,k≥1, p>1.

Hofer–Wysocki–Zehnder cite it from E. M. Stein's Singular Integrals and Differentiability Properties of Functions and from Abbas–Hofer's Holomorphic Curves and Global Questions in Contact Geometry.

This mission formalizes estimate (49), together with the core of the real-variable theory of singular integrals on Rd\mathbb{R}^dRd from Stein, Chapters I–III, and the L2L^2L2 and LpL^pLp estimates for ar\partial of Abbas–Hofer, § 4.2. None of these results is in Mathlib, which has no Hardy–Littlewood maximal function, no Calderón–Zygmund decomposition, no Marcinkiewicz interpolation theorem and no LpL^pLp theory of singular integral operators.

Setting

  • Rd\mathbb{R}^dRd carries Lebesgue measure mmm, and ∥⋅∥p\|\cdot\|_p∥⋅∥p​ is the Lp(Rd)L^p(\mathbb{R}^d)Lp(Rd) norm for complex-valued functions.
  • Maximal function. Mf(x)=sup⁡r>0m(B(x,r))−1∫B(x,r)∣f∣∈[0,∞]Mf(x)=\sup_{r>0}m(B(x,r))^{-1}\int_{B(x,r)}|f|\in[0,\infty]Mf(x)=supr>0​m(B(x,r))−1∫B(x,r)​∣f∣∈[0,∞].
  • Weak type. An operator TTT is of weak type (q,q)(q,q)(q,q), q<∞q<\inftyq<∞, if m{∣Tf∣>α}≤(A∥f∥q/α)qm\{|Tf|>\alpha\}\le(A\|f\|_q/\alpha)^qm{∣Tf∣>α}≤(A∥f∥q​/α)q for all α>0\alpha>0α>0, and of strong type (p,p)(p,p)(p,p) if ∥Tf∥p≤A∥f∥p\|Tf\|_p\le A\|f\|_p∥Tf∥p​≤A∥f∥p​.
  • Truncated singular integrals. For a kernel KKK on Rd∖{0}\mathbb{R}^d\setminus\{0\}Rd∖{0} and ε>0\varepsilon>0ε>0, Tεf(x)=∫∣y∣≥εf(x−y)K(y) dyT_\varepsilon f(x)=\int_{|y|\ge\varepsilon}f(x-y)K(y)\,dyTε​f(x)=∫∣y∣≥ε​f(x−y)K(y)dy.
  • Cauchy–Riemann operator. For φ:C→Cn\varphi:\mathbb{C}\to\mathbb{C}^nφ:C→Cn and z=s+itz=s+itz=s+it, ∂ˉφ=φs+iφt\bar\partial\varphi=\varphi_s+i\varphi_t∂ˉφ=φs​+iφt​ (without the factor 12\tfrac1221​).
  • Sobolev norms of smooth maps on a set U⊂CU\subset\mathbb{C}U⊂C: ∥φ∥Wk,p(U)=∑j≤k∥Djφ∥Lp(U)\|\varphi\|_{W^{k,p}(U)}=\sum_{j\le k}\|D^j\varphi\|_{L^p(U)}∥φ∥Wk,p(U)​=∑j≤k​∥Djφ∥Lp(U)​, where DjφD^j\varphiDjφ is the jjj-th derivative.

Formalization targets

Goal: the Wk,pW^{k,p}Wk,p estimate for ∂ˉ\bar\partial∂ˉ on a disc

For an integer k≥1k\ge1k≥1, p>1p>1p>1 and R>0R>0R>0 there is M=M(k,p,R)M=M(k,p,R)M=M(k,p,R) such that for every disc B⊂CB\subset\mathbb{C}B⊂C of radius RRR and every smooth φ:C→Cn\varphi:\mathbb{C}\to\mathbb{C}^nφ:C→Cn supported in the interior of BBB, ∥φ∥Wk,p(B)≤M∥∂ˉφ∥Wk−1,p(B)\|\varphi\|_{W^{k,p}(B)}\le M\|\bar\partial\varphi\|_{W^{k-1,p}(B)}∥φ∥Wk,p(B)​≤M∥∂ˉφ∥Wk−1,p(B)​ (Hofer–Wysocki–Zehnder I, estimate (49), p. 366).

Milestones

  1. Maximal theorem. MfMfMf is finite a.e. for f∈Lpf\in L^pf∈Lp, 1≤p≤∞1\le p\le\infty1≤p≤∞; MMM is of weak type (1,1)(1,1)(1,1) and of strong type (p,p)(p,p)(p,p) for 1<p≤∞1<p\le\infty1<p≤∞ (Stein I, § 1.3, Theorem 1).
  2. Calderón–Zygmund decomposition. A non-negative integrable fff and a height α>0\alpha>0α>0 give Rd=F∪Ω\mathbb{R}^d=F\cup\OmegaRd=F∪Ω with f≤αf\le\alphaf≤α a.e. on FFF and Ω\OmegaΩ a union of cubes with disjoint interiors on which the average of fff lies in (α,2dα](\alpha,2^d\alpha](α,2dα] (Stein I, § 3.2, Theorem 4).
  3. Marcinkiewicz interpolation theorem. A sub-additive operator of weak types (1,1)(1,1)(1,1) and (r,r)(r,r)(r,r), 1<r≤∞1<r\le\infty1<r≤∞, is of strong type (p,p)(p,p)(p,p) for 1<p<r1<p<r1<p<r (Stein I, § 4.2, Theorem 5).
  4. Convolution kernels with bounded Fourier transform. If K∈L2K\in L^2K∈L2, ∣K^∣≤B|\hat K|\le B∣K^∣≤B and ∣∇K(x)∣≤B∣x∣−d−1|\nabla K(x)|\le B|x|^{-d-1}∣∇K(x)∣≤B∣x∣−d−1, then f↦K∗ff\mapsto K*ff↦K∗f is bounded on LpL^pLp, 1<p<∞1<p<\infty1<p<∞, with a constant depending only on ppp, BBB, ddd (Stein II, § 2.2, Theorem 1).
  5. Truncated singular integrals. If ∣K(x)∣≤B∣x∣−d|K(x)|\le B|x|^{-d}∣K(x)∣≤B∣x∣−d, ∫∣x∣≥2∣y∣∣K(x−y)−K(x)∣ dx≤B\int_{|x|\ge2|y|}|K(x-y)-K(x)|\,dx\le B∫∣x∣≥2∣y∣​∣K(x−y)−K(x)∣dx≤B and KKK has integral zero over every annulus, then the truncations TεT_\varepsilonTε​ are bounded on LpL^pLp uniformly in ε\varepsilonε and converge in LpL^pLp as ε→0\varepsilon\to0ε→0 (Stein II, § 3.2, Theorem 2).
  6. Homogeneous kernels. The same conclusion for K(y)=Ω(y)/∣y∣dK(y)=\Omega(y)/|y|^dK(y)=Ω(y)/∣y∣d with Ω\OmegaΩ homogeneous of degree 000, of mean zero on the unit sphere and Dini-continuous there (Stein II, § 4.2, Theorem 3 (a), (b)).
  7. The Cauchy–Riemann estimate on the plane. ∥∂1f∥p+∥∂2f∥p≤Ap∥∂1f+i∂2f∥p\|\partial_1f\|_p+\|\partial_2f\|_p\le A_p\|\partial_1f+i\partial_2f\|_p∥∂1​f∥p​+∥∂2​f∥p​≤Ap​∥∂1​f+i∂2​f∥p​ for compactly supported C1C^1C1 functions f:R2→Cf:\mathbb{R}^2\to\mathbb{C}f:R2→C, 1<p<∞1<p<\infty1<p<∞ (Stein III, § 1.3, Proposition 4).
  8. L2L^2L2 identity. ∥∂ˉφ∥L22=∥φs∥L22+∥φt∥L22\|\bar\partial\varphi\|_{L^2}^2=\|\varphi_s\|_{L^2}^2+\|\varphi_t\|_{L^2}^2∥∂ˉφ∥L22​=∥φs​∥L22​+∥φt​∥L22​ for smooth compactly supported φ:C→Cn\varphi:\mathbb{C}\to\mathbb{C}^nφ:C→Cn (Abbas–Hofer, § 4.2, (4.4)).
  9. L2L^2L2 estimate on a disc. ∥φs∥L22+∥φt∥L22+∥φ∥L22≤(4R2+1)∥∂ˉφ∥L22\|\varphi_s\|_{L^2}^2+\|\varphi_t\|_{L^2}^2+\|\varphi\|_{L^2}^2\le(4R^2+1)\|\bar\partial\varphi\|_{L^2}^2∥φs​∥L22​+∥φt​∥L22​+∥φ∥L22​≤(4R2+1)∥∂ˉφ∥L22​ for φ\varphiφ with compact support in BR(0)B_R(0)BR​(0) (Abbas–Hofer, Theorem 4.2.1).
  10. LpL^pLp estimate on a disc. ∥φ∥W1,p≤c(p,R)∥∂ˉφ∥Lp\|\varphi\|_{W^{1,p}}\le c(p,R)\|\bar\partial\varphi\|_{L^p}∥φ∥W1,p​≤c(p,R)∥∂ˉφ∥Lp​ for φ\varphiφ with compact support in BR(0)B_R(0)BR​(0), 1<p<∞1<p<\infty1<p<∞ (Abbas–Hofer, Theorem 4.2.2).

Significance

The result. The Wk,pW^{k,p}Wk,p estimate for ∂ˉ\bar\partial∂ˉ is the analytic input behind elliptic bootstrapping for pseudoholomorphic curves: interior regularity, C∞C^\inftyC∞ bounds from gradient bounds, removal of singularities, and the Fredholm theory of linearized Cauchy–Riemann operators on Sobolev spaces. In Hofer–Wysocki–Zehnder's work it controls the derivatives of pseudoholomorphic half-cylinders near a nondegenerate periodic orbit.

Formalizing it. The milestones from Stein are the standard real-variable toolkit of harmonic analysis on Rd\mathbb{R}^dRd: the maximal theorem, the Calderón–Zygmund decomposition, Marcinkiewicz interpolation and the LpL^pLp theory of singular integrals with smooth or homogeneous kernels. None of them is in Mathlib, and each is reusable well beyond this mission, for instance for elliptic estimates of other operators, Sobolev embeddings in LpL^pLp, and other LpL^pLp estimates.

Difficulty

The statements are quantitative and the order of quantifiers matters: the constants are chosen before the functions, and in milestones 3 and 4 also before the operator or the kernel, with the dependence stated by the source. Several objects take infinite values or are defined only almost everywhere: the maximal function is valued in [0,∞][0,\infty][0,∞], the case r=∞r=\inftyr=∞ of the interpolation theorem uses a strong-type bound in place of a weak-type one, and the singular integrals are limits in LpL^pLp of absolutely convergent truncated integrals. The Dini condition on Ω\OmegaΩ is a condition on a supremum over pairs of points of the unit sphere. The Cauchy–Riemann statements involve vector-valued maps C→Cn\mathbb{C}\to\mathbb{C}^nC→Cn, real derivatives of all orders and Sobolev norms on discs.

Formalization scope

  • Namespace DbarRegularity. The definition module DbarRegularity_Setting defines maximalFunction, closedCube, dbar and sobolevNorm. The mission is standalone and imports no definitions from other missions.
  • Spaces. Rd\mathbb{R}^dRd is EuclideanSpace ℝ (Fin d) with volume, functions on it are complex-valued, R2\mathbb{R}^2R2 in milestone 7 is EuclideanSpace ℝ (Fin 2), and Cn\mathbb{C}^nCn is EuclideanSpace ℂ (Fin n). Stein's dimension is written ddd throughout, and nnn is the dimension of the target Cn\mathbb{C}^nCn.
  • Norms and exponents. LpL^pLp norms are eLpNorm in ℝ≥0∞. Exponents 1<p<∞1<p<\infty1<p<∞ are real and enter as ENNReal.ofReal p; exponents allowed to be infinite are in ℝ≥0∞. Constants are in ℝ≥0 or ℝ, never in ℝ≥0∞.
  • Derivatives. φs\varphi_sφs​, φt\varphi_tφt​ are fderiv ℝ φ z 1, fderiv ℝ φ z Complex.I; smoothness is ContDiff ℝ ∞ (C∞C^\inftyC∞, not analytic); higher derivatives are iteratedFDeriv ℝ j. Supports are tsupport.
  • Limits. Limits as ε→0\varepsilon\to0ε→0 are along 𝓝[>] 0, in the LpL^pLp seminorm.

Contributions welcome: reusable general lemmas of real-variable harmonic analysis on Rd\mathbb{R}^dRd, and calculus lemmas for smooth compactly supported maps on C\mathbb{C}C.

Selected references

  • E. M. Stein, Singular Integrals and Differentiability Properties of Functions, Princeton Mathematical Series 30, Princeton University Press (1970), Chapters I–III. ISBN 0-691-08079-8.
  • C. Abbas, H. Hofer, Holomorphic Curves and Global Questions in Contact Geometry, Birkhäuser Advanced Texts Basler Lehrbücher, Birkhäuser (2019), § 4.2. https://doi.org/10.1007/978-3-030-11803-7
  • H. Hofer, K. Wysocki, E. Zehnder, Properties of pseudoholomorphic curves in symplectisations I: asymptotics, Ann. Inst. H. Poincaré Anal. Non Linéaire 13(3) (1996), 337–379. http://www.numdam.org/item/AIHPC_1996__13_3_337_0/
  • A. P. Calderón, A. Zygmund, On the existence of certain singular integrals, Acta Math. 88 (1952), 85–139. https://doi.org/10.1007/BF02392130
15 thms1 active userReviewed
🏆Completed
Functional AnalysisSymplectic Geometry·Captain: Mazecto

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

Motivation

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

AS=−J0 ∂t−S(t)A_S = -J_0\,\partial_t - S(t)AS​=−J0​∂t​−S(t)

acts on loops S1→R2nS^1 \to \mathbb{R}^{2n}S1→R2n. It appears wherever a pseudoholomorphic curve approaches a periodic orbit. Near a puncture, a finite-energy curve in a symplectization converges to a Reeb orbit, and in a trivialization along that orbit the linearized Reeb flow is Ψ′=J0SΨ\Psi' = J_0 S \PsiΨ′=J0​SΨ. The operator ASA_SAS​ is the Hessian of the action functional at that orbit. The rate of approach and the winding of the curve around the orbit come from its eigenfunctions (Hofer–Wysocki–Zehnder 1995). In Floer theory the operator −J0∂t−S-J_0\partial_t - S−J0​∂t​−S is the Hessian of the symplectic action at a 111-periodic orbit, and the gradient-flow operator ∂s+AS(s)\partial_s + A_{S(s)}∂s​+AS(s)​ is the linearized Floer operator (Robbin–Salamon 1995).

The operator links functional analysis to the linear algebra of stage I. ASA_SAS​ is nondegenerate, i.e. 000 is not an eigenvalue, exactly when the time-one map Ψ(1)\Psi(1)Ψ(1) of the linearized flow has no eigenvalue 111. Then Ψ∣[0,1]\Psi|_{[0,1]}Ψ∣[0,1]​ lies in SP(n)\mathrm{SP}(n)SP(n) and has a Conley–Zehnder index. The Fredholm index formula for Cauchy–Riemann operators on punctured surfaces is written in terms of the Conley–Zehnder indices of the asymptotic operators at the punctures (Wendl, Lectures on SFT, Lecture 3).

This is stage II of a series that formalizes the Fredholm theory of linearized Cauchy–Riemann operators. Stage I (Conley–Zehnder Index I: Axiomatic Characterization on Paths of Symplectic Matrices) characterizes the Conley–Zehnder index on SP(n)\mathrm{SP}(n)SP(n). This stage sets up the spectral theory of asymptotic operators: the operator itself, self-adjointness, discrete spectrum, compact resolvent, and the dictionary between the kernel of ASA_SAS​ and the time-one map. Later stages are the Fredholm theory of ∂s+AS(s)\partial_s + A_{S(s)}∂s​+AS(s)​ in Banach spaces, elliptic regularity for ∂ˉ\bar\partial∂ˉ, and the index formula.

Setting

S1=R/ZS^1 = \mathbb{R}/\mathbb{Z}S1=R/Z with its Haar probability measure. R2n\mathbb{R}^{2n}R2n has coordinates (q,p)(q,p)(q,p) and the Euclidean inner product, and

J0=(0−IdId0).J_0 = \begin{pmatrix} 0 & -\mathrm{Id}\\ \mathrm{Id} & 0\end{pmatrix}.J0​=(0Id​−Id0​).

S:S1→R2n×2nS : S^1 \to \mathbb{R}^{2n\times 2n}S:S1→R2n×2n is continuous with S(t)T=S(t)S(t)^{\mathsf T} = S(t)S(t)T=S(t) for every ttt.

  • Fourier coefficients. For f∈L2(S1,R2n)f \in L^2(S^1,\mathbb{R}^{2n})f∈L2(S1,R2n) and k∈Zk \in \mathbb{Z}k∈Z, f^k=∫S1e−2πiktf(t) dt∈C2n\hat f_k = \int_{S^1} e^{-2\pi i k t} f(t)\,dt \in \mathbb{C}^{2n}f^​k​=∫S1​e−2πiktf(t)dt∈C2n.
  • Domain. W1,2(S1,R2n)W^{1,2}(S^1,\mathbb{R}^{2n})W1,2(S1,R2n) is the set of f∈L2f \in L^2f∈L2 with ∑k∈Z(1+k2) ∣f^k∣2<∞\sum_{k\in\mathbb{Z}} (1+k^2)\,|\hat f_k|^2 < \infty∑k∈Z​(1+k2)∣f^​k​∣2<∞.
  • The operator. For f∈W1,2f \in W^{1,2}f∈W1,2, ASf=gA_S f = gAS​f=g means g^k=−2πik J0f^k−(Sf)k∧\hat g_k = -2\pi i k\,J_0 \hat f_k - (Sf)^\wedge_kg^​k​=−2πikJ0​f^​k​−(Sf)k∧​ for every kkk, i.e. g=−J0f′−Sfg = -J_0 f' - S fg=−J0​f′−Sf with the derivative taken in L2L^2L2. This is Wendl's (3.4) with period 111.
  • Fundamental solution. Ψ:R→R2n×2n\Psi : \mathbb{R} \to \mathbb{R}^{2n\times2n}Ψ:R→R2n×2n with Ψ(0)=Id\Psi(0) = \mathrm{Id}Ψ(0)=Id and Ψ′(t)=J0S(t)Ψ(t)\Psi'(t) = J_0 S(t)\Psi(t)Ψ′(t)=J0​S(t)Ψ(t). These are the solutions of (−J0∂t−S)Ψ=0(-J_0\partial_t - S)\Psi = 0(−J0​∂t​−S)Ψ=0. For constant SSS, Ψ(t)=exp⁡(tJ0S)\Psi(t) = \exp(tJ_0S)Ψ(t)=exp(tJ0​S) is the path in the signature property of stage I.

Formalization targets

Goal: spectral theory of the asymptotic operator

For every continuous loop SSS of symmetric matrices:

  1. ASA_SAS​ with domain W1,2W^{1,2}W1,2 is self-adjoint on L2(S1,R2n)L^2(S^1,\mathbb{R}^{2n})L2(S1,R2n);
  2. L2(S1,R2n)L^2(S^1,\mathbb{R}^{2n})L2(S1,R2n) has an orthonormal basis of eigenvectors of ASA_SAS​ lying in W1,2W^{1,2}W1,2; the eigenvalues are real, each has finite multiplicity, and they accumulate only at ±∞\pm\infty±∞;
  3. ker⁡AS≅ker⁡(Ψ(1)−Id)\ker A_S \cong \ker(\Psi(1) - \mathrm{Id})kerAS​≅ker(Ψ(1)−Id), where Ψ\PsiΨ is the fundamental solution.

Milestones

  1. Well-defined operator. Exactly one partially defined linear map on L2L^2L2 has graph {(f,ASf)}\{(f, A_S f)\}{(f,AS​f)}.
  2. Domain. The domain of ASA_SAS​ is W1,2W^{1,2}W1,2, and it is dense in L2L^2L2.
  3. Symmetry. ⟨ASf,g⟩=⟨f,ASg⟩\langle A_S f, g\rangle = \langle f, A_S g\rangle⟨AS​f,g⟩=⟨f,AS​g⟩ for f,g∈W1,2f, g \in W^{1,2}f,g∈W1,2.
  4. Self-adjointness.
  5. Discrete spectrum. An orthonormal eigenbasis exists, with eigenvalues of finite multiplicity tending to ±∞\pm\infty±∞.
  6. Compact resolvent. If μ∈R\mu \in \mathbb{R}μ∈R is not an eigenvalue, AS−μ:W1,2→L2A_S - \mu : W^{1,2} \to L^2AS​−μ:W1,2→L2 is bijective and its inverse is a compact operator on L2L^2L2.
  7. Unbounded spectrum. For n≥1n \geq 1n≥1 there are eigenvalues of both signs with arbitrarily large absolute value.
  8. The unperturbed operator. The eigenvalues of −J0∂t-J_0\partial_t−J0​∂t​ are exactly 2πk2\pi k2πk, k∈Zk\in\mathbb{Z}k∈Z, and each eigenspace has dimension 2n2n2n.
  9. Fundamental solution. Ψ\PsiΨ exists and is unique for every continuous loop SSS.
  10. Symplecticity. If SSS is symmetric, Ψ(t)∈Sp(2n)\Psi(t) \in \mathrm{Sp}(2n)Ψ(t)∈Sp(2n) for every ttt.
  11. Kernel. ker⁡AS≅ker⁡(Ψ(1)−Id)\ker A_S \cong \ker(\Psi(1) - \mathrm{Id})kerAS​≅ker(Ψ(1)−Id).
  12. Nondegeneracy. 000 is not an eigenvalue of ASA_SAS​ if and only if Ψ∣[0,1]∈SP(n)\Psi|_{[0,1]} \in \mathrm{SP}(n)Ψ∣[0,1]​∈SP(n).

Significance

The result. These are the analytic facts that every use of asymptotic operators relies on. Self-adjointness and the discrete spectrum define the eigenvalue branches and the spectral flow. The compact resolvent makes AS−μA_S - \muAS​−μ Fredholm of index 000 for every real μ\muμ, and the weighted Sobolev spaces of the later Fredholm theory are chosen with weights avoiding the spectrum. The kernel dictionary identifies nondegenerate asymptotic operators with the paths of stage I. It is the bridge through which Conley–Zehnder indices enter the index formula.

Formalizing it. All results here are classical. Mathlib has partially defined linear maps and their adjoints, the Fourier basis of L2L^2L2 on the circle, and compact operators. It has no Sobolev spaces on the circle, no unbounded operator with discrete spectrum beyond trivial cases, and no first-order differential operator treated as an unbounded operator. This stage builds the first such example. The same pattern applies to other first-order elliptic operators on S1S^1S1, and the library is reusable for spectral flow and for Floer-type operators.

Difficulty

ASA_SAS​ is unbounded and not defined on all of L2L^2L2, so self-adjointness is a statement about the domain of the adjoint, not a symmetry identity. The spectral statements concern the resolvent of a first-order differential operator with non-constant coefficients, as an operator on L2L^2L2. The kernel dictionary relates L2L^2L2 classes, defined through Fourier coefficients, to classical solutions of a linear ODE. The statements about Ψ\PsiΨ concern linear ODEs whose coefficients are only continuous.

Formalization scope

  • Namespace AsymptoticOperator; all definitions are in AsymptoticOperator_Setting, which imports stage I's ConleyZehnder_Setting (for Mat n, J₀, IsSymplectic and SP).
  • The circle is UnitAddCircle (R/Z\mathbb{R}/\mathbb{Z}R/Z) with AddCircle.haarAddCircle. L2(S1,R2n)L^2(S^1,\mathbb{R}^{2n})L2(S1,R2n) is Lp (EuclideanSpace ℝ (Fin n ⊕ Fin n)) 2 haarAddCircle, a real Hilbert space.
  • Fourier coefficients are Mathlib's fourierCoeff, applied to the componentwise complexification R2n→C2n\mathbb{R}^{2n} \to \mathbb{C}^{2n}R2n→C2n. J0J_0J0​ and S(t)S(t)S(t) act on C2n\mathbb{C}^{2n}C2n through the real-to-complex coercion.
  • The operator is a LinearPMap, defined by choice as the map whose graph is the set of pairs (f,g)(f, g)(f,g) satisfying the coefficient identity. The fallback is 000, and milestone 1 makes it unreachable. Self-adjointness is Mathlib's IsSelfAdjoint for LinearPMap, and symmetry is IsFormalAdjoint.
  • Eigenspaces are kernels of AS−μA_S - \muAS​−μ on the domain. The discrete spectrum is stated as a HilbertBasis of eigenvectors whose eigenvalues tend to ∞\infty∞ in absolute value along the cofinite filter. This covers n=0n = 0n=0, where L2=0L^2 = 0L2=0.
  • Regularity of SSS. Wendl assumes SSS smooth; Hofer–Wysocki–Zehnder (§3, (35)) take SSS continuous, as here. HWZ state self-adjointness, compact resolvent and discreteness of the spectrum for n=1n = 1n=1; this mission states them for all nnn.
  • Sign conventions follow Wendl §3.2: AS=−J0∂t−SA_S = -J_0\partial_t - SAS​=−J0​∂t​−S and Ψ′=J0SΨ\Psi' = J_0S\PsiΨ′=J0​SΨ.

Contributions welcome: reusable lemmas on Sobolev spaces of vector-valued functions on the circle (Fourier characterization, continuity of W1,2W^{1,2}W1,2 functions), on unbounded self-adjoint operators with compact resolvent, and on linear ODEs with continuous periodic coefficients.

Selected references

  • C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, Lecture 3 (§§3.2–3.4). https://arxiv.org/abs/1612.01009
  • H. Hofer, K. Wysocki, E. Zehnder, Properties of pseudoholomorphic curves in symplectisations II: Embedding controls and algebraic invariants, Geom. Funct. Anal. 5 (1995), 270–328. https://doi.org/10.1007/BF01895669
  • J. Robbin, D. Salamon, The spectral flow and the Maslov index, Bull. London Math. Soc. 27 (1995), 1–33. https://doi.org/10.1112/blms/27.1.1
  • D. Salamon, Lectures on Floer homology, in: Symplectic Geometry and Topology, IAS/Park City Math. Ser. 7, AMS (1999), 143–229. https://doi.org/10.1090/pcms/007/05
  • J. Gutt, Generalized Conley–Zehnder index, Ann. Fac. Sci. Toulouse Math. (6) 23 (2014), 907–932. https://doi.org/10.5802/afst.1430
34 thms1 active userReviewed
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me