Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

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

Differential Geometry

71 missions · 30 completed

Missions

Open41Completed30All71
Mathematical Physics·Captain: Lucas

No-Hair Conjecture: Uniqueness of Stationary Kerr–Newman Black HolesOpen Problem

Motivation

General relativity predicts that a black hole, once it has settled down after collapse, retains almost no memory of the matter that formed it. The no-hair theorem, also called the black hole uniqueness theorem, states that all stationary black-hole solutions of the Einstein–Maxwell equations are completely characterized by three externally observable parameters: mass, angular momentum and electric charge; all other information ("hair") disappears behind the event horizon. The phrase "black holes have no hair" was popularized by John Archibald Wheeler. Its observational content is tested in gravitational-wave ringdown signals and in black-hole imaging.

Despite its name, there is no rigorous proof of the general statement: mathematicians refer to it as the no-hair conjecture.

Timeline.

  • 1967 — W. Israel proves uniqueness of the Schwarzschild metric among static vacuum black holes (Phys. Rev. 164, 1776).
  • 1968 — Israel extends this to static electrovacuum black holes, obtaining Reissner–Nordström (Commun. Math. Phys. 8, 245).
  • 1971 — B. Carter shows that an axisymmetric vacuum black hole has only two degrees of freedom (Phys. Rev. Lett. 26, 331); D. C. Robinson later completes uniqueness of Kerr.
  • 1970s — S. Hawking's rigidity theorem, combined with Carter and Robinson, yields uniqueness of Kerr in vacuum under the additional hypotheses of non-degenerate horizons and real analyticity of spacetime.
  • 2007 — extension to positive cosmological constant (Bhattacharya–Lahiri, arXiv:gr-qc/0702006).

Counterexamples are known in dimensions above four, for non-abelian Yang–Mills fields and for some non-minimally coupled scalar fields; this mission concerns only the four-dimensional Einstein–Maxwell theory with zero cosmological constant.

Setting

A spacetime is a smooth 4-manifold MMM with a Lorentzian metric ggg of signature (−,+,+,+)(-,+,+,+)(−,+,+,+), an electromagnetic field FFF (a 2-form) and a time orientation TTT. The pair (g,F)(g,F)(g,F) is electrovacuum if, in geometrized Gaussian units,

Gμν=2(FμαFνα−14gμνFαβFαβ),∇μFμν=0,dF=0.G_{\mu\nu}=2\Big(F_{\mu\alpha}F_\nu{}^\alpha-\tfrac14g_{\mu\nu}F_{\alpha\beta}F^{\alpha\beta}\Big),\qquad\nabla_\mu F^{\mu\nu}=0,\qquad dF=0 .Gμν​=2(Fμα​Fν​α−41​gμν​Fαβ​Fαβ),∇μ​Fμν=0,dF=0.

The spacetime is stationary if a one-parameter group φt\varphi_tφt​ of isometries preserves FFF, and it has a stationary asymptotically flat end MextM_{\rm ext}Mext​ if coordinates (t,x⃗)(t,\vec x)(t,x), ∣x⃗∣>R|\vec x|>R∣x∣>R, cover an open set on which φt\varphi_tφt​ is the time translation and gμν−ημν=O(1/∣x⃗∣)g_{\mu\nu}-\eta_{\mu\nu}=O(1/|\vec x|)gμν​−ημν​=O(1/∣x∣), ∂g=O(1/∣x⃗∣2)\partial g=O(1/|\vec x|^2)∂g=O(1/∣x∣2), F=O(1/∣x⃗∣2)F=O(1/|\vec x|^2)F=O(1/∣x∣2).

With I±I^\pmI± the chronological future and past, the domain of outer communications is ⟨⟨Mext⟩⟩=I+(Mext)∩I−(Mext)\langle\langle M_{\rm ext}\rangle\rangle=I^+(M_{\rm ext})\cap I^-(M_{\rm ext})⟨⟨Mext​⟩⟩=I+(Mext​)∩I−(Mext​), the black-hole region is M∖I−(Mext)M\setminus I^-(M_{\rm ext})M∖I−(Mext​) and the future event horizon is ∂I−(Mext)\partial I^-(M_{\rm ext})∂I−(Mext​).

The Kerr–Newman family, in Kerr–Schild coordinates, is gKN=η+f k⊗kg^{KN}=\eta+f\,k\otimes kgKN=η+fk⊗k with

f=r2(2mr−e2)r4+a2z2,k=(1,rx+ayr2+a2,ry−axr2+a2,zr),x2+y2r2+a2+z2r2=1,f=\frac{r^2(2mr-e^2)}{r^4+a^2z^2},\qquad k=\Big(1,\frac{rx+ay}{r^2+a^2},\frac{ry-ax}{r^2+a^2},\frac zr\Big),\qquad \frac{x^2+y^2}{r^2+a^2}+\frac{z^2}{r^2}=1,f=r4+a2z2r2(2mr−e2)​,k=(1,r2+a2rx+ay​,r2+a2ry−ax​,rz​),r2+a2x2+y2​+r2z2​=1,

with potential A=er3r4+a2z2kA=\frac{er^3}{r^4+a^2z^2}kA=r4+a2z2er3​k. For m>0m>0m>0, a2+e2≤m2a^2+e^2\le m^2a2+e2≤m2 its domain of outer communications is {r>r+}\{r>r_+\}{r>r+​}, r+=m+m2−a2−e2r_+=m+\sqrt{m^2-a^2-e^2}r+​=m+m2−a2−e2​.

Formalization targets

Goal: the no-hair conjecture

Under the standing hypotheses (smooth electrovacuum, stationary, asymptotically flat end, globally hyperbolic ⟨⟨Mext⟩⟩\langle\langle M_{\rm ext}\rangle\rangle⟨⟨Mext​⟩⟩, nonempty black-hole region, connected event horizon), there are m>0m>0m>0, aaa, eee with a2+e2≤m2a^2+e^2\le m^2a2+e2≤m2, an angle β\betaβ and a diffeomorphism Ψ\PsiΨ with

Ψ:{r>r+}→≅⟨⟨Mext⟩⟩,Ψ∗g=gm,a,eKN,Ψ∗F=cos⁡β FKN+sin⁡β ⋆FKN.\Psi:\{r>r_+\}\xrightarrow{\cong}\langle\langle M_{\rm ext}\rangle\rangle,\qquad\Psi^*g=g^{KN}_{m,a,e},\qquad\Psi^*F=\cos\beta\,F^{KN}+\sin\beta\,\star F^{KN}.Ψ:{r>r+​}≅​⟨⟨Mext​⟩⟩,Ψ∗g=gm,a,eKN​,Ψ∗F=cosβFKN+sinβ⋆FKN.

Milestones

  1. The Kerr–Newman metric solves the Einstein–Maxwell equations where r>0r>0r>0.
  2. Kerr–Newman black holes satisfy the standing hypotheses (the goal is not vacuous).
  3. Israel 1967: static vacuum ⇒\Rightarrow⇒ Schwarzschild (a=e=0a=e=0a=e=0).
  4. Israel 1968: static electrovacuum ⇒\Rightarrow⇒ Reissner–Nordström (a=0a=0a=0).
  5. Carter 1971 / Robinson: axisymmetric vacuum ⇒\Rightarrow⇒ Kerr (e=0e=0e=0).
  6. Hawking–Carter–Robinson: analytic vacuum with non-degenerate horizon ⇒\Rightarrow⇒ Kerr.
  7. Frame normalization: a Lorentz boost takes a timelike 4-momentum to rest, ΛP=(−P2,0,0,0)\Lambda P=(\sqrt{-P^2},0,0,0)ΛP=(−P2​,0,0,0).
  8. Frame normalization: a rotation aligns the spin, RJ=(0,0,∣J∣)RJ=(0,0,|J|)RJ=(0,0,∣J∣).

Significance

A proof of the goal would establish that the Kerr–Newman metrics exhaust the stationary, asymptotically flat electrovacuum black holes with connected horizon, which is the mathematical basis for treating astrophysical black holes as described by three numbers. It would also remove the analyticity and non-degeneracy hypotheses from the known vacuum results.

No machine-checked proof of any statement in this mission is known. Milestones 1, 7 and 8 are classical computations; milestones 3–6 are published theorems whose proofs rely on substantial Lorentzian geometry and elliptic PDE; the goal is open.

Difficulty

Uniqueness proofs reduce the problem to an elliptic boundary-value problem on the orbit space once enough symmetry is available. In the general stationary case the extra axial symmetry is not known to exist: Hawking's rigidity argument produces it only for analytic metrics, because it extends a Killing field off the horizon by analytic continuation. Without analyticity, unique continuation for the Killing equation across the horizon is the obstruction. Degenerate (extremal) horizons further break arguments that rely on a bifurcation surface.

Formalization scope

Spacetimes are Mathlib smooth manifolds modelled on EuclideanSpace ℝ (Fin 4); the metric and field are fields of continuous bilinear forms on tangent spaces, and curvature and field equations are imposed through components in every chart. Causal sets use C1C^1C1 curves parametrized by [0,1][0,1][0,1]. The Kerr–Newman comparison spacetime is the region {r>r+}\{r>r_+\}{r>r+​} of Kerr–Schild coordinate space with the explicit metric. Magnetic charge is accommodated by the duality angle β\betaβ.

The hypotheses are not vacuous: milestone 2 asserts that every Kerr–Newman black hole satisfies them. The connected-horizon hypothesis excludes the static multi-black-hole Majumdar–Papapetrou solutions, which would otherwise contradict the goal.

Needed infrastructure: Levi-Civita connection and curvature on manifolds, causal theory (global hyperbolicity, Cauchy surfaces), Killing fields and their flows, and the elliptic theory of harmonic maps used in uniqueness proofs. Contributions on any of these, and on milestones 1, 7 and 8, are welcome.

Selected references

  • Wikipedia, No-hair theorem, revision 1353599195, https://en.wikipedia.org/w/index.php?title=No-hair_theorem&oldid=1353599195
  • W. Israel, Event Horizons in Static Vacuum Space-Times, Phys. Rev. 164 (1967) 1776, https://doi.org/10.1103/PhysRev.164.1776
  • W. Israel, Event horizons in static electrovac space-times, Commun. Math. Phys. 8 (1968) 245, https://doi.org/10.1007/BF01645859
  • B. Carter, Axisymmetric Black Hole Has Only Two Degrees of Freedom, Phys. Rev. Lett. 26 (1971) 331, https://doi.org/10.1103/PhysRevLett.26.331
  • S. Bhattacharya, A. Lahiri, No hair theorems for positive Λ, Phys. Rev. Lett. 99 (2007) 201101, https://arxiv.org/abs/gr-qc/0702006
26 thms3 active usersReviewed
Algebraic GeometryCategory Theory·Captain: Lucas

Homological Mirror Symmetry for the Two-Torus (Kontsevich, ICM 1994)Research Paper

Motivation

Mirror symmetry was discovered in string theory as a duality between families of Calabi–Yau manifolds, and it entered mathematics as a prediction: the generating function counting rational curves on one manifold equals a period integral of a mirror manifold. In his 1994 ICM address, Homological algebra of mirror symmetry (alg-geom/9411018), M. Kontsevich proposed that these numerical coincidences are shadows of an equivalence of categories: the symplectic geometry of VVV should be encoded by Fukaya's A∞A_\inftyA∞​-category F(V)F(V)F(V), whose objects are Lagrangian submanifolds and whose products count pseudo-holomorphic discs, and the complex geometry of the mirror WWW by the derived category Db(Coh W)D^b(\mathrm{Coh}\,W)Db(CohW) of coherent sheaves. His Homological Mirror Conjecture asserts that the derived category built from F(V)F(V)F(V) embeds as a full triangulated subcategory of Db(Coh W)D^b(\mathrm{Coh}\,W)Db(CohW).

Kontsevich states the conjecture "in slightly vague form", because Fukaya's construction was not, and still is not, available in the generality the statement needs. He therefore closes the paper with the one instance he can compute by hand, in the section Two-dimensional tori: a return: for the flat torus Σ=R2/Z2\Sigma = \mathbb{R}^2/\mathbb{Z}^2Σ=R2/Z2, the objects are closed geodesics with unitary local systems, the products m2m_2m2​ are sums over triangles in the universal cover weighted by exp⁡(−area)\exp(-\text{area})exp(−area), and their structure constants are values of the classical theta-function. He predicts an equivalence with Db(Coh E)D^b(\mathrm{Coh}\,E)Db(CohE) for an elliptic curve EEE. This instance was proved by A. Polishchuk and E. Zaslow, Categorical mirror symmetry: the elliptic curve (math/9801119). Later instances include the four-torus (Abouzaid–Smith, arXiv:0903.3065) and Calabi–Yau hypersurfaces (Sheridan, arXiv:1111.0632). None of this has been formalized.

Setting

Fix a real number area>0\mathrm{area} > 0area>0, and let Σ\SigmaΣ be the torus R2/Z2\mathbb{R}^2/\mathbb{Z}^2R2/Z2 carrying the translation-invariant symplectic form of total area area\mathrm{area}area; a region of Euclidean area aaa in coordinates has symplectic area area⋅a\mathrm{area}\cdot aarea⋅a.

A brane bbb consists of: a primitive vector v∈Z2v \in \mathbb{Z}^2v∈Z2 and a point c∈R2c \in \mathbb{R}^2c∈R2, which together determine the closed geodesic Lb={ c+tv mod Z2 }L_b = \{\,c + tv \bmod \mathbb{Z}^2\,\}Lb​={c+tvmodZ2}; a grading α∈R\alpha \in \mathbb{R}α∈R, a real lift of the direction angle normalized so that (cos⁡πα,sin⁡πα)(\cos \pi\alpha, \sin \pi\alpha)(cosπα,sinπα) is parallel to vvv; and a real constant θ\thetaθ describing a flat unitary line bundle on LbL_bLb​, whose parallel transport along a path of parameter length sss is exp⁡(2πi θs)\exp(2\pi i\,\theta s)exp(2πiθs). Two branes are transverse when det⁡(v1,v2)≠0\det(v_1, v_2) \neq 0det(v1​,v2​)=0; their geodesics then meet in the finite set Lb1∩Lb2L_{b_1} \cap L_{b_2}Lb1​​∩Lb2​​, which indexes a basis of the Floer space Hom(b1,b2)\mathrm{Hom}(b_1, b_2)Hom(b1​,b2​). All of this space sits in a single degree, the Maslov index

μ(b1,b2)  =  ⌈α2−α1⌉.\mu(b_1, b_2) \;=\; \lceil \alpha_2 - \alpha_1 \rceil .μ(b1​,b2​)=⌈α2​−α1​⌉.

For three pairwise transverse branes and intersection points p∈L1∩L2p \in L_1 \cap L_2p∈L1​∩L2​, q∈L2∩L3q \in L_2 \cap L_3q∈L2​∩L3​, r∈L1∩L3r \in L_1 \cap L_3r∈L1​∩L3​, a triangle is a triple of lifts (P,Q,R)∈(R2)3(P, Q, R) \in (\mathbb{R}^2)^3(P,Q,R)∈(R2)3 of (p,q,r)(p,q,r)(p,q,r) with Q−PQ - PQ−P parallel to v2v_2v2​, R−QR - QR−Q parallel to v3v_3v3​, P−RP - RP−R parallel to v1v_1v1​, and positively oriented. Kontsevich's structure constant is

c(p,q,r)  =  ∑trianglesexp⁡(−symplectic area)⋅(holonomies along the three sides),c(p,q,r) \;=\; \sum_{\text{triangles}} \exp\bigl(-\text{symplectic area}\bigr)\cdot \bigl(\text{holonomies along the three sides}\bigr),c(p,q,r)=triangles∑​exp(−symplectic area)⋅(holonomies along the three sides),

the coefficient of rrr in m2(p,q)m_2(p, q)m2​(p,q). On the complex side, Dcohb(E)D^b_{\mathrm{coh}}(E)Dcohb​(E) denotes the complexes of OE\mathcal{O}_EOE​-modules with bounded, coherent cohomology.

Formalization targets

Goal — homological mirror symmetry for the two-torus

For every area>0\mathrm{area} > 0area>0 there exist a smooth proper curve EEE over C\mathbb{C}C, an assignment b↦Φ(b)b \mapsto \Phi(b)b↦Φ(b) of an object of Dcohb(E)D^b_{\mathrm{coh}}(E)Dcohb​(E) to each brane, and isomorphisms

C Lb1∩Lb2  → ∼   Hom(Φ(b1), Φ(b2)[μ(b1,b2)])(b1⋔b2),\mathbb{C}^{\,L_{b_1} \cap L_{b_2}} \;\xrightarrow{\ \sim\ }\; \mathrm{Hom}\bigl(\Phi(b_1),\, \Phi(b_2)[\mu(b_1,b_2)]\bigr) \qquad (b_1 \pitchfork b_2),CLb1​​∩Lb2​​ ∼ ​Hom(Φ(b1​),Φ(b2​)[μ(b1​,b2​)])(b1​⋔b2​),

with Hom(Φ(b1),Φ(b2)[d])=0\mathrm{Hom}(\Phi(b_1), \Phi(b_2)[d]) = 0Hom(Φ(b1​),Φ(b2​)[d])=0 for d≠μ(b1,b2)d \neq \mu(b_1,b_2)d=μ(b1​,b2​), carrying the products c(p,q,r)c(p,q,r)c(p,q,r) to composition in Dcohb(E)D^b_{\mathrm{coh}}(E)Dcohb​(E) whenever μ(b1,b2)+μ(b2,b3)=μ(b1,b3)\mu(b_1,b_2) + \mu(b_2,b_3) = \mu(b_1,b_3)μ(b1​,b2​)+μ(b2​,b3​)=μ(b1​,b3​).

Milestones

Existence of the Fukaya A∞A_\inftyA∞​-category of the torus; finiteness of Lb1∩Lb2L_{b_1} \cap L_{b_2}Lb1​​∩Lb2​​ with ∣det⁡(v1,v2)∣|\det(v_1,v_2)|∣det(v1​,v2​)∣ points; the Maslov relation μ(b1,b2)+μ(b2,b1)=1\mu(b_1,b_2) + \mu(b_2,b_1) = 1μ(b1​,b2​)+μ(b2​,b1​)=1; m12=0m_1^2 = 0m12​=0 together with associativity of m2m_2m2​ up to coboundary; the degeneration of an A∞A_\inftyA∞​-category with m≥3=0m_{\geq 3} = 0m≥3​=0 to a differential graded category; the theta-function shape of the structure constants; and their associativity equation.

Significance

The conjecture reorganizes mirror symmetry: the numerical predictions compare two elements of an uncountable set of power series, whereas the homological statement compares two objects in a countable set of triangulated categories, and the numerical statements are meant to follow from it. The torus case is the smallest instance in which every ingredient — Lagrangian branes, Maslov grading, disc counts, theta functions, and coherent sheaves on an elliptic curve — is present and computable, so it is the natural first target.

What this mission adds beyond the literature is machine-checked mathematics where none exists. Mathlib currently has no symplectic manifolds, no Lagrangian Floer theory, no Fukaya categories, and no A∞A_\inftyA∞​-categories; it does have schemes, sheaves of modules, and derived categories of abelian categories. The mission supplies the missing A∞A_\inftyA∞​ layer and the torus model, and asks for the comparison theorem. The A∞A_\inftyA∞​ definitions, the derived category with coherent cohomology, and the theta-function estimates are reusable outside this mission.

Difficulty

The obvious route — "transport the Polishchuk–Zaslow proof" — stalls at the point where the two sides are compared. Establishing that the triangle sums converge and equal theta-function values is analysis that Mathlib supports; producing an elliptic curve as a scheme with prescribed parameter, computing Ext\mathrm{Ext}Ext-groups between the mirror sheaves, and matching all products simultaneously is not currently supported by any library. A second difficulty is bookkeeping: gradings, Maslov indices and shifts must line up, since the product of two morphisms is nonzero only when μ(b1,b2)+μ(b2,b3)=μ(b1,b3)\mu(b_1,b_2)+\mu(b_2,b_3) = \mu(b_1,b_3)μ(b1​,b2​)+μ(b2​,b3​)=μ(b1​,b3​), and the same numerical condition controls which triples of branes bound triangles at all.

Formalization scope

Conventions committed to in Lean. An A∞A_\inftyA∞​-category is encoded as a single graded module AAA with morphism components hom⁡(X,Y)\hom(X,Y)hom(X,Y) and products given by a map on lists, m[f1,…,fn]=mn(f1⊗⋯⊗fn)m[f_1,\dots,f_n] = m_n(f_1 \otimes \cdots \otimes f_n)m[f1​,…,fn​]=mn​(f1​⊗⋯⊗fn​) of degree 2−n2-n2−n, with m0=0m_0 = 0m0​=0, and Stasheff signs (−1)r+st(-1)^{r+st}(−1)r+st in the bar-construction normalization; m2(f,g)m_2(f,g)m2​(f,g) is "fff then ggg". Triangles are normalized by requiring the first vertex to lie in [0,1)2[0,1)^2[0,1)2, which picks exactly one representative in each Z2\mathbb{Z}^2Z2-orbit; only positively oriented triangles are counted; sums are tsums, so convergence is part of the work. The hom-space isomorphisms in the goal are required to be additive, not a priori C\mathbb{C}C-linear, because the derived category of OE\mathcal{O}_EOE​-modules is not equipped with a C\mathbb{C}C-linear structure in Mathlib; the required compatibility with the structure constants pins down the algebra anyway. The goal asks only for the existence of a smooth proper curve EEE over C\mathbb{C}C; the paper's further prediction that EEE has parameter exp⁡(−area)\exp(-\mathrm{area})exp(−area) is deliberately left out of the statement.

The goal is not trivially satisfiable: the intersection set of two transverse branes is nonempty, so the required isomorphisms force the corresponding Hom\mathrm{Hom}Hom-groups to be nonzero of the right size, in the right degree, with the prescribed products.

The general conjecture, for an arbitrary symplectic manifold with c1=0c_1 = 0c1​=0, is not stated here, and deliberately so: without symplectic manifolds and Floer theory in Mathlib, any general statement would have to take the Fukaya category as an unconstrained parameter, which would make it either vacuous or false. Building that infrastructure — symplectic manifolds, graded Lagrangian branes, Floer cohomology, twisted complexes over an A∞A_\inftyA∞​-category and their triangulated structure — is the natural way to extend this mission, and such contributions are welcome.

Selected references

  • M. Kontsevich, Homological algebra of mirror symmetry, Proceedings of the International Congress of Mathematicians (Zürich, 1994), alg-geom/9411018.
  • A. Polishchuk and E. Zaslow, Categorical mirror symmetry: the elliptic curve, Adv. Theor. Math. Phys. 2 (1998), math/9801119.
  • M. Abouzaid and I. Smith, Homological mirror symmetry for the 4-torus, Duke Math. J. 152 (2010), arXiv:0903.3065.
  • N. Sheridan, Homological mirror symmetry for Calabi–Yau hypersurfaces in projective space, Invent. Math. 199 (2015), arXiv:1111.0632.
11 thms3 active usersReviewed
Geometry & Topology·Captain: xuanji

Strong Whitney embedding in dimension 2nResearch Paper

Motivation: an intrinsic manifold in a fixed Euclidean space

A smooth manifold is a space that can be described locally by real coordinates, even when no single coordinate chart describes the whole space. Differential geometry works with these local descriptions, whereas an embedding realizes the entire space inside one Euclidean space without losing either its topology or its infinitesimal geometry. The strong Whitney embedding theorem supplies a dimension bound depending only on the dimension of the manifold. This mission targets the precise version selected by LeanEval v1, rather than a substitute formulation.

The benchmark attributes the strong result to Hassler Whitney's 1944 paper and distinguishes it from the earlier bound of 2n+12n+12n+1. The result is a known mathematical theorem; the remaining task here is its formal proof in Lean. The exact benchmark declaration is authoritative for the target and its hypotheses, not a reconstruction from the historical literature (source and attribution).

Setting: topology, smoothness, and the differential

Let nnn be a natural number satisfying 1≤n1\le n1≤n. Let MMM carry a topology and a smooth atlas modeled on Rn\mathbb R^nRn, with the usual model having no boundary. The topology is Hausdorff: distinct points admit disjoint neighborhoods. It is second countable: there is a countable collection of open sets from which every open set can be assembled as a union. These are explicit hypotheses, alongside the chosen charted-space and smooth-manifold structures, in the Lean statement.

A topological embedding is a map that is a homeomorphism onto its image, where the image has the subspace topology inherited from the codomain. An immersion has an injective differential at every point. For a smooth map eee, write dexd e_xdex​ for the induced linear map on tangent spaces at xxx. These are separate requirements: the target asks for global topological embedding and pointwise injectivity of the differential together, as well as infinite differentiability. Their precise Lean meanings are the existing Mathlib predicates used directly by the benchmark, not new mission-specific definitions.

Formalization target: the single root theorem

For every n≥1n\ge1n≥1 and every MMM with the structures and hypotheses just stated, establish

∃e:M⟶R2n,e∈C∞(M,R2n) ∧ e is a topological embedding ∧ ∀x∈M, dex is injective.\exists e:M\longrightarrow\mathbb R^{2n},\qquad e\in C^\infty(M,\mathbb R^{2n}) \ \land\ e\text{ is a topological embedding} \ \land\ \forall x\in M,\ d e_x\text{ is injective}.∃e:M⟶R2n,e∈C∞(M,R2n) ∧ e is a topological embedding ∧ ∀x∈M, dex​ is injective.

The codomain has dimension exactly 2n2n2n. The quantifier ranges over all such manifolds, including noncompact ones. There is exactly one goal theorem and no auxiliary theorem items, definition items, or milestones. The declaration is LeanEval.Geometry.WhitneyEmbeddingProblem.whitney_embedding, with the binders and conclusion preserved from the benchmark source.

Significance: the full theorem rather than an easier restriction

The result realizes the given manifold in a Euclidean space with a uniform dimension bound. Its value in this formulation is the simultaneous control of topology, smoothness, and the differential, without a compactness assumption. Replacing the image-topology condition with mere injectivity would omit part of the requested conclusion; replacing 2n2n2n with an unspecified dimension would omit the quantitative constraint. Both distinctions are explicit in the benchmark's explanation.

A completed formalization would supply a reusable strong embedding theorem on top of Mathlib's manifold language. This is a long-term infrastructure task, not a claim that a short proof is available. The September 5, 2026 LeanEval v1 snapshot supplied for this task records no accepted benchmark credit for this target. That dated benchmark status is not a claim about all formalization projects, and preparing an open theorem statement does not establish the theorem or earn benchmark credit.

Difficulty: the dimension bound and the noncompact scope

The existing compact embedding result discussed by the benchmark provides an embedding into some finite-dimensional Euclidean space. That does not settle the present goal: it assumes compactness and does not supply the 2n2n2n bound. Consequently, simply invoking that result cannot discharge the unrestricted benchmark statement. The source identifies substantial differential-topological infrastructure behind the strong theorem; this proposal does not advertise an easy proof or prescribe a decomposition (benchmark discussion).

All positive dimensions remain in scope, including n=1n=1n=1 and n=2n=2n=2. Noncompactness is not a later extension or optional strengthening. The absence of an assumption must not be replaced by an implicit restriction in a new definition or an easier surrogate theorem.

Formalization scope: unchanged Mathlib predicates

The source model is EuclideanSpace ℝ (Fin n), and the target is EuclideanSpace ℝ (Fin (2 * n)). Smoothness is expressed by ContMDiff (𝓡 n) (𝓡 (2 * n)) ∞ e; the other two conjuncts are IsEmbedding e and pointwise Function.Injective of mfderiv. The type MMM remains universe-polymorphic. No compactness, connectedness, orientability, or nonemptiness hypothesis is added. The empty manifold is included; dimension zero is excluded. Neither properness nor closedness of the image is demanded by the conclusion (exact declaration).

Mathlib already provides the vocabulary needed to state the goal: Euclidean spaces, charts, manifold smoothness, topological embeddings, and manifold derivatives. No custom definition item is necessary. Future proof work may develop reusable infrastructure, but this draft contains only the root theorem and intentionally imposes no supporting targets. A proof must establish that exact statement, not the compact-only, immersion-only, or weak 2n+12n+12n+1 alternative.

Selected references

  • LeanEval contributors, Whitney embedding theorem (strong form, sharp dimension 2n), LeanEval v1 source declaration and manifest, statement revision 1, pinned source and manifest. These specify the exact formal target.
  • H. Whitney, The self-intersections of a smooth n-manifold in 2n-space, Annals of Mathematics (2) 45 (1944), 220–246, DOI. Historical attribution as recorded in the LeanEval manifest; no alternate statement from this reference replaces the benchmark goal.
16 thms3 active usersReviewed
Geometry & TopologyNumber Theory·Captain: t4v1

Thurston's Question 23: rational relations among hyperbolic volumesOpen Problem

Motivation

In the last of the twenty-four questions that closed his 1982 survey Three-dimensional manifolds, Kleinian groups and hyperbolic geometry (Bull. Amer. Math. Soc. 6 (1982), 357–381), Thurston asked to "show that volumes of hyperbolic 333-manifolds are not all rationally related" (p. 380). Twenty-two of the twenty-four have since been answered — geometrization by Perelman, tameness by Agol and by Calegari–Gabai, the ending lamination conjecture by Brock–Canary–Minsky, virtual fibering by Agol — and this one is among the two that remain open.

Some rational relations are forced, and for a trivial reason: a degree nnn cover of a hyperbolic 333-manifold has nnn times its volume, so any two commensurable manifolds have rationally related volumes. The question, which remains open, is whether every rational relation arises that way — equivalently, whether some two hyperbolic 333-manifolds have irrational volume ratio. Remarkably, not a single such pair is known.

Setting

The bundle fixes the meaning of every term. Hyperbolic 333-space is the upper half-space {(x,y,z):z>0}\{(x,y,z) : z > 0\}{(x,y,z):z>0}. Its volume is Lebesgue measure with density z−3z^{-3}z−3 — the Riemannian volume of the metric (dx2+dy2+dz2)/z2(dx^2+dy^2+dz^2)/z^2(dx2+dy2+dz2)/z2 written out, so that no Riemannian machinery is required. The hyperbolic distance is given by its closed formula

cosh⁡d(p,q)  =  1+∣p−q∣22 p3 q3.\cosh d(p,q) \;=\; 1 + \frac{|p-q|^2}{2\,p_3\,q_3}.coshd(p,q)=1+2p3​q3​∣p−q∣2​.

A Kleinian action is a free, properly discontinuous action by hyperbolic isometries; the quotient is a complete hyperbolic 333-manifold, discreteness and torsion freeness being consequences rather than hypotheses. The volume of the quotient is the measure of a fundamental domain, in the sense of Mathlib's MeasureTheory.IsFundamentalDomain, and the set of volumes collects those that are finite and positive.

Two conventions are stated rather than derived, and are worth flagging. Isometries are not required to preserve orientation, so the set of volumes also contains those of non-orientable quotients; this enlarges the set but not its Q\mathbb{Q}Q-span, so neither goal is affected. And preservation of the hyperbolic volume is a field of the structure rather than a consequence of preserving the distance: it holds for every hyperbolic isometry, but deriving it amounts to classifying Isom(H3)\mathrm{Isom}(\mathbb{H}^3)Isom(H3), which is not the subject of this mission.

Formalization targets

The goal is that the volumes are not all rationally related: there are two of them, vvv and www, with v≠qwv \neq q wv=qw for every rational qqq.

Two milestones support it. The first is that passing to a subgroup of index nnn multiplies the volume by nnn, a fundamental domain for the subgroup being the union of nnn translates of one for the whole group; this is the source of every known rational relation, and it is why the question is phrased as it is. The second is that the set of volumes is nonempty — that some finite-volume hyperbolic 333-manifold exists at all — without which the goal would be vacuously false rather than open.

A stronger form of the question, that the Q\mathbb{Q}Q-span of the set of volumes is infinite dimensional, is also stated.

Significance

The question is a geometric statement whose difficulty is arithmetic. For the Bianchi groups of an imaginary quadratic field FFF, Humbert's formula gives the covolume as ∣δF∣3/2ζF(2)/4π2|\delta_F|^{3/2}\zeta_F(2)/4\pi^2∣δF​∣3/2ζF​(2)/4π2, so the ratio of two such volumes is, up to explicit algebraic factors, a ratio of Dedekind zeta values at 222; and Neumann and Yang showed that the Bloch invariant of a hyperbolic 333-manifold lies in a subgroup of finite Q\mathbb{Q}Q-rank determined by its invariant trace field, so that manifolds sharing an invariant trace field with a single complex place, such as an imaginary quadratic one, have rationally related volumes. Producing one irrational ratio therefore means separating two such transcendentals — a statement of the same order of difficulty as the irrationality of ζ(5)\zeta(5)ζ(5). The value of formalizing the question is not that it will be closed, but that its statement, and the elementary relations that make its naive form false, are pinned down exactly.

20 thms3 active usersReviewed
Machine LearningOptimizationProbability·Captain: mikedeng1

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization 2: ZO-RSGD Has Average Expected Squared Riemannian Gradient Norm at Most 4L(f(x₀) − f(x*))/(N+1) + 2μ²L²(d+6)³ + 16(d+4)σ²/mResearch Paper

Motivation

Many optimization problems are posed over a manifold rather than a vector space: orthogonality constraints (the Stiefel manifold), unit-norm constraints (the sphere), fixed-rank matrices. In some of them the objective can only be evaluated, not differentiated. Black-box adversarial attacks on a neural network with a norm-constrained perturbation, hyperparameter tuning and simulation-based objectives are examples, and in all of them each function value is also noisy. Zeroth-order (derivative-free) methods replace the gradient by a random finite-difference estimate built from function values alone.

In Euclidean space the analysis of such methods is well developed. Nesterov and Spokoiny (2017) analysed Gaussian-smoothing estimators for deterministic objectives, and Ghadimi and Lan (2013) gave the first non-asymptotic stationarity rates for stochastic nonconvex objectives (the RSGF method). Li, Balasubramanian and Ma (arXiv:2003.11238, published in Mathematics of Operations Research, 2023) carried this programme to embedded submanifolds. They estimate the Riemannian gradient by projecting a Gaussian vector onto the tangent space and moving along a retraction, and they prove convergence rates for the resulting methods. This mission formalizes their rate for the stochastic method, ZO-RSGD (Theorem 3.2).

Setting

Let EEE be a finite-dimensional real inner product space (the paper's Rn\mathbb R^nRn), and let M⊆E\mathcal M \subseteq EM⊆E be a C1C^1C1 embedded submanifold of dimension ddd. The tangent space TxMT_x\mathcal MTx​M at x∈Mx \in \mathcal Mx∈M is the linear span of the tangent cone of M\mathcal MM at xxx. For a submanifold this is the set of velocities γ′(0)\gamma'(0)γ′(0) of curves in M\mathcal MM through xxx, and it is a subspace of dimension ddd. M\mathcal MM carries the metric induced by the inner product of EEE, and PxP_xPx​ denotes the orthogonal projection of EEE onto TxMT_x\mathcal MTx​M.

A retraction is a map RRR, (x,η)↦Rx(η)(x, \eta) \mapsto R_x(\eta)(x,η)↦Rx​(η). For every x∈Mx \in \mathcal Mx∈M it sends all of TxMT_x\mathcal MTx​M into M\mathcal MM and is smooth on TxMT_x\mathcal MTx​M, with Rx(0)=xR_x(0) = xRx​(0)=x and differential the identity at 000. The Riemannian gradient of a differentiable fff is grad⁡f(x)=Px∇f(x)\operatorname{grad} f(x) = P_x \nabla f(x)gradf(x)=Px​∇f(x).

The objective is stochastic, f(x)=EξF(x,ξ)f(x) = \mathbb E_\xi F(x, \xi)f(x)=Eξ​F(x,ξ), with noise ξ\xiξ distributed according to a probability measure PξP_\xiPξ​. Two assumptions are imposed:

  • Assumption 2.1 (LLL-retraction-smoothness). For almost every ξ\xiξ, ∣F(Rx(η),ξ)−F(x,ξ)−⟨grad⁡F(x,ξ),η⟩∣≤L2∥η∥2|F(R_x(\eta),\xi) - F(x,\xi) - \langle \operatorname{grad}F(x,\xi), \eta\rangle| \le \frac L2\|\eta\|^2∣F(Rx​(η),ξ)−F(x,ξ)−⟨gradF(x,ξ),η⟩∣≤2L​∥η∥2 for all x∈Mx \in \mathcal Mx∈M and η∈TxM\eta \in T_x\mathcal Mη∈Tx​M.
  • Assumption 2.3 (unbiased oracle, bounded variance). For every x∈Mx \in \mathcal Mx∈M, EξF(x,ξ)=f(x)\mathbb E_\xi F(x,\xi) = f(x)Eξ​F(x,ξ)=f(x), Eξgrad⁡F(x,ξ)=grad⁡f(x)\mathbb E_\xi \operatorname{grad}F(x,\xi) = \operatorname{grad}f(x)Eξ​gradF(x,ξ)=gradf(x) and Eξ∥grad⁡F(x,ξ)−grad⁡f(x)∥2≤σ2\mathbb E_\xi\|\operatorname{grad}F(x,\xi) - \operatorname{grad}f(x)\|^2 \le \sigma^2Eξ​∥gradF(x,ξ)−gradf(x)∥2≤σ2.

Given a smoothing parameter μ>0\mu > 0μ>0 and a batch size mmm, draw mmm independent pairs (u0,i,ξi)(u_{0,i}, \xi_i)(u0,i​,ξi​), each with u0,i∼N(0,I)u_{0,i} \sim \mathcal N(0, I)u0,i​∼N(0,I) independent of ξi∼Pξ\xi_i \sim P_\xiξi​∼Pξ​, and put ui=Pxu0,iu_i = P_x u_{0,i}ui​=Px​u0,i​. The mini-batch zeroth-order Riemannian gradient is

gˉμ,ξ(x)=1m∑i=1mF(Rx(μui),ξi)−F(x,ξi)μ ui.\bar g_{\mu,\xi}(x) = \frac1m\sum_{i=1}^m \frac{F(R_x(\mu u_i), \xi_i) - F(x, \xi_i)}{\mu}\,u_i .gˉ​μ,ξ​(x)=m1​i=1∑m​μF(Rx​(μui​),ξi​)−F(x,ξi​)​ui​.

ZO-RSGD (Algorithm 2) starts at x0∈Mx_0 \in \mathcal Mx0​∈M and iterates xk+1=Rxk(−η^ gˉμ,ξ(xk))x_{k+1} = R_{x_k}(-\hat\eta\,\bar g_{\mu,\xi}(x_k))xk+1​=Rxk​​(−η^​gˉ​μ,ξ​(xk​)) with step η^=1/L\hat\eta = 1/Lη^​=1/L and a fresh batch at every step. x∗x^*x∗ denotes a minimizer of fff over M\mathcal MM.

Formalization targets

Goal: Theorem 3.2

If m≥16(d+4)m \ge 16(d+4)m≥16(d+4), then for every NNN

1N+1∑k=0NE ∥grad⁡f(xk)∥2≤4L f(x0)−f(x∗)N+1+2μ2L2(d+6)3+16(d+4)mσ2.\frac{1}{N+1}\sum_{k=0}^{N}\mathbb E\,\|\operatorname{grad} f(x_k)\|^2 \le 4L\,\frac{f(x_0) - f(x^*)}{N+1} + 2\mu^2L^2(d+6)^3 + \frac{16(d+4)}{m}\sigma^2 .N+11​k=0∑N​E∥gradf(xk​)∥2≤4LN+1f(x0​)−f(x∗)​+2μ2L2(d+6)3+m16(d+4)​σ2.

The constants are the paper's own. The goal states the rate for every μ\muμ, mmm and NNN. It does not state the parameter choices μ=O(ϵ/d3/2)\mu = O(\epsilon/d^{3/2})μ=O(ϵ/d3/2), m=O(dσ2/ϵ2)m = O(d\sigma^2/\epsilon^2)m=O(dσ2/ϵ2), N=O(1/ϵ2)N = O(1/\epsilon^2)N=O(1/ϵ2) that follow from it.

Milestones

  • Lemma 2.1. For a ddd-dimensional subspace X\mathcal XX with projection PPP, u=Pu0u = Pu_0u=Pu0​ and x∈Xx \in \mathcal Xx∈X: E⟨x,u⟩u=x\mathbb E\langle x,u\rangle u = xE⟨x,u⟩u=x and E⟨x,u⟩2=∥x∥2\mathbb E\langle x,u\rangle^2 = \|x\|^2E⟨x,u⟩2=∥x∥2.
  • Lemma 2.2 (Nesterov–Spokoiny). E∥u∥p≤(n+p)p/2\mathbb E\|u\|^p \le (n+p)^{p/2}E∥u∥p≤(n+p)p/2 for a standard Gaussian uuu on Rn\mathbb R^nRn and p≥2p \ge 2p≥2. This is already proved on the platform and is reused.
  • Corollary 2.1. E∥Pu0∥p≤(d+p)p/2\mathbb E\|Pu_0\|^p \le (d+p)^{p/2}E∥Pu0​∥p≤(d+p)p/2.
  • Proposition 2.1(a). ∥E gμ(x)−grad⁡f(x)∥≤μL2(d+3)3/2\|\mathbb E\,g_\mu(x) - \operatorname{grad}f(x)\| \le \frac{\mu L}{2}(d+3)^{3/2}∥Egμ​(x)−gradf(x)∥≤2μL​(d+3)3/2 for the single-sample estimator gμg_\mugμ​.
  • Lemma 3.1. E∥gˉμ,ξ(x)−grad⁡f(x)∥2≤μ2L2(d+6)3+8(d+4)mσ2+8(d+4)m∥grad⁡f(x)∥2\mathbb E\|\bar g_{\mu,\xi}(x) - \operatorname{grad}f(x)\|^2 \le \mu^2L^2(d+6)^3 + \frac{8(d+4)}{m}\sigma^2 + \frac{8(d+4)}{m}\|\operatorname{grad}f(x)\|^2E∥gˉ​μ,ξ​(x)−gradf(x)∥2≤μ2L2(d+6)3+m8(d+4)​σ2+m8(d+4)​∥gradf(x)∥2.

Significance

Theorem 3.2 is the basic complexity result for derivative-free stochastic optimization on manifolds. With the parameter choices of (3.10) it gives an ϵ\epsilonϵ-stationary point in expectation after O(d/ϵ4)O(d/\epsilon^4)O(d/ϵ4) noisy function evaluations. The dependence is on the manifold dimension ddd, not on the ambient dimension nnn. This matches the Euclidean rate of Ghadimi and Lan with nnn replaced by ddd, and it is what makes projected-Gaussian estimators attractive when d≪nd \ll nd≪n (for example, low-dimensional Stiefel manifolds embedded in large matrix spaces).

The results are proved in the paper (main text, p. 17, and Appendix C) but, to our knowledge, none of them has been machine-checked. The Euclidean Gaussian moment bound (Lemma 2.2) is formalized on the platform. The Euclidean RSGF results of Ghadimi and Lan are stated on the platform, and they are different statements: they use x+μux + \mu ux+μu instead of a retraction, the full space instead of a tangent space, and a random output index. A complete formalization would also produce reusable infrastructure: Gaussian identities for orthogonal projections, the projected-Gaussian moment bound, and a template for proving stationarity rates of random iterates on a product probability space.

Difficulty

The Euclidean argument relies on a smoothed function fμ(x)=Ef(x+μu)f_\mu(x) = \mathbb E f(x + \mu u)fμ​(x)=Ef(x+μu) whose gradient is exactly the mean of the estimator. That identity has no Riemannian analogue: Rx(μu)R_x(\mu u)Rx​(μu) is not a translate, so E gμ(x)\mathbb E\,g_\mu(x)Egμ​(x) is not the gradient of any smoothed function. The bias in Proposition 2.1(a) has to be bounded directly from Assumption 2.1, and this is why the estimator is only approximately unbiased.

The convergence proof needs a one-step descent inequality conditioned on the past. The direction at step kkk is projected onto TxkMT_{x_k}\mathcal MTxk​​M, which depends on all earlier draws, so the conditional bound of Lemma 3.1 must be integrated against the product law of the batches. A naive reading that samples every direction from one fixed subspace, or that treats the iterates as deterministic, does not describe the algorithm. A further subtlety is that the gradient term of Lemma 3.1 must be absorbed by the descent of one step. This requires the batch to be large compared with the dimension, m≥16(d+4)m \ge 16(d+4)m≥16(d+4).

Formalization scope

  • EEE is any finite-dimensional real inner product space with its Borel σ-algebra. The Gaussian is Mathlib's stdGaussian E.
  • M\mathcal MM and its dimension are given by the published ProjLikeRetr.Retractor.IsSubmanifold 1 d M (a C1C^1C1 coordinate-slice submanifold), so ddd is tied to M\mathcal MM and is never a free number. TxMT_x\mathcal MTx​M is the published ProjLikeRetr.Retractor.tangentSpace M x, never an arbitrary subspace.
  • The retraction is defined on all of each tangent space, as the paper requires (Assumption 2.1 holds "for all η∈TxM\eta \in T_x\mathcal Mη∈Tx​M, i.e., ρx=∞\rho_x = \inftyρx​=∞"). The objective fff and the samples F(⋅,ξ)F(\cdot,\xi)F(⋅,ξ) are assumed differentiable rather than smooth, which is all the gradient formula (2.3) uses.
  • Added hypotheses. The goal assumes m≥16(d+4)m \ge 16(d+4)m≥16(d+4). The paper's proof assumes it explicitly, but the theorem statement omits it. The goal also assumes that (x,η)↦Rx(η)(x,\eta) \mapsto R_x(\eta)(x,η)↦Rx​(η) and x↦Pxx \mapsto P_xx↦Px​ are measurable, so that the iterates are random variables; this holds for closed M\mathcal MM such as spheres and Stiefel manifolds. Lemma 3.1 is stated for every m≥1m \ge 1m≥1. The paper's last proof step uses m≥2m \ge 2m≥2, but the bound holds for m=1m = 1m=1 as well.
  • The iterates are defined for every kkk on the sequence space of i.i.d. batches (the algorithm without a stopping index), so xN+1x_{N+1}xN+1​ exists.
  • No junk expectations. Every expectation of a nonnegative quantity is a lower Lebesgue integral compared with ENNReal.ofReal of the bound. Every vector-valued expectation comes with an integrability conclusion, and Assumption 2.3 carries the integrability of F(x,⋅)F(x,\cdot)F(x,⋅) and grad⁡F(x,⋅)\operatorname{grad}F(x,\cdot)gradF(x,⋅). So no statement can hold because a Bochner integral defaulted to 000.
  • The O(⋅)O(\cdot)O(⋅) parameter choices (3.10) and the oracle complexity mN=O(d/ϵ4)mN = O(d/\epsilon^4)mN=O(d/ϵ4) are not formalized.
  • The development needs projections of Gaussian measures onto subspaces, moments of Gaussian norms, conditional expectation along an i.i.d. sequence of batches, and telescoping. Proofs of any milestone are welcome, as are general lemmas about the push-forward of stdGaussian under an orthogonal projection.

Selected references

  • J. Li, K. Balasubramanian, S. Ma, Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization, Mathematics of Operations Research, 2023. Preprint arXiv:2003.11238v3. https://arxiv.org/abs/2003.11238
  • Y. Nesterov, V. Spokoiny, Random Gradient-Free Minimization of Convex Functions, Foundations of Computational Mathematics 17, 2017. https://doi.org/10.1007/s10208-015-9296-2
  • S. Ghadimi, G. Lan, Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming, SIAM Journal on Optimization 23(4), 2013. https://arxiv.org/abs/1309.5549
  • K. Balasubramanian, S. Ghadimi, Zeroth-Order Nonconvex Stochastic Optimization: Handling Constraints, High Dimensionality, and Saddle Points, Foundations of Computational Mathematics, 2022. https://arxiv.org/abs/1809.06474
  • N. Boumal, P.-A. Absil, C. Cartis, Global Rates of Convergence for Nonconvex Optimization on Manifolds, IMA Journal of Numerical Analysis, 2019. https://arxiv.org/abs/1605.08101
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008.
13 thms2 active usersReviewed
Machine LearningOptimizationProbability·Captain: mikedeng1

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization 1: ZO-RGD Has Average Expected Squared Riemannian Gradient Norm at Most 8(d+4)L(f(x₀) − f(x*))/(N+1) + 8(d+4)L·C(μ)Research Paper

Motivation

Many optimization problems in statistics and machine learning constrain the variable to a smooth manifold: orthonormal frames in sparse PCA and dictionary learning (the Stiefel manifold), unit vectors in phase retrieval (the sphere), fixed-rank matrices in matrix completion. Riemannian optimization handles these problems directly on the manifold. A step is taken in the tangent space and mapped back to the manifold by a retraction.

In several applications the objective can be evaluated but not differentiated: black-box adversarial attacks, simulation-based models, and hyperparameter or policy tuning. Zeroth-order (derivative-free) methods replace the gradient by an estimator built from function values. In Euclidean space the standard construction is Gaussian smoothing, analysed by Nesterov and Spokoiny (2017) and Ghadimi and Lan (2013). Li, Balasubramanian and Ma (arXiv:2003.11238; Mathematics of Operations Research, 2023) carry the construction over to embedded submanifolds. They sample a Gaussian vector, project it onto the tangent space, and use the retraction in place of the straight line x+μux+\mu ux+μu. This mission formalizes their first optimization guarantee: the convergence rate of zeroth-order Riemannian gradient descent (ZO-RGD).

Setting

Let EEE be a finite-dimensional real inner product space (the ambient Rn\mathbb R^nRn). Let M⊆EM\subseteq EM⊆E be a C1C^1C1 embedded submanifold of dimension ddd. At each x∈Mx\in Mx∈M the tangent space TxMT_xMTx​M is a ddd-dimensional linear subspace of EEE; let PxP_xPx​ denote the orthogonal projection onto it. MMM carries the metric induced by the inner product of EEE.

A retraction is a map (x,η)↦Rx(η)(x,\eta)\mapsto R_x(\eta)(x,η)↦Rx​(η) such that, for every x∈Mx\in Mx∈M, RxR_xRx​ is smooth on TxMT_xMTx​M, maps TxMT_xMTx​M into MMM, satisfies Rx(0)=xR_x(0)=xRx​(0)=x, and has the identity as its differential at 000. In this mission RxR_xRx​ is defined on all of TxMT_xMTx​M.

For a differentiable f:E→Rf:E\to\mathbb Rf:E→R the Riemannian gradient is grad⁡f(x)=Px∇f(x)\operatorname{grad} f(x)=P_x\nabla f(x)gradf(x)=Px​∇f(x). Assumption 2.1 (retraction smoothness) asks for a constant L≥0L\ge0L≥0 such that

∣f(Rx(η))−f(x)−⟨grad⁡f(x),η⟩∣≤L2∥η∥2(x∈M, η∈TxM).\big|f(R_x(\eta))-f(x)-\langle \operatorname{grad} f(x),\eta\rangle\big|\le \tfrac L2\|\eta\|^2\qquad(x\in M,\ \eta\in T_xM).​f(Rx​(η))−f(x)−⟨gradf(x),η⟩​≤2L​∥η∥2(x∈M, η∈Tx​M).

Given μ>0\mu>0μ>0 and a standard Gaussian vector u0∼N(0,In)u_0\sim N(0,I_n)u0​∼N(0,In​) of EEE, set u=Pxu0u=P_xu_0u=Px​u0​. The zeroth-order Riemannian gradient estimator is

gμ(x)=f(Rx(μu))−f(x)μ u.g_\mu(x)=\frac{f(R_x(\mu u))-f(x)}{\mu}\,u .gμ​(x)=μf(Rx​(μu))−f(x)​u.

ZO-RGD (Algorithm 1) starts at x0∈Mx_0\in Mx0​∈M, draws independent Gaussian vectors u00,u01,…u_0^0,u_0^1,\dotsu00​,u01​,…, and sets xk+1=Rxk(−η^ gμ(xk))x_{k+1}=R_{x_k}(-\hat\eta\, g_\mu(x_k))xk+1​=Rxk​​(−η^​gμ​(xk​)), where gμ(xk)g_\mu(x_k)gμ​(xk​) uses uk=Pxku0ku_k=P_{x_k}u_0^kuk​=Pxk​​u0k​. The step size is η^=1/(2(d+4)L)\hat\eta=1/(2(d+4)L)η^​=1/(2(d+4)L). Let x∗∈Mx^*\in Mx∗∈M be a minimizer of fff over MMM.

Formalization targets

Goal: Theorem 3.1

For every N≥0N\ge0N≥0,

1N+1∑k=0NE ∥grad⁡f(xk)∥2≤4η^(f(x0)−f(x∗)N+1+C(μ)),\frac1{N+1}\sum_{k=0}^{N}\mathbb E\,\|\operatorname{grad} f(x_k)\|^2\le\frac4{\hat\eta}\left(\frac{f(x_0)-f(x^*)}{N+1}+C(\mu)\right),N+11​k=0∑N​E∥gradf(xk​)∥2≤η^​4​(N+1f(x0​)−f(x∗)​+C(μ)),

where 4/η^=8(d+4)L4/\hat\eta=8(d+4)L4/η^​=8(d+4)L and

C(μ)=μ2L16(d+3)3d+4+μ2L16(d+6)3d+4+μ2L16(d+6)3(d+4)2.C(\mu)=\frac{\mu^2L}{16}\frac{(d+3)^3}{d+4}+\frac{\mu^2L}{16}\frac{(d+6)^3}{d+4}+\frac{\mu^2L}{16}\frac{(d+6)^3}{(d+4)^2}.C(μ)=16μ2L​d+4(d+3)3​+16μ2L​d+4(d+6)3​+16μ2L​(d+4)2(d+6)3​.

Milestones

These are the paper's own intermediate results (§2.2, p. 8):

  1. Lemma 2.1. For a subspace X\mathcal XX with projection PPP, u=Pu0u=Pu_0u=Pu0​ and x∈Xx\in\mathcal Xx∈X: E⟨x,u⟩u=x\mathbb E\langle x,u\rangle u=xE⟨x,u⟩u=x and E⟨x,u⟩2=∥x∥2\mathbb E\langle x,u\rangle^2=\|x\|^2E⟨x,u⟩2=∥x∥2.
  2. Lemma 2.2 (Nesterov–Spokoiny). E∥u∥p≤(n+p)p/2\mathbb E\|u\|^p\le(n+p)^{p/2}E∥u∥p≤(n+p)p/2 for p≥2p\ge2p≥2. This result is already on the platform as a proved theorem and is referenced.
  3. Corollary 2.1. If dim⁡X=d\dim\mathcal X=ddimX=d, then E∥Pu0∥p≤(d+p)p/2\mathbb E\|Pu_0\|^p\le(d+p)^{p/2}E∥Pu0​∥p≤(d+p)p/2.
  4. Proposition 2.1(a). ∥Egμ(x)−grad⁡f(x)∥≤μL2(d+3)3/2\|\mathbb E g_\mu(x)-\operatorname{grad} f(x)\|\le\frac{\mu L}{2}(d+3)^{3/2}∥Egμ​(x)−gradf(x)∥≤2μL​(d+3)3/2.
  5. Proposition 2.1(b). ∥grad⁡f(x)∥2≤2∥Egμ(x)∥2+μ22L2(d+6)3\|\operatorname{grad} f(x)\|^2\le2\|\mathbb E g_\mu(x)\|^2+\frac{\mu^2}{2}L^2(d+6)^3∥gradf(x)∥2≤2∥Egμ​(x)∥2+2μ2​L2(d+6)3.
  6. Proposition 2.1(c). E∥gμ(x)∥2≤μ22L2(d+6)3+2(d+4)∥grad⁡f(x)∥2\mathbb E\|g_\mu(x)\|^2\le\frac{\mu^2}{2}L^2(d+6)^3+2(d+4)\|\operatorname{grad} f(x)\|^2E∥gμ​(x)∥2≤2μ2​L2(d+6)3+2(d+4)∥gradf(x)∥2.

Significance

Theorem 3.1 shows that ZO-RGD reaches an ϵ\epsilonϵ-stationary point in expectation using O(d/ϵ2)O(d/\epsilon^2)O(d/ϵ2) function evaluations, provided the smoothing parameter is of order ϵ/d3/2\epsilon/d^{3/2}ϵ/d3/2. The dimension that enters is the intrinsic dimension ddd of the manifold, not the ambient dimension nnn. For the Stiefel manifold of n×pn\times pn×p orthonormal frames this is the difference between np−p(p+1)/2np-p(p+1)/2np−p(p+1)/2 and npnpnp, and for the sphere between n−1n-1n−1 and nnn. More importantly, the estimator never explores normal directions. The three estimates of Proposition 2.1 are the toolkit that the paper reuses for its stochastic (ZO-RSGD), proximal (ZO-ManPG) and second-order variants.

The paper proves these results on paper; none of them has a machine-checked proof. The mission adds three things. It gives a precise model of a random iterate sequence on a submanifold, driven by the infinite product of Gaussian draws. It formalizes the projected-Gaussian identities, which are reusable for any method that samples in tangent spaces. And it pins down the constants. In checking the constants, the printed Proposition 2.1(b) turned out to be false for large LLL (its proof yields L2L^2L2, not LLL), and the middle term of the printed C(μ)C(\mu)C(μ) inherits that slip. The statements here carry the constants the proofs actually give.

Difficulty

In Euclidean space, E gμ(x)\mathbb E\,g_\mu(x)Egμ​(x) is exactly the gradient of the Gaussian-smoothed function fμ(x)=Ef(x+μu)f_\mu(x)=\mathbb E f(x+\mu u)fμ​(x)=Ef(x+μu), and the analysis runs on fμf_\mufμ​. Once a retraction replaces x+μux+\mu ux+μu, no smoothed function has Egμ\mathbb E g_\muEgμ​ as its gradient. The bias must be estimated directly from Assumption 2.1, which controls f∘Rxf\circ R_xf∘Rx​ only along the tangent space. The moment bounds must then be taken for a Gaussian projected onto a subspace that changes with xxx.

In the descent argument, the direction uku_kuk​ is sampled in TxkMT_{x_k}MTxk​​M, which depends on all earlier draws. The expectation of step kkk is therefore conditional on the past. Summing the one-step inequality requires conditional expectations on the product space, together with measurability of the iterate map. Finiteness of Ef(xk)\mathbb E f(x_k)Ef(xk​) is not given and must be handled as well.

Formalization scope

  • Space. The ambient space is a finite-dimensional real inner product space EEE. The standard Gaussian is Mathlib's stdGaussian E, so κ−1∫⋯e−∥u0∥2/2du0\kappa^{-1}\int\cdots e^{-\|u_0\|^2/2}du_0κ−1∫⋯e−∥u0​∥2/2du0​ becomes integration against it.
  • Manifold and tangent spaces. The manifold is given by the published coordinate-slice predicate ProjLikeRetr.Retractor.IsSubmanifold 1 d M, which ties ddd to MMM. The tangent space is the published ProjLikeRetr.Retractor.tangentSpace M x, the span of Mathlib's tangent cone. Neither ddd nor the tangent spaces are free parameters.
  • Retraction. The retraction is global: Assumption 2.1 is required for every η∈TxM\eta\in T_xMη∈Tx​M (the paper's "ρx=∞\rho_x=\inftyρx​=∞"). "Smooth" means C∞C^\inftyC∞, not analytic.
  • Regularity of fff. fff is assumed differentiable on EEE, which is what the definition grad⁡f=Px∇f\operatorname{grad} f=P_x\nabla fgradf=Px​∇f needs. This is weaker than the paper's "smooth".
  • Constants. The goal takes L>0L>0L>0, because the step size divides by LLL. The milestones take L≥0L\ge0L≥0 and μ>0\mu>0μ>0.
  • Draws and iterates. The draws live on ENE^{\mathbb N}EN with the infinite product of standard Gaussian measures. The iterates are defined for every kkk: the algorithm runs without a stopping time, so the sum over k=0,…,Nk=0,\dots,Nk=0,…,N is meaningful.
  • Minimizer. x∗x^*x∗ is an attained minimizer over MMM.
  • Measurability. The goal adds two measurability hypotheses that make the iterates random variables: (x,η)↦Rx(η)(x,\eta)\mapsto R_x(\eta)(x,η)↦Rx​(η) is measurable and x↦Pxx\mapsto P_xx↦Px​ is measurable. Both hold for closed manifolds such as spheres and Stiefel manifolds.
  • Corrected constants. Proposition 2.1(b) carries L2L^2L2, and the middle term of C(μ)C(\mu)C(μ) carries LLL. The milestone texts keep the printed forms. Proposition 2.1(a) and (c) are as printed.
  • Not formalized. The parameter choices μ=O(ϵ/d3/2)\mu=O(\epsilon/d^{3/2})μ=O(ϵ/d3/2), N=O(d/ϵ2)N=O(d/\epsilon^2)N=O(d/ϵ2) in the theorem's second sentence are an O(⋅)O(\cdot)O(⋅) statement.

Several trivializing formalizations are ruled out. A Bochner integral of a non-integrable function is 000, so every expectation in a conclusion is either a lower Lebesgue integral compared with a finite bound or paired with an integrability conjunct. The dimension ddd comes from the manifold, not from a free natural number. The projection is onto MMM's own tangent space, never onto an arbitrary subspace field.

A complete development needs the following infrastructure:

  • the law of Pu0P u_0Pu0​ (a standard Gaussian on the subspace);
  • Gaussian moment bounds;
  • conditional expectation along the product filtration;
  • measurability of the iterate map.

The projected-Gaussian lemmas and the iterate model are reusable for the stochastic variant (ZO-RSGD) in the companion mission. Contributions of proofs for any milestone, and of general lemmas about Gaussian measures restricted to subspaces, are welcome.

Selected references

  • J. Li, K. Balasubramanian, S. Ma, Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization, Mathematics of Operations Research, 2023; preprint arXiv:2003.11238v3, 2021. https://arxiv.org/abs/2003.11238
  • Y. Nesterov, V. Spokoiny, Random Gradient-Free Minimization of Convex Functions, Foundations of Computational Mathematics 17 (2017) 527–566. https://doi.org/10.1007/s10208-015-9296-2
  • S. Ghadimi, G. Lan, Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming, SIAM Journal on Optimization 23 (2013) 2341–2368. https://doi.org/10.1137/120880811
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008. https://doi.org/10.1515/9781400830244
13 thms2 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Inefficiency of Nash Equilibria: For an Open Dense Set of C² Payoffs, Nash Equilibria Are Finite, an Efficient One Has a Player at a Vertex, and a Strong One Has at Most One Player off a VertexResearch Paper

Motivation

That noncooperative play usually wastes something is part of the folklore of game theory, with the Prisoner's Dilemma as its emblem: each player's best reply leads to an outcome that both would trade for another. Pradeep Dubey's paper turns this folklore into a theorem about smooth games. For games whose payoffs are twice continuously differentiable, and for all payoffs outside a negligible (closed, nowhere dense) set, Nash equilibria are finite in number and are Pareto-inefficient unless some player sits at a vertex of his strategy set. The same conclusion applies to Nash's mixed extensions of finite games (Nash 1951), where a vertex is a pure strategy.

The question is basic to welfare analysis of strategic interaction: market games, oligopoly, public goods and trading mechanisms (Shapley and Shubik 1977) all ask whether equilibrium outcomes can be efficient. Dubey's answer is that efficiency of an equilibrium is non-generic, so a model that delivers it is exploiting special structure.

Timeline. Nash (1951) introduced equilibrium points and multi-matrix games. Smale (1973, "Optimizing several functions") gave the first-order condition for Pareto optimality of several smooth functions: at an efficient interior point the gradients are linearly dependent. Harsanyi (1973, IJGT 2:235–250) proved that generic finite games have finitely many, indeed an odd number of, mixed equilibria. Dubey's Cowles Foundation Discussion Paper 508R (1978) stated finiteness and inefficiency; the version formalized here is the rewrite IIASA WP-83-74 (1983), published as Mathematics of Operations Research 11(1):1–8 (1986).

Setting

There are n≥2n\ge2n≥2 players N={1,…,n}N=\{1,\dots,n\}N={1,…,n}. Player iii's strategy set is the unit simplex

Si={x∈R+k(i):∑j=1k(i)xj≤1},k(i)≥1,S^i=\Big\{x\in\mathbb R^{k(i)}_+ : \sum_{j=1}^{k(i)}x_j\le1\Big\},\qquad k(i)\ge1,Si={x∈R+k(i)​:j=1∑k(i)​xj​≤1},k(i)≥1,

whose vertices (extreme points) are the origin and the unit vectors. Profiles s=(s1,…,sn)s=(s^1,\dots,s^n)s=(s1,…,sn) range over S=S1×⋯×Sn⊂Rr(n)S=S^1\times\dots\times S^n\subset\mathbb R^{r(n)}S=S1×⋯×Sn⊂Rr(n), r(n)=∑ik(i)r(n)=\sum_i k(i)r(n)=∑i​k(i).

Fix open neighbourhoods Vi⊇SiV^i\supseteq S^iVi⊇Si and V=V1×⋯×VnV=V^1\times\dots\times V^nV=V1×⋯×Vn. The space UUU consists of the C2C^2C2 functions f:V→Rf:V\to\mathbb Rf:V→R with finite C2C^2C2-norm ∥f∥=sup⁡{∥f(s)∥,∥Df(s)∥,∥D2f(s)∥:s∈V}\|f\|=\sup\{\|f(s)\|,\|Df(s)\|,\|D^2f(s)\|: s\in V\}∥f∥=sup{∥f(s)∥,∥Df(s)∥,∥D2f(s)∥:s∈V}. A game is u=(u1,…,un)∈(U)nu=(u^1,\dots,u^n)\in(U)^nu=(u1,…,un)∈(U)n. For T⊆NT\subseteq NT⊆N, (s∣e)(s|e)(s∣e) replaces sis^isi by eie^iei for i∈Ti\in Ti∈T. A profile s∈Ss\in Ss∈S is TTT-efficient if no e∈×i∈TSie\in\times_{i\in T}S^ie∈×i∈T​Si gives ui(s∣e)≥ui(s)u^i(s|e)\ge u^i(s)ui(s∣e)≥ui(s) for all i∈Ti\in Ti∈T with strict inequality for some j∈Tj\in Tj∈T. It is a Nash equilibrium if it is {i}\{i\}{i}-efficient for each iii, efficient if it is NNN-efficient, and a strong Nash equilibrium if it is TTT-efficient for every TTT. The three sets are N(u)N(u)N(u), E(u)E(u)E(u), G(u)G(u)G(u).

In the proof, Du(s)D_u(s)Du​(s) is the n×r(n)n\times r(n)n×r(n) matrix with rows Dui(s)Du^i(s)Dui(s); N∗N^*N∗ is the subspace of matrices whose iii-th row vanishes on player iii's block of columns; E∗E^*E∗ is the set of matrices with linearly dependent rows.

Formalization targets

Goal: the Theorem (p. 3)

There is an open dense set U0⊆(U)nU_0\subseteq(U)^nU0​⊆(U)n such that for u∈U0u\in U_0u∈U0​:

(a) N(u) is finite;(b) s∈N(u)∩E(u)⇒∃j, sj is a vertex;(c) s∈G(u)⇒at most one sj is not a vertex.\text{(a) } N(u)\text{ is finite};\quad \text{(b) } s\in N(u)\cap E(u)\Rightarrow \exists j,\ s^j\text{ is a vertex};\quad \text{(c) } s\in G(u)\Rightarrow \text{at most one } s^j \text{ is not a vertex}.(a) N(u) is finite;(b) s∈N(u)∩E(u)⇒∃j, sj is a vertex;(c) s∈G(u)⇒at most one sj is not a vertex.

Milestones (pp. 4–6)

For interior profiles (si∈Int⁡Sis^i\in\operatorname{Int}S^isi∈IntSi for all iii):

(i) s∈N(u)⇒Du(s)∈N∗,(ii) s∈E(u)⇒Du(s)∈E∗,\text{(i) } s\in N(u)\Rightarrow D_u(s)\in N^*,\qquad \text{(ii) } s\in E(u)\Rightarrow D_u(s)\in E^*,(i) s∈N(u)⇒Du​(s)∈N∗,(ii) s∈E(u)⇒Du​(s)∈E∗,

codim⁡N∗=r(n)\operatorname{codim}N^*=r(n)codimN∗=r(n); the linear perturbation uti(x)=u0i(x)+t∑jyijxju_t^i(x)=u_0^i(x)+t\sum_j y_{ij}x_juti​(x)=u0i​(x)+t∑j​yij​xj​ satisfies ddtD(ut,s0)∣t=0=y\frac{d}{dt}D(u_t,s_0)|_{t=0}=ydtd​D(ut​,s0​)∣t=0​=y (the computation behind (**)); claim (*) for M=N∗M=N^*M=N∗: for an open dense set of games DuD_uDu​ is transverse to N∗N^*N∗ on a compact neighbourhood V‾\underline VV​ of SSS; under that transversality S∩Du−1(N∗)S\cap D_u^{-1}(N^*)S∩Du−1​(N∗) is finite; and the Theorem restricted to interior profiles.

Companions

The Theorem (Multi-Matrix) (p. 14): for an open dense set of payoff vectors a∈(RK)na\in(\mathbb R^K)^na∈(RK)n, the mixed Nash equilibria of Πa\Pi_aΠa​ are finite, an efficient one has a player using a pure strategy, and a strong one is pure. From the example of §3: every game (P,Q)(P,Q)(P,Q) on [0,1]2[0,1]^2[0,1]2 with payoffs uP(x,y)=−[(x−a)2+(y−b)2]u_P(x,y)=-[(x-a)^2+(y-b)^2]uP​(x,y)=−[(x−a)2+(y−b)2] has a unique Nash equilibrium (p. 9); Lemma 1, E(P,Q)=rX(L(P,Q))E(P,Q)=r_X(L(P,Q))E(P,Q)=rX​(L(P,Q)) (p. 9); Lemma 2(a), an interior equilibrium is efficient iff a=ca=ca=c or b=db=db=d (p. 10).

Significance

The theorem gives the generic structure of equilibrium sets in smooth games: isolated and finitely many equilibria, and a sharp location of the only places where efficient equilibria can survive, namely the vertices. It explains why efficiency results for noncooperative models need boundary solutions or non-generic structure, and in its multi-matrix form it shows that strong equilibria of generic finite games are in pure strategies. It also supplies the finiteness of equilibria used in comparative-statics and index arguments.

On the formalization side, the result is proved on paper but has no machine-checked version. A complete development would give Lean its first generic-finiteness theorem for Nash equilibria of smooth games, a first-order Pareto condition in the form of Smale's lemma, and a parametric transversality argument in finite dimensions. The multi-matrix companion connects to the published vocabulary of finite games (agt_games), and the example of §3 is an elementary, fully explicit check of the general picture.

Difficulty

The interior case reduces, by (i) and (ii), to a dimension count: Du−1(N∗)D_u^{-1}(N^*)Du−1​(N∗) should be zero-dimensional and Du−1(N∗∩E∗)D_u^{-1}(N^*\cap E^*)Du−1​(N∗∩E∗) empty. Neither holds for every game: they hold only when DuD_uDu​ is transverse to N∗N^*N∗ and to the strata of N∗∩E∗N^*\cap E^*N∗∩E∗, and the step that requires work is showing that transversality is an open and dense condition in the C2C^2C2 topology. Density is not obtained by adding linear functions to the payoffs: a linear function has finite C2C^2C2-norm on VVV only when VVV is bounded, so perturbations must be localized. The step from interior profiles to the whole of SSS is a second difficulty. It requires repeating the argument on every product of faces of the simplices and on every subgame, and then intersecting finitely many open dense sets. Efficiency at a boundary point is not TTT-efficiency in a subgame, so the reduction has to be made with care.

Formalization scope

Players are Fin n with 2 ≤ n; block sizes k : Fin n → ℕ with 1 ≤ k i; profiles are ∀ i, Fin (k i) → ℝ. The simplex is the paper's corner simplex {x ≥ 0, ∑ x ≤ 1}, not the probability simplex; "vertex" is Set.extremePoints. The neighbourhoods ViV^iVi are taken open, and the goal is stated for every such choice, not assuming VVV bounded or convex. Payoffs are total functions; a game is ContDiffOn ℝ 2 on VVV with finite C2C^2C2-norm, which takes values in [0,∞][0,\infty][0,∞], so no junk real supremum enters. "Open dense in (U)n(U)^n(U)n" is written in ε\varepsilonε-form for the product of C2C^2C2-norm topologies; Lean's sup-type norms are equivalent to the Euclidean ones, so the open dense sets are the same. Deviations range over all strategies in ×i∈TSi\times_{i\in T}S^i×i∈T​Si, not only pure or vertex deviations.

Added hypotheses, all disclosed in the items: openness of ViV^iVi; interiority of every sis^isi on milestones (i), (ii) and the finiteness step (the proof's standing case assumption); M=N∗M=N^*M=N∗ in claim (*). The printed "By (i), N(u)⊂S∩Du−1(N∗)N(u)\subset S\cap D_u^{-1}(N^*)N(u)⊂S∩Du−1​(N∗)" is stated for interior equilibria, which is where (i) applies.

A trivializing formalization is ruled out: the open dense set must contain games arbitrarily close to every game (the zero game is a game, so it is never empty), interiority appears only in the milestones and not in the goal, and efficiency is with respect to all deviations in SSS.

Not stated: (*) for a general submanifold MMM, and the decomposition of N∗∩E∗N^*\cap E^*N∗∩E∗ into submanifolds of codimension ≥r(n)+1\ge r(n)+1≥r(n)+1, both of which need embedded submanifolds of RN\mathbb R^NRN; Remarks 1–4 (Remark 4's openness claim for strictly concave payoffs is false as printed); Lemma 2(b); §5, which the author leaves as a conjecture. Contributions welcome: a finite-dimensional parametric transversality theorem, Smale's first-order Pareto condition, and the face-by-face reduction.

Selected references

  • P. Dubey, Inefficiency of Nash Equilibria, IIASA Working Paper WP-83-74, 1983; Mathematics of Operations Research 11(1):1–8, 1986. https://doi.org/10.1287/moor.11.1.1
  • J. F. Nash, Non-Cooperative Games, Annals of Mathematics 54:286–295, 1951. https://doi.org/10.2307/1969529
  • J. C. Harsanyi, Oddness of the Number of Equilibrium Points: A New Proof, International Journal of Game Theory 2:235–250, 1973. https://doi.org/10.1007/BF01737572
  • S. Smale, Optimizing Several Functions, Manifolds — Tokyo 1973, Proceedings of the International Conference on Manifolds, University of Tokyo Press, 1975.
  • R. Abraham and J. Robbin, Transversal Mappings and Flows, W. A. Benjamin, New York, 1967.
  • L. S. Shapley and M. Shubik, Trade Using One Commodity as a Means of Payment, Journal of Political Economy 85:937–968, 1977. https://doi.org/10.1086/260617
13 thms2 active usersReviewed
Functional AnalysisProbability·Captain: mikedeng1

Bakry–Émery Curvature-Dimension Condition and Riemannian Ricci Curvature Bounds 5: A Product of Riemannian Energy Measure Spaces with BE(K,N_X) and BE(K,N_Y) Satisfies BE(K,N_X+N_Y)Research Paper

Motivation

A lower bound KKK on the Ricci curvature of a Riemannian manifold and an upper bound NNN on its dimension can be expressed without coordinates in two ways. The Bakry–Émery condition BE(K,N)\mathrm{BE}(K,N)BE(K,N) is a property of the heat semigroup and its generator: the iterated carré du champ Γ2\Gamma_2Γ2​ dominates KΓ+1N(Δf)2K\Gamma+\frac1N(\Delta f)^2KΓ+N1​(Δf)2 (Bakry–Émery 1985). The Riemannian curvature-dimension conditions RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) and RCD∗(K,N)\mathrm{RCD}^*(K,N)RCD∗(K,N) are properties of a metric measure space, defined through optimal transport (Ambrosio–Gigli–Savaré 2014). A basic test for any notion of "Ricci curvature at least KKK, dimension at most NNN" is its behaviour under products: on a product of manifolds, Ricci curvature bounds combine and dimensions add.

The paper of Ambrosio, Gigli and Savaré (arXiv:1209.5786) proves that BE(K,∞)\mathrm{BE}(K,\infty)BE(K,∞) and RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) coincide on a natural class of Dirichlet-form spaces, and draws from it, in its §5.1, two tensorization results. The first (Theorem 5.1) is the stability of RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) under products. This had been proved in Ambrosio–Gigli–Savaré 2014 only under a nonbranching assumption on the factors; the equivalence removes that assumption. The second (Theorem 5.2) is the dimensional statement: the product of two Riemannian Energy measure spaces satisfying BE(K,NX)\mathrm{BE}(K,N_X)BE(K,NX​) and BE(K,NY)\mathrm{BE}(K,N_Y)BE(K,NY​) satisfies BE(K,NX+NY)\mathrm{BE}(K,N_X+N_Y)BE(K,NX​+NY​), the bound on the dimension of the product that the smooth case predicts.

Setting

Let XXX be a complete separable metric space with a Borel measure m\mathfrak mm. A Dirichlet form is a quadratic, L2L^2L2-lower semicontinuous, Markovian functional E:L2(X,m)→[0,∞]\mathcal E:L^2(X,\mathfrak m)\to[0,\infty]E:L2(X,m)→[0,∞] with dense domain V\mathbb VV. Its generator ΔE\Delta_{\mathcal E}ΔE​ is defined by E(f,g)=−∫g ΔEf dm\mathcal E(f,g)=-\int g\,\Delta_{\mathcal E}f\,d\mathfrak mE(f,g)=−∫gΔE​fdm for all g∈Vg\in\mathbb Vg∈V, and its heat flow Pt\mathsf P_tPt​ solves ddtPtf=ΔEPtf\frac{d}{dt}\mathsf P_tf=\Delta_{\mathcal E}\mathsf P_tfdtd​Pt​f=ΔE​Pt​f. The carré du champ Γ(f)\Gamma(f)Γ(f) is the density of φ↦E(f,fφ)−12E(f2,φ)\varphi\mapsto\mathcal E(f,f\varphi)-\frac12\mathcal E(f^2,\varphi)φ↦E(f,fφ)−21​E(f2,φ). For ν=1/N≥0\nu=1/N\ge0ν=1/N≥0, BE(K,N)\mathrm{BE}(K,N)BE(K,N) is the weak form (2.33) of Γ2≥KΓ+ν(Δf)2\Gamma_2\ge K\Gamma+\nu(\Delta f)^2Γ2​≥KΓ+ν(Δf)2, written through the functional At[f;φ](s)=12∫(Pt−sf)2Psφ dm\mathsf A_t[f;\varphi](s)=\frac12\int(\mathsf P_{t-s}f)^2\mathsf P_s\varphi\,d\mathfrak mAt​[f;φ](s)=21​∫(Pt−s​f)2Ps​φdm.

The intrinsic distance is dE(x,y)=sup⁡{∣ψ(y)−ψ(x)∣:ψ continuous, Γ(ψ)≤1}\mathsf d_{\mathcal E}(x,y)=\sup\{|\psi(y)-\psi(x)|:\psi\text{ continuous},\ \Gamma(\psi)\le1\}dE​(x,y)=sup{∣ψ(y)−ψ(x)∣:ψ continuous, Γ(ψ)≤1}. An Energy measure space (Definition 3.6) is a strongly local Dirichlet form on a space whose metric is dE\mathsf d_{\mathcal E}dE​, with full-support measure and an exhausting function; a Riemannian Energy measure space (Definition 3.16) is in addition upper regular, and every ψ\psiψ with Γ(ψ)≤1\Gamma(\psi)\le1Γ(ψ)≤1 has a continuous version. An RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) space (Definition 3.1) is a length metric measure space with the growth bounds (MD.b) and (MD.exp) on which the relative entropy has an EVIK\mathrm{EVI}_KEVIK​ gradient flow in (P2(X),W2)(\mathscr P_2(X),W_2)(P2​(X),W2​).

The product (5.1) of (X,dX,mX)(X,\mathsf d_X,\mathfrak m_X)(X,dX​,mX​) and (Y,dY,mY)(Y,\mathsf d_Y,\mathfrak m_Y)(Y,dY​,mY​) is Z=X×YZ=X\times YZ=X×Y with

d((x,y),(x′,y′))=dX2(x,x′)+dY2(y,y′),m=mX×mY,\mathsf d((x,y),(x',y'))=\sqrt{\mathsf d_X^2(x,x')+\mathsf d_Y^2(y,y')},\qquad\mathfrak m=\mathfrak m_X\times\mathfrak m_Y,d((x,y),(x′,y′))=dX2​(x,x′)+dY2​(y,y′)​,m=mX​×mY​,

and the Cartesian Dirichlet form (5.2) is

E(f)=∫YEX(fy) dmY(y)+∫XEY(fx) dmX(x),\mathcal E(f)=\int_Y\mathcal E^X(f^y)\,d\mathfrak m_Y(y)+\int_X\mathcal E^Y(f^x)\,d\mathfrak m_X(x),E(f)=∫Y​EX(fy)dmY​(y)+∫X​EY(fx)dmX​(x),

where fy=f(⋅,y)f^y=f(\cdot,y)fy=f(⋅,y) and fx=f(x,⋅)f^x=f(x,\cdot)fx=f(x,⋅).

Formalization targets

Goal: Theorem 5.2

If (X,EX,mX)(X,\mathcal E^X,\mathfrak m_X)(X,EX,mX​) and (Y,EY,mY)(Y,\mathcal E^Y,\mathfrak m_Y)(Y,EY,mY​) are Riemannian Energy measure spaces satisfying (MD.exp), BE(K,NX)\mathrm{BE}(K,N_X)BE(K,NX​) and BE(K,NY)\mathrm{BE}(K,N_Y)BE(K,NY​), then

(Z,E,m) is a Riemannian Energy measure space with dE=d and BE(K,NX+NY).(Z,\mathcal E,\mathfrak m)\ \text{is a Riemannian Energy measure space with}\ \mathsf d_{\mathcal E}=\mathsf d\ \text{and}\ \mathrm{BE}(K,N_X+N_Y).(Z,E,m) is a Riemannian Energy measure space with dE​=d and BE(K,NX​+NY​).

In the parametrization ν=1/N\nu=1/Nν=1/N the product satisfies BE\mathrm{BE}BE with νZ=νXνY/(νX+νY)\nu_Z=\nu_X\nu_Y/(\nu_X+\nu_Y)νZ​=νX​νY​/(νX​+νY​).

Milestones

  1. Corollary 4.18 (i), p. 58: under (MD+exp) and a quadratic Cheeger energy, the length property together with the gradient bound
∣DPtf∣2≤e−2KtPt(∣Df∣w2)(4.30)|\mathrm D\mathsf P_tf|^2\le e^{-2Kt}\mathsf P_t(|\mathrm Df|_w^2)\tag{4.30}∣DPt​f∣2≤e−2KtPt​(∣Df∣w2​)(4.30)

implies RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞). 2. Theorem 5.1, p. 60: the product of two RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) spaces is RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞). 3. The elementary inequality of p. 62: νXa2+νYb2≥νXνYνX+νY(a+b)2\nu_Xa^2+\nu_Yb^2\ge\frac{\nu_X\nu_Y}{\nu_X+\nu_Y}(a+b)^2νX​a2+νY​b2≥νX​+νY​νX​νY​​(a+b)2 for positive νX,νY\nu_X,\nu_YνX​,νY​ and nonnegative a,ba,ba,b. 4. Lemma 5.3, p. 62: ΔZf(x,y)=ΔXfy(x)+ΔYfx(y)\Delta_Zf(x,y)=\Delta_Xf^y(x)+\Delta_Yf^x(y)ΔZ​f(x,y)=ΔX​fy(x)+ΔY​fx(y) under the fibrewise regularity (5.9), for the RCD factors and their Cheeger forms fixed in §5.1.

Significance

Theorem 5.1 shows that RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) is closed under products with no nonbranching condition on the factors, the hypothesis under which Ambrosio–Gigli–Savaré 2014 had obtained it. Theorem 5.2 gives the dimensional version for Dirichlet-form spaces, BE(K,NX)×BE(K,NY)⇒BE(K,NX+NY)\mathrm{BE}(K,N_X)\times\mathrm{BE}(K,N_Y)\Rightarrow\mathrm{BE}(K,N_X+N_Y)BE(K,NX​)×BE(K,NY​)⇒BE(K,NX​+NY​): a product of spaces of finite dimension has finite dimension, with the bound NX+NYN_X+N_YNX​+NY​ of the smooth case, while the condition BE(K,∞)\mathrm{BE}(K,\infty)BE(K,∞) alone loses all dimensional information.

Both results are proved in the paper; none of them, nor the objects they are stated for, has a machine-checked proof. The mission produces a Lean statement of the Cartesian Dirichlet form and of the product structure, the statements of the two tensorization theorems, and the characterization of RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) that drives Theorem 5.1. A formal proof would also check the measure-theoretic steps that the paper takes for granted: the measurability of y↦EX(fy)y\mapsto\mathcal E^X(f^y)y↦EX(fy), the Fubini arguments of Lemma 5.3, and the identification of the domain of the Cartesian form (cited from [Ambrosio–Gigli–Savaré 2014], Theorem 6.18).

Difficulty

The obvious argument works fibre by fibre: apply BE(K,NX)\mathrm{BE}(K,N_X)BE(K,NX​) to each section fyf^yfy and BE(K,NY)\mathrm{BE}(K,N_Y)BE(K,NY​) to each fxf^xfx, and add. This fails as stated, because Pt\mathsf P_tPt​ on ZZZ does not act on the sections separately: (Ptf)y(\mathsf P_tf)^y(Pt​f)y is an average over y′y'y′ of the semigroup of XXX applied to fy′f^{y'}fy′, weighted by the heat kernel of YYY, so fibrewise gradient and Laplacian bounds have to be transported through this average. For Theorem 5.2 a second step is not fibrewise at all: before any dimensional estimate, the product has to be shown to be a Riemannian Energy measure space whose intrinsic distance is the product distance, which in the paper goes through Theorem 5.1 and hence through the equivalence BE(K,∞)⇔RCD(K,∞)\mathrm{BE}(K,\infty)\Leftrightarrow\mathrm{RCD}(K,\infty)BE(K,∞)⇔RCD(K,∞) of Theorem 4.17.

Formalization scope

Functions on XXX are X → ℝ, and L2L^2L2 membership is MemLp f 2 m; every object is invariant under m\mathfrak mm-a.e. equality. Dirichlet forms take values in [0,∞][0,\infty][0,∞] and are +∞+\infty+∞ off L2L^2L2. Heat flows are passed as functions pinned by the predicate IsHeatSemigroup. Γ(f)\Gamma(f)Γ(f) is a predicate on a density. BE(K,N)\mathrm{BE}(K,N)BE(K,N) is parametrized by ν=1/N≥0\nu=1/N\ge0ν=1/N≥0; νZ=νXνY/(νX+νY)\nu_Z=\nu_X\nu_Y/(\nu_X+\nu_Y)νZ​=νX​νY​/(νX​+νY​) is 000 when either factor has N=∞N=\inftyN=∞. The product ZZZ is WithLp 2 (X × Y), whose metric is the ℓ2\ell^2ℓ2 distance (5.1); the plain type X × Y would carry the max-metric. The second term of (5.2) uses EY\mathcal E^YEY, correcting the printed EX(fx)\mathcal E^X(f^x)EX(fx). Factors are σ-finite.

Theorem 5.2 assumes (MD.exp) for both factors: its proof invokes Theorem 5.1, whose factors must be RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞), which a Riemannian Energy measure space with BE(K,∞)\mathrm{BE}(K,\infty)BE(K,∞) is only under (MD.exp). In Corollary 4.18, the minimal weak gradient is written as ∣Df∣w2=Γ(f)|\mathrm Df|_w^2=\Gamma(f)∣Df∣w2​=Γ(f), the identity that (QCh) asserts. Lemma 5.3 carries the RCD and Cheeger-form assumptions established at the opening of §5.1. The elementary inequality retains the printed a,b≥0a,b\ge0a,b≥0; applying it to signed Laplacians requires its all-real extension.

The goal is not met by stating BE\mathrm{BE}BE on the product with νZ=0\nu_Z=0νZ​=0: that is BE(K,∞)\mathrm{BE}(K,\infty)BE(K,∞), a strictly weaker claim; nor by defining the product form through the Cheeger energy of ZZZ instead of (5.2).

A complete development needs the Cartesian form's domain theorem, a pointwise version of the heat semigroups, Theorem 4.17 of the paper and the converse RCD(K,∞)⇒BE(K,∞)\mathrm{RCD}(K,\infty)\Rightarrow\mathrm{BE}(K,\infty)RCD(K,∞)⇒BE(K,∞) from [Ambrosio–Gigli–Savaré 2014]. The product layer (sections, Cartesian form, Lemma 5.3) is reusable for any tensorization argument on Dirichlet forms. Proofs of the elementary inequality and of Lemma 5.3 are the natural first contributions.

Selected references

  • L. Ambrosio, N. Gigli, G. Savaré, Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds, Ann. Probab. 43(1), 339–404, 2015. arXiv:1209.5786v4
  • L. Ambrosio, N. Gigli, G. Savaré, Metric measure spaces with Riemannian Ricci curvature bounded from below, Duke Math. J. 163(7), 1405–1490, 2014. arXiv:1109.0222
  • D. Bakry, M. Émery, Diffusions hypercontractives, Séminaire de Probabilités XIX, Lecture Notes in Math. 1123, 177–206, 1985. doi:10.1007/BFb0075847
7 thms2 active usersReviewed
Optimal TransportPartial Differential Equations·Captain: wurtle

Global Support and Convex Injectivity Domains under Weak MTWResearch Paper

Motivation: curvature conditions in optimal transport on manifolds

In optimal transport on a Riemannian manifold with the quadratic cost c(x,y)=d(x,y)2/2c(x,y)=d(x,y)^2/2c(x,y)=d(x,y)2/2, the regularity of optimal maps is governed by a fourth-order curvature quantity of the cost, the Ma–Trudinger–Wang (MTW) tensor. Its nonnegativity on orthogonal pairs, the weak MTW condition (A3w), is necessary for continuity of optimal maps, and together with convexity of the tangent injectivity domains it yields the global geometric "supporting" properties used in regularity theory. Whether weak MTW by itself forces those injectivity domains to be convex was proposed by Villani and proved previously only under a nonfocality assumption, which excludes cut points that are also conjugate points.

Background

  • 2005 — Ma, Trudinger and Wang introduce a strictly positive curvature condition for regularity of transport potentials (MTW 2005).
  • 2009 — Trudinger and Wang treat the degenerate nonnegative form A3w (TW 2009); Loeper proves necessity for continuity and the supporting-mountain principle (Loeper 2009).
  • 2010 — Loeper and Villani connect MTW to cut-locus geometry, proving convexity under strong MTW and nonfocality (Loeper–Villani 2010); Kim and McCann give a geometric formulation and a double-mountain principle (Kim–McCann 2010); Figalli's Bourbaki survey (Astérisque 332, 2010).
  • 2011 — Figalli, Rifford and Villani derive the global supporting principle from weak MTW plus convex injectivity domains (FRV 2011); Villani proposes that weak MTW alone should force convexity of every tangent injectivity domain (Villani 2011, §4.2).
  • 2015 — Figalli, Gallouët and Rifford prove that implication on nonfocal manifolds (FGR 2015, Thm 1.7).
  • 2026 — An OpenAI preprint, Global Support and Convex Injectivity Domains under Weak MTW (OpenAI Math Release, September 25, 2026), claims the implication on every smooth compact connected Riemannian manifold of dimension n≥2n\ge2n≥2, with conjugate cut points allowed. It has not been peer reviewed and its theorems are not formally verified.

Setting

Let (M,g)(M,g)(M,g) be a smooth, connected, compact Riemannian manifold without boundary, of dimension n≥2n\ge2n≥2, with geodesic distance ddd and exponential map exp⁡x:TxM→M\exp_x:T_xM\to Mexpx​:Tx​M→M. The open tangent injectivity domain at xxx is

I(x)={v∈TxM: d(x,exp⁡x(av))=a∣v∣x for some a>1},I(x)=\{v\in T_xM:\ d(x,\exp_x(av))=a|v|_x\ \text{for some } a>1\},I(x)={v∈Tx​M: d(x,expx​(av))=a∣v∣x​ for some a>1},

the set of velocities whose geodesic is still minimizing slightly beyond time one. With c(x,y)=d(x,y)2/2c(x,y)=d(x,y)^2/2c(x,y)=d(x,y)2/2, the MTW quantity at v∈I(x)v\in I(x)v∈I(x) is

S(x,v)(ξ,η)=−32 ∂4∂s2 ∂t2 c(exp⁡x(tξ),exp⁡x(v+sη))∣s=t=0,\mathfrak S_{(x,v)}(\xi,\eta)=-\frac32\,\frac{\partial^4}{\partial s^2\,\partial t^2}\,c\big(\exp_x(t\xi),\exp_x(v+s\eta)\big)\Big|_{s=t=0},S(x,v)​(ξ,η)=−23​∂s2∂t2∂4​c(expx​(tξ),expx​(v+sη))​s=t=0​,

and weak MTW means S(x,v)(ξ,η)≥0\mathfrak S_{(x,v)}(\xi,\eta)\ge0S(x,v)​(ξ,η)≥0 whenever ⟨ξ,η⟩x=0\langle\xi,\eta\rangle_x=0⟨ξ,η⟩x​=0, for all xxx and v∈I(x)v\in I(x)v∈I(x). No nonfocality, strict positivity, or prior convexity is assumed.

In Lean, MMM is a Mathlib Riemannian manifold modelled on EuclideanSpace ℝ (Fin n) (so without boundary), with CompactSpace, ConnectedSpace and IsRiemannianManifold linking the metric-space distance to the Riemannian metric. exp x v is the time-one point of a smooth curve with initial point xxx, initial velocity vvv, and locally constant-speed distance-realizing behaviour; mtw is the iterated one-variable derivative formula above.

Formalization targets

Goal: convexity of injectivity domains

If (M,g)(M,g)(M,g) satisfies weak MTW, then for every x∈Mx\in Mx∈M, every v0,v1∈I(x)v_0,v_1\in I(x)v0​,v1​∈I(x) and θ∈[0,1]\theta\in[0,1]θ∈[0,1],

(1−θ)v0+θv1∈I(x),(1-\theta)v_0+\theta v_1\in I(x),(1−θ)v0​+θv1​∈I(x),

i.e. I(x)I(x)I(x) is convex. This is Theorem 1.1 of the source. The goal is published on the platform with status Open.

Significance

The result itself. Combined with the Figalli–Rifford–Villani supporting principle, convexity of injectivity domains under weak MTW alone removes an extra geometric hypothesis from the regularity theory of optimal transport on compact manifolds, and covers focal manifolds where minimizing geodesics may reach conjugate cut points. The source also proves a global supporting property, convexity of lifted gap sections, and uniform C1,1C^{1,1}C1,1 intermediate-time geometry (Theorem 1.2), which feed the companion preprint on bi-Hölder regularity of transport maps.

Formalizing it. The statement uses only geodesics, distance and a four-fold derivative of the squared distance, so it can be phrased with current Mathlib Riemannian infrastructure. A proof needs nonsmooth analysis of the distance function near the cut locus, semiconvex potentials and their subdifferentials, and a continuity (degree) argument; this layer would be reusable for other cut-locus results.

Difficulty

The cost ccc is smooth only before the cut locus, while convexity of I(x)I(x)I(x) concerns segments whose interior points might a priori leave the region where S\mathfrak SS is defined. Weak MTW controls the cost Hessian only in directions perpendicular to a velocity segment and gives no strict inequality. Smooth-cost concavity arguments therefore cannot be applied beyond their domain, and nonfocality — the assumption that cut points are reached strictly before conjugate points — is exactly what earlier proofs used to keep the cost smooth along the segment.

Formalization scope

  • exp is defined through complete geodesics with prescribed initial data (ContMDiff curve, mfderiv at 000 equal to vvv, locally d(γs,γr)=∣v∣ ∣s−r∣d(\gamma s,\gamma r)=|v|\,|s-r|d(γs,γr)=∣v∣∣s−r∣); on a compact manifold such a geodesic exists and is unique, so the Classical.choose fallback is never used.
  • injectivityDomain matches I(x)I(x)I(x) exactly; mtw uses iterated deriv, which is the true fourth derivative wherever the cost is smooth (the case v∈I(x)v\in I(x)v∈I(x), near s=t=0s=t=0s=t=0).
  • The hypothesis quantifies over all xxx, all v∈I(x)v\in I(x)v∈I(x), and all gxg_xgx​-orthogonal ξ,η\xi,\etaξ,η; the conclusion is Convex ℝ (injectivityDomain x) for every xxx.
  • Dimension n≥2n\ge2n≥2, compactness and connectedness are explicit hypotheses; boundaryless-ness comes from the Euclidean model.
  • Needed infrastructure: Hopf–Rinow and uniqueness of geodesics, first and second variation, semiconcavity of the distance squared, cut and conjugate locus theory.

Selected references

  • X.-N. Ma, N. S. Trudinger and X.-J. Wang, Regularity of potential functions of the optimal transportation problem, Arch. Ration. Mech. Anal. 177 (2005), 151–183. https://doi.org/10.1007/s00205-005-0362-9
  • N. S. Trudinger and X.-J. Wang, On the second boundary value problem for Monge–Ampère type equations and optimal transportation, Ann. Sc. Norm. Super. Pisa 8 (2009), 143–174. https://doi.org/10.2422/2036-2145.2009.1.07
  • G. Loeper, On the regularity of solutions of optimal transportation problems, Acta Math. 202 (2009), 241–283. https://doi.org/10.1007/s11511-009-0037-8
  • G. Loeper and C. Villani, Regularity of optimal transport in curved geometry: the nonfocal case, Duke Math. J. 151 (2010), 431–485. https://doi.org/10.1215/00127094-2010-003
  • Y.-H. Kim and R. J. McCann, Continuity, curvature, and the general covariance of optimal transportation, J. Eur. Math. Soc. 12 (2010), 1009–1040. https://doi.org/10.4171/JEMS/221
  • A. Figalli, Regularity of optimal transport maps [after Ma–Trudinger–Wang and Loeper], Séminaire Bourbaki 2008/2009, Astérisque 332 (2010), 341–368.
  • A. Figalli, L. Rifford and C. Villani, Necessary and sufficient conditions for continuity of optimal transport maps on Riemannian manifolds, Tohoku Math. J. 63 (2011), 855–876. https://doi.org/10.2748/tmj/1325886291
  • C. Villani, Regularity of optimal transport and cut locus: from nonsmooth analysis to geometry to smooth analysis, Discrete Contin. Dyn. Syst. 30 (2011), 559–571. https://doi.org/10.3934/dcds.2011.30.559
  • A. Figalli, T. O. Gallouët and L. Rifford, On the convexity of injectivity domains on nonfocal manifolds, SIAM J. Math. Anal. 47 (2015), 969–1000. https://doi.org/10.1137/140961821
  • OpenAI, Global Support and Convex Injectivity Domains under Weak MTW, OpenAI Math Release preprint, September 25, 2026 (Theorem 1.1, p. 2). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Global-Support-and-Convex-Injectivity-Domains-under-Weak-MTW-September-25-2026/paper.pdf
9 thms2 active usersReviewed
Dynamical Systems·Captain: Lucas

Pugh's Closing LemmaResearch Paper

Motivation

A periodic point of a map f ⁣:M→Mf\colon M\to Mf:M→M is a point xxx with fn(x)=xf^n(x)=xfn(x)=x for some n≥1n\ge 1n≥1. A nonwandering point is a much weaker form of recurrence: every neighbourhood UUU of xxx eventually returns to meet itself, fn(U)∩U≠∅f^n(U)\cap U\ne\emptysetfn(U)∩U=∅ for some n≥1n\ge 1n≥1. Every periodic point is nonwandering, but a nonwandering point need not be periodic, and the orbit of such a point may never come back to xxx exactly.

Pugh's closing lemma asserts that this gap can be closed by an arbitrarily small change of the system: if xxx is nonwandering for a C1C^1C1 diffeomorphism fff of a compact manifold, then some diffeomorphism ggg, as close to fff as desired in the C1C^1C1 topology, has xxx as a periodic point (Wikipedia, "Pugh's closing lemma"). The result was proved by C. C. Pugh in 1967 (Pugh 1967), in the same paper as the General Density Theorem: for a C1C^1C1-generic diffeomorphism the periodic points are dense in the nonwandering set. The source article describes the lemma as establishing a close relationship between chaotic and periodic behaviour and notes that it underlies some autonomous convergence theorems. The article also points to Smale's problems as related material.

Setting

Let MMM be a compact smooth manifold of dimension ddd, Hausdorff and without boundary. Write Diff1(M)\mathrm{Diff}^1(M)Diff1(M) for the set of C1C^1C1 diffeomorphisms g ⁣:M→Mg\colon M\to Mg:M→M: bijections such that ggg and g−1g^{-1}g−1 are continuously differentiable. For g∈Diff1(M)g\in\mathrm{Diff}^1(M)g∈Diff1(M), Tg ⁣:TM→TMTg\colon TM\to TMTg:TM→TM denotes its tangent map on the tangent bundle.

The C1C^1C1 topology on Diff1(M)\mathrm{Diff}^1(M)Diff1(M) is the coarsest topology for which g↦Tgg\mapsto Tgg↦Tg is continuous, where the space C(TM,TM)C(TM,TM)C(TM,TM) of continuous self-maps of TMTMTM carries the compact-open topology. Two diffeomorphisms are C1C^1C1-close when they, and their derivatives, are uniformly close.

For a map h ⁣:X→Xh\colon X\to Xh:X→X of a topological space:

  • xxx is nonwandering if for every neighbourhood UUU of xxx there is n≥1n\ge 1n≥1 with hn(U)∩U≠∅h^n(U)\cap U\ne\emptysethn(U)∩U=∅; the nonwandering set is Ω(h)\Omega(h)Ω(h);
  • Per(h)={x:∃ n≥1, hn(x)=x}\mathrm{Per}(h)=\{x : \exists\, n\ge 1,\ h^n(x)=x\}Per(h)={x:∃n≥1, hn(x)=x} is the set of periodic points.

Formalization targets

Goal: Pugh's closing lemma

For every f∈Diff1(M)f\in\mathrm{Diff}^1(M)f∈Diff1(M) and every x∈Ω(f)x\in\Omega(f)x∈Ω(f),

∀ U a C1-neighbourhood of f,∃ g∈U,  x∈Per(g).\forall\ \mathcal U \text{ a } C^1\text{-neighbourhood of } f,\quad \exists\, g\in\mathcal U,\ \ x\in\mathrm{Per}(g).∀ U a C1-neighbourhood of f,∃g∈U,  x∈Per(g).

Milestones

  1. Per(f)⊆Ω(f)\mathrm{Per}(f)\subseteq\Omega(f)Per(f)⊆Ω(f) for any map fff.
  2. Ω(f)\Omega(f)Ω(f) is closed for any map fff.
  3. f(Ω(f))=Ω(f)f(\Omega(f))=\Omega(f)f(Ω(f))=Ω(f) for a homeomorphism fff.
  4. Ω(f)≠∅\Omega(f)\ne\emptysetΩ(f)=∅ for any map of a nonempty compact space.
  5. General Density Theorem (Pugh 1967): there is a residual set G⊆Diff1(M)\mathcal G\subseteq\mathrm{Diff}^1(M)G⊆Diff1(M) with
Per(g)‾=Ω(g)(g∈G).\overline{\mathrm{Per}(g)}=\Omega(g)\qquad (g\in\mathcal G).Per(g)​=Ω(g)(g∈G).

Milestones 1–4 are elementary background facts that are not stated in the source article; milestone 5 is the second theorem named in the title of the source's reference.

Significance

The result. The closing lemma turns a topological recurrence property into periodicity after a C1C^1C1-small perturbation. Combined with genericity arguments it gives the General Density Theorem, so that for generic C1C^1C1 diffeomorphisms the whole nonwandering set is the closure of the periodic orbits. It is one of the basic perturbation tools of C1C^1C1 generic dynamics.

Formalizing it. The theorem is classical and proved in the literature. The drafter is not aware of a machine-checked proof. A formalization needs the C1C^1C1 topology on diffeomorphism groups, local perturbation lemmas in charts and the combinatorics of the closing argument. None of these is currently available in Mathlib as far as the drafter knows.

Difficulty

The first idea is to take the returning piece of orbit near xxx and push it back to xxx with a small local perturbation. This fails in the C1C^1C1 topology. Moving a point by distance δ\deltaδ with a bump supported in a ball of radius rrr costs C1C^1C1 size about δ/r\delta/rδ/r, and the return may happen at a distance comparable to the size of the only available ball. The perturbation then fails to be C1C^1C1-small. The derivative DfnDf^nDfn along the return can also distort any fixed neighbourhood shape without bound. Controlling this distortion is the central difficulty.

Formalization scope

  • Diff1(M)\mathrm{Diff}^1(M)Diff1(M) and its C1C^1C1 topology come from the published definition file BCWCentralizer_Basic. Diff1(M)\mathrm{Diff}^1(M)Diff1(M) is M ≃ₘ^1⟮𝓡 d, 𝓡 d⟯ M, and the topology is induced by g↦Tgg\mapsto Tgg↦Tg into C(TangentBundle, TangentBundle) with the compact-open topology. On a compact manifold this is the usual C1C^1C1 topology.
  • "Compact smooth manifold": a Hausdorff compact space with a C∞C^\inftyC∞ atlas modelled on Rd\mathbb R^dRd, so without boundary. ddd is arbitrary.
  • "Arbitrarily close" means that every neighbourhood of fff in the C1C^1C1 topology contains a suitable ggg. "Periodic" requires a period n≥1n\ge 1n≥1. Allowing n=0n=0n=0 would make every point periodic and the statement trivial.
  • The perturbation ggg is only required to be a C1C^1C1 diffeomorphism, matching Diff1(M)\mathrm{Diff}^1(M)Diff1(M) in the source.
  • The nonwandering notion is the definition item PughClosingLemma_nonwandering, shared by all statements. It is reusable for any topological dynamics mission.

Welcome contributions: a general theory of the C1C^1C1 topology on Diff1(M)\mathrm{Diff}^1(M)Diff1(M) (for example, that it is Baire), local perturbation lemmas, and proofs of the milestones.

Selected references

  • C. C. Pugh, An Improved Closing Lemma and a General Density Theorem, American Journal of Mathematics 89 (4), 1967, 1010–1021. https://doi.org/10.2307/2373414
  • Wikipedia, Pugh's closing lemma, revision 1304222873. https://en.wikipedia.org/w/index.php?title=Pugh%27s_closing_lemma&oldid=1304222873
  • V. Araújo, M. J. Pacifico, Three-Dimensional Flows, Springer, 2010, ISBN 978-3-642-11414-4.
8 thms2 active usersReviewed
AnalysisPartial Differential EquationsPure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables V: CR Functions and Severi's Extension TheoremTextbook

Motivation

A holomorphic function on an open set of Cn\mathbb{C}^nCn restricts to a real hypersurface MMM as a function that satisfies the tangential Cauchy–Riemann equations: it is annihilated by every antiholomorphic vector tangent to MMM. Functions on MMM with this property are called CR functions, and they are the boundary values that several complex variables studies whenever a domain is approached through its boundary. The basic question is the converse: when is a CR function locally the restriction of a holomorphic function? For smooth data the answer is "not always" (the book's Example 3.2.7 gives a smooth CR function on the hyperplane Im⁡z2=0\operatorname{Im} z_2 = 0Imz2​=0 that is no such restriction). For real-analytic data the answer is "always", and that is Severi's theorem, the goal of this mission.

The mission follows Chapter 3 of Jiří Lebl's open textbook Tasty Bits of Several Complex Variables (version 4.4, 2026), where Severi's theorem is proved by complexification: a real-analytic function of zzz and zˉ\bar zzˉ is treated as a holomorphic function of two independent variables (z,ζ)(z, \zeta)(z,ζ) restricted to the diagonal ζ=zˉ\zeta = \bar zζ=zˉ. The milestones are the steps of that route: uniqueness on totally real slices, the two complexification propositions, the fact that restrictions of holomorphic functions are CR, and the normal form wˉ=Φ(z,zˉ,w)\bar w = \Phi(z, \bar z, w)wˉ=Φ(z,zˉ,w) of a real-analytic hypersurface.

Setting

Write Cn≅R2n\mathbb{C}^n \cong \mathbb{R}^{2n}Cn≅R2n with zk=xk+iykz_k = x_k + i y_kzk​=xk​+iyk​. A function on an open subset of RN\mathbb{R}^NRN is real-analytic if near each point it equals a convergent power series in the real coordinates. A set M⊂CnM \subset \mathbb{C}^nM⊂Cn is a real-analytic hypersurface if near each of its points, after choosing one real coordinate yyy among the 2n2n2n and collecting the other 2n−12n-12n−1 as xxx, it is the graph y=φ(x)y = \varphi(x)y=φ(x) of a real-analytic function φ\varphiφ.

A function fff on an arbitrary set X⊂CnX \subset \mathbb{C}^nX⊂Cn is smooth (respectively real-analytic) if near each point of XXX it agrees on XXX with a smooth (respectively real-analytic) function FFF defined on an open neighbourhood. A defining function of MMM at ppp is a smooth real function rrr on an open V∋pV \ni pV∋p with nonvanishing derivative and M∩V={r=0}M \cap V = \{r = 0\}M∩V={r=0}; MMM is a smooth real hypersurface if it has one at every point.

With the Wirtinger derivative ∂/∂zˉk=12(∂/∂xk+i ∂/∂yk)\partial/\partial\bar z_k = \tfrac12(\partial/\partial x_k + i\,\partial/\partial y_k)∂/∂zˉk​=21​(∂/∂xk​+i∂/∂yk​), the space of antiholomorphic tangent vectors of MMM at ppp is

Tp(0,1)M={∑kak∂∂zˉk∣p:∑kak∂r∂zˉk(p)=0}.T^{(0,1)}_p M = \Big\{ \textstyle\sum_{k} a_k \frac{\partial}{\partial \bar z_k}\big|_p : \sum_k a_k \frac{\partial r}{\partial \bar z_k}(p) = 0 \Big\}.Tp(0,1)​M={∑k​ak​∂zˉk​∂​​p​:∑k​ak​∂zˉk​∂r​(p)=0}.

A smooth f:M→Cf : M \to \mathbb{C}f:M→C is a CR function if Xpf=0X_p f = 0Xp​f=0 for all p∈Mp \in Mp∈M and Xp∈Tp(0,1)MX_p \in T^{(0,1)}_pMXp​∈Tp(0,1)​M, where XpfX_p fXp​f is computed on any smooth local extension of fff. A real-analytic CR function is a CR function that is real-analytic on MMM.

In Lean, Cn\mathbb{C}^nCn is Fin n → ℂ, and these notions are the definitions IsRealAnalyticOn, IsRealAnalyticHypersurface, IsSmoothHypersurface, IsSmoothOnSet / IsRealAnalyticOnSet, antiholTangent and IsSmoothCRFunction / IsRealAnalyticCRFunction of the namespace LeblSCV.CR.

Formalization targets

Goal: Severi's theorem (Theorem 3.2.9)

Let M⊂CnM \subset \mathbb{C}^nM⊂Cn be a real-analytic hypersurface, p∈Mp \in Mp∈M, and f:M→Cf : M \to \mathbb{C}f:M→C a real-analytic CR function. Then there are an open neighbourhood UUU of ppp and F∈O(U)F \in \mathcal{O}(U)F∈O(U) with

F(q)=f(q)for all q∈M∩U.F(q) = f(q) \qquad \text{for all } q \in M \cap U.F(q)=f(q)for all q∈M∩U.

Milestones

  1. Lemma 3.1.2. Holomorphic functions on a domain V⊂CnV \subset \mathbb{C}^nV⊂Cn that agree on V∩Rn≠∅V \cap \mathbb{R}^n \neq \emptysetV∩Rn=∅ agree on VVV.
  2. Proposition 3.1.3. A real-analytic function on a domain U⊂RnU \subset \mathbb{R}^nU⊂Rn extends to a unique holomorphic function on some domain V⊃UV \supset UV⊃U of Cn\mathbb{C}^nCn.
  3. Lemma 3.1.4. Holomorphic functions on a domain V⊂Cn×CnV \subset \mathbb{C}^n \times \mathbb{C}^nV⊂Cn×Cn that agree on V∩{ζ=zˉ}≠∅V \cap \{\zeta = \bar z\} \neq \emptysetV∩{ζ=zˉ}=∅ agree on VVV.
  4. Proposition 3.1.5. A real-analytic fff on a domain U⊂CnU \subset \mathbb{C}^nU⊂Cn has a unique holomorphic FFF on a domain V⊃{(z,zˉ):z∈U}V \supset \{(z, \bar z) : z \in U\}V⊃{(z,zˉ):z∈U} with F(z,zˉ)=f(z)F(z, \bar z) = f(z)F(z,zˉ)=f(z).
  5. Proposition 3.2.6. The restriction of a holomorphic function to a smooth (respectively real-analytic) hypersurface is a smooth (respectively real-analytic) CR function.
  6. Proposition 3.2.8. After a translation and a unitary rotation taking ppp to 000, a real-analytic hypersurface is locally wˉ=Φ(z,zˉ,w)\bar w = \Phi(z, \bar z, w)wˉ=Φ(z,zˉ,w) with Φ\PhiΦ holomorphic, Φ\PhiΦ, ∂Φ/∂zk\partial\Phi/\partial z_k∂Φ/∂zk​, ∂Φ/∂ζk\partial\Phi/\partial\zeta_k∂Φ/∂ζk​ vanishing at 000, and w=Φˉ(ζ,z,Φ(z,ζ,w))w = \bar\Phi(\zeta, z, \Phi(z, \zeta, w))w=Φˉ(ζ,z,Φ(z,ζ,w)).

Significance

Severi's theorem identifies the real-analytic CR functions on a real-analytic hypersurface with the local traces of holomorphic functions. Together with Proposition 3.2.6 it shows that, in the real-analytic category, the tangential Cauchy–Riemann equations are exactly the obstruction to holomorphic extension. It is the model for the later extension theorems of the chapter: the Baouendi–Trèves approximation theorem (Theorem 3.3.1) and the Lewy extension theorem (Theorem 3.4.1), which replace real-analyticity with smoothness and pay for it with one-sided extension or approximation. Complexification (Propositions 3.1.3 and 3.1.5) is also a tool in its own right, used for the composition of real-analytic maps (Proposition 3.1.10) and for pluriharmonic functions.

All results here are classical and proved in the book; none of them is formalized in Lean or Mathlib as far as a search of the Prove2Me corpus and Mathlib shows. Mathlib has real and complex analyticity (AnalyticOnNhd), the one-variable and several-variable identity theorems for analytic functions, and the holomorphic implicit function theorem is within reach, but it has no notion of real hypersurface, CR vector or CR function. The mission produces that layer and a checked proof of the first extension theorem for CR functions.

Difficulty

The obvious idea is to take a real-analytic extension of fff, complexify it to a holomorphic function f(z,w,ζ,ω)f(z, w, \zeta, \omega)f(z,w,ζ,ω) of 2n2n2n variables, and substitute ω=Φ(z,ζ,w)\omega = \Phi(z, \zeta, w)ω=Φ(z,ζ,w) to remove wˉ\bar wwˉ. That produces a holomorphic function of (z,w,ζ)(z, w, \zeta)(z,w,ζ), not of (z,w)(z, w)(z,w); showing that it does not depend on ζ\zetaζ requires transporting the CR equations, which hold only on MMM, to the whole complexified hypersurface. That transport is a uniqueness statement for the complexification, and it rests on the normal form of Proposition 3.2.8, itself an application of the holomorphic implicit function theorem to the complexified defining function together with its reality symmetry. On the Lean side, the diagonal {ζ=zˉ}\{\zeta = \bar z\}{ζ=zˉ} is not a complex submanifold, so identity theorems along it (Lemmas 3.1.2 and 3.1.4) do not follow from the standard identity theorem for open sets.

Formalization scope

  • Cn\mathbb{C}^nCn is Fin n → ℂ, with 0-based indices; Cn×Cn\mathbb{C}^n \times \mathbb{C}^nCn×Cn is the product type. The sup norm of Fin n → ℂ never enters a statement: no ball, norm or distance occurs.
  • Holomorphic on an open set is DifferentiableOn ℂ, which is equivalent to the book's Definition 1.1.2 there. A domain is an open connected (hence nonempty) set.
  • Real-analytic is Mathlib's AnalyticOnNhd ℝ on an open set, applied to Cn\mathbb{C}^nCn as a real vector space, which is the book's power series in x,yx, yx,y (equivalently in z,zˉz, \bar zz,zˉ).
  • A real-analytic hypersurface is a local graph over one of the 2n2n2n real coordinates (Definition 3.1.9), not the zero set of a real-analytic function.
  • Functions on MMM are functions on Cn\mathbb{C}^nCn of which only the values on MMM are read. "Smooth on MMM" means locally the restriction of a C∞C^\inftyC∞ function (Definition 3.2.1). The CR condition is imposed for every defining function and every smooth local extension, which is equivalent to one choice because both are independent of the choice.
  • Proposition 3.2.8 is stated for n=m+1n = m + 1n=m+1, with the unitary change of coordinates q↦U(q−p)q \mapsto U(q - p)q↦U(q−p) and every "near the origin" made an explicit open set. Only its displayed statement is a target; the remarks that follow it on the page are not.
  • The goal cannot be satisfied by an empty hypothesis: real-analytic hypersurfaces exist (a sorry-free check shows {Im⁡z1=0}\{\operatorname{Im} z_1 = 0\}{Imz1​=0} qualifies), and by Proposition 3.2.6 every restriction of a holomorphic function is a real-analytic CR function. The CR condition is the intrinsic one on Tp(0,1)MT^{(0,1)}_pMTp(0,1)​M; replacing it with "restriction of a holomorphic function" would make the goal a tautology and is ruled out.
  • Needed infrastructure: the several-variable identity theorem, holomorphic implicit functions, power series in 2n2n2n variables, and the chain rule for Wirtinger derivatives. The definitions of real-analytic hypersurface and CR function are reusable by the later extension theorems of Chapter 3. Contributions of any milestone, of a proof that Tp(0,1)MT^{(0,1)}_pMTp(0,1)​M is independent of the defining function, or of Exercise 3.2.3 (independence of the extension) are welcome.

Selected references

  • J. Lebl, Tasty Bits of Several Complex Variables, version 4.4, 2026, Chapter 3. https://www.jirka.org/scv/
  • Mathlib documentation, Mathlib.Analysis.Analytic.Basic (analytic functions, AnalyticOnNhd). https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Analytic/Basic.html
14 thms2 active usersReviewed
Mathematical Physics·Captain: Lucas

Teleparallel Gravity: Equivalence with General Relativity (Aldrovandi-Pereira-Vu 2004)Research Paper

Motivation

General relativity describes gravitation through the curvature of the Levi-Civita (Christoffel) connection of a spacetime metric. An alternative description, going back to Einstein's 1928-1930 papers on distant parallelism and developed in modern form as the teleparallel equivalent of general relativity, uses instead a tetrad field haμh^a{}_\muhaμ​ and the Weitzenböck connection it defines, a connection with vanishing curvature but non-zero torsion. The paper of Aldrovandi, Pereira and Vu (Braz. J. Phys. 34 (2004) 1374) reviews this formulation as a gauge theory of the translation group, and uses it to discuss the weak equivalence principle and a global (phase-factor) formulation of gravitation.

The claim that both descriptions are physically equivalent rests on a small number of exact tensor identities: the Weitzenböck connection splits as the Christoffel connection plus the contortion tensor, its curvature vanishes identically, and the teleparallel Lagrangian differs from the Einstein-Hilbert Lagrangian only by a total divergence. This mission asks for machine-checked proofs of these identities, in coordinates, exactly as used in Sections 2-3 of the paper.

Timeline (for orientation): Einstein introduced distant parallelism in 1928 (translations in the Delphenich collection Selected Papers on Teleparallelism); Weitzenböck studied the differential invariants of the theory the same year; the modern teleparallel equivalent of general relativity was developed from the 1960s-1970s onward, and the gauge-theoretic reading used here is the one reviewed by Aldrovandi-Pereira-Vu (2004).

Setting

Work in a single global chart x=(x0,x1,x2,x3)∈R4x=(x^0,x^1,x^2,x^3)\in\mathbb R^4x=(x0,x1,x2,x3)∈R4 and write ∂ν\partial_\nu∂ν​ for coordinate partial derivatives. Tangent-space (Latin) indices are raised and lowered with the Minkowski metric ηab=diag(+1,−1,−1,−1)\eta_{ab}=\mathrm{diag}(+1,-1,-1,-1)ηab​=diag(+1,−1,−1,−1).

  • A tetrad is a smooth field of invertible 4×44\times 44×4 matrices haμ(x)h^a{}_\mu(x)haμ​(x), with inverse haμh_a{}^\muha​μ and determinant h=det⁡(haμ)h=\det(h^a{}_\mu)h=det(haμ​).
  • The metric is gμν=ηabhaμhbνg_{\mu\nu}=\eta_{ab}h^a{}_\mu h^b{}_\nugμν​=ηab​haμ​hbν​ (Eq. (4)); gμνg^{\mu\nu}gμν is its inverse.
  • The Weitzenböck connection is Γρμν=haρ ∂νhaμ\Gamma^\rho{}_{\mu\nu}=h_a{}^\rho\,\partial_\nu h^a{}_\muΓρμν​=ha​ρ∂ν​haμ​ (Eq. (5)), its torsion Tρμν=Γρνμ−ΓρμνT^\rho{}_{\mu\nu}=\Gamma^\rho{}_{\nu\mu}-\Gamma^\rho{}_{\mu\nu}Tρμν​=Γρνμ​−Γρμν​ (Eq. (6)).
  • The Christoffel connection is Γ˚ρμν=12gρσ(∂μgσν+∂νgσμ−∂σgμν)\mathring\Gamma^\rho{}_{\mu\nu}=\tfrac12 g^{\rho\sigma}(\partial_\mu g_{\sigma\nu}+\partial_\nu g_{\sigma\mu}-\partial_\sigma g_{\mu\nu})Γ˚ρμν​=21​gρσ(∂μ​gσν​+∂ν​gσμ​−∂σ​gμν​); the contortion is Kρμν=12(Tμρν+Tνρμ−Tρμν)K^\rho{}_{\mu\nu}=\tfrac12(T_\mu{}^\rho{}_\nu+T_\nu{}^\rho{}_\mu-T^\rho{}_{\mu\nu})Kρμν​=21​(Tμ​ρν​+Tν​ρμ​−Tρμν​) (Eq. (9)).
  • The superpotential is Sρμν=12[Kμνρ−gρνTσμσ+gρμTσνσ]S^{\rho\mu\nu}=\tfrac12\big[K^{\mu\nu\rho}-g^{\rho\nu}T^{\sigma\mu}{}_\sigma+g^{\rho\mu}T^{\sigma\nu}{}_\sigma\big]Sρμν=21​[Kμνρ−gρνTσμσ​+gρμTσνσ​] (Eq. (11)), and the teleparallel Lagrangian density is LG=c4h16πGSρμνTρμν\mathcal L_G=\frac{c^4 h}{16\pi G}S^{\rho\mu\nu}T_{\rho\mu\nu}LG​=16πGc4h​SρμνTρμν​ (Eq. (10)).
  • In the gauge picture the tetrad is haμ=∂μxa+Baμh^a{}_\mu=\partial_\mu x^a+B^a{}_\muhaμ​=∂μ​xa+Baμ​ (Eq. (3)), with translational gauge potential BaμB^a{}_\muBaμ​ and field strength Faμν=∂μBaν−∂νBaμF^a{}_{\mu\nu}=\partial_\mu B^a{}_\nu-\partial_\nu B^a{}_\muFaμν​=∂μ​Baν​−∂ν​Baμ​ (Eq. (7)).

Curvature of a connection is Rρθμν=∂μΓρθν−∂νΓρθμ+ΓρσμΓσθν−ΓρσνΓσθμR^\rho{}_{\theta\mu\nu}=\partial_\mu\Gamma^\rho{}_{\theta\nu}-\partial_\nu\Gamma^\rho{}_{\theta\mu}+\Gamma^\rho{}_{\sigma\mu}\Gamma^\sigma{}_{\theta\nu}-\Gamma^\rho{}_{\sigma\nu}\Gamma^\sigma{}_{\theta\mu}Rρθμν​=∂μ​Γρθν​−∂ν​Γρθμ​+Γρσμ​Γσθν​−Γρσν​Γσθμ​, Ricci R˚θν=R˚ρθρν\mathring R_{\theta\nu}=\mathring R^\rho{}_{\theta\rho\nu}R˚θν​=R˚ρθρν​, scalar R˚=gθνR˚θν\mathring R=g^{\theta\nu}\mathring R_{\theta\nu}R˚=gθνR˚θν​ (Landau-Lifshitz conventions, consistent with the paper's Eq. (15)). The Einstein-Hilbert density is LEH=−c416πG−g R˚\mathcal L_{EH}=-\frac{c^4}{16\pi G}\sqrt{-g}\,\mathring RLEH​=−16πGc4​−g​R˚.

Formalization targets

Goal: equivalence of Lagrangians up to a divergence (Section 2, after Eq. (14))

For a smooth, positively oriented tetrad (h>0h>0h>0, so h=−gh=\sqrt{-g}h=−g​):

LG=LEH+∂μ(−c48πG h Tνμν).\mathcal L_G=\mathcal L_{EH}+\partial_\mu\Big(-\frac{c^4}{8\pi G}\,h\,T^{\nu\mu}{}_\nu\Big).LG​=LEH​+∂μ​(−8πGc4​hTνμν​).

The paper states only "up to a divergence"; the divergence term is written explicitly because an unspecified divergence would make the statement empty (every function on R4\mathbb R^4R4 is a divergence).

Milestones

  1. Eqs. (2)-(3): the tetrad and FaμνF^a{}_{\mu\nu}Faμν​ are invariant under xa↦xa+εax^a\mapsto x^a+\varepsilon^axa↦xa+εa, Baμ↦Baμ−∂μεaB^a{}_\mu\mapsto B^a{}_\mu-\partial_\mu\varepsilon^aBaμ​↦Baμ​−∂μ​εa.
  2. Eq. (7): Faμν=haρTρμνF^a{}_{\mu\nu}=h^a{}_\rho T^\rho{}_{\mu\nu}Faμν​=haρ​Tρμν​.
  3. Text after Eq. (5): the Weitzenböck connection has zero curvature.
  4. Eq. (8): Γρμν=Γ˚ρμν+Kρμν\Gamma^\rho{}_{\mu\nu}=\mathring\Gamma^\rho{}_{\mu\nu}+K^\rho{}_{\mu\nu}Γρμν​=Γ˚ρμν​+Kρμν​.
  5. Eq. (11): Sρμν=−SρνμS^{\rho\mu\nu}=-S^{\rho\nu\mu}Sρμν=−Sρνμ.
  6. Eq. (19): Tλμρuλuρ=−KλμρuλuρT^\lambda{}_{\mu\rho}u_\lambda u^\rho=-K^\lambda{}_{\mu\rho}u_\lambda u^\rhoTλμρ​uλ​uρ=−Kλμρ​uλ​uρ.

Significance

The goal identity is the precise sense in which teleparallel gravity is "equivalent" to general relativity: the two actions differ by a boundary term, so they give the same field equations (the paper's Eqs. (12) and (15)). Milestone 4 is what turns the teleparallel force equation into the geodesic equation (Eq. (20)), and milestone 2 is the dictionary between the gauge field strength and torsion used throughout Sections 3-4. The results are classical and proved on paper; to our knowledge they are not formalized in Mathlib, which has no coordinate tensor calculus of this kind. A formal development would provide reusable coordinate lemmas (derivative of an inverse matrix field, symmetry of second derivatives in index form, Christoffel symbols of g=hTηhg=h^{\mathsf T}\eta hg=hTηh).

Difficulty

Each identity is elementary on paper, but the index computations are long, and in Lean every derivative carries differentiability side conditions: derivatives of inverse matrices and of determinants, and symmetry of mixed partial derivatives, must be justified from smoothness and invertibility of the tetrad. The goal identity involves second derivatives of the inverse metric and a careful bookkeeping of about a hundred index contractions.

Formalization scope

Spacetime is R4\mathbb R^4R4 as Fin 4 → ℝ with one global chart; partial derivatives are Fréchet derivatives applied to coordinate basis vectors. A tetrad is a family of real functions h a μ, assumed C∞C^\inftyC∞ with invertible matrix at every point (IsTetrad). Inverses are matrix inverses (which would be 000 for singular matrices; the invertibility hypothesis excludes this). The physical constants c,Gc,Gc,G are arbitrary reals. All definitions live in the single definition file of the mission, namespace TeleparallelGravity.

Selected references

  • R. Aldrovandi, J. G. Pereira, K. H. Vu, Selected Topics in Teleparallel Gravity, Braz. J. Phys. 34 (2004) 1374. https://doi.org/10.1590/S0103-97332004000700009
  • D. H. Delphenich (ed., transl.), Selected Papers on Teleparallelism (translations of Einstein, Weitzenböck, Cartan and others, 1928-1935).
  • L. D. Landau, E. M. Lifshitz, The Classical Theory of Fields, 4th ed., Pergamon, 1975 (sign conventions).
8 thms2 active usersReviewed
Functional AnalysisOptimal TransportProbability·Captain: mikedeng1

Bakry–Émery Curvature-Dimension Condition and Riemannian Ricci Curvature Bounds 4: A Riemannian Energy Measure Space Satisfying BE(K,∞) Is an RCD(K,∞) SpaceResearch Paper

Why relate heat flow and curvature?

Heat flow gives an analytic way to describe how functions spread on a space. Optimal transport gives a metric way to describe how probability measures move on the same space. On a smooth Riemannian manifold, a lower Ricci curvature bound constrains both motions. The problem addressed by Ambrosio, Gigli and Savaré is to identify the corresponding relationship when the underlying space need not be a manifold. A Dirichlet form can specify a heat flow even when there are no smooth coordinates, while a Wasserstein distance can measure transport between probability measures. Theorem 4.17 connects these two descriptions for Riemannian energy measure spaces.

The paper proves the implication from the Bakry–Émery condition BE(K,∞)BE(K,\infty)BE(K,∞) to the Riemannian curvature-dimension condition RCD(K,∞)RCD(K,\infty)RCD(K,∞). Its printed theorem is an equivalence; the paper cites the reverse implication from earlier work in the proof on p. 58. This mission targets the implication established here, with the source's exact assumptions.

Setting

Let XXX be a complete, separable metric space with a Borel measure mmm. A Dirichlet form E\mathcal EE assigns a nonnegative energy to square-integrable functions, is quadratic and lower semicontinuous, and decreases under normal contractions. Its associated heat flow PtP_tPt​ evolves a function over time. The associated carré du champ Γ(f)\Gamma(f)Γ(f) measures the energy density of a function. Functions with energy density at most one define an intrinsic distance

dE(x,y)=sup⁡{∣ψ(y)−ψ(x)∣:ψ is continuous and Γ(ψ)≤1 m-a.e.}.d_{\mathcal E}(x,y)=\sup\{|\psi(y)-\psi(x)|:\psi\text{ is continuous and }\Gamma(\psi)\le1\ m\text{-a.e.}\}.dE​(x,y)=sup{∣ψ(y)−ψ(x)∣:ψ is continuous and Γ(ψ)≤1 m-a.e.}.

For the Riemannian energy measure space in this mission, this intrinsic distance is the metric of XXX. The structure also requires the paper's upper regularity and continuous-representative properties. The growth condition (MD.exp)(MD.exp)(MD.exp) controls the measure of large balls. In the BE(K,∞)BE(K,\infty)BE(K,∞) condition, a weak second-derivative inequality for the heat flow has curvature parameter KKK and no finite-dimensional correction term. These assumptions are stated at the start of §4 and govern the §4 milestones even when an individual theorem does not repeat them. See Definitions 3.6 and 3.16 and the opening of §4.

Write P2(X)\mathcal P_2(X)P2​(X) for the probability measures with finite second moment, W2W_2W2​ for their quadratic Wasserstein distance, and Ent⁡m(ρ)\operatorname{Ent}_m(\rho)Entm​(ρ) for entropy relative to mmm. The heat flow has a dual action HtH_tHt​ on measures. The target RCD(K,∞)RCD(K,\infty)RCD(K,∞) asks for a curve HtρH_t\rhoHt​ρ from every ρ∈P2(X)\rho\in\mathcal P_2(X)ρ∈P2​(X) that satisfies the following evolution variational inequality against every ν∈P2(X)\nu\in\mathcal P_2(X)ν∈P2​(X) of finite entropy, at every t>0t>0t>0:

d+dtW22(Htρ,ν)2+K2W22(Htρ,ν)+Ent⁡m(Htρ)≤Ent⁡m(ν).\frac{d^+}{dt}\frac{W_2^2(H_t\rho,\nu)}2 +\frac K2W_2^2(H_t\rho,\nu) +\operatorname{Ent}_m(H_t\rho) \le\operatorname{Ent}_m(\nu).dtd+​2W22​(Ht​ρ,ν)​+2K​W22​(Ht​ρ,ν)+Entm​(Ht​ρ)≤Entm​(ν).

The definition also includes full support, local finiteness, the exponential growth condition, and the length-space property. See Definition 3.1.

Formalization targets

The goal is the forward implication of Theorem 4.17:

Riemannian energy measure space+(MD.exp)+BE(K,∞)⟹RCD(K,∞).\text{Riemannian energy measure space}+(MD.exp)+BE(K,\infty) \quad\Longrightarrow\quad RCD(K,\infty).Riemannian energy measure space+(MD.exp)+BE(K,∞)⟹RCD(K,∞).

Three milestones supply central results from the paper. The final assertions of Theorem 3.17 give the dual measure flow and its absolute continuity after positive time. Corollary 3.18 identifies BE(K,∞)BE(K,\infty)BE(K,∞) with the W2W_2W2​ contraction W2((Ptf)m,(Ptg)m)≤e−KtW2(fm,gm)W_2((P_t f)m,(P_t g)m)\le e^{-Kt}W_2(fm,gm)W2​((Pt​f)m,(Pt​g)m)≤e−KtW2​(fm,gm) on probability densities. A companion item, Theorem 4.8, gives an entropy bound for HtμH_t\muHt​μ when μ\muμ has finite second moment:

Ent⁡m(Htμ)≤r2+∫Xd2(x,x0) dμ(x)2I2K(t)−log⁡m(Br(x0)),r,t>0.\operatorname{Ent}_m(H_t\mu) \le\frac{r^2+\int_X d^2(x,x_0)\,d\mu(x)}{2I_{2K}(t)} -\log m(B_r(x_0)),\qquad r,t>0.Entm​(Ht​μ)≤2I2K​(t)r2+∫X​d2(x,x0​)dμ(x)​−logm(Br​(x0​)),r,t>0.

The third milestone, Theorem 4.16, bounds the distance and entropy at the heat-evolved endpoint of a regular curve ρs\rho_sρs​:

W22(ρ0,Htρ1)+2tEnt⁡m(Htρ1)≤RK(t)2∫01∣ρ˙s∣2 ds+2tEnt⁡m(ρ0),RK(t)=t/IK(t).W_2^2(\rho_0,H_t\rho_1)+2t\operatorname{Ent}_m(H_t\rho_1) \le R_K(t)^2\int_0^1|\dot\rho_s|^2\,ds +2t\operatorname{Ent}_m(\rho_0),\qquad R_K(t)=t/I_K(t).W22​(ρ0​,Ht​ρ1​)+2tEntm​(Ht​ρ1​)≤RK​(t)2∫01​∣ρ˙​s​∣2ds+2tEntm​(ρ0​),RK​(t)=t/IK​(t).

The milestone list follows the source labels and constants in §4.

What the result provides

The conclusion turns an analytic curvature bound on a heat semigroup into a transport statement about entropy on probability measures. It therefore identifies a concrete set of Dirichlet-form hypotheses under which the heat evolution has the metric behavior demanded by RCD(K,∞)RCD(K,\infty)RCD(K,∞). The result applies in the paper's metric measure setting, where the space may lack a smooth tensor calculus. The RCDRCDRCD conclusion carries convergence from every initial measure in P2(X)\mathcal P_2(X)P2​(X) and the inequality for all finite-entropy comparison measures.

The mathematical implication is proved in the cited paper. The proposed Lean statements are open proof targets: their declarations compile with placeholders, and no machine-checked proof of this implication is asserted here. A complete development would connect Dirichlet-form calculus, probability measures, entropy, and Wasserstein geometry in reusable interfaces. The dual-flow and regular-curve definitions are especially useful beyond this theorem.

Main difficulty

The heat flow is initially specified on square-integrable functions, whereas the target is an inequality for probability measures, including measures without an initial density. A bound on Γ(Ptf)\Gamma(P_t f)Γ(Pt​f) by itself controls functions almost everywhere; it does not immediately produce the pointwise dual flow or the right derivative of W22W_2^2W22​ required by Definition 3.1. The action estimate also begins with regular curves, while the target quantifies over every initial measure in P2(X)\mathcal P_2(X)P2​(X). These changes of domain and regularity are the central mathematical obstacles; simply renaming the heat semigroup as a measure flow leaves the target unjustified.

Formalization scope

Lean uses real-valued function representatives for L2(X,m)L^2(X,m)L2(X,m), with almost-everywhere congruence in the Dirichlet form and heat flow. Measures use the Borel sigma algebra. The source uses its mmm-completion; the formalization treats quantities invariant under mmm-almost-everywhere equality, and this convention is explicit in the definition layer. The metric is complete and second countable, and its equality with dEd_{\mathcal E}dE​ is part of the energy-measure-space predicate. A sigma-finiteness instance is carried where entropy or measure operations need it; it follows from the source's measure-growth setting. The dual flow and the L1L^1L1 extension are bound by predicates that specify their action on densities. The mollifier for a regular curve is bound by the conditions of (2.17), while the action is the infimum of squared admissible speeds, which equals the integral of the squared metric derivative.

Wasserstein costs use R≥0∪{∞}\mathbb R_{\ge0}\cup\{\infty\}R≥0​∪{∞}, and entropy uses extended real values. Theorem 4.8 restricts r,tr,tr,t to positive numbers, so the ball mass and I2K(t)I_{2K}(t)I2K​(t) used in its formula have the intended domain. Theorem 4.16 also uses t>0t>0t>0, making RK(t)=t/IK(t)R_K(t)=t/I_K(t)RK​(t)=t/IK​(t) meaningful, including at K=0K=0K=0. The goal requires an EVI flow beginning at each ρ∈P2(X)\rho\in\mathcal P_2(X)ρ∈P2​(X) and the inequality at every positive time; allowing a vacuous flow or checking only almost every time would not express Definition 3.1. Contributions may establish the milestone statements and the companion Theorem 4.8, develop the omitted intermediate estimates from §4, or prove the goal from the source's full argument.

Selected references

  • L. Ambrosio, N. Gigli and G. Savaré, Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds, Annals of Probability 43(1), 2015, 339–404. arXiv:1209.5786v4.
7 thms1 active userReviewed
AnalysisFunctional AnalysisProbability·Captain: mikedeng1

Bakry–Émery Curvature-Dimension Condition and Riemannian Ricci Curvature Bounds 2: The Dirichlet Form of an Energy Measure Space Is Twice the Cheeger Energy Iff It Is Upper-RegularResearch Paper

Motivation

There are two standard ways to do analysis on a non-smooth space. The first starts from an energy: a Dirichlet form E\mathcal EE on L2(X,m)L^2(X,m)L2(X,m), its heat semigroup and its carré du champ Γ\GammaΓ. This is the setting of Bakry–Émery Γ\GammaΓ-calculus and of the curvature-dimension condition BE(K,N)BE(K,N)BE(K,N). The second starts from a metric measure space (X,d,m)(X,d,m)(X,d,m): slopes of Lipschitz functions, the Cheeger energy, Wasserstein distances, and the synthetic Ricci bounds CD(K,∞)\mathrm{CD}(K,\infty)CD(K,∞) and RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) of Lott–Villani and Sturm.

Moving between the two requires a dictionary. A Dirichlet form defines a distance, the intrinsic distance dEd_{\mathcal E}dE​ (Biroli–Mosco, Sturm). That distance defines a Cheeger energy. The question is whether the energy rebuilt from dEd_{\mathcal E}dE​ is the energy we started from. Ambrosio, Gigli and Savaré answer this in §3.3 of their paper on the Bakry–Émery condition and Riemannian Ricci bounds (arXiv:1209.5786, Ann. Probab. 2015). Their answer is the identification used in the main theorem of the paper, BE(K,∞)⇒RCD(K,∞)BE(K,\infty)\Rightarrow\mathrm{RCD}(K,\infty)BE(K,∞)⇒RCD(K,∞).

Timeline:

  • 1991–1995: Biroli–Mosco and Sturm introduce the intrinsic distance of a strongly local regular Dirichlet form on a locally compact space and prove its length property there ([50, 52] of the paper).
  • 1999: Cheeger defines the energy that now bears his name (GAFA 9).
  • 2014: Ambrosio–Gigli–Savaré identify the minimal weak gradient with Cheeger's relaxed gradient on general metric measure spaces and introduce RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) (Invent. Math. 195; Duke 163).
  • 2015: the present paper sets up Energy measure spaces on Polish spaces, without local compactness, and proves Theorems 3.9–3.14.

Setting

Let XXX be a set with a σ-additive measure mmm. A Dirichlet form is a lower semicontinuous quadratic form E:L2(X,m)→[0,∞]\mathcal E:L^2(X,m)\to[0,\infty]E:L2(X,m)→[0,∞] with E(η∘f)≤E(f)\mathcal E(\eta\circ f)\le\mathcal E(f)E(η∘f)≤E(f) for every 1-Lipschitz η\etaη with η(0)=0\eta(0)=0η(0)=0, and with dense domain V={E<∞}\mathbb V=\{\mathcal E<\infty\}V={E<∞}. It is strongly local when E(f,g)=0\mathcal E(f,g)=0E(f,g)=0 whenever (f+a)g=0(f+a)g=0(f+a)g=0 a.e. for a constant aaa. A function f∈Vf\in\mathbb Vf∈V belongs to G\mathbb GG, with carré du champ Γ(f)∈L+1\Gamma(f)\in L^1_+Γ(f)∈L+1​, if E(f,fφ)−12E(f2,φ)=∫Γ(f)φ dm\mathcal E(f,f\varphi)-\frac12\mathcal E(f^2,\varphi)=\int\Gamma(f)\varphi\,dmE(f,fφ)−21​E(f2,φ)=∫Γ(f)φdm for all bounded φ∈V\varphi\in\mathbb Vφ∈V.

Let LC\mathbb L_CLC​ be the set of continuous ψ∈G\psi\in\mathbb Gψ∈G with Γ(ψ)≤1\Gamma(\psi)\le1Γ(ψ)≤1 a.e. The intrinsic distance is

dE(x,y)=sup⁡ψ∈LC∣ψ(y)−ψ(x)∣.d_{\mathcal E}(x,y)=\sup_{\psi\in\mathbb L_C}|\psi(y)-\psi(x)|.dE​(x,y)=ψ∈LC​sup​∣ψ(y)−ψ(x)∣.

An Energy measure space (X,τ,m,E)(X,\tau,m,\mathcal E)(X,τ,m,E) (Definition 3.6) is a strongly local Dirichlet form on a Polish space with a fully supported Borel measure such that dEd_{\mathcal E}dE​ is a finite complete distance inducing τ\tauτ, and a continuous θ≥0\theta\ge0θ≥0 has its truncations Sk∘θS_k\circ\thetaSk​∘θ in L\mathbb LL.

On the metric side, ∣Df∣(x)=lim sup⁡y→x∣f(y)−f(x)∣/d(y,x)|Df|(x)=\limsup_{y\to x}|f(y)-f(x)|/d(y,x)∣Df∣(x)=limsupy→x​∣f(y)−f(x)∣/d(y,x) is the slope, and the Cheeger energy is

Ch(f)=inf⁡{lim inf⁡n12∫∣Dfn∣2 dm: fn∈Lipb(X), fn→f in L2}.\mathrm{Ch}(f)=\inf\Big\{\liminf_n\tfrac12\int|Df_n|^2\,dm:\ f_n\in\mathrm{Lip}_b(X),\ f_n\to f\text{ in }L^2\Big\}.Ch(f)=inf{nliminf​21​∫∣Dfn​∣2dm: fn​∈Lipb​(X), fn​→f in L2}.

Condition (MD) asks that (X,d)(X,d)(X,d) be complete and separable, supp⁡m=X\operatorname{supp}m=Xsuppm=X, and balls have finite measure. Condition (ED) asks that every ψ∈LC\psi\in\mathbb L_Cψ∈LC​ be 1-Lipschitz for ddd (ED.a), and that every Lipschitz ψ\psiψ with ∣Dψ∣≤1|D\psi|\le1∣Dψ∣≤1 and bounded support lie in LC\mathbb L_CLC​ (ED.b). E\mathcal EE is upper-regular (Definition 3.13) if every fff in a dense subset of V\mathbb VV is an L2L^2L2 limit of bounded continuous fn∈Gf_n\in\mathbb Gfn​∈G with bounded upper semicontinuous gn≥Γ(fn)g_n\ge\sqrt{\Gamma(f_n)}gn​≥Γ(fn​)​ and lim sup⁡n∫gn2≤E(f)\limsup_n\int g_n^2\le\mathcal E(f)limsupn​∫gn2​≤E(f).

Formalization targets

Goal: Theorem 3.14

For an Energy measure space,

E(f)=2 Ch(f)∀f∈L2(X,m)⟺E is upper-regular,\mathcal E(f)=2\,\mathrm{Ch}(f)\quad\forall f\in L^2(X,m)\qquad\Longleftrightarrow\qquad\mathcal E\text{ is upper-regular},E(f)=2Ch(f)∀f∈L2(X,m)⟺E is upper-regular,

and in this case G=V\mathbb G=\mathbb VG=V.

Milestones

  • Theorem 3.9: an Energy measure space satisfies (MD) and (ED) for dEd_{\mathcal E}dE​; conversely, a distance with (MD) and (ED) makes the structure an Energy measure space and equals dEd_{\mathcal E}dE​.
  • Theorem 3.10: (X,dE)(X,d_{\mathcal E})(X,dE​) is a length space.
  • Proposition 3.11: if f∈G∩Cbf\in\mathbb G\cap C_bf∈G∩Cb​ and Γ(f)≤ζ2\Gamma(f)\le\zeta^2Γ(f)≤ζ2 with ζ\zetaζ bounded upper semicontinuous, then fff is Lipschitz and ∣D∗f∣≤ζ|D^*f|\le\zeta∣D∗f∣≤ζ.
  • Theorem 3.12: under (MD), (ED.b) holds iff every Lipschitz fff of bounded support has ∣Df∣2≥Γ(f)|Df|^2\ge\Gamma(f)∣Df∣2≥Γ(f); then 2Ch≥E2\mathrm{Ch}\ge\mathcal E2Ch≥E and ∣Dg∣w2≥Γ(g)|Dg|_w^2\ge\Gamma(g)∣Dg∣w2​≥Γ(g).
  • The remaining assertions of Theorem 3.14: Γ(f)=∣Df∣w2\Gamma(f)=|Df|_w^2Γ(f)=∣Df∣w2​ (3.41), density of V∩Lipb\mathbb V\cap\mathrm{Lip}_bV∩Lipb​ in V\mathbb VV, and mass preservation of (Pt)(P_t)(Pt​) under (MD.exp).

Significance

The identification E=2Ch\mathcal E=2\mathrm{Ch}E=2Ch lets every metric notion be applied to an energy structure. Once it holds, the Wasserstein gradient flow of the entropy, the EVIK\mathrm{EVI}_KEVIK​ formulation and RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞) all make sense for the energy. That is the route by which the paper proves that BE(K,∞)BE(K,\infty)BE(K,∞) on a Riemannian Energy measure space implies RCD(K,∞)\mathrm{RCD}(K,\infty)RCD(K,∞), the converse of the earlier RCD⇒BE\mathrm{RCD}\Rightarrow BERCD⇒BE result. Theorem 3.12 gives the one-sided inequality 2Ch≥E2\mathrm{Ch}\ge\mathcal E2Ch≥E under the single condition (ED.b), and (3.41) says the energy density is the squared minimal weak gradient. Mass preservation is a standing hypothesis of several other results of the paper, and here it comes for free.

All of these results are proved in the paper, partly by citation: the mass-preservation clause rests on [6, Theorem 4.20], and the length property uses a midpoint criterion from Burago–Burago–Ivanov. None of them has a machine-checked proof. Mathlib has no Dirichlet forms, no Cheeger energy and no theory of length spaces built from curve length. This mission produces precise Lean statements of the paper's identification theorem and of the lemmas its proof uses, so that the metric–energy dictionary can be built up and proved one piece at a time.

Difficulty

The inequality 2Ch≥E2\mathrm{Ch}\ge\mathcal E2Ch≥E is the easy direction once (3.32) is available. Proving (3.32) means bounding the energy density of the Hopf–Lax inf-convolution QtfQ_tfQt​f pointwise by D+(x,t)2/t2D^+(x,t)^2/t^2D+(x,t)2/t2. Only finite minima over a countable dense set lie in V\mathbb VV, so the bound has to pass to the limit through the lower semicontinuity (2.10) of Γ\sqrt\GammaΓ​.

The reverse inequality needs the opposite move: from an mmm-a.e. bound Γ(f)≤ζ2\Gamma(f)\le\zeta^2Γ(f)≤ζ2 to a pointwise bound on the metric slope at every point. That step is Proposition 3.11. It needs ζ\zetaζ to be upper semicontinuous and dEd_{\mathcal E}dE​ to be a length distance. Without upper semicontinuity, an a.e. bound says nothing about the slope at a given point. The obvious idea, testing E\mathcal EE against the Lipschitz functions given by (ED.b), produces only lower bounds on E\mathcal EE and cannot give 2Ch≤E2\mathrm{Ch}\le\mathcal E2Ch≤E. That is why upper regularity is the exact condition. The length property (Theorem 3.10) is itself proved by contradiction from a Lipschitz test function built from two disjoint balls. On a space that is not locally compact, this needs a completeness argument rather than Hopf–Rinow.

Formalization scope

Representation. Elements of L2(X,m)L^2(X,m)L2(X,m) are functions X→RX\to\mathbb RX→R. E\mathcal EE is ∞\infty∞ off L2L^2L2, and every predicate is invariant under mmm-a.e. equality. The σ-algebra is Borel (BorelSpace), standing in for its mmm-completion. The topology τ\tauτ is the topology of the metric of XXX, and condition (b) of Definition 3.6 says that this metric equals dEd_{\mathcal E}dE​. Completeness and separability are typeclass binders. The carré du champ is a predicate on a density, never a chosen function. Slopes, dEd_{\mathcal E}dE​, Ch\mathrm{Ch}Ch and curve lengths take values in [0,∞][0,\infty][0,∞]. The curve length is the total variation, which agrees with ∫∣γ˙∣\int|\dot\gamma|∫∣γ˙​∣. The truncation profile SSS of (3.27) is a parameter with the properties the paper fixes. "Dense in V\mathbb VV" means dense for the norm (∥f∥22+E(f))1/2(\|f\|_2^2+\mathcal E(f))^{1/2}(∥f∥22​+E(f))1/2. The minimal weak gradient is required to be nonnegative, which makes its two characterizing conditions determine it. Mass preservation is stated on L1∩L2L^1\cap L^2L1∩L2, with Ptf∈L1P_tf\in L^1Pt​f∈L1 part of the conclusion. In Theorem 3.9 the printed "distance on X×XX\times XX×X" is read as a distance on XXX.

Ruling out trivializations. The Cheeger energy is defined from slopes of bounded Lipschitz functions and never through E\mathcal EE. Upper regularity is Definition 3.13 with a dense approximating set, not the identity E=2Ch\mathcal E=2\mathrm{Ch}E=2Ch.

Infrastructure. A complete development needs carré du champ calculus for strongly local forms (chain rule, (2.9), (2.10)), the Hopf–Lax semigroup on metric spaces, relaxation and minimal weak gradients, and the midpoint characterization of length spaces. Mathlib has none of these, and all of them can be reused beyond this mission. Contributions of any of these pieces, and proofs of individual milestones, are welcome.

Selected references

  • L. Ambrosio, N. Gigli, G. Savaré, Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds, Ann. Probab. 43(1), 339–404, 2015. https://arxiv.org/abs/1209.5786 (v4 cited)
  • L. Ambrosio, N. Gigli, G. Savaré, Calculus and heat flow in metric measure spaces and applications to spaces with Ricci bounds from below, Invent. Math. 195, 289–391, 2014. https://doi.org/10.1007/s00222-013-0456-1
  • L. Ambrosio, N. Gigli, G. Savaré, Metric measure spaces with Riemannian Ricci curvature bounded from below, Duke Math. J. 163, 1405–1490, 2014. https://doi.org/10.1215/00127094-2681605
  • J. Cheeger, Differentiability of Lipschitz functions on metric measure spaces, Geom. Funct. Anal. 9, 428–517, 1999. https://doi.org/10.1007/s000390050094
  • K.-T. Sturm, Analysis on local Dirichlet spaces I. Recurrence, conservativeness and L^p-Liouville properties, J. Reine Angew. Math. 456, 173–196, 1994. https://doi.org/10.1515/crll.1994.456.173
  • N. Bouleau, F. Hirsch, Dirichlet Forms and Analysis on Wiener Space, de Gruyter, 1991. https://doi.org/10.1515/9783110858389
12 thms1 active userReviewed
Functional AnalysisOptimal TransportProbability·Captain: mikedeng1

Bakry–Émery Curvature-Dimension Condition and Riemannian Ricci Curvature Bounds 6: BE(K,N) on Riemannian Energy Measure Spaces Is Stable Under Sturm–Gromov–Hausdorff ConvergenceResearch Paper

Motivation

Curvature bounds on a smooth Riemannian manifold control diffusion and the behavior of probability measures. Metric measure spaces extend these questions to limits that need not be smooth. A useful curvature condition must continue to hold when a sequence of spaces converges. Ambrosio, Gigli, and Savaré prove that their analytic Bakry–Émery curvature-dimension condition has this stability property for Riemannian energy measure spaces under Sturm–Gromov–Hausdorff convergence Ambrosio–Gigli–Savaré, Theorem 5.8. The result connects a condition stated through heat flow and Dirichlet forms with convergence stated through distances between probability measures.

The article's §5.2 first defines the convergence of spaces and of functions living in different L2L^2L2 spaces, then states the stability theorem. This order matters: the measure changes with the space, so ordinary convergence of functions on one fixed measured space cannot express the claim Ambrosio–Gigli–Savaré, Definitions 5.4 and 5.6.

Setting

A metric measure space (X,d,m)(X,d,m)(X,d,m) consists of a complete separable metric space (X,d)(X,d)(X,d) and a measure mmm. The class P2(X)\mathcal P_2(X)P2​(X) contains probability measures with finite second moment. The squared Wasserstein distance W22(μ,ν)W_2^2(\mu,\nu)W22​(μ,ν) is the infimum of the mean squared transport cost d(x,y)2d(x,y)^2d(x,y)2 over couplings of μ\muμ and ν\nuν.

A sequence (Xn,dn,mn)(X_n,d_n,m_n)(Xn​,dn​,mn​) Sturm–Gromov–Hausdorff converges to (X∞,d∞,m∞)(X_\infty,d_\infty,m_\infty)(X∞​,d∞​,m∞​) when there is a complete separable ambient metric space ZZZ and distance-preserving embeddings ιn:Xn→Z\iota_n:X_n\to Zιn​:Xn​→Z, including ι∞\iota_\inftyι∞​, such that W2((ιn)#mn,(ι∞)#m∞)→0W_2((\iota_n)_\#m_n,(\iota_\infty)_\#m_\infty)\to0W2​((ιn​)#​mn​,(ι∞​)#​m∞​)→0. The embeddings need not be onto. This definition compares measures on different spaces after placing them in one ambient space; it does not assume that the original spaces coincide Ambrosio–Gigli–Savaré, Definition 5.4.

An energy measure space has a strongly local Dirichlet form E\mathcal EE, its associated heat flow PtP_tPt​, a carré du champ Γ\GammaΓ, and an intrinsic distance dEd_{\mathcal E}dE​ agreeing with ddd. The Cheeger energy Ch⁡m\operatorname{Ch}_mChm​ is the relaxed integral of one half the squared local slope. A Riemannian energy measure space also has the upper-regularity and continuous-representative properties of Definition 3.16. The paper writes E=2Ch⁡m\mathcal E=2\operatorname{Ch}_mE=2Chm​ in this situation Ambrosio–Gigli–Savaré, Definitions 3.6 and 3.16 and Theorem 3.14.

The Bakry–Émery condition BE(K,N)\mathrm{BE}(K,N)BE(K,N) bounds a second-order expression involving the heat flow, the carré du champ, curvature parameter KKK, and dimension parameter NNN. The formalization uses the paper's weak distributional form (2.33), writing ν=1/N≥0\nu=1/N\ge0ν=1/N≥0; ν=0\nu=0ν=0 represents N=∞N=\inftyN=∞. This is the same KKK and NNN for every source space and for the limit Ambrosio–Gigli–Savaré, Definition 2.4 and (2.33).

Formalization targets

Supporting convergence results

Remark 5.5 asserts that the Cheeger energy is invariant under an isometric embedding. Lemma 5.7 supplies two criteria (squared norms, or entropies of bounded densities) for convergence of scalar functions across changing measures and shows that continuous maps of linear growth preserve this convergence. Lemma 5.9 says that, in the RCD setting, both heat-flow outputs and their generators converge. These are the mission's formal milestones Ambrosio–Gigli–Savaré, pp. 63–66.

Stability goal

For Riemannian energy measure spaces (Xn,dn,mn,En)(X_n,d_n,m_n,\mathcal E_n)(Xn​,dn​,mn​,En​) with mn∈P2(Xn)m_n\in\mathcal P_2(X_n)mn​∈P2​(Xn​) and BE(K,N)\mathrm{BE}(K,N)BE(K,N), Theorem 5.8 asks for

(Xn,dn,mn)→SGH(X∞,d∞,m∞)⟹(X∞,d∞,m∞,2Ch⁡m∞) is Riemannian and satisfies BE(K,N).(X_n,d_n,m_n)\xrightarrow{\mathrm{SGH}}(X_\infty,d_\infty,m_\infty) \quad\Longrightarrow\quad (X_\infty,d_\infty,m_\infty,2\operatorname{Ch}_{m_\infty}) \text{ is Riemannian and satisfies }\mathrm{BE}(K,N).(Xn​,dn​,mn​)SGH​(X∞​,d∞​,m∞​)⟹(X∞​,d∞​,m∞​,2Chm∞​​) is Riemannian and satisfies BE(K,N).

The goal includes the assertion that the limit energy is a Dirichlet form; quadraticity is part of the conclusion. It covers finite NNN and N=∞N=\inftyN=∞ with the same statement Ambrosio–Gigli–Savaré, Theorem 5.8.

Significance

The theorem permits analytic curvature-dimension bounds to survive convergence even when the carrier spaces, measures, and L2L^2L2 spaces vary. Without a stability statement, a bound verified separately on approximating spaces would give no such bound for their metric measure limit. The theorem also ensures that the limit Cheeger energy retains the quadratic structure required for the Riemannian theory Ambrosio–Gigli–Savaré, Theorem 5.8 and its proof.

The result is proved in the cited paper. The remaining work here is a machine-checked development of its definitions and proof, including the convergence of heat flows and generator terms across changing measures. The statements in this proposal are proof targets; they are not presented as already machine-checked. The definitions of SGH convergence and graph-law convergence can also support other stability questions for metric measure spaces.

Difficulty

The difficulty is that each PtnP_t^nPtn​ acts on a different L2(Xn,mn)L^2(X_n,m_n)L2(Xn​,mn​), while BE(K,N)\mathrm{BE}(K,N)BE(K,N) is an inequality involving the semigroup, its generator, and integrals against mnm_nmn​. Convergence of the underlying measures alone does not imply convergence of those functions or of their squared terms. In particular, pointwise convergence on a common carrier is not even a statement available before choosing embeddings and representatives. The paper's separate notion of function convergence addresses this gap Ambrosio–Gigli–Savaré, Definitions 5.4 and 5.6 and Lemma 5.9.

Formalization scope

Lean keeps the spaces indexed by nnn: Xn n, m n, E n, and P n. The goal uses SGH convergence as an existential ambient realization, rather than assuming the paper's common-space reduction (5.10). The source heat flows and the truncation profile SSS are named by their defining properties; they are the paper's determined objects. The limit heat flow is not assumed to exist: the BE(K,N)\mathrm{BE}(K,N)BE(K,N) conclusion is stated for every family satisfying the heat-flow characterization of 2Ch⁡m∞2\operatorname{Ch}_{m_\infty}2Chm∞​​. Functions represent L2L^2L2 classes, and the common Setting layer records almost-everywhere invariance. The measurable spaces are Borel; the paper's completed measurable structures are represented through measurable versions and almost-everywhere relations.

The formal goal assumes that m∞m_\inftym∞​ has full support on X∞X_\inftyX∞​. Definition 3.6 requires this, while §5.2 explicitly warns that the ambient SGH limit may fail to be fully supported. The full-support condition makes the theorem refer to the intended limit carrier. The goal does not assume that the limit already is a Riemannian energy measure space or satisfies BE(K,N)\mathrm{BE}(K,N)BE(K,N).

Function convergence uses graph laws on X×RkX\times\mathbb R^kX×Rk. The chosen product metric is Mathlib's max metric; any fixed finite product metric yields the same W2W_2W2​ convergence in this setting. The squared Wasserstein distance is extended nonnegative, so a missing finite coupling does not turn into a false real value. The limit energy is defined as 2Ch⁡m∞2\operatorname{Ch}_{m_\infty}2Chm∞​​, with no free energy parameter. Measurable representatives are explicit when forming pushforwards. Lemma 5.9 is stated on a common, fully supported RCD carrier; this narrows its ambient application and is recorded for review. Contributions to the Cheeger-energy invariance, changing-measure function convergence, heat-flow stability, and final BE passage are all within scope.

Selected references

  • Luigi Ambrosio, Nicola Gigli, Giuseppe Savaré, Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds, Annals of Probability 43(1), 2015, 339–404. arXiv:1209.5786v4, DOI:10.1214/14-AOP907.
7 thms1 active userReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Riemannian Proximal Gradient Methods II: The Riemannian Proximal Gradient Method Converges at Rate O(1/k) under Retraction ConvexityResearch Paper

Motivation

Many problems in statistics, signal processing and machine learning minimize a smooth loss plus a nonsmooth regularizer over a set with manifold structure: sparse principal component analysis over the Stiefel manifold, sparse blind deconvolution over the sphere, and clustering and dictionary-learning models with orthogonality constraints. In Euclidean space the standard method for such composite problems is the proximal gradient method, whose O(1/k)O(1/k)O(1/k) rate for convex problems is classical (Beck–Teboulle 2009). Huang and Wei (arXiv:1909.06065v4, Mathematical Programming 2021) propose a Riemannian proximal gradient method (RPG) that solves its proximal subproblem on the tangent space and returns to the manifold through a retraction. They prove three things about it: global convergence, an O(1/k)O(1/k)O(1/k) rate under a convexity notion adapted to retractions, and local rates under a Riemannian Kurdyka–Łojasiewicz property. This mission covers the second result, Theorem 3.2.

Earlier Riemannian proximal methods either required the exponential map and parallel transport, or solved a Euclidean proximal problem in the ambient space (Chen, Ma, So, Zhang 2020, ManPG). Theorem 3.2 is stated for a general retraction, with an explicit constant.

Setting

Let M\mathcal MM be a finite-dimensional Riemannian manifold, with inner product ⟨⋅,⋅⟩x\langle\cdot,\cdot\rangle_x⟨⋅,⋅⟩x​ and norm ∥⋅∥x\|\cdot\|_x∥⋅∥x​ on each tangent space TxMT_x\mathcal MTx​M. A retraction is a family of smooth maps Rx:TxM→MR_x:T_x\mathcal M\to\mathcal MRx​:Tx​M→M with Rx(0x)=xR_x(0_x)=xRx​(0x​)=x and DRx(0x)=id\mathrm DR_x(0_x)=\mathrm{id}DRx​(0x​)=id. The problem is

min⁡x∈MF(x)=f(x)+g(x),\min_{x\in\mathcal M} F(x)=f(x)+g(x),x∈Mmin​F(x)=f(x)+g(x),

where fff is differentiable with Riemannian gradient grad⁡f\operatorname{grad} fgradf, and ggg is continuous and possibly nonsmooth.

For a function hhh on a real inner-product space VVV, the Clarke generalized directional derivative is h∘(η;v)=lim sup⁡ξ→η, t↓0(h(ξ+tv)−h(ξ))/th^\circ(\eta;v)=\limsup_{\xi\to\eta,\,t\downarrow0}(h(\xi+tv)-h(\xi))/th∘(η;v)=limsupξ→η,t↓0​(h(ξ+tv)−h(ξ))/t. The generalized subdifferential is ∂h(η)={ζ∣⟨ζ,v⟩≤h∘(η;v) ∀v}\partial h(\eta)=\{\zeta\mid\langle\zeta,v\rangle\le h^\circ(\eta;v)\ \forall v\}∂h(η)={ζ∣⟨ζ,v⟩≤h∘(η;v) ∀v}. A point η\etaη is stationary for hhh if 0∈∂h(η)0\in\partial h(\eta)0∈∂h(η).

Given a constant L~\tilde LL~, the RPG method (Algorithm 1) produces iterates xkx_kxk​ and steps ηxk∗∈TxkM\eta^*_{x_k}\in T_{x_k}\mathcal Mηxk​∗​∈Txk​​M as follows. Set

ℓxk(η)=⟨grad⁡f(xk),η⟩xk+L~2∥η∥xk2+g(Rxk(η)).\ell_{x_k}(\eta)=\langle\operatorname{grad} f(x_k),\eta\rangle_{x_k}+\frac{\tilde L}{2}\|\eta\|_{x_k}^2+g(R_{x_k}(\eta)).ℓxk​​(η)=⟨gradf(xk​),η⟩xk​​+2L~​∥η∥xk​2​+g(Rxk​​(η)).

Choose a stationary point ηxk∗\eta^*_{x_k}ηxk​∗​ of ℓxk\ell_{x_k}ℓxk​​ on TxkMT_{x_k}\mathcal MTxk​​M with ℓxk(0)≥ℓxk(ηxk∗)\ell_{x_k}(0)\ge\ell_{x_k}(\eta^*_{x_k})ℓxk​​(0)≥ℓxk​​(ηxk​∗​), and set xk+1=Rxk(ηxk∗)x_{k+1}=R_{x_k}(\eta^*_{x_k})xk+1​=Rxk​​(ηxk​∗​).

The assumptions involve the sublevel set Ωx0={x∣F(x)≤F(x0)}\Omega_{x_0}=\{x\mid F(x)\le F(x_0)\}Ωx0​​={x∣F(x)≤F(x0​)} and two notions defined with respect to RRR on a set N\mathcal NN:

  • LLL-retraction-smoothness: h(Rx(η))≤h(x)+⟨grad⁡h(x),η⟩x+L2∥η∥x2h(R_x(\eta))\le h(x)+\langle\operatorname{grad} h(x),\eta\rangle_x+\frac L2\|\eta\|_x^2h(Rx​(η))≤h(x)+⟨gradh(x),η⟩x​+2L​∥η∥x2​;
  • retraction-convexity: qx=h∘Rxq_x=h\circ R_xqx​=h∘Rx​ satisfies qx(η)≥qx(ξ)+⟨ζ,η−ξ⟩xq_x(\eta)\ge q_x(\xi)+\langle\zeta,\eta-\xi\rangle_xqx​(η)≥qx​(ξ)+⟨ζ,η−ξ⟩x​, where ζ\zetaζ is the gradient of qxq_xqx​ at ξ\xiξ, or any Riemannian subgradient of qxq_xqx​ at ξ\xiξ when hhh is nonsmooth.

Assumption 3.1 asks that FFF be bounded below and Ωx0\Omega_{x_0}Ωx0​​ compact. Assumption 3.3 provides an open Ω⊇Ωx0\Omega\supseteq\Omega_{x_0}Ω⊇Ωx0​​ on which fff is LLL-retraction-smooth and retraction-convex and ggg is retraction-convex. Assumption 3.4 bounds how far the retraction is from Euclidean: for all x,y,z∈Ωx,y,z\in\Omegax,y,z∈Ω,

∣∥Rx−1(z)−Rx−1(y)∥x2−∥Ry−1(z)∥y2∣≤κΩ∥Rx−1(y)∥x2.\bigl|\|R_x^{-1}(z)-R_x^{-1}(y)\|_x^2-\|R_y^{-1}(z)\|_y^2\bigr|\le\kappa_\Omega\|R_x^{-1}(y)\|_x^2 .​∥Rx−1​(z)−Rx−1​(y)∥x2​−∥Ry−1​(z)∥y2​​≤κΩ​∥Rx−1​(y)∥x2​.

Finally, β=(L~−L)/2\beta=(\tilde L-L)/2β=(L~−L)/2.

Formalization targets

Goal: Theorem 3.2

Let L~>max⁡(L,0)\tilde L>\max(L,0)L~>max(L,0), suppose Assumptions 3.1, 3.3 and 3.4 hold, and let x∗x_*x∗​ be any accumulation point of {xk}\{x_k\}{xk​}. Then for every k≥1k\ge1k≥1

F(xk)−F(x∗)≤1k(L~2∥Rx0−1(x∗)∥x02+L~κΩ2β(F(x0)−F(x∗))).(3.16)F(x_k)-F(x_*)\le\frac1k\left(\frac{\tilde L}{2}\|R_{x_0}^{-1}(x_*)\|_{x_0}^2+\frac{\tilde L\kappa_\Omega}{2\beta}\bigl(F(x_0)-F(x_*)\bigr)\right).\tag{3.16}F(xk​)−F(x∗​)≤k1​(2L~​∥Rx0​−1​(x∗​)∥x0​2​+2βL~κΩ​​(F(x0​)−F(x∗​))).(3.16)

The constants are those of the paper.

Milestones

  1. Lemma 3.1 (descent): F(xk)−F(xk+1)≥β∥ηxk∗∥xk2F(x_k)-F(x_{k+1})\ge\beta\|\eta^*_{x_k}\|_{x_k}^2F(xk​)−F(xk+1​)≥β∥ηxk​∗​∥xk​2​.
  2. Lemma 3.4 (Riemannian three-point inequality): for one step z=Rx(ηx∗)z=R_x(\eta^*_x)z=Rx​(ηx∗​) and any y=Rx(ξx)∈Ωy=R_x(\xi_x)\in\Omegay=Rx​(ξx​)∈Ω, F(z)≤F(y)+L~2(∥ξx∥x2−∥ξx−ηx∗∥x2)F(z)\le F(y)+\frac{\tilde L}{2}(\|\xi_x\|_x^2-\|\xi_x-\eta^*_x\|_x^2)F(z)≤F(y)+2L~​(∥ξx​∥x2​−∥ξx​−ηx∗​∥x2​).
  3. (3.17): the one-step estimate obtained from Lemma 3.4 with y=x∗y=x_*y=x∗​ and from Assumption 3.4.
  4. (3.18): the one-step estimate with ∥ηxk∗∥2\|\eta^*_{x_k}\|^2∥ηxk​∗​∥2 replaced by the decrease of FFF.
  5. (3.19): the averaged estimate over the first kkk steps.

Significance

Theorem 3.2 extends the O(1/k)O(1/k)O(1/k) function-value rate of the proximal gradient method to manifolds and general retractions. The constant is explicit: it combines the initial distance ∥Rx0−1(x∗)∥\|R_{x_0}^{-1}(x_*)\|∥Rx0​−1​(x∗​)∥ with a correction proportional to κΩ\kappa_\OmegaκΩ​, which measures how far the retraction is from Euclidean. In the Euclidean case Rx(η)=x+ηR_x(\eta)=x+\etaRx​(η)=x+η one can take κΩ=0\kappa_\Omega=0κΩ​=0, and the bound reduces to the classical one. The rate concerns F(xk)−F(x∗)F(x_k)-F(x_*)F(xk​)−F(x∗​), which the iteration bound of Theorem 3.1 (the norm of ηxk∗\eta^*_{x_k}ηxk​∗​) does not control.

The result is proved in the paper. None of it is formalized, and no machine-checked version of the Euclidean proximal-gradient rate is on the platform either. A formalization would supply the first checked version of Clarke stationarity on tangent spaces, of the retraction-based convexity and smoothness notions, and of a rate proof for a nonsmooth Riemannian algorithm. These pieces carry over to other retraction-based methods, such as the accelerated variants of §4 of the paper.

Difficulty

The arithmetic of the rate proof is a telescoping sum, so the work lies elsewhere. First, Lemma 3.4 needs a usable form of the stationarity condition 0∈∂ℓx(ηx∗)0\in\partial\ell_x(\eta^*_x)0∈∂ℓx​(ηx∗​): a subgradient of g∘Rxg\circ R_xg∘Rx​ at ηx∗\eta^*_xηx∗​ equal to −(grad⁡f(x)+L~ηx∗)-(\operatorname{grad} f(x)+\tilde L\eta^*_x)−(gradf(x)+L~ηx∗​). This requires a sum rule for the Clarke subdifferential of a C1C^1C1 function plus a locally Lipschitz one, on a tangent space whose norm comes from the Riemannian metric rather than from the model space. Second, the gradient of f∘Rxf\circ R_xf∘Rx​ at 0x0_x0x​ has to be identified with grad⁡f(x)\operatorname{grad} f(x)gradf(x) through DRx(0x)=id\mathrm DR_x(0_x)=\mathrm{id}DRx​(0x​)=id. In Mathlib this mixes manifold derivatives (mfderiv) with Fréchet derivatives on a space carrying two equivalent norms. Third, it has to be shown that the iterates and the accumulation point remain in Ω\OmegaΩ, so that Assumptions 3.3 and 3.4 apply at every step.

Formalization scope

Theorem numbers and pages are those of arXiv:1909.06065v4. M\mathcal MM is a smooth manifold modelled on a finite-dimensional real inner-product space EEE, with Mathlib's RiemannianBundle on the tangent bundle. All norms and inner products on TxMT_x\mathcal MTx​M are the Riemannian ones. Retractions and gradients are the published RiemOpt.BFGS.IsRetraction and RiemOpt.FR.IsGradient. The Clarke derivative is an EReal-valued limit superior along N(η)×N>0(0)\mathcal N(\eta)\times\mathcal N_{>0}(0)N(η)×N>0​(0). Algorithm 1 is modelled as a run (sequences xkx_kxk​, ηxk∗\eta^*_{x_k}ηxk​∗​ with the three defining properties), and every statement holds for every run. Indices start at 000, accumulation points are cluster points of the sequence, and the bounds divided by kkk are stated for k≥1k\ge1k≥1.

The formalization commits to the following readings:

  1. LLL-retraction-smoothness is required for every tangent vector at the points of the set. This is a strengthening of Definition 3.1, which only covers η\etaη with Rx(η)R_x(\eta)Rx​(η) in the set, and it is needed because Lemma 3.1 fails under the literal reading.
  2. In retraction-convexity the vector ζ\zetaζ depends on ξ\xiξ. It is the gradient of f∘Rxf\circ R_xf∘Rx​, respectively any Clarke subgradient of g∘Rxg\circ R_xg∘Rx​, as the sentence after (3.10) states.
  3. κΩ\kappa_\OmegaκΩ​ is a single constant.
  4. R−1R^{-1}R−1 is data with Rx(Rx−1(y))=yR_x(R_x^{-1}(y))=yRx​(Rx−1​(y))=y on Ω\OmegaΩ, together with the identification Rxk−1(xk+1)=ηxk∗R_{x_k}^{-1}(x_{k+1})=\eta^*_{x_k}Rxk​−1​(xk+1​)=ηxk​∗​ that the proof uses.
  5. Local Lipschitz continuity of g∘Rxg\circ R_xg∘Rx​ is assumed, as p. 5 presupposes when it defines the subdifferential.

A single ζ\zetaζ for all η,ξ\eta,\xiη,ξ in (3.10) would make retraction-convexity force qxq_xqx​ to be affine, and the theorem would only cover affine problems. That reading is excluded. Statements with the case k=0k=0k=0, where Lean's 1/0=01/0=01/0=0 makes (3.16) false, are excluded as well.

Contributions welcome: a Clarke sum rule for C1C^1C1 plus locally Lipschitz functions, the identification of the Fréchet derivative of f∘Rxf\circ R_xf∘Rx​ at 000 with the Riemannian gradient, and the five milestones in order. The Clarke layer and the derivative identification are reusable beyond this mission.

Selected references

  • W. Huang, K. Wei, Riemannian proximal gradient methods, Mathematical Programming, 2021; extended version arXiv:1909.06065v4. https://arxiv.org/abs/1909.06065v4, https://doi.org/10.1007/s10107-021-01632-3
  • A. Beck, M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sciences, 2009. https://doi.org/10.1137/080716542
  • S. Chen, S. Ma, A. M.-C. So, T. Zhang, Proximal gradient method for nonsmooth optimization over the Stiefel manifold, SIAM J. Optimization, 2020. https://doi.org/10.1137/18M122457X
  • F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, 1983. https://doi.org/10.1137/1.9781611971309
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008. https://doi.org/10.1515/9781400830244
10 thms1 active userReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Riemannian Proximal Gradient Methods I: Every Accumulation Point of the Riemannian Proximal Gradient Method Is Stationary, with an Explicit Iteration BoundResearch Paper

Motivation

Many problems in statistics, signal processing and machine learning minimize a smooth loss plus a nonsmooth regularizer over a set that is a manifold rather than a vector space: sparse principal component analysis over the Stiefel manifold, sparse blind deconvolution over the sphere, low-rank recovery over fixed-rank matrices. In Euclidean space the standard tool for min⁡f+g\min f + gminf+g with fff smooth and ggg nonsmooth is the proximal gradient method, whose convergence theory (stationarity of limit points, an O(1/ϵ2)O(1/\epsilon^2)O(1/ϵ2) bound on the number of iterations to reach an ϵ\epsilonϵ-small step, an O(1/k)O(1/k)O(1/k) rate under convexity) is classical (Beck–Teboulle 2009).

Huang and Wei (arXiv:1909.06065, Mathematical Programming 2021) proposed the Riemannian proximal gradient method (RPG): at each iterate the proximal subproblem is posed on the tangent space, the nonsmooth term is pulled back through a retraction, and the next iterate is obtained by retracting the computed step. Unlike the earlier ManPG method of Chen, Ma, So and Zhang (2020), which uses the Euclidean proximal mapping of an embedding space, RPG is defined intrinsically on any manifold with a retraction. Its global convergence theorem is the subject of this mission.

Setting

Let M\mathcal MM be a finite-dimensional manifold with a smooth Riemannian metric ⟨⋅,⋅⟩x\langle\cdot,\cdot\rangle_x⟨⋅,⋅⟩x​ on each tangent space TxMT_x\mathcal MTx​M, with norm ∥⋅∥x\|\cdot\|_x∥⋅∥x​. A retraction is a smooth map R:TM→MR : T\mathcal M\to\mathcal MR:TM→M, (x,η)↦Rx(η)(x,\eta)\mapsto R_x(\eta)(x,η)↦Rx​(η), with Rx(0x)=xR_x(0_x) = xRx​(0x​)=x and DRx(0x)=idDR_x(0_x) = \mathrm{id}DRx​(0x​)=id. The vector transport by differentiated retraction is Tηx=DRx(ηx):TxM→TRx(ηx)M\mathcal T_{\eta_x} = DR_x(\eta_x) : T_x\mathcal M\to T_{R_x(\eta_x)}\mathcal MTηx​​=DRx​(ηx​):Tx​M→TRx​(ηx​)​M; Tηx♯\mathcal T^\sharp_{\eta_x}Tηx​♯​ denotes its adjoint for the two metrics and Tηx−♯\mathcal T^{-\sharp}_{\eta_x}Tηx​−♯​ the adjoint of its inverse.

The problem is

min⁡x∈MF(x)=f(x)+g(x),\min_{x\in\mathcal M} F(x) = f(x) + g(x),x∈Mmin​F(x)=f(x)+g(x),

with fff continuously differentiable, Riemannian gradient grad⁡f\operatorname{grad} fgradf, and ggg continuous, possibly nonsmooth. For h:M→Rh : \mathcal M\to\mathbb Rh:M→R the Riemannian Clarke subdifferential is defined through the pull-back h^x=h∘Rx\hat h_x = h\circ R_xh^x​=h∘Rx​ on the Hilbert space TxMT_x\mathcal MTx​M:

h^x∘(η;v)=lim sup⁡ξ→η, t↓0h^x(ξ+tv)−h^x(ξ)t,∂h(x)={ζ∈TxM∣⟨ζ,v⟩x≤h^x∘(0x;v) ∀v}.\hat h_x^\circ(\eta; v) = \limsup_{\xi\to\eta,\ t\downarrow 0}\frac{\hat h_x(\xi+tv)-\hat h_x(\xi)}{t},\qquad \partial h(x) = \{\zeta\in T_x\mathcal M \mid \langle\zeta,v\rangle_x\le\hat h_x^\circ(0_x;v)\ \forall v\}.h^x∘​(η;v)=ξ→η, t↓0limsup​th^x​(ξ+tv)−h^x​(ξ)​,∂h(x)={ζ∈Tx​M∣⟨ζ,v⟩x​≤h^x∘​(0x​;v) ∀v}.

A point xxx is stationary if 0∈∂F(x)0\in\partial F(x)0∈∂F(x).

Algorithm 1 (RPG). Given x0x_0x0​ and a constant L~>L\tilde L > LL~>L, for k=0,1,…k = 0,1,\dotsk=0,1,… let

ℓxk(η)=⟨grad⁡f(xk),η⟩xk+L~2∥η∥xk2+g(Rxk(η)),\ell_{x_k}(\eta) = \langle\operatorname{grad} f(x_k),\eta\rangle_{x_k} + \frac{\tilde L}{2}\|\eta\|_{x_k}^2 + g(R_{x_k}(\eta)),ℓxk​​(η)=⟨gradf(xk​),η⟩xk​​+2L~​∥η∥xk​2​+g(Rxk​​(η)),

choose ηxk∗∈TxkM\eta^*_{x_k}\in T_{x_k}\mathcal Mηxk​∗​∈Txk​​M that is a stationary point of ℓxk\ell_{x_k}ℓxk​​ with ℓxk(0)≥ℓxk(ηxk∗)\ell_{x_k}(0)\ge\ell_{x_k}(\eta^*_{x_k})ℓxk​​(0)≥ℓxk​​(ηxk​∗​) (condition (3.1)), and set xk+1=Rxk(ηxk∗)x_{k+1} = R_{x_k}(\eta^*_{x_k})xk+1​=Rxk​​(ηxk​∗​).

Assumption 3.1. FFF is bounded below and Ωx0={x∣F(x)≤F(x0)}\Omega_{x_0} = \{x \mid F(x)\le F(x_0)\}Ωx0​​={x∣F(x)≤F(x0​)} is compact. Assumption 3.2. fff is LLL-retraction-smooth on Ωx0\Omega_{x_0}Ωx0​​: f(Rx(η))≤f(x)+⟨grad⁡f(x),η⟩x+L2∥η∥x2f(R_x(\eta))\le f(x) + \langle\operatorname{grad} f(x),\eta\rangle_x + \frac L2\|\eta\|_x^2f(Rx​(η))≤f(x)+⟨gradf(x),η⟩x​+2L​∥η∥x2​ (inequality (3.2)).

Formalization targets

Goal: Theorem 3.1

For every run of Algorithm 1: if ηxk∗=0\eta^*_{x_k} = 0ηxk​∗​=0 then xkx_kxk​ is stationary. Under Assumptions 3.1 and 3.2, {xk}\{x_k\}{xk​} has an accumulation point, every accumulation point x∗x_*x∗​ is stationary, and for every ϵ>0\epsilon > 0ϵ>0 some iterate with index at most

F(x0)−F(x∗)βϵ2,β=L~−L2,\frac{F(x_0)-F(x_*)}{\beta\epsilon^2},\qquad\beta = \frac{\tilde L - L}{2},βϵ2F(x0​)−F(x∗​)​,β=2L~−L​,

satisfies ∥ηxk∗∥xk≤ϵ\|\eta^*_{x_k}\|_{x_k}\le\epsilon∥ηxk​∗​∥xk​​≤ϵ.

Milestones, in the order the proof uses them

  • Lemma 3.1 (descent): F(xk)−F(xk+1)≥β∥ηxk∗∥xk2F(x_k) - F(x_{k+1})\ge\beta\|\eta^*_{x_k}\|_{x_k}^2F(xk​)−F(xk+1​)≥β∥ηxk​∗​∥xk​2​.
  • (3.6): lim⁡k∥ηxk∗∥xk=0\lim_k\|\eta^*_{x_k}\|_{x_k} = 0limk​∥ηxk​∗​∥xk​​=0.
  • Lemma 3.2: for a continuous vector field ξ\xiξ, ∥ξy−Tηx−♯ξx∥y→0\|\xi_y - \mathcal T^{-\sharp}_{\eta_x}\xi_x\|_y\to 0∥ξy​−Tηx​−♯​ξx​∥y​→0 as ηx→0\eta_x\to 0ηx​→0 on the tangent bundle, y=Rx(ηx)y = R_x(\eta_x)y=Rx​(ηx​).
  • (3.8): at every iteration some ζ∈∂g(xk+1)\zeta\in\partial g(x_{k+1})ζ∈∂g(xk+1​) satisfies grad⁡f(xk)+L~ηxk∗+TRηxk∗♯ζ=0\operatorname{grad} f(x_k)+\tilde L\eta^*_{x_k}+\mathcal T^\sharp_{R_{\eta^*_{x_k}}}\zeta = 0gradf(xk​)+L~ηxk​∗​+TRηxk​∗​​♯​ζ=0.
  • (3.9): where the transport is invertible, grad⁡f(xk+1)−T−♯(grad⁡f(xk)+L~ηxk∗)=grad⁡f(xk+1)+ζ∈∂F(xk+1)\operatorname{grad} f(x_{k+1}) - \mathcal T^{-\sharp}(\operatorname{grad} f(x_k)+\tilde L\eta^*_{x_k}) = \operatorname{grad} f(x_{k+1})+\zeta\in\partial F(x_{k+1})gradf(xk+1​)−T−♯(gradf(xk​)+L~ηxk​∗​)=gradf(xk+1​)+ζ∈∂F(xk+1​).

Significance

Theorem 3.1 is the basic convergence guarantee of RPG: the method is a descent method without any convexity of ggg, its limit points satisfy the first-order necessary condition 0∈∂F0\in\partial F0∈∂F, and the number of iterations needed to make the step small is explicit, with the same O(1/ϵ2)O(1/\epsilon^2)O(1/ϵ2) dependence as in the Euclidean case. It underlies the further analyses of the same paper (the O(1/k)O(1/k)O(1/k) rate under retraction convexity and the Kurdyka–Łojasiewicz analysis) and of later Riemannian proximal methods.

The theorem is proved on paper; no machine-checked version exists. Formalizing it requires a Clarke subdifferential on tangent spaces, its calculus (sum rule with a C1C^1C1 function, chain rule through a local diffeomorphism) and its closedness along convergent sequences on a manifold. None of these is in Mathlib. They are reusable well beyond this paper by any Riemannian nonsmooth optimization method.

Difficulty

The descent inequality and the iteration bound are elementary once Lemma 3.1 is available. The difficulty is the stationarity of accumulation points. The subproblem's optimality condition (3.8) lives in the tangent space at xkx_kxk​ and involves a subgradient of ggg at xk+1x_{k+1}xk+1​; to pass to the limit, the gradients and subgradients must be compared across different tangent spaces, which is what the inverse-adjoint transport and Lemma 3.2 do. This needs joint continuity of the retraction and its differential on the tangent bundle and continuity of the metric, and then a closedness property of the Riemannian Clarke subdifferential that the paper cites from Hosseini, Huang and Yousefpour (2018, Theorem 2.2(c)) and that a complete development must prove. A pointwise argument at a fixed base point does not suffice, because the base points xkjx_{k_j}xkj​​ move.

Formalization scope

Theorem numbers and pages are those of arXiv:1909.06065v4. The manifold is modelled on a finite-dimensional real inner-product space EEE and carries a RiemannianBundle with a smooth metric (IsContMDiffRiemannianBundle). Retraction, differentiated-retraction transport and Riemannian gradient are the published definitions RiemOpt.BFGS.Setting and RiemOpt.FR.Setting; joint smoothness of RRR on the tangent bundle is added, as on p. 4. The Clarke limit superior is taken in EReal along N(η)×N>0(0)\mathcal N(\eta)\times\mathcal N_{>0}(0)N(η)×N>0​(0), so it never takes a default value. Accumulation points are MapClusterPt, and "in at most NNN iterations" is an index k≤Nk\le Nk≤N. A run of Algorithm 1 is any sequence of iterates and steps satisfying (3.1); the step is a selection, not a function of the iterate.

Two hypotheses are explicit in the Lean statements. Each pull-back g∘Rxg\circ R_xg∘Rx​ is locally Lipschitz, which p. 5 requires for the subdifferential to be defined. fff is C1C^1C1, because the proof applies Lemma 3.2 to grad⁡f\operatorname{grad} fgradf. Assumption 3.2 is stated in the form the proof of Lemma 3.1 uses: (3.2) at every x∈Ωx0x\in\Omega_{x_0}x∈Ωx0​​ for every tangent vector. Definition 3.1 read literally only constrains η\etaη with Rx(η)∈Ωx0R_x(\eta)\in\Omega_{x_0}Rx​(η)∈Ωx0​​, and under that reading Lemma 3.1 fails: a nonconvex ggg can send x1x_1x1​ far outside Ωx0\Omega_{x_0}Ωx0​​. The paper's own sufficient condition gives the strengthened form.

The formalization must not trivialize stationarity. The subdifferential is defined from the Clarke derivative of the pull-back alone. It does not involve T−♯\mathcal T^{-\sharp}T−♯ or ContinuousLinearMap.inverse, so 0∈∂F(x)0\in\partial F(x)0∈∂F(x) is a genuine condition. The run hypotheses are satisfiable, for instance on M=R\mathcal M = \mathbb RM=R with Rx(η)=x+ηR_x(\eta) = x+\etaRx​(η)=x+η, f(x)=x2f(x) = x^2f(x)=x2, g=0g = 0g=0, xk=0x_k = 0xk​=0, ηk=0\eta_k = 0ηk​=0.

Welcome contributions: the Clarke calculus on a real Hilbert space (sum rule, chain rule through a C1C^1C1 map, upper semicontinuity), local invertibility of DRx(η)DR_x(\eta)DRx​(η) near the zero section, and the closedness of the Riemannian subdifferential on the tangent bundle.

Selected references

  • W. Huang, K. Wei, Riemannian proximal gradient methods, Mathematical Programming, 2021. arXiv:1909.06065v4. https://arxiv.org/abs/1909.06065, https://doi.org/10.1007/s10107-021-01632-3
  • S. Hosseini, W. Huang, R. Yousefpour, Line search algorithms for locally Lipschitz functions on Riemannian manifolds, SIAM Journal on Optimization 28(1):596–619, 2018 (reference [29] of Huang–Wei; source of the Riemannian Clarke subdifferential and of its closedness, Theorem 2.2(c)). https://epubs.siam.org/toc/sjope8/28/1
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008. https://doi.org/10.1515/9781400830244
  • S. Chen, S. Ma, A. M.-C. So, T. Zhang, Proximal gradient method for nonsmooth optimization over the Stiefel manifold, SIAM Journal on Optimization 30 (2020). https://doi.org/10.1137/18M122457X
  • A. Beck, M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM Journal on Imaging Sciences 2 (2009). https://doi.org/10.1137/080716542
  • F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, 1983. https://doi.org/10.1137/1.9781611971309
9 thms1 active userReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Optimization Methods on Riemannian Manifolds and Their Application to Shape Space 2: Riemannian Fletcher-Reeves Conjugate Gradient with Strong Wolfe Steps Has liminf of the Gradient Norm ZeroResearch Paper

Motivation

Many optimization problems in shape analysis, computer vision, numerical linear algebra and statistics have a nonlinear search space: a sphere, a Stiefel or Grassmann manifold, a space of curves modulo reparametrization. Projecting iterates of a Euclidean method back onto the constraint set loses the geometry, so one designs methods that move along the manifold itself. Riemannian line-search methods do this by replacing the update xk+1=xk+αkpkx_{k+1}=x_k+\alpha_kp_kxk+1​=xk​+αk​pk​ with xk+1=Rxk(αkpk)x_{k+1}=R_{x_k}(\alpha_kp_k)xk+1​=Rxk​​(αk​pk​) for a retraction RRR, and by carrying old search directions to the new tangent space with a transport.

Nonlinear conjugate gradient (NCG) methods are a natural candidate on manifolds: they need only first derivatives and store one previous direction. In the Euclidean case, Al-Baali showed in 1985 that the Fletcher–Reeves method with strong Wolfe step lengths and c2<12c_2<\tfrac12c2​<21​ satisfies lim inf⁡k∥∇f(xk)∥=0\liminf_k\|\nabla f(x_k)\|=0liminfk​∥∇f(xk​)∥=0 (doi:10.1093/imanum/5.1.121); Nocedal and Wright give the standard textbook proof (Lemma 5.6 and Theorem 5.7 in Numerical Optimization). Ring and Wirth (doi:10.1137/11082885X, SIAM J. Optim. 2012) transfer this analysis to Riemannian manifolds, possibly infinite-dimensional, which is the setting of their application to shape spaces. The mission formalizes that transfer.

Setting

M\mathcal MM is a smooth manifold modelled on a real Hilbert space EEE, with a Riemannian metric gxg_xgx​ on each tangent space TxMT_x\mathcal MTx​M and norm ∥⋅∥x\|\cdot\|_x∥⋅∥x​. For f:M→Rf:\mathcal M\to\mathbb Rf:M→R, Df(x)\mathrm Df(x)Df(x) is its differential, a continuous linear functional on TxMT_x\mathcal MTx​M with dual norm ∥Df(x)∥x\|\mathrm Df(x)\|_x∥Df(x)∥x​, and the gradient ∇f(x)∈TxM\nabla f(x)\in T_x\mathcal M∇f(x)∈Tx​M is its Riesz representative, gx(∇f(x),v)=Df(x)vg_x(\nabla f(x),v)=\mathrm Df(x)vgx​(∇f(x),v)=Df(x)v.

A retraction is a family of smooth maps Rx:TxM→MR_x:T_x\mathcal M\to\mathcal MRx​:Tx​M→M with Rx(0)=xR_x(0)=xRx​(0)=x and DRx(0)=id\mathrm DR_x(0)=\mathrm{id}DRx​(0)=id. Its transport is Tx,Rx(v)Rx=DRx(v):TxM→TRx(v)MT^{R_x}_{x,R_x(v)}=\mathrm DR_x(v):T_x\mathcal M\to T_{R_x(v)}\mathcal MTx,Rx​(v)Rx​​=DRx​(v):Tx​M→TRx​(v)​M.

A run of Algorithm 1 consists of points xkx_kxk​, directions pk∈TxkMp_k\in T_{x_k}\mathcal Mpk​∈Txk​​M and steps αk>0\alpha_k>0αk​>0 with xk+1=Rxk(αkpk)x_{k+1}=R_{x_k}(\alpha_kp_k)xk+1​=Rxk​​(αk​pk​). With 0<c1<c2<10<c_1<c_2<10<c1​<c2​<1, the Wolfe conditions at (x,p,α)(x,p,\alpha)(x,p,α) are

f(Rx(αp))≤f(x)+c1α Df(x)p,(1a)f(R_x(\alpha p))\le f(x)+c_1\alpha\,\mathrm Df(x)p,\tag{1a}f(Rx​(αp))≤f(x)+c1​αDf(x)p,(1a) Df(Rx(αp)) Tx,Rx(αp)Rxp≥c2 Df(x)p,(1b)\mathrm Df(R_x(\alpha p))\,T^{R_x}_{x,R_x(\alpha p)}p\ge c_2\,\mathrm Df(x)p,\tag{1b}Df(Rx​(αp))Tx,Rx​(αp)Rx​​p≥c2​Df(x)p,(1b)

and the strong Wolfe conditions replace (1b) by

∣Df(Rx(αp)) Tx,Rx(αp)Rxp∣≤−c2 Df(x)p.(2)\bigl|\mathrm Df(R_x(\alpha p))\,T^{R_x}_{x,R_x(\alpha p)}p\bigr|\le -c_2\,\mathrm Df(x)p.\tag{2}​Df(Rx​(αp))Tx,Rx​(αp)Rx​​p​≤−c2​Df(x)p.(2)

The angle θk\theta_kθk​ between pkp_kpk​ and −∇f(xk)-\nabla f(x_k)−∇f(xk​) is given by cos⁡θk=−Df(xk)pk/(∥Df(xk)∥xk∥pk∥xk)\cos\theta_k=-\mathrm Df(x_k)p_k/(\|\mathrm Df(x_k)\|_{x_k}\|p_k\|_{x_k})cosθk​=−Df(xk​)pk​/(∥Df(xk​)∥xk​​∥pk​∥xk​​).

The Fletcher–Reeves direction is

p0=−∇f(x0),pk+1=−∇f(xk+1)+βk+1 Txk,xk+1Rxkpk,βk+1=∥Df(xk+1)∥xk+12∥Df(xk)∥xk2.p_0=-\nabla f(x_0),\qquad p_{k+1}=-\nabla f(x_{k+1})+\beta_{k+1}\,T^{R_{x_k}}_{x_k,x_{k+1}}p_k,\qquad \beta_{k+1}=\frac{\|\mathrm Df(x_{k+1})\|_{x_{k+1}}^2}{\|\mathrm Df(x_k)\|_{x_k}^2}.p0​=−∇f(x0​),pk+1​=−∇f(xk+1​)+βk+1​Txk​,xk+1​Rxk​​​pk​,βk+1​=∥Df(xk​)∥xk​2​∥Df(xk+1​)∥xk+1​2​​.

Formalization targets

Goal: Proposition 15

For a non-terminating Fletcher–Reeves run with strong Wolfe steps and 0<c1<c2<120<c_1<c_2<\tfrac120<c1​<c2​<21​, if the transport is non-expansive on the search directions, ∥Txk,xk+1Rxkpk∥xk+1≤∥pk∥xk\|T^{R_{x_k}}_{x_k,x_{k+1}}p_k\|_{x_{k+1}}\le\|p_k\|_{x_k}∥Txk​,xk+1​Rxk​​​pk​∥xk+1​​≤∥pk​∥xk​​, fff is bounded below, and the pull-backs f∘Rxkf\circ R_{x_k}f∘Rxk​​ are Lipschitz continuously differentiable on span{pk}\mathrm{span}\{p_k\}span{pk​} with a uniform constant, then

lim inf⁡k→∞∥Df(xk)∥xk=0.\liminf_{k\to\infty}\|\mathrm Df(x_k)\|_{x_k}=0.k→∞liminf​∥Df(xk​)∥xk​​=0.

Milestones

  1. Theorem 2 (Zoutendijk). For Wolfe steps along descent directions, fff bounded below and the line-Lipschitz condition, ∑kcos⁡2θk∥Df(xk)∥xk2<∞\sum_k\cos^2\theta_k\|\mathrm Df(x_k)\|_{x_k}^2<\infty∑k​cos2θk​∥Df(xk​)∥xk​2​<∞.
  2. Lemma 14. For a Fletcher–Reeves run with strong Wolfe steps and c2<12c_2<\tfrac12c2​<21​,
−11−c2≤Df(xk)pk∥Df(xk)∥xk2≤2c2−11−c2.-\frac1{1-c_2}\le\frac{\mathrm Df(x_k)p_k}{\|\mathrm Df(x_k)\|_{x_k}^2}\le\frac{2c_2-1}{1-c_2}.−1−c2​1​≤∥Df(xk​)∥xk​2​Df(xk​)pk​​≤1−c2​2c2​−1​.
  1. The angle sandwich (proof of Proposition 15): 1−2c21−c2∥Df(xk)∥∥pk∥≤cos⁡θk≤11−c2∥Df(xk)∥∥pk∥\frac{1-2c_2}{1-c_2}\frac{\|\mathrm Df(x_k)\|}{\|p_k\|}\le\cos\theta_k\le\frac1{1-c_2}\frac{\|\mathrm Df(x_k)\|}{\|p_k\|}1−c2​1−2c2​​∥pk​∥∥Df(xk​)∥​≤cosθk​≤1−c2​1​∥pk​∥∥Df(xk​)∥​.
  2. Square summability: ∑k∥Df(xk)∥4/∥pk∥2<∞\sum_k\|\mathrm Df(x_k)\|^4/\|p_k\|^2<\infty∑k​∥Df(xk​)∥4/∥pk​∥2<∞.
  3. Growth bound: ∥pk∥2≤1+c21−c2∥Df(xk)∥4∑j=0k∥Df(xj)∥−2\|p_k\|^2\le\frac{1+c_2}{1-c_2}\|\mathrm Df(x_k)\|^4\sum_{j=0}^k\|\mathrm Df(x_j)\|^{-2}∥pk​∥2≤1−c2​1+c2​​∥Df(xk​)∥4∑j=0k​∥Df(xj​)∥−2.

Significance

Proposition 15 guarantees that Riemannian Fletcher–Reeves, with any retraction whose transport does not enlarge the search direction, cannot stall at a positive gradient level: some subsequence of the gradient norms tends to zero. Together with strict convexity in the sense of the paper's Proposition 4 this gives convergence of the iterates to the minimizer, and it justifies the use of the method on the shape spaces of the paper's §4. The hypothesis on the transport is the only new ingredient compared with the Euclidean theorem, and the paper's Remark 7 notes that convergence can no longer be guaranteed without it.

The result is proved in the paper. As far as is known, neither Zoutendijk's theorem on a manifold nor the Fletcher–Reeves convergence theorem has a machine-checked proof; Euclidean versions of both appear elsewhere on the platform, but the Riemannian statements, with retraction, transport and tangent-space-dependent norms, are new. The mission produces the line-search interface on a Riemannian manifold (retraction, transport, Wolfe conditions) in a form reusable by other Riemannian methods.

Difficulty

Each search direction is built from a vector in a different tangent space. The transported direction DRxk(αkpk)pk\mathrm DR_{x_k}(\alpha_kp_k)p_kDRxk​​(αk​pk​)pk​ lives in TRxk(αkpk)MT_{R_{x_k}(\alpha_kp_k)}\mathcal MTRxk​​(αk​pk​)​M, and only the step equation identifies it with a vector of Txk+1MT_{x_{k+1}}\mathcal MTxk+1​​M; norms, inner products and differentials all depend on the base point, so every Euclidean manipulation has to be carried through that identification. Zoutendijk's theorem has to connect two different descriptions of the same step: the curvature condition (1b) is stated with the differential of fff at the new point applied to the transported direction, while the Lipschitz hypothesis concerns the one-variable pull-back t↦f(Rxk(tpk))t\mapsto f(R_{x_k}(tp_k))t↦f(Rxk​​(tpk​)). They agree only because the transport is the derivative of the retraction, and the agreement is a chain rule for manifold derivatives, which has to be established in Mathlib's mfderiv framework for maps out of a tangent space. The growth bound cannot use ∥Tp∥=∥p∥\|T p\|=\|p\|∥Tp∥=∥p∥; it needs the non-expansiveness hypothesis exactly where the Euclidean argument uses the identity.

Formalization scope

The manifold is a Mathlib manifold modelled on a real Hilbert space E, with Mathlib's RiemannianBundle on its tangent spaces; tangent-space norms and inner products are the Riemannian ones and Df(x)\mathrm Df(x)Df(x) is mfderiv. Geodesic completeness, separability, the distance and the Levi-Civita connection, standing assumptions of the paper, are not used by any statement and are dropped. The gradient is given as a field with its Riesz property. One retraction family is used for every step (the paper allows a different retraction at each step), the steps are positive, and indices start at 000.

The following readings are explicit:

  • The Fletcher–Reeves run is assumed never to stop (Df(xk)≠0\mathrm Df(x_k)\neq0Df(xk​)=0), since βk+1\beta_{k+1}βk+1​ divides by ∥Df(xk)∥2\|\mathrm Df(x_k)\|^2∥Df(xk​)∥2.
  • Descent of the Fletcher–Reeves directions is not assumed; it follows from Lemma 14.
  • "Lipschitz continuously differentiable on span{pk}\mathrm{span}\{p_k\}span{pk​} with constant LLL" is read for hk(t)=f(Rxk(tpk))h_k(t)=f(R_{x_k}(tp_k))hk​(t)=f(Rxk​​(tpk​)): hkh_khk​ is differentiable and ∣hk′(s)−hk′(t)∣≤L∣s−t∣ ∥pk∥2|h_k'(s)-h_k'(t)|\le L|s-t|\,\|p_k\|^2∣hk′​(s)−hk′​(t)∣≤L∣s−t∣∥pk​∥2, with L>0L>0L>0.
  • The hypotheses of Theorem 2 (lower bound on fff, line-Lipschitz condition), which the proof of Proposition 15 invokes but whose statement does not list, are added to Proposition 15 and to the square-summability milestone.
  • The lim inf⁡\liminfliminf is stated as: for every ε>0\varepsilon>0ε>0 and NNN there is k≥Nk\ge Nk≥N with ∥Df(xk)∥<ε\|\mathrm Df(x_k)\|<\varepsilon∥Df(xk​)∥<ε; sums are stated with Summable.

The transport in the conclusion and in the Fletcher–Reeves update is the derivative of the retraction, not an arbitrary linear map; with an arbitrary map, condition (1b) would no longer be a statement about the pull-back f∘Rxkf\circ R_{x_k}f∘Rxk​​, and Zoutendijk's theorem would fail. A run predicate that no sequence satisfies would make the goal vacuous; the one-dimensional run M=R\mathcal M=\mathbb RM=R, Rx(v)=x+vR_x(v)=x+vRx​(v)=x+v, f(x)=x2/2f(x)=x^2/2f(x)=x2/2, c1=0.1c_1=0.1c1​=0.1, c2=0.45c_2=0.45c2​=0.45, xk+1=0.4xkx_{k+1}=0.4x_kxk+1​=0.4xk​ satisfies every hypothesis.

The paper's other main result, R-linear convergence of Riemannian BFGS (Proposition 10), is a separate mission, and its superlinear-rate results (Propositions 5, 7, 8, 12, Corollary 13), which require parallel transport and the exponential map, are out of scope. Contributions welcome: proofs of the chain rule identities for retractions (reusable for any Riemannian line search), of Zoutendijk's theorem, and of the milestones in order.

Selected references

  • W. Ring, B. Wirth, Optimization Methods on Riemannian Manifolds and Their Application to Shape Space, SIAM J. Optim. 22(2), 596–627, 2012. https://doi.org/10.1137/11082885X
  • M. Al-Baali, Descent property and global convergence of the Fletcher–Reeves method with inexact line search, IMA J. Numer. Anal. 5(1), 121–124, 1985. https://doi.org/10.1093/imanum/5.1.121
  • J. Nocedal, S. J. Wright, Numerical Optimization, 2nd ed., Springer, 2006 (Lemma 5.6, Theorem 5.7). https://doi.org/10.1007/978-0-387-40065-5
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008. https://doi.org/10.1515/9781400830244
8 thms1 active userReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Optimization Methods on Riemannian Manifolds and Their Application to Shape Space 1: Riemannian BFGS with Isometric Vector Transport Converges R-Linearly under Uniform ConvexityResearch Paper

Motivation

Many optimization problems in shape analysis, computer vision, numerical linear algebra and statistics have a feasible set that is not a vector space but a Riemannian manifold: spaces of curves modulo reparametrization, the Stiefel and Grassmann manifolds, fixed-rank matrices. On such a set the classical recipe "add a multiple of the search direction to the iterate" is not available, and line-search methods replace it by a retraction, a map that follows a tangent direction back onto the manifold (Absil, Mahony, Sepulchre 2008).

Quasi-Newton methods are the most widely used line-search methods in the Euclidean setting, and BFGS is the most popular of them. Transferring BFGS to a manifold raises a specific problem: the Hessian approximation BkB_kBk​ lives on the tangent space at xkx_kxk​, while the next one must live on the tangent space at xk+1x_{k+1}xk+1​, so a vector transport TkT_kTk​ between tangent spaces enters the update.

Timeline:

  • Gabay (1982) proposed a Riemannian BFGS update with geodesics and parallel transport (doi:10.1007/BF00934767).
  • Absil, Mahony and Sepulchre (2008) and Qi, Gallivan and Absil (2010) generalized it to arbitrary retractions and vector transports.
  • Ring and Wirth (2012), the source of this mission, proved global convergence and an R-linear rate for transported BFGS on possibly infinite-dimensional Riemannian manifolds, assuming that the transports are isometries (doi:10.1137/11082885X).
  • Later work by Huang, Gallivan and Absil (2015) relaxed the conditions on the transport (doi:10.1137/140955483).

Setting

Let M\mathcal MM be a smooth manifold modelled on a real Hilbert space EEE, with a Riemannian inner product gxg_xgx​ and norm ∥⋅∥x\|\cdot\|_x∥⋅∥x​ on each tangent space TxMT_x\mathcal MTx​M. For f:M→Rf:\mathcal M\to\mathbb Rf:M→R, Df(x)\mathrm Df(x)Df(x) is its differential, a functional on TxMT_x\mathcal MTx​M with dual norm ∥Df(x)∥x\|\mathrm Df(x)\|_x∥Df(x)∥x​.

A retraction is a family of smooth maps Rx:TxM→MR_x:T_x\mathcal M\to\mathcal MRx​:Tx​M→M with Rx(0)=xR_x(0)=xRx​(0)=x and DRx(0)=id\mathrm DR_x(0)=\mathrm{id}DRx​(0)=id. Write fRx=f∘Rxf_{R_x}=f\circ R_xfRx​​=f∘Rx​, a function on the vector space TxMT_x\mathcal MTx​M, with derivatives DfRx\mathrm Df_{R_x}DfRx​​ and D2fRx\mathrm D^2f_{R_x}D2fRx​​.

Algorithm 1 produces iterates xk+1=Rxk(αkpk)x_{k+1}=R_{x_k}(\alpha_kp_k)xk+1​=Rxk​​(αk​pk​). The step αk>0\alpha_k>0αk​>0 satisfies the Wolfe conditions with 0<c1<c2<10<c_1<c_2<10<c1​<c2​<1:

f(Rx(αp))≤f(x)+c1α Df(x)p,Df(Rx(αp)) DRx(αp) p ≥ c2 Df(x)p.f(R_x(\alpha p))\le f(x)+c_1\alpha\,\mathrm Df(x)p,\qquad \mathrm Df(R_x(\alpha p))\,\mathrm DR_x(\alpha p)\,p\ \ge\ c_2\,\mathrm Df(x)p.f(Rx​(αp))≤f(x)+c1​αDf(x)p,Df(Rx​(αp))DRx​(αp)p ≥ c2​Df(x)p.

The BFGS direction solves Bk(pk,⋅)=−Df(xk)B_k(p_k,\cdot)=-\mathrm Df(x_k)Bk​(pk​,⋅)=−Df(xk​) for a bounded bilinear form BkB_kBk​ on TxkMT_{x_k}\mathcal MTxk​​M. With sk=αkpks_k=\alpha_kp_ksk​=αk​pk​ and yk=DfRxk(sk)−DfRxk(0)y_k=\mathrm Df_{R_{x_k}}(s_k)-\mathrm Df_{R_{x_k}}(0)yk​=DfRxk​​​(sk​)−DfRxk​​​(0), the next form is defined on Txk+1MT_{x_{k+1}}\mathcal MTxk+1​​M through an invertible linear map Tk:TxkM→Txk+1MT_k:T_{x_k}\mathcal M\to T_{x_{k+1}}\mathcal MTk​:Txk​​M→Txk+1​​M:

Bk+1(Tkv,Tkw)=Bk(v,w)−Bk(sk,v)Bk(sk,w)Bk(sk,sk)+(ykv)(ykw)yksk.B_{k+1}(T_kv,T_kw)=B_k(v,w)-\frac{B_k(s_k,v)B_k(s_k,w)}{B_k(s_k,s_k)}+\frac{(y_kv)(y_kw)}{y_ks_k}.Bk+1​(Tk​v,Tk​w)=Bk​(v,w)−Bk​(sk​,sk​)Bk​(sk​,v)Bk​(sk​,w)​+yk​sk​(yk​v)(yk​w)​.

The analysis uses the angle cos⁡θk=Bk(sk,sk)/(∥sk∥ ∥Bk(sk,⋅)∥)\cos\theta_k=B_k(s_k,s_k)/(\|s_k\|\,\|B_k(s_k,\cdot)\|)cosθk​=Bk​(sk​,sk​)/(∥sk​∥∥Bk​(sk​,⋅)∥) and the Rayleigh quotient qk=Bk(sk,sk)/∥sk∥2q_k=B_k(s_k,s_k)/\|s_k\|^2qk​=Bk​(sk​,sk​)/∥sk​∥2.

Formalization targets

Goal: Proposition 10

Assume:

  • the TkT_kTk​ are isometries;
  • B0B_0B0​ is symmetric and coercive;
  • for 0<m<M0<m<M0<m<M and every kkk, the set Sk=Rxk−1({f≤f(x0)})S_k=R_{x_k}^{-1}(\{f\le f(x_0)\})Sk​=Rxk​−1​({f≤f(x0​)}) is convex and m∥v∥2≤D2fRxk(p)(v,v)≤M∥v∥2m\|v\|^2\le\mathrm D^2f_{R_{x_k}}(p)(v,v)\le M\|v\|^2m∥v∥2≤D2fRxk​​​(p)(v,v)≤M∥v∥2 for p∈Skp\in S_kp∈Sk​;
  • x∗x^*x∗ is a minimizer of fff that every RxkR_{x_k}Rxk​​ reaches.

Then there is 0<μ<10<\mu<10<μ<1 with

f(xk+1)−f(x∗)≤μk+1(f(x0)−f(x∗))∀k∈N.f(x_{k+1})-f(x^*)\le\mu^{k+1}\big(f(x_0)-f(x^*)\big)\qquad\forall k\in\mathbb N.f(xk+1​)−f(x∗)≤μk+1(f(x0​)−f(x∗))∀k∈N.

The rate μ\muμ is not specified: the goal asserts only R-linear convergence, the shape of the result.

Milestones, in proof order

  1. Lemma 9. If ∥Tk∥\|T_k\|∥Tk​∥ and ∥Tk−1∥\|T_k^{-1}\|∥Tk−1​∥ are uniformly bounded and B0B_0B0​ is (symmetric and) coercive, then yksk>0y_ks_k>0yk​sk​>0 and every BkB_kBk​ is coercive.
  2. Curvature-pair bounds. ∥yk∥2/(yksk)≤M\|y_k\|^2/(y_ks_k)\le M∥yk​∥2/(yk​sk​)≤M and yksk/∥sk∥2≥my_ks_k/\|s_k\|^2\ge myk​sk​/∥sk​∥2≥m.
  3. Good indices. For every 0<r<10<r<10<r<1 there are κ,ρ,σ>0\kappa,\rho,\sigma>0κ,ρ,σ>0 such that every kkk has at least ⌊r(k+1)⌋\lfloor r(k+1)\rfloor⌊r(k+1)⌋ indices i≤ki\le ki≤k with cos⁡θi≥κ\cos\theta_i\ge\kappacosθi​≥κ and ρ≤qi/cos⁡θi≤σ\rho\le q_i/\cos\theta_i\le\sigmaρ≤qi​/cosθi​≤σ.
  4. Step-length bound. αi≥1−c2Mqi\alpha_i\ge\frac{1-c_2}{M}q_iαi​≥M1−c2​​qi​.
  5. Gradient dominance. f(x)−f(x∗)≤∥Df(x)∥2/(2m)f(x)-f(x^*)\le\|\mathrm Df(x)\|^2/(2m)f(x)−f(x∗)≤∥Df(x)∥2/(2m) on the sublevel set.
  6. Rate display. Given milestone 3's constants,
f(xk+1)−f(x∗)≤(1−1−c2Mc1κ2ρσ2m)⌊r(k+1)⌋(f(x0)−f(x∗)).f(x_{k+1})-f(x^*)\le\Big(1-\tfrac{1-c_2}{M}c_1\tfrac{\kappa^2\rho}{\sigma}2m\Big)^{\lfloor r(k+1)\rfloor}\big(f(x_0)-f(x^*)\big).f(xk+1​)−f(x∗)≤(1−M1−c2​​c1​σκ2ρ​2m)⌊r(k+1)⌋(f(x0​)−f(x∗)).

Significance

The result. Proposition 10 is a global convergence guarantee for a quasi-Newton method on manifolds, with no restriction to a neighbourhood of the minimizer and no finite-dimensionality. It applies to Riemannian shape spaces of curves, where the paper's numerical experiments take place. The paper's superlinear-rate theory (Proposition 12, Corollary 13) starts from this linear rate.

Formalizing it. The result is proved on paper but has not been machine-checked. A formal proof also checks the delicate points of the infinite-dimensional argument, in particular the use of traces and Fredholm determinants of trace-class perturbations of the identity. The statement as printed needs a correction: the printed bound f(xk)−f(x∗)≤μk+1(f(x0)−f(x∗))f(x_k)-f(x^*)\le\mu^{k+1}(f(x_0)-f(x^*))f(xk​)−f(x∗)≤μk+1(f(x0​)−f(x∗)) fails at k=0k=0k=0, and the formal goal bounds f(xk+1)f(x_{k+1})f(xk+1​), as the appendix's own final display does.

Difficulty

The Euclidean proof idea of bounding the eigenvalues of BkB_kBk​ uniformly does not work for BFGS: those eigenvalues are not uniformly controlled. The Byrd–Nocedal argument replaces them by trace and determinant estimates, which show that a fixed fraction of the iterations have well-conditioned angles. In infinite dimensions the trace and the determinant of BkB_kBk​ do not exist. One must work with AkB^kAk−idA_k\hat B_kA_k-\mathrm{id}Ak​B^k​Ak​−id, which is trace class, and with the Fredholm determinant, and show that isometric transports leave these quantities invariant. That invariance is exactly where the isometry hypothesis enters. Lemma 9 is also not a finite-dimensional triviality: positive definiteness of Bk+1B_{k+1}Bk+1​ does not give coercivity, and a separate compactness-free argument is needed.

Formalization scope

The manifold is a Mathlib ChartedSpace E M, with EEE a complete real inner-product space, IsManifold 𝓘(ℝ, E) ∞ M, and a RiemannianBundle on TangentSpace 𝓘(ℝ, E). Every norm on a tangent space is the Riemannian one. Df(x)\mathrm Df(x)Df(x) is mfderiv, read as a functional on TxMT_x\mathcal MTx​M, and its norm is the operator norm.

Committed conventions and explicit readings:

  • One retraction family RRR for all kkk. The paper allows a different retraction per step.
  • Smoothness of RxR_xRx​ is stated for the map out of the model space EEE, which carries the topology of TxMT_x\mathcal MTx​M.
  • The run equation xk+1=Rxk(αkpk)x_{k+1}=R_{x_k}(\alpha_kp_k)xk+1​=Rxk​​(αk​pk​) is an explicit hypothesis: it is what identifies Txk+1MT_{x_{k+1}}\mathcal MTxk+1​​M with the tangent space at the new point. The BkB_kBk​ and TkT_kTk​ (as continuous linear equivalences) are data constrained by the update formula.
  • Regularity and non-termination: αk>0\alpha_k>0αk​>0, fff differentiable, fRxkf_{R_{x_k}}fRxk​​​ of class C2C^2C2, and Df(xk)≠0\mathrm Df(x_k)\neq0Df(xk​)=0 for all kkk. Only runs that never stop are covered.
  • Symmetry of B0B_0B0​ is assumed in Lemma 9 as well. The lemma's proof uses it, and without it the first update can lose coercivity.
  • Convexity of SkS_kSk​ is part of "uniformly convex on the sublevel set". Without it, a double-well function whose sublevel set has two strongly convex components is a counterexample.
  • Reachability of x∗x^*x∗ by every RxkR_{x_k}Rxk​​ is assumed, since the appendix uses Rxk−1(x∗)R_{x_k}^{-1}(x^*)Rxk​−1​(x∗).
  • Dropped assumptions: geodesic completeness, separability, the distance and the Levi-Civita connection are not used and are dropped.
  • Corrected index: the rate display and the goal bound f(xk+1)f(x_{k+1})f(xk+1​), because the decrease obtained at a good index iii improves xi+1x_{i+1}xi+1​.

A trivializing formalization is ruled out on three fronts. A sorry-free check on M=E=R\mathcal M=E=\mathbb RM=E=R, with Rx(v)=x+vR_x(v)=x+vRx​(v)=x+v, f(x)=x2/2f(x)=x^2/2f(x)=x2/2 and xk+1=0.4xkx_{k+1}=0.4x_kxk+1​=0.4xk​, shows that the run hypotheses are satisfiable. Every quotient in a statement has a positive denominator along such a run. The rate μ\muμ is quantified after the run and before kkk.

Infrastructure that a complete development needs, and that is reusable beyond this mission:

  • calculus of f∘Rxf\circ R_xf∘Rx​ on a tangent space with its Riemannian norm;
  • Taylor's formula with integral remainder;
  • trace-class operators and Fredholm determinants on Hilbert spaces, with Lidskii's theorem.

The last item is absent from Mathlib, and contributions toward it are welcome. The paper's other main result, convergence of Fletcher–Reeves conjugate gradients (Proposition 15), is a separate mission. The superlinear-rate results (Lemma 6, Propositions 5, 7, 8, 12, Corollaries 11, 13) and the numerical §4 are out of scope.

Selected references

  • W. Ring, B. Wirth, Optimization Methods on Riemannian Manifolds and Their Application to Shape Space, SIAM J. Optim. 22(2), 596–627, 2012. https://doi.org/10.1137/11082885X
  • P.-A. Absil, R. Mahony, R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008. https://doi.org/10.1515/9781400830244
  • D. Gabay, Minimizing a differentiable function over a differential manifold, J. Optim. Theory Appl. 37, 177–219, 1982. https://doi.org/10.1007/BF00934767
  • R. H. Byrd, J. Nocedal, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal. 26(3), 727–739, 1989. https://doi.org/10.1137/0726042
  • W. Huang, K. A. Gallivan, P.-A. Absil, A Broyden class of quasi-Newton methods for Riemannian optimization, SIAM J. Optim. 25(3), 1660–1685, 2015. https://doi.org/10.1137/140955483
8 thms1 active userReviewed
AnalysisOptimization·Captain: mikedeng1

Clarke Subgradients of Stratifiable Functions I: Every Clarke Subgradient of a Lower Semicontinuous Function with a Nonvertical Whitney-Stratified Graph Dominates the Stratum GradientResearch Paper

Motivation

First-order methods for nonsmooth, nonconvex optimization (proximal algorithms, alternating minimization, subgradient-type descent) are analysed through generalized derivatives. Convergence and complexity arguments need a lower bound on the size of those derivatives away from critical points. For the Clarke subdifferential of a general lower semicontinuous function no such bound is available: Clarke subgradients can be small, or even zero, at points where the function decreases steeply along a smooth piece of its domain.

Bolte, Daniilidis, Lewis and Shiota (SIAM J. Optim. 18(2), 2007) showed that the obstruction disappears for functions whose graph admits a Whitney stratification, a partition into smooth manifolds that fit together regularly. Semialgebraic functions, and more generally functions definable in an o-minimal structure, have such stratifications. For these functions every Clarke subgradient is at least as long as the gradient of the function along the stratum through the point. This projection formula is the step from the geometry of the graph to the nonsmooth Kurdyka–Łojasiewicz inequality of the same paper, which underlies the convergence theory of many splitting methods (Attouch–Bolte–Svaiter 2013; Bolte–Sabach–Teboulle 2014).

This mission covers §2–§3 of the paper: the definitions, the projection formula (Proposition 4) and its Corollary 5 (i). The Kurdyka–Łojasiewicz part (§4) is a separate mission of the same series.

Setting

Let f:Rn→R∪{+∞}f:\mathbb R^n\to\mathbb R\cup\{+\infty\}f:Rn→R∪{+∞} be lower semicontinuous, with domain dom⁡f={x:f(x)<+∞}\operatorname{dom} f=\{x: f(x)<+\infty\}domf={x:f(x)<+∞} and graph Graph⁡f={(x,f(x)):x∈dom⁡f}⊂Rn+1\operatorname{Graph} f=\{(x,f(x)):x\in\operatorname{dom} f\}\subset\mathbb R^{n+1}Graphf={(x,f(x)):x∈domf}⊂Rn+1.

  • A Fréchet subgradient of fff at x∈dom⁡fx\in\operatorname{dom} fx∈domf is a vector x∗x^*x∗ with lim inf⁡y→x, y≠x [f(y)−f(x)−⟨x∗,y−x⟩]/∥y−x∥≥0\liminf_{y\to x,\,y\ne x}\,[f(y)-f(x)-\langle x^*,y-x\rangle]/\|y-x\|\ge 0liminfy→x,y=x​[f(y)−f(x)−⟨x∗,y−x⟩]/∥y−x∥≥0; they form ∂^f(x)\hat\partial f(x)∂^f(x).
  • The limiting subdifferential ∂f(x)\partial f(x)∂f(x) consists of limits x∗=lim⁡xk∗x^*=\lim x_k^*x∗=limxk∗​ with xk∗∈∂^f(xk)x_k^*\in\hat\partial f(x_k)xk∗​∈∂^f(xk​), xk→xx_k\to xxk​→x and f(xk)→f(x)f(x_k)\to f(x)f(xk​)→f(x).
  • The singular limiting subdifferential ∂∞f(x)\partial^\infty f(x)∂∞f(x) consists of limits lim⁡tkyk∗\lim t_ky_k^*limtk​yk∗​ with yk∗∈∂^f(yk)y_k^*\in\hat\partial f(y_k)yk∗​∈∂^f(yk​), yk→xy_k\to xyk​→x, f(yk)→f(x)f(y_k)\to f(x)f(yk​)→f(x) and tk↘0+t_k\searrow 0^+tk​↘0+.
  • The Clarke subdifferential is ∂∘f(x)=co⁡‾ {∂f(x)+∂∞f(x)}\partial^\circ f(x)=\overline{\operatorname{co}}\,\{\partial f(x)+\partial^\infty f(x)\}∂∘f(x)=co{∂f(x)+∂∞f(x)} for x∈dom⁡fx\in\operatorname{dom} fx∈domf (closed convex hull) and ∅\emptyset∅ otherwise.

A CpC^pCp stratification (Xi)i∈I(X_i)_{i\in I}(Xi​)i∈I​ of a nonempty set XXX is a locally finite partition of XXX into CpC^pCp submanifolds (the strata) such that Xi‾∩Xj≠∅\overline{X_i}\cap X_j\ne\emptysetXi​​∩Xj​=∅ implies Xj⊂Xi‾∖XiX_j\subset\overline{X_i}\setminus X_iXj​⊂Xi​​∖Xi​ for i≠ji\ne ji=j. It has the Whitney-(a) property if, whenever xk∈Xix_k\in X_ixk​∈Xi​ converge to x∈Xjx\in X_jx∈Xj​ (i≠ji\ne ji=j) and the tangent spaces TxkXiT_{x_k}X_iTxk​​Xi​ converge to a subspace T\mathcal TT, then TxXj⊂TT_xX_j\subset\mathcal TTx​Xj​⊂T; subspaces converge in the gap D(V,W)=max⁡{sup⁡v∈V,∥v∥=1d(v,W),sup⁡w∈W,∥w∥=1d(w,V)}D(V,W)=\max\{\sup_{v\in V,\|v\|=1}d(v,W),\sup_{w\in W,\|w\|=1}d(w,V)\}D(V,W)=max{supv∈V,∥v∥=1​d(v,W),supw∈W,∥w∥=1​d(w,V)}. A Whitney stratification is a C1C^1C1 stratification with this property.

A stratification S=(Si)i∈I\mathcal S=(S_i)_{i\in I}S=(Si​)i∈I​ of Graph⁡f\operatorname{Graph} fGraphf is nonvertical if en+1=(0,…,0,1)∉TuSie_{n+1}=(0,\dots,0,1)\notin T_uS_ien+1​=(0,…,0,1)∈/Tu​Si​ for every iii and u∈Siu\in S_iu∈Si​ (condition (H)). Let Π:Rn+1→Rn\Pi:\mathbb R^{n+1}\to\mathbb R^nΠ:Rn+1→Rn drop the last coordinate. For x∈dom⁡fx\in\operatorname{dom} fx∈domf let SxS_xSx​ be the stratum containing (x,f(x))(x,f(x))(x,f(x)) and TxXx=Π(T(x,f(x))Sx)T_xX_x=\Pi(T_{(x,f(x))}S_x)Tx​Xx​=Π(T(x,f(x))​Sx​). Nonverticality makes the tangent space of SxS_xSx​ the graph of a linear form over TxXxT_xX_xTx​Xx​; the vector representing it is the stratum gradient ∇Rf(x)∈TxXx\nabla_R f(x)\in T_xX_x∇R​f(x)∈Tx​Xx​, characterized by (∇Rf(x),−1)⊥T(x,f(x))Sx(\nabla_R f(x),-1)\perp T_{(x,f(x))}S_x(∇R​f(x),−1)⊥T(x,f(x))​Sx​.

Formalization targets

Goal: Corollary 5 (i), p. 563

For lower semicontinuous fff whose graph admits a nonvertical Whitney stratification, and every x∈dom⁡fx\in\operatorname{dom} fx∈domf,

∥∇Rf(x)∥≤∥x∗∥for all x∗∈∂∘f(x).\|\nabla_R f(x)\|\le\|x^*\|\qquad\text{for all }x^*\in\partial^\circ f(x).∥∇R​f(x)∥≤∥x∗∥for all x∗∈∂∘f(x).

Projection formula: Proposition 4, p. 561

Proj⁡TxXx∂f(x)⊂{∇Rf(x)},Proj⁡TxXx∂∞f(x)={0},(9)\operatorname{Proj}_{T_xX_x}\partial f(x)\subset\{\nabla_R f(x)\},\qquad\operatorname{Proj}_{T_xX_x}\partial^\infty f(x)=\{0\},\tag{9}ProjTx​Xx​​∂f(x)⊂{∇R​f(x)},ProjTx​Xx​​∂∞f(x)={0},(9) Proj⁡TxXx∂∘f(x)⊂{∇Rf(x)}.(10)\operatorname{Proj}_{T_xX_x}\partial^\circ f(x)\subset\{\nabla_R f(x)\}.\tag{10}ProjTx​Xx​​∂∘f(x)⊂{∇R​f(x)}.(10)

Milestones from the proof (pp. 559 and 562)

  • (11): Proj⁡TxXx∂^f(x)⊂{∇Rf(x)}\operatorname{Proj}_{T_xX_x}\hat\partial f(x)\subset\{\nabla_R f(x)\}ProjTx​Xx​​∂^f(x)⊂{∇R​f(x)}.
  • (12): Proj⁡TxXx∂f(x)⊂{∇Rf(x)}\operatorname{Proj}_{T_xX_x}\partial f(x)\subset\{\nabla_R f(x)\}ProjTx​Xx​​∂f(x)⊂{∇R​f(x)} and Proj⁡TxXx∂∞f(x)⊂{0}\operatorname{Proj}_{T_xX_x}\partial^\infty f(x)\subset\{0\}ProjTx​Xx​​∂∞f(x)⊂{0}.
  • Remark 2 (ii): 0∈∂∞f(x)0\in\partial^\infty f(x)0∈∂∞f(x) for every x∈dom⁡fx\in\operatorname{dom} fx∈domf.

Further items state that the stratum gradient exists and is unique under (H), the equality Proj⁡TxXx∂∘f(x)={∇Rf(x)}\operatorname{Proj}_{T_xX_x}\partial^\circ f(x)=\{\nabla_R f(x)\}ProjTx​Xx​​∂∘f(x)={∇R​f(x)} when ∂∘f(x)≠∅\partial^\circ f(x)\neq\emptyset∂∘f(x)=∅ (Remark 4), the chain ∂^f⊂∂f⊂∂∘f\hat\partial f\subset\partial f\subset\partial^\circ f∂^f⊂∂f⊂∂∘f of (7), nonverticality for locally Lipschitz functions (Remark 3), and the nonsmooth Morse–Sard theorem of Corollary 5 (ii).

Significance

The inequality (14) says that Clarke critical points of a stratifiable function are critical points of its restriction to a stratum, and that the Clarke subdifferential is never shorter than the smooth gradient along the stratum. Two consequences are drawn in the paper. With countably many strata and the classical Morse–Sard theorem it gives a nonsmooth Morse–Sard theorem: the set of Clarke critical values has measure zero (Corollary 5 (ii)). Combined with the o-minimal Łojasiewicz inequality for the restrictions f∣Xif|_{X_i}f∣Xi​​ it gives the nonsmooth Kurdyka–Łojasiewicz inequality for definable lower semicontinuous functions (§4), the hypothesis behind global convergence results for proximal and splitting algorithms on semialgebraic problems.

All results of this mission are proved in the paper. None has a machine-checked proof that we know of: Mathlib has the tangent cone, Fréchet differentiability and orthogonal projections, but no stratifications, no singular or Clarke subdifferential of an extended-valued function, and no projection formula. The work is to formalize the paper's proof, which reduces the projection formula to the behaviour of Fréchet normals under limits of tangent spaces.

Difficulty

The first step, (11), is local and smooth: along a C1C^1C1 curve in the stratum the function is differentiable, and a Fréchet subgradient must agree with the derivative in tangent directions. The difficulty is the passage to limits in (12). A limiting subgradient at xxx is a limit of Fréchet subgradients at points xkx_kxk​ which may lie in a different, higher-dimensional stratum SiS_iSi​; nothing in the smooth argument relates TxkXiT_{x_k}X_iTxk​​Xi​ to TxXxT_xX_xTx​Xx​. The relation is supplied exactly by the Whitney-(a) property, together with the compactness of the Grassmannian and the local finiteness of the stratification. Without Whitney-(a) the inclusions fail, so a proof that never uses it is wrong. The singular part requires the same argument for rescaled subgradients tkyk∗t_ky_k^*tk​yk∗​, whose normals (tkyk∗,−tk)(t_ky_k^*,-t_k)(tk​yk∗​,−tk​) become horizontal in the limit.

Formalization scope

Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n), Rn+1\mathbb R^{n+1}Rn+1 is EuclideanSpace ℝ (Fin (n+1)) with the function value as the last coordinate, and R∪{+∞}\mathbb R\cup\{+\infty\}R∪{+∞} is EReal with fff never −∞-\infty−∞. The Fréchet and limiting subdifferentials are the published NonconvexSplitting.Shared.IsRegularSubgrad and LimitingSubdiff; the tangent space TuMT_uMTu​M (span of the tangent cone) and CpC^pCp submanifolds (coordinate slices of some dimension) are the published ProjLikeRetr.Retractor definitions. The closed convex hull in (6) is closedConvexHull, not convexHull. Strata may be empty; local finiteness is required at points of the stratified set; a gap supremum over an empty unit sphere is 000. The stratification hypothesis is taken of class C1C^1C1, the weakest case of the paper's "CpC^pCp-Whitney".

The stratum gradient is defined intrinsically: g∈Π(TuS)g\in\Pi(T_uS)g∈Π(Tu​S) with (g,−1)⊥TuS(g,-1)\perp T_uS(g,−1)⊥Tu​S. It is not defined as a derivative of fff along the whole projected set Π(Si)\Pi(S_i)Π(Si​). That set can fail to be a submanifold for a discontinuous lower semicontinuous fff, and every statement would then hold vacuously at such points. A companion item proves existence and uniqueness of the stratum gradient under (H), so the goal is not vacuous. The goal quantifies over all elements of ∂∘f(x)\partial^\circ f(x)∂∘f(x); this set may be empty (Remark 4), which is the page's restriction to x∈dom⁡∂∘fx\in\operatorname{dom}\partial^\circ fx∈dom∂∘f, and no real-valued distance to ∂∘f(x)\partial^\circ f(x)∂∘f(x) is used.

A complete development needs the tangent space of a C1C^1C1 submanifold as the image of the chart derivative, convergence of subspaces and compactness of the Grassmannian of Rn+1\mathbb R^{n+1}Rn+1, Fréchet normals to epigraphs, and the density of dom⁡∂^f\operatorname{dom}\hat\partial fdom∂^f in dom⁡f\operatorname{dom} fdomf for lower semicontinuous fff. These pieces are reusable beyond this mission; the subspace gap and Whitney stratifications are prerequisites of the §4 mission. Contributions of any of the listed lemmas are welcome, as are proofs of the companion items.

Selected references

  • J. Bolte, A. Daniilidis, A. Lewis, M. Shiota, Clarke subgradients of stratifiable functions, SIAM J. Optim. 18(2):556–572, 2007. https://doi.org/10.1137/060670080
  • R. T. Rockafellar, R. J.-B. Wets, Variational Analysis, Grundlehren 317, Springer, 1998. https://doi.org/10.1007/978-3-642-02431-3
  • L. van den Dries, C. Miller, Geometric categories and o-minimal structures, Duke Math. J. 84(2):497–540, 1996. https://doi.org/10.1215/S0012-7094-96-08416-1
  • H. Attouch, J. Bolte, B. F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems, Math. Program. 137:91–129, 2013. https://doi.org/10.1007/s10107-011-0484-9
  • J. Bolte, S. Sabach, M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Math. Program. 146:459–494, 2014. https://doi.org/10.1007/s10107-013-0701-9
11 thms1 active userReviewed
Analysis·Captain: marwahaha

A negatively pinched Kähler threefold without bounded holomorphic coordinatesOpen Problem

Motivation

Negative curvature suggests strong analytic control, but bounded holomorphic coordinates impose a different global condition. The target constructs a complex threefold separating them. The pinned manuscript supplies the research context.

Setting

The construction uses the encoded Hartogs domain and a complete Kähler metric with sectional curvature between two negative constants. Holomorphic coordinate obstructions are stated in the published main proposition.

Formalization target

The selected goal is OAI.PinchedHartogs.main_theorem. Its central assertion is

−C≤Kg≤−c<0.-C\leq K_g\leq-c<0.−C≤Kg​≤−c<0.

The theorem states that there exist a subset M of ℂ³ (realized as ℂ² × ℂ) and a matrix-valued function g assigning a 3×3 complex matrix to each point, together with real numbers A and B, such that M is open, nonempty and contractible, and g is a Kähler metric on M, meaning g is C^∞ on M, Hermitian at each point (g_ij = conj(g_ji)), positive definite (the Hermitian form of g at u has positive real part for every nonzero u), and satisfies the closedness condition ∂g_kj/∂z_i = ∂g_ij/∂z_k, with ∂ the Wirtinger derivative (1/2)(∂_x − i∂_y). Moreover the metric is geodesically complete on M: for every point p in M and every vector v there is a C^∞ curve γ: ℝ → M with γ(0)=p, γ'(0)=v that satisfies the geodesic equation γ''k + Σ Γ^k{ac} γ'_a γ'_c = 0 for all t, where the Christoffel symbols are built from the inverse of g and the ∂ derivatives of g. The metric is also negatively pinched: 0 < A ≤ B and, for every point of M and every real-linearly independent pair u, v, the sectional curvature, computed from the explicit curvature tensor formula in the source, lies between −B and −A. In addition, M has no bounded coordinates: there is no map F from ℂ³ to ℂ³, holomorphic on a neighbourhood of every point of M and bounded in every component on M, whose complex Jacobian determinant is nonzero at every point of M. Finally, M is not biholomorphic to a bounded domain, that is, there is no bounded open set N with holomorphic maps F on M and G on N, each analytic near the respective set, mapping M into N and N into M, which are mutually inverse.

Significance and status

The selected main theorem requires a nonempty open contractible domain, a geodesically complete Kähler metric with two-sided negative real-sectional pinching, no bounded holomorphic map to complex three-space with everywhere-nonsingular differential, and no biholomorphism to a bounded domain. The controlled potential and metric-transfer statements are attached as supporting milestones. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

Metric completeness and two-sided negative curvature must coexist with a global obstruction to bounded holomorphic coordinates.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

Additional published targets are included as separate references:

  • OAI.PinchedHartogs.controlled_potential (Open).
  • OAI.PinchedHartogs.metric_transfer (Open).

Selected references

  • OpenAI, A negatively pinched Kähler threefold without bounded holomorphic coordinates, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
4 thms1 active userReviewed
Partial Differential Equations·Captain: marwahaha

The affine Bernstein theorem in dimensions three through nineOpen Problem

Motivation

Affine maximal graphs satisfy a nonlinear fourth-order geometric equation. The target asks whether completeness forces such a locally uniformly convex graph to be a paraboloid. The pinned manuscript supplies the research context.

Setting

The dimension is between three and nine. The domain is nonempty, open and convex, the function is smooth with positive-definite Hessian, and completeness uses intrinsic Euclidean graph length.

Formalization target

The selected goal is OAI.AffineBernstein.affine_bernstein. Its central assertion is

Ω=Rn,u(x)=12xTAx+b⋅x+c,A>0.\Omega=\mathbb R^n,\qquad u(x)=\tfrac12x^TAx+b\cdot x+c,\quad A>0.Ω=Rn,u(x)=21​xTAx+b⋅x+c,A>0.

The theorem states that, for every integer dimension 3 ≤ n ≤ 9, a nonempty open convex set Ω ⊆ ℝⁿ and a function u : ℝⁿ → ℝ that is smooth on Ω satisfy the following conclusion under three hypotheses. First, the Hessian H = D²u is positive definite at every point of Ω. Second, u satisfies the affine maximal equation ∑ᵢⱼ Uᵢⱼ ∂ᵢ∂ⱼw = 0 throughout Ω, where U = (det H)H⁻¹ and w = (det H)^{−(n+1)/(n+2)}. Third, the graph is complete for its intrinsic Euclidean path distance: the distance between x and y in Ω is the infimum over C¹ paths γ in Ω joining them of ∫₀¹ √(‖γ′(t)‖² + (Du(γ(t))γ′(t))²) dt, and every Cauchy sequence for this distance has a limit in Ω for the same distance. Then Ω = ℝⁿ and there exist a symmetric positive definite real n × n matrix A, a vector b ∈ ℝⁿ, and c ∈ ℝ such that u(x) = ½xᵀAx + b·x + c for every x ∈ ℝⁿ. Moreover, an invertible affine map of ℝⁿ × ℝ carries the standard paraboloid {(x, ‖x‖²)} onto the graph {(x, u(x)) : x ∈ Ω}.

Significance and status

The goal also gives an invertible affine map from the standard paraboloid to the graph. The wider immersed-hypersurface formulation is not included as a separate target. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The domain is not initially assumed to be all of space. Both global domain exhaustion and the quadratic form must follow from the equation and completeness.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, The affine Bernstein theorem in dimensions three through nine, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Partial Differential Equations·Captain: marwahaha

Power-law violations of Yau's nodal upper boundOpen Problem

Motivation

Nodal sets are the zero loci of Laplace eigenfunctions. Their size probes how geometry constrains high-frequency oscillation. The pinned manuscript supplies the research context.

Setting

The encoded manifold is S4×S1 with one smooth Riemannian metric. The sequence consists of nonzero smooth real eigenfunctions with positive eigenvalues tending to infinity.

Formalization target

The selected goal is OAI.Yau.Target.yau_nodal_set_upper_bound_counterexample. Its central assertion is

Hg4({uk=0})λk⟶+∞.\frac{\mathcal H_g^4(\{u_k=0\})}{\sqrt{\lambda_k}}\longrightarrow+\infty.λk​​Hg4​({uk​=0})​⟶+∞.

The theorem states that the defined proposition MainTarget holds, i.e. that there exist a smooth Riemannian metric g on the 5-manifold S⁴ × S¹ (the unit sphere in ℝ⁵ times the circle, modelled on ℝ⁴ × ℝ¹), a sequence of positive reals λₖ, and a sequence of smooth real functions uₖ on this manifold, each not identically zero, such that the following hold. At every point x, in the extended chart at x, the coordinate Laplacian of uₖ, namely (1/√det G) Σᵢ ∂ᵢ(√det G Σⱼ Gⁱʲ ∂ⱼ(uₖ∘chart⁻¹)), where G is the matrix of g in the chart's coordinate frame and Gⁱʲ its inverse, satisfies −Δ_g uₖ(x) = λₖ uₖ(x), so each uₖ is a Laplace eigenfunction with eigenvalue λₖ. Moreover λₖ → ∞, and the 4-dimensional Hausdorff measure (taken with respect to the distance induced by g) of the nodal set {uₖ = 0}, divided by √λₖ, tends to +∞ as k → ∞. Thus the nodal-set size grows faster than the order √λₖ, which is a counterexample to a Yau-type upper bound on nodal sets in this setting. The theorem is admitted in the source and not proved there.

Significance and status

The selected target is divergence relative to the square-root eigenvalue scale. It does not specify the fixed additional power ε0 asserted by the manuscript title and abstract. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The same smooth metric must support the whole eigenfunction sequence, and the nodal measure uses the distance induced by that metric.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Power-law violations of Yau's nodal upper bound, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Symplectic Geometry·Captain: marwahaha

Taming implies compatibility on four-manifoldsOpen Problem

Motivation

A symplectic form can be positive on complex lines without being invariant under the almost complex structure. The target asks whether some compatible form nevertheless exists in four dimensions. The pinned manuscript supplies the research context.

Setting

The manifold is smooth, compact, connected, Hausdorff and second countable, modeled on real four-space. The almost complex structure squares to minus the identity.

Formalization target

The selected goal is OAI.TamingCompatibility.taming_implies_compatibility. Its central assertion is

(∃α symplectic: α(v,Jv)>0 ∀v≠0) ⟹ (∃η symplectic: η(v,Jv)>0 ∀v≠0, η(Ju,Jv)=η(u,v) ∀u,v).(\exists\alpha\text{ symplectic}:\ \alpha(v,Jv)>0\ \forall v\ne0)\ \Longrightarrow\ (\exists\eta\text{ symplectic}:\ \eta(v,Jv)>0\ \forall v\ne0,\ \eta(Ju,Jv)=\eta(u,v)\ \forall u,v).(∃α symplectic: α(v,Jv)>0 ∀v=0) ⟹ (∃η symplectic: η(v,Jv)>0 ∀v=0, η(Ju,Jv)=η(u,v) ∀u,v).

The theorem states that, for a smooth manifold X modeled on four-dimensional Euclidean space ℝ⁴ (charted with smooth transition maps) that is Hausdorff, second countable, compact and connected, and for an almost complex structure J on X, if some symplectic two-form α tames J, then there exists a symplectic two-form η that is compatible with J. Here a two-form assigns to each point x a continuous alternating real bilinear form on the tangent space at x, and an almost complex structure J is a smooth field of continuous linear endomorphisms of the tangent spaces with J(Jv) = −v for every tangent vector v. A two-form is symplectic when it is smooth (its pullbacks along smooth maps from open subsets of ℝ⁴ are smooth), closed (the exterior derivative of each such pullback vanishes), and nondegenerate (a tangent vector v with α(v,w) = 0 for all w must be zero). The form α tames J when α(v, Jv) > 0 for every nonzero tangent vector v at every point. The form η is compatible with J when it tames J and is J-invariant, meaning η(Ju, Jv) = η(u, v) for all tangent vectors u and v at every point. This is a formal statement admitted without proof.

Significance and status

The conclusion supplies a possibly different symplectic form. It does not assert that the original taming form is compatible or prescribe its cohomology class. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

A pointwise compatibility adjustment need not preserve closedness. The conclusion requires both global symplectic structure and positivity.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Taming implies compatibility on four-manifolds, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Mathematical Physics·Captain: marwahaha

Area-controlled end replacement and the Bondi Penrose inequality in the CKS classOpen Problem

Motivation

Replacing a hyperboloidal end by an asymptotically flat end can connect Bondi mass with ADM mass. The source seeks a replacement that preserves interior geometry, the energy condition, and almost all enclosing area. The source is OpenAI's September 2026 manuscript.

Setting

A CKS exterior datum describes a three-dimensional hyperboloidal end and its mass aspect. Its Bondi charge is energy-momentum (E,P)(E,P)(E,P), assumed strictly future timelike. An enclosing cut is a surface in the supplied geometric class; its area is computed from the metric.

Formalization targets

gR≥(1−ε(R))g,ε(R)→0,mADM(gR)=E2−∣P∣2+ηR,0≤ηR≤2R−1/2.g_R\ge(1-\varepsilon(R))g,\quad\varepsilon(R)\to0,\quad m_{\mathrm{ADM}}(g_R)=\sqrt{E^2-|P|^2}+\eta_R,\quad0\le\eta_R\le2R^{-1/2}.gR​≥(1−ε(R))g,ε(R)→0,mADM​(gR​)=E2−∣P∣2​+ηR​,0≤ηR​≤2R−1/2.

For a connected, Hausdorff, second countable smooth 3-manifold N with boundary and a smooth Riemannian metric g with a smooth symmetric tensor field K, such that N is orientable, the boundary is compact and nonempty, g is complete, and (g,K) satisfies the pointwise local-chart physical dominant energy condition PhysicalDEC, the following holds. Suppose d is a CKS exterior-end datum for (g,K): a coordinate end outside radius d.chart.radius in which g and K are represented by smooth perturbations, together with a smooth mass aspect function on the sphere and the tensor patches realizing it. If the Bondi charge (energy, momentum) of d's mass aspect, (E,P), is timelike, meaning |P|<E, then there exist another such datum d', a radius R₀ with d'.chart.radius<R₀ and 12≤R₀, and a function ε with ε(R)→0 as R→∞, such that d' has Bondi charge (√(E²−|P|²),0), and the minimal enclosing area of g is finite. Moreover, for every R≥R₀ one has 0≤ε(R)<1 and there are a complete smooth metric gR, a smooth symmetric tensor field kR, spatial tensor fields G and k on Euclidean 3-space, and a number η with these properties. The pair (gR,kR) agrees with (g,K) at every point outside the chart domain or with chart coordinate norm at most R, and satisfies PhysicalDEC and integrable constraints. Also gR≥(1−ε(R))g as quadratic forms. On the end, gR and kR equal the end metrics built from G and k in d'.chart. Each Cartesian component of G minus the identity satisfies the order-1 Symbol condition from CKSADM, and k vanishes where ‖x‖>2R². As r→∞ the spatial ADM energy of G tends to √(E²−|P|²)+η and the ADM momentum of (G,k) tends to 0, with 0≤η≤2R^(−1/2). Finally, gR has finite minimal enclosing area, (1−ε(R)) times the minimum enclosing area of g is at most that of gR, and for every outer domain D the cut areas of g and gR are finite and satisfy (1−ε(R))·cutArea(g,D)≤cutArea(gR,D).

The goal is OAI.CKSSourceExterior.area_controlled_end_replacement. Supporting targets are listed below; they retain their individual hypotheses and are separate statements.

  • schwarzschild equality examples.

Significance

The selected goal constructs end replacements with zero limiting ADM momentum and quantitative area comparison, including minimum enclosing area. The Schwarzschild equality examples are attached as a separate target. 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

Changing the end can create a cheaper enclosing surface or violate the dominant energy condition. Agreement on each retained interior region does not alone prevent either problem.

Formalization scope

The manifold is a connected Hausdorff second-countable smooth three-manifold with compact nonempty boundary, and the original complete data satisfy the physical dominant energy condition. The main target is end replacement; it does not itself state the final Bondi–Penrose inequality. The equality-example target keeps its stronger boundary and no-additional-horizon hypotheses.

The shared definitions are supplied by CKSBondiPenrose, CKSBondiPenrose_002. 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, Area-controlled end replacement and the Bondi Penrose inequality in the CKS class, preprint, September 2026. Manuscript.
  • OpenAI, accompanying Lean statement. Pinned source.
4 thms1 active userReviewed
PreviousPage 1 of 2Next

Get started

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

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me