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
AlgebraAnalysisCombinatorics+3·Captain: Lucas

Formal Conjectures Portfolio: Bateman-Horn and CompanionsOpen Problem

1. Motivation

Wikipedia's pages on open problems are, for many mathematicians, the first contact with a conjecture: a one-paragraph statement, a short history, a list of partial results. The Formal Conjectures library (Google DeepMind, Apache-2.0) turned a large part of that material into Lean 4 statements, so that the conjectures can be attacked — and, just as importantly, stated unambiguously — by machine.

This mission ports a coherent slice of that material to Prove2Me. It is deliberately a portfolio mission: the goal theorem is the Bateman–Horn conjecture, the strongest single statement in the collection, and the milestone list gathers the other conjectures and the landmark theorems that surround them. Some milestones are genuine steps toward the goal (the Bunyakovsky conjecture is literally the one-polynomial case); most are independent open problems from other fields, grouped here because they share a source, a level of difficulty, and a need for faithful formal statements. A reader should not assume that proving a milestone advances the goal theorem. The mission's value is that every statement in it has been written against the same Mathlib revision, checked to compile, and documented well enough to be attacked.

A rough timeline of the collection's landmarks:

  • 1947 — Mills: a real A>1A>1A>1 with ⌊A3n⌋\lfloor A^{3^n}\rfloor⌊A3n⌋ always prime.
  • 1962 — Radó: the busy beaver function outgrows every computable function.
  • 1971 — Davies: planar Kakeya sets have Hausdorff dimension 222.
  • 1978 — Apéry: ζ(3)\zeta(3)ζ(3) is irrational.
  • 1985 — Read (after Enflo, 1981): an operator on ℓ1\ell^1ℓ1 with no nontrivial closed invariant subspace.
  • 2001 — Zudilin: one of ζ(5),ζ(7),ζ(9),ζ(11)\zeta(5),\zeta(7),\zeta(9),\zeta(11)ζ(5),ζ(7),ζ(9),ζ(11) is irrational.
  • 2002 — Mihăilescu: 888 and 999 are the only consecutive perfect powers (Catalan's conjecture).
  • 2009 / 2021 — Dvir; Bukh–Chao: the finite-field Kakeya bound and its sharp density constant.
  • 2021 — Gardam: Kaplansky's unit conjecture is false (its zero-divisor and idempotent companions remain open).
  • 2024 — Saito: Mills' constant is irrational; bbchallenge: BB(5)=47 176 870\mathrm{BB}(5)=47\,176\,870BB(5)=47176870.
  • 2025 — Wang–Zahl: the Kakeya set conjecture in R3\mathbb{R}^3R3.

2. Setting

The goal theorem concerns prime values of polynomials. Fix a finite set S={f1,…,fk}⊆Z[X]S=\{f_1,\dots,f_k\}\subseteq\mathbb{Z}[X]S={f1​,…,fk​}⊆Z[X] of distinct polynomials. Say that fff satisfies the Bunyakovsky condition if its leading coefficient is positive, deg⁡f≥1\deg f\ge 1degf≥1, and fff is irreducible over Z\mathbb{Z}Z; say that SSS satisfies the Schinzel condition if for every prime ppp there is an integer nnn with p∤f1(n)⋯fk(n)p\nmid f_1(n)\cdots f_k(n)p∤f1​(n)⋯fk​(n) — i.e. no fixed prime divides the product at every argument.

For a prime ppp let ωp(S)\omega_p(S)ωp​(S) be the number of residue classes n mod pn \bmod pnmodp at which some fif_ifi​ vanishes, let D=∏ideg⁡fiD=\prod_i \deg f_iD=∏i​degfi​, and let

πS(x)=#{ n≤x:∣fi(n)∣ is prime for every i }.\pi_S(x)=\#\{\,n\le x : |f_i(n)| \text{ is prime for every } i\,\}.πS​(x)=#{n≤x:∣fi​(n)∣ is prime for every i}.

The Bateman–Horn constant is the (conditionally convergent) Euler product

C=lim⁡N→∞ ∏p<N(1−1p)−k(1−ωp(S)p).C=\lim_{N\to\infty}\ \prod_{p<N}\Big(1-\tfrac1p\Big)^{-k}\Big(1-\tfrac{\omega_p(S)}{p}\Big).C=N→∞lim​ p<N∏​(1−p1​)−k(1−pωp​(S)​).

The other groups use their own vocabulary, each fixed in a definition item of this mission: Kakeya sets in Rn\mathbb{R}^nRn and over Fq\mathbb{F}_qFq​; Mills' property ⌊A3n⌋∈P\lfloor A^{3^n}\rfloor \in \mathbb{P}⌊A3n⌋∈P; Wagstaff primes and Catalan–Mersenne numbers; polynomial self-maps and their Jacobian matrix; nontrivial closed invariant subspaces; linear extensions of a finite poset; Catalan's constant; and an explicit two-symbol Turing machine model with its maximum-shifts function BB\mathrm{BB}BB.

3. Target

The goal theorem is the Bateman–Horn asymptotic: under the Bunyakovsky and Schinzel hypotheses, CCC exists and is positive and

πS(x) ∼ CD x(log⁡x)k(x→∞).\pi_S(x)\ \sim\ \frac{C}{D}\,\frac{x}{(\log x)^{k}}\qquad (x\to\infty).πS​(x) ∼ DC​(logx)kx​(x→∞).

Weaker statements in the same direction appear as milestones, first of all Bunyakovsky's conjecture: under the same hypotheses with k=1k=1k=1, fff takes prime values infinitely often. The remaining milestones are listed in the milestone panel and are grouped by subject: Diophantine equations (Brocard, Pillai, Lebesgue–Nagell, Catalan/Mihăilescu), Mersenne-type primality (New Mersenne, infinitude of Mersenne primes, Catalan–Mersenne), prime-representing constants (Mills), geometric measure theory (Kakeya in Rn\mathbb{R}^nRn, Kakeya over Fq\mathbb{F}_qFq​, Falconer), operator theory (invariant subspace problem and Read's ℓ1\ell^1ℓ1 counterexample), group algebras (Kaplansky's zero-divisor and idempotent conjectures), affine algebraic geometry (the two-variable Jacobian conjecture), irrationality and transcendence (ζ(5)\zeta(5)ζ(5), all odd zeta values, Zudilin's theorem, e+πe+\pie+π, eπe\pieπ, γ\gammaγ, Catalan's constant), order theory (the 1/31/31/3–2/32/32/3 conjecture), and computability (Radó's theorem).

4. Significance

The results themselves. Bateman–Horn is the quantitative form of Schinzel's hypothesis H: it contains the twin prime conjecture, the infinitude of primes of the form n2+1n^2+1n2+1, and Bunyakovsky as special cases, and it is the standard heuristic behind prime-counting predictions. The other targets are each the headline question of their area: whether every bounded Hilbert-space operator has an invariant subspace; whether group algebras of torsion-free groups are domains; whether Kakeya sets must have full dimension. The solved milestones (Mihăilescu, Davies, Dvir, Zudilin, Read, Saito, Radó) are landmarks whose formal proofs would be significant library contributions in their own right.

Formalizing them. None of the open statements is expected to fall here; the concrete deliverable is a set of faithful, compiling, reusable statements plus formal proofs of the solved milestones, most of which are not in Mathlib today. Several are realistically in reach: the finite-field Kakeya bound (Dvir's polynomial method is short), the elementary fact that π+e\pi+eπ+e and πe\pi eπe cannot both be algebraic, and Radó's diagonal argument.

5. Difficulty

For Bateman–Horn, the obstruction is visible already for k=1k=1k=1, deg⁡f=2\deg f = 2degf=2: sieve methods bound πS(x)\pi_S(x)πS​(x) from above by a constant times the conjectured main term and produce almost-primes, but the parity problem blocks every known sieve from producing a single prime value of an irreducible quadratic. The conditional convergence of the Euler product is a second, smaller trap: the product over p<Np<Np<N must be taken in order, so any reformulation as an unordered infinite product changes the statement.

Each other group has its own obstruction, and they do not transfer: the parity problem says nothing about Kakeya, where the difficulty is that dimension is not stable under the natural compactness arguments, nor about the invariant subspace problem, where the known counterexamples on ℓ1\ell^1ℓ1 show that no soft argument can work.

6. Formalization scope

Conventions this mission commits to, all fixed in the definition items:

  • Polynomials are elements of ℤ[X]; primality of a polynomial value is primality of its absolute value, and the counting function ranges over natural numbers n≤⌊x⌋n \le \lfloor x\rfloorn≤⌊x⌋.
  • The Bateman–Horn constant is the limit of the ordered partial products over p<Np<Np<N, not an unordered infinite product.
  • Kakeya sets carry no compactness or measurability hypothesis, matching the source; the conjecture is stated as an equality of Hausdorff dimensions in [0,∞][0,\infty][0,∞].
  • Falconer's hypothesis is written d<2dim⁡HEd < 2\dim_H Ed<2dimH​E to avoid division in [0,∞][0,\infty][0,∞].
  • Torsion-freeness of a group is spelled out as "every element of finite order is the identity", which is the hypothesis the source intends (it is weaker than Mathlib's IsMulTorsionFree).
  • Linear extensions are order-preserving bijections onto {0,…,∣P∣−1}\{0,\dots,|P|-1\}{0,…,∣P∣−1}, and probabilities are quotients of set cardinalities in Q\mathbb{Q}Q.
  • The busy beaver model is an explicit nnn-state, 222-symbol machine with a bi-infinite Boolean tape; BB\mathrm{BB}BB counts transitions performed (maximum shifts), the halting transition included, and BB(0)=0\mathrm{BB}(0)=0BB(0)=0.
  • Several source statements are phrased as "is XXX true?" with an unknown answer. Prove2Me statements must be definite, so each such question is recorded in its affirmative form (e.g. "e+πe+\pie+π is irrational"); a solver who can refute one should submit a disproof. The one question with no statable answer, "what is BB(6)\mathrm{BB}(6)BB(6)?", is replaced by Radó's growth theorem rather than guessed at.
  • Nothing here is vacuous: each hypothesis set is satisfiable (e.g. closed unit balls are Kakeya sets, and X2+1X^2+1X2+1 satisfies the Bunyakovsky and Schinzel conditions).

Contributions welcome: proofs of the solved milestones; sharper variants; and additional faithful statements from the same source library, which contains far more than fits in one mission.

7. Selected references

  • P. T. Bateman and R. A. Horn, A heuristic asymptotic formula concerning the distribution of prime numbers, Math. Comp. 16 (1962), 363–367. DOI
  • T. Radó, On non-computable functions, Bell System Tech. J. 41 (1962), 877–884. DOI
  • R. O. Davies, Some remarks on the Kakeya problem, Math. Proc. Cambridge Philos. Soc. 69 (1971), 417–421. DOI
  • C. J. Read, A solution to the invariant subspace problem on the space ℓ1\ell_1ℓ1​, Bull. London Math. Soc. 17 (1985), 305–317. DOI
  • K. Falconer, On the Hausdorff dimensions of distance sets, Mathematika 32 (1985), 206–212. DOI
  • W. Zudilin, One of the numbers ζ(5),ζ(7),ζ(9),ζ(11)\zeta(5),\zeta(7),\zeta(9),\zeta(11)ζ(5),ζ(7),ζ(9),ζ(11) is irrational, Russian Math. Surveys 56 (2001), 774–776. DOI
  • P. Mihăilescu, Primary cyclotomic units and a proof of Catalan's conjecture, J. reine angew. Math. 572 (2004), 167–195. DOI
  • Z. Dvir, On the size of Kakeya sets in finite fields, J. Amer. Math. Soc. 22 (2009), 1093–1097. DOI
  • B. Bukh and T.-W. Chao, Sharp density bounds on the finite field Kakeya problem, Discrete Analysis 26 (2021). DOI
  • G. Gardam, A counterexample to the unit conjecture for group rings, Ann. of Math. 194 (2021), 967–979. DOI
  • K. Saito, Mills' constant is irrational, Mathematika 71 (2025), e70027. arXiv:2404.19461
  • H. Wang and J. Zahl, Volume estimates for unions of convex sets, and the Kakeya set conjecture in three dimensions, arXiv:2502.17655
  • Google DeepMind, Formal Conjectures, Apache-2.0, github.com/google-deepmind/formal-conjectures

Provenance note. The Lean statements in this mission are adaptations of the Formal Conjectures library (Apache-2.0), rewritten to depend only on Mathlib and on this mission's own definition items, and checked to compile against the platform's Mathlib revision. Each draft item carries a read-back; those read-backs are non-blind — they were written by the same agent that drafted the statements, and each says so in its first line. They are documentation, not independent testimony.

93 thms14 active usersReviewed
🏆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
Dynamical SystemsMachine LearningProbability·Captain: mikedeng1

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

Motivation

Reservoir computing learns an input/output system from data in two stages. A dynamical system, the reservoir, is driven by the input sequence and its state is recorded; then only a linear readout of that state is trained, by least squares. The echo state network (ESN) is the most widely used reservoir: its state evolves by xt=σ(Axt−1+Czt+ζ)x_t = \sigma(Ax_{t-1} + Cz_t + \zeta)xt​=σ(Axt−1​+Czt​+ζ), with the matrices A,CA, CA,C and the vector ζ\zetaζ drawn at random and never trained. ESNs predict chaotic systems well in practice (Jaeger & Haas, Science 2004), and they are known to be universal: for every fading-memory input/output map some ESN approximates it (Grigoryeva & Ortega, Neural Netw. 2018). Universality does not explain the practice, where the reservoir weights are random and fixed in advance. Gonon, Grigoryeva & Ortega (Ann. Appl. Probab. 2023) prove that an ESN whose weights are drawn from an explicit distribution that does not depend on the target approximates every sufficiently regular target, with an explicit L2L^2L2 error bound. This mission formalizes that result, Theorem 2, and the chain of results its proof rests on.

Setting

Time runs over Z−={0,−1,−2,… }\mathbb Z_- = \{0, -1, -2, \dots\}Z−​={0,−1,−2,…}. Inputs take values in a set DdD_dDd​ with 0∈Dd⊂BM⊂Rd0 \in D_d \subset B_M \subset \mathbb R^d0∈Dd​⊂BM​⊂Rd, where BMB_MBM​ is the closed Euclidean ball of radius M>0M > 0M>0. The input Z=(Zt)t∈Z−Z = (Z_t)_{t \in \mathbb Z_-}Z=(Zt​)t∈Z−​​ is a DdD_dDd​-valued process with law μZ\mu_ZμZ​. The target is a functional H∗:(Dd)Z−→RH^* : (D_d)^{\mathbb Z_-} \to \mathbb RH∗:(Dd​)Z−​→R, the present output as a function of the whole input history. All norms are Euclidean.

Regularity. Fix weights w−i>0w_{-i} > 0w−i​>0 with ∑ii w−i<∞\sum_i i\, w_{-i} < \infty∑i​iw−i​<∞. H∗H^*H∗ is www-Lipschitz with constant L>0L > 0L>0 if ∣H∗(u)−H∗(v)∣≤L∑i≥0w−i∥u−i−v−i∥|H^*(u) - H^*(v)| \le L\sum_{i \ge 0} w_{-i}\|u_{-i} - v_{-i}\|∣H∗(u)−H∗(v)∣≤L∑i≥0​w−i​∥u−i​−v−i​∥. Assumption 1 asks, in addition, for every T≥1T \ge 1T≥1: with q=d(T+1)q = d(T+1)q=d(T+1), the truncation HT∗(z0,…,z−T)=H∗(…,0,z−T,…,z0)H^*_T(z_0, \dots, z_{-T}) = H^*(\dots, 0, z_{-T}, \dots, z_0)HT∗​(z0​,…,z−T​)=H∗(…,0,z−T​,…,z0​) has a Fourier representation HT∗(u)=∫Rqei⟨w,u⟩gT(w) dwH^*_T(u) = \int_{\mathbb R^q} e^{i\langle w, u\rangle} g_T(w)\,dwHT∗​(u)=∫Rq​ei⟨w,u⟩gT​(w)dw on (Dd)T+1(D_d)^{T+1}(Dd​)T+1, with gT∈L1g_T \in L^1gT​∈L1 and ∫max⁡(1,∥w∥3)∣gT(w)∣2 dw<∞\int \max(1, \|w\|^3)|g_T(w)|^2\,dw < \infty∫max(1,∥w∥3)∣gT​(w)∣2dw<∞.

The random ESN. Fix T,N≥1T, N \ge 1T,N≥1, R>0R > 0R>0, and a bound MTM_TMT​ with ∥(Z0,…,Z−T)∥≤MT\|(Z_0, \dots, Z_{-T})\| \le M_T∥(Z0​,…,Z−T​)∥≤MT​ almost surely. Draw A1,…,ANA_1, \dots, A_NA1​,…,AN​ i.i.d. uniform on BR⊂RqB_R \subset \mathbb R^qBR​⊂Rq and, independently, ζ1,…,ζN\zeta_1, \dots, \zeta_Nζ1​,…,ζN​ i.i.d. uniform on [−max⁡(MTR,1),max⁡(MTR,1)][-\max(M_TR,1), \max(M_TR,1)][−max(MT​R,1),max(MT​R,1)]. With SSS the block shift on Rq\mathbb R^qRq and ccc the embedding of Rd\mathbb R^dRd into the first block, and aaa the matrix with rows Ai⊤A_i^\topAi⊤​, put

Aˉ=(S0aS0),Cˉ=(cac),ζˉ=(0ζ),A=(Aˉ−Aˉ−AˉAˉ),C=(Cˉ−Cˉ),ζ=(ζˉ−ζˉ).\bar A = \begin{pmatrix} S & 0\\ aS & 0\end{pmatrix},\quad \bar C = \begin{pmatrix} c\\ ac\end{pmatrix},\quad \bar\zeta = \begin{pmatrix} 0\\ \zeta\end{pmatrix},\quad A = \begin{pmatrix}\bar A & -\bar A\\ -\bar A & \bar A\end{pmatrix},\quad C = \begin{pmatrix}\bar C\\ -\bar C\end{pmatrix},\quad \zeta = \begin{pmatrix}\bar\zeta\\ -\bar\zeta\end{pmatrix}.Aˉ=(SaS​00​),Cˉ=(cac​),ζˉ​=(0ζ​),A=(Aˉ−Aˉ​−AˉAˉ​),C=(Cˉ−Cˉ​),ζ=(ζˉ​−ζˉ​​).

The ESN is Xt=σ(AXt−1+CZt+ζ)X_t = \sigma(AX_{t-1} + CZ_t + \zeta)Xt​=σ(AXt−1​+CZt​+ζ), Yt=WXtY_t = WX_tYt​=WXt​, with σ(x)=max⁡(x,0)\sigma(x) = \max(x, 0)σ(x)=max(x,0) and state space R2(N+d(T+1))\mathbb R^{2(N+d(T+1))}R2(N+d(T+1)).

Formalization targets

Goal: Theorem 2 (p. 54)

For every H∗H^*H∗ satisfying Assumption 1 there is a readout WWW, a function of the random weights alone, such that the ESN has the echo state property (a unique state sequence for every input) and

E[∣Y0−H∗(Z)∣2]1/2≤CT,RN+∫Rq∖BR∣gT(u)∣ du+LM∑i>Tw−i,\mathbb E\big[|Y_0 - H^*(Z)|^2\big]^{1/2} \le \frac{\sqrt{C_{T,R}}}{\sqrt N} + \int_{\mathbb R^q \setminus B_R}|g_T(u)|\,du + LM\sum_{i > T} w_{-i},E[∣Y0​−H∗(Z)∣2]1/2≤N​CT,R​​​+∫Rq∖BR​​∣gT​(u)∣du+LMi>T∑​w−i​,

with CT,R=16max⁡(MTR,1)Volq(BR)(MT+1)2(MT3+MT+16)∫BRmax⁡(1,∥u∥3)∣gT(u)∣2 duC_{T,R} = 16\max(M_TR,1)\mathrm{Vol}_q(B_R)(M_T+1)^2(M_T^3+M_T+16)\int_{B_R}\max(1,\|u\|^3)|g_T(u)|^2\,duCT,R​=16max(MT​R,1)Volq​(BR​)(MT​+1)2(MT3​+MT​+16)∫BR​​max(1,∥u∥3)∣gT​(u)∣2du.

Milestones

  1. (8), p. 33: a scalar identity expressing eiz−iz−1e^{iz} - iz - 1eiz−iz−1 as an integral of ReLU ramps.
  2. Proposition 2, pp. 31–32: under a Fourier condition, fff is an integral of ReLU ridge functions with a compactly supported, square-integrable weight π\piπ.
  3. Proposition 3, pp. 41–42: a static ReLU network with uniformly sampled inner weights achieves mean-square error C∗/NC^*/NC∗/N.
  4. Corollary 1, p. 43: the same with a dimension-free integrability condition and a truncation term.
  5. Remark 10, p. 53: the shift reservoir is nilpotent, has K=IK = IK=I and stores the last T+1T+1T+1 inputs.
  6. Proposition 6, p. 51: a linear reservoir with a random ReLU readout satisfies the bound (54).
  7. (64)–(66), pp. 55–56: every solution of the ESN reduces to the linear shift reservoir, which gives uniqueness.

Significance

Theorem 2 is the first approximation bound for echo state networks whose recurrent and input weights are sampled from a generic distribution rather than constructed from the target. The bound separates three error sources: a Monte Carlo term decaying like N−1/2N^{-1/2}N−1/2, a truncation term in the sampling radius RRR, and a memory term in the window length TTT. Because the readout can be taken to be the least-squares readout, the bound also controls the trained networks used in practice, and it is the input to the paper's rate and universality corollaries (Corollaries 4 and 5).

Status: the result is proved on paper. No part of it is formalized; the only reservoir-computing material on the platform is the published definition ReservoirESN (the state equation), which this mission reuses. A formal proof would supply the first machine-checked random-feature approximation bound with explicit constants.

Difficulty

The obvious argument fails in two places. First, the classical integral representations of Barron type place the inner weights on unbounded sets, which cannot be sampled uniformly; Proposition 2 needs a change of variables that makes the weight compactly supported while keeping it square integrable, and this costs the factor R−(2q+2)R^{-(2q+2)}R−(2q+2) and the condition (5). Second, a ReLU network is not contractive, so the echo state property of the ESN cannot be taken from the standard contraction criterion; it has to be derived from the block structure of AAA, which makes the difference of the two state halves follow a nilpotent linear recursion.

Formalization scope

Rq\mathbb R^qRq is EuclideanSpace ℝ (Fin (T+1) × Fin d), block kkk holding z−kz_{-k}z−k​; input sequences are ℕ → EuclideanSpace ℝ (Fin d) with index k=−tk = -tk=−t, and xt=F(xt−1,zt)x_t = F(x_{t-1}, z_t)xt​=F(xt−1​,zt​) is the published ReservoirESN.IsSolution. Points of Rq+1\mathbb R^{q+1}Rq+1 are pairs with norm (∥w∥2+u2)1/2(\|w\|^2 + u^2)^{1/2}(∥w∥2+u2)1/2. The uniform laws are Lebesgue measure conditioned on the ball or interval; NNN i.i.d. rows have the product law. The input is independent of the weights (§4.1) and DdD_dDd​-valued with 0∈Dd⊂BM0 \in D_d \subset B_M0∈Dd​⊂BM​ (§5.1): expectations are iterated lower Lebesgue integrals over μZ\mu_ZμZ​ and the product law, and probability-(1−δ)(1-\delta)(1−δ) statements bound the product measure of the bad set. The scalar output case m=1m = 1m=1 is used, as in the paper. Assumption 1 is required for every T≥1T \ge 1T≥1, as printed.

A readout allowed to depend on the input would make every bound trivial; in every statement the readout is a measurable function of the inner weights alone.

Departures from the print, each disclosed in the item: the last term of Proposition 6 is the L2(μZ)L^2(\mu_Z)L2(μZ​) norm of ∥K−1ST+1X−T−1∥\|K^{-1}S^{T+1}X_{-T-1}\|∥K−1ST+1X−T−1​∥, which the page prints outside the expectation; the state space of the linear reservoir (52) is a parameter DND_NDN​, as in §2.1, and its solution is assumed to be a random process; Proposition 3 omits "C∗>0C^* > 0C∗>0" (the explicit value (33) is used); measurability of the Fourier density ggg is stated where the page leaves it implicit.

A complete development needs Fourier integrals on Euclidean spaces, change of variables under linear maps, product measures and Fubini–Tonelli, and an importance-sampling variance bound. The static results (Propositions 2, 3, Corollary 1) are reusable for random-feature models beyond reservoir computing. Proofs of any milestone, and alternative arguments, are welcome.

Selected references

  • L. Gonon, L. Grigoryeva, J.-P. Ortega, Approximation bounds for random neural networks and reservoir systems, Ann. Appl. Probab. 33(1), 28–69, 2023. https://doi.org/10.1214/22-AAP1806
  • L. Grigoryeva, J.-P. Ortega, Echo state networks are universal, Neural Netw. 108, 495–508, 2018. https://doi.org/10.1016/j.neunet.2018.08.025
  • H. Jaeger, H. Haas, Harnessing nonlinearity: predicting chaotic systems and saving energy in wireless communication, Science 304, 78–80, 2004. https://doi.org/10.1126/science.1091277
  • A. R. Barron, Universal approximation bounds for superpositions of a sigmoidal function, IEEE Trans. Inf. Theory 39, 930–945, 1993. https://doi.org/10.1109/18.256500
  • J. M. Klusowski, A. R. Barron, Approximation by combinations of ReLU and squared ReLU ridge functions with ℓ1 and ℓ0 controls, IEEE Trans. Inf. Theory 64, 7649–7656, 2018. https://doi.org/10.1109/tit.2018.2874447
  • C. Cuchiero, L. Gonon, L. Grigoryeva, J.-P. Ortega, J. Teichmann, Discrete-time signatures and randomness in reservoir computing, IEEE Trans. Neural Netw. Learn. Syst., 2021. https://doi.org/10.1109/TNNLS.2021.3076777
11 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

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

Motivation

Maximizing a homogeneous polynomial ppp over the unit sphere, pmax⁡=max⁡x∈Sd−1p(x)p_{\max}=\max_{x\in S^{d-1}}p(x)pmax​=maxx∈Sd−1​p(x), covers the largest stable set of a graph (degree three), the 2→42\to42→4 norm of a matrix (degree four) and the best separable state problem of quantum information. For quadratic ppp it is an eigenvalue problem; for degree at least three it is NP-hard. The sum-of-squares hierarchy of Parrilo and Lasserre replaces "γ−p≥0\gamma-p\ge0γ−p≥0 on the sphere" by "γ−p\gamma-pγ−p is a sum of squares of polynomials of degree at most ℓ\ellℓ on the sphere", giving upper bounds pℓ≥pmax⁡p_\ell\ge p_{\max}pℓ​≥pmax​ that are computable by a semidefinite program of size dO(ℓ)d^{O(\ell)}dO(ℓ) and decrease to pmax⁡p_{\max}pmax​. How fast they converge decides how large ℓ\ellℓ has to be for a given accuracy. Fang–Fawzi, §1–1.1

Timeline:

  • 1995. Reznick shows, for pmin⁡=0p_{\min}=0pmin​=0, that pℓ/pmax⁡→1p_\ell/p_{\max}\to1pℓ​/pmax​→1 at rate d/ℓd/\elld/ℓ for ℓ\ellℓ large enough. Rez95
  • 2012. Doherty and Wehner study the same hierarchy on the hypersphere and obtain the same rate. DW12
  • 2019. De Klerk and Laurent prove a rate O(1/ℓ2)O(1/\ell^2)O(1/ℓ2) for a hierarchy of lower bounds on pmax⁡p_{\max}pmax​, and ask whether the upper bounds pℓp_\ellpℓ​ converge at the same rate. dKL19
  • 2019. Fang and Fawzi answer this: for ℓ≥Cnd\ell\ge C_ndℓ≥Cn​d the error is O((d/ℓ)2)O((d/\ell)^2)O((d/ℓ)2), and the statement holds for symmetric matrix-valued polynomials with constants that do not depend on the matrix size. Fang–Fawzi, Theorems 1–2

Setting

Write x=(x1,…,xd)x=(x_1,\dots,x_d)x=(x1​,…,xd​), ∥x∥2=∑ixi2\|x\|^2=\sum_ix_i^2∥x∥2=∑i​xi2​, and Sd−1={x∈Rd:∥x∥2=1}S^{d-1}=\{x\in\mathbb R^d:\|x\|^2=1\}Sd−1={x∈Rd:∥x∥2=1}. A k×kk\times kk×k matrix polynomial FFF has a real polynomial in each entry, and F(x)F(x)F(x) is the real matrix of values. A⪰0A\succeq0A⪰0 means that the symmetric matrix AAA is positive semidefinite. A matrix polynomial GGG is ℓ\ellℓ-sos on Sd−1S^{d-1}Sd−1 if there are finitely many k×kk\times kk×k matrix polynomials UjU_jUj​, each entry of total degree at most ℓ\ellℓ, with

G(x)=∑jUj(x)Uj(x)Tfor all x∈Sd−1.G(x)=\sum_jU_j(x)U_j(x)^{\mathsf T}\qquad\text{for all }x\in S^{d-1}.G(x)=j∑​Uj​(x)Uj​(x)Tfor all x∈Sd−1.

For a scalar polynomial ppp, pℓp_\ellpℓ​ is the least γ\gammaγ such that γ−p\gamma-pγ−p (a 1×11\times11×1 matrix) is ℓ\ellℓ-sos on Sd−1S^{d-1}Sd−1, and pmin⁡p_{\min}pmin​ is the minimum of ppp on Sd−1S^{d-1}Sd−1. The level value is +∞+\infty+∞ when no such γ\gammaγ exists.

The milestones use three further objects. A harmonic decomposition of a homogeneous fff of degree 2n2n2n is f=∑k=0n∥x∥2(n−k)f2kf=\sum_{k=0}^n\|x\|^{2(n-k)}f_{2k}f=∑k=0n​∥x∥2(n−k)f2k​ with f2kf_{2k}f2k​ homogeneous of degree 2k2k2k and Δf2k=0\Delta f_{2k}=0Δf2k​=0. B2nB_{2n}B2n​ is the least constant with max⁡Sd−1∣f2k∣≤B2nmax⁡Sd−1∣f∣\max_{S^{d-1}}|f_{2k}|\le B_{2n}\max_{S^{d-1}}|f|maxSd−1​∣f2k​∣≤B2n​maxSd−1​∣f∣ for all such fff in all dimensions. The Gegenbauer coefficients λi(ϕ)\lambda_i(\phi)λi​(ϕ) of a univariate polynomial ϕ\phiϕ are its coefficients against the orthogonal polynomials CiC_iCi​ for the weight (1−t2)(d−3)/2(1-t^2)^{(d-3)/2}(1−t2)(d−3)/2 on [−1,1][-1,1][−1,1], equation (9). For qqq of degree at most ℓ\ellℓ, the kernel error is

ρ2n(d,ℓ)=min⁡deg⁡q≤ℓ, λ0(q2)=1 ∑k=1n∣λ2k(q2)−1−1∣.\rho_{2n}(d,\ell)=\min_{\deg q\le\ell,\ \lambda_0(q^2)=1}\ \sum_{k=1}^n\big|\lambda_{2k}(q^2)^{-1}-1\big|.ρ2n​(d,ℓ)=degq≤ℓ, λ0​(q2)=1min​ k=1∑n​​λ2k​(q2)−1−1​.

Formalization targets

Goal: Theorem 2 (p. 3)

For every nnn there are constants Cn,Cn′C_n,C'_nCn​,Cn′​ depending only on nnn such that, for all d,k,ℓd,k,\elld,k,ℓ and every k×kk\times kk×k matrix polynomial FFF, homogeneous of degree 2n2n2n with n≤dn\le dn≤d, symmetric at every xxx, with 0⪯F(x)⪯I0\preceq F(x)\preceq I0⪯F(x)⪯I on Sd−1S^{d-1}Sd−1:

ℓ≥Cnd ⟹ F+Cn′(dℓ)2I is ℓ-sos on Sd−1.\ell\ge C_nd\ \Longrightarrow\ F+C'_n\Big(\frac d\ell\Big)^2I\ \text{is }\ell\text{-sos on }S^{d-1}.ℓ≥Cn​d ⟹ F+Cn′​(ℓd​)2I is ℓ-sos on Sd−1.

The goal fixes only the shape (d/ℓ)2(d/\ell)^2(d/ℓ)2 and the regime ℓ≥Cnd\ell\ge C_ndℓ≥Cn​d, and leaves the constants open.

Milestones

They follow the paper's proof, in attack order:

  1. Harmonic projection: Lemma 16 (Reznick's bound on Δkf\Delta^kfΔkf), Proposition 5 (B2nB_{2n}B2n​ is independent of ddd, with B2≤2B_2\le2B2​≤2, B4≤9B_4\le9B4​≤9), the explicit value (34), and Proposition 17 (matrices, spectral norm).
  2. Kernels: the Funk–Hecke formula (8), Remark 1, and the first part of Theorem 6: F+B2n2∑k∣λ2k−1−1∣ IF+\frac{B_{2n}}2\sum_k|\lambda_{2k}^{-1}-1|\,IF+2B2n​​∑k​∣λ2k−1​−1∣I is ℓ\ellℓ-sos for every admissible qqq.
  3. The kernel error: Ci′(1)/Ci(1)=i(i+d−2)/(d−1)C_i'(1)/C_i(1)=i(i+d-2)/(d-1)Ci′​(1)/Ci​(1)=i(i+d−2)/(d−1), Proposition 18 (tangent line at 111), Proposition 8 (spectra of Toeplitz matrices of linear functions), the value of h′(1)h'(1)h′(1) and the eigenvalue comparison from the proof of Proposition 7, Proposition 9 (ρ≤ρ~/(1−ρ~)\rho\le\tilde\rho/(1-\tilde\rho)ρ≤ρ~​/(1−ρ~​)), and the second part of Theorem 6:
ρ2n(d,ℓ)≤Cn(dℓ)2(ℓ≥Cn′d).\rho_{2n}(d,\ell)\le C_n\Big(\frac d\ell\Big)^2\qquad(\ell\ge C'_nd).ρ2n​(d,ℓ)≤Cn​(ℓd​)2(ℓ≥Cn′​d).
  1. Corollary: Theorem 1, 1≤pℓ−pmin⁡pmax⁡−pmin⁡≤1+(Cnd/ℓ)21\le\frac{p_\ell-p_{\min}}{p_{\max}-p_{\min}}\le1+(C_nd/\ell)^21≤pmax​−pmin​pℓ​−pmin​​≤1+(Cn​d/ℓ)2 for ℓ≥Cnd\ell\ge C_ndℓ≥Cn​d.

Significance

Theorem 2 says how the level must grow with the dimension: ℓ=Θ(d/ε)\ell=\Theta(d/\sqrt\varepsilon)ℓ=Θ(d/ε​) suffices for relative error ε\varepsilonε, where Reznick's analysis needs ℓ=Θ(d/ε)\ell=\Theta(d/\varepsilon)ℓ=Θ(d/ε). Theorem 10 of the paper shows that, for n=1n=1n=1, the kernel error of this technique really is of order (d/ℓ)2(d/\ell)^2(d/ℓ)2. Independence of the matrix size gives certificates for polynomials that are bihomogeneous of degree (2n,2)(2n,2)(2n,2) on Sk−1×Sd−1S^{k-1}\times S^{d-1}Sk−1×Sd−1. The paper's Theorem 15 uses this, together with the DPS duality of the companion mission, to bound the convergence of the DPS hierarchy for separability. Fang–Fawzi, pp. 3, 10, 14

The theorem is proved in the 2019 preprint and was published in Mathematical Programming in 2021. No machine-checked proof of it or of its ingredients is known. Proving it formally takes reusable infrastructure: degree-bounded matrix SOS on the sphere, harmonic decomposition of homogeneous polynomials, Gegenbauer polynomials with their coefficients and the Funk–Hecke formula, and spectra of Jacobi matrices of orthogonal polynomials. The milestones also correct the printed text, as listed under Formalization scope.

Difficulty

Positive semidefiniteness of F+δIF+\delta IF+δI at each point of the sphere does not give a factorization with factors of prescribed degree, and Reznick's kernel ⟨x,y⟩2ℓ\langle x,y\rangle^{2\ell}⟨x,y⟩2ℓ only reaches error d/ℓd/\elld/ℓ. Two estimates must be uniform at once. First, harmonic projection of a degree-2n2n2n form must be bounded in sup norm independently of ddd; the L2L^2L2 bound is easy, and the sup-norm bound is the content of Proposition 5. Second, the kernel error ρ2n(d,ℓ)\rho_{2n}(d,\ell)ρ2n​(d,ℓ) must be bounded throughout the regime ℓ≥Cnd\ell\ge C_ndℓ≥Cn​d, which comes down to the location of the largest zero of a Gegenbauer polynomial. The printed bounds on that zero and on λmax⁡\lambda_{\max}λmax​ in Proposition 7 are false in small dimensions, so the paper's explicit constants cannot be relied on.

Formalization scope

  • Objects. Rd\mathbb R^dRd is Fin d → ℝ (0-based coordinates), and Sd−1S^{d-1}Sd−1 is the equation ∑ixi2=1\sum_ix_i^2=1∑i​xi2​=1, not the sup-norm sphere. Matrix polynomials are matrices over MvPolynomial (Fin d) ℝ, evaluated entrywise, and homogeneity is entrywise.
  • ℓ\ellℓ-sos. A finite family of k×kk\times kk×k factors, every entry of total degree at most ℓ\ellℓ, with equality on the sphere only. Without the degree bound the level disappears; with equality on all of Rd\mathbb R^dRd Theorem 2 becomes false. Neither change is a faithful reading.
  • Constants. In the goal the constants are chosen before ddd, kkk, ℓ\ellℓ and FFF. No assumption d≥2d\ge2d≥2 is added: the cases d=0,1d=0,1d=0,1 are true and elementary.
  • Standing assumption d≥2d\ge2d≥2. Every milestone that uses the Gegenbauer objects assumes it, as §2–3 do: the weight (1−t2)(d−3)/2(1-t^2)^{(d-3)/2}(1−t2)(d−3)/2, ωd−1/ωd\omega_{d-1}/\omega_dωd−1​/ωd​ and the divisions by d−1d-1d−1 need it. Gegenbauer polynomials are normalized by Ci(1)C_i(1)Ci​(1) and defined by their three-term recurrence. σ\sigmaσ is the normalized surface measure built from Mathlib's Measure.toSphere.
  • B2nB_{2n}B2n​. It is not defined (it would be a real infimum). Statements quantify over every constant BBB with the defining property, and B2nB_{2n}B2n​ is one of them.
  • ρ2n\rho_{2n}ρ2n​. It takes values in [0,∞][0,\infty][0,∞], with ∣λ−1−1∣=∞|\lambda^{-1}-1|=\infty∣λ−1−1∣=∞ at λ=0\lambda=0λ=0 and ∞\infty∞ on an empty feasible set. Its sum runs over k=1,…,nk=1,\dots,nk=1,…,n, following (12), (13) and (16); (10) prints 2n2n2n, a slip. Its minimum is over deg⁡q≤ℓ\deg q\le\elldegq≤ℓ, as in (13). The first part of Theorem 6 is posed per polynomial qqq, which is what (12) proves and implies the printed form.
  • Other conventions. Proposition 17's spectral norm is written as max⁡∥y∥=1∣yTAy∣\max_{\|y\|=1}|y^{\mathsf T}Ay|max∥y∥=1​∣yTAy∣, and homogeneity of FFF is explicit there. Theorem 1 is stated cross-multiplied, so that it is meaningful when ppp is constant on the sphere. Its level value is extended real to record infeasibility; the theorem asserts a finite attained value and a degree-bounded SOS certificate.
  • Not posed. Proposition 7 (λmax⁡(T[h])≥1−7n12d2ℓ2\lambda_{\max}(\mathcal T[h])\ge1-\frac{7n}{12}\frac{d^2}{\ell^2}λmax​(T[h])≥1−127n​ℓ2d2​) fails, for example, at d=2d=2d=2, n=1n=1n=1, ℓ=10\ell=10ℓ=10. The zero bound it quotes and the explicit constants at the end of p. 9 are not posed either; the true first inequality of its proof is.

Proofs of any milestone are welcome. So are reusable developments of Gegenbauer polynomials, spherical harmonics, the Funk–Hecke formula, Jacobi matrices, and Carathéodory-type finite quadratures that turn an integral of squares into a finite sum of squares.

Selected references

  • K. Fang, H. Fawzi, The sum-of-squares hierarchy on the sphere, and applications in quantum information theory, arXiv preprint, 2019. https://arxiv.org/abs/1908.05155v1
  • B. Reznick, Uniform denominators in Hilbert's seventeenth problem, Mathematische Zeitschrift 220(1), 75–97, 1995. https://doi.org/10.1007/BF02572604
  • A. C. Doherty, S. Wehner, Convergence of SDP hierarchies for polynomial optimization on the hypersphere, arXiv preprint, 2012. https://arxiv.org/abs/1210.5048
  • E. de Klerk, M. Laurent, Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere, arXiv preprint, 2019. https://arxiv.org/abs/1904.08828
  • J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization 11(3), 796–817, 2001. https://doi.org/10.1137/S1052623400366802
23 thms2 active usersReviewed
Numerical AnalysisQuantum Information·Captain: mikedeng1

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

Motivation

A quantum algorithm for a system of linear equations must turn operations it can implement into an approximation of the inverse of the system matrix. For a Hermitian matrix, time evolution e−iAte^{-iAt}e−iAt is such an operation. Childs, Kothari and Somma use a Fourier expansion of the scalar reciprocal 1/x1/x1/x to express an approximation to A−1A^{-1}A−1 as a finite linear combination of these evolutions. Their paper reports an exponential improvement in the dependence on the requested precision over earlier linear-systems methods. The scalar approximation in Lemma 11 is the mathematical input to their Fourier algorithm and to the query and gate analyses in Theorem 3. This mission isolates that approximation and the Gaussian estimates stated around it. Theorem 3's complexity claims themselves are outside the present formalization. Childs, Kothari and Somma, §3, pp. 10–14.

Setting

Fix a condition number κ≥1\kappa\ge1κ≥1. The scalar spectral domain is

Dκ=[−1,−1/κ]∪[1/κ,1].D_\kappa=[-1,-1/\kappa]\cup[1/\kappa,1].Dκ​=[−1,−1/κ]∪[1/κ,1].

It contains the real eigenvalues permitted after the paper's normalization and excludes zero, where the reciprocal is undefined. For an accuracy ε>0\varepsilon>0ε>0, two functions are ε\varepsilonε-close on DκD_\kappaDκ​ when their difference has magnitude at most ε\varepsilonε at every point of that domain. A complex-valued approximant is compared with 1/x1/x1/x as a complex number. The paper gives this domain and closeness convention before the Fourier construction. Childs, Kothari and Somma, pp. 9–10.

The intermediate function gyJ,zK(x)g_{y_J,z_K}(x)gyJ​,zK​​(x) is a truncated Gaussian Fourier integral. It integrates ze−z2/2e−ixyzz e^{-z^2/2}e^{-ixyz}ze−z2/2e−ixyz over −zK≤z≤zK-z_K\le z\le z_K−zK​≤z≤zK​ and then over 0≤y≤yJ0\le y\le y_J0≤y≤yJ​, multiplying by i/2πi/\sqrt{2\pi}i/2π​. The finite approximant hJ,K,Δy,Δz(x)h_{J,K,\Delta_y,\Delta_z}(x)hJ,K,Δy​,Δz​​(x) is a Gaussian Fourier double sum with the same normalization and phase. Its samples are yj=jΔyy_j=j\Delta_yyj​=jΔy​ for j=0,…,J−1j=0,\ldots,J-1j=0,…,J−1 and zk=kΔzz_k=k\Delta_zzk​=kΔz​ for k=−K,…,Kk=-K,\ldots,Kk=−K,…,K; each term carries both mesh widths. Thus J,KJ,KJ,K count the retained samples, while Δy,Δz\Delta_y,\Delta_zΔy​,Δz​ control their spacing. The sign in the phase and the factor iii are part of the definitions. Childs, Kothari and Somma, (18), p. 10, and (21), p. 11.

Formalization targets

Truncation

Lemma 12 says that for cutoffs of scale

yJ=Θ ⁣(κlog⁡(κ/ε)),zK=Θ ⁣(log⁡(κ/ε)),y_J=\Theta\!\bigl(\kappa\sqrt{\log(\kappa/\varepsilon)}\bigr), \qquad z_K=\Theta\!\bigl(\sqrt{\log(\kappa/\varepsilon)}\bigr),yJ​=Θ(κlog(κ/ε)​),zK​=Θ(log(κ/ε)​),

the function gyJ,zKg_{y_J,z_K}gyJ​,zK​​ is ε\varepsilonε-close to 1/x1/x1/x on DκD_\kappaDκ​. The proposal includes the paper's explicit error bound (27) and its Gaussian tail bound (28), as well as the Gaussian Poisson-summation identity of Lemma 13. These are separate reusable targets, not replacements for the approximation theorem. Childs, Kothari and Somma, Lemmas 12–13 and (27)–(28), pp. 11–12.

Finite Fourier sum

The goal is Lemma 11:

∣hJ,K,Δy,Δz(x)−1x∣≤εfor every x∈Dκ,\left|h_{J,K,\Delta_y,\Delta_z}(x)-\frac1x\right|\le\varepsilon \quad\text{for every }x\in D_\kappa,​hJ,K,Δy​,Δz​​(x)−x1​​≤εfor every x∈Dκ​,

where

J=Θ ⁣(κεlog⁡κε),K=Θ ⁣(κlog⁡κε),Δy=Θ ⁣(εlog⁡(κ/ε)),Δz=Θ ⁣(1κlog⁡(κ/ε)).J=\Theta\!\left(\frac\kappa\varepsilon\log\frac\kappa\varepsilon\right),\quad K=\Theta\!\left(\kappa\log\frac\kappa\varepsilon\right),\quad \Delta_y=\Theta\!\left(\frac\varepsilon{\sqrt{\log(\kappa/\varepsilon)}}\right),\quad \Delta_z=\Theta\!\left(\frac1{\kappa\sqrt{\log(\kappa/\varepsilon)}}\right).J=Θ(εκ​logεκ​),K=Θ(κlogεκ​),Δy​=Θ(log(κ/ε)​ε​),Δz​=Θ(κlog(κ/ε)​1​).

The Θ\ThetaΘ statements impose upper and lower bounds with absolute constants, uniformly across κ\kappaκ and ε\varepsilonε. The requested approximation error is exactly ε\varepsilonε, matching the lemma's claim. The four scales specify both the size of the finite expansion and its mesh. Childs, Kothari and Somma, Lemma 11, p. 10.

Significance

The finite sum provides the paper's Fourier route from scalar reciprocal approximation to a linear combination of time-evolution operators. Its sample counts and spacings are the quantities that enter the algorithm's implementation costs. A result that only asserted approximation after arbitrarily many samples would not express the bound used there. The truncated integral and Poisson identity also remain useful for other Gaussian quadrature and Fourier-sampling arguments. Childs, Kothari and Somma, §§3.1–3.2, pp. 11–14.

The paper proves these claims on paper. This proposal asks for machine-checked Lean proofs of the scalar statements, including the complex normalization, the finite and infinite sum conventions, and the uniform scale bounds. It does not assert that the quantum algorithm, its Hamiltonian simulation subroutines, or its query and gate complexity theorems have been formalized.

Difficulty

The infinite Gaussian Fourier representation alone does not specify a finite implementable expansion. Restricting both integrals introduces two truncation errors, while replacing them by samples adds discretization and periodic-aliasing effects. These errors have to be controlled simultaneously with JJJ, KKK, Δy\Delta_yΔy​, and Δz\Delta_zΔz​ at the scales stated in Lemma 11. Merely taking the mesh arbitrarily fine gives approximation without the theorem's finite-size bounds. The proof also uses a complex Fourier phase although its target is real, and its infinite sums must have their ordinary convergent meaning. Childs, Kothari and Somma, proof of Lemma 11, pp. 13–14.

Formalization scope

The Lean development uses R\mathbb RR for x,κ,εx,\kappa,\varepsilonx,κ,ε and the cutoff and mesh parameters, C\mathbb CC for ggg and hhh, and the complex norm for closeness. Finite sums use exactly 0≤j<J0\le j<J0≤j<J and −K≤k≤K-K\le k\le K−K≤k≤K; the integral for ggg is iterated and has nonnegative upper cutoffs. The optional identity (20) is also an iterated integral, with the zzz integral evaluated before the yyy integral. Infinite sums in Lemma 13 are over Z\mathbb ZZ. The Gaussian integrals and series in the statements are convergent, so Lean's totalized integral and sum conventions do not supply artificial zero values.

The paper's condition-number convention is recorded as κ≥1\kappa\ge1κ≥1 and Corollary 10's operating range as 0<ε<1/20<\varepsilon<1/20<ε<1/2. Those conditions keep DκD_\kappaDκ​ nonempty and log⁡(κ/ε)\log(\kappa/\varepsilon)log(κ/ε) positive. The unnumbered reciprocal-exponential bound from p. 13 has x≠0x\ne0x=0 explicitly, because the printed fractions have no value at zero. The Θ\ThetaΘ bounds quantify their constants before the problem parameters. In particular, choices with unbounded sample counts or vanishing mesh widths cannot satisfy the goal solely by brute-force approximation.

A complete development needs reusable Gaussian integration and tail estimates, complex exponential identities, summability of Gaussian integer series, and Poisson summation in Mathlib's analytic setting. Contributions that establish these general facts, the stated milestones, or Lemma 11 with its original bounds all fit this scope. This mission uses the reviewed shared definition of DκD_\kappaDκ​. Childs, Kothari and Somma, pp. 9–14.

Selected references

  • A. M. Childs, R. Kothari and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM Journal on Computing 46(6), 2017; arXiv:1511.02306v2.
8 thms2 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? 3: Low-Influence Functions Have Level-One Fourier Weight at Most 2/π + CδResearch Paper

Motivation

Fourier analysis of functions on the discrete cube {−1,1}n\{-1,1\}^n{−1,1}n is the main tool behind tight inapproximability results under the Unique Games Conjecture. In the MAX-CUT reduction of Khot, Kindler, Mossel and O'Donnell (SIAM J. Comput. 2007), soundness rests on the Majority Is Stablest theorem: among bounded functions in which no coordinate has large influence, the majority function is asymptotically the most noise stable. That theorem was a conjecture when the paper was written and was proved by Mossel, O'Donnell and Oleszkiewicz (Annals of Math. 2010) using an invariance principle.

Section 6.2 of the paper records special cases of Majority Is Stablest that have short, self-contained proofs. Theorem 6 is the case where the noise parameter ρ\rhoρ tends to 000. There the noise stability is dominated by the Fourier weight at level 1, and the statement says that a bounded function with small influences has level-one weight at most 2/π2/\pi2/π, up to an explicit error linear in the largest influence. Bounds on the level-one weight also appear in Talagrand's work on correlation of monotone sets (Combinatorica 1996), which the paper compares against (its Theorem 18), and the level-one inequality is a standard chapter of the analysis of Boolean functions (O'Donnell 2014).

Setting

Points of the discrete cube {−1,1}n\{-1,1\}^n{−1,1}n are sign vectors x=(x1,…,xn)x=(x_1,\dots,x_n)x=(x1​,…,xn​); following the paper, the bit TRUE is read as −1-1−1 and FALSE as 111. The cube carries the uniform probability measure, so E[g]=2−n∑xg(x)\mathbf E[g]=2^{-n}\sum_x g(x)E[g]=2−n∑x​g(x), and real functions form an inner product space with ⟨f,g⟩=E[fg]\langle f,g\rangle=\mathbf E[fg]⟨f,g⟩=E[fg].

For S⊆[n]S\subseteq[n]S⊆[n] the parity χS(x)=∏i∈Sxi\chi_S(x)=\prod_{i\in S}x_iχS​(x)=∏i∈S​xi​; the parities form an orthonormal basis, and the Fourier coefficient of fff at SSS is f^(S)=⟨f,χS⟩\hat f(S)=\langle f,\chi_S\ranglef^​(S)=⟨f,χS​⟩. The weight of fff at level 1 is

W1(f)=∑∣S∣=1f^(S)2=∑i=1nf^({i})2.W^1(f)=\sum_{|S|=1}\hat f(S)^2=\sum_{i=1}^n\hat f(\{i\})^2 .W1(f)=∣S∣=1∑​f^​(S)2=i=1∑n​f^​({i})2.

The influence of coordinate iii on fff (Definition 2) is

Infi(f)=Ex1,…,xi−1,xi+1,…,xn[Varxi[f]],\mathrm{Inf}_i(f)=\mathop{\mathbf E}_{x_1,\dots,x_{i-1},x_{i+1},\dots,x_n}\big[\mathrm{Var}_{x_i}[f]\big],Infi​(f)=Ex1​,…,xi−1​,xi+1​,…,xn​​[Varxi​​[f]],

the expected variance of fff when all coordinates but xix_ixi​ are fixed at random and xix_ixi​ is a uniform sign. The linear part of fff is ℓ(x)=∑if^({i})xi\ell(x)=\sum_i\hat f(\{i\})x_iℓ(x)=∑i​f^​({i})xi​, and ∥g∥1=E∣g∣\|g\|_1=\mathbf E|g|∥g∥1​=E∣g∣, ∥g∥2=E[g2]\|g\|_2=\sqrt{\mathbf E[g^2]}∥g∥2​=E[g2]​, ∥g∥∞=max⁡x∣g(x)∣\|g\|_\infty=\max_x|g(x)|∥g∥∞​=maxx​∣g(x)∣.

Throughout, C=2(1−2/π)≈0.404C=2\big(1-\sqrt{2/\pi}\big)\approx 0.404C=2(1−2/π​)≈0.404.

Formalization targets

Goal: Theorem 6 (p. 12)

For every nnn, every f:{−1,1}n→[−1,1]f:\{-1,1\}^n\to[-1,1]f:{−1,1}n→[−1,1] and every δ≥0\delta\ge 0δ≥0 with Infi(f)≤δ\mathrm{Inf}_i(f)\le\deltaInfi​(f)≤δ for all iii,

∑∣S∣=1f^(S)2  ≤  2π+Cδ.\sum_{|S|=1}\hat f(S)^2\;\le\;\frac{2}{\pi}+C\delta .∣S∣=1∑​f^​(S)2≤π2​+Cδ.

The constant CCC is explicit, and the goal states it exactly as printed.

Milestones (proof of Theorem 6, p. 25, and Proposition 7.2, p. 16)

  1. For fff with values in [−1,1][-1,1][−1,1]: ∑∣S∣=1f^(S)2=∥ℓ∥22=⟨f,ℓ⟩≤∥f∥∞∥ℓ∥1≤∥ℓ∥1\sum_{|S|=1}\hat f(S)^2=\|\ell\|_2^2=\langle f,\ell\rangle\le\|f\|_\infty\|\ell\|_1\le\|\ell\|_1∑∣S∣=1​f^​(S)2=∥ℓ∥22​=⟨f,ℓ⟩≤∥f∥∞​∥ℓ∥1​≤∥ℓ∥1​.
  2. The König–Schütt–Tomczak-Jaegermann bound: if ∣ai∣≤δ|a_i|\le\delta∣ai​∣≤δ for all iii and ℓ=∑iaixi\ell=\sum_i a_ix_iℓ=∑i​ai​xi​, then
∥ℓ∥1≤2/π ∥ℓ∥2+C2 δ.\|\ell\|_1\le\sqrt{2/\pi}\,\|\ell\|_2+\tfrac C2\,\delta .∥ℓ∥1​≤2/π​∥ℓ∥2​+2C​δ.
  1. The quadratic step: for X,δ≥0X,\delta\ge0X,δ≥0, X2≤2/π X+C2δX^2\le\sqrt{2/\pi}\,X+\tfrac C2\deltaX2≤2/π​X+2C​δ implies X≤1/2π+1/2π+Cδ/2X\le\sqrt{1/2\pi}+\sqrt{1/2\pi+C\delta/2}X≤1/2π​+1/2π+Cδ/2​ and X2≤2/π+CδX^2\le 2/\pi+C\deltaX2≤2/π+Cδ.
  2. Proposition 7.2: Infi(f)=∑S∋if^(S)2\mathrm{Inf}_i(f)=\sum_{S\ni i}\hat f(S)^2Infi​(f)=∑S∋i​f^​(S)2.

Significance

The result. The constant 2/π2/\pi2/π is sharp: majority on nnn variables has influences of order n−1/2n^{-1/2}n−1/2 and level-one weight tending to 2/π2/\pi2/π, which is (E∣Z∣)2(\mathbf E|Z|)^2(E∣Z∣)2 for a standard Gaussian ZZZ. Theorem 6 thus identifies the extremal level-one weight of low-influence bounded functions and gives a rate linear in the maximal influence. It is the ρ→0\rho\to0ρ→0 instance of Majority Is Stablest, obtained without the invariance principle, and level-one bounds of this type are used in hardness reductions and in the study of noise sensitivity.

Formalizing it. The milestones together give a complete formal route from bounded functions to the stated bound, except for one step discussed below. They also produce a reusable layer of Boolean Fourier analysis: Fourier coefficients, level weights, influences in their variance form and the Fourier formula for influences. Mathlib contains no development of influences or level weights on the cube, and the platform has none either; the König–Schütt–Tomczak-Jaegermann inequality, a sharp quantitative central limit bound for Rademacher sums (J. Reine Angew. Math. 1999), has no machine-checked proof.

Status. The published proof's first step, ∣f^({i})∣≤Infi(f)|\hat f(\{i\})|\le\mathrm{Inf}_i(f)∣f^​({i})∣≤Infi​(f), is valid for Boolean-valued fff but not for [−1,1][-1,1][−1,1]-valued fff; for [−1,1][-1,1][−1,1]-valued fff the statement is posed as printed. For f=c x1f=c\,x_1f=cx1​ with 0<c<10<c<10<c<1 one has f^({1})=c>c2=Inf1(f)\hat f(\{1\})=c>c^2=\mathrm{Inf}_1(f)f^​({1})=c>c2=Inf1​(f), and the argument as written then yields only 2/π+Cδ2/\pi+C\sqrt\delta2/π+Cδ​. Numerical search over small cubes has found no function violating the printed bound. A proof of the goal for bounded fff, or a counterexample, is therefore a genuine contribution.

Difficulty

The obvious argument replaces ℓ\ellℓ by a Gaussian with the same variance and uses E∣Z∣=2/π\mathbf E|Z|=\sqrt{2/\pi}E∣Z∣=2/π​. A central limit theorem with an error term is needed, and generic Berry–Esseen bounds give an additive error with a constant far from C/2C/2C/2; the exact constant 1−2/π1-\sqrt{2/\pi}1−2/π​ requires the sharp Rademacher-sum inequality, whose proof is a delicate analysis of E∣∑iaixi∣\mathbf E|\sum_ia_ix_i|E∣∑i​ai​xi​∣ as a function of the coefficients. The second obstacle is the passage from influences to coefficients. For bounded fff only f^({i})2≤Infi(f)\hat f(\{i\})^2\le\mathrm{Inf}_i(f)f^​({i})2≤Infi​(f) holds, so a bound on influences controls coefficients only at scale δ\sqrt\deltaδ​; feeding that into the chain loses the linear dependence on δ\deltaδ. Recovering the printed rate for non-Boolean fff needs an idea beyond the published proof.

Formalization scope

A point of the cube is Fin n → Bool, mapped to a sign by pm with pm true = -1 and pm false = 1. Expectations are normalised finite sums, so no measure theory is involved. A function f:{−1,1}n→[−1,1]f:\{-1,1\}^n\to[-1,1]f:{−1,1}n→[−1,1] is a real function with the hypothesis ∀ x, |f x| ≤ 1. The influence is defined as on the page, as the average over the cube of ((f(xi←1)−f(xi←−1))/2)2\big((f(x^{i\leftarrow1})-f(x^{i\leftarrow-1}))/2\big)^2((f(xi←1)−f(xi←−1))/2)2, which is the variance in xix_ixi​; it is not defined by its Fourier formula, which is a milestone. The level-one weight is ∑if^({i})2\sum_i\hat f(\{i\})^2∑i​f^​({i})2. The constant CCC is written out as 2 * (1 - Real.sqrt (2 / Real.pi)); an existentially quantified constant would be a weaker theorem. The case n=0n=0n=0 is allowed.

Two hypotheses are added and disclosed: δ≥0\delta\ge0δ≥0 in Theorem 6 and in the König–Schütt–Tomczak-Jaegermann bound. For n≥1n\ge1n≥1 each follows from the other hypotheses; for n=0n=0n=0 the influence (resp. coefficient) hypothesis is empty and δ≥0\delta\ge0δ≥0 is what the page assumes.

A trivializing formalization would drop the range hypothesis (then scaled dictators refute the bound and the statement is false), define influence through Fourier coefficients (which makes Proposition 7.2 definitional), or weaken the hypothesis of the goal to a bound on the coefficients ∣f^({i})∣≤δ|\hat f(\{i\})|\le\delta∣f^​({i})∣≤δ; none of these is used here. In particular, the goal is not strengthened to Boolean-valued fff, where the published proof applies verbatim.

Contributions welcome: proofs of Parseval-type identities for the linear part, of Proposition 7.2, of the elementary quadratic step, of the König–Schütt–Tomczak-Jaegermann inequality, and of the goal itself. The cube layer is reusable for any later formalization of Boolean function analysis.

Selected references

  • S. Khot, G. Kindler, E. Mossel, R. O'Donnell, Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?, SIAM J. Comput. 37(1), 2007. https://doi.org/10.1137/S0097539705447372
  • E. Mossel, R. O'Donnell, K. Oleszkiewicz, Noise stability of functions with low influences: invariance and optimality, Annals of Mathematics 171(1), 2010. https://doi.org/10.4007/annals.2010.171.295
  • H. König, C. Schütt, N. Tomczak-Jaegermann, Projection constants of symmetric spaces and variants of Khintchine's inequality, J. Reine Angew. Math. 511, 1999. https://doi.org/10.1515/crll.1999.511.1
  • M. Talagrand, How much are increasing sets positively correlated?, Combinatorica 16(2), 1996. https://doi.org/10.1007/BF01844850
  • R. O'Donnell, Analysis of Boolean Functions, Cambridge University Press, 2014. https://arxiv.org/abs/2105.10386
7 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
Discrete GeometryProbability·Captain: mikedeng1

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

Motivation

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

The reduction runs through a sampling problem: produce samples of the discrete Gaussian distribution DL,rD_{L,r}DL,r​ on a lattice LLL. The last step converts such a sampler into a solver for SIVP, which asks for nnn short linearly independent lattice vectors. That conversion rests on one geometric fact about DL,rD_{L,r}DL,r​, Lemma 3.15 of the paper (p. 34:31): when the width rrr is at least 2\sqrt22​ times the smoothing parameter of LLL, a sample is not trapped in any proper subspace. The lemma first appeared, with only a proof sketch, in the preliminary version of Micciancio and Regev's work on worst-case to average-case reductions (SIAM J. Comput. 2007); Regev's article gives the full proof. This mission formalizes that lemma. The paper's main theorem, a quantum reduction (Theorem 3.1), is outside this series.

Setting

Work in Rn\mathbb{R}^nRn, n≥1n \ge 1n≥1, with the Euclidean inner product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩ and norm ∥⋅∥\|\cdot\|∥⋅∥.

  • A lattice L⊂RnL \subset \mathbb{R}^nL⊂Rn is the set of integer combinations of nnn linearly independent vectors. Its dual is L∗={y∈Rn:⟨x,y⟩∈Z ∀x∈L}L^* = \{y \in \mathbb{R}^n : \langle x, y\rangle \in \mathbb{Z}\ \forall x \in L\}L∗={y∈Rn:⟨x,y⟩∈Z ∀x∈L}, and det⁡(L)\det(L)det(L) is the volume of a fundamental domain; det⁡(L∗)=1/det⁡(L)\det(L^*) = 1/\det(L)det(L∗)=1/det(L).
  • The Gaussian function of width s>0s > 0s>0 is ρs(x)=exp⁡(−π∥x∥2/s2)\rho_s(x) = \exp(-\pi\|x\|^2/s^2)ρs​(x)=exp(−π∥x∥2/s2) (Eq. (4)); for a countable set AAA, ρs(A)=∑x∈Aρs(x)\rho_s(A) = \sum_{x \in A}\rho_s(x)ρs​(A)=∑x∈A​ρs​(x).
  • The discrete Gaussian DL,rD_{L,r}DL,r​ is the probability distribution on LLL with mass DL,r(x)=ρr(x)/ρr(L)D_{L,r}(x) = \rho_r(x)/\rho_r(L)DL,r​(x)=ρr​(x)/ρr​(L) (Eq. (6)).
  • For ϵ>0\epsilon > 0ϵ>0, the smoothing parameter ηϵ(L)\eta_\epsilon(L)ηϵ​(L) is the smallest s>0s > 0s>0 with ρ1/s(L∗∖{0})≤ϵ\rho_{1/s}(L^* \setminus \{0\}) \le \epsilonρ1/s​(L∗∖{0})≤ϵ (Definition 2.10, p. 34:19).
  • A subspace HHH is a real linear subspace of Rn\mathbb{R}^nRn; "dimension at most n−1n-1n−1" means HHH is proper.

Formalization targets

Goal: Lemma 3.15 (p. 34:31)

For an nnn-dimensional lattice LLL, 0<ϵ≤1100 < \epsilon \le \tfrac1{10}0<ϵ≤101​, r≥2 ηϵ(L)r \ge \sqrt2\,\eta_\epsilon(L)r≥2​ηϵ​(L) and every subspace HHH with dim⁡H≤n−1\dim H \le n - 1dimH≤n−1,

Pr⁡x∼DL,r[x∉H]=∑x∈L∖Hρr(x)ρr(L)  ≥  110.\Pr_{x \sim D_{L,r}}[x \notin H] = \sum_{x \in L \setminus H} \frac{\rho_r(x)}{\rho_r(L)} \;\ge\; \frac{1}{10}.x∼DL,r​Pr​[x∈/H]=x∈L∖H∑​ρr​(L)ρr​(x)​≥101​.

The constants 2\sqrt22​, 110\tfrac1{10}101​ and 110\tfrac1{10}101​ are the printed ones.

Milestones, in attack order

  1. Lemma 2.14 (Poisson summation, p. 34:20), already proved on the platform: f(L)=det⁡(L∗)f^(L∗)f(L) = \det(L^*)\hat f(L^*)f(L)=det(L∗)f^​(L∗), with f^(w)=∫f(x)e−2πi⟨x,w⟩dx\hat f(w) = \int f(x)e^{-2\pi i\langle x, w\rangle}dxf^​(w)=∫f(x)e−2πi⟨x,w⟩dx.
  2. The remark after Definition 2.10 (p. 34:19): s↦ρ1/s(L∗∖{0})s \mapsto \rho_{1/s}(L^* \setminus \{0\})s↦ρ1/s​(L∗∖{0}) is continuous and strictly decreasing on (0,∞)(0,\infty)(0,∞), tends to ∞\infty∞ at 000 and to 000 at ∞\infty∞, and ϵ↦ηϵ(L)\epsilon \mapsto \eta_\epsilon(L)ϵ↦ηϵ​(L) is its inverse.
  3. The expectation chain (proof of Lemma 3.15, p. 34:31): for a unit vector www,
Expx∼DL,r[e−π⟨w,x⟩2/r2]=det⁡(L∗)rn2 ρr(L)∑y∈L∗e−πr2(∥y∥2−⟨w,y⟩2/2)≤det⁡(L∗)rn2 ρr(L)ρ2/r(L∗)≤det⁡(L∗)rn2 ρr(L)(1+ϵ).\mathop{\mathrm{Exp}}_{x\sim D_{L,r}}\bigl[e^{-\pi\langle w,x\rangle^2/r^2}\bigr] = \frac{\det(L^*)r^n}{\sqrt2\,\rho_r(L)}\sum_{y\in L^*}e^{-\pi r^2(\|y\|^2 - \langle w,y\rangle^2/2)} \le \frac{\det(L^*)r^n}{\sqrt2\,\rho_r(L)}\rho_{\sqrt2/r}(L^*) \le \frac{\det(L^*)r^n}{\sqrt2\,\rho_r(L)}(1+\epsilon).Expx∼DL,r​​[e−π⟨w,x⟩2/r2]=2​ρr​(L)det(L∗)rn​y∈L∗∑​e−πr2(∥y∥2−⟨w,y⟩2/2)≤2​ρr​(L)det(L∗)rn​ρ2​/r​(L∗)≤2​ρr​(L)det(L∗)rn​(1+ϵ).
  1. The normalization bound (p. 34:31): ρr(L)=det⁡(L∗)rnρ1/r(L∗)≥det⁡(L∗)rn\rho_r(L) = \det(L^*)r^n\rho_{1/r}(L^*) \ge \det(L^*)r^nρr​(L)=det(L∗)rnρ1/r​(L∗)≥det(L∗)rn for every r>0r > 0r>0.
  2. The conclusion of the proof (p. 34:31): the expectation is at most 12(1+ϵ)<0.9\tfrac1{\sqrt2}(1+\epsilon) < 0.92​1​(1+ϵ)<0.9.

Significance

The result. Lemma 3.15 gives Corollary 3.16: n2n^2n2 independent samples of DL,rD_{L,r}DL,r​ contain nnn linearly independent vectors except with exponentially small probability. Since samples of DL,rD_{L,r}DL,r​ have norm at most about n r\sqrt n\, rn​r with high probability, a sampler at width r≈2 ηϵ(L)r \approx \sqrt2\,\eta_\epsilon(L)r≈2​ηϵ​(L) therefore yields short independent vectors, which is how Regev's reduction reaches SIVP (§3.3). The same property is used in later work wherever discrete Gaussian samples must generate a full-rank set of lattice vectors.

Formalizing it. The lemma is proved in the paper; it has no machine-checked proof that we know of. The work this mission asks for is the formalization of the known proof: the Gaussian-sum analysis of a discrete Gaussian on a general lattice in Mathlib's ZLattice framework, built on the platform's proved Poisson summation formula for lattices. The remark after Definition 2.10 (well-definedness of the smoothing parameter) and the normalization bound ρr(L)≥det⁡(L∗)rn\rho_r(L) \ge \det(L^*)r^nρr​(L)≥det(L∗)rn are used across the whole paper (Lemmas 3.2, 3.12, Claims 3.8, 3.9) and are reusable beyond this mission.

Difficulty

The obvious argument fails at the first step: there is no direct way to bound the mass of DL,rD_{L,r}DL,r​ on a hyperplane, because a lattice can place many short vectors in one hyperplane and the normalization ρr(L)\rho_r(L)ρr​(L) is not known in closed form. The paper's route replaces the indicator of HHH by a Gaussian in the direction orthogonal to HHH and moves to the dual lattice, where the smoothing hypothesis controls the sum. Formally this requires Poisson summation for an anisotropic Gaussian (a Gaussian with a non-scalar covariance), i.e. the Fourier transform of x↦exp⁡(−π(∥x∥2+⟨w,x⟩2)/r2)x \mapsto \exp(-\pi(\|x\|^2 + \langle w,x\rangle^2)/r^2)x↦exp(−π(∥x∥2+⟨w,x⟩2)/r2), which is not a stated Mathlib lemma, together with summability of Gaussian sums over lattices and the identification of the dual lattice used by the Poisson formula with the one in the paper. The smoothing remark needs continuity and strict monotonicity of a lattice theta series and its limits at 000 and ∞\infty∞.

Formalization scope

  • Rn\mathbb{R}^nRn is EuclideanSpace ℝ (Fin n) with Lebesgue measure. A lattice is L : Submodule ℤ (EuclideanSpace ℝ (Fin n)) with [DiscreteTopology L] [IsZLattice ℝ L] (discrete, full rank), the same shape as the referenced Poisson summation item. L∗L^*L∗ is LinearMap.BilinForm.dualSubmodule (innerₗ _) L; det⁡(L∗)\det(L^*)det(L∗) is written (ZLattice.covolume L)−1(\texttt{ZLattice.covolume } L)^{-1}(ZLattice.covolume L)−1.
  • All Gaussian sums are real tsums over the lattice or its dual; they are summable, so the values are the true sums. DL,rD_{L,r}DL,r​ is a mass function on the points of LLL, and the probability of x∉Hx \notin Hx∈/H is the sum of the masses of the lattice points outside HHH.
  • ηϵ(L)\eta_\epsilon(L)ηϵ​(L) is the real infimum of {s>0:ρ1/s(L∗∖{0})≤ϵ}\{s > 0 : \rho_{1/s}(L^* \setminus \{0\}) \le \epsilon\}{s>0:ρ1/s​(L∗∖{0})≤ϵ}; that it is attained is milestone 2, not a definitional shortcut.
  • Added hypotheses, all disclosed in the items: n≥1n \ge 1n≥1 in the goal (at n=0n = 0n=0 the natural-number subtraction n−1n - 1n−1 is 000, the only subspace of dimension 000 is the whole space R0\mathbb{R}^0R0, and the probability is 000); ϵ>0\epsilon > 0ϵ>0 (Definition 2.10 is for ϵ>0\epsilon > 0ϵ>0; for ϵ≤0\epsilon \le 0ϵ≤0 the Lean infimum is over the empty set, equals 000, and the hypothesis r≥2 ηϵ(L)r \ge \sqrt2\,\eta_\epsilon(L)r≥2​ηϵ​(L) would be vacuous); r>0r > 0r>0 (a Gaussian width; for n≥1n \ge 1n≥1 it follows from the other hypotheses).
  • Rotation. The proof's "assume without loss of generality that (1,0,…,0)(1,0,\dots,0)(1,0,…,0) is orthogonal to HHH" is formalized coordinate-free: milestones 3 and 5 are stated for an arbitrary unit vector www, with x1x_1x1​ replaced by ⟨w,x⟩\langle w, x\rangle⟨w,x⟩.
  • Lemma 2.14 is printed "for any function fff", the technical conditions omitted (p. 34:20). The referenced platform item states it for Schwartz functions fff, in translated form; every function the proof applies it to is a Gaussian, hence Schwartz.
  • Not a trivializing formalization: the probability is not stated through a Bochner integral or an unconstrained tsum, the smoothing hypothesis is not vacuous (ϵ>0\epsilon > 0ϵ>0), and the goal is the probability bound, not the expectation bound of milestone 3.
  • Contributions welcome: Fourier transforms of anisotropic Gaussians on EuclideanSpace, summability and monotonicity of lattice theta series, and the smoothing remark, each reusable in the sibling missions of this series.

Selected references

  • O. Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, Journal of the ACM 56(6), Article 34, 2009. https://doi.org/10.1145/1568318.1568324
  • D. Micciancio and O. Regev, Worst-Case to Average-Case Reductions Based on Gaussian Measures, SIAM Journal on Computing 37(1), 2007. https://doi.org/10.1137/S0097539705447360
9 thms2 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

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

Motivation

The learning with errors (LWE) problem underlies most of post-quantum public-key cryptography. Its hardness rests on Regev's reduction from worst-case lattice problems to LWE (Regev, J. ACM 2009). The reduction is iterative: it repeatedly turns samples of a discrete Gaussian on a lattice into samples of a narrower one. Its classical step, Lemma 3.11, needs the following fact. Adding continuous Gaussian noise to a discrete Gaussian sample gives, up to a small statistical distance, a continuous Gaussian. That fact is Claim 3.9 of the paper. Through Corollary 3.10 it turns a lattice point plus noise into an LWE-type sample with a periodic Gaussian error.

The tool behind it is the smoothing parameter of Micciancio and Regev (SIAM J. Comput. 2007). Above this width a discrete Gaussian on a lattice behaves like a continuous one. Claims of this type have since become standard in lattice-based cryptography: discrete Gaussian sampling, trapdoors, and the convolution theorems of Peikert (CRYPTO 2010).

This mission formalizes Claim 3.9 from the published J. ACM article (Article 34, 2009). The paper's main theorem, Theorem 3.1, is a quantum reduction about efficient algorithms. It is outside this series of missions.

Setting

Work in Rn\mathbb{R}^nRn with the Euclidean norm and Lebesgue measure. For s>0s > 0s>0 the Gaussian function is ρs(x)=exp⁡(−π∥x/s∥2)\rho_s(x) = \exp(-\pi\|x/s\|^2)ρs​(x)=exp(−π∥x/s∥2), its shift is ρs,c(x)=ρs(x−c)\rho_{s,c}(x) = \rho_s(x - c)ρs,c​(x)=ρs​(x−c), and νs=ρs/sn\nu_s = \rho_s/s^nνs​=ρs​/sn is a probability density (Eqs. (4)–(5)). For a countable set AAA, ρs(A)=∑x∈Aρs(x)\rho_s(A) = \sum_{x \in A}\rho_s(x)ρs​(A)=∑x∈A​ρs​(x).

A lattice L⊂RnL \subset \mathbb{R}^nL⊂Rn is the set of integer combinations of nnn linearly independent vectors. Its dual is L∗={y:⟨x,y⟩∈Z ∀x∈L}L^* = \{y : \langle x, y\rangle \in \mathbb{Z}\ \forall x \in L\}L∗={y:⟨x,y⟩∈Z ∀x∈L}, and det⁡(L∗)=1/det⁡(L)\det(L^*) = 1/\det(L)det(L∗)=1/det(L), where det⁡(L)\det(L)det(L) is the volume of a fundamental parallelepiped. For u∈Rnu \in \mathbb{R}^nu∈Rn and r>0r > 0r>0, the discrete Gaussian DL+u,rD_{L+u,r}DL+u,r​ is the distribution on the coset L+uL + uL+u with mass ρr(y)/ρr(L+u)\rho_r(y)/\rho_r(L+u)ρr​(y)/ρr​(L+u) at yyy (Eq. (6)).

For ϵ>0\epsilon > 0ϵ>0 the smoothing parameter ηϵ(L)\eta_\epsilon(L)ηϵ​(L) is the smallest sss with ρ1/s(L∗∖{0})≤ϵ\rho_{1/s}(L^*\setminus\{0\}) \le \epsilonρ1/s​(L∗∖{0})≤ϵ (Definition 2.10).

The statistical distance of two densities is Δ(φ1,φ2)=∫Rn∣φ1−φ2∣\Delta(\varphi_1,\varphi_2) = \int_{\mathbb{R}^n}|\varphi_1 - \varphi_2|Δ(φ1​,φ2​)=∫Rn​∣φ1​−φ2​∣, with no factor 12\tfrac1221​, so it ranges in [0,2][0,2][0,2].

Let r,s>0r, s > 0r,s>0 and t=r2+s2t = \sqrt{r^2+s^2}t=r2+s2​. The distribution YYY is obtained by sampling y∼DL+u,ry \sim D_{L+u,r}y∼DL+u,r​ and adding independent noise with density νs\nu_sνs​. Its density is

Y(x)=∑y∈L+uDL+u,r(y) νs(x−y).Y(x) = \sum_{y \in L+u} D_{L+u,r}(y)\,\nu_s(x - y).Y(x)=y∈L+u∑​DL+u,r​(y)νs​(x−y).

Formalization targets

Goal: Claim 3.9 (p. 34:25)

If rs/t≥ηϵ(L)rs/t \ge \eta_\epsilon(L)rs/t≥ηϵ​(L) for some 0<ϵ<120 < \epsilon < \tfrac120<ϵ<21​, then

Δ(Y,νt)≤4ϵ.\Delta(Y, \nu_t) \le 4\epsilon .Δ(Y,νt​)≤4ϵ.

Milestones, in attack order

  1. Lemma 2.14 (Poisson summation), already proved on the platform and used here as a reference: f(L)=det⁡(L∗)f^(L∗)f(L) = \det(L^*)\hat f(L^*)f(L)=det(L∗)f^​(L∗).
  2. The remark after Definition 2.10 (p. 34:19). The map s↦ρ1/s(L∗∖{0})s \mapsto \rho_{1/s}(L^*\setminus\{0\})s↦ρ1/s​(L∗∖{0}) is continuous and strictly decreasing on (0,∞)(0,\infty)(0,∞), with limits ∞\infty∞ at 000 and 000 at ∞\infty∞, and ηϵ(L)\eta_\epsilon(L)ηϵ​(L) is its inverse.
  3. The Fourier transform of a shifted Gaussian (p. 34:25), ρσ,c^(w)=e−2πi⟨c,w⟩σnρ1/σ(w)\widehat{\rho_{\sigma,c}}(w) = e^{-2\pi i\langle c,w\rangle}\sigma^n\rho_{1/\sigma}(w)ρσ,c​​(w)=e−2πi⟨c,w⟩σnρ1/σ​(w).
  4. Claim 3.8 (p. 34:24). If r≥ηϵ(L)r \ge \eta_\epsilon(L)r≥ηϵ​(L), then ρr(L+c)∈rndet⁡(L∗)(1±ϵ)\rho_r(L+c) \in r^n\det(L^*)(1\pm\epsilon)ρr​(L+c)∈rndet(L∗)(1±ϵ).
  5. Eq. (11) (p. 34:25), Y(x)=s−nρt(x) ρrs/t,(r/t)2x−u(L)/ρr,−u(L)Y(x) = s^{-n}\rho_t(x)\,\rho_{rs/t,(r/t)^2x-u}(L)/\rho_{r,-u}(L)Y(x)=s−nρt​(x)ρrs/t,(r/t)2x−u​(L)/ρr,−u​(L).
  6. The pointwise bound (p. 34:26), ∣Y(x)−ρt(x)/tn∣≤ρt(x)/tn⋅4ϵ|Y(x) - \rho_t(x)/t^n| \le \rho_t(x)/t^n\cdot 4\epsilon∣Y(x)−ρt​(x)/tn∣≤ρt​(x)/tn⋅4ϵ.

A supporting item states the bridge used in both proofs: if s≥ηϵ(L)s \ge \eta_\epsilon(L)s≥ηϵ​(L), then ρ1/s(L∗∖{0})≤ϵ\rho_{1/s}(L^*\setminus\{0\}) \le \epsilonρ1/s​(L∗∖{0})≤ϵ.

Significance

Claim 3.9 is what makes Regev's iterative step classical. A discrete Gaussian sample, blurred by continuous noise, cannot be told apart from a continuous Gaussian of the combined width, except with probability 2ϵ2\epsilon2ϵ. Corollary 3.10 projects this onto a direction zzz and reduces it modulo 1 to obtain LWE samples with periodic Gaussian error Ψβ\Psi_\betaΨβ​. Without it, the reduction from lattice problems to LWE has no way to produce its error distribution. Claim 3.8, a milestone here, says that above the smoothing parameter the discrete Gaussian measure is almost invariant under shifts. It is the basic estimate of the theory.

The results are proved in the paper; none of them is formalized. Lean's Mathlib has lattices, their covolume, dual submodules and the Gaussian Fourier transform. The platform has the Poisson summation formula for lattices. This mission adds the smoothing parameter, discrete Gaussians on cosets, and the first machine-checked convolution theorem for discrete and continuous Gaussians. Later work, such as Corollary 3.10 or Peikert's general convolution theorem, can build on it.

Difficulty

Neither density is a finite object. YYY is an infinite sum over a coset of a lattice, normalized by another infinite sum. A direct term-by-term comparison of Y(x)Y(x)Y(x) with νt(x)\nu_t(x)νt​(x) fails: the sum defining Y(x)Y(x)Y(x) is a Gaussian sum over a shifted lattice, and its value genuinely varies with the position of (r/t)2x−u(r/t)^2x - u(r/t)2x−u relative to LLL; for narrow Gaussians the variation is of order one. The claim is that this oscillation is uniformly small, with a relative error that depends only on ϵ\epsilonϵ, not on nnn, xxx or uuu. Two ratios of lattice sums must be bounded at once, uniformly in xxx. The constant 4ϵ4\epsilon4ϵ uses ϵ<12\epsilon < \tfrac12ϵ<21​ in an essential way, because (1+ϵ)/(1−ϵ)(1+\epsilon)/(1-\epsilon)(1+ϵ)/(1−ϵ) must stay below 1+4ϵ1+4\epsilon1+4ϵ.

The smoothing parameter is defined as a least element. That the least element exists, i.e. that the infimum is attained, is itself a statement about continuity and strict monotonicity of an infinite sum in its width.

Formalization scope

  • Rn\mathbb{R}^nRn is EuclideanSpace ℝ (Fin n).
  • A lattice is a Submodule ℤ with [DiscreteTopology L] [IsZLattice ℝ L].
  • L∗L^*L∗ is LinearMap.BilinForm.dualSubmodule (innerₗ _) L.
  • det⁡(L∗)\det(L^*)det(L∗) is written det⁡(L)−1\det(L)^{-1}det(L)−1 with det⁡(L)\det(L)det(L) = ZLattice.covolume L.
  • Lattice sums are real tsums. They are genuinely summable, so no summability hypothesis is added.
  • ηϵ(L)\eta_\epsilon(L)ηϵ​(L) is the real infimum of {s>0:ρ1/s(L∗∖{0})≤ϵ}\{s > 0 : \rho_{1/s}(L^*\setminus\{0\}) \le \epsilon\}{s>0:ρ1/s​(L∗∖{0})≤ϵ}. Its attainment is milestone 2, not part of the definition.
  • YYY is defined by its density, the formula on the first line of the proof.
  • Δ\DeltaΔ is a lower Lebesgue integral with values in [0,∞][0,\infty][0,∞] and no 12\tfrac1221​. A Bochner integral of a non-integrable difference would be 000 and make the bound free; this form rules that trivialization out.

Added hypotheses, each disclosed in the item.

  • ϵ>0\epsilon > 0ϵ>0 in Claim 3.9 and the pointwise bound (Claim 3.8 prints it). Definition 2.10 defines ηϵ\eta_\epsilonηϵ​ only for ϵ>0\epsilon > 0ϵ>0, and for ϵ≤0\epsilon \le 0ϵ≤0 the defining set is empty, so the hypothesis ηϵ(L)≤rs/t\eta_\epsilon(L) \le rs/tηϵ​(L)≤rs/t would be vacuous.
  • r>0r > 0r>0 in Claim 3.8, where ρr\rho_rρr​ requires it, and likewise s>0s > 0s>0 in the supporting item "s≥ηϵ(L)⇒ρ1/s(L∗∖{0})≤ϵs \ge \eta_\epsilon(L) \Rightarrow \rho_{1/s}(L^*\setminus\{0\}) \le \epsilons≥ηϵ​(L)⇒ρ1/s​(L∗∖{0})≤ϵ".
  • n≥1n \ge 1n≥1 in the smoothing remark, which fails for n=0n = 0n=0, where L∗∖{0}L^*\setminus\{0\}L∗∖{0} is empty.

Other conventions.

  • Lemma 2.14 is printed "for any function", with technical conditions omitted (p. 34:20). The referenced platform theorem is the version for Schwartz functions in translated form; every Gaussian used here is Schwartz.
  • Eq. (11) is formalized as the equality of its first and fifth lines, the real-valued completing-the-square identity. The Fourier-side lines are not stated.
  • The Fourier transform is Mathlib's 𝓕, ∫h(x)e−2πi⟨x,w⟩dx\int h(x)e^{-2\pi i\langle x,w\rangle}dx∫h(x)e−2πi⟨x,w⟩dx, as on p. 34:20.

Reusable beyond this mission: the Gaussian, coset-sum and smoothing-parameter definitions, Claim 3.8, and the shifted Fourier transform. Proofs of any milestone are welcome, and so are proofs of the summability and Schwartz facts for Gaussians on lattices that every milestone needs.

Selected references

  • O. Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, Journal of the ACM 56(6), Article 34, 2009. https://doi.org/10.1145/1568318.1568324
  • D. Micciancio and O. Regev, Worst-Case to Average-Case Reductions Based on Gaussian Measures, SIAM Journal on Computing 37(1), 2007. https://doi.org/10.1137/S0097539705447360
  • C. Peikert, An Efficient and Parallel Gaussian Sampler for Lattices, CRYPTO 2010, LNCS 6223. https://doi.org/10.1007/978-3-642-14623-7_5
9 thms2 active usersReviewed
🏆Completed
AnalysisProbability·Captain: mikedeng1

Distribution Function Inequalities for Martingales 8: For Concave Φ, EΦ(Σ z_k) ≤ 2·EΦ(Σ E(z_k | 𝒜_{k−1})) for Nonnegative z_kResearch Paper

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
AnalysisProbabilityStochastic Systems·Captain: mikedeng1

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

Motivation

The size of a martingale can be measured in two ways: by its maximal function, the largest absolute value it reaches, and by a quadratic quantity that records how much it has moved, the square function in discrete time or the elapsed time in the case of Brownian motion. The Burkholder–Davis–Gundy inequalities say that these two measurements are comparable in every LpL^pLp norm and, more generally, under EΦ(⋅)E\Phi(\cdot)EΦ(⋅) for every Φ\PhiΦ of moderate growth. They are a basic tool of stochastic analysis, harmonic analysis and the theory of stochastic integration.

D. L. Burkholder's 1971 Wald Memorial Lectures, published as Distribution Function Inequalities for Martingales (Ann. Probability 1 (1973)), organise these results around one device: a distribution function inequality ("good-λ\lambdaλ" inequality) between two random variables, which a single lemma then converts into integral inequalities for all Φ\PhiΦ of moderate growth. The paper opens its second chapter with "a particularly easy but important special case": Brownian motion stopped at an arbitrary stopping time. This mission formalizes that case, §§6–8 of the paper.

Timeline. Burkholder proved the LpL^pLp square-function inequalities for martingales, 1<p<∞1<p<\infty1<p<∞, in 1966 (Ann. Math. Statist. 37); B. Davis extended the comparison of the maximal and square functions to p=1p=1p=1 in 1970 (Israel J. Math. 8); Burkholder and R. F. Gundy introduced the extrapolation method for operators on martingales in 1970 (Acta Math. 124); Burkholder, Davis and Gundy proved two-sided Φ\PhiΦ inequalities in 1972 (Proc. Sixth Berkeley Symp. 2, 223–240), the Brownian case being their Theorem 7.2, under the additional assumption that Φ\PhiΦ is the integral of a function that itself satisfies a growth condition. The 1973 paper states Theorem 6.1 below as "Theorem 7.2 of [6] with Φ\PhiΦ more general", that assumption removed.

Setting

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space and X={X(t), 0≤t<∞}X=\{X(t),\,0\le t<\infty\}X={X(t),0≤t<∞} a one-dimensional Brownian motion: a real process with independent increments and continuous sample functions, with X(t)X(t)X(t) normally distributed, EX(t)=0EX(t)=0EX(t)=0, EX2(t)=tEX^2(t)=tEX2(t)=t. Let B(t)\mathcal B(t)B(t) be the σ\sigmaσ-field generated by {X(s), 0≤s≤t}\{X(s),\,0\le s\le t\}{X(s),0≤s≤t}. A stopping time of XXX is a function τ:Ω→[0,∞]\tau:\Omega\to[0,\infty]τ:Ω→[0,∞] with {τ<t}∈B(t)\{\tau<t\}\in\mathcal B(t){τ<t}∈B(t) for every t>0t>0t>0. For 0≤b≤∞0\le b\le\infty0≤b≤∞ put

X∗(b)=sup⁡t≥0∣X(b∧t)∣,X^*(b)=\sup_{t\ge0}|X(b\wedge t)| ,X∗(b)=t≥0sup​∣X(b∧t)∣,

so X∗(τ)X^*(\tau)X∗(τ) is the maximal function of Brownian motion stopped at τ\tauτ.

A function Φ:[0,∞]→[0,∞]\Phi:[0,\infty]\to[0,\infty]Φ:[0,∞]→[0,∞] is of moderate growth if it is non-decreasing and continuous, Φ(0)=0\Phi(0)=0Φ(0)=0, and

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

Examples are Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp for 0<p<∞0<p<\infty0<p<∞. No convexity is assumed. In Lean these are IsBM X P, IsStoppingTimeOf X τ, maxStopped X b ω and IsPhi Φ c.

Formalization targets

Goal: Theorem 6.1

For every stopping time τ\tauτ of XXX,

c EΦ(τ1/2)≤EΦ(X∗(τ))≤C EΦ(τ1/2),(6.2)c\,E\Phi(\tau^{1/2})\le E\Phi(X^*(\tau))\le C\,E\Phi(\tau^{1/2}), \tag{6.2}cEΦ(τ1/2)≤EΦ(X∗(τ))≤CEΦ(τ1/2),(6.2)

where c,C>0c,C>0c,C>0 depend only on c(6.1)c_{(6.1)}c(6.1)​. Neither τ\tauτ nor any moment is assumed finite.

Milestones

  1. (8.1) Wald's identity EX2(τ)=EτEX^2(\tau)=E\tauEX2(τ)=Eτ for a bounded stopping time τ\tauτ (cited in the paper from Doob).
  2. Theorem 6.2. For β>1\beta>1β>1, δ>0\delta>0δ>0 and every λ>0\lambda>0λ>0,
P(τ1/2>βλ, X∗(τ)≤δλ)≤δ2β2−1P(τ1/2>λ),(6.3)P(\tau^{1/2}>\beta\lambda,\ X^*(\tau)\le\delta\lambda)\le\frac{\delta^2}{\beta^2-1}P(\tau^{1/2}>\lambda), \tag{6.3}P(τ1/2>βλ, X∗(τ)≤δλ)≤β2−1δ2​P(τ1/2>λ),(6.3) P(X∗(τ)>βλ, τ1/2≤δλ)≤δ2(β−1)2P(X∗(τ)>λ).(6.4)P(X^*(\tau)>\beta\lambda,\ \tau^{1/2}\le\delta\lambda)\le\frac{\delta^2}{(\beta-1)^2}P(X^*(\tau)>\lambda). \tag{6.4}P(X∗(τ)>βλ, τ1/2≤δλ)≤(β−1)2δ2​P(X∗(τ)>λ).(6.4)
  1. Lemma 7.1. If nonnegative f,gf,gf,g satisfy P(g>βλ,f≤δλ)≤εP(g>λ)P(g>\beta\lambda,f\le\delta\lambda)\le\varepsilon P(g>\lambda)P(g>βλ,f≤δλ)≤εP(g>λ) for all λ>0\lambda>0λ>0, and Φ(βλ)≤γΦ(λ)\Phi(\beta\lambda)\le\gamma\Phi(\lambda)Φ(βλ)≤γΦ(λ), Φ(δ−1λ)≤ηΦ(λ)\Phi(\delta^{-1}\lambda)\le\eta\Phi(\lambda)Φ(δ−1λ)≤ηΦ(λ) with γε<1\gamma\varepsilon<1γε<1, then
EΦ(g)≤γη1−γεEΦ(f).E\Phi(g)\le\frac{\gamma\eta}{1-\gamma\varepsilon}E\Phi(f).EΦ(g)≤1−γεγη​EΦ(f).

Significance

Theorem 6.1 is the Brownian case of the Burkholder–Davis–Gundy inequalities: for Brownian motion the stopping time τ\tauτ plays the role of the square function, since τ\tauτ is the quadratic variation of XXX up to time τ\tauτ. The result controls the stopped maximum through elapsed quadratic variation without a finite-time or integrability assumption. Lemma 7.1 is reusable: the paper applies it again in §§10–21 to discrete-time martingales.

The results are classical and proved; the mission's Lean statements remain open. Mathlib has Brownian motion as a predicate on processes (IsBrownianReal), while this development still needs optional sampling at the paper's stopping times and maximal inequalities for Brownian motion. A formal proof of this mission would provide Wald's identity at bounded optional times, a general good-λ\lambdaλ lemma, and the Brownian inequality with explicit dependence of the constants on c(6.1)c_{(6.1)}c(6.1)​.

Difficulty

The obvious route, integrating the tail bounds (6.3)–(6.4) against dΦd\PhidΦ, does not close by itself: the right-hand side of each good-λ\lambdaλ inequality contains the same random variable as the left-hand side, and nothing in the hypotheses says that EΦ(τ1/2)E\Phi(\tau^{1/2})EΦ(τ1/2) or EΦ(X∗(τ))E\Phi(X^*(\tau))EΦ(X∗(τ)) is finite, nor that τ\tauτ is finite. The theorem has to hold in that generality, with constants that see only c(6.1)c_{(6.1)}c(6.1)​ and not Φ\PhiΦ itself. On the probabilistic side, the stopping times of the paper are defined by the strict events {τ<t}\{\tau<t\}{τ<t} relative to the raw natural filtration B(t)\mathcal B(t)B(t), which is not right-continuous, while the one probabilistic input, Wald's identity (8.1), is a statement about optional sampling of the martingale X2(t)−tX^2(t)-tX2(t)−t in continuous time, for which Mathlib has no theorem yet.

Formalization scope

  • Probability spaces are (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]; time is ℝ≥0 and stopping times are valued in ℝ≥0∞.
  • Brownian motion IsBM X P is Mathlib's IsBrownianReal X P plus two explicit conjuncts the paper assumes: every sample function is continuous, and each X(t)X(t)X(t) is measurable (so B(t)⊆A\mathcal B(t)\subseteq\mathcal AB(t)⊆A). X(0)=0X(0)=0X(0)=0 holds almost surely.
  • IsStoppingTimeOf X τ is exactly the paper's condition {τ<t}∈B(t)\{\tau<t\}\in\mathcal B(t){τ<t}∈B(t), t>0t>0t>0, with B(t)\mathcal B(t)B(t) the raw generated σ\sigmaσ-field; it is weaker than Mathlib's IsStoppingTime, so the theorems are stronger than their Mathlib-stopping-time versions.
  • τ1/2\tau^{1/2}τ1/2, X∗(τ)X^*(\tau)X∗(τ), Φ\PhiΦ and all expectations take values in [0,∞][0,\infty][0,∞] (ℝ≥0∞, lintegral), with ∞1/2=∞\infty^{1/2}=\infty∞1/2=∞; both sides of (6.2) may be infinite. (8.1) is stated with lintegral on both sides.
  • The growth condition is required for all λ∈[0,∞]\lambda\in[0,\infty]λ∈[0,∞], equivalent to (6.1) by continuity. Φ≢0\Phi\not\equiv0Φ≡0, which the paper assumes "to eliminate the trivial case", is dropped: all conclusions hold trivially for Φ≡0\Phi\equiv0Φ≡0.
  • "The choice of ccc and CCC depends only on c(6.1)c_{(6.1)}c(6.1)​" is formalized with the quantifier order ∀ c, ∃ C₁ C₂ > 0, ∀ Ω P X τ Φ, IsPhi Φ c → …. A version in which the constants are chosen after Φ\PhiΦ, XXX or τ\tauτ would be trivial whenever the right-hand side is positive and is ruled out by this order.
  • In Lemma 7.1, f,gf,gf,g may take the value ∞\infty∞ and γ,η\gamma,\etaγ,η are nonnegative; both choices are harmless (see the item notes).

Contributions welcome: Wald's identity and optional sampling for Brownian motion at optional times, the Lebesgue–Stieltjes 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 continuous non-decreasing Φ\PhiΦ (reusable for every Φ\PhiΦ inequality of the series), and the good-λ\lambdaλ lemma, which the later missions of this series share.

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, 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. https://digicoll.lib.berkeley.edu/record/113227
  • D. L. Burkholder, R. F. Gundy, Extrapolation and interpolation of quasi-linear operators on martingales, Acta Math. 124 (1970), 249–304. https://doi.org/10.1007/BF02394576
  • B. Davis, On the integrability of the martingale square function, Israel J. Math. 8 (1970), 187–190. https://doi.org/10.1007/BF02771562
  • D. L. Burkholder, Martingale transforms, Ann. Math. Statist. 37 (1966), 1494–1504. https://doi.org/10.1214/aoms/1177699141
7 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
AnalysisProbability·Captain: mikedeng1

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

Why the square function of a martingale matters

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

S(f)=(∑k=1∞dk2)1/2.S(f) = \Bigl(\sum_{k=1}^\infty d_k^2\Bigr)^{1/2}.S(f)=(k=1∑∞​dk2​)1/2.

Comparing the size of fff with the size of S(f)S(f)S(f) is one of the basic tools of probability and of harmonic analysis: it underlies Khintchine-type inequalities, the LpL^pLp theory of martingale transforms, the Littlewood–Paley theory of dyadic and Fourier series, and the Burkholder–Davis–Gundy inequalities used throughout stochastic calculus.

Timeline. Paley (1932) proved LpL^pLp bounds for the square function of Walsh–Paley series, the dyadic model case. Marcinkiewicz and Zygmund (1937–38) proved the analogous inequalities for sums of independent mean-zero random variables. Burkholder (1966, Ann. Math. Statist. 37) proved them for general martingales, 1<p<∞1 < p < \infty1<p<∞, together with the weak-type (1,1)(1,1)(1,1) bound for S(f)S(f)S(f). Burkholder and Gundy (1970) extended the comparison to functions Φ\PhiΦ of moderate growth by distribution function ("good-λ\lambdaλ") inequalities, and Davis (1970) settled p=1p = 1p=1 for f∗=sup⁡n∣fn∣f^* = \sup_n |f_n|f∗=supn​∣fn​∣. The 1973 Wald lectures formalized here re-derive the 1<p<∞1 < p < \infty1<p<∞ inequality from one elementary stopping-time identity (Lemma 2.1), 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​⊆⋯ sub-σ\sigmaσ-fields of A\mathcal AA. A martingale relative to A1,A2,…\mathcal A_1, \mathcal A_2, \dotsA1​,A2​,… is a sequence of integrable random variables fnf_nfn​, 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​; a submartingale has ≥\ge≥ in place of ===.

With the convention f0=0f_0 = 0f0​=0, the difference sequence is dk=fk−fk−1d_k = f_k - f_{k-1}dk​=fk​−fk−1​ (so d1=f1d_1 = f_1d1​=f1​). Write

  • Sn(f)=(∑k=1ndk2)1/2S_n(f) = (\sum_{k=1}^n d_k^2)^{1/2}Sn​(f)=(∑k=1n​dk2​)1/2 and S(f)=sup⁡nSn(f)∈[0,∞]S(f) = \sup_n S_n(f) \in [0, \infty]S(f)=supn​Sn​(f)∈[0,∞];
  • fn∗=max⁡1≤k≤n∣fk∣f_n^* = \max_{1\le k\le n} |f_k|fn∗​=max1≤k≤n​∣fk​∣ and f∗=sup⁡n∣fn∣f^* = \sup_n |f_n|f∗=supn​∣fn​∣;
  • ∥Y∥p=(E∣Y∣p)1/p\|Y\|_p = (E|Y|^p)^{1/p}∥Y∥p​=(E∣Y∣p)1/p for a random variable YYY, and ∥f∥p=sup⁡n≥1∥fn∥p\|f\|_p = \sup_{n\ge1} \|f_n\|_p∥f∥p​=supn≥1​∥fn​∥p​ for the process. The process 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 \ge 1 : |f_n| > \lambda\}μ=inf{n≥1:∣fn​∣>λ} (with inf⁡∅=∞\inf\emptyset = \inftyinf∅=∞) is a stopping time; 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​ and S∞(f)=S(f)S_\infty(f) = S(f)S∞​(f)=S(f).

In Lean these are dseq, sqFnN, sqFn, maxFnN, lpNormE, pNorm, exitTime, valAt and sqFnAt in the namespace BurkholderDFI.SquareFnLp.

Formalization targets

Goal: Theorem 3.2

For each 1<p<∞1 < p < \infty1<p<∞ there are positive constants cp,Cpc_p, C_pcp​,Cp​, depending only on ppp, such that every martingale satisfies

cp∥S(f)∥p≤∥f∥p≤Cp∥S(f)∥p.c_p \|S(f)\|_p \le \|f\|_p \le C_p \|S(f)\|_p .cp​∥S(f)∥p​≤∥f∥p​≤Cp​∥S(f)∥p​.

The goal asserts only existence of the constants, so that it does not depend on the particular numbers the paper's proof produces.

Milestones

In attack order:

  1. Doob's maximal inequality (1.1): λP(fn∗>λ)≤∫{fn∗>λ}∣fn∣≤∥f∥1\lambda P(f_n^* > \lambda) \le \int_{\{f_n^*>\lambda\}} |f_n| \le \|f\|_1λP(fn∗​>λ)≤∫{fn∗​>λ}​∣fn​∣≤∥f∥1​.
  2. Doob's facts (§1): an L1L^1L1-bounded martingale or nonnegative submartingale converges a.e., and ∥fμ∥1≤∥f∥1\|f_\mu\|_1 \le \|f\|_1∥fμ​∥1​≤∥f∥1​ for every stopping time μ\muμ.
  3. The classical extrapolation (1.2)–(1.3): λP(Y>βλ)≤α∫{Y>λ}X\lambda P(Y > \beta\lambda) \le \alpha\int_{\{Y>\lambda\}} XλP(Y>βλ)≤α∫{Y>λ}​X for all λ>0\lambda > 0λ>0 implies ∥Y∥p≤αβpq∥X∥p\|Y\|_p \le \alpha\beta^p q \|X\|_p∥Y∥p​≤αβpq∥X∥p​.
  4. Lemma 2.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 \le 2E f_\mu f_{\mu-1} \le 2\lambda\|f\|_1∥Sμ−1​(f)∥22​+∥fμ−1​∥22​≤2Efμ​fμ−1​≤2λ∥f∥1​, with equality on the left for martingales.
  5. Theorem 3.1: λP(S(f)>λ)≤3∥f∥1\lambda P(S(f) > \lambda) \le 3\|f\|_1λP(S(f)>λ)≤3∥f∥1​.
  6. Lemma 3.1, (3.4) and (3.5): for nonnegative submartingales, ∥Sn(f)∥p≤9p1/2q∥fn∥p\|S_n(f)\|_p \le 9p^{1/2}q\|f_n\|_p∥Sn​(f)∥p​≤9p1/2q∥fn​∥p​.
  7. (3.7): for martingales, ∥Sn(f)∥p≤18p1/2q∥fn∥p\|S_n(f)\|_p \le 18 p^{1/2} q \|f_n\|_p∥Sn​(f)∥p​≤18p1/2q∥fn​∥p​.
  8. The duality bound: ∥fn∥p≤18q1/2p∥Sn(f)∥p\|f_n\|_p \le 18 q^{1/2} p \|S_n(f)\|_p∥fn​∥p​≤18q1/2p∥Sn​(f)∥p​.

Here qqq is the conjugate exponent, p−1+q−1=1p^{-1} + q^{-1} = 1p−1+q−1=1.

Significance

The result. Theorem 3.2 says that a martingale is bounded in LpL^pLp exactly when its square function lies in LpL^pLp, with comparable norms. It reduces questions about fff, whose increments interact, to questions about ∑dk2\sum d_k^2∑dk2​, a sum of nonnegative terms. Immediate consequences include the LpL^pLp boundedness of martingale transforms ∑vkdk\sum v_k d_k∑vk​dk​ with ∣vk∣≤1|v_k| \le 1∣vk​∣≤1 (unconditionality of martingale differences in LpL^pLp), Marcinkiewicz–Zygmund and Khintchine inequalities, and, by passing through dyadic martingales, Littlewood–Paley inequalities. Theorem 3.1 is the endpoint estimate: at p=1p = 1p=1 the strong inequality fails, and weak type (1,1)(1,1)(1,1) is what survives.

The formalization. The theorem is classical and proved; the remaining work is to machine-check it. Mathlib at the pinned revision contains no square function inequality for martingales (no occurrence of Burkholder's inequality or of a martingale square function in Mathlib/Probability); it has Doob's maximal inequality for nonnegative submartingales, optional stopping, and a.e. convergence of L1L^1L1-bounded submartingales. The mission would add the stopping-time identity of Lemma 2.1, the weak-type bound with constant 3, the explicit LpL^pLp constants 18p1/2q18 p^{1/2} q18p1/2q and 18q1/2p18 q^{1/2} p18q1/2p, and the general extrapolation lemma (1.3), each reusable on its own.

Difficulty

The obvious route, expanding ESn(f)2=Efn2E S_n(f)^2 = E f_n^2ESn​(f)2=Efn2​ by orthogonality, works only at p=2p = 2p=2. For p≠2p \ne 2p=2 no such identity exists, and interpolation from p=2p = 2p=2 needs an endpoint estimate that is itself the hard part: S(f)S(f)S(f) is not bounded on L1L^1L1. The paper obtains the endpoint from Lemma 2.1, whose content is an exact computation at the random time μ\muμ; turning it into rigorous Lean requires handling evaluation at μ=∞\mu = \inftyμ=∞ (where the a.e. limit f∞f_\inftyf∞​ enters), passage to the limit n→∞n \to \inftyn→∞ in stopped identities with only L1L^1L1 control, and integrability of the products fμfμ−1f_\mu f_{\mu-1}fμ​fμ−1​. The upper bound is not a formal consequence of the lower one at the same exponent: it requires passing to the conjugate exponent qqq.

Formalization scope

  • Processes are f : ℕ → Ω → ℝ; martingales and submartingales are Mathlib's Martingale f ℱ P / Submartingale f ℱ P for a filtration ℱ : Filtration ℕ _ with ℱ k =Ak= \mathcal A_k=Ak​. The paper's f0=0f_0 = 0f0​=0 is built into every definition, which never reads Lean's f 0. Mathlib additionally relates f 0 to f1f_1f1​; this is no restriction, since any martingale relative to A1,A2,…\mathcal A_1, \mathcal A_2, \dotsA1​,A2​,… extends by f0:=E(f1∣A0)f_0 := E(f_1 \mid \mathcal A_0)f0​:=E(f1​∣A0​).
  • "Nonnegative submartingale" means fn≥0f_n \ge 0fn​≥0 almost everywhere for n≥1n \ge 1n≥1.
  • S(f)S(f)S(f), f∗f^*f∗, ∥⋅∥p\|\cdot\|_p∥⋅∥p​ and ∥f∥p\|f\|_p∥f∥p​ take values in [0,∞][0, \infty][0,∞]. Neither ∥f∥p\|f\|_p∥f∥p​ nor ∥S(f)∥p\|S(f)\|_p∥S(f)∥p​ is assumed finite in Theorem 3.2, which therefore also asserts that one is infinite exactly when the other is. In Theorem 3.1, ∥f∥1=∞\|f\|_1 = \infty∥f∥1​=∞ makes the bound trivial, matching the paper's "we may assume that fff is L1L^1L1-bounded".
  • The constants of Theorem 3.2 are quantified before the probability space, the filtration and the martingale. A formalization in which cp,Cpc_p, C_pcp​,Cp​ may depend on fff (for instance Cp=∥f∥p/∥S(f)∥pC_p = \|f\|_p / \|S(f)\|_pCp​=∥f∥p​/∥S(f)∥p​) would be trivially true and is excluded by this quantifier order; so is assuming finiteness of either side.
  • The a.e. limit f∞f_\inftyf∞​ is a parameter of Lemma 2.1 together with the hypothesis that fn→f∞f_n \to f_\inftyfn​→f∞​ a.e.; Doob's §1 facts assert that such a limit exists.
  • Probability spaces live in Type (universe 0).
  • The asymptotic remark after Theorem 3.2 (cp−1=O(p1/2q)c_p^{-1} = O(p^{1/2}q)cp−1​=O(p1/2q), Cp=O(q1/2p)C_p = O(q^{1/2}p)Cp​=O(q1/2p)) is not formalized; the explicit constants it summarizes are milestones 7 and 8.

Infrastructure that a complete development needs and that is reusable beyond this mission: evaluation of a process at an N∪{∞}\mathbb N \cup \{\infty\}N∪{∞}-valued stopping time, the layer-cake formula ∥Y∥pp=∫0∞pλp−1P(Y>λ) dλ\|Y\|_p^p = \int_0^\infty p\lambda^{p-1} P(Y > \lambda)\, d\lambda∥Y∥pp​=∫0∞​pλp−1P(Y>λ)dλ for [0,∞][0,\infty][0,∞]-valued YYY, and conditional-expectation martingales E(g∣Ak)E(g \mid \mathcal A_k)E(g∣Ak​) with their difference sequences. Proofs of any milestone, in any order, are welcome.

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
  • J. L. Doob, Stochastic Processes, Wiley, New York, 1953.
  • R. E. A. C. Paley, A remarkable series of orthogonal functions (I), Proc. London Math. Soc. (2) 34 (1932), 241–264. https://doi.org/10.1112/plms/s2-34.1.241
11 thms2 active usersReviewed
PreviousPage 1 of 3Next

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