Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

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

Algebraic Topology

30 missions · 18 completed

Missions

Open12Completed18All30
🏆Completed
Group Theory·Captain: Lucas

Tarcha: Braid Theory and the Artin Presentation with Explicit Half-Twist GeneratorsTextbook

Motivation

A braid on nnn strands is the everyday object it sounds like: nnn strings hanging between two horizontal plates, each string descending monotonically, no two strings meeting. Emil Artin turned this picture into algebra in 1925 by showing that braids form a group under concatenation and that this group has a finite presentation with n−1n-1n−1 generators. The braid groups sit at the crossroads of low-dimensional topology (they are the mapping class groups of punctured discs, and closures of braids produce every link), of algebra (they are the prototypical Artin–Tits groups, torsion-free and orderable), and of representation theory and mathematical physics through the Burau, Lawrence– Krammer and Temperley–Lieb representations.

This mission formalizes the braid-group development of a 2023 master's dissertation, Alexsander Andrey Gomes Tarcha's Um Estudo Introdutório da Teoria de Tranças (UNESP, Rio Claro), whose capstone is Teorema 3.15: the braid group on nnn strands admits Artin's presentation. The dissertation builds the group structure on equivalence classes of geometric braids (Teorema 3.9), shows that the Artin generators generate (Teorema 3.11), derives the braid and commutation relations (Proposição 3.14), establishes the presentation (Teorema 3.15), and closes with two structural properties: the full twist is central (Proposição 3.16) and BmB_mBm​ embeds in BnB_nBn​ for m≤nm \le nm≤n (Proposição 3.17).

Setting

Work in the plane E2=CE^2 = \mathbb{C}E2=C. The ordered configuration space

F0,nE2={(z1,…,zn)∈Cn:zk≠zl for k≠l}F_{0,n}E^2 = \{(z_1,\dots,z_n) \in \mathbb{C}^n : z_k \neq z_l \text{ for } k \neq l\}F0,n​E2={(z1​,…,zn​)∈Cn:zk​=zl​ for k=l}

carries the subspace topology of Cn\mathbb{C}^nCn, and the symmetric group Σn\Sigma_nΣn​ acts on it by permuting coordinates. The unordered configuration space B0,nE2=F0,nE2/ΣnB_{0,n}E^2 = F_{0,n}E^2/\Sigma_nB0,n​E2=F0,n​E2/Σn​ carries the quotient topology; its points are the nnn-element subsets of the plane. The base configuration is (1,2,…,n)(1,2,\dots,n)(1,2,…,n), and ∗*∗ denotes its class in B0,nE2B_{0,n}E^2B0,n​E2. The geometric braid group is

π1(B0,nE2,∗),\pi_1\bigl(B_{0,n}E^2, *\bigr),π1​(B0,n​E2,∗),

a loop of nnn-point configurations being exactly a geometric braid, and homotopy of loops being exactly the equivalence by elementary moves used in the dissertation.

The elementary half-twist σi+1\sigma_{i+1}σi+1​, for 0≤i≤n−20 \le i \le n-20≤i≤n−2, is the loop that rotates the two base points i+1i+1i+1 and i+2i+2i+2 by the angle π\piπ about their midpoint i+32i + \tfrac32i+23​, leaving the other n−2n-2n−2 points fixed:

t  ⟼  { i+32±12eπit }  ∪  { k+1:k≠i, i+1 },t∈[0,1].t \;\longmapsto\; \Bigl\{\, i+\tfrac32 \pm \tfrac12 e^{\pi i t} \,\Bigr\} \;\cup\; \{\,k+1 : k \neq i,\, i+1 \,\}, \qquad t \in [0,1].t⟼{i+23​±21​eπit}∪{k+1:k=i,i+1},t∈[0,1].

It returns to the base configuration at t=1t = 1t=1 with the two moving points interchanged, so it is a loop in B0,nE2B_{0,n}E^2B0,n​E2 and defines a class in π1(B0,nE2,∗)\pi_1(B_{0,n}E^2,*)π1​(B0,n​E2,∗).

The abstract braid group BnB_nBn​ is the group presented by generators σ1,…,σn−1\sigma_1,\dots,\sigma_{n-1}σ1​,…,σn−1​ subject to

σiσj=σjσi(∣i−j∣≥2),σiσi+1σi=σi+1σiσi+1(1≤i≤n−2).\sigma_i\sigma_j = \sigma_j\sigma_i \quad (|i-j| \ge 2), \qquad \sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1} \quad (1 \le i \le n-2).σi​σj​=σj​σi​(∣i−j∣≥2),σi​σi+1​σi​=σi+1​σi​σi+1​(1≤i≤n−2).

Formalization targets

Goal — Teorema 3.15, with the isomorphism pinned on generators

∃ φ:Bn  → ∼   π1(B0,nE2,∗),φ(σi+1)=[half-twisti]  (0≤i≤n−2).\exists\, \varphi : B_n \;\xrightarrow{\ \sim\ }\; \pi_1\bigl(B_{0,n}E^2,*\bigr), \qquad \varphi(\sigma_{i+1}) = \bigl[\text{half-twist}_i\bigr] \ \ (0 \le i \le n-2).∃φ:Bn​ ∼ ​π1​(B0,n​E2,∗),φ(σi+1​)=[half-twisti​]  (0≤i≤n−2).

This is the statement the dissertation actually proves: the map φ\varphiφ of its proof is defined on generators by φ(xi)=[σi]\varphi(x_i) = [\sigma_i]φ(xi​)=[σi​], and the work consists in showing that it is a well-defined homomorphism which is surjective and injective. Asking only for an abstract isomorphism would leave the generators unconstrained; naming their images is what makes the presentation usable downstream.

Milestones

⟨ [half-twisti] ⟩=π1(B0,nE2,∗)(Teorema 3.11)\langle\,[\text{half-twist}_i]\,\rangle = \pi_1\bigl(B_{0,n}E^2,*\bigr) \qquad \text{(Teorema 3.11)}⟨[half-twisti​]⟩=π1​(B0,n​E2,∗)(Teorema 3.11) [half-twisti][half-twistj]=[half-twistj][half-twisti] (∣i−j∣≥2),[hti][hti+1][hti]=[hti+1][hti][hti+1][\text{half-twist}_i][\text{half-twist}_j] = [\text{half-twist}_j][\text{half-twist}_i]\ (|i-j|\ge 2), \qquad [\text{ht}_i][\text{ht}_{i+1}][\text{ht}_i] = [\text{ht}_{i+1}][\text{ht}_i][\text{ht}_{i+1}][half-twisti​][half-twistj​]=[half-twistj​][half-twisti​] (∣i−j∣≥2),[hti​][hti+1​][hti​]=[hti+1​][hti​][hti+1​] ∀b∈B2, ∃m∈Z, b=σ1m(Proposic¸a˜o 3.13)\forall b \in B_2,\ \exists m \in \mathbb{Z},\ b = \sigma_1^m \qquad \text{(Proposição 3.13)}∀b∈B2​, ∃m∈Z, b=σ1m​(Proposic¸​a˜o 3.13) ∀b∈B3, b=σ1a1σ2b1⋯σ1amσ2bm(Proposic¸a˜o 3.14)\forall b \in B_3,\ b = \sigma_1^{a_1}\sigma_2^{b_1}\cdots\sigma_1^{a_m}\sigma_2^{b_m} \qquad \text{(Proposição 3.14)}∀b∈B3​, b=σ1a1​​σ2b1​​⋯σ1am​​σ2bm​​(Proposic¸​a˜o 3.14) (σ1σ2⋯σn−1)n∈Z(Bn)(Proposic¸a˜o 3.16)(\sigma_1\sigma_2\cdots\sigma_{n-1})^n \in Z(B_n) \qquad \text{(Proposição 3.16)}(σ1​σ2​⋯σn−1​)n∈Z(Bn​)(Proposic¸​a˜o 3.16) Bm↪Bn  (m≤n)(Proposic¸a˜o 3.17)B_m \hookrightarrow B_n \ \ (m \le n) \qquad \text{(Proposição 3.17)}Bm​↪Bn​  (m≤n)(Proposic¸​a˜o 3.17)

Significance

Artin's presentation is what makes the braid groups computable: the word problem, the Burau and Lawrence–Krammer representations, the Markov moves on braid closures, and the Garside normal form all start from generators and relations, while the topological side supplies the meaning of those generators. A formalization that only exhibits an abstract isomorphism cannot be used to compute with a given geometric braid; the version stated here transports each half-twist loop to a generator word, which is what downstream work needs.

On the formalization side, the geometric model (configuration spaces and their fundamental groups) and the algebraic model (a presented group) are already available on the platform in this environment, and the abstract form of Artin's theorem is already stated there as an open problem. What this mission adds is: the elementary half-twist as an explicit, machine-checked loop in B0,nE2B_{0,n}E^2B0,n​E2 — this definition is proved sorry-free here, including the injectivity of the moving configuration at every time and the continuity of the path; the sharpened goal that fixes the isomorphism on generators; and the dissertation's supporting results, none of which is currently on the platform. None of the milestones or the goal has a machine-checked proof yet.

Difficulty

Surjectivity of φ\varphiφ — every braid is a product of half-twists — is a compactness-and-general- position argument in the dissertation: cut the braid into finitely many slabs in which a single crossing occurs. Turning that into a formal proof requires the homotopy-theoretic substitute, since "general position" is not available for free: a loop of configurations must be subdivided and each piece pushed to a standard crossing.

Injectivity is harder and is the step where a naive approach fails. It is not enough to check that the relations hold; one has to know that they are all the relations, i.e. that a word whose braid is null-homotopic is a consequence of the braid relations. The dissertation follows the classical route through elementary moves on braid diagrams (its Figuras 3.22–3.26), which formalizes as a long case analysis. The standard modern alternative is the Fadell–Neuwirth fibration together with an induction on nnn; its inductive step needs the exact sequence of the fibration F0,nE2→F0,n−1E2F_{0,n}E^2 \to F_{0,n-1}E^2F0,n​E2→F0,n−1​E2, which is itself substantial work.

Formalization scope

The plane is C\mathbb{C}C; configurations are injective tuples indexed by Fin n; the unordered configuration space is the quotient by the coordinate-permutation action with the quotient topology; the base configuration is (1,2,…,n)(1,2,\dots,n)(1,2,…,n) (not (0,1,…,n−1)(0,1,\dots,n-1)(0,1,…,n−1)). Braid generators are indexed by Fin (n-1), the index iii standing for the book generator σi+1\sigma_{i+1}σi+1​; truncated natural subtraction means the degenerate values n=0,1n = 0, 1n=0,1 give the trivial group, and the statements are asserted for all nnn including those cases. The abstract braid group is the presented group on Fin (n-1) modulo the normal closure of the commutation and braid relators.

The half-twist rotates counterclockwise. The mirror symmetry z↦zˉz \mapsto \bar zz↦zˉ fixes the base configuration and exchanges the two orientations, so the goal statement does not depend on this choice; a solver may use either convention internally.

The goal cannot be satisfied trivially: it asks for a group isomorphism whose values on the generators are the prescribed classes of explicit loops, so neither the identity on a presented group nor an abstract counting argument suffices.

Contributions welcome beyond the milestones: the Fadell–Neuwirth exact sequence for the plane, the pure braid group as the kernel of the map to Σn\Sigma_nΣn​, the exponent-sum homomorphism, and torsion-freeness of BnB_nBn​. The half-twist definition published with this mission is reusable for any further work on braids in this environment.

Selected references

  • Alexsander Andrey Gomes Tarcha, Um Estudo Introdutório da Teoria de Tranças, master's dissertation, UNESP Rio Claro, 2023. https://repositorio.unesp.br/items/9d2ffbf0-8bd2-4ec7-9e45-e2cee8a1b202
  • Emil Artin, Theorie der Zöpfe, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 4 (1925), 47–72. https://doi.org/10.1007/BF02950718
  • Joan S. Birman, Braids, Links, and Mapping Class Groups, Annals of Mathematics Studies 82, Princeton University Press, 1974. https://doi.org/10.1515/9781400881420
  • Edward Fadell and Lee Neuwirth, Configuration spaces, Mathematica Scandinavica 10 (1962), 111–118. https://doi.org/10.7146/math.scand.a-10517
64 thms10 active usersReviewed
🏆Completed
Group Theory·Captain: Lucas

Braids, Links and Mapping Class Groups I: Artin's Presentation of the Braid GroupTextbook

Motivation

The braid group is one of the places where group theory, low-dimensional topology and knot theory meet. Artin introduced it in 1925 (E. Artin, Theorie der Zöpfe, Abh. Math. Sem. Univ. Hamburg 4 (1925), 47–72) and returned to it in 1947; since then it has become standard equipment in the study of links (closed braids and Markov's theorem), of mapping class groups of punctured surfaces, and of configuration spaces. Birman's Braids, Links, and Mapping Class Groups (Annals of Mathematics Studies 82, Princeton University Press, 1974) is the classical reference that develops all three subjects from the braid group outwards, and its Chapter 1 is the foundation on which the rest of the book rests.

The chapter's structure is itself the reason to formalize it first: everything later in the book — the closed-braid picture of links, Markov's theorem, the Magnus representations, the mapping class group of the punctured sphere — is phrased in terms of the group π1B0,nE2\pi_1 B_{0,n}E^2π1​B0,n​E2 and of the presentation established here. A mission that fixes faithful Lean definitions of the configuration spaces and of the abstract braid group therefore fixes the vocabulary for the whole series.

Timeline of the results collected here: Artin (1925) gave the presentation and the characterization of braid automorphisms of a free group; Chow (1948) determined the centre; Fadell–Neuwirth (1962) introduced the configuration-space fibrations, and Fadell–Van Buskirk (1962) used them to give the proof of the presentation reproduced by Birman.

Setting

Write E2E^2E2 for the Euclidean plane, identified throughout with the complex numbers C\mathbb{C}C. For n≥0n \ge 0n≥0 let

F0,nE2={ (z1,…,zn)∈Cn:zi≠zj for i≠j }F_{0,n}E^2 = \{\,(z_1,\dots,z_n) \in \mathbb{C}^n : z_i \neq z_j \text{ for } i \neq j\,\}F0,n​E2={(z1​,…,zn​)∈Cn:zi​=zj​ for i=j}

be the ordered configuration space of nnn points in the plane, topologized as a subspace of Cn\mathbb{C}^nCn. The symmetric group Σn\Sigma_nΣn​ acts on it by permuting coordinates; the quotient

B0,nE2=F0,nE2/Σn,B_{0,n}E^2 = F_{0,n}E^2 / \Sigma_n,B0,n​E2=F0,n​E2/Σn​,

with the quotient topology, is the unordered configuration space. A point of B0,nE2B_{0,n}E^2B0,n​E2 is an unordered set of nnn distinct points of the plane. The base configuration is zˉ 0=(1,2,…,n)\bar z^{\,0} = (1,2,\dots,n)zˉ0=(1,2,…,n), and all fundamental groups below are taken at zˉ 0\bar z^{\,0}zˉ0 or at its image.

The braid group of the plane is π1B0,nE2\pi_1 B_{0,n}E^2π1​B0,n​E2: a loop is a motion of nnn points of the plane returning to the same set of points, and homotopy classes of such motions compose as braids. The pure braid group is Pn=π1F0,nE2P_n = \pi_1 F_{0,n}E^2Pn​=π1​F0,n​E2, the subgroup of motions returning each point to its own starting position.

Separately, let BnB_nBn​ denote the abstract group given by generators σ1,…,σn−1\sigma_1,\dots,\sigma_{n-1}σ1​,…,σn−1​ subject to

σiσj=σjσi(∣i−j∣≥2),σiσi+1σi=σi+1σiσi+1(1≤i≤n−2).\sigma_i\sigma_j = \sigma_j\sigma_i \quad (|i-j| \ge 2), \qquad \sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1} \quad (1 \le i \le n-2).σi​σj​=σj​σi​(∣i−j∣≥2),σi​σi+1​σi​=σi+1​σi​σi+1​(1≤i≤n−2).

These are equations (1-1) and (1-2) of the book (p. 11). Geometrically σi\sigma_iσi​ interchanges the iii-th and (i+1)(i+1)(i+1)-st points along a semicircle.

Formalization targets

Goal — Theorem 1.8 (Artin, 1925; Birman p. 18)

Bn  ≅  π1B0,nE2.B_n \;\cong\; \pi_1 B_{0,n} E^2 .Bn​≅π1​B0,n​E2.

The group of motions of nnn points of the plane is the group with generators σ1,…,σn−1\sigma_1,\dots,\sigma_{n-1}σ1​,…,σn−1​ and the two families of relations above: the relations are not only valid but defining.

Milestones

The milestone list follows the chapter: the covering-space description of the projection F0,nE2→B0,nE2F_{0,n}E^2 \to B_{0,n}E^2F0,n​E2→B0,n​E2 (Proposition 1.1, p. 11), the Fadell–Neuwirth exact sequence (Theorem 1.4, p. 14), the semidirect-product decomposition of the pure braid group (Corollary 1.8.1, p. 24), the faithful representation of BnB_nBn​ by automorphisms of a free group (Corollary 1.8.3, p. 25), the centre of BnB_nBn​ (Corollary 1.8.4, p. 28, due to Chow), and Artin's algebraic characterization of the braid automorphisms (Theorem 1.9, p. 30).

Significance

Theorem 1.8 is what makes the braid group computable: with defining relations in hand one can combine braids into the normal form of Corollary 1.8.2 and solve the word problem, represent braids by automorphisms of a free group, and pass to the link-theoretic material of Chapters 2 and 5 where braid words, not motions, are the objects manipulated. Corollary 1.8.3 turns braids into concrete data — a braid is determined by what it does to the generators of a free group — and Theorem 1.9 says exactly which endomorphisms arise this way; both are the algebraic engine behind the conjugacy-problem and Magnus-representation chapters.

For formalization the state of play is that Mathlib has free groups, presented groups, the fundamental groupoid and fundamental group, covering maps and fibre bundles, but no braid groups and no configuration spaces: nothing here can be assembled from existing declarations. The mission therefore produces reusable infrastructure — configuration spaces of the plane, the symmetric-group quotient, the Artin presentation, the Artin action on a free group — as well as machine-checked proofs of results that are classical but, as far as the mission's search of the library showed, not yet formalized in Mathlib.

Difficulty

The generators and relations are easy to write down and easy to verify in π1B0,nE2\pi_1 B_{0,n}E^2π1​B0,n​E2; what is hard is completeness, i.e. that no further relations are needed. The naive route — draw the braid, push it into a normal form by hand — is exactly what a formal proof cannot do. The Fadell–Van Buskirk argument reproduced by Birman instead runs an induction on nnn driven by the fibration F0,nE2→F0,n−1E2F_{0,n}E^2 \to F_{0,n-1}E^2F0,n​E2→F0,n−1​E2: its homotopy exact sequence gives a split extension of Pn−1P_{n-1}Pn−1​ by a free group, presentations are assembled along the extension, and finally the covering F0,nE2→B0,nE2F_{0,n}E^2 \to B_{0,n}E^2F0,n​E2→B0,n​E2 with deck group Σn\Sigma_nΣn​ transfers the answer from the pure braid group to the full braid group. Each of those steps needs genuine algebraic topology — local triviality of the projection, exactness of the homotopy sequence, freeness of π1\pi_1π1​ of a punctured plane — which is where the formalization work actually lies.

Formalization scope

The plane is C\mathbb{C}C. F0,nE2F_{0,n}E^2F0,n​E2 is the subtype of injective functions Fin n→C\mathrm{Fin}\,n \to \mathbb{C}Finn→C; B0,nE2B_{0,n}E^2B0,n​E2 is its quotient by the equivalence "differ by precomposition with a permutation", with the quotient topology. Base point: the configuration i↦i+1i \mapsto i+1i↦i+1, i.e. (1,2,…,n)(1,2,\dots,n)(1,2,…,n), and its image. Fundamental groups are Mathlib's FundamentalGroup at those base points. Braid generators are indexed by Fin(n−1)\mathrm{Fin}(n-1)Fin(n−1) with 000-based indices (iii stands for σi+1\sigma_{i+1}σi+1​), and free-group generators by Fin n\mathrm{Fin}\,nFinn; the abstract braid group is a PresentedGroup on that index set. Truncated subtraction makes the generator set empty for n≤1n \le 1n≤1, so B0B_0B0​ and B1B_1B1​ are trivial, as intended. Two milestones are stated with the shift n↦n+1n \mapsto n+1n↦n+1 (i.e. for the projection F0,n+1E2→F0,nE2F_{0,n+1}E^2 \to F_{0,n}E^2F0,n+1​E2→F0,n​E2) to avoid truncated subtraction in the maps.

Two conventions are worth flagging because they weaken what the Lean text asserts relative to the prose. First, the goal asserts the existence of some isomorphism Bn≅π1B0,nE2B_n \cong \pi_1B_{0,n}E^2Bn​≅π1​B0,n​E2; it does not pin the isomorphism down on the geometric generators of Figure 2, since those loops are not part of the formal development. Second, Artin's representation is formalized as the existence of a homomorphism ξ\xiξ from BnB_nBn​ to the automorphism group of the free group whose value on each σi\sigma_iσi​ is the explicit endomorphism of equation (1-14), together with its injectivity; Theorem 1.9 is then stated for an arbitrary such ξ\xiξ, given as a hypothesis, and is non-vacuous precisely because Corollary 1.8.3 supplies one.

No trivializing formalization is available: the goal is an isomorphism statement between two groups that are both defined independently of it, and the degenerate cases n≤1n \le 1n≤1 (both sides trivial) are genuine special cases of it, not the content.

Infrastructure a complete development needs, all reusable: freeness of π1\pi_1π1​ of a punctured plane, local triviality of the Fadell–Neuwirth projection, the homotopy exact sequence of a fibration in the range needed, presentations of split extensions, and the transfer of a presentation along a regular covering. Contributions of any of these as standalone lemmas are welcome, as is a formalization of the geometric generators (1-9) that would let the goal be strengthened to pin the isomorphism on σi\sigma_iσi​.

Selected references

  • E. Artin, Theorie der Zöpfe, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 4 (1925), 47–72. https://doi.org/10.1007/BF02950718
  • E. Artin, Theory of braids, Annals of Mathematics 48 (1947), 101–126. https://doi.org/10.2307/1969218
  • W.-L. Chow, On the algebraical braid group, Annals of Mathematics 49 (1948), 654–658. https://doi.org/10.2307/1969333
  • E. Fadell, L. Neuwirth, Configuration spaces, Mathematica Scandinavica 10 (1962), 111–118. https://doi.org/10.7146/math.scand.a-10517
  • E. Fadell, J. Van Buskirk, The braid groups of E2E^2E2 and S2S^2S2, Duke Mathematical Journal 29 (1962), 243–257. https://doi.org/10.1215/S0012-7094-62-02925-3
  • J. S. Birman, Braids, Links, and Mapping Class Groups, Annals of Mathematics Studies 82, Princeton University Press, 1974. https://doi.org/10.1515/9781400881420
57 thms8 active usersReviewed
Geometry & Topology·Captain: ryanshin

Smooth 4-dimensional Poincaré conjecture: foundations and reductionsOpen Problem

Motivation

The smooth four-dimensional Poincaré conjecture asks whether a smooth manifold with the topology of the four-sphere must also have its standard smooth structure, up to diffeomorphism. The distinction is between the existence of continuous coordinates and the compatibility of differentiable coordinates. The mission concerns this precise sphere question, listed as open in Problem 4.1 of K3 — A New Problem List in Low-Dimensional Topology. It does not treat a collection of algebraic obstructions as an existing proof of the conjecture. Baykur–Kirby–Ruberman, Problem 4.1

Historical landmarks

  • 1961: Smale proved that a closed smooth manifold homotopy equivalent to a sphere of dimension at least five is homeomorphic to that sphere. This is not a theorem that all such smooth manifolds are diffeomorphic to the standard sphere. Smale, Theorem A
  • 1982: Freedman established the topological four-dimensional Poincaré theorem: a topological four-manifold homotopy equivalent to the four-sphere is homeomorphic to it. Freedman, Theorem 1.6
  • 2026: The K3 problem list continues to distinguish this established topological result from the open smooth sphere problem. Problem 4.1, pp. 191–192

Setting

Let S4S^4S4 be the unit sphere in R5ℝ^5R5, with its standard stereographic smooth structure. A homeomorphism is a continuous bijection with continuous inverse; a diffeomorphism is a smooth bijection with smooth inverse. A smooth atlas is a collection of local Euclidean coordinates whose transition maps are smooth.

The manifold MMM is compact and Hausdorff, has no boundary, and is equipped with a specified smooth atlas modeled on R4ℝ^4R4. The given atlas is arbitrary: it is not defined by transporting the standard structure from S4S^4S4.

For a homeomorphism e:N→S4e:N\to S^4e:N→S4, let Ae\mathcal A_eAe​ denote the atlas transported from the standard sphere along eee. A structomorphism for the smooth structure groupoid is a homeomorphism whose coordinate expressions belong to that groupoid. The predicate SPC4Pullback\mathsf{SPC4Pullback}SPC4Pullback requires, for every given smooth atlas A\mathcal AA on such an NNN and every such eee, a structomorphism between (N,A)(N,\mathcal A)(N,A) and (N,Ae)(N,\mathcal A_e)(N,Ae​). It does not require that structomorphism to be the identity. These are the conventions of the source definitions, not additional uniqueness assumptions. [Shin, SPC4.lean, lines 53–81 and 211–221]

Formalization targets

Main open goal

For every manifold MMM with the preceding hypotheses, the goal is

M≅TopS4⟹M≅DiffS4.M\cong_{\mathrm{Top}}S^4 \quad\Longrightarrow\quad M\cong_{\mathrm{Diff}}S^4.M≅Top​S4⟹M≅Diff​S4.

This is the source predicate SPC4\mathsf{SPC4}SPC4. Its conclusion asserts the existence of a diffeomorphism; it does not assert that a particular supplied homeomorphism is smooth.

Structural and literature milestones

The atlas formulation has the exact equivalence

SPC4⟺SPC4Pullback.\mathsf{SPC4}\quad\Longleftrightarrow\quad\mathsf{SPC4Pullback}.SPC4⟺SPC4Pullback.

The source supplies a proof of this equivalence without invoking Freedman's theorem or assuming the conjecture as an unconditional fact. It is a reformulation, not a solution. Its foundations include the correspondence

Structomorph⁡(G∞,M,N)≃Diff⁡∞(M,N),\operatorname{Structomorph}(\mathcal G^{\infty},M,N) \simeq \operatorname{Diff}^{\infty}(M,N),Structomorph(G∞,M,N)≃Diff∞(M,N),

where G∞\mathcal G^{\infty}G∞ is the smooth coordinate-change groupoid for the common model. [Shin, SPC4.lean, lines 334–365; Bridge.lean]

Write F4F_4F4​ for the following compact Hausdorff, boundaryless instance of Freedman's topological theorem:

M≃S4⟹M≅TopS4,M\simeq S^4\quad\Longrightarrow\quad M\cong_{\mathrm{Top}}S^4,M≃S4⟹M≅Top​S4,

where ≃\simeq≃ denotes homotopy equivalence and only topological manifold charts are assumed. This is established mathematics, but a proof in the present formal development remains a target. If SPC4Homotopy\mathsf{SPC4Homotopy}SPC4Homotopy denotes the analogous smooth conclusion from a homotopy equivalence, the relation to the main goal is recorded with its hypothesis visible:

F4⟹(SPC4⟺SPC4Homotopy).F_4\quad\Longrightarrow\quad (\mathsf{SPC4}\Longleftrightarrow\mathsf{SPC4Homotopy}).F4​⟹(SPC4⟺SPC4Homotopy).

Explicit standard-disk foundations form another track. For every m≥0m\geq0m≥0, they concern the manifold-with-boundary structure on B‾m+1\overline B^{m+1}Bm+1, its boundary set SmS^mSm, and the smooth collar

c:Sm×[0,1]⟶B‾m+1,c(u,t)=(1−t/2)u.c:S^m\times[0,1]\longrightarrow\overline B^{m+1}, \qquad c(u,t)=(1-t/2)u.c:Sm×[0,1]⟶Bm+1,c(u,t)=(1−t/2)u.

The collar is a closed embedding, has image

{z∈B‾m+1:∥z∥≥1/2},\{z\in\overline B^{m+1}:\|z\|\geq1/2\},{z∈Bm+1:∥z∥≥1/2},

and satisfies c(u,0)=uc(u,0)=uc(u,0)=u, using the boundary inclusion. Its image is a neighborhood of every boundary point in the disk. A companion interface characterizes a CkC^kCk map from a CkC^kCk manifold with corners into the disk as precisely a continuous map whose inclusion into Euclidean space is CkC^kCk. These targets concern the actual disk smooth structure. [Shin, Disk.lean, lines 1076–1141 and 1263–1318]

Topological two-disk gluing

For each integer m≥0m\geq0m≥0, let Dm+1=B‾m+1D^{m+1}=\overline B^{m+1}Dm+1=Bm+1 be the closed unit disk in Rm+1\mathbb R^{m+1}Rm+1 and let φ:Sm→Sm\varphi:S^m\to S^mφ:Sm→Sm be any homeomorphism of its boundary. The twisted double identifies the boundary point uuu in a left copy of the disk with φ(u)\varphi(u)φ(u) in a right copy. With the quotient topology, the target is

Xφ:=(DLm+1⊔DRm+1)/(uL∼φ(u)R)≅TopSm+1.X_\varphi:=\bigl(D^{m+1}_L\sqcup D^{m+1}_R\bigr)/(u_L\sim\varphi(u)_R) \quad\cong_{\mathrm{Top}}\quad S^{m+1}.Xφ​:=(DLm+1​⊔DRm+1​)/(uL​∼φ(u)R​)≅Top​Sm+1.

This statement is published as SP4Gluing.twistedSphere_homeomorphic. The theorem and its supporting continuity and injectivity lemmas have accepted Lean proofs contributed by carlok. All three accepted proofs have also been checked locally with their proved dependencies. It concerns these explicit topological quotients, not arbitrary homotopy spheres or a prescribed smooth structure.

Seam–interior smooth compatibility

For every regional chart base point, the open-bicollar and left-interior transitions are smooth in both directions. Right-interior-to-seam smoothness requires smooth φ−1\varphi^{-1}φ−1; the reverse requires smooth φ\varphiφ. The single compatibility target concerns exact overlap sources, combining four source results internally. It provides neither a global smooth-manifold instance nor smooth standardness. [Shin, Hemisphere.lean, lines 2439–3577]

Significance

A proof of the main goal would identify every smooth structure in its stated sphere class with the standard one, up to diffeomorphism. A proof of the transported-atlas equivalence instead locates the same unresolved comparison in a different formal language. The distinction matters: constructing a smooth structure by transport is not the same as identifying an arbitrary pre-existing one.

The bridge, explicit disk atlas, and stated collar properties have accepted kernel-checked Lean proofs. The clean atlas equivalence also has a proof with no admitted theorem among its axioms. The conjecture remains open, and Freedman's topological theorem remains unproved in this formal development despite its published mathematical proof.

The topological two-disk gluing result identifies the homeomorphism type of these quotients for every boundary homeomorphism and every disk dimension at least one. The accepted formalization supplies a global topological comparison for this explicit quotient. It does not resolve the comparison with a prescribed smooth structure or recognition of general smooth four-manifolds.

Four supporting algebraic tracks concern orbit coinvariants, homology dimension budgets, finite-support shift rigidity, and Laurent-polynomial positivity. Their source results arose in route-specific obstruction studies. As of 6 September 2026, all eleven theorem targets in these algebraic tracks have accepted Lean proofs. The five additional formal proofs were contributed by wamlart: orbit augmentation, region homology budgets, two-corner homology budgets, the Laurent mass threshold, and mass-two positivity. No theorem currently connects their completion to a proof or disproof of SPC4\mathsf{SPC4}SPC4. They are exploratory tools, not established milestones in a proof of the main goal.

Difficulty

A homeomorphism can transport the standard atlas, but that observation does not compare the transported atlas with the one already specified on the manifold. Treating those two atlases as equal would remove the central mathematical question by changing its hypotheses.

Likewise, topological recognition does not supply a smooth recognition theorem. Standard disk and collar constructions establish local models; they do not establish a smooth gluing or recognition theorem for an arbitrary prescribed smooth structure, a recognition theorem for arbitrary smooth balls, or a smooth Schoenflies theorem. The missing global comparison cannot be replaced by successful finite algebraic tests or by constructing a standard local chart.

Formalization scope

The sphere goal quantifies over Type in universe zero, exactly as in the source. It uses real four-dimensional Euclidean chart models, compactness, the Hausdorff condition, and smoothness of order ∞\infty∞. Boundaryless manifolds are built into that model. No orientation, fixed parametrization, or identity-map uniqueness is imposed.

The geometric foundations use charted spaces, structure groupoids, models with corners, homotopy equivalences and diffeomorphisms. Disk results include every m≥0m\geq0m≥0, so their dimensions are m+1≥1m+1\geq1m+1≥1. The boundary-set identification does not by itself construct a general induced smooth boundary structure. Nor is smoothness asserted for a radial clamp across its nonsmooth locus.

The separate source assertion SPC4Ball is not treated as equivalent to the sphere goal: the required formal boundary, capping and gluing bridge is absent. The transported-annulus product diffeomorphism is not a current target; its chart instances serve only as constructor support. No unconditional implication is taken through the source's admitted Freedman declaration. Gaussian coupling, transport defects, partition incidence and merge-score results remain outside this mission because no mathematical dependency on them has been established.

Selected references

  • R. İnanç Baykur, Robion C. Kirby and Daniel Ruberman, eds., K3 — A New Problem List in Low-Dimensional Topology, Mathematical Surveys and Monographs 295, American Mathematical Society, 2026, Problem 4.1, pp. 191–192. Author PDF.

  • Michael Hartley Freedman, The topology of four-dimensional manifolds, Journal of Differential Geometry 17 (1982), 357–453, Theorem 1.6, p. 371. DOI; primary-article scan.

  • Stephen Smale, Generalized Poincaré's Conjecture in Dimensions Greater Than Four, Annals of Mathematics 74 (1961), 391–406, Theorem A. DOI; primary-article scan.

  • Ryan Shin, SPC4.lean, Bridge.lean and Disk.lean, unpublished source files, 2026; no public manuscript URL available. SHA-256, respectively: b17fdb932034e5211d0db8171c08e2b3a182016bceaecdd2deb49c39d6bfd5cc, e8ea6b66f6bd675ca272e862e0825ab2db1f8bb792eaffe1b9e8f5d89024d302, 889a9eccf9d2350aee7051ab7b6895e565f9f1a0c84e7120fb45c15acae0097e.

  • Ryan Shin, Hemisphere.lean, unpublished Lean source file, 2026, declaration twistedSphereHomeoSphere; source SHA-256 c48843d2c4ec6987acfd7f7ab3a92bfed990376206142e74712795b4e9399828. Published topological two-disk gluing target; the recovered local construction is checked; the accepted proof and its two supporting lemmas were contributed by carlok.

60 thms5 active usersReviewed
🏆Completed
Pure Mathematics·Captain: korbonits

Hatcher Algebraic Topology I: The Fundamental Group of the CircleTextbook

Motivation

The fundamental group π1(X,x0)\pi_1(X, x_0)π1​(X,x0​) is the first algebraic invariant a student of topology meets, and π1(S1)≅Z\pi_1(S^1)\cong\mathbb{Z}π1​(S1)≅Z is the first computation of it that carries real content. Allen Hatcher's Algebraic Topology (Cambridge University Press, 2002; freely available at pi.math.cornell.edu/~hatcher/AT/AT.pdf) is the standard text on the subject. Its Chapter 1 opens with exactly this computation (Theorem 1.7, p. 29) and immediately draws three classical consequences from it: the Fundamental Theorem of Algebra (Theorem 1.8), the Brouwer fixed point theorem for the disk (Theorem 1.9), and the Borsuk–Ulam theorem for the sphere (Theorem 1.10).

This mission is the opening entry in a series that formalizes Hatcher's book capstone by capstone. It covers the subsection "The Fundamental Group of the Circle" of Section 1.1 (pp. 29–33): the covering-space lifting properties that drive the proof, the theorem itself, and its three applications. Later entries in the series (van Kampen's theorem, the classification of covering spaces, simplicial and singular homology) will build on the declarations introduced here, which all live in the shared Lean namespace Hatcher.

Setting

A path in a topological space XXX is a continuous map f:I→Xf : I \to Xf:I→X, where I=[0,1]I = [0,1]I=[0,1]. A homotopy of paths is a family ft:I→Xf_t : I \to Xft​:I→X, 0≤t≤10 \le t \le 10≤t≤1, such that the endpoints ft(0)=x0f_t(0) = x_0ft​(0)=x0​ and ft(1)=x1f_t(1) = x_1ft​(1)=x1​ are independent of ttt and the associated map F:I×I→XF : I \times I \to XF:I×I→X, F(s,t)=ft(s)F(s,t) = f_t(s)F(s,t)=ft​(s), is continuous. A loop at a basepoint x0x_0x0​ is a path with f(0)=f(1)=x0f(0) = f(1) = x_0f(0)=f(1)=x0​. The set of homotopy classes [f][f][f] of loops at x0x_0x0​ is the fundamental group π1(X,x0)\pi_1(X, x_0)π1​(X,x0​); its product is [f][g]=[f⋅g][f][g] = [f\cdot g][f][g]=[f⋅g], where f⋅gf\cdot gf⋅g traverses fff and then ggg, each at double speed (Hatcher, Proposition 1.3).

The circle S1⊂R2S^1 \subset \mathbb{R}^2S1⊂R2 is realised as the unit circle of C\mathbb{C}C, so the point (cos⁡θ,sin⁡θ)(\cos\theta, \sin\theta)(cosθ,sinθ) is eiθe^{i\theta}eiθ and the basepoint (1,0)(1,0)(1,0) is 111. Hatcher's map

p:R→S1,p(s)=(cos⁡2πs,sin⁡2πs)=e2πisp : \mathbb{R} \to S^1, \qquad p(s) = (\cos 2\pi s, \sin 2\pi s) = e^{2\pi i s}p:R→S1,p(s)=(cos2πs,sin2πs)=e2πis

is Hatcher.circleCover. The loops

ωn(s)=(cos⁡2πns,sin⁡2πns)=p(ns),n∈Z,\omega_n(s) = (\cos 2\pi n s, \sin 2\pi n s) = p(ns), \qquad n \in \mathbb{Z},ωn​(s)=(cos2πns,sin2πns)=p(ns),n∈Z,

based at (1,0)(1,0)(1,0) are Hatcher.omegaLoopN n, and ω=ω1\omega = \omega_1ω=ω1​ is Hatcher.omegaLoop; its class [ω]∈π1(S1,1)[\omega] \in \pi_1(S^1, 1)[ω]∈π1​(S1,1) is Hatcher.omegaClass.

A covering space of XXX is a space X~\tilde XX~ together with a map p:X~→Xp : \tilde X \to Xp:X~→X such that every x∈Xx \in Xx∈X has an open neighbourhood UUU for which p−1(U)p^{-1}(U)p−1(U) is a disjoint union of open sets each mapped homeomorphically onto UUU by ppp (Hatcher's condition (∗)(\ast)(∗), p. 29; such a UUU is evenly covered). A lift of a map f:Y→Xf : Y \to Xf:Y→X is a map f~:Y→X~\tilde f : Y \to \tilde Xf~​:Y→X~ with p∘f~=fp \circ \tilde f = fp∘f~​=f.

Formalization targets

Goal (Theorem 1.7)

π1(S1,1)\pi_1(S^1, 1)π1​(S1,1) is an infinite cyclic group generated by [ω][\omega][ω]. In the form stated in Lean:

∀ g∈π1(S1,1)∃! n∈Z:[ω]n=g.\forall\, g \in \pi_1(S^1, 1)\quad \exists!\, n \in \mathbb{Z}:\quad [\omega]^n = g.∀g∈π1​(S1,1)∃!n∈Z:[ω]n=g.

Surjectivity of n↦[ω]nn \mapsto [\omega]^nn↦[ω]n says [ω][\omega][ω] generates; uniqueness of nnn says the group is infinite cyclic rather than finite.

Milestones on the road to the goal

  1. p(s)=e2πisp(s) = e^{2\pi i s}p(s)=e2πis is a covering space of S1S^1S1 (Hatcher, p. 29).
  2. Homotopy lifting property (c): for a covering space p:X~→Xp : \tilde X \to Xp:X~→X, a map F:Y×I→XF : Y \times I \to XF:Y×I→X and a lift of F∣Y×{0}F|_{Y \times \{0\}}F∣Y×{0}​ extend uniquely to a lift of FFF (p. 30).
  3. Path lifting property (a): a path fff starting at x0x_0x0​ and a point x~0∈p−1(x0)\tilde x_0 \in p^{-1}(x_0)x~0​∈p−1(x0​) determine a unique lift f~\tilde ff~​ starting at x~0\tilde x_0x~0​ (p. 29).
  4. Lifting homotopies of paths (b): a homotopy of paths ftf_tft​ starting at x0x_0x0​ lifts uniquely to a homotopy of paths f~t\tilde f_tf~​t​ starting at x~0\tilde x_0x~0​ (p. 29).
  5. Every loop in S1S^1S1 at (1,0)(1,0)(1,0) is homotopic to ωn\omega_nωn​ for a unique n∈Zn \in \mathbb{Z}n∈Z (the reformulation of Theorem 1.7 that Hatcher actually proves, p. 29).
  6. [ω]n=[ωn][\omega]^n = [\omega_n][ω]n=[ωn​] for every n∈Zn \in \mathbb{Z}n∈Z (Hatcher's remark after Theorem 1.7, p. 29).

Applications (Theorems 1.8–1.10)

Every nonconstant f∈C[z] has a root in C.\text{Every nonconstant } f \in \mathbb{C}[z] \text{ has a root in } \mathbb{C}.Every nonconstant f∈C[z] has a root in C. Every continuous h:D2→D2 has a fixed point.\text{Every continuous } h : D^2 \to D^2 \text{ has a fixed point.}Every continuous h:D2→D2 has a fixed point. Every continuous f:S2→R2 satisfies f(x)=f(−x) for some x∈S2.\text{Every continuous } f : S^2 \to \mathbb{R}^2 \text{ satisfies } f(x) = f(-x) \text{ for some } x \in S^2.Every continuous f:S2→R2 satisfies f(x)=f(−x) for some x∈S2.

Significance

The result itself. The computation π1(S1)≅Z\pi_1(S^1) \cong \mathbb{Z}π1​(S1)≅Z assigns to every loop in the circle an integer, its winding number, and shows that this integer is the only homotopy invariant of the loop. It is the seed of degree theory, and in Hatcher's text it is the starting point for every later computation of fundamental groups (products, van Kampen, covering spaces). The three applications are the standard demonstration that a single algebraic invariant can settle purely geometric or algebraic existence questions.

Formalizing it. Mathlib (revision 0df444a) already contains the covering-space infrastructure: IsCoveringMap, path lifting (IsCoveringMap.liftPath, eq_liftPath_iff'), homotopy lifting (IsCoveringMap.liftHomotopy, eq_liftHomotopy_iff'), monodromy, and the fact that Circle.exp is a covering map (Circle.isCoveringMap_exp). It also has FundamentalGroup X x as the endomorphism group of the fundamental groupoid. It does not contain the computation π1(S1)≅Z\pi_1(S^1) \cong \mathbb{Z}π1​(S1)≅Z, nor the two-dimensional Brouwer and Borsuk–Ulam theorems. The Fundamental Theorem of Algebra is in Mathlib as Complex.exists_root (proved by Liouville's theorem rather than by Hatcher's argument); it is kept as a milestone because it is one of the section's stated theorems, and a solver may close it directly from Mathlib. Milestones 2–4 are also within reach of the existing lifting API, but they are the lemmas Hatcher states and uses, and a faithful record of them in the mission's own namespace is what later entries in the series will import.

Difficulty

The obvious first idea for the goal is to define the winding number of a loop through the complex argument. That fails because arg⁡\argarg is discontinuous on S1S^1S1; the integer has to be produced by lifting the loop through ppp and reading off the endpoint of the lift, which is only well defined because of the uniqueness in the path lifting property. The second difficulty is uniqueness of nnn: this needs lifting of homotopies (milestone 4), not just of paths, together with the observation that a lifted homotopy of paths has constant endpoints.

Connecting the concrete loops to Mathlib's abstract π1\pi_1π1​ is its own obstacle. FundamentalGroup Circle 1 multiplies by composing morphisms of the fundamental groupoid, so identifying [ω]n[\omega]^n[ω]n with the class of the explicit loop ωn\omega_nωn​ (milestone 6) requires reparametrization arguments for concatenated paths, for negative nnn as well as positive.

For Theorem 1.9 the difficulty is the construction and continuity of the retraction r:D2→S1r : D^2 \to S^1r:D2→S1 from a fixed-point-free map, and then the non-existence of a retraction, which uses that π1(S1)≠0\pi_1(S^1) \neq 0π1​(S1)=0. For Theorem 1.10 Hatcher's proof lifts a loop g(s)=f(cos⁡2πs,sin⁡2πs)/∣⋯∣g(s) = f(\cos 2\pi s, \sin 2\pi s)/\lvert \cdots \rvertg(s)=f(cos2πs,sin2πs)/∣⋯∣ through ppp and shows the lift changes by an odd integer over half a turn; making that parity argument rigorous in Lean is the substance of the milestone.

Formalization scope

  • S1S^1S1 is Circle (the unit circle in C\mathbb{C}C) with basepoint 1; D2D^2D2 is Metric.closedBall (0 : EuclideanSpace ℝ (Fin 2)) 1; S2S^2S2 is Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1, with −x-x−x the antipodal point.
  • A covering space is Mathlib's IsCoveringMap p. This agrees with Hatcher's condition (∗)(\ast)(∗); neither requires ppp to be surjective.
  • Paths are continuous maps C(I, X) or Mathlib Paths; for homotopies of paths, the square is written I × I with Hatcher's coordinate order F(s,t)=ft(s)F(s,t) = f_t(s)F(s,t)=ft​(s): the first coordinate is the path parameter, the second the homotopy parameter. In the general homotopy lifting property the domain is Y × I with YYY an arbitrary topological space, as in Hatcher.
  • π1(S1,1)\pi_1(S^1, 1)π1​(S1,1) is Mathlib's FundamentalGroup Circle 1, and [ω][\omega][ω] is FundamentalGroup.fromPath ⟦omegaLoop⟧. Because the goal quantifies over integer powers of a single element, the order of multiplication in FundamentalGroup is immaterial to its truth.
  • The goal is stated as ∀g ∃!n, [ω]n=g\forall g\, \exists! n,\ [\omega]^n = g∀g∃!n, [ω]n=g rather than as an abstract isomorphism with Z\mathbb{Z}Z, so that the generator is pinned to Hatcher's explicit loop; an isomorphism FundamentalGroup Circle 1 ≃* Multiplicative ℤ sending [ω][\omega][ω] to 111 is an immediate corollary and a welcome contribution.
  • "Nonconstant polynomial" is 0 < f.degree, which excludes both the zero polynomial and nonzero constants.

Contributions welcome: proofs of the milestones from Mathlib's lifting API, a degree homomorphism π1(S1,1)→Z\pi_1(S^1,1) \to \mathbb{Z}π1​(S1,1)→Z packaged for reuse, and any lemma about concatenation and reparametrization of loops in Circle that later chapters of the series can import.

Selected references

  • A. Hatcher, Algebraic Topology, Cambridge University Press, 2002. Section 1.1, "The Fundamental Group of the Circle", pp. 29–33. https://pi.math.cornell.edu/~hatcher/AT/AT.pdf
  • L. E. J. Brouwer, Über Abbildung von Mannigfaltigkeiten, Mathematische Annalen 71 (1911), 97–115. https://doi.org/10.1007/BF01456931
  • K. Borsuk, Drei Sätze über die n-dimensionale euklidische Sphäre, Fundamenta Mathematicae 20 (1933), 177–190. https://doi.org/10.4064/fm-20-1-177-190
  • Mathlib, Mathlib/Topology/Homotopy/Lifting.lean (path and homotopy lifting for covering maps). https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Topology/Homotopy/Lifting.lean
  • Mathlib, Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean (the fundamental group). https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean
11 thms4 active usersReviewed
🏆Completed
Group TheoryMathematical PhysicsRepresentation Theory·Captain: Alien60

Frobenius–Mednykh: Counting Surface-Group Homomorphisms into a Finite GroupResearch Paper

Motivation

How many ways can a closed orientable surface of genus ggg be "coloured" by a finite group GGG? Precisely: how many group homomorphisms π1(Σg)→G\pi_1(\Sigma_g)\to Gπ1​(Σg​)→G are there? The answer is the partition function of two-dimensional Dijkgraaf–Witten theory with gauge group GGG. That theory is the simplest topological quantum field theory (TQFT) in the sense of Atiyah and Segal, and the standard test case for gauge theory with a finite gauge group (Dijkgraaf–Witten 1990, Freed–Quinn 1993). The count has a closed form in terms of the dimensions of the irreducible representations of GGG alone. It is known as Mednykh's formula.

Timeline. Frobenius (1896) counted pairs with a prescribed commutator, #{(a,b):[a,b]=z}\#\{(a,b):[a,b]=z\}#{(a,b):[a,b]=z}, in terms of characters, which is the genus-one case. Frobenius and Schur (1906) treated the non-orientable analogue. Mednykh (1978) proved the formula for every genus using character theory and the standard presentation of π1(Σg)\pi_1(\Sigma_g)π1​(Σg​). It was rediscovered in physics as the partition function of 2D and 3D finite-gauge-group TQFTs (Freed–Quinn 1993), and reproved with matrix integrals (Mulase–Yu 2005) and with lattice TQFTs (Snyder 2007). The last paper fixes the form of the statement used here.

Setting

Let GGG be a finite group. A surface tuple of genus ggg in GGG is a family x=((x1,y1),…,(xg,yg))∈(G×G)gx=((x_1,y_1),\dots,(x_g,y_g))\in(G\times G)^gx=((x1​,y1​),…,(xg​,yg​))∈(G×G)g. Its commutator product is

commProd(x)=[x1,y1] [x2,y2]⋯[xg,yg],[x,y]=xyx−1y−1,\mathrm{commProd}(x)=[x_1,y_1]\,[x_2,y_2]\cdots[x_g,y_g],\qquad [x,y]=xyx^{-1}y^{-1},commProd(x)=[x1​,y1​][x2​,y2​]⋯[xg​,yg​],[x,y]=xyx−1y−1,

multiplied left to right. For z∈Gz\in Gz∈G let Ng(z)=#{x∈(G×G)g:commProd(x)=z}N_g(z)=\#\{x\in(G\times G)^g:\mathrm{commProd}(x)=z\}Ng​(z)=#{x∈(G×G)g:commProd(x)=z} (commCount G g z). The surface group Γg\Gamma_gΓg​ (SurfaceGroup g) is the presented group

Γg=⟨a1,b1,…,ag,bg∣[a1,b1]⋯[ag,bg]⟩,\Gamma_g=\langle a_1,b_1,\dots,a_g,b_g\mid [a_1,b_1]\cdots[a_g,b_g]\rangle,Γg​=⟨a1​,b1​,…,ag​,bg​∣[a1​,b1​]⋯[ag​,bg​]⟩,

the standard presentation of the fundamental group of the closed orientable surface Σg\Sigma_gΣg​ of genus ggg, whose Euler characteristic is χ(Σg)=2−2g\chi(\Sigma_g)=2-2gχ(Σg​)=2−2g.

A complete irreducible family (IrrepFamily G ι) is a finite family (Vi)i∈ι(V_i)_{i\in\iota}(Vi​)i∈ι​ of finite-dimensional complex representations of GGG that are irreducible, pairwise non-isomorphic, and such that every irreducible finite-dimensional complex representation is isomorphic to some ViV_iVi​. Write di=dim⁡CVid_i=\dim_{\mathbb C}V_idi​=dimC​Vi​ and χi(g)=tr⁡Vi(g)\chi_i(g)=\operatorname{tr}V_i(g)χi​(g)=trVi​(g) for the character.

Formalization targets

Goal: Mednykh's formula

For every finite group GGG, every complete irreducible family and every g≥0g\ge 0g≥0,

∑i∈ιdi 2−2g  =  ∣G∣ 1−2g  #Hom⁡(Γg,G),\sum_{i\in\iota} d_i^{\,2-2g}\;=\;|G|^{\,1-2g}\;\#\operatorname{Hom}(\Gamma_g,G),i∈ι∑​di2−2g​=∣G∣1−2g#Hom(Γg​,G),

which is Mulase–Yu, Thm. 1.1 and Snyder, eq. (1) with χ(S)=2−2g\chi(S)=2-2gχ(S)=2−2g. Equivalently, #Hom⁡(Γg,G)=∣G∣∑i(∣G∣/di)2g−2\#\operatorname{Hom}(\Gamma_g,G)=|G|\sum_i(|G|/d_i)^{2g-2}#Hom(Γg​,G)=∣G∣∑i​(∣G∣/di​)2g−2. Exponents are integers: at g=0g=0g=0 the formula reads ∑idi2=∣G∣\sum_i d_i^2=|G|∑i​di2​=∣G∣.

Milestones

The milestones follow the algebraic proof of the counting formula recorded in Mulase–Yu 2002, §4, which goes back to Frobenius and Mednykh. Write (x⋆y)(w)=∑σ∈Gx(wσ−1) y(σ)(x\star y)(w)=\sum_{\sigma\in G}x(w\sigma^{-1})\,y(\sigma)(x⋆y)(w)=∑σ∈G​x(wσ−1)y(σ) for the convolution of functions on GGG.

  • M0. A complete irreducible family exists, with finite index type.
  • M1. #Hom⁡(Γg,G)=Ng(1)\#\operatorname{Hom}(\Gamma_g,G)=N_g(1)#Hom(Γg​,G)=Ng​(1).
  • M2. ∑idi χi(z)=∣G∣\sum_i d_i\,\chi_i(z)=|G|∑i​di​χi​(z)=∣G∣ if z=1z=1z=1 and 000 otherwise.
  • M3. For irreducible VVV of dimension ddd: \sum_{a\in G}\chi_V(axa^{-1}y)= rac{|G|}{d}\chi_V(x)\chi_V(y).
  • M4 (Mulase–Yu eq. (4.2)). For irreducible V,WV,WV,W: χV⋆χW\chi_V\star\chi_WχV​⋆χW​ equals rac{|G|}{d_V}\chi_V if V≅WV\cong WV≅W and 000 otherwise.
  • M5 (Frobenius). N1(z)=∣G∣∑iχi(z)/diN_1(z)=|G|\sum_i\chi_i(z)/d_iN1​(z)=∣G∣∑i​χi​(z)/di​.
  • M6. Ng1+g2=Ng1⋆Ng2N_{g_1+g_2}=N_{g_1}\star N_{g_2}Ng1​+g2​​=Ng1​​⋆Ng2​​.
  • M7 (Mulase–Yu Thm. 4.1). Ng(z)=∣G∣2g−1∑iχi(z) di 1−2gN_g(z)=|G|^{2g-1}\sum_i\chi_i(z)\,d_i^{\,1-2g}Ng​(z)=∣G∣2g−1∑i​χi​(z)di1−2g​ for all g≥0g\ge0g≥0, z∈Gz\in Gz∈G. Mulase–Yu state it for g≥1g\ge1g≥1; the case g=0g=0g=0 is M2.

Significance

The result. The formula says that the number of GGG-coloured genus-ggg surfaces is a function of the multiset of irreducible dimensions alone. Two groups with the same character degrees (for example D4D_4D4​ and Q8Q_8Q8​, both with degrees 1,1,1,1,21,1,1,1,21,1,1,1,2) have equally many homomorphisms from every surface group, even though the groups are not isomorphic. In TQFT language the left side is the evaluation ε(hg)\varepsilon(h^{g})ε(hg) of the Frobenius algebra Z(C[G])Z(\mathbb C[G])Z(C[G]), where hhh is its handle element. The right side is the gauge-theoretic state sum. The identity is the two-dimensional instance of the agreement between the Atiyah–Segal gluing description and the path-integral description of a TQFT. It also gives the volume of the moduli space of flat GGG-bundles on Σg\Sigma_gΣg​, and it underlies counts of covering spaces of surfaces.

Formalizing it. The theorem is classical and fully proved; to our knowledge it has no machine-checked proof. Mathlib has characters of finite-dimensional representations, their orthonormality (FDRep.char_orthonormal) and Maschke's theorem. It lacks the completeness of irreducible characters, the column orthogonality relation (M2), and any statement linking class sums to characters (M3). These are reusable well beyond this mission. The mission also produces the first formal link between a surface-group presentation and representation theory.

Difficulty

The available orthogonality is the row relation between two irreducible characters. Every step here needs the column relation M2, ∑idiχi(z)=∣G∣δz,1\sum_i d_i\chi_i(z)=|G|\delta_{z,1}∑i​di​χi​(z)=∣G∣δz,1​. That relation is equivalent to the decomposition of the regular representation C[G]≅⨁iVi⊕di\mathbb C[G]\cong\bigoplus_i V_i^{\oplus d_i}C[G]≅⨁i​Vi⊕di​​, and in particular to the finiteness and completeness of the irreducible family. Mathlib has no such decomposition. The convolution identity M4 must also be established in its non-isomorphic case, which the row relation alone does not give in convolution form. The passage from Hom⁡(Γg,G)\operatorname{Hom}(\Gamma_g,G)Hom(Γg​,G) to tuples (M1) depends on the universal property of PresentedGroup and on using one ordering of the commutator product throughout. A proof that bypasses characters by brute counting is not available for general GGG.

Formalization scope

All representations are over C\mathbb CC: FDRep ℂ G with G : Type a Group with [Fintype G]. Characters are FDRep.character and did_idi​ is Module.finrank ℂ (V i). Counts are Nat.card. Powers with exponents depending on ggg are integer powers (zpow) in C\mathbb CC, so g=0g=0g=0 is included and no natural-number truncation occurs. Γg\Gamma_gΓg​ is PresentedGroup on generators Fin g × Bool, with aj=(j,false)a_j=(j,\mathrm{false})aj​=(j,false), bj=(j,true)b_j=(j,\mathrm{true})bj​=(j,true) and the single relator (List.ofFn fun j => ⁅a_j, b_j⁆).prod. This is the standard presentation and stands in for π1(Σg)\pi_1(\Sigma_g)π1​(Σg​), since Mathlib has no fundamental groups of closed surfaces. The goal quantifies over every complete irreducible family. M0 shows that such families exist, so the goal is not vacuous. Because the family must be complete and pairwise non-isomorphic, it cannot be chosen to make the sums trivial.

Out of scope: the non-orientable formula of Frobenius–Schur (it needs Frobenius–Schur indicators), positive characteristic, and the bordism-category formulation of TQFTs. Reusable contributions are especially welcome: the decomposition of the regular representation, column orthogonality, and the class-sum Schur lemma.

Selected references

  • N. Snyder, Mednykh's formula via lattice topological quantum field theories, arXiv:math/0703073 (2007). https://arxiv.org/abs/math/0703073
  • A. D. Mednykh, Determination of the number of nonequivalent coverings over a compact Riemann surface, Dokl. Akad. Nauk SSSR 239 (1978) 269–271; English transl. Soviet Math. Dokl. 19 (1978) 318–320.
  • R. Dijkgraaf, E. Witten, Topological gauge theories and group cohomology, Commun. Math. Phys. 129 (1990) 393–429. https://doi.org/10.1007/BF02096988
  • D. S. Freed, F. Quinn, Chern–Simons theory with finite gauge group, Commun. Math. Phys. 156 (1993) 435–472. https://arxiv.org/abs/hep-th/9111004
  • M. Mulase, J. T. Yu, A generating function of the number of homomorphisms from a surface group into a finite group, arXiv:math/0209008 (2002), §4 (algebraic proof). https://arxiv.org/abs/math/0209008
  • M. Mulase, J. T. Yu, Non-commutative matrix integrals and representation varieties of surface groups in a finite group, Ann. Inst. Fourier 55 (2005) 1001–1036. https://arxiv.org/abs/math/0211127
  • J. Kock, Frobenius Algebras and 2D Topological Quantum Field Theories, LMS Student Texts 59, Cambridge Univ. Press (2003). https://doi.org/10.1017/CBO9780511615443
10 thms2 active usersReviewed
Algorithmic Game TheoryTopology·Captain: mikedeng1

Equipartition of a Segment: Every Continuous Function on Subsegments of [0, 1] Vanishing on Degenerate Segments Takes Equal Values on Some Partition of [0, 1] into m SegmentsResearch Paper

Motivation

In fair division, a value may be assigned to each interval that a cut produces. If the value is continuous in the interval's endpoints, an equal-value partition is a natural target. Some valuations are nonnegative and additive, but a difference of competing measures or a signed utility need have neither property. Avvakumov and Karasev establish equal-value partitions even when the value changes sign and is not additive, provided it vanishes on degenerate intervals. Their result is used by Bogomolnaia and Moulin in work on guarantees for fair division. Avvakumov and Karasev, pp. 1–2; Bogomolnaia and Moulin.

The paper identifies earlier special cases: a nonnegative valuation follows from the Knaster–Kuratowski–Mazurkiewicz theorem; prime-power numbers of parts with a valuation of varying sign were known through degree-theoretic results; additive valuations admit an elementary argument. The remaining case permits a sign-changing, nonadditive valuation and an arbitrary positive number of parts. The authors distinguish this from an envy-free division problem with separate valuations for several players, which they state remains open outside prime-power cases. Avvakumov and Karasev, p. 2; Avvakumov and Karasev, Envy-free division using mapping degree; Meunier and Zerbib.

Setting

Write I\mathcal II for the set of all subsegments I=[a,b]I=[a,b]I=[a,b] of [0,1][0,1][0,1] with 0≤a≤b≤10\le a\le b\le10≤a≤b≤1. An interval may be degenerate, meaning a=ba=ba=b. A real-valued function fff on I\mathcal II is continuous when its value varies continuously with the two endpoints. The required boundary condition is f([a,a])=0f([a,a])=0f([a,a])=0 for every a∈[0,1]a\in[0,1]a∈[0,1]. No sign, monotonicity, or additivity condition is imposed. A partition into mmm parts is a sequence 0=x0≤x1≤⋯≤xm=10=x_0\le x_1\le\cdots\le x_m=10=x0​≤x1​≤⋯≤xm​=1, so its parts [xj−1,xj][x_{j-1},x_j][xj−1​,xj​] may also be degenerate. Avvakumov and Karasev, Theorem 1.1, pp. 1–2.

The intermediate setting is a nice multivalued function. Its graph is a compact subset ZZZ of I×(−1,1)\mathcal I\times(-1,1)I×(−1,1). The graph separates the bottom I×{−1}\mathcal I\times\{-1\}I×{−1} from the top I×{1}\mathcal I\times\{1\}I×{1} inside the cylinder C=I×[−1,1]C=\mathcal I\times[-1,1]C=I×[−1,1]: those two sides lie in different connected components of C∖ZC\setminus ZC∖Z. A representation of a nice graph is a continuous real function φ\varphiφ on CCC that is negative on the bottom, positive on the top, and whose zero set is the graph. The paper passes between graphs and representations in Lemma 2.2. Avvakumov and Karasev, Definition 2.1 and Lemma 2.2, p. 2.

For a prime ppp, a segment I=[a,b]I=[a,b]I=[a,b], and a value yyy, a zero partition is a sequence a=x0≤⋯≤xp=ba=x_0\le\cdots\le x_p=ba=x0​≤⋯≤xp​=b such that φ([xj−1,xj],y)=0\varphi([x_{j-1},x_j],y)=0φ([xj−1​,xj​],y)=0 for each j=1,…,pj=1,\ldots,pj=1,…,p. The set Zp(φ)Z_p(\varphi)Zp​(φ) contains exactly those pairs (I,y)(I,y)(I,y) that admit a zero partition. This is the projection to the cylinder of the paper's simultaneous-solution set SSS for labeled partitions. Avvakumov and Karasev, equation (4.1) and Claim 4.4, pp. 7–9.

Formalization targets

The goal is Theorem 1.1: for every positive integer mmm and every continuous fff satisfying the degenerate-interval condition, there are possibly repeated cut points with a common value:

0=x0≤x1≤⋯≤xm=1,f([x0,x1])=⋯=f([xm−1,xm]).0=x_0\le x_1\le\cdots\le x_m=1,\qquad f([x_0,x_1])=\cdots=f([x_{m-1},x_m]).0=x0​≤x1​≤⋯≤xm​=1,f([x0​,x1​])=⋯=f([xm−1​,xm​]).

The theorem is already posed as the Open platform statement FairGuarantees.DivideChoose.theorem_of_4; this mission references that exact statement as its goal. It supplies the paper's supporting statements, including Lemma 2.2 on graph representations, Claim 4.4 on separation by projected zero partitions, and the prime-step Lemma 2.3. The latter asserts that, when φ([a,a],y)=y\varphi([a,a],y)=yφ([a,a],y)=y, there is a represented nice graph with the same degenerate identity whose zeros each yield a zero partition for φ\varphiφ. The milestone list includes the fixed-segment and continuous-family statements used to characterize Zp(φ)Z_p(\varphi)Zp​(φ), and equation (4.2) describing its degenerate boundary. Avvakumov and Karasev, Lemmas 2.2–2.3, pp. 2–3; Claims 4.3–4.4 and equation (4.2), pp. 8–9.

Significance

The theorem guarantees equal values for any positive number of consecutive parts under only endpoint continuity and the zero-on-degenerates condition. It covers valuations for which nonnegative or additive special-case results give no conclusion. It also provides the theorem invoked in the fair-guarantee application cited by the authors. Avvakumov and Karasev, pp. 1–2; Bogomolnaia and Moulin.

The mathematical result was proved in the paper; the platform's theorem statement remains Open and lacks a machine-checked proof there. Formalizing the paper's intermediate claims makes its topological assumptions and its treatment of degenerate parts explicit. The definitions of a separating graph, its representation, and zero partitions can also be reused for related partition problems. The present mission states the paper's prime-step targets, leaving the proofs and the underlying equivariant topology as work for solvers.

Difficulty

For a fixed signed valuation, continuity alone does not select one common value that works across every piece of an arbitrary partition. The nonnegative case has a simplex-covering argument, but that argument does not directly control values of both signs. In the paper's general case, the difficult claim is that the projected simultaneous-zero set separates an entire cylinder, even as the segment varies. Its source proof requires a mod-ppp statement for a space of labeled partitions and control of the resulting solution set. A further boundary issue arises on degenerate segments: a representation of the projected graph must satisfy ψ([a,a],y)=y\psi([a,a],y)=yψ([a,a],y)=y, not merely have the right zeros. Avvakumov and Karasev, pp. 2, 7–10.

Formalization scope

Lean represents I=[a,b]I=[a,b]I=[a,b] by the endpoint pair (a,b)(a,b)(a,b) with 0≤a≤b≤10\le a\le b\le10≤a≤b≤1. The cylinder uses the closed value range [−1,1][-1,1][−1,1]; a nice graph lies in its open interior (−1,1)(-1,1)(−1,1). Functions are total Lean functions, but only their values on this cylinder enter the definitions and results. Continuity is required on the cylinder. Separation uses connected components of its complement, as in Definition 2.1, and explicitly requires the bottom and top to avoid the graph. This prevents a graph containing a boundary side from satisfying separation vacuously.

Every prime-step claim assumes ppp prime, the representation's strict boundary signs, and the degenerate identity. Zero partitions have exactly ppp consecutive parts whose endpoints are pinned to the original segment; repeated cuts are allowed. The goal reference likewise permits degenerate parts and assumes m≥1m\ge1m≥1. The projected set is defined through existence of an ordinary ordered partition, independent of how the paper labels partitions in its configuration space. The needed existing Lean notions include ContinuousOn, IsCompact, connectedComponentIn, finite index types, and Nat.Prime. A complete proof development also needs results about the paper's labeled-partition complex, equivariant cycles and transverse maps. Contributions establishing that reusable topology, as well as proofs of the stated milestones, are within scope. Avvakumov and Karasev, §§2–4.

Selected references

  • Sergey Avvakumov and Roman Karasev, Equipartition of a Segment, Mathematics of Operations Research, 2023. arXiv:2009.09862v4.
  • Anna Bogomolnaia and Hervé Moulin, Guarantees in Fair Division: General or Monotone Preferences, 2019. arXiv:1911.10009v3.
  • Sergey Avvakumov and Roman Karasev, Envy-Free Division Using Mapping Degree, Mathematika 67, 2021. arXiv:1907.11183.
  • Frédéric Meunier and Shira Zerbib, Envy-Free Cake Division Without Assuming the Players Prefer Nonempty Pieces, Israel Journal of Mathematics 234, 2019. arXiv:1804.00449.
10 thms2 active usersReviewed
Geometry & Topology·Captain: Lucas

Smale's question: the homotopy type of Diff(S⁴)Open Problem

Motivation

The diffeomorphism group Diff(M)\mathrm{Diff}(M)Diff(M) of a closed smooth manifold MMM, topologized so that two diffeomorphisms are close when they and all their derivatives are uniformly close, is a basic invariant of the smooth structure of MMM. Its set of path components π0 Diff(M)\pi_0\,\mathrm{Diff}(M)π0​Diff(M) is the group of isotopy classes of diffeomorphisms (the smooth mapping class group), and its higher homotopy groups classify smooth fibre bundles with fibre MMM. For spheres, the natural comparison is with the orthogonal group O(n+1)O(n+1)O(n+1) of isometries of the round metric, which sits inside Diff(Sn)\mathrm{Diff}(S^n)Diff(Sn).

S. Smale asked how far Diff(Sn)\mathrm{Diff}(S^n)Diff(Sn) is from O(n+1)O(n+1)O(n+1). The question was settled positively in dimensions n≤3n \le 3n≤3 and has been studied extensively in dimensions n≥5n \ge 5n≥5, where surgery theory and pseudo-isotopy theory apply. Dimension 444 is the remaining case, and it is where the least is known. The question is recorded on the Open Problem Garden (problem page) with importance "Outstanding".

Timeline.

  • 1959 — S. Smale: Diff(S2)≃O(3)\mathrm{Diff}(S^2) \simeq O(3)Diff(S2)≃O(3).
  • 1963 — M. Kervaire and J. Milnor compute the groups Θn\Theta_nΘn​ of homotopy spheres; combined with Cerf's pseudo-isotopy theorem this computes π0 Diff(Sn)\pi_0\,\mathrm{Diff}(S^n)π0​Diff(Sn) for many n≥5n \ge 5n≥5 (for example π0 Diff+(S6)≅Θ7≅Z/28\pi_0\,\mathrm{Diff}^+(S^6) \cong \Theta_7 \cong \mathbb Z/28π0​Diff+(S6)≅Θ7​≅Z/28).
  • 1970s — the Cerf–Morlet comparison theorem Diff(Dn)≃Ωn+1(PLn/On)\mathrm{Diff}(D^n) \simeq \Omega^{n+1}(PL_n/O_n)Diff(Dn)≃Ωn+1(PLn​/On​) (Kirby–Siebenmann, Foundational Essays).
  • 1978 — F.T. Farrell and W.C. Hsiang compute πi Diff(Dn)⊗Q\pi_i\,\mathrm{Diff}(D^n)\otimes\mathbb Qπi​Diff(Dn)⊗Q in a stable range of degrees for large nnn.
  • 1983 — A. Hatcher: Diff(S3)≃O(4)\mathrm{Diff}(S^3) \simeq O(4)Diff(S3)≃O(4) (the Smale conjecture).
  • 2007 — R. Budney: Diff(D4)\mathrm{Diff}(D^4)Diff(D4) is a 555-fold loop space, via little cubes acting on spaces of long knots.
  • 2018 — T. Watanabe: π∗ Diff(D4)⊗Q≠0\pi_*\,\mathrm{Diff}(D^4)\otimes\mathbb Q \ne 0π∗​Diff(D4)⊗Q=0; the 444-dimensional Smale conjecture is false (arXiv:1812.02448).

Whether Diff(D4)\mathrm{Diff}(D^4)Diff(D4) is connected is still unknown.

Setting

Write Rn\mathbb R^nRn for Euclidean space with the Euclidean norm, DnD^nDn for the closed unit ball and Sn⊂Rn+1S^n \subset \mathbb R^{n+1}Sn⊂Rn+1 for the round unit sphere.

  • Diff(Dn)\mathrm{Diff}(D^n)Diff(Dn) is the group of diffeomorphisms of the nnn-ball rel boundary. Concretely it is the group of smooth diffeomorphisms f ⁣:Rn→Rnf\colon \mathbb R^n \to \mathbb R^nf:Rn→Rn with f(x)=xf(x) = xf(x)=x whenever ∥x∥≥1\|x\| \ge 1∥x∥≥1. Two such maps are close when their kkk-th derivatives are uniformly close for every kkk (the C∞C^\inftyC∞ topology). The base point is the identity.
  • Diff(Sn)\mathrm{Diff}(S^n)Diff(Sn) is the group of all smooth diffeomorphisms of SnS^nSn (orientation-preserving or orientation-reversing), with the C∞C^\inftyC∞ topology. Derivatives are measured through the degree-one homogeneous extension x↦∥x∥ f(x/∥x∥)x \mapsto \|x\|\, f(x/\|x\|)x↦∥x∥f(x/∥x∥), taken on the sphere.
  • O(n)O(n)O(n) is the group of real orthogonal n×nn\times nn×n matrices with the matrix topology.
  • X≃YX \simeq YX≃Y means that XXX and YYY are homotopy equivalent. π0X\pi_0 Xπ0​X is the set of path components, and πi(X,x)\pi_i(X,x)πi​(X,x) is the iii-th homotopy group. Ωk(Y,y)\Omega^k(Y,y)Ωk(Y,y) is the kkk-fold loop space, the space of maps [0,1]k→Y[0,1]^k \to Y[0,1]k→Y sending the boundary of the cube to yyy.

The source states that Diff(S4)≃O(5)×Diff(D4)\mathrm{Diff}(S^4) \simeq O(5) \times \mathrm{Diff}(D^4)Diff(S4)≃O(5)×Diff(D4), so the homotopy type of Diff(S4)\mathrm{Diff}(S^4)Diff(S4) is determined by that of Diff(D4)\mathrm{Diff}(D^4)Diff(D4).

Formalization targets

Goal: connectivity of Diff(D4)\mathrm{Diff}(D^4)Diff(D4)

π0 Diff(D4)=0,i.e. Diff(D4) is path-connected.\pi_0\,\mathrm{Diff}(D^4) = 0, \qquad\text{i.e. } \mathrm{Diff}(D^4) \text{ is path-connected.}π0​Diff(D4)=0,i.e. Diff(D4) is path-connected.

The source asks to "determine some (any?) homotopy or homology groups of Diff(D4)\mathrm{Diff}(D^4)Diff(D4)" and singles out connectivity as unknown. The goal is the yes/no question for π0\pi_0π0​. It can be settled either way: a proof shows that every diffeomorphism of D4D^4D4 rel boundary is isotopic to the identity, and a disproof exhibits one that is not.

Milestones

  1. Diff(S4)≃O(5)×Diff(D4)\mathrm{Diff}(S^4) \simeq O(5)\times\mathrm{Diff}(D^4)Diff(S4)≃O(5)×Diff(D4) (problem statement).
  2. Diff(D4)≃Ω5(Y,y)\mathrm{Diff}(D^4) \simeq \Omega^5(Y,y)Diff(D4)≃Ω5(Y,y) for some pointed space (Y,y)(Y,y)(Y,y) (Cerf–Morlet, Budney).
  3. Diff(D4)\mathrm{Diff}(D^4)Diff(D4) is not contractible (Watanabe).
  4. Diff(S2)≃O(3)\mathrm{Diff}(S^2) \simeq O(3)Diff(S2)≃O(3) (Smale).
  5. Diff(S3)≃O(4)\mathrm{Diff}(S^3) \simeq O(4)Diff(S3)≃O(4) (Hatcher).
  6. ∣π0 Diff(S6)∣=56|\pi_0\,\mathrm{Diff}(S^6)| = 56∣π0​Diff(S6)∣=56 (Kervaire–Milnor and Cerf).
  7. For 2≤i<min⁡{n−43,n−72}2 \le i < \min\{\tfrac{n-4}{3}, \tfrac{n-7}{2}\}2≤i<min{3n−4​,2n−7​}: πi Diff(Dn)⊗Q≅Q\pi_i\,\mathrm{Diff}(D^n)\otimes\mathbb Q \cong \mathbb Qπi​Diff(Dn)⊗Q≅Q if nnn is odd and 4∣i+14 \mid i+14∣i+1, and 000 otherwise (Farrell–Hsiang).

Significance

The result itself. A positive answer would mean π0 Diff(S4)≅Z/2\pi_0\,\mathrm{Diff}(S^4) \cong \mathbb Z/2π0​Diff(S4)≅Z/2, detected by orientation alone, matching dimensions 111, 222 and 333. A negative answer would give an exotic diffeomorphism of S4S^4S4: one that is topologically isotopic to the identity (by the Alexander trick) but not smoothly isotopic. By the Cerf–Morlet theorem, π0 Diff(D4)≅π5(PL4/O4)\pi_0\,\mathrm{Diff}(D^4) \cong \pi_5(PL_4/O_4)π0​Diff(D4)≅π5​(PL4​/O4​), so the question is equivalent to a question about the homotopy of PL4/O4PL_4/O_4PL4​/O4​, the space controlling smoothings of PL 444-manifolds. The source lists the smooth 444-dimensional Schoenflies problem as a related problem.

Formalizing it. No part of this theory is currently formalized in Lean or Mathlib: there is no C∞C^\inftyC∞ topology on diffeomorphism groups and no known homotopy equivalence involving one. The milestones are classical theorems (Smale 1959, Hatcher 1983, Kervaire–Milnor 1963, Farrell–Hsiang 1978, Watanabe 2018). Formalizing any of them is new work, independent of the open goal.

Difficulty

In dimensions ≥5\ge 5≥5, π0 Diff(Dn)\pi_0\,\mathrm{Diff}(D^n)π0​Diff(Dn) is computed by combining Cerf's pseudo-isotopy theorem with the hhh-cobordism theorem. Both rely on the Whitney trick, which fails in dimension 444. In dimension 444 one also cannot reduce to a lower-dimensional problem as Smale and Hatcher did. The known invariants that detect non-trivial elements of π∗ Diff(D4)\pi_*\,\mathrm{Diff}(D^4)π∗​Diff(D4) (Watanabe's configuration-space integrals) are rational and live in positive degrees, so they say nothing about π0\pi_0π0​. Smale's and Hatcher's arguments for n=2,3n = 2, 3n=2,3 rely on understanding spaces of embedded spheres in SnS^nSn of one lower dimension; the corresponding spaces of 333-spheres in S4S^4S4 are not understood, so those arguments do not carry over.

Formalization scope

All statements import the single definition file SmaleDiffS4_Basic and live in the namespace SmaleDiffS4.

  • DiffDisk n is the subtype of Mathlib's Diffeomorph 𝓘(ℝ, ℝⁿ) 𝓘(ℝ, ℝⁿ) ℝⁿ ℝⁿ ∞ (smooth = C^∞) of maps fixing every point of norm ≥1\ge 1≥1. Its topology is induced by the family of iterated derivatives iteratedFDeriv ℝ k f, k∈Nk \in \mathbb Nk∈N, each with the topology of uniform convergence on Rn\mathbb R^nRn. This "identity outside the open ball" model is the standard model of Diff(Dn rel ∂)\mathrm{Diff}(D^n \text{ rel } \partial)Diff(Dn rel ∂) and is homotopy equivalent to the "identity on the boundary" and "identity near the boundary" variants.
  • DiffSphere n is Mathlib's Diffeomorph (𝓡 n) (𝓡 n) (sphere 0 1) (sphere 0 1) ∞ on the unit sphere of Rn+1\mathbb R^{n+1}Rn+1. Its topology is induced by the iterated derivatives of the radial extension, restricted to the sphere and uniformly topologized.
  • OrthGroup n is Matrix.orthogonalGroup (Fin n) ℝ with the subspace topology.
  • Homotopy equivalence is ContinuousMap.HomotopyEquiv. Ω5\Omega^5Ω5 is GenLoop (Fin 5) Y y, π0\pi_0π0​ is ZerothHomotopy, and πi\pi_iπi​ is HomotopyGroup (Fin i). πi⊗Q\pi_i\otimes\mathbb Qπi​⊗Q is TensorProduct ℤ ℚ (Additive π_i), and "≅Q\cong\mathbb Q≅Q" is stated as Q\mathbb QQ-rank 111.
  • The Farrell–Hsiang milestone covers only i≥2i \ge 2i≥2, where πi\pi_iπi​ is abelian in Mathlib. It includes the parity hypothesis "nnn odd" of the original theorem, which is lost in the source page's rendering.

A trivializing formalization is ruled out: the topology is the genuine C∞C^\inftyC∞ topology rather than the discrete or indiscrete one, and the goal is not vacuous because DiffDisk 4 is nonempty (it contains the identity).

A complete development needs reusable infrastructure: the C∞C^\inftyC∞ topology and topological-group structure on diffeomorphism groups, isotopy extension and fibration theorems (Cerf–Palais), restriction to a disc, and the Alexander trick. Contributions of this infrastructure as separate theorems are welcome.

Selected references

  • Open Problem Garden, What is the homotopy type of the group of diffeomorphisms of the 4-sphere? (posted 2009). http://www.openproblemgarden.org/op/what_is_the_homotopy_type_of_the_group_of_diffeomorphisms_of_the_4_sphere
  • S. Smale, Diffeomorphisms of the 2-sphere, Proc. Amer. Math. Soc. 10 (1959), 621–626. https://doi.org/10.1090/S0002-9939-1959-0112149-8
  • M. Kervaire, J. Milnor, Groups of homotopy spheres I, Ann. of Math. 77 (1963), 504–537. https://doi.org/10.2307/1970128
  • R. Kirby, L. Siebenmann, Foundational Essays on Topological Manifolds, Smoothings, and Triangulations, Princeton University Press, 1977.
  • F.T. Farrell, W.C. Hsiang, On the rational homotopy groups of the diffeomorphism groups of discs, spheres and aspherical manifolds, Proc. Sympos. Pure Math. 32 (1978), 403–415.
  • A. Hatcher, A proof of a Smale conjecture, Diff(S3)≃O(4)\mathrm{Diff}(S^3)\simeq O(4)Diff(S3)≃O(4), Ann. of Math. (2) 117 (1983), 553–607. https://doi.org/10.2307/2007035
  • R. Budney, Little cubes and long knots, Topology 46 (2007), 1–27. https://arxiv.org/abs/math/0309427
  • T. Watanabe, Some exotic nontrivial elements of the rational homotopy groups of Diff(S4)\mathrm{Diff}(S^4)Diff(S4), 2018. https://arxiv.org/abs/1812.02448
11 thms2 active usersReviewed
🏆Completed
Geometry & 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
CombinatoricsLinear algebra·Captain: mikedeng1

Isoperimetric Inequalities in Simplicial Complexes 2: The Mixing Lemma — for Disjoint A_0,…,A_d in a Complex with a Complete Skeleton, ||F(A_0,…,A_d)| − α|A_0|⋯|A_d|/n| ≤ ρ_α(|A_0|⋯|A_d|)^(d/(d+1))Research Paper

Motivation

For a kkk-regular graph G=(V,E)G=(V,E)G=(V,E) on nnn vertices, the Expander Mixing Lemma (Alon–Chung 1988; see the survey of Hoory, Linial and Wigderson 2006) says that for any vertex sets A,BA,BA,B, the number of edges between them is close to its expected value: ∣∣E(A,B)∣−k∣A∣∣B∣/n∣≤ρ∣A∣∣B∣\bigl||E(A,B)|-k|A||B|/n\bigr|\le\rho\sqrt{|A||B|}​∣E(A,B)∣−k∣A∣∣B∣/n​≤ρ∣A∣∣B∣​, where ρ\rhoρ is the largest absolute value of a nontrivial eigenvalue of kI−Δ+kI-\Delta^+kI−Δ+. The deviation, called the discrepancy of AAA and BBB, measures how random-like the graph is. It is one of the basic tools of spectral graph theory and of the theory of expanders.

Higher-dimensional expansion asks the same questions for simplicial complexes, where the role of edges is played by ddd-dimensional cells. Parzanchevski, Rosenthal and Tessler (Combinatorica 35, 2015) prove, for complexes with a complete skeleton, a Cheeger inequality and a Mixing Lemma: the number of ddd-cells with one vertex in each of d+1d+1d+1 disjoint vertex sets is controlled by the spectrum of the upper Laplacian. The Mixing Lemma is the result of this mission. In the same paper it yields a lower bound on Gromov's geometric overlap (Gromov 2010) of complexes with a small spectral spread.

Setting

Let V={0,1,…,n−1}V=\{0,1,\dots,n-1\}V={0,1,…,n−1} and d≥1d\ge1d≥1. A ddd-dimensional complex with a complete skeleton XXX contains every set of at most ddd vertices as a cell, together with a set XdX^dXd of ddd-cells, each a set of d+1d+1d+1 vertices. Cells are oriented by the increasing order of their vertices.

A (d−1)(d-1)(d−1)-form is a real function on the ddd-element subsets of VVV; the space Ωd−1\Omega^{d-1}Ωd−1 carries the inner product ⟨f,g⟩=∑σf(σ)g(σ)\langle f,g\rangle=\sum_\sigma f(\sigma)g(\sigma)⟨f,g⟩=∑σ​f(σ)g(σ). Similarly Ωd−2\Omega^{d-2}Ωd−2 consists of functions on (d−1)(d-1)(d−1)-subsets (Ω−1=R{∅}\Omega^{-1}=\mathbb R^{\{\varnothing\}}Ω−1=R{∅} when d=1d=1d=1) and Ωd\Omega^dΩd of functions on ddd-cells. Writing σi\sigma_iσi​ for the iii-th vertex of σ\sigmaσ, the co-boundary operators are (∂j∗f)(σ)=∑i(−1)if(σ∖σi)(\partial^*_j f)(\sigma)=\sum_{i}(-1)^i f(\sigma\setminus\sigma_i)(∂j∗​f)(σ)=∑i​(−1)if(σ∖σi​) (for j=dj=dj=d only on σ∈Xd\sigma\in X^dσ∈Xd), and the boundary operators are (∂jg)(σ)=∑v∼σg(vσ)(\partial_j g)(\sigma)=\sum_{v\sim\sigma} g(v\sigma)(∂j​g)(σ)=∑v∼σ​g(vσ), the sum over vertices v∉σv\notin\sigmav∈/σ with {v}∪σ\{v\}\cup\sigma{v}∪σ a cell, where vσv\sigmavσ is the oriented cell [v,σ0,σ1,… ][v,\sigma_0,\sigma_1,\dots][v,σ0​,σ1​,…].

The upper, lower and full Laplacians on Ωd−1\Omega^{d-1}Ωd−1 are

Δ+=∂d∂d∗,Δ−=∂d−1∗∂d−1,Δ=Δ++Δ−.\Delta^+=\partial_d\partial^*_d,\qquad \Delta^-=\partial^*_{d-1}\partial_{d-1},\qquad \Delta=\Delta^++\Delta^-.Δ+=∂d​∂d∗​,Δ−=∂d−1∗​∂d−1​,Δ=Δ++Δ−.

The (d−1)(d-1)(d−1)-cycles are Zd−1=ker⁡∂d−1Z_{d-1}=\ker\partial_{d-1}Zd−1​=ker∂d−1​, and the exact forms are Bd−1=im⁡∂d−1∗B^{d-1}=\operatorname{im}\partial^*_{d-1}Bd−1=im∂d−1∗​; they are orthogonal complements in Ωd−1\Omega^{d-1}Ωd−1. Write PZd−1\mathbb P_{Z_{d-1}}PZd−1​​ and PBd−1\mathbb P_{B^{d-1}}PBd−1​ for the orthogonal projections. For vertex sets A0,…,AdA_0,\dots,A_dA0​,…,Ad​, F(A0,…,Ad)F(A_0,\dots,A_d)F(A0​,…,Ad​) is the set of ddd-cells with exactly one vertex in each AiA_iAi​.

For α∈R\alpha\in\mathbb Rα∈R the operator αI−Δ+\alpha I-\Delta^+αI−Δ+ preserves Zd−1Z_{d-1}Zd−1​, and

ρα=max⁡{∣μ∣  :  μ an eigenvalue of (αI−Δ+)∣Zd−1}=∥(αI−Δ+)∣Zd−1∥.\rho_\alpha=\max\bigl\{|\mu|\;:\;\mu\text{ an eigenvalue of }(\alpha I-\Delta^+)|_{Z_{d-1}}\bigr\}=\bigl\|(\alpha I-\Delta^+)|_{Z_{d-1}}\bigr\|.ρα​=max{∣μ∣:μ an eigenvalue of (αI−Δ+)∣Zd−1​​}=​(αI−Δ+)∣Zd−1​​​.

Formalization targets

Goal: Theorem (1.4), the Mixing Lemma (p. 16)

For every α∈R\alpha\in\mathbb Rα∈R and any pairwise disjoint vertex sets A0,…,AdA_0,\dots,A_dA0​,…,Ad​ (not necessarily a partition),

∣ ∣F(A0,…,Ad)∣−α⋅∣A0∣⋯∣Ad∣n∣≤ρα⋅(∣A0∣⋯∣Ad∣)dd+1.\left|\,|F(A_0,\dots,A_d)|-\frac{\alpha\cdot|A_0|\cdots|A_d|}{n}\right|\le\rho_\alpha\cdot\bigl(|A_0|\cdots|A_d|\bigr)^{\frac d{d+1}}.​∣F(A0​,…,Ad​)∣−nα⋅∣A0​∣⋯∣Ad​∣​​≤ρα​⋅(∣A0​∣⋯∣Ad​∣)d+1d​.

The parameter α\alphaα is free; the introduction's Theorem 1.4 (p. 4) is the case α=k\alpha=kα=k, the average degree of a (d−1)(d-1)(d−1)-cell, and is included as a companion item.

Milestones

The milestones follow the proof of §4.3 and the facts of §§2–3 that it uses:

  1. the chain-complex identity ∂d−1∂d=0\partial_{d-1}\partial_d=0∂d−1​∂d​=0 and its dual, so Bd−1⊆ker⁡Δ+B^{d-1}\subseteq\ker\Delta^+Bd−1⊆kerΔ+ (p. 6), and Bd−1=Zd−1⊥B^{d-1}=Z_{d-1}^\perpBd−1=Zd−1⊥​ (p. 6);
  2. Proposition 3.2: ΔX‾+=nI−ΔX\Delta^+_{\overline X}=nI-\Delta_XΔX+​=nI−ΔX​ for the complement complex (3.4), and Δ−=n PBd−1\Delta^-=n\,\mathbb P_{B^{d-1}}Δ−=nPBd−1​ (3.5);
  3. for the signed indicator forms φ=δA0,A1,…,Ad−1\varphi=\delta_{A_0,A_1,\dots,A_{d-1}}φ=δA0​,A1​,…,Ad−1​​ and ψ=δAd,A1,…,Ad−1\psi=\delta_{A_d,A_1,\dots,A_{d-1}}ψ=δAd​,A1​,…,Ad−1​​: the norm identity (4.5), the count ⟨φ,(D−Δ+)ψ⟩=∣F(A0,…,Ad)∣\langle\varphi,(D-\Delta^+)\psi\rangle=|F(A_0,\dots,A_d)|⟨φ,(D−Δ+)ψ⟩=∣F(A0​,…,Ad​)∣ (4.6), its α\alphaα-shift (4.7), the splitting (4.8), the main term (4.9), the spectral bound (4.10)–(4.11);
  4. the asymmetric bound ρα∣A0∣∣Ad∣ ∣A1∣⋯∣Ad−1∣\rho_\alpha\sqrt{|A_0||A_d|}\,|A_1|\cdots|A_{d-1}|ρα​∣A0​∣∣Ad​∣​∣A1​∣⋯∣Ad−1​∣ and the geometric-mean step that symmetrizes it.

Significance

For d=1d=1d=1 the theorem is the Expander Mixing Lemma of graphs. For d≥2d\ge2d≥2 it shows that a complex whose upper Laplacian has its nontrivial spectrum concentrated near α\alphaα distributes its ddd-cells evenly across any d+1d+1d+1 disjoint vertex sets, with a bound that depends on the set sizes only through (∏∣Ai∣)d/(d+1)(\prod|A_i|)^{d/(d+1)}(∏∣Ai​∣)d/(d+1). The paper uses it to bound the geometric overlap of such complexes from below (Corollary 1.6), and to show that random Linial–Meshulam complexes (Linial–Meshulam 2006) have small discrepancy.

The result is proved in the paper. To the knowledge of this mission, neither it nor the underlying signed simplicial Laplacians with their Hodge decomposition on a complete skeleton has been formalized. The formalization produces the boundary and co-boundary operators, the three Laplacians, the identity for the complement complex, and the projection formula for Δ−\Delta^-Δ−, all of which are standard in the spectral theory of complexes and reusable well beyond this result.

Difficulty

Each step of the proof is a finite computation, but the steps are sign-sensitive. The count (4.6) relies on the orientation conventions: ψ\psiψ replaces only the first block of φ\varphiφ, and the off-diagonal terms of Δ+\Delta^+Δ+ carry the signs that make φ(σ)ψ(σ′)=+1\varphi(\sigma)\psi(\sigma')=+1φ(σ)ψ(σ′)=+1 on neighbouring cells. Proposition 3.2 (1) and (3) are identities between explicit matrices indexed by ddd-subsets that hold only because the skeleton is complete. The spectral step needs the orthogonal decomposition Ωd−1=Bd−1⊕Zd−1\Omega^{d-1}=B^{d-1}\oplus Z_{d-1}Ωd−1=Bd−1⊕Zd−1​, invariance of Zd−1Z_{d-1}Zd−1​ under Δ+\Delta^+Δ+, and the spectral theorem for the restriction. A direct transcription of the graph argument does not apply: the operators act on (d−1)(d-1)(d−1)-forms rather than on functions on vertices, and the expected count α∏∣Ai∣/n\alpha\prod|A_i|/nα∏∣Ai​∣/n is not visible from Δ+\Delta^+Δ+ of XXX alone.

Formalization scope

Vertices are Fin n. A complex is the structure Complex n d holding its ddd-cells, so the complete skeleton is built in; forms are EuclideanSpace ℝ over the subtype of kkk-element subsets of Fin n, oriented by the order of Fin n. All boundary and co-boundary operators are defined by their formulas, not as adjoints of one another. The standing assumption d≥1d\ge1d≥1 is added to every statement. The disjoint sets A0,…,AdA_0,\dots,A_dA0​,…,Ad​ form an arbitrary pairwise-disjoint family, some possibly empty; no partition and no bound n≥d+1n\ge d+1n≥d+1 is assumed. The exponent d/(d+1)d/(d+1)d/(d+1) is a real power of a nonnegative real.

ρα\rho_\alphaρα​ is not defined as a maximum or supremum: the goal is stated for every real ρ\rhoρ that bounds ∣μ∣|\mu|∣μ∣ for all eigenvalues μ\muμ of αI−Δ+\alpha I-\Delta^+αI−Δ+ on Zd−1Z_{d-1}Zd−1​, which is equivalent to the statement for ρα\rho_\alphaρα​. Trivializing formalizations are ruled out by construction: forms cannot be supported outside ddd-subsets (such a form would be a spurious cycle), an empty eigenvalue set cannot be read through a default sSup value, the boundary operators carry orientation signs, and disjoint families are not confused with partitions.

Contributions are welcome at every milestone, in particular a general library for signed boundary operators on finite complexes, the identity ∂∂=0\partial\partial=0∂∂=0, and the Hodge-type decomposition of forms, which are reusable for the Cheeger inequality of the companion mission and for other work on high-dimensional expanders.

Selected references

  • O. Parzanchevski, R. Rosenthal, R. J. Tessler, Isoperimetric inequalities in simplicial complexes, Combinatorica 35 (2015); arXiv:1207.0638v3 (2013). https://arxiv.org/abs/1207.0638 , https://doi.org/10.1007/s00493-014-3002-x
  • N. Alon, F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discrete Mathematics 72 (1988). https://doi.org/10.1016/0012-365X(88)90189-6
  • S. Hoory, N. Linial, A. Wigderson, Expander graphs and their applications, Bulletin of the AMS 43 (2006). https://doi.org/10.1090/S0273-0979-06-01126-8
  • N. Linial, R. Meshulam, Homological connectivity of random 2-complexes, Combinatorica 26 (2006). https://doi.org/10.1007/s00493-006-0027-9
  • M. Gromov, Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry, Geometric and Functional Analysis 20 (2010). https://doi.org/10.1007/s00039-010-0073-8
16 thms2 active usersReviewed
🏆Completed
Computational GeometryMachine LearningProbability·Captain: mikedeng1

Persistence-Based Clustering in Riemannian Manifolds: With High Probability the Algorithm Returns as Many Clusters as the Density Has d₂-Prominent PeaksResearch Paper

Motivation

Mode-seeking clustering groups data points by the peak of an underlying probability density that they "flow up" to. Methods of this kind (mean-shift, graph-based hill climbing) are widely used, but their output depends heavily on noise: a density estimated from finitely many samples has many spurious local maxima, and each of them becomes a cluster. Chazal, Guibas, Oudot and Skraba (INRIA RR-6968, 2009; journal version J. ACM 60(6), 2013, doi:10.1145/2535927) combine graph-based hill climbing with topological persistence. Persistence measures how prominent each peak is, and peaks of low prominence are merged into their neighbours. The paper's main guarantee says when this algorithm recovers the right number of clusters from random samples. It holds on Riemannian manifolds that may be non-compact, and the clustering method is now known as ToMATo.

Setting

Let X\mathbb XX be an mmm-dimensional Riemannian manifold, possibly with boundary, with geodesic distance dXd_{\mathbb X}dX​ and mmm-dimensional Hausdorff measure Hm\mathcal H^mHm. The strong convexity radius ϱc(X)\varrho_c(\mathbb X)ϱc​(X) is the infimum over xxx of the largest rrr such that any two points of the closed ball BX(x,r)B_{\mathbb X}(x,r)BX​(x,r) are joined by a unique shortest path, and that path stays in the ball. Let f:X→Rf:\mathbb X\to\mathbb Rf:X→R be a probability density with respect to Hm\mathcal H^mHm that is ccc-Lipschitz, and write Fα=f−1([α,+∞))\mathbb F^\alpha=f^{-1}([\alpha,+\infty))Fα=f−1([α,+∞)) for its superlevel sets.

Persistence diagram. As α\alphaα decreases from +∞+\infty+∞ to −∞-\infty−∞, path components of Fα\mathbb F^\alphaFα are born at peaks of fff and die when they merge into an older component. The 0-th persistence diagram D0fD_0fD0​f records each component as a point (px,py)(p_x,p_y)(px​,py​) of the extended plane R‾2\overline{\mathbb R}^2R2, with birth pxp_xpx​ and death py≤pxp_y\le p_xpy​≤px​; a component that never dies has py=−∞p_y=-\inftypy​=−∞. The prominence of the peak is px−pyp_x-p_ypx​−py​. The diagonal is added with infinite multiplicity. fff is tame when this structure is of finite type. For d2>d1≥0d_2>d_1\ge0d2​>d1​≥0, D0fD_0fD0​f is (d1,d2)(d_1,d_2)(d1​,d2​)-separated when every off-diagonal point either has prominence <d1<d_1<d1​ (noise), or has prominence ≥d2\ge d_2≥d2​ and birth >d2>d_2>d2​ (signal).

Algorithm. The input is nnn sample points x1,…,xnx_1,\dots,x_nx1​,…,xn​, the values f(xi)f(x_i)f(xi​), the matrix of distances dX(xi,xj)d_{\mathbb X}(x_i,x_j)dX​(xi​,xj​) and parameters δ,τ\delta,\tauδ,τ. The Rips graph RδR_\deltaRδ​ joins two points at distance ≤δ\le\delta≤δ. The algorithm processes the points by decreasing fff and keeps a union-find structure whose entries are rooted at their highest point. When a point is processed, every neighbouring entry whose root is less than τ\tauτ higher than the point is merged into the point's entry. The point's own entry is then merged into the neighbouring entry with the highest root, if its own root is less than τ\tauτ higher than the point. The output is the set of final entries whose root has value ≥τ\ge\tau≥τ.

Sampling quantities. Nr(A)\mathcal N_r(A)Nr​(A) is the least number of closed geodesic balls of radius rrr covering AAA, and Vr(A)=inf⁡x∈AHm(BX(x,r))\mathcal V_r(A)=\inf_{x\in A}\mathcal H^m(B_{\mathbb X}(x,r))Vr​(A)=infx∈A​Hm(BX​(x,r)).

Formalization targets

Goal: Theorem 4.8 (p. 22)

Assume ϱc(X)>0\varrho_c(\mathbb X)>0ϱc​(X)>0, fff is a tame ccc-Lipschitz density, D0fD_0fD0​f is (d1,d2)(d_1,d_2)(d1​,d2​)-separated, 0<δ<min⁡{ϱc(X),d2−d15c}0<\delta<\min\{\varrho_c(\mathbb X),\frac{d_2-d_1}{5c}\}0<δ<min{ϱc​(X),5cd2​−d1​​} and τ∈(d1+2cδ, d2−3cδ)\tau\in(d_1+2c\delta,\,d_2-3c\delta)τ∈(d1​+2cδ,d2​−3cδ). Then for nnn i.i.d. samples from fff,

Pr⁡[#clusters≠#{peaks of prominence≥d2}]≤Nδ/8(Fcδ) e−n34cδ Vδ/8(Fcδ).\Pr\big[\#\text{clusters}\ne\#\{\text{peaks of prominence}\ge d_2\}\big]\le\mathcal N_{\delta/8}(\mathbb F^{c\delta})\,e^{-n\frac34c\delta\,\mathcal V_{\delta/8}(\mathbb F^{c\delta})}.Pr[#clusters=#{peaks of prominence≥d2​}]≤Nδ/8​(Fcδ)e−n43​cδVδ/8​(Fcδ).

Milestones

  1. Lemma 4.3 (p. 17): for ε>0\varepsilon>0ε>0 and α>cε\alpha>c\varepsilonα>cε, the sample is a geodesic ε\varepsilonε-sample of Fα\mathbb F^\alphaFα except with probability at most Nε/2(Fα)e−n(α−cε)Vε/2(Fα)\mathcal N_{\varepsilon/2}(\mathbb F^\alpha)e^{-n(\alpha-c\varepsilon)\mathcal V_{\varepsilon/2}(\mathbb F^\alpha)}Nε/2​(Fα)e−n(α−cε)Vε/2​(Fα).
  2. Theorem 4.5 (p. 19): if a finite LLL is a geodesic δ/4\delta/4δ/4-sample of Fα\mathbb F^\alphaFα, there is a multi-bijection between D0fD_0fD0​f and the diagram D0Rδf(L)D_0\mathcal R^f_\delta(L)D0​Rδf​(L) of the upper-star Rips filtration. Above α\alphaα it moves points by at most cδc\deltacδ, and in the lower-right quadrant it moves births by at most cδc\deltacδ.
  3. Noise image (proof of Thm 4.8, p. 22): the noise points are sent into Δd1+2cδN∪Λd1+2cδW\Delta^N_{d_1+2c\delta}\cup\Lambda^W_{d_1+2c\delta}Δd1​+2cδN​∪Λd1​+2cδW​.
  4. Signal image (pp. 22–23): the signal points are sent outside that region.
  5. Partition and count (p. 23): for τ\tauτ in the range, D0Rδf(L)D_0\mathcal R^f_\delta(L)D0​Rδf​(L) has exactly as many points in ΔτS∩ΛτE\Delta^S_\tau\cap\Lambda^E_\tauΔτS​∩ΛτE​ as D0fD_0fD0​f has peaks of prominence ≥d2\ge d_2≥d2​; for the tame D0fD_0fD0​f both counts are finite.
  6. Algorithm output (p. 23, with §3): for τ>0\tau>0τ>0 the algorithm returns exactly one cluster per point qqq of the Rips diagram with qx−qy≥τq_x-q_y\ge\tauqx​−qy​≥τ and qx≥τq_x\ge\tauqx​≥τ.

Significance

The theorem gives a sample-complexity guarantee for a practical clustering algorithm, with an explicit failure probability. It needs neither compactness of the manifold nor a density bounded away from zero; dense sampling of one superlevel set is enough. The separation hypothesis is a signal-to-noise condition, and it tells the user which range of τ\tauτ recovers the true number of clusters.

On the formalization side, the paper's results are proved on paper, but nothing about them is machine-checked. Of the steps, the paper proves Lemma 4.3 and the region analysis. Theorem 4.5 rests on the Rips-filtration analysis of Chazal–Guibas–Oudot–Skraba, SODA 2009, the interleaving and stability results of Chazal et al., SoCG 2009, and the paper's Lemma 4.6. The algorithm-output step (milestone 6) is asserted in the paper, not proved. The mission therefore asks for formal proofs of all six steps. A by-product is the first library of 0-dimensional persistence diagrams, multi-bijections and Rips filtrations on the platform.

Difficulty

The probabilistic step is a union bound over a minimal cover, but it has a gap. Covering balls need not be centred in Fα\mathbb F^\alphaFα, while V\mathcal VV is an infimum over balls centred in Fα\mathbb F^\alphaFα, so the comparison between the two is not justified on a general manifold. Theorem 4.5 is the hardest step. The obvious route, a bottleneck stability theorem, does not apply, because the sample covers only one superlevel set and not X\mathbb XX. This is why the conclusion distinguishes the quadrant above α\alphaα, where both coordinates are controlled, from the quadrant below, where only births are. Milestone 6 is a correctness proof for a union-find procedure with ties: entries are not path components, because prominent entries stay separate after their components meet.

Formalization scope

  • Manifold. X\mathbb XX is a metric space carrying Mathlib's Riemannian manifold structure (IsRiemannianManifold, a ModelWithCorners for the boundary), so dXd_{\mathbb X}dX​ is dist.
  • Measures and probability. Hm\mathcal H^mHm is Mathlib's unnormalized Hausdorff measure of dimension dim⁡E\dim EdimE; the statements are invariant under rescaling it. Samples are product measures on Fin n → X. "With probability at least 1−B1-B1−B" is an upper bound B∈[0,∞]B\in[0,\infty]B∈[0,∞] on the outer measure of the failure event. e−aVe^{-aV}e−aV uses e−∞=0e^{-\infty}=0e−∞=0 and 0⋅∞=00\cdot\infty=00⋅∞=0.
  • Convexity radius. It is computed in [0,+∞][0,+\infty][0,+∞], with shortest paths as isometric embeddings of [0,d(y,y′)][0,d(y,y')][0,d(y,y′)].
  • Diagrams. A diagram's multiplicities are computed from the rank function of the filtration, so they are not free data.
  • Tameness is pinned in a 0-dimensional form: finitely many path components at each level, finitely many critical values, and empty superlevel sets at high levels.
  • Multi-bijections are bijections between copies of points, the diagonal contributing countably many copies of each of its points.
  • Separation is imposed on off-diagonal points only. On the diagonal the literal definition is unsatisfiable when d1=0d_1=0d1​=0.
  • Algorithm. It runs Procedures 1–2 with an explicit union-find state, over every processing order compatible with the sort. The upper star of a point is its set of neighbours processed earlier.
  • Added hypotheses. c>0c>0c>0 in Theorem 4.8 and milestones 3–5 (the paper divides by ccc), and τ>0\tau>0τ>0 in milestone 6.

No formalization in which the number of clusters is defined as a count of diagram points, or in which the diagram is a free parameter, is acceptable: either one empties the goal. The running-time and memory claims of §3, the basin approximation of Theorem 4.9 and the Morse-theoretic material of §2.3 are out of scope. Lemma 4.3 is stated as printed, with covering balls centred anywhere, and its proof gap is an open risk that Theorem 4.8 inherits.

Contributions are welcome on every milestone. The persistence-diagram layer (rank functions, multiplicities, multi-bijections) and the union-find correctness proof are reusable beyond this mission.

Selected references

  • F. Chazal, L. J. Guibas, S. Y. Oudot, P. Skraba, Persistence-Based Clustering in Riemannian Manifolds, INRIA Research Report RR-6968, 2009. https://inria.hal.science/inria-00389390
  • F. Chazal, L. J. Guibas, S. Y. Oudot, P. Skraba, Persistence-Based Clustering in Riemannian Manifolds, Journal of the ACM 60(6), 2013. https://doi.org/10.1145/2535927
  • F. Chazal, D. Cohen-Steiner, M. Glisse, L. J. Guibas, S. Y. Oudot, Proximity of Persistence Modules and their Diagrams, Proc. 25th ACM Symposium on Computational Geometry, 2009. https://doi.org/10.1145/1542362.1542407
  • D. Cohen-Steiner, H. Edelsbrunner, J. Harer, Stability of Persistence Diagrams, Discrete & Computational Geometry 37, 2007. https://doi.org/10.1007/s00454-006-1276-5
  • F. Chazal, L. J. Guibas, S. Y. Oudot, P. Skraba, Analysis of Scalar Fields over Point Cloud Data, SODA 2009. https://doi.org/10.1137/1.9781611973068.112
41 thms2 active usersReviewed
🏆Completed
Category Theory·Captain: marwahaha

The Grothendieck homotopy hypothesis via elementary expansionsOpen Problem

Motivation

The homotopy hypothesis relates algebraic higher groupoids to spaces. Elementary expansions provide a concrete test of whether adjoining a higher cell preserves homotopy information. The pinned manuscript supplies the research context.

Setting

C is a globular coherator in the encoded convention, X is a cellular model, and Y is a pushout that attaches an (n+1)-disk along the source-face inclusion of an n-disk.

Formalization target

The selected goal is OAI.Grothendieck.elementary_expansion. Its central assertion is

X⟶X⨿DnDn+1is a weak equivalence.X\longrightarrow X\amalg_{D_n}D_{n+1}\quad\text{is a weak equivalence}.X⟶X⨿Dn​​Dn+1​is a weak equivalence.

The theorem states that, for a coherator C (a globular theory, meaning a category of shapes built from globes by iterated gluing, with morphisms preserving the globular pushouts, which has a cellular presentation as a countable-stage colimit of free extensions along admissible pairs of parallel cells and in which every admissible pair is filled by some morphism), the following holds for models of C, i.e. presheaves on C sending globular pushouts to pullbacks. Let X be a cellular model, meaning that it is built from an initial model by a well-ordered transfinite composition in which each successor step attaches cells freely along boundaries of cells of the previous stage. Let n be a natural number, let a be a map from the free model disk(n) on the n-globe to X, and let J_n : disk(n) → disk(n+1) be the map induced by the source-face inclusion of the n-globe into the (n+1)-globe. If Y, together with i : X → Y and b : disk(n+1) → Y, forms a pushout square of a and J_n, then i is a weak equivalence. Here weak equivalence means that i induces a bijection on sets of components (0-cells modulo being joined by a 1-cell) and, for every 0-cell x of X and every n, a bijection on homotopy groups, which are classes of n-loops based at the degenerate cells above x, identified when joined by an (n+1)-cell.

Significance and status

The selected goal is the elementary-expansion theorem. It does not itself assert the complete equivalence between the homotopy theory of spaces and all coherator models. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The conclusion requires preservation of components and every based homotopy group, for cellular models built through transfinite attachments.

Formalization scope

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

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

Selected references

  • OpenAI, The Grothendieck homotopy hypothesis via elementary expansions, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: wurtle

A universal group of type F∞Research Paper

Motivation

Higman's embedding theorem (1961) says that a finitely generated group embeds in a finitely presented group exactly when it is recursively presented, i.e. has a presentation with finitely many generators and a recursively enumerable set of relators. A consequence is that there is a single universal finitely presented group containing every finitely presented group. A natural higher-dimensional question asks whether finiteness can be pushed beyond presentations: finite presentability is the dimension-two case of the topological finiteness properties FnF_nFn​.

This preprint constructs a single group HHH of type F∞F_\inftyF∞​, i.e. with a classifying space having finitely many cells in every dimension, that contains every finitely presented group. This answers the F∞F_\inftyF∞​ form of the higher-dimensional Higman embedding question posed by Fournier-Facio and Zaremsky.

Background

  • 1949. Higman, Neumann and Neumann introduce HNN extensions and embedding theorems for groups.
  • 1961. Higman proves his embedding theorem.
  • 1974–1975. Bieri and Eckmann, and Brown, develop finiteness properties of groups and homological criteria for them.
  • 2018. Leary proves every countable group embeds in a group of type FP2FP_2FP2​.
  • 2026. Fournier-Facio and Zaremsky show that embedding theorems into recursively presented groups of type FPnFP_nFPn​ would yield embeddings of finitely presented groups into groups of type FnF_nFn​, show that their rope-trick groups fail FP3(Q)FP_3(\mathbb{Q})FP3​(Q) in general, and ask the higher-dimensional Higman embedding question (Question 1.3).
  • 2026. The OpenAI preprint A universal group of type F∞F_\inftyF∞​ (dated September 23, 2026) proves the theorem below. It has not been peer reviewed; the Lean goal is open on this platform.

Setting

A classifying complex for a group GGG is a connected CW complex with fundamental group isomorphic to GGG and contractible universal cover; it may be infinite-dimensional. GGG has type FnF_nFn​ if some classifying complex has finite nnn-skeleton, and type F∞F_\inftyF∞​ if some classifying complex has finitely many cells in every dimension. Type F2F_2F2​ is equivalent to finite presentability. A group is finitely presented if it has a presentation with finitely many generators and relators.

In Lean (OAI.UniversalFInfinity), HasTypeFInfinity G asks for a Hausdorff connected space XXX with a CW structure on Set.univ having finitely many nnn-cells for every nnn, a basepoint with π1(X,x)≃G\pi_1(X, x) \simeq Gπ1​(X,x)≃G, and a surjective covering map from a contractible space. Finite presentation is Mathlib's Group.IsFinitelyPresented.

Formalization targets

Goal: Theorem 1.1

There exists a group HHH of type F∞F_\inftyF∞​ such that every finitely presented group admits an injective homomorphism into HHH:

∃H of type F∞  ∀G finitely presented  ∃ φ:G↪H.\exists H \text{ of type } F_\infty\ \ \forall G \text{ finitely presented}\ \ \exists\, \varphi : G \hookrightarrow H .∃H of type F∞​  ∀G finitely presented  ∃φ:G↪H.

Significance

The result. Theorem 1.1 gives a universal group with the strongest standard topological finiteness property. Corollary 1.2 follows: the finitely generated subgroups of HHH are exactly the finitely generated recursively presented groups. No word-problem hypothesis is imposed on the inputs, in contrast with the companion result on simple F∞F_\inftyF∞​ overgroups.

Formalizing it. No machine-checked proof exists; the source is an unrefereed preprint. A formalization requires finite-type CW complexes, classifying spaces and covering theory, Brown's criterion or a direct cell-count argument, Higman's universal finitely presented group, HNN extensions and an ascending-torus theorem (Theorem 5.1), none of which is fully in Mathlib.

Difficulty

Higman's universal group is only finitely presented; type F∞F_\inftyF∞​ requires finite control of relations among relations in every dimension, which is typically destroyed by the embeddings and amalgams used in Higman-type arguments. Fournier-Facio and Zaremsky show that the rope-trick construction fails FP3(Q)FP_3(\mathbb{Q})FP3​(Q), so a different route is needed. The preprint constructs a finitely presented envelope with two families of homomorphisms from the universal group and an ascending HNN-type mapping torus whose finiteness properties can be verified.

Formalization scope

  • Universes: HHH and the quantified finitely presented GGG live in the same universe Type u; finitely presented groups are countable, so this loses nothing.
  • Type F∞F_\inftyF∞​: a CW structure with Finite (cw.cell n) for every nnn, π1≃H\pi_1 \simeq Hπ1​≃H, and a contractible covering space; no finite-dimensionality is required.
  • The universal quantifier is over every Group.IsFinitelyPresented group, not a chosen list of presentations.

The statement cannot be met trivially: a trivial or finite HHH cannot contain all finitely presented groups, and the type F∞F_\inftyF∞​ requirement is substantive.

Needed infrastructure: CW complexes of finite type, K(π,1)K(\pi,1)K(π,1) spaces, HNN extensions, Higman's embedding theorem. Contributions toward Theorem 5.1 (ascending-torus theorem) or Proposition 6.2 are welcome.

Selected references

  • OpenAI, A universal group of type F∞F_\inftyF∞​, OpenAI Math Release preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-universal-group-of-type-F-infinity-September-23-2026/paper.pdf
  • OpenAI, Simple F∞F_\inftyF∞​ overgroups of groups with decidable word problem, OpenAI Math Release preprint, September 23, 2026. https://github.com/openai/math/blob/main/preprints/Simple-F-infinity-overgroups-of-groups-with-decidable-word-problem-September-23-2026/paper.pdf
  • G. Higman, Subgroups of finitely presented groups, Proc. Roy. Soc. London Ser. A 262 (1961). https://doi.org/10.1098/rspa.1961.0132
  • G. Higman, B. H. Neumann, H. Neumann, Embedding theorems for groups, J. London Math. Soc. 24 (1949).
  • R. Bieri, B. Eckmann, Finiteness properties of duality groups, Comment. Math. Helv. 49 (1974). https://doi.org/10.1007/BF02566720
  • K. S. Brown, Homological criteria for finiteness, Comment. Math. Helv. 50 (1975). https://doi.org/10.1007/BF02565740
  • I. J. Leary, Subgroups of almost finitely presented groups, Math. Ann. 372 (2018).
  • F. Fournier-Facio, M. C. B. Zaremsky, Finiteness properties and Higman's rope trick, preprint, 2026. https://arxiv.org/abs/2607.21727
  • A. Hatcher, Algebraic Topology, Cambridge University Press, 2002.
6 thms2 active usersReviewed
🏆Completed
AlgebraGroup Theory·Captain: wurtle

A Torsion-Free Group Algebra with Zero DivisorsResearch Paper

Motivation: Kaplansky's zero-divisor conjecture

For a field KKK and a group GGG, the group algebra K[G]K[G]K[G] consists of finite formal sums ∑gagg\sum_g a_g g∑g​ag​g with ag∈Ka_g\in Kag​∈K, multiplied by extending the group law bilinearly. If g∈Gg\in Gg∈G has finite order m>1m>1m>1, then (1−g)(1+g+⋯+gm−1)=0(1-g)(1+g+\dots+g^{m-1})=0(1−g)(1+g+⋯+gm−1)=0, so K[G]K[G]K[G] has zero divisors. Kaplansky's zero-divisor conjecture asserts that this is the only source: if GGG is torsion-free, K[G]K[G]K[G] has no nonzero zero divisors. Together with the unit and idempotent conjectures it is one of the central problems connecting ring theory, group theory and topology, and positive answers are known for large classes of groups (elementary amenable groups, groups with the unique-product property, torsion-free 3-manifold groups).

Timeline

  • 1940 — Higman's thesis raises the question and proves the domain property for groups in which every nontrivial subgroup maps onto Z\mathbb ZZ (Higman, Proc. LMS 1940); the thesis formulation is reproduced by Sandling (1981).
  • 1956/1957 — Kaplansky poses the problem (Problem 6 in Problems in the theory of rings, National Research Council, 1957).
  • 1987 — Rips and Segev construct torsion-free groups without the unique-product property, removing the standard route to the conjecture (J. Algebra 1987); Steenbock gives a graphical small-cancellation treatment (J. Algebra 2015).
  • 1988 — Kropholler, Linnell and Moody prove the conjecture for torsion-free elementary amenable groups (Proc. AMS 1988).
  • 2021 — Gardam disproves the related unit conjecture over F2\mathbb F_2F2​ (Ann. of Math. 2021), and later over C\mathbb CC (arXiv:2312.05240, 2024). A nontrivial unit is not a zero divisor, so the zero-divisor conjecture remained open.
  • 2026 — Fisher and Sánchez-Peralta prove the domain conclusion for torsion-free 3-manifold groups and division-ring embeddings for virtually compact special groups (J. Comb. Algebra 2026).
  • 2026 — An OpenAI preprint, A Torsion-Free Group Algebra with Zero Divisors (OpenAI Math Release, September 23, 2026), claims a finitely presented torsion-free group GGG with a finite 2-dimensional classifying space such that F2[G]\mathbb F_2[G]F2​[G] has nonzero zero divisors. The preprint has not been peer reviewed and its theorem is not formally verified.

Setting

A group GGG is torsion-free if gn=1g^n=1gn=1 with n≥1n\ge1n≥1 implies g=1g=1g=1. It is finitely presented if it has a presentation with finitely many generators and relations. A classifying space (or K(G,1)K(G,1)K(G,1)) for GGG is a path-connected space XXX with π1(X)≅G\pi_1(X)\cong Gπ1​(X)≅G whose universal cover is contractible; it is finite two-dimensional if it is a finite CW complex with cells only in dimensions ≤2\le 2≤2. A group with a finite-dimensional classifying space is automatically torsion-free, but the formal goal asks for both properties explicitly.

The coefficient field is F2=Z/2\mathbb F_2=\mathbb Z/2F2​=Z/2, and F2[G]\mathbb F_2[G]F2​[G] is Mathlib's MonoidAlgebra (ZMod 2) G.

Formalization targets

Goal: a counterexample to the zero-divisor conjecture (Theorem 1.1)

There exist a group GGG and α,β∈F2[G]\alpha,\beta\in\mathbb F_2[G]α,β∈F2​[G] such that

G finitely presented,G torsion-free,G has a finite 2-dimensional K(G,1),α≠0, β≠0, αβ=0.G\ \text{finitely presented},\quad G\ \text{torsion-free},\quad G\ \text{has a finite 2-dimensional } K(G,1),\quad \alpha\neq0,\ \beta\neq0,\ \alpha\beta=0.G finitely presented,G torsion-free,G has a finite 2-dimensional K(G,1),α=0, β=0, αβ=0.

This is the full Theorem 1.1 of the source, including its "Moreover" clause. The source proves existence probabilistically; it does not exhibit a concrete presentation. The goal statement is published on the platform with status Open: no machine-checked proof exists yet.

Significance

The result itself. If correct, the theorem disproves Kaplansky's zero-divisor conjecture over F2\mathbb F_2F2​, a problem open since the 1940s, and shows that torsion-freeness — even together with finite presentability and a 2-dimensional classifying space — does not force K[G]K[G]K[G] to be a domain. It implies that GGG fails the unique-product property, and it bears on the implications among the Kaplansky conjectures (zero divisors, units, idempotents) and on approaches through the Atiyah conjecture and division-ring embeddings.

Formalizing it. The claim refutes a long-standing conjecture by an intricate probabilistic and topological construction, which is a strong case for machine verification. A full formal proof needs the probabilistic existence argument, planar separation, and asphericity of a 2-complex — none of which is a routine Mathlib application. Partial contributions (e.g. the characteristic-2 cancellation argument once asphericity and root separation are assumed, or the torsion-freeness of groups with finite-dimensional K(G,1)K(G,1)K(G,1)) are welcome. A related machine-checked result exists only for the weaker non-unique-product property of Gardam's A~2\widetilde A_2A2​ lattice (Mian–Siddique 2026).

Difficulty

Writing down α,β\alpha,\betaα,β whose product cancels in characteristic two is the easy part; the source does this by a parity argument on a graph of simultaneous steps. The hard part is two safeguards in the quotient group: both factors must remain nonzero (no vertex label other than the root can collapse to the identity), and the group must be torsion-free, which the source obtains by proving the 2-complex is aspherical. Standard tools — small-cancellation or CAT(0) criteria — are not applied; instead the source must exclude spherical arrangements of arbitrarily many paths of arbitrary length, which a union bound over sizes cannot handle.

Formalization scope

  • TorsionFree G is the plain group-theoretic notion (gn=1g^n=1gn=1, n>0n>0n>0 implies g=1g=1g=1); finite presentability is Group.IsFinitelyPresented.
  • HasFiniteTwoDimensionalClassifyingSpace G asks for a Hausdorff, path-connected space XXX with a finite CW structure on all of XXX, no cells above dimension 222, at least one 222-cell, a group isomorphism G≃π1(X,x)G\simeq\pi_1(X,x)G≃π1​(X,x), and a surjective covering map from a contractible space onto XXX (so XXX is aspherical). Requiring a 222-cell excludes only the case of free groups, whose group algebras are domains.
  • The witnessing group lives in Type and is existentially quantified together with its group structure; the zero divisors are elements of MonoidAlgebra (ZMod 2) G.
  • A trivializing reading is excluded because all three group properties and both nonvanishing conditions are required simultaneously.
  • Infrastructure needed: CW complexes and covering spaces (partially in Mathlib), the fundamental group of a 2-complex built by attaching cones, Hurewicz/Whitehead-type asphericity arguments, and random graph constructions.

Selected references

  • G. Higman, The units of group-rings, Proc. London Math. Soc. (2) 46 (1940). https://doi.org/10.1112/plms/s2-46.1.231
  • I. Kaplansky, Problems in the theory of rings, Report of a Conference on Linear Algebras (1956), National Research Council, 1957.
  • E. Rips and Y. Segev, Torsion-free group without unique product property, J. Algebra (1987). https://doi.org/10.1016/0021-8693(87)90125-6
  • P. H. Kropholler, P. A. Linnell and J. A. Moody, Applications of a new K-theoretic theorem to soluble group rings, Proc. Amer. Math. Soc. (1988). https://doi.org/10.2307/2046771
  • M. Steenbock, Rips–Segev torsion-free groups without the unique product property, J. Algebra (2015). https://doi.org/10.1016/j.jalgebra.2015.05.004
  • G. Gardam, A counterexample to the unit conjecture for group rings, Ann. of Math. 194 (2021). https://doi.org/10.4007/annals.2021.194.3.9
  • G. Gardam, Non-trivial units of complex group rings, preprint, 2024. https://arxiv.org/abs/2312.05240v2
  • S. P. Fisher and P. Sánchez-Peralta, Division rings for group algebras of virtually compact special groups and 3-manifold groups, J. Comb. Algebra (2026). https://doi.org/10.4171/JCA/89
  • I. Mian and S. Siddique, A machine-checked proof that Gardam's A~2\widetilde A_2A2​ lattice does not have unique products, preprint, 2026. https://arxiv.org/abs/2609.22380v1
  • OpenAI, A Torsion-Free Group Algebra with Zero Divisors, OpenAI Math Release preprint, September 23, 2026 (source of the goal; Theorem 1.1, p. 1). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-Torsion-Free-Group-Algebra-with-Zero-Divisors-September-23-2026/paper.pdf
11 thms2 active usersReviewed
🏆Completed
Differential GeometryMathematical Physics·Captain: Lucas

Gribov Ambiguity: no continuous gauge fixing (Singer 1978)Research Paper

Motivation

In the Feynman path-integral approach to a non-abelian gauge theory one wants to integrate a gauge-invariant weight over the space A\mathfrak{A}A of vector potentials (connections) of a principal bundle. The integrand is constant on the orbits of the group G\mathcal{G}G of gauge transformations, so the integral over A\mathfrak{A}A diverges and one is supposed to integrate instead over the orbit space R=A/G\mathfrak{R} = \mathfrak{A}/\mathcal{G}R=A/G. The Faddeev–Popov procedure realizes this by fixing a gauge: choosing, continuously in the orbit, exactly one vector potential on each orbit, and correcting by a Jacobian determinant.

V. N. Gribov (SLAC Translation 176, 1977) observed that for SU(2)SU(2)SU(2) potentials on R3\mathbb{R}^3R3 (or R4\mathbb{R}^4R4) with suitable conditions at infinity, the Coulomb gauge condition does not do this: the Coulomb slice through the zero potential meets the orbit of the zero potential again, far from the origin. These extra intersections are the Gribov copies; R. Jackiw, I. Muzinich and C. Rebbi (Phys. Rev. D 17 (1978) 1576) analyzed them in detail.

I. M. Singer, Some Remarks on the Gribov Ambiguity (Commun. Math. Phys. 60 (1978) 7–12), showed that the phenomenon is not a defect of the Coulomb gauge. If the conditions at infinity are those of Gribov — gauge transformations extending to the one-point compactification with value III at infinity, so that the base manifold is M=S3M = S^3M=S3 or M=S4M = S^4M=S4 — then no continuous gauge fixing exists at all, in any gauge. The obstruction is topological: the space of irreducible connections is weakly contractible, while the gauge group is not, and a weakly contractible principal bundle admits no global continuous section.

Setting

Fix N≥2N \ge 2N≥2 and take the structure group SU(N)SU(N)SU(N), the group of N×NN \times NN×N complex matrices UUU with U∗U=IU^\ast U = IU∗U=I and det⁡U=1\det U = 1detU=1, topologized as a subspace of matrices. Let SrS^rSr denote the unit sphere of Rr+1\mathbb{R}^{r+1}Rr+1, with base point mmm the north pole.

For the trivial SU(N)SU(N)SU(N)-bundle over a space MMM, a gauge transformation is a map φ:M→SU(N)\varphi : M \to SU(N)φ:M→SU(N), and the gauge group is

G(M,N)  =  C(M,SU(N)),\mathcal{G}(M,N) \;=\; C\bigl(M, SU(N)\bigr),G(M,N)=C(M,SU(N)),

continuous maps with pointwise multiplication and the compact-open topology. Two subobjects matter. The based gauge group Gm={φ:φ(m)=I}\mathcal{G}_m = \{\varphi : \varphi(m) = I\}Gm​={φ:φ(m)=I} is the subgroup of transformations that are the identity at the base point. The constant transformations with value in the centre ZN={e2πik/NI}Z_N = \{e^{2\pi i k/N} I\}ZN​={e2πik/NI} of SU(N)SU(N)SU(N) form a normal subgroup, and the reduced gauge group is the quotient

G‾(M,N)  =  G(M,N)/ZN\overline{\mathcal{G}}(M,N) \;=\; \mathcal{G}(M,N)/Z_NG​(M,N)=G(M,N)/ZN​

with the quotient topology. The centre acts trivially on vector potentials, so G‾\overline{\mathcal{G}}G​ is the group that acts effectively.

A group GGG acting continuously on a space A\mathfrak{A}A has orbit space A/G\mathfrak{A}/GA/G with the quotient topology, and a gauge fixing is a continuous map s:A/G→As : \mathfrak{A}/G \to \mathfrak{A}s:A/G→A with p∘s=idp \circ s = \mathrm{id}p∘s=id, where p:A→A/Gp : \mathfrak{A} \to \mathfrak{A}/Gp:A→A/G is the projection: a continuous choice of exactly one point on each orbit. The action is principal when it is free and the division map, which sends a pair of points on one orbit to a group element carrying the second to the first, can be chosen continuously; this is the topological content of "ppp is a principal GGG-bundle". The space A\mathfrak{A}A is weakly contractible when it is nonempty and all its homotopy groups vanish.

In the paper, A\mathfrak{A}A is the affine space of connections, R\mathfrak{R}R its set of irreducible members, and Theorems 1 and 2 say exactly that R\mathfrak{R}R is a weakly contractible principal G‾\overline{\mathcal{G}}G​-space.

Formalization targets

Goal — Corollary 4 (no gauge fixing)

For r∈{3,4}r \in \{3,4\}r∈{3,4}, N≥2N \ge 2N≥2, and every weakly contractible principal G‾(Sr,N)\overline{\mathcal{G}}(S^r,N)G​(Sr,N)-space AAA:

∄ s:A/G‾(Sr,N)⟶Acontinuous withp∘s=id.\nexists\, s : A/\overline{\mathcal{G}}(S^r,N) \longrightarrow A \quad\text{continuous with}\quad p \circ s = \mathrm{id}.∄s:A/G​(Sr,N)⟶Acontinuous withp∘s=id.

By Theorems 1 and 2 of the paper the space of irreducible connections over S3S^3S3 or S4S^4S4 is such an AAA, so the goal contains Singer's Corollary 4 for that space; it leaves the analytic construction of the space of connections unfixed, which is what makes it statable today.

Milestone level — Theorem 3

∃ j≥1:πj(G‾(Sr,N))≠0,r∈{3,4}, N≥2.\exists\, j \ge 1: \quad \pi_j\bigl(\overline{\mathcal{G}}(S^r,N)\bigr) \neq 0, \qquad r \in \{3,4\},\ N \ge 2 .∃j≥1:πj​(G​(Sr,N))=0,r∈{3,4}, N≥2.

Milestone level — Theorem 5 and its homotopy inputs

πj(Gm(Sr,N))  ≅  πj+r(SU(N)),π3(SU(N))≅Z,π4(SU(N))=0 (N≥3),π4(SU(2))≅Z/2.\pi_j\bigl(\mathcal{G}_m(S^r,N)\bigr) \;\cong\; \pi_{j+r}\bigl(SU(N)\bigr), \qquad \pi_3(SU(N)) \cong \mathbb{Z}, \qquad \pi_4(SU(N)) = 0 \ (N\ge 3), \qquad \pi_4(SU(2)) \cong \mathbb{Z}/2 .πj​(Gm​(Sr,N))≅πj+r​(SU(N)),π3​(SU(N))≅Z,π4​(SU(N))=0 (N≥3),π4​(SU(2))≅Z/2.

Significance

The result rules out the existence of a global gauge in the topological sense: every gauge condition used in practice is at best a local slice, and the Faddeev–Popov construction has to be read as a local statement, patched with a partition of unity over the orbit space (as the last section of the paper proposes). It is the mathematical reason why the Gribov ambiguity cannot be repaired by a cleverer gauge condition, and it is the origin of the Gribov–Zwanziger restriction of the functional integral to a fundamental domain.

Formalizing it adds a machine-checked version of an argument that is quoted far more often than it is checked, and it forces into Lean a piece of infrastructure that Mathlib currently lacks: homotopy groups of mapping spaces, the long exact sequence of a fibration in the form needed for 0→Gm→G→SU(N)→00 \to \mathcal{G}_m \to \mathcal{G} \to SU(N) \to 00→Gm​→G→SU(N)→0, and the classical computations π3(SU(N))≅Z\pi_3(SU(N)) \cong \mathbb{Z}π3​(SU(N))≅Z, π4(SU(N))=0\pi_4(SU(N)) = 0π4​(SU(N))=0 for N≥3N \ge 3N≥3, π4(SU(2))≅Z/2\pi_4(SU(2)) \cong \mathbb{Z}/2π4​(SU(2))≅Z/2. Singer's results are proved mathematics; none of them is formalized, and Mathlib as of the pinned revision contains homotopy groups as a definition together with their group structure, but essentially no computation of them.

Difficulty

The naive approach to the goal — build a section by hand, or average over the group — fails because G‾\overline{\mathcal{G}}G​ is neither compact nor contractible and the obstruction is global: locally, slices do exist (that is the content of the generalized Coulomb gauge), so no local argument can produce a contradiction. The proof has to convert a section into a homotopy-theoretic statement: a section of a principal bundle trivializes it, exhibiting the group as a retract of the total space, so all homotopy groups of the group would vanish; the work is then to show that some homotopy group of the reduced gauge group does not vanish, which needs the identification of the based gauge group with a mapping space, the exact sequences relating Gm\mathcal{G}_mGm​, G\mathcal{G}G and G‾\overline{\mathcal{G}}G​, and non-trivial homotopy groups of SU(N)SU(N)SU(N) — including π6(S3)≅Z/12\pi_6(S^3) \cong \mathbb{Z}/12π6​(S3)≅Z/12 for the SU(2)SU(2)SU(2) case of Theorem 3.

Formalization scope

The formalization commits to the following conventions, all of them visible in the definitions of this mission.

  • The bundle is the trivial SU(N)SU(N)SU(N)-bundle, so gauge transformations are literally maps M→SU(N)M \to SU(N)M→SU(N). This is the case of Gribov's original setting over S3S^3S3; over S4S^4S4 the paper also treats bundles of nonzero Pontrjagin index, which are out of scope here.
  • Gauge transformations are continuous, not smooth, with the compact-open topology; Singer's Theorem 5 uses smoothing homotopies to pass between the two, and the homotopy-theoretic content is the same.
  • SU(N)SU(N)SU(N) is the special unitary group of complex N×NN \times NN×N matrices, with its subspace topology; SrS^rSr is the unit sphere of Rr+1\mathbb{R}^{r+1}Rr+1 with its subspace topology.
  • Homotopy groups are Mathlib's HomotopyGroup, based at the identity element.
  • The space of connections is not constructed: Mathlib has no space of connections on a principal bundle, and building one is a mission of its own. The goal therefore quantifies over an arbitrary topological space carrying a weakly contractible principal action of the reduced gauge group — exactly the properties Theorems 1 and 2 establish for the irreducible connections.
  • This quantification is not vacuous: such spaces exist (the total space of a universal G‾\overline{\mathcal{G}}G​-bundle is one), so the goal is a genuine non-existence statement and not a statement about an empty class. Conversely it is not trivially true: the hypotheses do not mention any homotopy invariant of the gauge group, and refuting a section requires Theorem 3.
  • The paper's analytic statements — Theorem 1 (openness and density of the irreducible connections, principal bundle structure), Theorem 2 (weak contractibility), Theorem 6 (π1\pi_1π1​ of the irreducible orbit space), Theorem 7 (no flat connection), Theorem 8 (tangency of orbits to the Coulomb slice) and Theorem 9 (the canonical connection and its curvature) — are out of scope until a space of connections exists in Lean. Contributions that build one, in reusable form, are welcome and would let this mission be extended to them.

Selected references

  • V. N. Gribov, Instability of non-abelian gauge theories and impossibility of choice of Coulomb gauge, SLAC Translation 176 (1977); Nucl. Phys. B 139 (1978) 1–19, doi:10.1016/0550-3213(78)90175-X.
  • I. M. Singer, Some Remarks on the Gribov Ambiguity, Commun. Math. Phys. 60 (1978) 7–12, doi:10.1007/BF01609471.
  • R. Jackiw, I. Muzinich, C. Rebbi, Coulomb gauge description of large Yang-Mills fields, Phys. Rev. D 17 (1978) 1576, doi:10.1103/PhysRevD.17.1576.
  • H. Toda, Composition methods in homotopy groups of spheres, Annals of Mathematics Studies 49, Princeton University Press (1962).
8 thms2 active usersReviewed
🏆Completed
Quantum Error CorrectionQuantum Information·Captain: Rui Chao

Counterexamples to the Zeng–Pryadko Homological-Distance ConjectureResearch Paper

Background and main question

The tensor product of chain complexes is a basic construction in homological algebra and in the theory of quantum CSS codes. If AAA and BBB are finite based chain complexes over a finite field, their tensor product is graded by total degree,

(A⊗B)j=⨁i=0jAi⊗Bj−i.(A\otimes B)_j=\bigoplus_{i=0}^{j} A_i\otimes B_{j-i}.(A⊗B)j​=i=0⨁j​Ai​⊗Bj−i​.

Each complex carries a basis-dependent homological distance: dj(A)d_j(A)dj​(A) is the least Hamming weight of a degree-jjj cycle that is not a boundary, with dj(A)=∞d_j(A)=\inftydj​(A)=∞ when the degree-jjj homology vanishes. A natural candidate for the distance of the tensor product is therefore

mj(A,B)=min⁡0≤i≤jdi(A)dj−i(B).m_j(A,B)=\min_{0\le i\le j} d_i(A)d_{j-i}(B).mj​(A,B)=0≤i≤jmin​di​(A)dj−i​(B).

Every nonzero pair of homology classes in complementary degrees gives a pure-tensor class of the corresponding product weight, so one always has dj(A⊗B)≤mj(A,B)d_j(A\otimes B)\le m_j(A,B)dj​(A⊗B)≤mj​(A,B). The substantive question is whether this upper bound is always sharp.

In the preprint Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates, posted in 2018 and subsequently published in Physical Review Letters, Zeng and Pryadko proved that the bound is sharp when one factor is a binary one-complex. Their exact formula is Eq. (13) of the arXiv version and is the capstone theorem of the Prove2Me mission Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates. The present formalization is a direct sequel: it retains the same definitions and degree conventions while examining what happens when the one-complex restriction is removed.

Zeng and Pryadko later considered arbitrary finite chain complexes over arbitrary finite fields in Minimal distances for certain quantum product codes and tensor products of chain complexes, published in 2020. In the corresponding arXiv preprint, Conjecture 18 asserts the unrestricted equality

dj(A⊗B)=mj(A,B).d_j(A\otimes B)=m_j(A,B).dj​(A⊗B)=mj​(A,B).

The conjecture is appealing because it would make tensor-product distance completely compositional: the degreewise distances of the two factors would determine the distance of their product. The obstruction is that a homology class in A⊗BA\otimes BA⊗B need not have a minimum-weight representative supported in a single bidegree. A representative spread across several summands of the total complex can be lighter than every pure-tensor representative. The purpose of this formalization is to turn that observation into a concrete, machine-checked counterexample to Conjecture 18 while preserving the valid one-complex theorem as a sharply delimited special case.

The counterexample mechanism

The common foundation is recorded in the Prove2Me entry Based binary chain complexes and homological distance. In particular, the boundary in degree jjj is a map ∂j:Aj→Aj−1\partial_j:A_j\to A_{j-1}∂j​:Aj​→Aj−1​, and

dj(A)=inf⁡{wt⁡(x):x∈ker⁡∂j, x∉im⁡∂j+1}.d_j(A)=\inf\{\operatorname{wt}(x):x\in\ker\partial_j,\ x\notin\operatorname{im}\partial_{j+1}\}.dj​(A)=inf{wt(x):x∈ker∂j​, x∈/im∂j+1​}.

The one-complex result is separately available as Eq. (13) — Exact distance with a one-complex. The construction below uses exactly the same notion of distance, but both tensor factors are genuine three-term complexes.

Begin with binary CSS check maps

HX:F2n⟶F2rX,HZ:F2n⟶F2rZ,H_X:\mathbb F_2^n\longrightarrow\mathbb F_2^{r_X}, \qquad H_Z:\mathbb F_2^n\longrightarrow\mathbb F_2^{r_Z},HX​:F2n​⟶F2rX​​,HZ​:F2n​⟶F2rZ​​,

assumed surjective and satisfying HXHZT=HZHXT=0H_XH_Z^T=H_ZH_X^T=0HX​HZT​=HZ​HXT​=0. Suppose there are logical vectors x,z∈F2nx,z\in\mathbb F_2^nx,z∈F2n​ such that

HZx=0,HXz=0,x⋅z=1.H_Zx=0,\qquad H_Xz=0,\qquad x\cdot z=1.HZ​x=0,HX​z=0,x⋅z=1.

The check maps determine two dual three-term complexes

A:F2rX←HXF2n←HZTF2rZ,B:F2rZ←HZF2n←HXTF2rX.A:\quad \mathbb F_2^{r_X}\xleftarrow{H_X}\mathbb F_2^n \xleftarrow{H_Z^T}\mathbb F_2^{r_Z}, \qquad B:\quad \mathbb F_2^{r_Z}\xleftarrow{H_Z}\mathbb F_2^n \xleftarrow{H_X^T}\mathbb F_2^{r_X}.A:F2rX​​HX​​F2n​HZT​​F2rZ​​,B:F2rZ​​HZ​​F2n​HXT​​F2rX​​.

Their degree-two tensor space has three bidegree summands, corresponding to (2,0)(2,0)(2,0), (1,1)(1,1)(1,1), and (0,2)(0,2)(0,2). Under the natural matrix identifications, consider the element whose three blocks are

(IrZ,In,IrX).(I_{r_Z},I_n,I_{r_X}).(IrZ​​,In​,IrX​​).

The CSS orthogonality relations make this element a cycle. Its pairing with the chosen logical vectors certifies that it is not a boundary. Its Hamming weight is exactly rZ+n+rXr_Z+n+r_XrZ​+n+rX​, whereas the componentwise candidate in degree two reduces to

m2(A,B)=d1(A)d1(B).m_2(A,B)=d_1(A)d_1(B).m2​(A,B)=d1​(A)d1​(B).

Consequently, any CSS datum satisfying

rZ+n+rX<d1(A)d1(B)r_Z+n+r_X<d_1(A)d_1(B)rZ​+n+rX​<d1​(A)d1​(B)

produces the strict inequality d2(A⊗B)<m2(A,B)d_2(A\otimes B)<m_2(A,B)d2​(A⊗B)<m2​(A,B). For orientation, a binary quantum Golay CSS presentation with parameters [[23,1,7]][[23,1,7]][[23,1,7]] has rX=rZ=11r_X=r_Z=11rX​=rZ​=11, giving the numerical comparison 45<4945<4945<49. The formal proof must supply an explicit CSS instance and verify its algebraic and distance properties, rather than relying on the parameter notation alone.

Formalization objectives

The first milestone proves the general certificate: for every CSS datum satisfying the hypotheses above, the element (IrZ,In,IrX)(I_{r_Z},I_n,I_{r_X})(IrZ​​,In​,IrX​​) is a nontrivial degree-two cycle of weight rZ+n+rXr_Z+n+r_XrZ​+n+rX​, and the componentwise minimum is d1(A)d1(B)d_1(A)d_1(B)d1​(A)d1​(B).

The second milestone constructs and verifies one explicit CSS datum for which rZ+n+rX<d1(A)d1(B)r_Z+n+r_X<d_1(A)d_1(B)rZ​+n+rX​<d1​(A)d1​(B). This is the step that turns the general mechanism into an actual counterexample.

The capstone packages the construction as the direct existential statement

∃ A,Bd2(A⊗B)<min⁡0≤i≤2di(A)d2−i(B).\exists\,A,B\qquad d_2(A\otimes B)<\min_{0\le i\le 2}d_i(A)d_{2-i}(B).∃A,Bd2​(A⊗B)<0≤i≤2min​di​(A)d2−i​(B).

Thus the final theorem is not conditional on the existence of suitable code data: it exhibits finite based binary chain complexes for which the equality proposed in Conjecture 18 fails.

Relation to prior work

The counterexample concerns only the unrestricted passage from a one-complex factor to two arbitrary bounded complexes. It does not conflict with Zeng and Pryadko's Eq. (13), whose one-complex hypothesis rules out the three-bidegree interaction used here.

The broader literature also indicates why additional structure matters. Bravyi and Hastings introduced homological-product codes and analyzed logical representatives in product constructions; Audoux and Couvreur developed tensor products of CSS codes through chain-complex methods. More recently, Akhmechet et al. discussed the Zeng–Pryadko conjecture in the structured setting of complexes derived from Khovanov homology, while Berthusen et al. restated it as Conjecture 5.1 in their study of automorphism gadgets. Golowich and Guruswami obtained strong distance guarantees for iterated homological products under expansion and local-testability hypotheses. These results are compatible with the proposed counterexample: they concern special families or impose hypotheses that are absent from Conjecture 18.

Besides settling the unrestricted statement, the formalization isolates a reusable obstruction. It shows precisely how a low-weight class assembled across several bidegrees can evade a formula based only on the degreewise distances of the factors. This distinction should help guide corrected formulations in which an exact product formula, or a useful lower bound, is recovered from additional geometric, expansion, or local-testability assumptions.

The main formal issues are mathematically substantive rather than presentational: the proof must respect the endpoint conventions for the boundary maps, distinguish a cycle from a non-boundary, compare finite weights with ∞\infty∞-valued distances, and verify a concrete strict-gap instance. Making each of these points explicit is especially important here, because an indexing shift or a merely conditional existence statement would no longer constitute a refutation of the conjecture as stated.

References

  • W. Zeng and L. P. Pryadko, Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates, Physical Review Letters 122, 230501 (2019); arXiv:1810.01519 (2018), Eq. (13).
  • W. Zeng and L. P. Pryadko, Minimal distances for certain quantum product codes and tensor products of chain complexes, Physical Review A 102, 062402 (2020); arXiv:2007.12152, Conjecture 18.
  • S. Bravyi and M. B. Hastings, Homological Product Codes, STOC 2014; arXiv:1311.0885.
  • B. Audoux and A. Couvreur, On tensor products of CSS codes, Annales de l'Institut Henri Poincaré D 6 (2019); arXiv:1512.07081.
  • R. Akhmechet et al., Khovanov homology and quantum error-correcting codes, arXiv:2410.11252 (2024).
  • N. Berthusen et al., Automorphism gadgets in homological product codes, arXiv:2508.04794 (2025).
  • L. Golowich and V. Guruswami, Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products, CCC 2025; full version.
6 thms2 active usersReviewed
🏆Completed
Category TheoryGeometry & TopologyMathematical 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
Category TheoryGeometry & TopologyMathematical 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
CombinatoricsLinear algebra·Captain: mikedeng1

Isoperimetric Inequalities in Simplicial Complexes 1: For a Finite d-Complex with a Complete Skeleton, the Spectral Gap Is at Most the Cheeger Constant, λ(X) ≤ h(X)Research Paper

Motivation

For a finite graph, the Cheeger constant measures how hard it is to cut the vertex set into two pieces, and the spectral gap of the graph Laplacian measures how fast random walks mix. The two Cheeger inequalities (Dodziuk 1984; Alon and Milman 1985; Alon 1986) bound each quantity by a function of the other, and they underlie the theory of expander graphs, with uses in derandomization, error-correcting codes and the analysis of Markov chains.

High-dimensional expanders extend this theory from graphs to simplicial complexes. Linial and Meshulam (2006) and Gromov (2010) introduced combinatorial and topological notions of expansion for complexes; the spectral side is Eckmann's discrete Hodge theory (1944), in which each dimension carries its own Laplacian. Parzanchevski, Rosenthal and Tessler (arXiv:1207.0638, Combinatorica 2015) defined a ddd-dimensional Cheeger constant h(X)h(X)h(X) through partitions of the vertices into d+1d+1d+1 blocks and proved the analogue of the upper Cheeger inequality, λ(X)≤h(X)\lambda(X)\le h(X)λ(X)≤h(X), for complexes with a complete skeleton. This mission formalizes that theorem.

Setting

Let V={0,1,…,n−1}V=\{0,1,\dots,n-1\}V={0,1,…,n−1} and d≥1d\ge1d≥1. A finite ddd-complex with a complete skeleton XXX on VVV consists of all subsets of VVV with at most ddd elements together with a set XdX^dXd of (d+1)(d+1)(d+1)-element subsets, the ddd-cells. A set of j+1j+1j+1 vertices is a jjj-cell; Xd−1X^{d-1}Xd−1 is therefore the set of all ddd-element subsets.

Each cell is oriented by the increasing order of its vertices, σ=[σ0,…,σj]\sigma=[\sigma_0,\dots,\sigma_j]σ=[σ0​,…,σj​] with σ0<⋯<σj\sigma_0<\dots<\sigma_jσ0​<⋯<σj​. The space Ωj\Omega^{j}Ωj of jjj-forms consists of the real functions on jjj-cells, with inner product

⟨f,g⟩=∑σ∈Xjf(σ)g(σ).\langle f,g\rangle=\sum_{\sigma\in X^{j}}f(\sigma)g(\sigma).⟨f,g⟩=σ∈Xj∑​f(σ)g(σ).

The co-boundary ∂d∗:Ωd−1→Ωd\partial_d^*:\Omega^{d-1}\to\Omega^d∂d∗​:Ωd−1→Ωd and the boundaries ∂d:Ωd→Ωd−1\partial_d:\Omega^d\to\Omega^{d-1}∂d​:Ωd→Ωd−1, ∂d−1:Ωd−1→Ωd−2\partial_{d-1}:\Omega^{d-1}\to\Omega^{d-2}∂d−1​:Ωd−1→Ωd−2 are

(∂d∗f)(τ)=∑i=0d(−1)if(τ∖τi),(∂jg)(σ)=∑v∼σg([v,σ0,…,σj−1]),(\partial_d^*f)(\tau)=\sum_{i=0}^d(-1)^i f(\tau\setminus\tau_i),\qquad (\partial_j g)(\sigma)=\sum_{v\sim\sigma}g([v,\sigma_0,\dots,\sigma_{j-1}]),(∂d∗​f)(τ)=i=0∑d​(−1)if(τ∖τi​),(∂j​g)(σ)=v∼σ∑​g([v,σ0​,…,σj−1​]),

where v∼σv\sim\sigmav∼σ means that v∉σv\notin\sigmav∈/σ and {v}∪σ\{v\}\cup\sigma{v}∪σ is a cell, and [v,σ0,… ][v,\sigma_0,\dots][v,σ0​,…] equals (−1)k(-1)^k(−1)k times the increasingly oriented cell when vvv has kkk smaller vertices in σ\sigmaσ. The upper Laplacian is Δ+=∂d∂d∗\Delta^+=\partial_d\partial_d^*Δ+=∂d​∂d∗​ on Ωd−1\Omega^{d-1}Ωd−1, and Zd−1=ker⁡∂d−1Z_{d-1}=\ker\partial_{d-1}Zd−1​=ker∂d−1​ is the space of (d−1)(d-1)(d−1)-cycles.

The spectral gap is the least eigenvalue of Δ+\Delta^+Δ+ on the cycles (Definition 2.1):

λ(X)=min⁡Spec⁡(Δ+∣Zd−1).\lambda(X)=\min\operatorname{Spec}\big(\Delta^+|_{Z_{d-1}}\big).λ(X)=minSpec(Δ+∣Zd−1​​).

For sets A0,…,Ad⊆VA_0,\dots,A_d\subseteq VA0​,…,Ad​⊆V, let F(A0,…,Ad)F(A_0,\dots,A_d)F(A0​,…,Ad​) be the set of ddd-cells with exactly one vertex in each AiA_iAi​. The Cheeger constant is (Definition 1.1)

h(X)=min⁡V=∐i=0dAin⋅∣F(A0,…,Ad)∣∣A0∣⋅∣A1∣⋯∣Ad∣,h(X)=\min_{V=\coprod_{i=0}^dA_i}\frac{n\cdot|F(A_0,\dots,A_d)|}{|A_0|\cdot|A_1|\cdots|A_d|},h(X)=V=∐i=0d​Ai​min​∣A0​∣⋅∣A1​∣⋯∣Ad​∣n⋅∣F(A0​,…,Ad​)∣​,

the minimum over partitions of VVV into nonempty sets A0,…,AdA_0,\dots,A_dA0​,…,Ad​. For d=1d=1d=1, Z0Z_0Z0​ is the space of functions summing to zero, Δ+\Delta^+Δ+ is the graph Laplacian, and hhh is the usual Cheeger constant min⁡A n∣E(A,Aˉ)∣/(∣A∣∣Aˉ∣)\min_{A}\,n|E(A,\bar A)|/(|A||\bar A|)minA​n∣E(A,Aˉ)∣/(∣A∣∣Aˉ∣).

Formalization targets

Goal: Theorem 1.2 (Cheeger Inequality)

λ(X)≤h(X)\lambda(X)\le h(X)λ(X)≤h(X)

for every finite ddd-complex XXX with a complete skeleton on n≥d+1n\ge d+1n≥d+1 vertices.

Milestones

  1. The chain-complex identity ∂d−1∂d=0\partial_{d-1}\partial_d=0∂d−1​∂d​=0 (p. 6).
  2. The form fff of (4.1), built from a partition, is a (d−1)(d-1)(d−1)-cycle (p. 12).
  3. ∂d∗\partial_d^*∂d∗​ is the adjoint of ∂d\partial_d∂d​: ⟨∂dg,f⟩=⟨g,∂d∗f⟩\langle\partial_dg,f\rangle=\langle g,\partial_d^*f\rangle⟨∂d​g,f⟩=⟨g,∂d∗​f⟩ (p. 6).
  4. Rayleigh's principle (4.2): λ(X)⟨f,f⟩≤⟨Δ+f,f⟩=⟨∂d∗f,∂d∗f⟩\lambda(X)\langle f,f\rangle\le\langle\Delta^+f,f\rangle=\langle\partial_d^*f,\partial_d^*f\rangleλ(X)⟨f,f⟩≤⟨Δ+f,f⟩=⟨∂d∗​f,∂d∗​f⟩ for f∈Zd−1f\in Z_{d-1}f∈Zd−1​ (p. 12).
  5. ⟨f,f⟩=n∏i=0d∣Ai∣\langle f,f\rangle=n\prod_{i=0}^d|A_i|⟨f,f⟩=n∏i=0d​∣Ai​∣ for the form (4.1) (p. 13).
  6. (4.3): ∣(∂d∗f)(σ)∣|(\partial_d^*f)(\sigma)|∣(∂d∗​f)(σ)∣ equals nnn for σ∈F(A0,…,Ad)\sigma\in F(A_0,\dots,A_d)σ∈F(A0​,…,Ad​) and 000 for the other ddd-cells (p. 13).
  7. ⟨∂d∗f,∂d∗f⟩=n2∣F(A0,…,Ad)∣\langle\partial_d^*f,\partial_d^*f\rangle=n^2|F(A_0,\dots,A_d)|⟨∂d∗​f,∂d∗​f⟩=n2∣F(A0​,…,Ad​)∣ (p. 14).

Milestones 2 and 5–7 hold for every partition, not only a minimizing one.

Significance

The result. Theorem 1.2 shows that a large spectral gap forces every partition of the vertices into d+1d+1d+1 blocks to be crossed by many ddd-cells, so spectral information certifies combinatorial expansion of a complex. The paper uses it with the spectral analysis of Gundert and Wagner to show that Linial–Meshulam random complexes X(d,n,Clog⁡n/n)X(d,n,C\log n/n)X(d,n,Clogn/n) have Cheeger constant of order log⁡n\log nlogn for large CCC (Corollary 1.3). The paper also shows that the converse direction fails: a triangulation of the Möbius strip has h(X)=114h(X)=1\tfrac14h(X)=141​ but λ(X)=0\lambda(X)=0λ(X)=0, so no lower bound of the form C⋅h(X)m≤λ(X)C\cdot h(X)^m\le\lambda(X)C⋅h(X)m≤λ(X) holds.

Formalizing it. The theorem is proved in the paper; to our knowledge no machine-checked proof exists. A formal proof requires a signed simplicial chain complex with explicit orientations, the adjoint relation between boundary and co-boundary, and a Rayleigh-quotient bound for a symmetric operator on an invariant subspace. These are the basic tools for any further formal work on spectral high-dimensional expansion, including the Mixing Lemma of the same paper (the companion mission of this series).

Difficulty

The graph proof plugs a two-valued test function into the Rayleigh quotient. In dimension ddd the test vector must be a (d−1)(d-1)(d−1)-cycle, and an indicator of a block is not one. The paper's form (4.1) assigns to a (d−1)(d-1)(d−1)-cell whose vertices meet ddd distinct blocks the size of the missing block, with the sign of a permutation of the blocks. Showing that this form is a cycle and that its co-boundary has absolute value exactly nnn on F(A0,…,Ad)F(A_0,\dots,A_d)F(A0​,…,Ad​) and 000 elsewhere is a case analysis over how the vertices of a cell fall into blocks, and every case depends on the orientation signs. A convention error in any of the operators or in the form makes one of these identities fail. A second, smaller difficulty is that λ(X)\lambda(X)λ(X) is a minimum over the spectrum on a subspace, so the Rayleigh bound must be proved for Δ+\Delta^+Δ+ restricted to Zd−1Z_{d-1}Zd−1​, which it preserves.

Formalization scope

  • Vertices are Fin n; a complex is a structure holding its ddd-cells as Finset (Finset (Fin n)), each of size d+1d+1d+1; the complete skeleton is built into the type. Complexes without ddd-cells are allowed.
  • Forms are EuclideanSpace ℝ over the subtype of kkk-element vertex sets, so no form is supported on sets of the wrong size. Ωd\Omega^dΩd is modelled on all (d+1)(d+1)(d+1)-element sets; ∂d∗\partial_d^*∂d∗​ vanishes off XdX^dXd and ∂d\partial_d∂d​ ignores values there.
  • Orientation is by the order of Fin n; the sign of vertex vvv in cell τ\tauτ is (−1)#{w∈τ:w<v}(-1)^{\#\{w\in\tau:w<v\}}(−1)#{w∈τ:w<v}. Boundary and co-boundary are both defined by their formulas; their adjointness is milestone 3.
  • The spectral gap is not defined by sInf. The goal states that some eigenvalue μ\muμ of Δ+\Delta^+Δ+ on Zd−1Z_{d-1}Zd−1​ (a nonzero cycle fff with Δ+f=μf\Delta^+f=\mu fΔ+f=μf) is at most the Cheeger ratio of every partition, which is equivalent to λ(X)≤h(X)\lambda(X)\le h(X)λ(X)≤h(X). A partition is a family A : Fin (d+1) → Finset (Fin n) of nonempty, pairwise disjoint sets covering the vertices.
  • Added hypotheses: d≥1d\ge1d≥1 (the Laplacians act on Ωd−1\Omega^{d-1}Ωd−1) and n≥d+1n\ge d+1n≥d+1 (presupposed by the paper, since hhh minimizes over partitions into d+1d+1d+1 nonempty sets; for n≤dn\le dn≤d the cycle space is 000).
  • Ruled out: forms supported off the ddd-element sets (they would be spurious cycles with eigenvalue 000), an eigenvalue set read through sInf (empty sets give 000), unsigned boundaries (for which ∂∂≠0\partial\partial\ne0∂∂=0), cocycles ker⁡∂d∗\ker\partial_d^*ker∂d∗​ in place of cycles ker⁡∂d−1\ker\partial_{d-1}ker∂d−1​ (on which Δ+\Delta^+Δ+ is zero), and arbitrary disjoint families in place of partitions (empty blocks give ratio 000).
  • Needed infrastructure: sign bookkeeping for faces of sorted finsets, the spectral theorem for symmetric operators on a finite-dimensional inner product space restricted to an invariant subspace (Mathlib's LinearMap.IsSymmetric), and counting cells by blocks of a partition. The chain-complex and adjointness lemmas are reusable in any formal development of simplicial Hodge theory; contributions there are welcome.

Selected references

  • O. Parzanchevski, R. Rosenthal, R. J. Tessler, Isoperimetric inequalities in simplicial complexes, Combinatorica 35 (2015). arXiv:1207.0638v3, doi:10.1007/s00493-014-3002-x
  • B. Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex, Comment. Math. Helv. 17 (1944), no. 1, 240–255.
  • N. Alon, V. D. Milman, λ₁, isoperimetric inequalities for graphs, and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73–88. doi:10.1016/0095-8956(85)90092-9
  • N. Linial, R. Meshulam, Homological connectivity of random 2-complexes, Combinatorica 26 (2006), 475–487. doi:10.1007/s00493-006-0027-9
  • A. Gundert, U. Wagner, On Laplacians of random complexes, Proceedings of the 2012 Symposium on Computational Geometry, ACM, 2012, 151–160.
  • M. Gromov, Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry, Geom. Funct. Anal. 20 (2010), no. 2, 416–526.
10 thms1 active userReviewed
Group Theory·Captain: marwahaha

Harmonic heights and the Artin K(pi,1) conjectureOpen Problem

Motivation

A classifying-space problem asks whether a natural complex captures a group without additional higher homotopy. The source addresses the finite-rank Artin problem through the lifted spherical-cell complex. The source is OpenAI's September 2026 manuscript.

Setting

An Artin group is presented by alternating braid relations from a Coxeter matrix. A subset of generators is spherical when its associated Coxeter parabolic subgroup is finite. Lifted cells pair a group element with such a subset, with incidence determined by reduced coset words.

Formalization targets

ContractibleSpace⁡(SalvettiCover⁡(M))for every Coxeter matrix M on finite S.\operatorname{ContractibleSpace}(\operatorname{SalvettiCover}(M))\qquad\text{for every Coxeter matrix }M\text{ on finite }S.ContractibleSpace(SalvettiCover(M))for every Coxeter matrix M on finite S.

For every Coxeter matrix M indexed by a finite type S of standard generators, the topological space SalvettiCover(M) is contractible. The Artin group Artin(M) is the free group on S modulo the braid relators, one for each ordered pair (s,t): the alternating word s t s t ... of length M(s,t) times the inverse of the alternating word t s t s ... of the same length. A subset T of S is spherical when the standard parabolic subgroup of the Coxeter group generated by the simple reflections in T is finite. A lifted cell is a pair (a,T) of an Artin group element and a spherical subset. One lifted cell (a,T) is a face of (b,U) when T is contained in U and there is a word w in letters of U that is reduced in the Coxeter group (its Coxeter length equals the word length), is of minimal length in its coset with respect to the parabolic subgroup generated by T, and satisfies a = b times the image of w in the Artin group. The preorder on lifted cells is the reflexive transitive closure of this face relation, and SalvettiCover(M) is the geometric realization, as a topological space, of the nerve of that preorder viewed as a category.

The goal is OAI.HarmonicArtin.salvetti_cover_contractible.

Significance

The goal makes the full topological realization contractible, rather than only asserting vanishing of a selected homotopy group. It supplies a precise target for the covering-space component of the source. 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

Local spherical pieces need not automatically fit into a globally contractible realization. The face relation and its transitive closure must retain the interaction between Artin words and Coxeter length.

Formalization scope

SalvettiCover is the geometric realization of the nerve of the lifted-cell preorder. The generator type is finite but need not be equipped with a chosen enumeration. The mission preserves this published model instead of substituting a different complex.

The shared definitions are supplied by HarmonicArtin. 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, Harmonic heights and the Artin K(pi,1) conjecture, preprint, September 2026. Manuscript.
  • OpenAI, accompanying Lean statement. Pinned source.
2 thms1 active userReviewed
Dynamical Systems·Captain: marwahaha

A C^1 Counterexample to the Entropy ConjectureOpen Problem

Motivation

Topological entropy measures orbit complexity, whereas the induced map on homology measures algebraic growth. The mission asks for a C¹ self-map where these two measurements violate the proposed entropy lower bound. The source manuscript presents the surrounding research claim.

Setting

The counterexample manifold is S¹×(S²)^(q+1), realized as a product of standard Euclidean spheres. A C¹ self-map is continuous and locally agrees, through the standard embedding, with a C¹ ambient map. Real singular homology provides the induced linear action.

Formalization target

Construct q>0 and such a nonbijective f with

htop(f)=0,∃v∈H2(M;R)∖{0}, f∗v=2v,h_{top}(f)=0,\qquad\exists v\in H_2(M;\mathbb R)\setminus\{0\},\ f_*v=2v,htop​(f)=0,∃v∈H2​(M;R)∖{0}, f∗​v=2v,

and prove 0<log 2≤log ρ_total(f), with 5≤2q+3.

The selected formal target is OAI.Problem340.exists_C1_entropy_counterexample.

Significance and status

The spectral-radius gap is an explicit conclusion, supported by an eigenvalue-two homology class. The target concerns noninvertible C¹ maps. The published target is currently Open; the manuscript's argument and a checked Lean proof are separate deliverables.

Difficulty

Algebraic expansion in homology must coexist with zero topological orbit entropy. Merely displaying a low-entropy subsystem would not establish zero entropy on the whole manifold.

Formalization scope

The goal uses Dynamics.coverEntropy on the entire manifold, taking values in EReal. Its total homological spectral radius is defined through real pairs representing complex eigenvalues over all homology degrees. The manifold family, ambient-extension C¹ condition and nonbijectivity are fixed parts of the statement.

Selected references

  • OpenAI, A C^1 Counterexample to the Entropy Conjecture, preprint, 2026. Pinned manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Goal source.
2 thms1 active userReviewed
Category Theory·Captain: wurtle

Thomason Model Structures in Every Strict Higher DimensionResearch Paper

Motivation

A model structure on a category specifies weak equivalences, fibrations and cofibrations so that the category carries a homotopy theory. Thomason showed that the category Cat\mathbf{Cat}Cat of small categories carries a model structure Quillen equivalent to simplicial sets, so that ordinary categories model all homotopy types of spaces (Thomason 1980). Its weak equivalences are the functors whose nerves are weak homotopy equivalences.

Strict higher categories have a nerve too: Street's orientals Om\mathcal O_mOm​ give the Street nerve NnN_nNn​ of a strict nnn-category (Street 1987). The higher-dimensional Thomason model-structure conjecture of Ara and Maltsiniotis asks for the analogue of Thomason's theorem for strict globular nnn-categories for every 1≤n≤∞1\le n\le\infty1≤n≤∞ (Ara–Maltsiniotis 2014; Ara 2023, §§9.2.5–9.2.6; Guetta–Maltsiniotis 2024). Strict higher categories are already known to describe the homotopy category of spaces after localization (Gagna, below); the conjecture asks for the full model structure, with lifting and factorization on all strict nnn-categories.

This mission asks for a machine-checked proof of Theorem 1.1 of an OpenAI preprint dated September 25, 2026 (source), which claims the conjecture in every dimension. The preprint has not been peer reviewed and its claims have not been independently verified; on the platform the Lean goal is open.

Timeline

  • 1980 — Thomason constructs the model structure on Cat\mathbf{Cat}Cat by transfer along c Sd2⊣Ex2Nc\,\mathrm{Sd}^2\dashv\mathrm{Ex}^2NcSd2⊣Ex2N, introducing Dwyer maps (Cahiers 1980).
  • 1987 — Street defines orientals and the nerve of strict ω\omegaω-categories (JPAA 1987).
  • 1999 — Cisinski corrects the retract argument in Thomason's properness proof (Cahiers 1999).
  • 2007/2016 — Worytkiewicz, Hess, Parent and Tonks propose the 2-dimensional structure (JPAA 2007), with a later corrigendum (JPAA 2016).
  • 2010 — Fiore and Paoli construct a Thomason structure on nnn-fold categories (AGT 2010).
  • 2014 — Ara and Maltsiniotis develop the transfer theorem, settle dimension 2, and isolate sufficient conditions for all nnn (Adv. Math. 2014).
  • 2018 — Gagna shows that strict nnn-categories model homotopy types after localizing at nerve weak equivalences (Adv. Math. 2018).
  • 2023–2024 — Ara's habilitation records the remaining pushout condition and the conjecture; Guetta and Maltsiniotis state the ω\omegaω-dimensional conjecture.
  • 2026 — The OpenAI preprint claims the conjecture for every 1≤n≤∞1\le n\le\infty1≤n≤∞ (Theorem 1.1, p. 2).

Setting

A strict globular ω\omegaω-category has a set of cells, source and target operations sk,tks_k,t_ksk​,tk​ in each dimension, and associative, unital compositions ∗k\ast_k∗k​ along kkk-dimensional boundaries satisfying the interchange law; every cell has finite dimension. A strict nnn-category is one whose cells above dimension nnn are identities; nCatn\mathbf{Cat}nCat denotes the category of small strict nnn-categories and strict functors (n=∞n=\inftyn=∞ means ωCat\omega\mathbf{Cat}ωCat). No invertibility is assumed.

The Street nerve Nn:nCat→sSetN_n:n\mathbf{Cat}\to\mathbf{sSet}Nn​:nCat→sSet has (NnX)m=Hom(Om,X)(N_nX)_m=\mathrm{Hom}(\mathcal O_m,X)(Nn​X)m​=Hom(Om​,X), with left adjoint cnc_ncn​. With barycentric subdivision Sd⊣Ex\mathrm{Sd}\dashv\mathrm{Ex}Sd⊣Ex set

Ln=cnSd2,Rn=Ex2Nn.L_n=c_n\mathrm{Sd}^2,\qquad R_n=\mathrm{Ex}^2N_n .Ln​=cn​Sd2,Rn​=Ex2Nn​.

Let WKQW_{KQ}WKQ​ and FibKQ\mathrm{Fib}_{KQ}FibKQ​ be the weak homotopy equivalences and Kan fibrations, I={∂Δ[m]↪Δ[m]}m≥0I=\{\partial\Delta[m]\hookrightarrow\Delta[m]\}_{m\ge0}I={∂Δ[m]↪Δ[m]}m≥0​ and J={Λk[m]↪Δ[m]}m≥1J=\{\Lambda^k[m]\hookrightarrow\Delta[m]\}_{m\ge1}J={Λk[m]↪Δ[m]}m≥1​. Define

Wn=Rn−1(WKQ),Fn=Rn−1(FibKQ),Cn=⊥(Fn∩Wn).W_n=R_n^{-1}(W_{KQ}),\qquad F_n=R_n^{-1}(\mathrm{Fib}_{KQ}),\qquad C_n={}^{\perp}(F_n\cap W_n).Wn​=Rn−1​(WKQ​),Fn​=Rn−1​(FibKQ​),Cn​=⊥(Fn​∩Wn​).

Formalization targets

Milestone: Equation (7.1), p. 24 — nerve detection

Wn=Nn−1(WKQ)=Rn−1(WKQ)W_n=N_n^{-1}(W_{KQ})=R_n^{-1}(W_{KQ})Wn​=Nn−1​(WKQ​)=Rn−1​(WKQ​): a functor of strict nnn-categories is a weak equivalence exactly when its Street nerve is a weak homotopy equivalence. This follows from id→Ex\mathrm{id}\to\mathrm{Ex}id→Ex being a natural weak equivalence.

Goal: Theorem 1.1 (p. 2)

For every n∈{1,2,3,… }∪{∞}n\in\{1,2,3,\dots\}\cup\{\infty\}n∈{1,2,3,…}∪{∞}, (Cn,Wn,Fn)(C_n,W_n,F_n)(Cn​,Wn​,Fn​) is a proper combinatorial model structure on nCatn\mathbf{Cat}nCat, cofibrantly generated by (LnI,LnJ)(L_nI,L_nJ)(Ln​I,Ln​J), and

Ln:sSetKQ⇄(nCat,Cn,Wn,Fn):RnL_n:\mathbf{sSet}_{KQ}\rightleftarrows(n\mathbf{Cat},C_n,W_n,F_n):R_nLn​:sSetKQ​⇄(nCat,Cn​,Wn​,Fn​):Rn​

is a Quillen equivalence.

Significance

The result itself. The theorem says that strict higher categories, in every dimension, model the homotopy theory of spaces through a genuine model structure, not only after localization. It provides functorial factorizations and lifting on arbitrary strict nnn-categories, including those that are not freely generated, which is what the small-object argument needs. The key new input is a couniversality theorem: pushouts of cnN(A)→cnN(E)c_nN(A)\to c_nN(E)cn​N(A)→cn​N(E) along sieves with a right adjoint retraction are Street weak equivalences (Theorem 5.2, p. 18), which is the remaining sufficient condition of Ara–Maltsiniotis.

Formalizing it. Mathlib has simplicial sets and model-category foundations but no strict ω\omegaω-categories, orientals or Street nerve. A complete development adds these, Steiner's directed complexes, Gray cylinders and local presentability of nCatn\mathbf{Cat}nCat, all reusable in higher category theory.

Difficulty

The transfer theorem reduces the model structure to a pushout condition, and that is the hard part: categorical pushouts of strict nnn-categories can create many new composites, so the nerve of a pushout is not the pushout of nerves. Thomason controlled this in dimension 1 with Dwyer maps, but that method does not extend directly. The preprint builds explicit stationary directed prisms (Lemma 3.1, p. 10) that are constant on the old part, so contractions glue across any attachment, and then reduces general posets to finite ones via sieve covers (Corollary 4.5, p. 16; Lemma 4.6, p. 17). Properness (Proposition 7.3, p. 26) and the unit comparison after two subdivisions (Proposition 7.4, p. 27) are separate arguments.

Formalization scope

  • OmegaCategory is a structure with a type of cells, source/target maps indexed by ℕ, partial compositions, the globular, unit, associativity and interchange laws, and finite dimension of each cell. Finite nnn uses a full subcategory NCategory n.
  • FullMain asserts: the Kan–Quillen model structure on SSet exists with the standard classes; and, for ω\omegaω and every finite n≥1n\ge1n≥1, an ExactModelEndpoint for Ln⊣RnL_n\dashv R_nLn​⊣Rn​: a ModelCategory whose weak equivalences, fibrations and cofibrations are exactly Wn,Fn,CnW_n,F_n,C_nWn​,Fn​,Cn​; (LnI)⋔=Fn∩Wn(L_nI)^{\pitchfork}=F_n\cap W_n(Ln​I)⋔=Fn​∩Wn​ and (LnJ)⋔=Fn(L_nJ)^{\pitchfork}=F_n(Ln​J)⋔=Fn​; both weak factorization systems; completeness, cocompleteness and local presentability; left and right properness; LnL_nLn​ left Quillen; and the Quillen-equivalence criterion at fibrant targets.
  • The classes are fixed by equations, so the goal cannot be met by an unrelated model structure.
  • The milestone quantifies over every n : ℕ, including n=0n=0n=0, which the source does not consider; the identity holds there by the same argument.

Selected references

  • OpenAI, Thomason Model Structures in Every Strict Higher Dimension, OpenAI Math Release preprint, September 25, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Thomason-Model-Structures-in-Every-Strict-Higher-Dimension-September-25-2026/paper.pdf
  • R. W. Thomason, Cat as a closed model category, Cahiers Topologie Géom. Différentielle 21 (1980). https://www.numdam.org/item/CTGDC_1980__21_3_305_0/
  • R. Street, The algebra of oriented simplexes, J. Pure Appl. Algebra (1987). https://doi.org/10.1016/0022-4049(87)90137-X
  • D.-C. Cisinski, La classe des morphismes de Dwyer n'est pas stable par rétractes, Cahiers (1999). https://www.numdam.org/item/CTGDC_1999__40_3_227_0/
  • D. Ara, G. Maltsiniotis, Vers une structure de catégorie de modèles à la Thomason sur la catégorie des n-catégories strictes, Adv. Math. (2014). https://doi.org/10.1016/j.aim.2014.03.013
  • A. Gagna, Strict n-categories and augmented directed complexes model homotopy types, Adv. Math. (2018). https://doi.org/10.1016/j.aim.2018.04.010
  • D. Ara, Théorie de l'homotopie des ∞-catégories strictes, habilitation (2023). https://www.normalesup.org/~ara/files/hdr.pdf
  • L. Guetta, G. Maltsiniotis, Homologie polygraphique des systèmes locaux, Adv. Math. (2024). https://doi.org/10.1016/j.aim.2024.109719
  • T. M. Fiore, S. Paoli, A Thomason model structure on the category of small n-fold categories, Algebr. Geom. Topol. 10 (2010). https://doi.org/10.2140/agt.2010.10.1933
  • P. G. Goerss, J. F. Jardine, Simplicial Homotopy Theory, Birkhäuser (1999). https://doi.org/10.1007/978-3-0348-8707-6
3 thms1 active userReviewed
Group TheoryMathematical Logic·Captain: wurtle

Simple F∞ overgroups of groups with decidable word problemResearch Paper

Motivation

A finitely generated group has decidable word problem if an algorithm decides, for every word in a fixed finite generating set and its inverses, whether it represents the identity. Embedding theorems translate this algorithmic property into algebra: Higman (1961) characterized subgroups of finitely presented groups, and Boone and Higman (1974) showed that decidable word problem is equivalent to embedding in a simple subgroup of a finitely presented group, asking whether the simple group can be finitely presented (the Boone–Higman conjecture).

This preprint proves a stronger statement in the direction of higher finiteness: every finitely generated group with decidable word problem embeds in a simple group of type F∞F_\inftyF∞​, i.e. one with a classifying space having finitely many cells in each dimension. Since type F∞F_\inftyF∞​ implies finite presentation, this implies the Boone–Higman conjecture.

Background

  • 1961. Higman's embedding theorem: finitely generated subgroups of finitely presented groups are exactly the recursively presented groups.
  • 1974. Boone and Higman characterize decidable word problem by embeddings into simple subgroups of finitely presented groups and pose the conjecture.
  • 1975, 1987. Brown gives homological criteria for finiteness and establishes type F∞F_\inftyF∞​ for the Thompson–Higman groups.
  • 1980. Thompson shows the simple overgroup can be chosen finitely generated with decidable word problem.
  • 2022. Belk and Zaremsky introduce twisted Brin–Thompson groups and construct a simple group of type F∞F_\inftyF∞​ containing all finitely generated right-angled Artin groups.
  • 2024–2026. Belk, Hyde and Matucci construct a simple F∞F_\inftyF∞​ group containing every countable abelian group; the Boone–Higman conjecture is verified for hyperbolic groups (Belk, Bleak, Matucci, Zaremsky) and for Aut(Fn)\mathrm{Aut}(F_n)Aut(Fn​) and mapping class groups (Belk, Fournier-Facio, Hyde, Zaremsky). The survey of Belk, Bleak, Matucci and Zaremsky raises the higher-finiteness question.
  • 2026. The OpenAI preprint Simple F∞F_\inftyF∞​ overgroups of groups with decidable word problem (dated September 23, 2026) proves the theorem below, building on the companion preprint Finite algebraic envelopes and the Boone–Higman conjecture. It has not been peer reviewed; the Lean goal is open on this platform.

Setting

A classifying space K(H,1)K(H,1)K(H,1) is a connected CW complex with fundamental group HHH and contractible universal cover. HHH has type FnF_nFn​ if some K(H,1)K(H,1)K(H,1) has finite nnn-skeleton and type F∞F_\inftyF∞​ if some K(H,1)K(H,1)K(H,1) has finitely many cells in each dimension. Type F1F_1F1​ is finite generation and type F2F_2F2​ is finite presentation. A group is simple if it is nontrivial and has no normal subgroups besides 111 and itself.

In Lean (OAI.SimpleFInftyOvergroups, definitions SimpleOvergroups), HasDecidableWordProblem G asks for a finite generating tuple with a ComputablePred identity predicate on words; HasTypeFInfty H asks for a Hausdorff connected space XXX with a CW structure of finite type (Topology.CWComplex.FiniteType), a basepoint with H≃π1(X,x)H \simeq \pi_1(X, x)H≃π1​(X,x), and a surjective covering map from a contractible space.

Formalization targets

Goal: Theorem 1.1

Every finitely generated group GGG with decidable word problem admits an injective homomorphism G↪HG \hookrightarrow HG↪H into a nontrivial simple group HHH of type F∞F_\inftyF∞​.

The input need not be finitely presented and its word-problem algorithm may have arbitrary running time; the classifying space of HHH may be infinite-dimensional.

Significance

The result. Theorem 1.1 answers the higher-finiteness strengthening of the Boone–Higman conjecture and implies the conjecture itself. With the classical converse (finitely presented simple groups have decidable word problem), it characterizes groups with decidable word problem as the finitely generated subgroups of simple groups of type F∞F_\inftyF∞​.

Formalizing it. No machine-checked proof exists; the source is an unrefereed preprint. A formalization requires CW complexes of finite type, classifying spaces and covering theory (partially in Mathlib), Brown's homological finiteness criterion, Steinberg groups, and twisted Brin–Thompson groups with the Belk–Zaremsky finiteness theorem (Theorem 5.1 in the preprint, from the literature).

Difficulty

Finite presentation already fails to pass to subgroups; higher finiteness additionally requires controlling relations among relations in every dimension. Known families of simple F∞F_\inftyF∞​ groups contain large classes of groups but give no general construction from a word-problem algorithm. The proof needs an oligomorphic faithful action of a group of type F∞F_\inftyF∞​ with stabilizers of type F∞F_\inftyF∞​, built from an algebraic envelope whose Steinberg-group kernel must be annihilated exactly (Theorem 4.6).

Formalization scope

  • GGG and HHH live in the same universe Type u; GGG carries [Group.FG G].
  • IsSimpleGroup H together with Nontrivial H encodes simplicity.
  • Type F∞F_\inftyF∞​ is encoded topologically via a finite-type CW structure on a connected Hausdorff space whose universal cover (a surjective covering with contractible total space) witnesses asphericity.
  • The word problem uses ComputablePred on lists of (generator, sign) pairs for a specified generating tuple.

The statement is not vacuous: the hypothesis holds for many groups (e.g. all finitely presented residually finite groups), and the conclusion requires a genuine embedding.

Needed infrastructure: finite-type CW complexes and K(π,1)K(\pi,1)K(π,1) spaces, Brown's criterion, group actions with finiteness properties, Steinberg groups over noncommutative algebras, and twisted Brin–Thompson groups. Contributions toward any of these are welcome.

Selected references

  • OpenAI, Simple F∞F_\inftyF∞​ overgroups of groups with decidable word problem, OpenAI Math Release preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Simple-F-infinity-overgroups-of-groups-with-decidable-word-problem-September-23-2026/paper.pdf
  • OpenAI, Finite algebraic envelopes and the Boone–Higman conjecture, OpenAI Math Release preprint, September 23, 2026. https://github.com/openai/math/blob/main/preprints/Finite-algebraic-envelopes-and-the-Boone-Higman-conjecture-September-23-2026/paper.pdf
  • W. W. Boone, G. Higman, An algebraic characterization of groups with soluble word problem, J. Austral. Math. Soc. 18 (1974). https://doi.org/10.1017/S1446788700019108
  • G. Higman, Subgroups of finitely presented groups, Proc. Roy. Soc. London Ser. A 262 (1961). https://doi.org/10.1098/rspa.1961.0132
  • R. J. Thompson, Embeddings into finitely generated simple groups which preserve the word problem, in Word Problems II, 1980. https://doi.org/10.1016/S0049-237X(08)71348-X
  • K. S. Brown, Homological criteria for finiteness, Comment. Math. Helv. 50 (1975). https://doi.org/10.1007/BF02565740
  • K. S. Brown, Finiteness properties of groups, J. Pure Appl. Algebra 44 (1987). https://doi.org/10.1016/0022-4049(87)90015-6
  • J. Belk, M. C. B. Zaremsky, Twisted Brin–Thompson groups, Geom. Topol. 26 (2022). https://doi.org/10.2140/gt.2022.26.1189
  • J. Belk, C. Bleak, F. Matucci, M. C. B. Zaremsky, Progress around the Boone–Higman conjecture, 2025. https://arxiv.org/abs/2306.16356
  • J. Belk, C. Bleak, F. Matucci, M. C. B. Zaremsky, Hyperbolic groups satisfy the Boone–Higman conjecture, Duke Math. J. 175 (2026). https://doi.org/10.1215/00127094-2025-0055
  • J. Belk, J. Hyde, F. Matucci, Finite germ extensions, 2024. https://arxiv.org/abs/2407.03149
2 thms1 active userReviewed
Group Theory·Captain: wurtle

A finitely generated counterexample to the Eilenberg–Ganea conjectureResearch Paper

Motivation: algebraic versus geometric dimension of groups

Two numbers measure how "large" a discrete group Γ\GammaΓ is. The cohomological dimension cd⁡Γ\operatorname{cd}\GammacdΓ is algebraic: the length of the shortest projective resolution of the trivial module Z\mathbb ZZ over the group ring Z[Γ]\mathbb Z[\Gamma]Z[Γ]. The geometric dimension gd⁡Γ\operatorname{gd}\GammagdΓ is topological: the least dimension of a CW complex with fundamental group Γ\GammaΓ and contractible universal cover (a classifying space or K(Γ,1)K(\Gamma,1)K(Γ,1)). Cellular chains of a classifying space give a free resolution, so cd⁡Γ≤gd⁡Γ\operatorname{cd}\Gamma\le\operatorname{gd}\GammacdΓ≤gdΓ. Eilenberg and Ganea proved in 1957 that equality holds whenever cd⁡Γ≥3\operatorname{cd}\Gamma\ge3cdΓ≥3, and Stallings and Swan settled dimension one. The remaining case — must a group of cohomological dimension two have a two-dimensional classifying space? — is the Eilenberg–Ganea conjecture, closely tied to Whitehead's asphericity conjecture in low-dimensional topology.

Background

  • 1941 — Whitehead asks whether every connected subcomplex of an aspherical 2-complex is aspherical (Ann. of Math. 1941).
  • 1957 — Eilenberg and Ganea prove cd⁡=gd⁡\operatorname{cd}=\operatorname{gd}cd=gd for cd⁡≥3\operatorname{cd}\ge3cd≥3 and pose the dimension-two question (Ann. of Math. 1957).
  • 1968–1969 — Stallings proves that finitely generated groups of cohomological dimension one are free (Ann. of Math. 1968); Swan removes finite generation (J. Algebra 1969).
  • 1997 — Bestvina and Brady introduce height kernels of right-angled Artin groups and show that for suitable flag triangulations of a spine of the Poincaré homology sphere at least one of the Eilenberg–Ganea and Whitehead conjectures fails (Invent. Math. 1997, Thm 8.7).
  • 1999 — Dicks and Leary give presentations of these kernels (Proc. AMS 1999); Howie studies them via plus constructions (Math. Proc. Camb. Phil. Soc. 1999).
  • 2026 — Leary and Petrosyan compare Coxeter and Bestvina–Brady candidates for the problem (arXiv:2605.07853).
  • 2026 — An OpenAI preprint, A finitely generated counterexample to the Eilenberg–Ganea conjecture (OpenAI Math Release, September 23, 2026), claims a finitely generated residually finite group with cd⁡=2\operatorname{cd}=2cd=2 and gd⁡=3\operatorname{gd}=3gd=3. The preprint has not been peer reviewed and its theorem is not formally verified.

Setting

For a finite simplicial graph Δ\DeltaΔ with vertex set VVV, the right-angled Artin group is

AΔ=⟨aq (q∈V) ∣ aqaraq−1ar−1=1 whenever q,r are adjacent⟩,A_\Delta=\bigl\langle a_q\ (q\in V)\ \bigm|\ a_qa_ra_q^{-1}a_r^{-1}=1\ \text{whenever } q,r \text{ are adjacent}\bigr\rangle ,AΔ​=⟨aq​ (q∈V) ​ aq​ar​aq−1​ar−1​=1 whenever q,r are adjacent⟩,

and the height homomorphism λ:AΔ→Z\lambda:A_\Delta\to\mathbb Zλ:AΔ​→Z sends every aqa_qaq​ to 111. Its kernel is a Bestvina–Brady group.

The specific graph comes from the presentation complex KKK of ⟨x,y∣x2y−5, x2(yx−1)3⟩\langle x,y\mid x^2y^{-5},\ x^2(yx^{-1})^{3}\rangle⟨x,y∣x2y−5, x2(yx−1)3⟩, which is integrally acyclic and has a nontrivial representation of its fundamental group into SU(2)\mathrm{SU}(2)SU(2). Subdivide each of the two loops of KKK into three edges, cone the boundary of each relator polygon to a new interior vertex (keeping one radial edge per boundary occurrence), and take the order complex of the resulting regular cell structure (7 vertices, 51 edges, 45 triangular sectors). This is a flag triangulation LLL of KKK; Δ\DeltaΔ is its 1-skeleton, i.e. the comparability graph of the cells. The group is G=ker⁡λ≤AΔG=\ker\lambda\le A_\DeltaG=kerλ≤AΔ​.

A group is residually finite if every nontrivial element survives in some finite quotient.

Formalization targets

Goal: the counterexample (Theorem 1.1)

For the group GGG above,

G is finitely generated and residually finite,cd⁡G=2,G has a 3-dimensional K(G,1),G has no 2-dimensional K(G,1).G\ \text{is finitely generated and residually finite},\qquad \operatorname{cd}G=2,\qquad G \text{ has a 3-dimensional } K(G,1),\qquad G \text{ has no 2-dimensional } K(G,1).G is finitely generated and residually finite,cdG=2,G has a 3-dimensional K(G,1),G has no 2-dimensional K(G,1).

In particular gd⁡G=3≠2=cd⁡G\operatorname{gd}G=3\ne2=\operatorname{cd}GgdG=3=2=cdG. The non-existence clause holds for classifying spaces with any number of cells. The goal statement is published on the platform with status Open: no machine-checked proof exists yet.

Significance

The result itself. The theorem disproves the Eilenberg–Ganea conjecture with a finitely generated (indeed type FL\mathrm{FL}FL, but not finitely presented) residually finite group, so the conjecture fails even for countable groups with strong finiteness properties. By Bestvina–Brady's dichotomy the Whitehead conjecture is not directly decided by this example, but the gap between the algebraic and geometric dimensions in dimension two is now exhibited concretely.

Formalizing it. The statement is concrete: an explicit finite graph, its Artin group and height kernel, a projective dimension, and existence/non-existence of CW models. The non-existence clause ranges over all CW complexes of arbitrary cardinality, which is exactly the kind of universally quantified topological claim where a machine check is valuable. Groundwork includes classifying spaces in Mathlib's CW-complex framework, projective dimension over group rings, and Bestvina–Brady Morse theory.

Difficulty

The kernel acts freely on an acyclic 2-complex, which gives cd⁡G≤2\operatorname{cd}G\le2cdG≤2, but an acyclic complex need not be contractible, and showing that one particular 2-dimensional model fails to be a K(G,1)K(G,1)K(G,1) says nothing about other models. The obstacle is to rule out every hypothetical two-dimensional classifying space, with arbitrarily many cells, and to do so for a group that is not finitely presented. Homological invariants cannot see the difference, since they agree with those of a genuine 2-dimensional model.

Formalization scope

  • The seed complex is encoded combinatorially: signed relator words seedWord, rose vertices, circle edges and sectors; seedGraph is the comparability graph of the cell face relation. ArtinGroup is a PresentedGroup on commutators of adjacent vertices, height sends each generator to 111 in Multiplicative ℤ, and SourceGroup is its kernel.
  • cohomologicalDimension is the categorical projective dimension (in WithBot ℕ∞) of the trivial Z[G]\mathbb Z[G]Z[G]-module in ModuleCat.
  • HasClassifyingSpace G n asks for a Hausdorff, path-connected CW complex with no cells above dimension nnn, fundamental group isomorphic to GGG, and a surjective covering map from a contractible space. The positive clause is stated in universe 0; the negative clause is universe-polymorphic, so no restriction on the cardinality of cells is imposed.
  • Needed infrastructure: Bestvina–Brady level complexes, presentations of height kernels, residual finiteness of RAAG subgroups, SU(2)\mathrm{SU}(2)SU(2) representations and degree arguments.

Selected references

  • S. Eilenberg and T. Ganea, On the Lusternik–Schnirelmann category of abstract groups, Ann. of Math. 65 (1957). https://doi.org/10.2307/1970062
  • J. H. C. Whitehead, On adding relations to homotopy groups, Ann. of Math. 42 (1941). https://doi.org/10.2307/1968907
  • J. R. Stallings, On torsion-free groups with infinitely many ends, Ann. of Math. 88 (1968). https://doi.org/10.2307/1970577
  • R. G. Swan, Groups of cohomological dimension one, J. Algebra 12 (1969). https://doi.org/10.1016/0021-8693(69)90030-1
  • M. Bestvina and N. Brady, Morse theory and finiteness properties of groups, Invent. Math. 129 (1997). https://doi.org/10.1007/s002220050168
  • W. Dicks and I. J. Leary, Presentations for subgroups of Artin groups, Proc. Amer. Math. Soc. 127 (1999). https://doi.org/10.1090/S0002-9939-99-04873-X
  • J. Howie, Bestvina–Brady groups and the plus construction, Math. Proc. Cambridge Philos. Soc. 127 (1999). https://doi.org/10.1017/S0305004199003928
  • I. J. Leary and N. Petrosyan, Universal structure of graph product kernels, preprint, 2026. https://arxiv.org/abs/2605.07853v1
  • OpenAI, A finitely generated counterexample to the Eilenberg–Ganea conjecture, OpenAI Math Release preprint, September 23, 2026 (source of the goal; Theorem 1.1, p. 1). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-finitely-generated-counterexample-to-the-Eilenberg-Ganea-conjecture-September-23-2026/paper.pdf
2 thms1 active userReviewed
CombinatoricsGroup Theory·Captain: wurtle

Bounded-degree coboundary expanders in every dimensionResearch Paper

Motivation: high-dimensional analogues of expander graphs

An expander graph is a sparse graph in which every set of vertices has a large edge boundary relative to its size. Expanders with bounded degree are a basic tool across combinatorics, computer science and group theory. High-dimensional expanders are simplicial complexes that extend this behavior to faces of every dimension, and coboundary expansion over F2\mathbb F_2F2​ is the strongest of the standard notions: the coboundary of any set of iii-faces must be large unless the set is already close to a coboundary. Gromov connected such filling inequalities with topological overlap of maps to Euclidean space. The basic existence question is whether there are arbitrarily large complexes of fixed dimension with bounded vertex degree and uniform coboundary expansion in every degree.

Background and timeline

  • 2006–2009 — Linial–Meshulam (Combinatorica 2006) and Meshulam–Wallach (Random Struct. Alg. 2009) develop the coisoperimetric viewpoint through random complexes.
  • 2010 — Gromov connects cohomological filling inequalities with topological overlap and asks for large complexes with bounded vertex incidence and uniform filling bounds (GAFA 2010, §§2.3–2.5, 2.14).
  • 2015 — Lubotzky and Meshulam construct random Latin-square coboundary expanders in dimension two, with bounded codimension-one degree (Adv. Math. 2015).
  • 2016 — Kaufman, Kazhdan and Lubotzky prove cosystolic and topological expansion for two-dimensional skeleta of Ramanujan complexes, with bounded vertex degree (GAFA 2016).
  • 2019 — Lubotzky, Luria and Rosenthal construct random Steiner-system coboundary expanders in every dimension, again with bounded codimension-one degree but growing vertex degree (Discrete Comput. Geom. 2019).
  • 2024 — Evra and Kaufman obtain bounded-degree cosystolic expanders in every dimension (JAMS 2024); cosystolic expansion allows nonzero cohomology.
  • 2025 — Chapman and Lubotzky prove existence of bounded-degree two-dimensional coboundary expanders over F2\mathbb F_2F2​ and state the general problem (Adv. Math. 2025, Problem 1.3, Theorem 1.9); Kaufman–Oppenheim–Weinberger (arXiv:2411.02819) prove degree-one coboundary expansion for coset complexes; Oppenheim and Valentiner-Branth prove cosystolic expansion for Kac–Moody–Steinberg complexes (arXiv:2504.05823).
  • 2026 — The OpenAI preprint Bounded-degree coboundary expanders in every dimension (OpenAI Math Release, September 24, 2026) claims bounded-degree F2\mathbb F_2F2​ coboundary expanders in every dimension d≥3d\ge3d≥3. It has not been peer reviewed and its theorem is not formally verified.

Setting

A finite simplicial complex YYY is a downward-closed family of finite sets (faces) of vertices; Y(i)Y(i)Y(i) denotes the faces with i+1i+1i+1 vertices. YYY is pure of dimension sss if it has sss-faces and every face lies in one. An iii-cochain is a function f:Y(i)→F2f:Y(i)\to\mathbb F_2f:Y(i)→F2​; its coboundary is (δif)(τ)=∑σ⊂τ, ∣σ∣=i+1f(σ)(\delta_if)(\tau)=\sum_{\sigma\subset\tau,\,|\sigma|=i+1}f(\sigma)(δi​f)(τ)=∑σ⊂τ,∣σ∣=i+1​f(σ). Let Bi(Y)=im⁡δi−1B^i(Y)=\operatorname{im}\delta_{i-1}Bi(Y)=imδi−1​, with B0(Y)B^0(Y)B0(Y) the constant functions. Faces are weighted by

wi(σ)=#{τ∈Y(s):σ⊆τ}(s+1i+1)∣Y(s)∣,∥f∥i=∑σ: f(σ)≠0wi(σ),w_i(\sigma)=\frac{\#\{\tau\in Y(s):\sigma\subseteq\tau\}}{\binom{s+1}{i+1}|Y(s)|},\qquad \|f\|_{i}=\sum_{\sigma:\,f(\sigma)\ne0}w_i(\sigma),wi​(σ)=(i+1s+1​)∣Y(s)∣#{τ∈Y(s):σ⊆τ}​,∥f∥i​=σ:f(σ)=0∑​wi​(σ),

so ∥f∥i\|f\|_i∥f∥i​ is the probability that fff is nonzero on a random iii-face of a uniformly random top face, and dist⁡i(f,A)=min⁡a∈A∥f−a∥i\operatorname{dist}_i(f,A)=\min_{a\in A}\|f-a\|_idisti​(f,A)=mina∈A​∥f−a∥i​.

In Lean (namespace OAI.CoboundaryExpanders), a Complex has vertex set Fin vertexCount, a Finset of faces that is downward closed and contains every singleton; Pure, Connected (connected 111-skeleton), weight, norm, coboundary, coboundaries and distance follow these definitions, and topDegree X d v counts ddd-faces containing vvv.

Formalization targets

Goal: bounded-degree coboundary expanders (Theorem 1.1)

For every d≥3d\ge3d≥3 there are D<∞D<\inftyD<∞, ε>0\varepsilon>0ε>0 and finite connected pure ddd-dimensional complexes XmX_mXm​ with ∣Xm(0)∣→∞|X_m(0)|\to\infty∣Xm​(0)∣→∞, every vertex in at most DDD faces of dimension ddd, and

∥δif∥Xm,i+1 ≥ ε dist⁡Xm,i(f,Bi(Xm))(f∈Ci(Xm;F2), 0≤i<d),\|\delta_if\|_{X_m,i+1}\ \ge\ \varepsilon\,\operatorname{dist}_{X_m,i}\bigl(f,B^i(X_m)\bigr)\qquad(f\in C^i(X_m;\mathbb F_2),\ 0\le i<d),∥δi​f∥Xm​,i+1​ ≥ εdistXm​,i​(f,Bi(Xm​))(f∈Ci(Xm​;F2​), 0≤i<d),

with constants independent of mmm, iii and fff. The Lean goal is published on the platform with status Open.

Significance

The result itself. Together with the classical graph case and the Chapman–Lubotzky two-dimensional theorem, Theorem 1.1 gives bounded-degree F2\mathbb F_2F2​ coboundary expanders in every positive dimension, answering the existence question in the form stated by Chapman and Lubotzky. Earlier bounded-vertex-degree constructions gave cosystolic expansion, which permits nonvanishing cohomology, or degree-one expansion only; earlier coboundary expanders in all dimensions had vertex degrees growing with size. Coboundary expansion in all degrees implies vanishing F2\mathbb F_2F2​-cohomology below the top dimension, the property Gromov related to topological overlap.

Formalizing it. The definitions are elementary finite combinatorics, so the statement is completely precise; the proof combines group-theoretic coset complexes over SLN(k[t])\mathrm{SL}_N(k[t])SLN​(k[t]), congruence quotients and a quantitative cosystolic input. A formal proof would require formalizing that input (Oppenheim–Valentiner-Branth), which is substantial.

Difficulty

Coboundary expansion requires two things at once: a quantitative isoperimetric inequality against cocycles (cosystolic expansion) and exact vanishing of Hi(Xm;F2)H^i(X_m;\mathbb F_2)Hi(Xm​;F2​) for every i<di<di<d. Random constructions give vanishing cohomology but force growing vertex degree; algebraic bounded-degree constructions (Ramanujan complexes, coset complexes) give the quantitative inequality but typically have nonzero cohomology that cannot be controlled uniformly. A cocycle that is not a coboundary has zero coboundary and positive distance, so any nonzero cohomology class destroys the inequality. The difficulty is a family of bounded-degree complexes whose cohomology vanishes in every degree below ddd, uniformly along the tower.

Formalization scope

  • Vertices are Fin vertexCount and every vertex is a face; faces are Finsets, and an iii-face has exactly i+1i+1i+1 vertices.
  • Purity requires at least one ddd-face; connectivity is of the 111-skeleton and requires a nonempty vertex set, so empty or disconnected complexes do not satisfy the hypotheses.
  • Cochains are ZMod 2-valued; B0B^0B0 is the constant cochains (reduced cohomology in degree 000). Distance is a real sInf over the image of a nonempty finite set, hence a minimum.
  • The inequality is required for every i<di<di<d and every cochain, with DDD and ε\varepsilonε chosen before the sequence and depending only on ddd. Only d≥3d\ge3d≥3 is asserted; dimensions 111 and 222 are separate known results.
  • Needed infrastructure: coset complexes, local spectral expansion and cosystolic expansion theorems, and cohomology of congruence quotients. A library of simplicial cochain complexes over F2\mathbb F_2F2​ would be reusable for many high-dimensional-expansion problems.

Selected references

  • N. Linial and R. Meshulam, Homological connectivity of random 2-complexes, Combinatorica 26 (2006). https://doi.org/10.1007/s00493-006-0027-9
  • R. Meshulam and N. Wallach, Homological connectivity of random k-dimensional complexes, Random Structures Algorithms 34 (2009). https://doi.org/10.1002/rsa.20238
  • M. Gromov, Singularities, expanders and topology of maps. Part 2, Geom. Funct. Anal. 20 (2010), 416–526. https://doi.org/10.1007/s00039-010-0073-8
  • A. Lubotzky and R. Meshulam, Random Latin squares and 2-dimensional expanders, Adv. Math. 272 (2015). https://doi.org/10.1016/j.aim.2014.12.015
  • T. Kaufman, D. Kazhdan and A. Lubotzky, Isoperimetric inequalities for Ramanujan complexes and topological expanders, Geom. Funct. Anal. 26 (2016). https://doi.org/10.1007/s00039-016-0362-y
  • A. Lubotzky, Z. Luria and R. Rosenthal, Random Steiner systems and bounded degree coboundary expanders of every dimension, Discrete Comput. Geom. 62 (2019). https://doi.org/10.1007/s00454-018-9991-2
  • S. Evra and T. Kaufman, Bounded degree cosystolic expanders of every dimension, J. Amer. Math. Soc. 37 (2024). https://doi.org/10.1090/jams/1019
  • M. Chapman and A. Lubotzky, Stability of homomorphisms, coverings and cocycles II: Examples, applications and open problems, Adv. Math. 463 (2025). https://doi.org/10.1016/j.aim.2025.110117
  • T. Kaufman, I. Oppenheim and S. Weinberger, Coboundary expansion of coset complexes, arXiv:2411.02819 (STOC 2025). https://arxiv.org/abs/2411.02819v1
  • I. Oppenheim and I. Valentiner-Branth, New cosystolic high-dimensional expanders from KMS groups, arXiv:2504.05823. https://arxiv.org/abs/2504.05823v2
  • OpenAI, Bounded-degree coboundary expanders in every dimension, OpenAI Math Release preprint, September 24, 2026 (Theorem 1.1, p. 1). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Bounded-degree-coboundary-expanders-in-every-dimension-September-24-2026/paper.pdf
2 thms1 active userReviewed
CombinatoricsDiscrete Geometry·Captain: wurtle

A nine-dimensional counterexample to Borsuk's covering assertionResearch Paper

Motivation

In 1933 Borsuk asked whether every bounded set of positive diameter in Rd\mathbb R^dRd can be split into d+1d+1d+1 pieces of strictly smaller diameter. The answer is yes in dimensions d≤3d\le3d≤3 and for smooth convex bodies, and a regular simplex shows that d+1d+1d+1 pieces may be necessary. Kahn and Kalai showed in 1993 that the answer is no in high dimensions, and since then the question has been: in which dimensions does Borsuk's assertion first fail? The smallest known counterexample dimension measures how far our understanding of diameter partitions extends; it has been reduced from 132513251325 to 636363 by combinatorial constructions, while the assertion is open in all dimensions between 444 and the current record.

Timeline

  • 1933. Borsuk poses the partition question (doi:10.4064/fm-20-1-177-190).
  • 1981. Frankl and Wilson prove a forbidden-intersection theorem that later drives the first counterexample (doi:10.1007/BF02579457).
  • 1993. Kahn and Kalai disprove Borsuk's conjecture in dimension 132513251325 and all large dimensions (doi:10.1090/S0273-0979-1993-00398-7).
  • 1994–2000. Reductions to dimension 946946946 (Nilli), 561561561 (Raigorodskii, doi:10.1070/RM1997v052n06ABEH002184) and 560560560 (Weißbach).
  • 2002–2003. Spherical codes from the Leech lattice give 323323323 (Hinrichs, doi:10.1016/S0012-365X(01)00202-3), 321321321 (Pikhurko, arXiv:math/0202112) and 298298298 (Hinrichs–Richter, doi:10.1016/S0012-365X(02)00833-6).
  • 2014. Strongly regular graphs give 656565 (Bondarenko, doi:10.1007/s00454-014-9579-4) and 646464 (Jenrich–Brouwer, doi:10.37236/4069).
  • 2015. Kalai surveys the problem and describes the projector embedding x↦x⊗xx\mapsto x\otimes xx↦x⊗x (doi:10.1017/CBO9781316106853.005).
  • 2026. Grinsztajn gives a finite counterexample in dimension 636363 (author manuscript).

The source of this mission, an OpenAI preprint dated September 23, 2026, claims a counterexample in dimension 999.

Setting

For a bounded set YYY of positive diameter, b(Y)b(Y)b(Y) is the least number of subsets of strictly smaller diameter that cover YYY (covers and partitions give the same number). Borsuk's assertion in Rd\mathbb R^dRd is that b(Y)≤d+1b(Y)\le d+1b(Y)≤d+1 for every such Y⊂RdY\subset\mathbb R^dY⊂Rd.

Let Sym4(R)\mathrm{Sym}_4(\mathbb R)Sym4​(R) be the real symmetric 4×44\times44×4 matrices with the Frobenius norm ∥A∥F2=tr⁡(A2)=∑i,jAij2\|A\|_F^2=\operatorname{tr}(A^2)=\sum_{i,j}A_{ij}^2∥A∥F2​=tr(A2)=∑i,j​Aij2​. The trace-one hyperplane {tr⁡A=1}\{\operatorname{tr}A=1\}{trA=1} in Sym4(R)\mathrm{Sym}_4(\mathbb R)Sym4​(R) is a 999-dimensional affine Euclidean space. For a unit vector u∈R4u\in\mathbb R^4u∈R4, uuTuu^{\mathsf T}uuT is the orthogonal projector onto the line Ru\mathbb RuRu. Two such projectors are at distance 2\sqrt22​ exactly when the lines are orthogonal.

Formalization targets

Goal: Theorem 1.1

The set

X={uuT:u∈R4, ∥u∥=1}⊂{A∈Sym4(R):tr⁡A=1}X=\{uu^{\mathsf T}:u\in\mathbb R^4,\ \|u\|=1\}\subset\{A\in\mathrm{Sym}_4(\mathbb R):\operatorname{tr}A=1\}X={uuT:u∈R4, ∥u∥=1}⊂{A∈Sym4​(R):trA=1}

is compact, has Frobenius diameter 2\sqrt22​, and cannot be covered by ten subsets of diameter strictly less than 2\sqrt22​. Hence b(X)≥11>9+1b(X)\ge11>9+1b(X)≥11>9+1 and Borsuk's assertion fails in dimension 999. The Lean statement OAI.BorsukNine.main_theorem is open on the platform.

Significance

The theorem lowers the smallest known counterexample dimension for Borsuk's conjecture from 636363 to 999, and the paper extends it to compact counterexamples in every dimension d≥9d\ge9d≥9 (Corollary 7.1). Unlike previous counterexamples, which are finite point sets built from codes or strongly regular graphs, the witness is a continuum: the image of real projective 333-space under the projector embedding. The theorem does not determine the smallest failing dimension (the assertion remains undecided in dimensions 444 to 888) or the exact value of b(X)b(X)b(X).

The result is claimed in an OpenAI preprint; it has not been peer reviewed and no machine-checked proof exists. A formal proof would combine metric geometry, an algebraic-topological degree argument and a finite combinatorial obstruction.

Difficulty

Previous counterexamples use finite sets where a counting argument (Frankl–Wilson type) forces many parts; such counting gives nothing for a 999-dimensional continuum. For XXX, a cover by ten small sets corresponds to ten nonnegative functions on RP3\mathbb{RP}^3RP3 summing to one, with orthogonal lines never sharing a positive coordinate. One would like to use the minimal number of vertices of a triangulation of RP3\mathbb{RP}^3RP3 (Walkup: eleven), but the positive-support complex arising from such functions is not a triangulation, so its face structure has to be derived from the map itself.

Formalization scope

  • Vectors are EuclideanSpace ℝ (Fin 4); matrices are EuclideanSpace ℝ (Fin 4 × Fin 4), whose norm is the Frobenius norm. projector u has entries uiuju_iu_jui​uj​.
  • projectorSet is the image of the unit sphere; traceOneSymmetric is the set of symmetric matrices of trace 111.
  • HasTenSmallCover: ten subsets of projectorSet covering it, each with Metric.diam < √2. Requiring the pieces to lie in XXX loses no generality, and keeps Metric.diam away from its default value for unbounded sets.
  • The goal is the conjunction: IsCompact projectorSet, containment in traceOneSymmetric, Metric.diam projectorSet = √2, and ¬ HasTenSmallCover.

A complete development needs partitions of unity, mod-two degree of odd maps on spheres, local preimage counting, and a finite combinatorial case analysis on labelled supports. The finite combinatorial part (Sections 5–6) and Lemma 2.4 (reduction to strict gaps) are self-contained and welcome first contributions.

Selected references

  • OpenAI, A nine-dimensional counterexample to Borsuk's covering assertion, preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-nine-dimensional-counterexample-to-Borsuks-covering-assertion-September-23-2026/paper.pdf
  • K. Borsuk, Drei Sätze über die nnn-dimensionale euklidische Sphäre, Fund. Math., 1933. https://doi.org/10.4064/fm-20-1-177-190
  • J. Kahn, G. Kalai, A counterexample to Borsuk's conjecture, Bull. Amer. Math. Soc., 1993. https://doi.org/10.1090/S0273-0979-1993-00398-7
  • A. Hinrichs, C. Richter, New sets with large Borsuk numbers, Discrete Math., 2003. https://doi.org/10.1016/S0012-365X(02)00833-6
  • A. V. Bondarenko, On Borsuk's conjecture for two-distance sets, Discrete Comput. Geom., 2014. https://doi.org/10.1007/s00454-014-9579-4
  • T. Jenrich, A. E. Brouwer, A 64-dimensional counterexample to Borsuk's conjecture, Electron. J. Combin., 2014. https://doi.org/10.37236/4069
  • G. Kalai, Some old and new problems in combinatorial geometry I: around Borsuk's problem, Surveys in Combinatorics, 2015. https://doi.org/10.1017/CBO9781316106853.005
  • D. W. Walkup, The lower bound conjecture for 3- and 4-manifolds, Acta Math., 1970. https://doi.org/10.1007/BF02392331
2 thms1 active userReviewed
PreviousPage 1 of 2Next

Get started

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

About Prove2Me

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

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me