Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

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

Geometry & Topology

34 missions · 14 completed

Missions

Open20Completed14All34
🏆Completed
Differential Geometry·Captain: Lucas

Differential Geometry of Curves and Surfaces III: Global Properties of Plane CurvesTextbook

Motivation

The local theory of curves describes what happens near one point; the global theory asks what a curve must satisfy because it closes up. Two classical statements make the difference visible. The isoperimetric inequality says that among all simple closed plane curves of a given length, the circle encloses the largest area — a question already settled in intent by the Greeks, but given a satisfactory proof only in the nineteenth century, and the short proof reproduced by do Carmo is E. Schmidt's from 1939. The four-vertex theorem says that the curvature of a simple closed convex curve has at least four critical points, so no convex oval has the curvature profile of a curve that just rises and falls once.

The reference for this mission is Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition (Dover, 2016), §1-7, "Global Properties of Plane Curves" (pp. 31–46): the area formula, equation (1) on p. 33; the isoperimetric inequality, Theorem 1 on p. 34; the theorem of turning tangents on p. 37; the lemma, equation (5) on p. 38; and the four-vertex theorem, Theorem 2 on p. 37.

This is the third mission of a series formalizing do Carmo's book, and shares the namespace DoCarmoDG with the earlier ones.

Setting

A closed plane curve of length lll is a regular map α:[0,l]→R2\alpha : [0,l] \to \mathbb{R}^2α:[0,l]→R2 whose derivatives of all orders agree at the two endpoints; equivalently, and as used here, a smooth lll-periodic map α:R→R2\alpha : \mathbb{R} \to \mathbb{R}^2α:R→R2. It is parametrized by arc length when ∣α′(s)∣=1|\alpha'(s)| = 1∣α′(s)∣=1 for all sss, in which case lll is its length. It is simple when it has no self-intersection: α(t1)≠α(t2)\alpha(t_1) \neq \alpha(t_2)α(t1​)=α(t2​) for distinct t1,t2∈[0,l)t_1, t_2 \in [0,l)t1​,t2​∈[0,l).

Write JJJ for rotation by +π/2+\pi/2+π/2, J(a,b)=(−b,a)J(a,b) = (-b,a)J(a,b)=(−b,a). For a curve parametrized by arc length the signed curvature is

k(s)=⟨α′′(s), Jα′(s)⟩,k(s) = \bigl\langle \alpha''(s),\, J\alpha'(s) \bigr\rangle,k(s)=⟨α′′(s),Jα′(s)⟩,

which is do Carmo's convention of §1-5, Remark 1: the normal is chosen so that {α′,Jα′}\{\alpha', J\alpha'\}{α′,Jα′} has the orientation of the natural basis, and then α′′=k Jα′\alpha'' = k\,J\alpha'α′′=kJα′. A vertex is a parameter ttt with k′(t)=0k'(t) = 0k′(t)=0. The curve is convex when, for every parameter ttt, the whole trace lies in one of the two closed half-planes bounded by the tangent line at ttt.

An angle function for α\alphaα is a smooth θ\thetaθ with α′(s)=(cos⁡θ(s),sin⁡θ(s))\alpha'(s) = (\cos\theta(s), \sin\theta(s))α′(s)=(cosθ(s),sinθ(s)); the rotation index is (θ(l)−θ(0))/2π(\theta(l) - \theta(0))/2\pi(θ(l)−θ(0))/2π. The area bounded by a positively oriented simple closed curve is given by do Carmo's equation (1),

A=12∫0l(x y′−y x′) dt,α=(x,y).A = \frac{1}{2}\int_0^l \bigl(x\,y' - y\,x'\bigr)\,dt, \qquad \alpha = (x,y).A=21​∫0l​(xy′−yx′)dt,α=(x,y).

Formalization targets

Goal — Four-vertex theorem (do Carmo, Theorem 2, p. 37)

α simple closed convex⟹#{ t∈[0,l):k′(t)=0 }≥4.\alpha \ \text{simple closed convex} \quad \Longrightarrow \quad \#\{\,t \in [0,l) : k'(t) = 0\,\} \ge 4 .α simple closed convex⟹#{t∈[0,l):k′(t)=0}≥4.

Supporting statements

The three equivalent forms of the area formula (1); the existence of a smooth angle function; the identity k=θ′k = \theta'k=θ′; the theorem of turning tangents (the rotation index of a simple closed curve is ±1\pm 1±1); the isoperimetric inequality l2≥4πAl^2 \ge 4\pi Al2≥4πA with equality exactly for circles; and do Carmo's lemma (5), ∫0l(Ax+By+C) k′(s) ds=0\int_0^l (Ax + By + C)\,k'(s)\,ds = 0∫0l​(Ax+By+C)k′(s)ds=0, which drives the proof of the goal.

Significance

The isoperimetric inequality is the ancestor of a large family of geometric inequalities, and its sharp case characterizes the circle — the first instance of the pattern "extremal configuration is the round one" that recurs throughout geometry. The four-vertex theorem is a genuinely global statement with no local counterpart: locally, the curvature of a convex arc may be strictly monotone, and it is only the requirement that the curve close up convexly that forces four critical points. Its converse, for strictly positive curvature, was proved by H. Gluck in 1971; do Carmo notes that the theorem also holds for simple closed curves that are not convex, by a harder argument.

Mathlib contains integration, the winding number of a loop in the complex plane and the Jordan curve theorem, but it does not contain the signed curvature of a plane curve, the theorem of turning tangents in this form, the isoperimetric inequality for curves with its equality case, or the four-vertex theorem. What this mission adds is that vocabulary and machine-checked proofs of the four classical statements.

Difficulty

Each target fails for a different reason under the naive approach.

For the area formula, the identification of 12∮(x dy−y dx)\frac12\oint(x\,dy - y\,dx)21​∮(xdy−ydx) with the area of the interior is exactly the Jordan-curve input that do Carmo declares he is assuming; the formalization avoids that dependency by defining the bounded area through the integral, so a solver has to prove only the integration-by-parts identities among the three forms of (1).

For the theorem of turning tangents, the difficulty is that a smooth lift θ\thetaθ of the tangent indicatrix must be produced and then shown to increase by exactly ±2π\pm 2\pi±2π over one period — a degree-theoretic statement about a loop in the circle, where simplicity of the curve is what excludes the values 0,±2,±3,…0, \pm 2, \pm 3, \dots0,±2,±3,….

For the isoperimetric inequality, Schmidt's proof compares the curve with a circle tangent to two parallel supporting lines and uses the arithmetic–geometric mean inequality; the equality discussion, which is where the characterization of the circle lives, is the delicate part.

For the four-vertex theorem, the obvious argument — "curvature on a compact interval attains a maximum and a minimum, so there are two vertices" — gives only two, and the whole content is the step from two to four. The lemma (5) supplies the contradiction: if k′k'k′ changed sign only at the maximum and the minimum, a suitable line Ax+By+C=0Ax + By + C = 0Ax+By+C=0 through those two points would make the integrand of (5) of one sign and not identically zero.

Formalization scope

Curves are smooth maps ℝ → EuclideanSpace ℝ (Fin 2), closedness being lll-periodicity with l>0l > 0l>0, which is do Carmo's condition that the curve and all its derivatives agree at the endpoints. Unit speed is imposed globally, so the parameter is arc length and lll is the length. Simplicity is injectivity on the half-open period [0,l)[0,l)[0,l). Convexity is stated per parameter: for each ttt the trace lies in one closed half-plane of the tangent line at ttt, the choice of side being allowed to depend on ttt, as in the book's phrasing.

The area is defined by do Carmo's integral (1) rather than as the measure of the interior of the curve, so no Jordan curve theorem is presupposed; consequently the isoperimetric statement is formulated with the absolute value ∣A∣|A|∣A∣, which makes it independent of the curve's orientation and equal to the enclosed area for a positively oriented simple curve. The equality case asserts that the trace lies on a circle of positive radius.

"At least four vertices" is formalized as the existence of four pairwise distinct parameters in [0,l)[0,l)[0,l) at which k′k'k′ vanishes, which rules out the degenerate reading in which one vertex is counted several times.

Selected references

  • Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition, Dover, 2016, §1-7 (area formula, eq. (1), p. 33; isoperimetric inequality, Theorem 1, p. 34; theorem of turning tangents, p. 37; lemma, eq. (5), p. 38; four-vertex theorem, Theorem 2, p. 37).
  • E. Schmidt, Über das isoperimetrische Problem im Raum von n Dimensionen, Mathematische Zeitschrift 44 (1939), 689–788.
  • H. Gluck, The converse to the four-vertex theorem, L'Enseignement Mathématique 17 (1971), 295–309.
8 thms4 active usersReviewed
🏆Completed
Group Theory·Captain: marwahaha

A torsion-free hyperbolic group that is not residually finiteOpen Problem

Motivation

Residual finiteness means that finite quotients can distinguish every nonidentity group element. The source asks whether coarse negative curvature forces this separation property even without torsion. The source is OpenAI's September 2026 manuscript.

Setting

A torsion-free group has no nonidentity element whose positive power is the identity. A word-hyperbolic group admits a finite generating set whose Cayley graph has geodesic triangles of uniformly bounded thickness.

Formalization targets

∃G:G torsion-free and word-hyperbolic,¬ResiduallyFinite⁡(G).\exists G:\quad G\text{ torsion-free and word-hyperbolic},\qquad\neg\operatorname{ResiduallyFinite}(G).∃G:G torsion-free and word-hyperbolic,¬ResiduallyFinite(G).

The theorem states, without a verified proof (it is admitted), that there exists a group G, in the lowest universe Type, that is torsion-free, word-hyperbolic, and not residually finite. Torsion-free means that for every g in G and every positive integer n, g^n = 1 implies g = 1, so no nonidentity element has finite order (this does not assert unique roots). Word-hyperbolic means that there is a finite subset S of G whose unit-edge Cayley graph (the simple graph with the multiplicative Cayley adjacency determined by S) is connected, which says that S generates G, and a natural number δ such that geodesic triangles are uniformly δ-thin. Precisely, for all vertices x, y, z and walks p from x to y, q from y to z and r from z to x, each of which is a geodesic (its length equals the graph distance between its endpoints), every vertex of each side lies within graph distance δ of some vertex on one of the other two sides. The statement also requires that G fail the Mathlib property Group.ResiduallyFinite.

The goal is OAI.Release075.main.

Significance

The goal puts a geometric condition and failure of finite-quotient separation into one existential statement. Torsion-freeness is retained explicitly. 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

Hyperbolicity concerns large-scale word geometry, whereas residual finiteness quantifies over every finite quotient. Checking a finite list of quotients cannot establish the required failure.

Formalization scope

Hyperbolicity is encoded by vertexwise thin triangles in a connected unit-edge Cayley graph for some finite generating set. Torsion-freeness is the positive-power condition and does not mean a unique-roots property. Residual finiteness uses the Mathlib definition.

The shared definitions are supplied by TorsionFreeHyperbolic. 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, A torsion-free hyperbolic group that is not residually finite, preprint, September 2026. Manuscript.
  • OpenAI, accompanying Lean statement. Pinned source.
39 thms3 active usersReviewed
🏆Completed
Differential Geometry·Captain: Lucas

Differential Geometry of Curves and Surfaces IV: Regular Surfaces and Change of ParametersTextbook

Motivation

Before any geometry of surfaces can be done, one has to say what a surface is, in a way that supports calculus: a subset of R3\mathbb{R}^3R3 that is locally the smooth, non-degenerate image of an open piece of the plane. Every statement in the later theory — the first and second fundamental forms, the Gauss map, curvature, geodesics — is written in local coordinates, and is therefore meaningful only once one knows that the answer does not depend on the coordinates chosen. That independence is the content of the change-of-parameters theorem, which is what makes "differentiable function on a surface" and "geometric quantity of a surface" well-defined notions.

The reference for this mission is Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition (Dover, 2016), §2-2 "Regular Surfaces; Inverse Images of Regular Values" (pp. 54–71) and §2-3 "Change of Parameters; Differentiable Functions on Surfaces" (pp. 72–85): Definition 1 (p. 54), Propositions 1–4 of §2-2 (pp. 59, 61, 63, 65) and Proposition 1 of §2-3 (p. 74).

This is the fourth mission of a series formalizing do Carmo's book, sharing the namespace DoCarmoDG with the others.

Setting

A subset S⊆R3S \subseteq \mathbb{R}^3S⊆R3 is a regular surface when every p∈Sp \in Sp∈S has an open neighbourhood V⊆R3V \subseteq \mathbb{R}^3V⊆R3 such that V∩SV \cap SV∩S is the image of a map x:U→R3x : U \to \mathbb{R}^3x:U→R3, defined on an open set U⊆R2U \subseteq \mathbb{R}^2U⊆R2, satisfying the three conditions of do Carmo's Definition 1:

  1. xxx is differentiable, i.e. of class C∞C^\inftyC∞ on UUU;
  2. xxx is a homeomorphism of UUU onto V∩SV \cap SV∩S — it is injective and its inverse is continuous;
  3. (regularity) for every q∈Uq \in Uq∈U the differential dxq:R2→R3dx_q : \mathbb{R}^2 \to \mathbb{R}^3dxq​:R2→R3 is injective.

Such an xxx is a parametrization, or system of local coordinates, and V∩SV \cap SV∩S is a coordinate neighbourhood.

Given a differentiable fff on an open set U⊆R3U \subseteq \mathbb{R}^3U⊆R3, a value aaa is a regular value of fff when dfpdf_pdfp​ is surjective — equivalently, nonzero — at every p∈Up \in Up∈U with f(p)=af(p) = af(p)=a (do Carmo Definition 2, §2-2).

Formalization targets

Goal — Change of parameters (do Carmo §2-3, Proposition 1)

If x:U→Sx : U \to Sx:U→S and y:V→Sy : V \to Sy:V→S are two parametrizations of a regular surface SSS with p∈x(U)∩y(V)=Wp \in x(U) \cap y(V) = Wp∈x(U)∩y(V)=W, then

h=x−1∘y:y−1(W)→x−1(W)h = x^{-1} \circ y : y^{-1}(W) \to x^{-1}(W)h=x−1∘y:y−1(W)→x−1(W)

is a diffeomorphism: hhh is differentiable, bijective, and h−1h^{-1}h−1 is differentiable.

Supporting statements

The graph of a differentiable function of two variables is a regular surface (Proposition 1); the inverse image of a regular value is a regular surface (Proposition 2); a regular surface is locally the graph of a differentiable function of one of the three coordinate pairs (Proposition 3); and an injective map satisfying conditions 1 and 3 whose image lies in a regular surface automatically has a continuous inverse (Proposition 4).

Significance

Proposition 2 is the practical criterion: it is what shows in one line that spheres, ellipsoids, tori and the level sets of generic polynomials are regular surfaces, and it is applied throughout the book. Proposition 3 is the structural statement that a regular surface is locally a graph, which is the form in which most local computations are carried out; Proposition 4 removes the awkward homeomorphism clause from the verification of examples. The change-of-parameters theorem is what allows every subsequent definition — differentiable function on a surface, tangent plane, first fundamental form, curvature — to be given in coordinates and then shown to be independent of them, and it is also the reason a regular surface carries a smooth structure at all.

Mathlib has smooth manifolds, the implicit and inverse function theorems, and ContDiffOn, but it does not contain do Carmo's concrete definition of a regular surface as a subset of R3\mathbb{R}^3R3 or these four propositions about it. Establishing them is what allows the rest of this series to work with patches while knowing that the objects so defined are coordinate-independent.

Difficulty

Everything here rests on the inverse function theorem, but each proposition needs it in a slightly different form. Proposition 2 requires completing fff to a local diffeomorphism F(x,y,z)=(x,y,f(x,y,z))F(x,y,z) = (x,y,f(x,y,z))F(x,y,z)=(x,y,f(x,y,z)) and reading off the level set — with the complication that which partial derivative is nonzero varies from point to point, so the coordinate that is solved for is not fixed in advance. Proposition 3 needs the same case distinction on which 2×22 \times 22×2 Jacobian minor of xxx is nonzero, and this is exactly why the conclusion is a disjunction over the three coordinate pairs. Proposition 4 is where the homeomorphism condition is shown to be redundant, and the argument goes through the local factorization x−1=(π∘x)−1∘πx^{-1} = (\pi \circ x)^{-1} \circ \pix−1=(π∘x)−1∘π.

The change-of-parameters theorem is not a direct application of the inverse function theorem to hhh: the map hhh is defined only on a subset of the plane and x−1x^{-1}x−1 is, a priori, merely continuous. One first extends xxx to a local diffeomorphism of a neighbourhood in R3\mathbb{R}^3R3 and then composes; the continuity of x−1x^{-1}x−1 (condition 2 of Definition 1) is what makes the domain of hhh open, and it cannot be dispensed with.

Formalization scope

A surface is a set S : Set (EuclideanSpace ℝ (Fin 3)), and a parametrization is a map x : ℝ × ℝ → EuclideanSpace ℝ (Fin 3) together with an open U : Set (ℝ × ℝ). Smoothness is ContDiffOn ℝ (⊤ : ℕ∞), matching do Carmo's "differentiable" for C∞C^\inftyC∞; regularity is injectivity of the Fréchet derivative at each point of U, which is do Carmo's condition 3; and the homeomorphism condition is stated as injectivity on U together with the existence of a continuous left inverse on the image, which is the content of "the inverse is continuous". The neighbourhood clause of Definition 1 is x '' U = V ∩ S for an open V containing the point.

Graphs are formalized as three separate sets, one for each of z=f(x,y)z = f(x,y)z=f(x,y), y=g(x,z)y = g(x,z)y=g(x,z) and x=h(y,z)x = h(y,z)x=h(y,z), so that Proposition 3 can state its disjunction faithfully; in that statement the neighbourhood is an open set W of R3\mathbb{R}^3R3 and the claim is W ∩ S = W ∩ graph.

The goal states the diffeomorphism property of hhh explicitly — two maps, mutually inverse on the relevant domains, both ContDiffOn, together with the openness of those domains — rather than through a bundled structure, so that no library convention is assumed. There is no trivializing reading: the domains are those forced by the two parametrizations, and in the degenerate case where the images do not overlap the statement reduces to a true but empty claim about the empty set, while the substance is in the overlapping case.

Selected references

  • Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition, Dover, 2016, §2-2 (Definition 1, p. 54; Propositions 1-4, pp. 59-65) and §2-3 (Proposition 1, p. 74).
6 thms3 active usersReviewed
🏆Completed
Differential Geometry·Captain: Lucas

Differential Geometry of Curves and Surfaces II: Theorema EgregiumTextbook

Motivation

Until 1827 the curvature of a surface in space was understood as a statement about how the surface sits inside R3\mathbb{R}^3R3: it was computed from the way the unit normal turns, that is, from the second fundamental form. Gauss's Disquisitiones generales circa superficies curvas showed that one particular combination of those extrinsic quantities — the product of the principal curvatures — can be recomputed from measurements made entirely inside the surface, using only lengths of curves drawn on it. This is the Theorema Egregium, and it is the reason the subject splits into extrinsic and intrinsic geometry; the latter is what becomes Riemannian geometry.

The reference for this mission is Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition (Dover, 2016), §4-3, "The Gauss Theorem and the Equations of Compatibility" (pp. 235–240). The theorem is stated on page 237 and derived from the Gauss formula, equation (5) of that section; the Mainardi–Codazzi equations (6) and (6a) on page 238 complete the list of compatibility equations.

This is the second mission of a series formalizing do Carmo's book; it shares the namespace DoCarmoDG with the first, on the local theory of curves.

Setting

A regular parametrized patch is a map x:U→R3x : U \to \mathbb{R}^3x:U→R3, defined and smooth on an open set U⊆R2U \subseteq \mathbb{R}^2U⊆R2 with coordinates (u,v)(u,v)(u,v), whose partial derivatives satisfy xu∧xv≠0x_u \wedge x_v \neq 0xu​∧xv​=0 at every point of UUU; the last condition says that dxdxdx is injective, so {xu,xv}\{x_u, x_v\}{xu​,xv​} spans a 222-dimensional tangent plane at each point and

N=xu∧xv∣xu∧xv∣N = \frac{x_u \wedge x_v}{|x_u \wedge x_v|}N=∣xu​∧xv​∣xu​∧xv​​

is a unit normal field along the patch.

The first fundamental form is the restriction of the ambient inner product to the tangent plane; in the parametrization it is recorded by the three functions

E=⟨xu,xu⟩,F=⟨xu,xv⟩,G=⟨xv,xv⟩,E = \langle x_u, x_u\rangle, \qquad F = \langle x_u, x_v\rangle, \qquad G = \langle x_v, x_v\rangle,E=⟨xu​,xu​⟩,F=⟨xu​,xv​⟩,G=⟨xv​,xv​⟩,

and EG−F2=∣xu∧xv∣2>0EG - F^2 = |x_u \wedge x_v|^2 > 0EG−F2=∣xu​∧xv​∣2>0. The second fundamental form is recorded by

e=⟨N,xuu⟩,f=⟨N,xuv⟩,g=⟨N,xvv⟩,e = \langle N, x_{uu}\rangle, \qquad f = \langle N, x_{uv}\rangle, \qquad g = \langle N, x_{vv}\rangle,e=⟨N,xuu​⟩,f=⟨N,xuv​⟩,g=⟨N,xvv​⟩,

and the Gaussian curvature is

K=eg−f2EG−F2.K = \frac{eg - f^2}{EG - F^2}.K=EG−F2eg−f2​.

The three second derivatives xuu,xuv,xvvx_{uu}, x_{uv}, x_{vv}xuu​,xuv​,xvv​ decompose in the basis {xu,xv,N}\{x_u, x_v, N\}{xu​,xv​,N}; the tangential coefficients are the Christoffel symbols Γijk\Gamma^k_{ij}Γijk​ of the patch, and the normal coefficients are eee, fff, ggg, which is do Carmo's system (1) of §4-3:

xuu=Γ111xu+Γ112xv+eN,xuv=Γ121xu+Γ122xv+fN,xvv=Γ221xu+Γ222xv+gN.x_{uu} = \Gamma^1_{11} x_u + \Gamma^2_{11} x_v + eN, \qquad x_{uv} = \Gamma^1_{12} x_u + \Gamma^2_{12} x_v + fN, \qquad x_{vv} = \Gamma^1_{22} x_u + \Gamma^2_{22} x_v + gN.xuu​=Γ111​xu​+Γ112​xv​+eN,xuv​=Γ121​xu​+Γ122​xv​+fN,xvv​=Γ221​xu​+Γ222​xv​+gN.

Two patches over the same parameter domain are isometric when their first fundamental forms coincide, E=EˉE = \bar EE=Eˉ, F=FˉF = \bar FF=Fˉ, G=GˉG = \bar GG=Gˉ at every point: lengths of curves, angles and areas computed in the parameter domain then agree, and a local isometry between the two surfaces is obtained by matching parameters.

Formalization targets

Goal — Theorema Egregium (do Carmo, p. 237)

E=Eˉ, F=Fˉ, G=Gˉ  on U⟹K=Kˉ  on U.E = \bar E,\ F = \bar F,\ G = \bar G \ \text{ on } U \quad \Longrightarrow \quad K = \bar K \ \text{ on } U .E=Eˉ, F=Fˉ, G=Gˉ  on U⟹K=Kˉ  on U.

The Gaussian curvature of a regular patch is determined by its first fundamental form alone, although its definition uses the second fundamental form, i.e. the position of the surface in space.

Supporting statements

The existence and uniqueness of the Christoffel symbols; the linear system (2) expressing them through E,F,GE, F, GE,F,G and their first derivatives; the Gauss formula (5),

(Γ122)u−(Γ112)v+Γ121Γ112+Γ122Γ122−Γ112Γ222−Γ111Γ122=−EK;(\Gamma^2_{12})_u - (\Gamma^2_{11})_v + \Gamma^1_{12}\Gamma^2_{11} + \Gamma^2_{12}\Gamma^2_{12} - \Gamma^2_{11}\Gamma^2_{22} - \Gamma^1_{11}\Gamma^2_{12} = -EK;(Γ122​)u​−(Γ112​)v​+Γ121​Γ112​+Γ122​Γ122​−Γ112​Γ222​−Γ111​Γ122​=−EK;

the Mainardi–Codazzi equations (6) and (6a); the closed formula for KKK in an orthogonal parametrization (Exercise 1, p. 240); the invariance of KKK under a change of parameters; and, as a corollary, that no neighbourhood of a point of the unit sphere is isometric to a piece of a plane (Exercise 4, p. 240).

Significance

The theorem is what makes intrinsic geometry possible: a quantity defined through the embedding turns out to be computable from the metric, so it survives every isometric deformation. Concrete consequences include the impossibility of a distortion-free map of the sphere — the reason every cartographic projection distorts lengths — and the equality of the Gaussian curvatures of the catenoid and the helicoid at corresponding points, which do Carmo notes immediately after the theorem. In the structure of the book, the Gauss formula is also the identity that makes the global Gauss–Bonnet theorem of §4-5 a statement about intrinsic data.

Mathlib has inner product spaces, iterated derivatives and the smooth manifold library, but it does not contain the first and second fundamental forms of a parametrized surface, the Christoffel symbols of a patch, the Gaussian curvature in this sense, or the compatibility equations. This mission produces that vocabulary together with machine-checked proofs of the classical identities. The mathematics is Gauss's, from 1827; what is open is the formalization.

Difficulty

The proof is a computation, but not a short one: one differentiates the system (1), uses xuuv=xuvux_{uuv} = x_{uvu}xuuv​=xuvu​, re-expands every second derivative through (1) again, and equates coefficients in the basis {xu,xv,N}\{x_u, x_v, N\}{xu​,xv​,N}. Formally, the cost sits in three places: justifying the interchange of the mixed partial derivatives; establishing that the coefficient functions Γijk\Gamma^k_{ij}Γijk​ obtained pointwise from linear algebra are differentiable in the parameters; and carrying out the coefficient comparison in a basis that is not orthonormal, where one must use that EG−F2≠0EG - F^2 \neq 0EG−F2=0 rather than take inner products with an orthonormal frame.

The naive route to the Theorema Egregium — "solve the system (2) for the Γijk\Gamma^k_{ij}Γijk​, then quote the Gauss formula" — is the right one, but the first step must actually be carried out: the system (2) determines the symbols only because each of its three 2×22 \times 22×2 blocks has determinant EG−F2≠0EG - F^2 \neq 0EG−F2=0, and that is where the regularity hypothesis is used.

Formalization scope

A patch is a curried map x : ℝ → ℝ → EuclideanSpace ℝ (Fin 3), so that the partial derivatives xux_uxu​ and xvx_vxv​ are ordinary one-variable derivatives, and the domain is an open set U : Set (ℝ × ℝ); smoothness is ContDiffOn ℝ (⊤ : ℕ∞) of the uncurried map on U, matching do Carmo's use of "differentiable" for C∞C^\inftyC∞. Regularity is stated as xu∧xv≠0x_u \wedge x_v \neq 0xu​∧xv​=0 on U, with the vector product defined componentwise. All quantities (NNN, EEE, FFF, GGG, eee, fff, ggg, KKK) are total functions of the parameters, taking junk values off U; every statement restricts to points of U.

Christoffel symbols are not defined by a formula: a statement that mentions them quantifies over functions Γijk\Gamma^k_{ij}Γijk​ assumed to satisfy do Carmo's decomposition (1) on U, and a separate milestone asserts that such functions exist and are unique on U. The symmetry Γ12k=Γ21k\Gamma^k_{12} = \Gamma^k_{21}Γ12k​=Γ21k​ is built into the notation, as in the book.

Isometry is formalized as equality of EEE, FFF, GGG over a common parameter domain rather than as a map between surfaces; together with the milestone on invariance under change of parameters, this recovers do Carmo's statement that KKK is invariant under local isometries. The formalization deliberately keeps the surface concrete (a patch, not an abstract manifold), which is what makes the compatibility equations expressible as identities between explicit derivatives.

This mission's definition file builds on the vector-product definition introduced in mission I of this series (Fundamental Theorem of the Local Theory of Curves), so mission I must be submitted first: its definitions have to be published before the definition file of this mission can compile.

There is no vacuous reading: the hypotheses are satisfiable — every regular patch, for instance a graph or a surface of revolution, satisfies them — and the conclusion compares two curvature functions pointwise.

Selected references

  • Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition, Dover, 2016, §2-5, §3-3 and §4-3 (Theorema Egregium on p. 237; Gauss formula, eq. (5); Mainardi–Codazzi, eqs. (6), (6a)).
  • C. F. Gauss, Disquisitiones generales circa superficies curvas, Commentationes Societatis Regiae Scientiarum Gottingensis Recentiores 6 (1827), 99–146.
10 thms3 active usersReviewed
🏆Completed
Differential Geometry·Captain: Lucas

Differential Geometry of Curves and Surfaces I: Fundamental Theorem of the Local Theory of CurvesTextbook

Motivation

The differential geometry of curves in R3\mathbb{R}^3R3 is the entry point of every course and every textbook in the subject, and it is the first place where a geometric object is shown to be completely determined by a small list of numerical invariants. A space curve traced out by a particle moving at unit speed bends (curvature) and twists (torsion); the assertion that these two scalar functions determine the curve completely, up to a motion of space, is the prototype of every later "fundamental theorem" of the subject — for surfaces (Bonnet), for Riemannian metrics, and for submanifolds in general.

The reference for this mission is Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition (Dover, 2016), Chapter 1, Sections 1-4 and 1-5. The statement targeted here is the one printed on page 19 under the heading Fundamental Theorem of the Local Theory of Curves; the uniqueness half is proved on pages 20–22, and the existence half is deferred by do Carmo to the appendix of Chapter 4, where it is obtained from the existence and uniqueness theorem for linear systems of ordinary differential equations.

This is the first mission of a series formalizing do Carmo's book. The series shares one Lean namespace, DoCarmoDG, so that later missions on regular surfaces, the Gauss map, and Gauss–Bonnet build on the vocabulary fixed here.

Setting

Let I=(a,b)⊆RI = (a,b) \subseteq \mathbb{R}I=(a,b)⊆R be an open interval and let α:I→R3\alpha : I \to \mathbb{R}^3α:I→R3 be a smooth map. The curve α\alphaα is parametrized by arc length if ∣α′(s)∣=1|\alpha'(s)| = 1∣α′(s)∣=1 for every s∈Is \in Is∈I; the parameter sss is then the arc length measured along the curve.

For such a curve one sets

t(s)=α′(s),k(s)=∣α′′(s)∣.t(s) = \alpha'(s), \qquad k(s) = |\alpha''(s)| .t(s)=α′(s),k(s)=∣α′′(s)∣.

The vector t(s)t(s)t(s) is the unit tangent and the scalar k(s)≥0k(s) \ge 0k(s)≥0 is the curvature at sss. Differentiating α′⋅α′=1\alpha'\cdot\alpha' = 1α′⋅α′=1 gives α′′⋅α′=0\alpha''\cdot\alpha' = 0α′′⋅α′=0, so α′′(s)\alpha''(s)α′′(s) is orthogonal to t(s)t(s)t(s). At a point where k(s)≠0k(s) \neq 0k(s)=0 one defines the normal vector and the binormal vector

n(s)=α′′(s)k(s),b(s)=t(s)∧n(s),n(s) = \frac{\alpha''(s)}{k(s)}, \qquad b(s) = t(s) \wedge n(s),n(s)=k(s)α′′(s)​,b(s)=t(s)∧n(s),

where ∧\wedge∧ is the vector product of R3\mathbb{R}^3R3 (do Carmo §1-4). The triple {t(s),n(s),b(s)}\{t(s), n(s), b(s)\}{t(s),n(s),b(s)} is a positively oriented orthonormal basis, the Frenet trihedron. Since bbb has constant length and b′=t∧n′b' = t \wedge n'b′=t∧n′ is orthogonal to ttt, the derivative b′(s)b'(s)b′(s) is a multiple of n(s)n(s)n(s), and the torsion τ(s)\tau(s)τ(s) is defined by

b′(s)=τ(s) n(s).b'(s) = \tau(s)\, n(s).b′(s)=τ(s)n(s).

This is do Carmo's sign convention; many authors write −τ-\tau−τ for the same quantity, and the mission is committed to do Carmo's. With these conventions the Frenet formulas read

t′=k n,n′=−k t−τ b,b′=τ n.t' = k\,n, \qquad n' = -k\,t - \tau\, b, \qquad b' = \tau\, n .t′=kn,n′=−kt−τb,b′=τn.

A rigid motion of R3\mathbb{R}^3R3 is a map p↦ρ(p)+cp \mapsto \rho(p) + cp↦ρ(p)+c where ρ\rhoρ is an orthogonal linear map with positive determinant and c∈R3c \in \mathbb{R}^3c∈R3 (do Carmo §1-5, Exercise 6).

Formalization targets

Goal — Fundamental theorem of the local theory of curves (do Carmo, p. 19)

Given smooth functions k,τ:(a,b)→Rk, \tau : (a,b) \to \mathbb{R}k,τ:(a,b)→R with k(s)>0k(s) > 0k(s)>0:

∃ α:(a,b)→R3 parametrized by arc length with curvature k and torsion τ,\exists\, \alpha : (a,b) \to \mathbb{R}^3 \ \text{parametrized by arc length with curvature } k \text{ and torsion } \tau,∃α:(a,b)→R3 parametrized by arc length with curvature k and torsion τ, and any two such curves α,αˉ satisfy αˉ=ρ∘α+c for an orthogonal ρ with det⁡ρ>0.\text{and any two such curves } \alpha, \bar\alpha \text{ satisfy } \bar\alpha = \rho \circ \alpha + c \text{ for an orthogonal } \rho \text{ with } \det \rho > 0 .and any two such curves α,αˉ satisfy αˉ=ρ∘α+c for an orthogonal ρ with detρ>0.

The two halves are also stated separately as milestones, since they are proved by entirely different means: uniqueness by a Gronwall-free energy argument on the Frenet trihedron, existence by solving a linear ODE system.

Supporting statements

The orthonormality of the Frenet trihedron, the Frenet formulas themselves, the characterization of straight lines by k≡0k \equiv 0k≡0 and of plane curves by τ≡0\tau \equiv 0τ≡0, the closed formula τ=− (α′∧α′′)⋅α′′′/k2\tau = -\,(\alpha' \wedge \alpha'')\cdot\alpha''' / k^2τ=−(α′∧α′′)⋅α′′′/k2, and the invariance of arc length, curvature and torsion under rigid motions.

Significance

The theorem is the model case of a classification result: a geometric object modulo a symmetry group is faithfully encoded by a complete set of local invariants. Downstream it is what licenses the standard practice of "prescribing curvature and torsion" — constructing curves with specified geometric behaviour, computing with the Frenet apparatus rather than with the curve itself, and recognizing that any identity among kkk, τ\tauτ and their derivatives is a genuine statement about the curve and not about its parametrization. In do Carmo's own development the local canonical form (§1-6) and the global results of §1-7 both rest on the Frenet apparatus fixed here.

Mathlib contains the analytic ingredients — the Picard–Lindelöf theorem, existence and uniqueness for linear ODE systems, orthonormal bases and the orthogonal group of a real inner product space — but it does not contain the Frenet trihedron of a space curve, the torsion of a space curve, or this theorem. What this mission produces is therefore a reusable formal vocabulary for the local theory of space curves, plus machine-checked proofs of the classical statements about it. The mathematics is completely classical and has been known since Frenet (1847) and Serret (1851); what is open here is the formalization, not the mathematics.

Difficulty

The uniqueness half is a short argument on paper — the function ∣t−tˉ∣2+∣n−nˉ∣2+∣b−bˉ∣2|t - \bar t|^2 + |n - \bar n|^2 + |b - \bar b|^2∣t−tˉ∣2+∣n−nˉ∣2+∣b−bˉ∣2 has vanishing derivative by the Frenet formulas — but formally it requires first establishing that the Frenet frame is differentiable and satisfies those formulas, which needs k>0k > 0k>0 and the smoothness of s↦α′′(s)s \mapsto \alpha''(s)s↦α′′(s) away from its zeros, and then a connectedness argument on the interval.

The existence half cannot be done by exhibiting a formula: the curve is produced by solving the linear system F′=A(s)FF' = A(s) FF′=A(s)F for the 3×33 \times 33×3 frame FFF, checking that the solution stays orthogonal (this is where the skew-symmetry of AAA enters), and then integrating the first row. Recovering that the resulting curve has exactly the prescribed curvature and torsion, as computed by the definitions rather than as postulated by the ODE, is the step where most of the formal work sits.

The obvious shortcut — defining torsion by the closed formula −(α′∧α′′)⋅α′′′/k2-(\alpha' \wedge \alpha'') \cdot \alpha''' / k^2−(α′∧α′′)⋅α′′′/k2 — is not taken here: the definition is the book's, b′=τnb' = \tau nb′=τn, and the closed formula is a milestone to be proved.

Formalization scope

Curves are total functions ℝ → EuclideanSpace ℝ (Fin 3) that are assumed smooth only on the open interval Set.Ioo a b; smoothness is ContDiffOn ℝ (⊤ : ℕ∞), matching do Carmo's use of "differentiable" to mean C∞C^\inftyC∞. Because the interval is open, the ordinary deriv agrees with the derivative along the interval at every interior point, and all derivatives in the statements are plain iterated deriv. Curvature, normal, binormal and torsion are defined exactly as above; at points where k=0k = 0k=0 the normal vector takes the junk value 000, so every statement that mentions nnn, bbb or τ\tauτ carries the hypothesis k≠0k \neq 0k=0 explicitly.

The vector product is defined componentwise on EuclideanSpace ℝ (Fin 3), and a rigid motion is a LinearIsometryEquiv of EuclideanSpace ℝ (Fin 3) with positive determinant followed by a translation.

Degenerate intervals are not excluded: if b≤ab \le ab≤a the interval is empty and the statements hold vacuously, which is why the goal is not formulated as a statement about a single point but as a statement about all of (a,b)(a,b)(a,b) — no hypothesis is vacuous for a<ba < ba<b, and the existence clause is a genuine construction.

Contributions welcome: the Frenet apparatus and the ODE construction are the reusable parts, and both are prerequisites for the later missions of this series.

Selected references

  • Manfredo P. do Carmo, Differential Geometry of Curves and Surfaces, 2nd edition, Dover, 2016, Chapter 1, §1-4 and §1-5 (statement on p. 19, uniqueness proof pp. 20–22, existence in the appendix to Chapter 4).
  • F. Frenet, Sur les courbes à double courbure, Journal de Mathématiques Pures et Appliquées 17 (1852), 437–447.
  • J. A. Serret, Sur quelques formules relatives à la théorie des courbes à double courbure, Journal de Mathématiques Pures et Appliquées 16 (1851), 193–207.
11 thms3 active usersReviewed
🏆Completed
Algebraic TopologySymplectic Geometry·Captain: Mazecto

Conley–Zehnder Index I: Axiomatic Characterization on Paths of Symplectic MatricesResearch Paper

Motivation

The Conley–Zehnder index assigns an integer to a path of symplectic matrices that starts at the identity and ends at a matrix without eigenvalue 111. It is how periodic orbits of Hamiltonian and Reeb flows get graded. In Floer homology it gives the grading of the chain complex, generated by the 111-periodic orbits of a nondegenerate Hamiltonian (Salamon–Zehnder 1992; Salamon 1999). In contact homology and symplectic field theory it grades Reeb orbits. In the analysis of pseudoholomorphic curves it enters the Fredholm index formula for the linearized Cauchy–Riemann operator through the asymptotic orbits. In three-dimensional Reeb dynamics it defines dynamical convexity (every periodic orbit has index at least 333), the hypothesis of the Hofer–Wysocki–Zehnder theorem on disk-like global surfaces of section (HWZ 1998).

Timeline. Conley and Zehnder introduced the index in their Morse-type index theory for periodic solutions of Hamiltonian equations (Conley–Zehnder 1984). Salamon and Zehnder gave the definition through a rotation function ρ:Sp(2n)→S1\rho : \mathrm{Sp}(2n) \to S^1ρ:Sp(2n)→S1 and related it to the Maslov index (SZ92). Robbin and Salamon extended it to arbitrary paths as a half-integer Maslov-type index (Robbin–Salamon 1993). Gutt attributes the properties naturality, homotopy, zero, product, loop, signature, determinant and inverse, and the characterization of the index by homotopy, loop and signature alone, to Salamon's lecture notes (Sal99) and to Audin–Damian (AD14); the statements used here are those of Gutt, Propositions 8–9. Gutt gives a self-contained account with several equivalent formulas, including the normalized complex determinant of the complex-linear part used below (Gutt 2014, §2).

Setting

Write R2n\mathbb{R}^{2n}R2n with coordinates (q,p)(q,p)(q,p) and let

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

The symplectic group Sp(2n)\mathrm{Sp}(2n)Sp(2n) is the set of real 2n×2n2n\times 2n2n×2n matrices AAA with AJ0AT=J0A J_0 A^{\mathsf T} = J_0AJ0​AT=J0​. Let Sp∗(2n)\mathrm{Sp}^*(2n)Sp∗(2n) be the set of A∈Sp(2n)A \in \mathrm{Sp}(2n)A∈Sp(2n) with det⁡(Id−A)≠0\det(\mathrm{Id} - A) \neq 0det(Id−A)=0.

SP(n)\mathrm{SP}(n)SP(n) is the set of continuous paths ψ:[0,1]→Sp(2n)\psi : [0,1] \to \mathrm{Sp}(2n)ψ:[0,1]→Sp(2n) with ψ(0)=Id\psi(0) = \mathrm{Id}ψ(0)=Id and ψ(1)∈Sp∗(2n)\psi(1) \in \mathrm{Sp}^*(2n)ψ(1)∈Sp∗(2n). It carries the compact-open topology.

For A∈Sp(2n)A \in \mathrm{Sp}(2n)A∈Sp(2n), the complex-linear part is CA=12(A−J0AJ0)C_A = \tfrac12 (A - J_0 A J_0)CA​=21​(A−J0​AJ0​). It commutes with J0J_0J0​, so it has the block form (X−YYX)\begin{pmatrix} X & -Y \\ Y & X\end{pmatrix}(XY​−YX​), which is the complex matrix X+iYX + iYX+iY once R2n\mathbb{R}^{2n}R2n is identified with Cn\mathbb{C}^nCn by (x,y)↦x+iy(x,y) \mapsto x + iy(x,y)↦x+iy. Set

ρ^(A)=det⁡C(X+iY)∣det⁡C(X+iY)∣∈S1.\hat\rho(A) = \frac{\det_{\mathbb C}(X+iY)}{|\det_{\mathbb C}(X+iY)|} \in S^1.ρ^​(A)=∣detC​(X+iY)∣detC​(X+iY)​∈S1.

Let W+=−IdW^+ = -\mathrm{Id}W+=−Id and W−=diag(2,−1,…,−1,12,−1,…,−1)W^- = \mathrm{diag}(2,-1,\dots,-1,\tfrac12,-1,\dots,-1)W−=diag(2,−1,…,−1,21​,−1,…,−1). Each ψ∈SP(n)\psi \in \mathrm{SP}(n)ψ∈SP(n) extends to a path ψ~:[0,2]→Sp(2n)\tilde\psi : [0,2] \to \mathrm{Sp}(2n)ψ~​:[0,2]→Sp(2n) with ψ~=ψ\tilde\psi = \psiψ~​=ψ on [0,1][0,1][0,1], ψ~(t)∈Sp∗(2n)\tilde\psi(t) \in \mathrm{Sp}^*(2n)ψ~​(t)∈Sp∗(2n) for t≥1t \geq 1t≥1, and ψ~(2)∈{W+,W−}\tilde\psi(2) \in \{W^+, W^-\}ψ~​(2)∈{W+,W−}. The map ρ^2∘ψ~\hat\rho^2 \circ \tilde\psiρ^​2∘ψ~​ is then a loop in S1S^1S1, and

μCZ(ψ)=deg⁡(ρ^2∘ψ~).\mu_{CZ}(\psi) = \deg\big(\hat\rho^2 \circ \tilde\psi\big).μCZ​(ψ)=deg(ρ^​2∘ψ~​).

For a loop φ:[0,1]→Sp(2n)\varphi : [0,1] \to \mathrm{Sp}(2n)φ:[0,1]→Sp(2n) with φ(0)=φ(1)=Id\varphi(0) = \varphi(1) = \mathrm{Id}φ(0)=φ(1)=Id, the Maslov index is μ(φ)=deg⁡(ρ^∘φ)\mu(\varphi) = \deg(\hat\rho\circ\varphi)μ(φ)=deg(ρ^​∘φ). For a symmetric matrix SSS, Sign(S)\mathrm{Sign}(S)Sign(S) is the number of positive eigenvalues minus the number of negative eigenvalues.

Formalization targets

Goal: existence and uniqueness

The map μCZ:SP(n)→Z\mu_{CZ} : \mathrm{SP}(n) \to \mathbb{Z}μCZ​:SP(n)→Z has the following three properties, and every map μ:SP(n)→Z\mu : \mathrm{SP}(n) \to \mathbb{Z}μ:SP(n)→Z with these properties equals μCZ\mu_{CZ}μCZ​:

  • Homotopy. μ\muμ is constant on the connected components of SP(n)\mathrm{SP}(n)SP(n).
  • Loop. μ(φψ)=μ(ψ)+2μ(φ)\mu(\varphi\psi) = \mu(\psi) + 2\mu(\varphi)μ(φψ)=μ(ψ)+2μ(φ) for every loop φ\varphiφ at Id\mathrm{Id}Id and every ψ∈SP(n)\psi \in \mathrm{SP}(n)ψ∈SP(n).
  • Signature. If S=STS = S^{\mathsf T}S=ST is nondegenerate and all of its eigenvalues have absolute value <2π< 2\pi<2π, then μ(t↦exp⁡(tJ0S))=12Sign(S)\mu\big(t \mapsto \exp(tJ_0S)\big) = \tfrac12 \mathrm{Sign}(S)μ(t↦exp(tJ0​S))=21​Sign(S).

Milestones

  1. det⁡CCA≠0\det_{\mathbb C} C_A \neq 0detC​CA​=0 for every A∈Sp(2n)A \in \mathrm{Sp}(2n)A∈Sp(2n).
  2. deg⁡(ρ^2∘ψ~)\deg(\hat\rho^2\circ\tilde\psi)deg(ρ^​2∘ψ~​) exists and does not depend on the extension ψ~\tilde\psiψ~​.
  3. deg⁡(ρ^∘φ)\deg(\hat\rho\circ\varphi)deg(ρ^​∘φ) is well defined for loops.
  4. Naturality. μCZ(φψφ−1)=μCZ(ψ)\mu_{CZ}(\varphi\psi\varphi^{-1}) = \mu_{CZ}(\psi)μCZ​(φψφ−1)=μCZ​(ψ) for every path φ\varphiφ in Sp(2n)\mathrm{Sp}(2n)Sp(2n).
  5. Homotopy, for μCZ\mu_{CZ}μCZ​.
  6. Zero. If ψ(s)\psi(s)ψ(s) has no eigenvalue on the unit circle for s>0s > 0s>0, then μCZ(ψ)=0\mu_{CZ}(\psi) = 0μCZ​(ψ)=0.
  7. Product. μCZ(ψ′⋄ψ′′)=μCZ(ψ′)+μCZ(ψ′′)\mu_{CZ}(\psi'\diamond\psi'') = \mu_{CZ}(\psi') + \mu_{CZ}(\psi'')μCZ​(ψ′⋄ψ′′)=μCZ​(ψ′)+μCZ​(ψ′′) under the symplectic block embedding Sp(2n′)×Sp(2n′′)↪Sp(2(n′+n′′))\mathrm{Sp}(2n')\times\mathrm{Sp}(2n'') \hookrightarrow \mathrm{Sp}(2(n'+n''))Sp(2n′)×Sp(2n′′)↪Sp(2(n′+n′′)).
  8. Loop, for μCZ\mu_{CZ}μCZ​.
  9. Signature, for μCZ\mu_{CZ}μCZ​.
  10. Determinant. (−1)n−μCZ(ψ)=sign⁡det⁡(Id−ψ(1))(-1)^{n-\mu_{CZ}(\psi)} = \operatorname{sign}\det(\mathrm{Id} - \psi(1))(−1)n−μCZ​(ψ)=signdet(Id−ψ(1)).
  11. Inverse. μCZ(ψ−1)=μCZ(ψT)=−μCZ(ψ)\mu_{CZ}(\psi^{-1}) = \mu_{CZ}(\psi^{\mathsf T}) = -\mu_{CZ}(\psi)μCZ​(ψ−1)=μCZ​(ψT)=−μCZ​(ψ).
  12. Uniqueness. Homotopy, loop and signature determine μCZ\mu_{CZ}μCZ​ on SP(n)\mathrm{SP}(n)SP(n).

Significance

The result. The characterization makes the index a canonical invariant: any construction of an integer invariant of nondegenerate symplectic paths that is homotopy invariant and has the correct loop and signature behaviour is the Conley–Zehnder index. In practice this is how different definitions in the literature are identified with one another (rotation function, polar decomposition, complex-linear part, crossing forms, spectral flow of asymptotic operators). The listed properties are used directly to compute indices of concrete orbits, for instance the iterates of orbits of ellipsoids and the orbits of convex energy surfaces.

Formalizing it. All results here are classical and proved. No formalization of the Conley–Zehnder index exists in Mathlib. This mission produces a reusable library for symplectic linear algebra in Lean: the index and the Maslov index of loops as functions on path spaces, together with their computational properties. It is the first stage of a formalization of the Fredholm theory of linearized Cauchy–Riemann operators, whose index formula is stated in terms of Conley–Zehnder indices. It also gives a general-dimension definition against which the two-dimensional winding-interval definitions used in existing dynamical-convexity statements can be compared.

Difficulty

The index is defined through a choice: an extension of the path to W±W^\pmW± inside Sp∗(2n)\mathrm{Sp}^*(2n)Sp∗(2n) and a continuous argument of a circle-valued map. Before any property can be stated as a property of a function, the result must be shown independent of these choices. That is not a local computation: it depends on the global topology of the symplectic group and on how the set of matrices with eigenvalue 111 sits inside it.

The properties themselves are statements about the degree of maps into S1S^1S1 built from determinants, and ρ^\hat\rhoρ^​ is not a homomorphism. So none of the properties follows from a calculation on a single matrix, and loop and product require control of degrees under pointwise products and block sums. The uniqueness statement quantifies over all integer-valued functions on a path space. The argument for it has to use only the three listed properties and the topology of SP(n)\mathrm{SP}(n)SP(n).

Formalization scope

  • Namespace ConleyZehnder; all definitions are in ConleyZehnder_Setting.
  • Matrices are Matrix (Fin n ⊕ Fin n) (Fin n ⊕ Fin n) ℝ. J0J_0J0​ is Mathlib's Matrix.J, and Sp(2n)\mathrm{Sp}(2n)Sp(2n) is Matrix.symplecticGroup. Paths are C(unitInterval, Mat n) with the compact-open topology. SP(n)\mathrm{SP}(n)SP(n) is a Set of such paths, and "connected component" means connectedComponentIn (SP n).
  • Index maps are functions μ\muμ on all of C(unitInterval, Mat n). Every property constrains μ\muμ only on SP(n)\mathrm{SP}(n)SP(n), and the paths φψφ−1\varphi\psi\varphi^{-1}φψφ−1, ψ−1\psi^{-1}ψ−1, ψT\psi^{\mathsf T}ψT, ψ′⋄ψ′′\psi'\diamond\psi''ψ′⋄ψ′′ and exp⁡(tJ0S)\exp(tJ_0S)exp(tJ0​S) are passed as continuous maps with the stated pointwise values.
  • Degree is expressed by continuous real lifts: IsArgLift f θ means f(t)=eiθ(t)f(t) = e^{i\theta(t)}f(t)=eiθ(t). IsCZValue ψ k says that some extension and some lifts give 2(Δθψ+Δθχ)=2πk2\big(\Delta\theta_\psi + \Delta\theta_\chi\big) = 2\pi k2(Δθψ​+Δθχ​)=2πk, where χ\chiχ is the part of the extension after t=1t = 1t=1. czIndex and maslovIndex are defined by choice from these predicates, with fallback value 000. Milestones 2 and 3 are what make the fallback unreachable. Without them, any property proved for czIndex would say nothing about the actual index.
  • The circle-valued map is ρ^\hat\rhoρ^​ of Gutt, Corollary 12, formula (9). The rotation function ρ\rhoρ of Salamon–Zehnder (built from eigenvalue multiplicities and Krein signs) is not formalized. Gutt, Proposition 10 and Corollaries 11–12, shows that the degrees agree. The Maslov index of loops is also taken with ρ^\hat\rhoρ^​.
  • The signature uses Matrix.IsHermitian.eigenvalues; for real matrices, Hermitian means symmetric. The norm bound is stated as ∣λ∣<2π|\lambda| < 2\pi∣λ∣<2π for every eigenvalue λ\lambdaλ. The signature property is stated as 2μ=Sign(S)2\mu = \mathrm{Sign}(S)2μ=Sign(S).
  • n=0n = 0n=0 is allowed: SP(0)\mathrm{SP}(0)SP(0) is a single path and every property holds for it.

Contributions welcome: general lemmas on degrees of maps [0,1]→S1[0,1]\to S^1[0,1]→S1 (existence and uniqueness of lifts, additivity under products and concatenation, homotopy invariance), and the topology of Sp(2n)\mathrm{Sp}(2n)Sp(2n) and Sp∗(2n)\mathrm{Sp}^*(2n)Sp∗(2n). These are reusable well beyond this mission.

Selected references

  • C. Conley, E. Zehnder, Morse-type index theory for flows and periodic solutions for Hamiltonian equations, Comm. Pure Appl. Math. 37 (1984), 207–253. https://doi.org/10.1002/cpa.3160370204
  • D. Salamon, E. Zehnder, Morse theory for periodic solutions of Hamiltonian systems and the Maslov index, Comm. Pure Appl. Math. 45 (1992), 1303–1360. https://doi.org/10.1002/cpa.3160451004
  • J. Robbin, D. Salamon, The Maslov index for paths, Topology 32 (1993), 827–844. https://doi.org/10.1016/0040-9383(93)90052-W
  • H. Hofer, K. Wysocki, E. Zehnder, The dynamics on three-dimensional strictly convex energy surfaces, Ann. of Math. 148 (1998), 197–289. https://doi.org/10.2307/120994
  • D. Salamon, Lectures on Floer homology, in: Symplectic Geometry and Topology, IAS/Park City Math. Ser. 7, AMS (1999), 143–229. https://doi.org/10.1090/pcms/007/05
  • M. Audin, M. Damian, Morse Theory and Floer Homology, Universitext, Springer (2014); French original 2010. https://doi.org/10.1007/978-1-4471-5496-9
  • J. Gutt, Generalized Conley–Zehnder index, Ann. Fac. Sci. Toulouse Math. (6) 23 (2014), 907–932. https://doi.org/10.5802/afst.1430 (arXiv:1307.7239)
32 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: marwahaha

An Artin group with no geometric CAT(0) actionOpen Problem

Motivation

Artin presentations often admit useful geometric models of nonpositive curvature. The source constructs a finite presentation designed to obstruct every geometric action on a proper CAT(0) space. The source is OpenAI's September 2026 manuscript.

Setting

A geometric action is an isometric group action that is proper and cocompact. CAT(0) is expressed by existence of geodesic segments and Euclidean comparison inequalities. The target uses one explicit Artin matrix on 116 generators.

Formalization targets

M=MT,Mss=1,Mst∈{2,3,∞} (s≠t),AM has no geometric action on a nonempty proper CAT(0) space.M=M^{\mathsf T},\quad M_{ss}=1,\quad M_{st}\in\{2,3,\infty\}\ (s\ne t),\qquad A_M\text{ has no geometric action on a nonempty proper CAT(0) space}.M=MT,Mss​=1,Mst​∈{2,3,∞} (s=t),AM​ has no geometric action on a nonempty proper CAT(0) space.

The following explicit matrix on 116 generators is symmetric, has diagonal entries 1, and has every off-diagonal entry in {2, 3, ∞}, and that its Artin group admits no geometric action on any nonempty proper CAT(0) metric space. Index the generators by 0, …, 115. For each b = 0, 1, 2, form the ordered block (b, (b + 1) mod 3, 5 + 37b, …, 41 + 37b). Distinct generators have matrix entry 3 if they are consecutive in a block; otherwise they have entry 2 if they are nonconsecutive members of a block or one is 3 or 4 and the other is 0, 1, or 2; all remaining entries are ∞. The Artin group has these generators and, for each finite entry n, equates the two alternating words of length n starting with the corresponding generators. Here a CAT(0) space is a geodesic metric space satisfying Euclidean triangle comparison, and proper means that closed balls are compact. The excluded geometric action is an action by isometries such that, for every compact set K, only finitely many group elements g satisfy gK ∩ K ≠ ∅, and some compact set has translates covering the whole space. Thus, for every nonempty proper metric space and every action of this explicitly presented group, at least one of the CAT(0), isometry, compact-intersection finiteness, or compact-covering conditions fails.

The goal is OAI.ArtinCAT0.main.

Significance

The formal statement verifies the matrix’s structural properties and excludes actions of the resulting explicit group. It does not merely assert that some unspecified Artin group has an obstruction. 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

Ruling out one candidate complex is insufficient because the conclusion ranges over all nonempty proper metric spaces and actions. The algebraic relations must force a contradiction with geometric-action properties themselves.

Formalization scope

The matrix is generated by three overlapping length-39 blocks plus sentinel relations. Properness is compact-intersection finiteness and cocompactness is coverage by translates of a compact set. The action target is universe-polymorphic.

The shared definitions are supplied by ArtinCAT0. 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, An Artin group with no geometric CAT(0) action, preprint, September 2026. Manuscript.
  • OpenAI, accompanying Lean statement. Pinned source.
2 thms2 active usersReviewed
🏆Completed
Differential Geometry·Captain: wurtle

A Three-Manifold Without Conjugate Points and Without a Nonpositively Curved MetricResearch Paper

Motivation

Along a geodesic of a Riemannian manifold, a Jacobi field describes how nearby geodesics spread apart. Two points of a geodesic are conjugate if some nonzero Jacobi field vanishes at both; a metric has no conjugate points if this never happens. Nonpositive sectional curvature implies no conjugate points (by the Rauch comparison), and the two conditions share many consequences: the universal cover is diffeomorphic to Rn\mathbb R^nRn via the exponential map, and the fundamental group controls the geometry. For a single metric the converse fails: Gulliver (1975) produced metrics without conjugate points that have regions of positive curvature. The existence question is subtler: must a closed manifold that carries some metric without conjugate points also carry some metric of nonpositive curvature? Ivanov and Kapovitch (2014) and the Burns–Matveev survey (2021) ask this, explicitly including dimension three.

Background

  • 1963. Milnor's Morse Theory develops the index-form framework for conjugate points.
  • 1975. Gulliver shows that absence of conjugate points does not force nonpositive curvature for an individual metric (doi:10.1090/S0002-9947-1975-0383294-0).
  • 1995. Leeb characterizes 3-manifolds with nonpositively curved metrics and gives two-piece graph-manifold obstructions (doi:10.1007/BF01231445).
  • 1996. Kapovich and Leeb study discrete group actions on nonpositively curved spaces (doi:10.1007/BF01445254).
  • 2014. Ivanov and Kapovitch ask the existence question (Questions 1.1, 8.1), single out graph manifolds glued from punctured-torus products, and prove that a closed 3-manifold has a metric without focal points iff it has one of nonpositive curvature (doi:10.4310/jdg/1393424918).
  • 2021. Burns and Matveev list the question (Question 4.1.2) (doi:10.1017/etds.2019.73).

In dimension two the answer is positive (Euler characteristic and uniformization), so dimension three is the first case. The source of this mission is an OpenAI preprint dated September 24, 2026, which answers the question negatively in dimension three.

Setting

Let MMM be a closed (compact, boundaryless) connected smooth 3-manifold with a smooth Riemannian metric ggg. In a chart, with Christoffel symbols Γjki\Gamma^i_{jk}Γjki​, a curve γ\gammaγ is a geodesic if γ¨i+Γjkiγ˙jγ˙k=0\ddot\gamma^i+\Gamma^i_{jk}\dot\gamma^j\dot\gamma^k=0γ¨​i+Γjki​γ˙​jγ˙​k=0. With covariant derivative DsD_sDs​ along γ\gammaγ and curvature R(X,Y)Z=∇X∇YZ−∇Y∇XZ−∇[X,Y]ZR(X,Y)Z=\nabla_X\nabla_YZ-\nabla_Y\nabla_XZ-\nabla_{[X,Y]}ZR(X,Y)Z=∇X​∇Y​Z−∇Y​∇X​Z−∇[X,Y]​Z, a Jacobi field is a smooth vector field JJJ along γ\gammaγ with

Ds2J+R(J,γ˙)γ˙=0.D_s^2J+R(J,\dot\gamma)\dot\gamma=0.Ds2​J+R(J,γ˙​)γ˙​=0.

ggg has no conjugate points if every Jacobi field vanishing at two distinct times vanishes identically. ggg has nonpositive sectional curvature if g(R(u,v)v,u)≤0g(R(u,v)v,u)\le0g(R(u,v)v,u)≤0 for all tangent vectors u,vu,vu,v.

Formalization targets

Goal: Theorem 1.1

∃ M closed, connected, orientable smooth 3-manifold:∃ g without conjugate points,∄ g′ with sec⁡g′≤0.\exists\,M\ \text{closed, connected, orientable smooth 3-manifold}:\quad \exists\,g\ \text{without conjugate points},\quad \nexists\,g'\ \text{with } \sec_{g'}\le0.∃M closed, connected, orientable smooth 3-manifold:∃g without conjugate points,∄g′ with secg′​≤0.

The Lean statement OAI.ThreeManifold.main_theorem is open on the platform.

Significance

The theorem shows that, starting in dimension three, the existence of a metric without conjugate points is strictly weaker than the existence of a nonpositively curved metric, answering the Ivanov–Kapovitch question. The same manifold carries no locally CAT(0) length metric and, by the Ivanov–Kapovitch equivalence, no metric without focal points, so it separates "no conjugate points" from "no focal points" as well. The example is a graph manifold glued from two copies of (punctured torus)×S1\times S^1×S1, exactly the test case Ivanov and Kapovitch proposed.

The result is stated in an OpenAI preprint; it has not been peer reviewed, and no machine-checked proof exists.

Difficulty

Two separate problems must be solved. The obstruction side (no nonpositively curved metric) follows from Leeb's graph-manifold criterion and is group-theoretic. The construction side is analytic: one must build a metric across the gluing neck and prove that every complete geodesic, including those that enter and leave the neck infinitely often at arbitrary angles, has no conjugate points. Nonpositive curvature is not available in the neck, so the Rauch comparison does not apply; the index form must be controlled with endpoint terms uniformly in entry angle, turning height and excursion time.

Formalization scope

  • Manifolds are ChartedSpace (Fin 3 → ℝ) with IsManifold 𝓘(ℝ, Fin 3 → ℝ) ∞, compact, connected, Hausdorff, second countable; orientability is OrientedAtlas (all transition maps have positive Jacobian determinant).
  • Metrics are ContMDiffRiemannianMetric; Christoffel symbols and curvature are computed in every atlas chart from fderiv of the coordinate metric.
  • IsGeodesicOn g γ U asks for a smooth curve satisfying the geodesic equation in every chart on the open interval U; IsJacobiFieldOn asks for chart-smooth fields satisfying the Jacobi equation.
  • NoConjugatePoints g: for every open interval U, geodesic and Jacobi field on U, vanishing at two distinct times forces vanishing on U.
  • NonpositiveSectionalCurvature g: g(R(u,v)v,u)≤0g(R(u,v)v,u)\le0g(R(u,v)v,u)≤0 for all chart points and vectors; the goal asserts no smooth metric on the same smooth manifold has this property.

A complete development needs Riemannian geometry in coordinates, geodesic flows and Jacobi fields, the index form, Cartan–Hadamard/flat torus theorems and the group theory of graph manifolds. Contributions formalizing Theorem 2.1 (no proper cocompact CAT(0) action), Lemma 6.2 (index-form criterion) and Proposition 6.1 (assembly of passage estimates) are welcome.

Selected references

  • OpenAI, A Three-Manifold Without Conjugate Points and Without a Nonpositively Curved Metric, preprint, September 24, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-Three-Manifold-Without-Conjugate-Points-and-Without-a-Nonpositively-Curved-Metric-September-24-2026/paper.pdf
  • S. Ivanov, V. Kapovitch, Manifolds without conjugate points and their fundamental groups, J. Differential Geom., 2014. https://doi.org/10.4310/jdg/1393424918
  • K. Burns, V. S. Matveev, Open problems and questions about geodesics, Ergodic Theory Dynam. Systems, 2021. https://doi.org/10.1017/etds.2019.73
  • R. Gulliver, On the variety of manifolds without conjugate points, Trans. Amer. Math. Soc., 1975. https://doi.org/10.1090/S0002-9947-1975-0383294-0
  • B. Leeb, 3-manifolds with(out) metrics of nonpositive curvature, Invent. Math., 1995. https://doi.org/10.1007/BF01231445
  • M. Kapovich, B. Leeb, Actions of discrete groups on nonpositively curved spaces, Math. Ann., 1996. https://doi.org/10.1007/BF01445254
  • J. Milnor, Morse Theory, Princeton University Press, 1963.
31 thms2 active usersReviewed
🏆Completed
Algebraic TopologyCategory TheoryMathematical Physics·Captain: Alien60

Gauge Functors on a Finite Graph: The Holonomy Equivalence for Non-Abelian Gauge TheoryResearch Paper

Motivation

A gauge theory can be formulated in several mathematically different ways: with potentials (connections), with field strengths (curvature), or with holonomies, the parallel transports around closed loops. Philosophers and physicists ask whether these formulations say the same thing, and which one carries "surplus structure".

Category theory makes the question precise. Each formulation is a category of models, and each translation between formulations is a functor. A functor that is faithful and essentially surjective but not full forgets structure. One that is full and faithful but not essentially surjective forgets properties. One that is full and essentially surjective but not faithful forgets stuff. One that is all three forgets nothing and is an equivalence. This taxonomy is due to Baez, Bartels and Dolan (Baez–Shulman, §2.4).

Weatherall (2016) applied it to electromagnetism. Potentials without gauge arrows forget structure relative to field strengths (Proposition 1). The erratum in arXiv v2 (p. 15) corrects his Proposition 2: the principal-bundle formulation, whose arrows include gauge transformations, forgets only stuff, not nothing. Nguyen, Teh and Wells obtain the same verdict for the gauge-orbit functor (their Proposition 3.2.3). In their footnote 26 they identify the forgotten stuff as the constant ("global") gauge transformations. All of this is abelian, U(1) on a contractible spacetime.

The non-abelian counterpart is the holonomy formulation. Barrett's reconstruction and representation theorems, and their categorical upgrade by Rosenstock and Weatherall (Theorem 2), show that on a connected manifold, principal connections and generalized holonomy maps form equivalent categories. On the topological side, Freed and Quinn (eqs. 3.11–3.13) identify the automorphisms of a finite-group gauge field with a centralizer.

This mission states these results for an arbitrary group GGG on a finite graph. There the smooth and topological subtleties disappear, but the categorical content survives intact.

Setting

A finite directed graph XXX has vertices Fin nV\mathrm{Fin}\,n_VFinnV​, edges Fin nE\mathrm{Fin}\,n_EFinnE​, and maps src,tgt\mathrm{src},\mathrm{tgt}src,tgt. A step is an edge traversed forwards or backwards, and a walk x→yx \to yx→y is a list of steps whose endpoints chain. XXX is connected from xxx if every vertex is reached by a walk from xxx.

  • A connection is A:E→GA : E \to GA:E→G. Its holonomy along a walk is the ordered product of A(e)A(e)A(e) (forwards) and A(e)−1A(e)^{-1}A(e)−1 (backwards), as in Baez (1996), §2.
  • A gauge transformation is g:V→Gg : V \to Gg:V→G, acting by (g⋅A)(e)=g(src e) A(e) g(tgt e)−1(g\cdot A)(e) = g(\mathrm{src}\,e)\,A(e)\,g(\mathrm{tgt}\,e)^{-1}(g⋅A)(e)=g(srce)A(e)g(tgte)−1.
  • PotG\mathsf{PotG}PotG: objects are connections, and arrows A→BA \to BA→B are gauge transformations with g⋅A=Bg\cdot A = Bg⋅A=B. This is the discrete analogue of the groupoid CAC_ACA​ of Nguyen–Teh–Wells.
  • HolMapx\mathsf{HolMap}_xHolMapx​: a holonomy map at xxx assigns a group element to each walk. It is multiplicative on loops at xxx and unchanged when a backtrack s,sˉs, \bar ss,sˉ is inserted into a loop at xxx; this is the discrete form of thin equivalence. Arrows H→H′H \to H'H→H′ are elements hhh with H′(γ)=h H(γ) h−1H'(\gamma) = h\,H(\gamma)\,h^{-1}H′(γ)=hH(γ)h−1 on every loop at xxx. Only values on loops at xxx matter.
  • Functors. holx:PotG→HolMapx\mathrm{hol}_x : \mathsf{PotG} \to \mathsf{HolMap}_xholx​:PotG→HolMapx​ sends A↦holAA \mapsto \mathrm{hol}_AA↦holA​ and g↦g(x)g \mapsto g(x)g↦g(x). orbit\mathrm{orbit}orbit sends PotG\mathsf{PotG}PotG to the discrete category of gauge orbits.
  • Curvature. On a 2-complex, each face has a base vertex and a boundary loop. The curvature functor sends AAA to the family of conjugacy classes of its face holonomies, which is the gauge-invariant non-abelian field strength.

Formalization targets

Goal: the holonomy functor is an equivalence

X connected from x  ⟹  holx is full, faithful and essentially surjective.X \text{ connected from } x \;\Longrightarrow\; \mathrm{hol}_x \text{ is full, faithful and essentially surjective.}X connected from x⟹holx​ is full, faithful and essentially surjective.

This is the discrete, fixed-base-point form of Rosenstock–Weatherall's Theorem 2. In the taxonomy above, potentials-with-gauge and holonomies forget nothing relative to each other. The statement holds for every group GGG, finite or not. The base-point-changing arrows of Rosenstock–Weatherall are not included.

Milestones

  1. Faithful. A gauge arrow between two connections is determined by its value at xxx.
  2. Full. Every conjugation relating the holonomy maps of AAA and BBB is realized by a gauge transformation.
  3. Barrett reconstruction. Every holonomy map at xxx equals holA\mathrm{hol}_AholA​ on all loops at xxx, for some connection AAA.
  4. Barrett representation. holA=holB\mathrm{hol}_A = \mathrm{hol}_BholA​=holB​ on loops at xxx iff B=g⋅AB = g\cdot AB=g⋅A for a gauge transformation with g(x)=1g(x) = 1g(x)=1, and that ggg is unique.
  5. Stabilizer = centralizer. Evaluation at xxx is a bijection from the gauge stabilizer of AAA onto the centralizer of its holonomies at xxx. This is the non-abelian H0H^0H0, the discrete form of Freed–Quinn (3.11)–(3.13).
  6. The orbit functor forgets only stuff. It is full and essentially surjective. It is faithful iff XXX has no vertices or GGG is trivial. This is the discrete form of Nguyen–Teh–Wells Proposition 3.2.3 and of Weatherall's corrected Proposition 2.
  7. Aharonov–Bohm. Take GGG nontrivial, abelian or not. On the boundary of a triangle, which has no faces, the curvature functor is not full: flat connections with different holonomy are not gauge-equivalent. On the filled triangle the curvature functor is full and essentially surjective but not faithful.

Significance

  • Equivalence of formulations. The goal says that, once gauge transformations are arrows, the potential and holonomy formulations of non-abelian lattice gauge theory are categorically equivalent. This is the precise sense in which "the physics is in the holonomies".
  • Stuff and global symmetry. Milestones 5–6 locate the forgotten stuff exactly. When potentials are compared with gauge-invariant data that lacks arrows, the stuff is the centralizer of the holonomy group, the global gauge symmetry that survives a choice of connection. In the abelian case this is Nguyen–Teh–Wells' footnote 26. In general it is the automorphism group that weights the Dijkgraaf–Witten / Freed–Quinn sum.
  • Topology. Milestone 7 shows that on a non-simply-connected graph the curvature formulation also forgets structure. Weatherall's footnote 9 sets this situation aside for Minkowski space.
  • Novelty. Each ingredient is classical in some setting. A machine-checked statement of the non-abelian classification on finite graphs, in the language of forgetful functors, does not appear to exist. It is a step towards treating the theories-as-categories programme formally.

Difficulty

  • Combinatorics of walks. Lists of steps, their endpoint conditions, and the interaction of concatenation with backtracking all have to be handled explicitly. The goal and Milestones 1–4 need statements about walks between arbitrary vertices, not only loops.
  • Essential surjectivity. Reconstruction has to produce a connection from data that is only constrained on loops at one vertex. Connectivity enters non-trivially.
  • Faithfulness versus fullness. These use the hypotheses differently, and the boundary cases (empty graph, trivial group) have to be tracked.
  • Milestone 7 needs explicit non-equivalences, and so a gauge invariant separating gauge orbits.

Formalization scope

  • Graphs. These are finite directed graphs with Fin-indexed cells and are not required to be simple. Loops and multiple edges are allowed. A 2-complex adds faces with a base vertex and a boundary walk proved to be a loop.
  • Groups. GGG is any Group; finiteness is not assumed.
  • Holonomy maps. These are functions on all lists of steps whose axioms only constrain loops at xxx. Two maps agreeing on loops are isomorphic in HolMapx\mathsf{HolMap}_xHolMapx​ (via h=1h = 1h=1) but need not be equal. Reconstruction is therefore stated on loops.
  • Functor properties. These are Mathlib's Functor.Full, Functor.Faithful and Functor.EssSurj. The goal is their conjunction, not an explicitly constructed inverse.
  • Excluded. Spacetime symmetries (graph automorphisms), base-point-changing holonomy isomorphisms, and smooth or continuum statements are left out.
  • Proved in the definitions. Gauge covariance of holonomy along walks is proved in the definitions file, because the functors require it.

Selected references

  • J. O. Weatherall, "Understanding Gauge", Philosophy of Science 83 (2016) 1039–1049. arXiv:1505.02229. arXiv v2 includes the erratum to Proposition 2 (p. 15).
  • J. Nguyen, N. J. Teh, L. Wells, "Why surplus structure is not superfluous", British Journal for the Philosophy of Science 71 (2020). arXiv:1712.01228
  • S. Rosenstock, J. O. Weatherall, "A categorical equivalence between generalized holonomy maps on a connected manifold and principal connections on bundles over that manifold", J. Math. Phys. 57 (2016) 102902. arXiv:1504.02401
  • D. S. Freed, F. Quinn, "Chern–Simons theory with finite gauge group", Comm. Math. Phys. 156 (1993) 435–472. arXiv:hep-th/9111004
  • J. C. Baez, M. Shulman, "Lectures on n-categories and cohomology", in Towards Higher Categories, Springer (2010) 1–68. arXiv:math/0608420
  • J. C. Baez, "Spin network states in gauge theory", Adv. Math. 117 (1996) 253–272. arXiv:gr-qc/9411007
10 thms1 active userReviewed
🏆Completed
Algebraic TopologyCategory TheoryMathematical Physics·Captain: Alien60

Weatherall 2016: Potentials vs. Field Strengths on a Finite 2-ComplexResearch Paper

Motivation

Philosophers of physics ask when a formulation of a theory carries excess structure: mathematical distinctions between models that make no physical difference. The standard example is electromagnetism written with a vector potential AAA. Potentials that differ by a gauge transformation A↦A+dλA \mapsto A + d\lambdaA↦A+dλ have the same field strength F=dAF = dAF=dA, and on the usual view they represent the same physical situation.

Weatherall (2016) made this precise with category theory. Each formulation becomes a category of models, and a translation between formulations becomes a functor. A functor that is faithful and essentially surjective but not full forgets structure. One that is full and faithful but not essentially surjective forgets properties. One that is full and essentially surjective but not faithful forgets stuff. Weatherall's Proposition 1 says the functor A↦dAA \mapsto dAA↦dA from potentials to field strengths forgets only structure, provided the arrows between potentials are spacetime symmetries that preserve AAA. His Proposition 2 says the principal-bundle formulation, whose arrows include gauge transformations, forgets nothing. His footnote 15 notes that adding gauge transformations as arrows between potentials yields a category equivalent to that of field strengths (Weatherall, arXiv:1411.5757).

These arguments work on Minkowski space, which is contractible. Weatherall's footnote 9 sets topology aside for that reason. The follow-up literature, for example Nguyen, Teh and Wells (2018), compares these and related functors further. This mission states the comparison exactly on a finite cell complex, where topology cannot be set aside. Each of the three ways a functor can forget information then corresponds to one cohomology group.

Setting

A finite oriented 2-complex XXX has nVn_VnV​ vertices, nEn_EnE​ edges and nPn_PnP​ faces, together with integer incidence numbers ∂1(e,v)\partial_1(e,v)∂1​(e,v) and ∂2(p,e)\partial_2(p,e)∂2​(p,e) satisfying ∑e∂2(p,e) ∂1(e,v)=0\sum_e \partial_2(p,e)\,\partial_1(e,v) = 0∑e​∂2​(p,e)∂1​(e,v)=0 for every face ppp and vertex vvv. Nothing beyond this identity is required, so the incidence data need not come from a geometric complex; all results hold for any such integer data. Fix an additive commutative group KKK of coefficients, for example Z\mathbb{Z}Z, R\mathbb{R}R, or Z/n\mathbb{Z}/nZ/n as a discrete stand-in for U(1)U(1)U(1). The cochains are C0=KVC^0 = K^{V}C0=KV (gauge parameters λ\lambdaλ), C1=KEC^1 = K^{E}C1=KE (potentials AAA) and C2=KPC^2 = K^{P}C2=KP (field strengths FFF). The coboundaries are

(δ0λ)(e)=∑v∂1(e,v) λ(v),(δ1A)(p)=∑e∂2(p,e) A(e),(\delta^0\lambda)(e) = \sum_v \partial_1(e,v)\,\lambda(v), \qquad (\delta^1 A)(p) = \sum_e \partial_2(p,e)\,A(e),(δ0λ)(e)=v∑​∂1​(e,v)λ(v),(δ1A)(p)=e∑​∂2​(p,e)A(e),

and δ1δ0=0\delta^1\delta^0 = 0δ1δ0=0.

There are three categories, with spacetime symmetries taken to be trivial:

  • Fld\mathsf{Fld}Fld (Weatherall's EM1): its objects are the 2-cochains FFF, and its only arrows are identities.
  • Pot0\mathsf{Pot}_0Pot0​ (Weatherall's EM2): its objects are the 1-cochains AAA, and its only arrows are identities.
  • PotG\mathsf{Pot}_GPotG​ (potentials with gauge arrows): its objects are the 1-cochains AAA. An arrow A→A′A \to A'A→A′ is a gauge parameter λ∈C0\lambda \in C^0λ∈C0 with A+δ0λ=A′A + \delta^0\lambda = A'A+δ0λ=A′, and composition adds the parameters. Arrows are the parameters λ\lambdaλ themselves, so two parameters differing by an element of ker⁡δ0\ker\delta^0kerδ0 (e.g. a constant) are distinct arrows, just as distinct vertical automorphisms are distinct arrows in Weatherall's bundle category EM3. This is the category of his footnote 15.

The field-strength functors Pot0→Fld\mathsf{Pot}_0 \to \mathsf{Fld}Pot0​→Fld and PotG→Fld\mathsf{Pot}_G \to \mathsf{Fld}PotG​→Fld send A↦δ1AA \mapsto \delta^1 AA↦δ1A. In the second functor every gauge arrow goes to an identity.

Cohomology vanishing is stated elementarily:

  • H0=0H^0 = 0H0=0 means δ0λ=0⇒λ=0\delta^0\lambda = 0 \Rightarrow \lambda = 0δ0λ=0⇒λ=0.
  • H1=0H^1 = 0H1=0 means every AAA with δ1A=0\delta^1 A = 0δ1A=0 equals δ0λ\delta^0\lambdaδ0λ for some λ\lambdaλ.
  • H2=0H^2 = 0H2=0 means every FFF equals δ1A\delta^1 Aδ1A for some AAA.

Formalization targets

Goal: the cohomological classification

For every finite 2-complex XXX and coefficient group KKK, the functor PotG→Fld\mathsf{Pot}_G \to \mathsf{Fld}PotG​→Fld satisfies

faithful  ⟺  H0=0,full  ⟺  H1=0,essentially surjective  ⟺  H2=0.\text{faithful} \iff H^0 = 0,\qquad \text{full} \iff H^1 = 0,\qquad \text{essentially surjective} \iff H^2 = 0.faithful⟺H0=0,full⟺H1=0,essentially surjective⟺H2=0.

Milestones

  1. Proposition 1 analogue. If some δ0λ≠0\delta^0\lambda \neq 0δ0λ=0, then Pot0→Fld\mathsf{Pot}_0 \to \mathsf{Fld}Pot0​→Fld is faithful and not full, and it is essentially surjective iff H2=0H^2 = 0H2=0.
  2. Faithful iff H0=0H^0 = 0H0=0.
  3. Full iff H1=0H^1 = 0H1=0.
  4. Essentially surjective iff H2=0H^2 = 0H2=0.
  5. Aharonov–Bohm. On the triangle boundary circle3 with Z\mathbb{Z}Z coefficients, the potential equal to 111 on one edge has the same field strength as 000. No gauge arrow connects the two, so the functor is not full.
  6. Forgetting only stuff. On the filled triangle with Z\mathbb{Z}Z coefficients, the functor is full and essentially surjective but not faithful.

Significance

The result. The classification turns a qualitative philosophical diagnostic into a cohomological criterion.

  • Structure: Weatherall's "forgets structure" verdict for potentials without gauge arrows is the statement that ker⁡δ1≠0\ker\delta^1 \neq 0kerδ1=0.
  • Topology: once gauge arrows are added, whether any structure is still forgotten is exactly the question whether H1≠0H^1 \neq 0H1=0. A nonzero H1H^1H1 is the Aharonov–Bohm situation, in which potentials with equal field strength differ by a gauge-invariant holonomy.
  • Stuff: the clause faithful  ⟺  H0=0\text{faithful} \iff H^0 = 0faithful⟺H0=0 shows that on a geometric complex (every edge has boundary head minus tail) with at least one vertex and K≠0K \neq 0K=0, constant gauge parameters are non-identity automorphisms that the functor sends to identities. The functor therefore forgets stuff. This contrasts with the faithfulness clause of Weatherall's Proposition 2 for the bundle formulation, where the analogous constant vertical automorphisms are the subtle case.

Formalizing it. No machine-checked version of the theories-as-categories programme for gauge theory is known to the author of this mission. This mission is the base case of a planned discrete gauge-functor development: non-abelian groups, nontrivial symmetry groups, and holonomy-based equivalences.

Difficulty

The mathematics is elementary once stated. The work is in making the categorical notions line up with the cochain conditions. Three points need care:

  • In a discrete category, an isomorphism is an equality.
  • Fullness must be tested against arrows between arbitrary pairs of potentials, not only potentials with zero field strength.
  • Faithfulness concerns parallel gauge arrows, which differ exactly by elements of ker⁡δ0\ker\delta^0kerδ0.

The concrete milestones require computations on explicit complexes, including a gauge-invariant obstruction for the Aharonov–Bohm example.

Formalization scope

  • Complexes. Cells are indexed by Fin types, and the incidence numbers are integer-valued. The complex is finite but may be empty in any dimension.
  • Coefficients. KKK is any AddCommGroup, and integers act on it by zsmul.
  • Categories. Fld and Pot0 are Mathlib Discrete categories. PotG carries a hand-written Category instance whose arrows are the structure GaugeHom.
  • Functor properties. Fullness, faithfulness and essential surjectivity are Mathlib's Functor.Full, Functor.Faithful and Functor.EssSurj.
  • Symmetries. Spacetime symmetries are fixed to be trivial, so the results compare categories of potentials and fields over a fixed complex.
  • Non-triviality. The cohomology conditions are explicit Props about the coboundaries, so none of them is a definition that makes a target hold trivially. The hypothesis of Milestone 1 excludes the degenerate case δ0=0\delta^0 = 0δ0=0, in which that functor is full.
  • Infrastructure. The cochain API (delta0, delta1, δ1δ0=0\delta^1\delta^0 = 0δ1δ0=0) is proved in the definitions file and is reusable for discrete gauge theory and toric-code missions.

Selected references

  • J. O. Weatherall, "Understanding Gauge", Philosophy of Science 83 (2016) 1039–1049. arXiv:1505.02229, doi:10.1086/687936
  • J. O. Weatherall, "Are Newtonian Gravitation and Geometrized Newtonian Gravitation Theoretically Equivalent?". arXiv:1411.5757
  • J. Nguyen, N. J. Teh, L. Wells, "Why surplus structure is not superfluous", British Journal for the Philosophy of Science 71 (2020). arXiv:1712.01228
8 thms1 active userReviewed
🏆Completed
Differential GeometrySymplectic Geometry·Captain: Mazecto

Gray's Stability Theorem for Contact StructuresResearch Paper

Motivation

A contact structure on a manifold of odd dimension 2k+12k+12k+1 is a field of hyperplanes ξ=ker⁡α\xi=\ker\alphaξ=kerα that is as far from integrable as possible. Contact structures are the odd-dimensional counterpart of symplectic forms. They arise on every star-shaped energy level of a Hamiltonian system, on unit cotangent bundles (geodesic flows), and on links of singularities. They are the setting of Reeb dynamics and of the Weinstein conjecture.

Gray's stability theorem says that on a closed manifold contact structures have no local moduli. If ξt\xi_tξt​, t∈[0,1]t\in[0,1]t∈[0,1], is a smooth family of contact structures, there is an isotopy ψt\psi_tψt​ with Tψt(ξ0)=ξtT\psi_t(\xi_0)=\xi_tTψt​(ξ0​)=ξt​. A contact structure can therefore be deformed only within its isotopy class, and every classification of contact structures (tight versus overtwisted, Eliashberg's classification on S3S^3S3) is a classification up to isotopy because of it.

Timeline.

  • 1959. Gray proves stability with deformation theory in the style of Kodaira–Spencer (Ann. of Math. 69).
  • 1965. Moser proves the analogous stability for volume forms by integrating a time-dependent vector field, now called the Moser trick (Trans. AMS 120).
  • Later. The Moser trick becomes the standard proof of Gray's theorem. Geiges' survey gives a short complete proof (arXiv:math/0307242, Theorem 2.20), which is the source of this mission. Its remarks record the limits of the statement: contact forms are not stable (Remark 2.21(1)), and on the open manifold S1×R2S^1\times\mathbb{R}^2S1×R2 stability fails (Remark 2.21(2), after Eliashberg).

Setting

The closed manifold is a compact submanifold of Euclidean space. Let F:Rn→RcF:\mathbb{R}^n\to\mathbb{R}^cF:Rn→Rc be smooth, let M=F−1(0)M=F^{-1}(0)M=F−1(0) be compact, and assume DF(y)DF(y)DF(y) is surjective for every y∈My\in My∈M. Then MMM is a closed smooth manifold of dimension n−cn-cn−c with tangent spaces

TyM=ker⁡DF(y).T_yM=\ker DF(y).Ty​M=kerDF(y).

A one-form is a smooth map α:Rn→(Rn)∗\alpha:\mathbb{R}^n\to(\mathbb{R}^n)^*α:Rn→(Rn)∗, restricted to TMTMTM. Its exterior derivative is

dαy(u,v)=Dαy(u)(v)−Dαy(v)(u).d\alpha_y(u,v)=D\alpha_y(u)(v)-D\alpha_y(v)(u).dαy​(u,v)=Dαy​(u)(v)−Dαy​(v)(u).
  • Contact form. α\alphaα is a contact form on MMM if at every y∈My\in My∈M the covector αy\alpha_yαy​ is nonzero on TyMT_yMTy​M and dαyd\alpha_ydαy​ is non-degenerate on the hyperplane
ξy=TyM∩ker⁡αy.\xi_y=T_yM\cap\ker\alpha_y.ξy​=Ty​M∩kerαy​.

This is the condition α∧(dα)k≠0\alpha\wedge(d\alpha)^k\neq0α∧(dα)k=0 in the form of Geiges' Remark 2.3. It forces dim⁡M\dim MdimM to be odd. The contact structure is ξ=ker⁡α\xi=\ker\alphaξ=kerα. Contact structures are cooriented throughout, as in Geiges' standing assumption (§2).

  • Smooth family. A family αt\alpha_tαt​ is smooth if (t,y)↦αt(y)(t,y)\mapsto\alpha_t(y)(t,y)↦αt​(y) is smooth. It is a family of contact forms if each αt\alpha_tαt​, t∈[0,1]t\in[0,1]t∈[0,1], is a contact form on MMM.
  • Isotopy. An isotopy of MMM is a smooth map (t,y)↦ψt(y)(t,y)\mapsto\psi_t(y)(t,y)↦ψt​(y) with ψ0=id\psi_0=\mathrm{id}ψ0​=id on MMM, such that each ψt\psi_tψt​, t∈[0,1]t\in[0,1]t∈[0,1], maps MMM bijectively onto MMM with injective differential on TMTMTM, i.e. is a diffeomorphism of MMM.
  • Pull-back. (ψt∗α)y(v)=αψt(y)(Dψt(y) v)(\psi_t^*\alpha)_y(v)=\alpha_{\psi_t(y)}(D\psi_t(y)\,v)(ψt∗​α)y​(v)=αψt​(y)​(Dψt​(y)v).

Formalization targets

Goal: Gray stability (Theorem 2.20)

For every smooth family of contact forms αt\alpha_tαt​, t∈[0,1]t\in[0,1]t∈[0,1], on MMM there is an isotopy ψt\psi_tψt​ of MMM with

Tψt(ξ0)=ξt(t∈[0,1]),ξt=ker⁡αt,T\psi_t(\xi_0)=\xi_t\qquad(t\in[0,1]),\qquad\xi_t=\ker\alpha_t,Tψt​(ξ0​)=ξt​(t∈[0,1]),ξt​=kerαt​,

stated pointwise: for v∈TyMv\in T_yMv∈Ty​M, α0(v)=0\alpha_0(v)=0α0​(v)=0 iff αt(Dψt(y)v)=0\alpha_t(D\psi_t(y)v)=0αt​(Dψt​(y)v)=0.

The goal concerns the contact structures. It fixes no normalization of the forms and no dimension.

Stronger: conformal form

The same isotopy can be chosen with smooth functions λt>0\lambda_t>0λt​>0 such that

ψt∗αt=λt α0on TM.\psi_t^*\alpha_t=\lambda_t\,\alpha_0\quad\text{on }TM.ψt∗​αt​=λt​α0​on TM.

Stronger: stationary points (Remark 2.21(3))

Moreover, every point p∈Mp\in Mp∈M at which α˙t\dot\alpha_tα˙t​ vanishes on TpMT_pMTp​M for all ttt stays fixed: ψt(p)=p\psi_t(p)=pψt​(p)=p.

Significance

The result. Gray stability is the basic rigidity statement of contact topology.

  • It reduces the classification of contact structures to isotopy classes, so invariants of a contact manifold are constant along deformations.
  • It is the first step of many local normal forms: Darboux's theorem and the neighbourhood theorems for Legendrian and transverse submanifolds are proved by applying it, or its proof, near a submanifold (Geiges §2.4–2.5).
  • In Hamiltonian dynamics it identifies the contact structures of a continuous family of star-shaped energy levels. Topological invariants of transverse periodic orbits, such as the self-linking number, are then constant along the family.

Formalizing it. The theorem is classical and has a short proof on paper. Mathlib, at the revision used here, has no differential forms on manifolds, no Lie derivative, no global flows of time-dependent vector fields on compact submanifolds, and no contact structures. The mission builds these concretely on submanifolds of Rn\mathbb{R}^nRn:

  • one-forms, their exterior derivative and pull-back;
  • the derivative of a pulled-back family along a flow (Lemma 2.19);
  • the pointwise linear algebra of a contact form: the Reeb vector, and the unique solution of the Moser equation;
  • global flows of smooth time-dependent vector fields tangent to a compact submanifold.

All of these are reusable for Moser's theorem on volume and symplectic forms and for the Darboux and neighbourhood theorems.

Difficulty

The proof is soft, but two steps are not formal.

  1. Solving for the vector field. Writing ψt\psi_tψt​ as the flow of XtX_tXt​, the equation ψt∗αt=λtα0\psi_t^*\alpha_t=\lambda_t\alpha_0ψt∗​αt​=λt​α0​ becomes
α˙t+iXtdαt=μtαt,Xt∈ξt.\dot\alpha_t+i_{X_t}d\alpha_t=\mu_t\alpha_t,\qquad X_t\in\xi_t.α˙t​+iXt​​dαt​=μt​αt​,Xt​∈ξt​.

It has a unique solution at each point, but only because dαtd\alpha_tdαt​ is non-degenerate on ξt\xi_tξt​ and the Reeb vector spans the kernel of dαt∣TMd\alpha_t|_{TM}dαt​∣TM​. The solution must also depend smoothly on (t,y)(t,y)(t,y) and be tangent to MMM; the ambient form αt\alpha_tαt​ is in general not contact off MMM. 2. Integrating it. The isotopy is the flow of XtX_tXt​, which must exist for all t∈[0,1]t\in[0,1]t∈[0,1] and stay on MMM. Compactness of MMM enters exactly here. On open manifolds the statement is false (Remark 2.21(2)).

The tempting shortcut of asking for ψt∗αt=α0\psi_t^*\alpha_t=\alpha_0ψt∗​αt​=α0​ does not work. Contact forms themselves are not stable, as the Hopf family on S3S^3S3 shows (Remark 2.21(1)), and the conformal factor λt\lambda_tλt​ cannot be dropped.

Formalization scope

  • Representation.
    • Rn\mathbb{R}^nRn is Fin n → ℝ; MMM is a compact regular level set F−1(0)F^{-1}(0)F−1(0) of a smooth F:Rn→RcF:\mathbb{R}^n\to\mathbb{R}^cF:Rn→Rc.
    • One-forms are maps Rn→(Rn→LR)\mathbb{R}^n\to(\mathbb{R}^n\to_L\mathbb{R})Rn→(Rn→L​R), smooth families are jointly smooth in (t,y)(t,y)(t,y) on R×Rn\mathbb{R}\times\mathbb{R}^nR×Rn, and dαd\alphadα is the antisymmetrized derivative.
    • An isotopy is a jointly smooth ψ:R×Rn→Rn\psi:\mathbb{R}\times\mathbb{R}^n\to\mathbb{R}^nψ:R×Rn→Rn that restricts, for t∈[0,1]t\in[0,1]t∈[0,1], to diffeomorphisms of MMM.
  • Committed conventions.
    • Contact structures are cooriented, i.e. given by global contact forms.
    • The contact condition is the non-degeneracy of dαd\alphadα on ξ\xiξ (Remark 2.3), not a wedge power.
    • Only the restrictions to TMTMTM and the values for t∈[0,1]t\in[0,1]t∈[0,1] matter.
  • Scope relative to the source. Every closed manifold embeds in some Rn\mathbb{R}^nRn, but not every closed manifold is a regular level set, since that requires a trivial normal bundle. The targets cover regular level sets, including all spheres and all star-shaped energy levels. The abstract version on any closed manifold is outside the targets until Mathlib has differential forms on manifolds.
  • Ruling out vacuous encodings. The isotopy must start at the identity on MMM, map MMM onto MMM for every t∈[0,1]t\in[0,1]t∈[0,1], and be a diffeomorphism there. Dropping any of these makes the goal trivial; for instance, the constant isotopy satisfies the goal whenever all ξt\xi_tξt​ agree. The Hopf family milestone checks that the contact condition is satisfiable and that the conformal factor is necessary.
  • Contributions welcome. The linear-algebra milestones (Reeb vector, Moser equation), Lemma 2.19, global flows on compact level sets, and the Hopf-family example. Moser's theorem for volume forms would be a natural sibling result built on the same infrastructure.

Selected references

  • J. W. Gray, Some global properties of contact structures, Ann. of Math. 69 (1959), 421–450. https://doi.org/10.2307/1970192
  • H. Geiges, Contact geometry, in Handbook of Differential Geometry, Vol. II, Elsevier (2006), 315–382; §2.2, Lemma 2.19, Theorem 2.20, Remark 2.21. https://arxiv.org/abs/math/0307242
  • H. Geiges, An Introduction to Contact Topology, Cambridge Stud. Adv. Math. 109, Cambridge Univ. Press (2008), §2.2. https://doi.org/10.1017/CBO9780511611438
  • J. Moser, On the volume elements on a manifold, Trans. Amer. Math. Soc. 120 (1965), 286–294. https://doi.org/10.1090/S0002-9947-1965-0182927-5
  • Y. Eliashberg, Contact 3-manifolds twenty years since J. Martinet's work, Ann. Inst. Fourier 42 (1992), 165–192. https://doi.org/10.5802/aif.1288
39 thms1 active userReviewed
🏆Completed
Group Theory·Captain: dbenbenn

Garrido Amenable Groups III: The Grigorchuk GroupTextbook

This mission formalizes A. Garrido, An introduction to amenable groups, lecture notes from four talks at the Oxford Advanced Class in Algebra, Michaelmas 2013 (archived PDF) — its Section 4, the (first) Grigorchuk group and its solution of half of the von Neumann–Day problem.

Motivation

The first two Garrido missions, Amenable Groups I and Amenable Groups II (the Banach–Tarski paradox), established the inclusions EG⊆AG⊆NFEG \subseteq AG \subseteq NFEG⊆AG⊆NF between the elementary amenable groups, the amenable groups, and the groups with no free subgroup of rank two. "The von Neumann–Day problem asks whether these inclusions are strict" (p. 12). Ol'shanskii settled AG≠NFAG \neq NFAG=NF; "The other part of the problem was solved in 1985 by Grigorchuk" (p. 12), with the theorem this mission targets.

Chou's theorem that every torsion group in EGEGEG is locally finite "traces a clear route for solving the Day problem. Namely, it suffices to find an amenable torsion group which is not locally finite" (p. 13). The Grigorchuk group is such a group: a finitely generated, infinite group of automorphisms of the binary tree in which every element has order a power of 222, and whose growth is subexponential, so that it is amenable.

Setting

The infinite rooted binary tree TTT has as vertices the finite words in {0,1}\{0, 1\}{0,1}, and its automorphisms are the permutations of the vertices that preserve length and prefixes. The Grigorchuk group Γ\GammaΓ is generated by four of them: aaa exchanges the two subtrees below the root, and bbb, ccc, ddd fix the first level and are defined recursively by b=(a,c)b = (a, c)b=(a,c), c=(a,d)c = (a, d)c=(a,d), d=(1,b)d = (1, b)d=(1,b), meaning that bbb acts on the subtree below 000 as aaa and on the subtree below 111 as ccc, and so on.

St(n)St(n)St(n) is the subgroup of Γ\GammaΓ fixing every vertex of level nnn. An element g∈St(n)g \in St(n)g∈St(n) acts on each of the 2n2^n2n subtrees below level nnn as a tree automorphism, its section there. ψn\psi_nψn​ sends ggg to the tuple of these sections, and for g∈St(3)g \in St(3)g∈St(3), gijkg_{ijk}gijk​ is its section below the vertex ijkijkijk. l(g)l(g)l(g) is the word length with respect to {a,b,c,d}\{a, b, c, d\}{a,b,c,d}.

Formalization targets

Goal — Theorem 4.1

"The (first) Grigorchuk group Γ\GammaΓ is amenable but not elementary amenable" (p. 12). This is the goal because it is the theorem the section proves and the one that separates EGEGEG from AGAGAG.

The structure of Γ\GammaΓ — p. 14

Conjugation by aaa exchanges the two sections of an element of St(1)St(1)St(1); {1,b,c,d}\{1, b, c, d\}{1,b,c,d} is a Klein four-group and St(1)St(1)St(1) is generated by b,c,ba,cab, c, b^a, c^ab,c,ba,ca; Γ\GammaΓ is infinite, since St(1)St(1)St(1) maps onto it; and the maps ψn:St(n)→Γ2n\psi_n : St(n) \to \Gamma^{2^n}ψn​:St(n)→Γ2n are monomorphisms.

Not elementary amenable — Proposition 4.7

Every element of Γ\GammaΓ has order a power of 222, so Γ\GammaΓ is an infinite finitely generated torsion group and, by Chou's Theorem 4.2, not in EGEGEG. The notes omit the proof of Proposition 4.7 and refer to de la Harpe's book; it is a milestone to be proved here.

Amenable — Lemma 4.8 and Theorem 4.9

The length contraction ∑ijkl(gijk)≤34l(g)+8\sum_{ijk} l(g_{ijk}) \le \frac34 l(g) + 8∑ijk​l(gijk​)≤43​l(g)+8 for g∈St(3)g \in St(3)g∈St(3), the index ∣Γ:St(3)∣=27|\Gamma : St(3)| = 2^7∣Γ:St(3)∣=27, and a general inequality comparing the balls of a group with those of a subgroup of finite index give subexponential growth (Theorem 4.9); Theorem 3.8 of the first Garrido mission then gives amenability.

Significance

The Grigorchuk group is one of the central examples of geometric group theory: the first group of intermediate growth, a finitely generated infinite torsion group, and the separation of amenable from elementary amenable groups. Neither Mathlib nor the platform has it, and a search of Lean Pool, Tau Ceti and the Palomar registry found no formalization; Mathlib's only mention is a bibliography entry in its Schreier-graph file. The tree-automorphism definitions here are reusable for other groups acting on the binary tree. Nothing here is a new mathematical result: all of it is classical, and the work is formalization.

Difficulty

Lemma 4.8 is the hard step: a careful count, over three levels of sections, of how a shortest word shrinks and how many cancellations occur. Proposition 4.7 has no proof in the notes; the standard argument is an induction on word length through the sections. The growth argument of Theorem 4.9 is an estimate on lim⁡kγ(k)1/k\lim_k \gamma(k)^{1/k}limk​γ(k)1/k built from Lemma 4.8 and the ball inequality.

Formalization scope

The tree is modelled by its vertices, List Bool, and Γ\GammaΓ is a subgroup of the group of tree automorphisms, following the notes' "a group of automorphisms of TTT". The generators are defined by Garrido's recursion, and the bundle proves that each is an involutive automorphism; sections are defined for every automorphism and every vertex, with a proof that they are automorphisms. The sections of St(1)St(1)St(1) and St(n)St(n)St(n) are shown to lie in Γ\GammaΓ as part of the ψn\psi_nψn​ milestone rather than assumed.

One trivialising formalization is ruled out: Γ\GammaΓ is not taken to be an abstract group given by a presentation or by fiat, but the concrete group of tree automorphisms the notes define, so that the finiteness, torsion and growth statements are about that group.

What is left out

Definition 4.4 and Lemma 4.5, the ordinal hierarchy EGαEG_\alphaEGα​, and Theorem 4.3 are covered by the Chou 1980 mission, which proved Theorem 4.3 with an inductive predicate in place of the ordinals; Theorem 4.2 enters as a reference. Ol'shanskii's AG≠NFAG \neq NFAG=NF is outside the notes' scope ("beyond the scope of these talks", p. 12) and is not formalized.

Selected references

  • A. Garrido, An introduction to amenable groups, lecture notes, Oxford Advanced Class in Algebra, Michaelmas 2013. archived PDF
  • R. I. Grigorchuk, Degrees of growth of finitely generated groups, and the theory of invariant means, Math. USSR-Izvestiya 25 (1985), 259. DOI
  • C. Chou, Elementary amenable groups, Illinois J. Math. 24 (1980), 396–407. DOI
  • P. de la Harpe, Topics in Geometric Group Theory, Chicago Lectures in Mathematics, University of Chicago Press, 2000.
14 thms1 active userReviewed
🏆Completed
Group Theory·Captain: dbenbenn

Garrido Amenable Groups II: The Banach–Tarski ParadoxTextbook

This mission formalizes A. Garrido, An introduction to amenable groups, lecture notes from four talks at the Oxford Advanced Class in Algebra, Michaelmas 2013 (archived PDF) — its Section 1.1, the Banach–Tarski paradox, together with the inclusion AG⊆NFAG \subseteq NFAG⊆NF that the notes draw from it.

Motivation

The notes open with the theorem that started the subject. In 1924, they recall, Banach and Tarski "proved a remarkable theorem which is nowadays stated as 'given a ball in 3-dimensional space, there is a way of decomposing it into finitely many disjoint pieces that can be rearranged to form two balls of the same size as the original one'" (p. 1). As the notes put it, "This counterintuitive result is essentially a statement about measure theory": no finitely additive, isometry-invariant measure defined on every subset of R3\mathbb{R}^3R3 can give the unit ball a finite nonzero measure, so Lebesgue measure cannot be extended that way.

The reason is group-theoretic. The free group F2F_2F2​ decomposes paradoxically under its own left multiplication, the rotation group SO(3,R)SO(3,\mathbb{R})SO(3,R) contains a copy of F2F_2F2​, and a free action transports the decomposition to the sphere; Hausdorff's paradox and a countable correction give the sphere, and radial projection the ball. The same argument shows that a group containing F2F_2F2​ cannot carry an invariant finitely additive probability measure — the inclusion AG⊆NFAG \subseteq NFAG⊆NF of amenable groups into groups without free subgroups of rank two, whose converse was von Neumann's question.

This mission is the companion of the first Garrido mission, which formalized the measure-theoretic half of Section 1 (equidecomposability, the Banach–Schröder–Bernstein theorem, Tarski's theorem) and Sections 2 and 3.

Setting

A group GGG acting on a set XXX makes two subsets A,BA, BA,B GGG-equidecomposable, A∼BA \sim BA∼B, when AAA can be cut into finitely many pieces which, each moved by one element of GGG, reassemble into BBB; a subset E⊆XE \subseteq XE⊆X is GGG-paradoxical when it contains two disjoint proper subsets each equidecomposable with EEE. Both are the published definitions from the first Garrido mission, Equidecomposable and IsParadoxical, and paradoxicality is defined for an arbitrary subset because the notes use it for S2∖D\mathbb{S}^2 \setminus DS2∖D and for a ball.

The groups and spaces are the classical ones. Sn\mathbb{S}^nSn is the unit sphere in Rn+1\mathbb{R}^{n+1}Rn+1 (Sphere n), with SO(n+1,R)SO(n+1,\mathbb{R})SO(n+1,R) — Mathlib's Matrix.specialOrthogonalGroup — acting by matrix-vector multiplication. E(3)E(3)E(3) is the group of all isometries of R3\mathbb{R}^3R3 (EuclideanGroup 3), acting by evaluation; it contains the translations, the rotations and the reflections. A group acts freely (ActsFreely) when no element other than the identity fixes a point. F2F_2F2​ is FreeGroup (Fin 2), and "no free subgroup of rank two" is the published Chou.NoFreeSubgroupOfRankTwo. The rotations ρ\rhoρ and σ\sigmaσ of Proposition 1.6 are defined in the bundle with their matrices.

Formalization targets

Goal — Corollary 1.10, the Banach–Tarski paradox

Every closed ball of positive radius in R3\mathbb{R}^3R3, and R3\mathbb{R}^3R3 itself, is E(3)E(3)E(3)-paradoxical: "Any solid ball in R3\mathbb{R}^3R3 is E(3)E(3)E(3)-paradoxical. Furthermore, R3\mathbb{R}^3R3 is E(3)E(3)E(3)-paradoxical" (p. 3).

This is the goal because it is the theorem the section is named for and the one the notes build to.

The path — Propositions 1.5, 1.6 and 1.8, Theorem 1.7, Corollary 1.9

F2F_2F2​ is paradoxical, and so is every nonempty set on which it acts freely (Proposition 1.5); SO(3,R)SO(3,\mathbb{R})SO(3,R) contains a free group of rank two (Proposition 1.6); the sphere minus a countable set is paradoxical (Theorem 1.7, Hausdorff's paradox); a countable set can be absorbed (Proposition 1.8); so the sphere Sn\mathbb{S}^nSn is SO(n+1,R)SO(n+1,\mathbb{R})SO(n+1,R)-paradoxical for n≥2n \ge 2n≥2 (Corollary 1.9). The steps that the notes state inside proofs are milestones of their own: the two rotations ρ\rhoρ and σ\sigmaσ generate a free group, a nontrivial rotation fixes exactly two points of S2\mathbb{S}^2S2, and a countable subset of S2\mathbb{S}^2S2 has a rotation whose positive powers move it off itself.

Consequences — p. 1, p. 3 and p. 4

No rotation-invariant finitely additive probability measure lives on all subsets of Sn\mathbb{S}^nSn for n≥2n \ge 2n≥2; no isometry-invariant finitely additive measure on all subsets of R3\mathbb{R}^3R3 gives the unit ball a finite nonzero value; and an amenable group has no free subgroup of rank two.

Significance

The Banach–Tarski paradox is one of the best-known theorems of twentieth-century mathematics, and it is the reason finitely additive measure theory and amenability exist as subjects. Neither Mathlib nor the platform has it. It has been formalized in Lean outside both: aetilley/banach-tarski, following Tomkowicz and Wagon, proves that the closed unit ball in R3\mathbb{R}^3R3 is paradoxical under its isometry group, and is a candidate for inclusion in Lean Pool. This mission follows Garrido's statements instead, and publishes each step as a theorem other work can import. Mathlib has the equidecomposition machinery in Equidecomp.lean and the ping-pong lemma, which is the natural tool for Proposition 1.6, but no paradoxical decomposition of anything.

The inclusion AG⊆NFAG \subseteq NFAG⊆NF completes, with the first Garrido mission's EG⊆AGEG \subseteq AGEG⊆AG, the display EG⊆AG⊆NFEG \subseteq AG \subseteq NFEG⊆AG⊆NF on p. 11 of the notes. Nothing here is a new mathematical result: all of it is classical, and the work is formalization.

Difficulty

Three steps carry the weight. The freeness of ρ\rhoρ and σ\sigmaσ is a computation the notes defer to Wagon's book: a nonempty reduced word is shown to move a suitable vector, by tracking coordinates of the form (a,b2,c)/3k(a, b\sqrt{2}, c)/3^k(a,b2​,c)/3k with integers reduced modulo 333. The absorption of a countable set needs a rotation whose powers move the set off itself, which is a countability argument about angles. And the passage to Sn\mathbb{S}^nSn for n>2n > 2n>2 is only sketched in the notes ("by the same arguments as in Proposition 1.8"): the induction lifts a paradoxical decomposition of Sn−1\mathbb{S}^{n-1}Sn−1 to Sn\mathbb{S}^nSn minus two poles, and the poles must then be absorbed by a rotation of Sn\mathbb{S}^nSn.

Transferring the sphere to the ball needs radial projection and the absorption of the center, again by a rotation of infinite order, this time about an axis that misses the center.

Formalization scope

Rotations are matrices: SO(n+1,R)SO(n+1,\mathbb{R})SO(n+1,R) is Matrix.specialOrthogonalGroup (Fin (n + 1)) ℝ, acting on the sphere by mulVec; the bundle proves that an orthogonal matrix preserves the Euclidean norm, so the action is well defined. E(3)E(3)E(3) is the full group of isometries EuclideanSpace ℝ (Fin 3) ≃ᵢ EuclideanSpace ℝ (Fin 3), as in the first Garrido mission's Corollary 2.5, with an action by evaluation defined in the bundle.

Committed conventions. "Solid ball" is read as a closed ball Metric.closedBall c r with r>0r > 0r>0, for every center ccc. "Countable" is Set.Countable, which includes finite sets. Proposition 1.5's second part assumes the set nonempty, since the empty set carries a free action and is not paradoxical. The p. 1 consequence asks for a finite nonzero value on the unit ball: the notes say only "non-zero", and the measure that is ∞\infty∞ on every nonempty set satisfies that. Both departures are named in the statements' descriptions.

One trivialising formalization is ruled out: equidecomposability with the whole group allowed to act on each piece by an arbitrary bijection would make every two sets of the same cardinality equidecomposable. Here each piece is moved by a single group element, through Mathlib's Equidecomp, and paradoxicality needs two disjoint proper subsets.

A complete development needs the sphere and its rotation action, the isometry group of R3\mathbb{R}^3R3, and the combinatorics of paradoxical decompositions; the definitions are reusable for any later work on the paradox. Contributions are welcome on any milestone. Proposition 1.5 and the step on fixed points of rotations are the most self-contained entry points.

What is left out

The locally compact and measurable versions of the paradox, and the questions of how few pieces suffice, are not in the notes and are not formalized. Tarski's theorem, the converse that a non-paradoxical set carries an invariant measure, is proved in the first Garrido mission and is not restated here.

Selected references

  • A. Garrido, An introduction to amenable groups, lecture notes, Oxford Advanced Class in Algebra, Michaelmas 2013. archived PDF
  • S. Banach and A. Tarski, Sur la décomposition des ensembles de points en parties respectivement congruentes, Fund. Math. 6 (1924), 244–277. DOI
  • F. Hausdorff, Bemerkung über den Inhalt von Punktmengen, Math. Ann. 75 (1914), 428–433. DOI
  • J. von Neumann, Zur allgemeinen Theorie des Maßes, Fund. Math. 13 (1929), 73–116. DOI
  • S. Wagon, The Banach–Tarski Paradox, Cambridge University Press, 1985. DOI
15 thms1 active userReviewed
🏆Completed
Captain: Tamas Fulop

The Monotonicity Theorem in O-Minimal Geometry 1: Monotonicity TheoremTextbook

Motivation

An o-minimal structure is a setting in which every definable subset of the line is tame: a finite union of points and open intervals. This single axiom rules out oscillation, space-filling behavior, and other pathologies, and it makes one-variable definable functions tractable. The central consequence is the Monotonicity Theorem: every definable function on an interval is piecewise constant or strictly monotone and continuous, with only finitely many pieces.

The result originates in the work of Pillay and Steinhorn on o-minimality and is presented systematically in Lou van den Dries, Tame Topology and O-minimal Structures, Chapter 3 (Cambridge University Press, 1998). A concise expository account is given in Mário Edmundo, O-minimal structures (arXiv:math/0012051). This mission formalizes the one-dimensional monotonicity theorem and its supporting lemmas in Lean 4 against Mathlib, as a verified entry point to o-minimal geometry.

Setting

Let RRR be a type equipped with a dense linear order without endpoints DDD: an irreflexive, transitive, trichotomous relation D.ltD.\mathrm{lt}D.lt in which every strict inequality admits an interpolant and every element has strict predecessors and successors. Finite Cartesian powers are represented as coordinate tuples Power R n:=Fin n→R\mathrm{Power}\,R\,n := \mathrm{Fin}\,n \to RPowerRn:=Finn→R, with coordinate projections, deletion, and append operations defined explicitly.

An o-minimal structure MMM over DDD is a family M.S nM.S\,nM.Sn of collections of subsets of Power R n\mathrm{Power}\,R\,nPowerRn, closed under finite unions and intersections, containing diagonals and the order relation, closed under products, coordinate reindexing, and existential projection, and satisfying the o-minimality axiom: every member of M.S 1M.S\,1M.S1 is a finite union of points and open intervals. A definable function fff with domain III and codomain BBB is a dependent function on the corresponding subtypes whose domain, codomain, and graph are all members of MMM.

For a<ba < ba<b in Power R 1\mathrm{Power}\,R\,1PowerR1, the open interval (a,b)(a,b)(a,b) is the set of coordinate tuples whose single coordinate lies strictly between the two endpoint values, with endpoint variants allowing −∞-\infty−∞ and +∞+\infty+∞. A function is strictly increasing (respectively strictly decreasing) on III when x<yx < yx<y implies f(x)<f(y)f(x) < f(y)f(x)<f(y) (respectively f(y)<f(x)f(y) < f(x)f(y)<f(x)) in the first output coordinate. Continuity at a domain point is the graph-based epsilon-delta predicate: xxx belongs to ContinuousPoints D I G\mathrm{ContinuousPoints}\,D\,I\,GContinuousPointsDIG exactly when the graph GGG meets every sufficiently small box around (x,f(x))(x, f(x))(x,f(x)) in the graph of a locally oscillation-free correspondence. Finiteness and infinitude of one-dimensional sets are expressed through first-coordinate listings.

Formalization targets

Goal — Monotonicity theorem

f:I→B definable, I infinite  ⟹  ∃ a=p0<p1<⋯<pk=b with each (pi,pi+1) good.f : I \to B\ \text{definable},\ I\ \text{infinite} \implies \exists\, a = p_0 < p_1 < \cdots < p_k = b\ \text{with each}\ (p_i, p_{i+1})\ \text{good}.f:I→B definable, I infinite⟹∃a=p0​<p1​<⋯<pk​=b with each (pi​,pi+1​) good.

An open cell (pi,pi+1)(p_i, p_{i+1})(pi​,pi+1​) is good when fff restricted to I∩(pi,pi+1)I \cap (p_i,p_{i+1})I∩(pi​,pi+1​) is constant, or strictly increasing and continuous there, or strictly decreasing and continuous there. The number kkk of cut points is finite and depends on fff, aaa, and bbb; no bound on kkk is asserted.

Supporting targets

I definable and infinite  ⟹  I contains a nonempty open interval.I\ \text{definable and infinite} \implies I\ \text{contains a nonempty open interval}.I definable and infinite⟹I contains a nonempty open interval. f definable  ⟹  each value fiber f−1(z) is definable.f\ \text{definable} \implies \text{each value fiber}\ f^{-1}(z)\ \text{is definable}.f definable⟹each value fiber f−1(z) is definable. Either some value fiber is infinite or every value fiber is finite.\text{Either some value fiber is infinite or every value fiber is finite}.Either some value fiber is infinite or every value fiber is finite. f definable on infinite I  ⟹  f is constant or injective on some subinterval.f\ \text{definable on infinite}\ I \implies f\ \text{is constant or injective on some subinterval}.f definable on infinite I⟹f is constant or injective on some subinterval. f injective and definable  ⟹  f is strictly monotone on some subinterval.f\ \text{injective and definable} \implies f\ \text{is strictly monotone on some subinterval}.f injective and definable⟹f is strictly monotone on some subinterval. f strictly monotone and definable  ⟹  f is continuous on some subinterval.f\ \text{strictly monotone and definable} \implies f\ \text{is continuous on some subinterval}.f strictly monotone and definable⟹f is continuous on some subinterval.

Significance

The result itself. The Monotonicity Theorem is the foundation of one-dimensional o-minimal geometry. It implies that definable sets have finitely many connected components, that definable functions have finite limits at endpoints, and that higher-dimensional cell decomposition can proceed by induction on dimension. Without it, the correspondence between definability and geometric tameness remains unestablished.

Formalizing it. The classical proofs are known and appear in the references above; what is missing is a machine-checked version with explicit definability bookkeeping. This mission produces Lean 4 declarations for the order, interval, monotonicity, graph, and continuity predicates together with the theorem and its lemmas, all verified against the pinned Mathlib revision. The definability infrastructure (products, projections, fiber extraction) is reusable for subsequent cell-decomposition missions. Status honesty: the one-dimensional interval-extraction lemmas are machine-checked; the local constancy-or-injectivity lemma, the injective-to-monotone lemma, the finite-partition assembly, and the goal theorem itself remain open targets.

Difficulty

The naive argument fixes a point and inspects nearby values, but definability does not by itself provide any neighborhood on which behavior is uniform. The fiber dichotomy illustrates the obstruction: knowing that each fiber f−1(z)f^{-1}(z)f−1(z) is definable does not decide whether some fiber contains an interval or every fiber is finite, and the two cases require different constructions (a constancy interval versus an injective-selection interval). Similarly, injectivity alone does not yield monotonicity without partitioning the domain by local sign patterns and applying o-minimality to select a uniform pattern on a subinterval. Each step fails until the relevant definable set is exhibited and the one-dimensional interval lemma is applied to it.

Formalization scope

Lean represents one-dimensional points as functions Fin 1→R\mathrm{Fin}\,1 \to RFin1→R, with order, intervals, and finiteness stated through the first coordinate. Definability is always the structure membership predicate M.S nM.S\,nM.Sn, never an informal attribute. Continuity is the graph-based ContinuousPoints\mathrm{ContinuousPoints}ContinuousPoints predicate applied to FunctionGraph f.toFun\mathrm{FunctionGraph}\,f.\mathrm{toFun}FunctionGraphf.toFun; a submission that discharges a continuity goal from the domain inclusion alone, or that replaces the continuity predicate by the domain set, does not satisfy the statement. The goal quantifies over cut points p:Fin (k+1)→Power R 1p : \mathrm{Fin}\,(k+1) \to \mathrm{Power}\,R\,1p:Fin(k+1)→PowerR1 with p0=ap_0 = ap0​=a, plast=bp_{\mathrm{last}} = bplast​=b, and strict increase at each step; the intervening sets JJJ are the open intervals determined by consecutive finite endpoints.

Contributions welcome: direct proofs of the open leaves (fiber definability, the finite-fiber injective-interval construction, the injective-to-monotone step, the finite-partition assembly), sharper statements with explicit endpoint bounds, and reusable o-minimal infrastructure beyond this mission. Out of scope: higher-dimensional cell decomposition, differentiability, and integration of definable functions.

Selected references

  • Lou van den Dries, Tame Topology and O-minimal Structures, London Mathematical Society Lecture Note Series 248, Cambridge University Press, 1998, Chapter 3. DOI: 10.1017/CBO9780511525919.
  • Mário J. Edmundo, An Introduction to O-minimal Structures, 2000. arXiv:math/0012051.
32 thms1 active userReviewed

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