Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Algebraic Topology

41 missions · 28 completed

Missions

Open13Completed28All41
🏆Completed
Group Theory·Captain: LG

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

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…

64 thms11 active usersReviewed
🏆Completed
Group Theory·Captain: LG

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

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…

57 thms8 active usersReviewed
Geometry & Topology·Captain: ryanshin

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

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,…

60 thms5 active usersReviewed
🏆Completed
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

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…

16 thms4 active usersReviewed
🏆Completed
Pure Mathematics·Captain: korbonits

Hatcher Algebraic Topology I: The Fundamental Group of the CircleTextbook

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…

11 thms4 active usersReviewed
CombinatoricsComplexity TheoryGroup Theory+1·Captain: Shuze Chen

Polynomial Swap Coboundary Expansion with Applications to LTCs and PCPsResearch Paper

Agreement tests, locally testable codes and probabilistically checkable proofs share one step: local functions that agree on most overlaps must be stitched into one global function. On high-dimensional expanders this step is controlled by swap coboundary expansion. That notion asks the faces complex of a simplicial complex to be a coboundary expander with…

29 thms3 active usersReviewed
Linear algebraOptimization·Captain: iris

Hidden Convexity, Optimization, and Algorithms on Rotation Matrices: Every Linear Image of SO(n)\mathrm{SO}(n)SO(n) in the Plane Is Convex for n≥3n \ge 3n≥3Research Paper

Many problems in computer vision, robotics, satellite attitude estimation and point-cloud registration ask for the rotation that best explains some data. In matrix form they are linear optimization problems over the special orthogonal group, max⁡{⟨A,X⟩:X∈SO(n)}\max\{\langle A,X\rangle : X\in\mathrm{SO}(n)\}max{⟨A,X⟩:X∈SO(n)}, where ⟨A,X⟩=tr⁡(A⊤X)\langle A,X\rangle=\operatorname{tr}(A^\top X)⟨A,X⟩=tr(A⊤X). Without side…

13 thms3 active usersReviewed
🏆Completed
Differential GeometryFunctional Analysis·Captain: mikedeng1

Integrating L∞-Algebras: For Every Non-Negatively Graded, Degreewise Finite-Dimensional L∞-Algebra L, ∫L Is a Kan Simplicial Banach Manifold Whose Postnikov Tower Consists of Kan FibrationsResearch Paper

Lie's third theorem says that every finite-dimensional Lie algebra is the Lie algebra of a Lie group. L∞L_\inftyL∞​-algebras (strongly homotopy Lie algebras) generalize Lie algebras by allowing brackets of every arity, related by the Jacobi identity only up to coherent homotopy. They occur as symmetries in deformation theory, in higher gauge theory and in string…

30 thms3 active usersReviewed
🏆Completed
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

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,…

10 thms3 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

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,…

41 thms3 active usersReviewed
Algorithmic Game TheoryCombinatoricsGraph Theory·Captain: iris

Balanced Fair Division and Generalized Kneser GraphsResearch Paper

Many allocation problems divide indivisible goods between groups rather than individuals: households sharing what they receive, teams, or departments. Every member of a group gets the same bundle, but each member judges it with her own preferences, so a bundle that one member finds fair another may envy. Exact envy-freeness is impossible already for a…

32 thms2 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Improved Lower Bounds on Tree CoversResearch Paper

A tree cover approximates a finite metric by a few trees instead of one. For an nnn-point metric space (X,d)(X, d)(X,d), an (α,k)(\alpha, k)(α,k)-tree cover is a family of kkk edge-weighted trees T1,…,TkT_1, \dots, T_kT1​,…,Tk​ on the vertex set XXX such that every tree dominates the metric, dTi(x,y)≥d(x,y)d_{T_i}(x,y) \ge d(x,y)dTi​​(x,y)≥d(x,y), and every pair x,yx, yx,y is approximated within a factor α\alphaα in at least one tree.…

36 thms2 active usersReviewed
Differential Geometry·Captain: xwh

Negative Einstein four-manifolds with b2=0b_2=0b2​=0 have nontrivial fundamental groupOpen Problem

An Einstein metric is a smooth positive-definite Riemannian metric whose Ricci tensor is a constant multiple of the metric. This mission asks whether negative Einstein curvature can coexist with simple connectedness and vanishing second real homology on a closed four-manifold. It contains one geometric conjecture. The separate K24 change-of-slice program…

3 thms2 active usersReviewed
Algorithmic Game TheoryCombinatorics·Captain: mikedeng1

Envy-Free Division of Multilayered Cakes: For a Prime-Power Number q of Groups with m ≤ q ≤ n, a Feasible Contiguous Group-Birthday Envy-Free Multi-Division by q − 1 Long Knives ExistsResearch Paper

Envy-free cake cutting asks for a division of a divisible resource, modelled as the interval [0,1][0,1][0,1], among agents with individual preferences so that no agent prefers another agent's share to its own. For a single cake and contiguous pieces, the existence of envy-free divisions goes back to Stromquist (1980) and to Su's Sperner-lemma proof (1999).

7 thms2 active usersReviewed
🏆Completed
Group TheoryMathematical PhysicsRepresentation Theory·Captain: Alien60

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

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…

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

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…

10 thms2 active usersReviewed
Geometry & Topology·Captain: LG

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

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…

11 thms2 active usersReviewed
🏆Completed
Geometry & TopologySymplectic Geometry·Captain: Mazecto

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

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…

32 thms2 active usersReviewed
🏆Completed
Category Theory·Captain: marwahaha

The Grothendieck homotopy hypothesis via elementary expansionsOpen Problem

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.

2 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: marwahaha

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

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.

4 thms2 active usersReviewed
🏆Completed
Dynamical Systems·Captain: marwahaha

A C^1 Counterexample to the Entropy ConjectureOpen Problem

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.

4 thms2 active usersReviewed
🏆Completed
Category Theory·Captain: wurtle

Thomason Model Structures in Every Strict Higher DimensionResearch Paper

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…

6 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: wurtle

A universal group of type F∞Research Paper

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…

6 thms2 active usersReviewed
🏆Completed
Group TheoryMathematical Logic·Captain: wurtle

Simple F∞ overgroups of groups with decidable word problemResearch Paper

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…

6 thms2 active usersReviewed
🏆Completed
Group Theory·Captain: wurtle

A finitely generated counterexample to the Eilenberg–Ganea conjectureResearch Paper

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…

11 thms2 active usersReviewed
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me