Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Algebra

175 missions · 96 completed

The study of algebraic structures — groups, rings, and fields — and, through algebraic geometry, the geometry of the solution sets of polynomial equations. Using commutative algebra to describe these varieties, the field provides a common language of symmetry and structure that underlies much of modern mathematics.

Missions

Open79Completed96All175
🏆Completed
Complexity TheoryLinear algebraTheoretical Computer Science·Captain: mikedeng1

Most Tensor Problems Are NP-Hard 4: A Rational 2×2×2 Tensor Has Smaller Rank over the Reals Than over the RationalsResearch Paper

The rank of a matrix does not depend on the field in which its entries are read: a rational matrix has the same rank over Q\mathbb QQ, R\mathbb RR and C\mathbb CC, because rank is computed by Gaussian elimination, which never leaves the field of the entries. For 3-tensors, arrays A=[ ⁣[aijk] ⁣]\mathcal A = [\![a_{ijk}]\!]A=[[aijk​]] with three indices, this fails. Tensor rank governs the…

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

An infinite finitely presented periodic groupOpen Problem

Periodic groups have only finite-order elements, but this local condition does not visibly bound the group’s size. The source asks whether an ordinary finite presentation forces such a group to be finite. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Mathematical Logic·Captain: marwahaha

Finite congruence lattices: characterization and undecidabilityOpen Problem

A finite algebra has a lattice of congruences, ordered by inclusion. The source studies which finite lattices arise in this way, and the available goal captures its colored-graph characterization. The source is OpenAI's September 2026 manuscript.

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

A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd CharacteristicOpen Problem

The odd-characteristic version of direct finiteness has different coefficient constraints from the binary case. The source fixes one odd prime and links a group-algebra counterexample to a cellular automaton. The source is OpenAI's September 2026 manuscript.

2 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: marwahaha

A Counterexample to the Group-Ring Determinant ConjectureOpen Problem

The determinant of a nonsingular integer matrix has absolute value at least one. The source examines the proposed counterpart for integer matrices over group rings, where the determinant is defined by an operator trace. The source is OpenAI's September 2026 manuscript.

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

A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Characteristic TwoOpen Problem

Finite-dimensional linear algebra makes a one-sided inverse two-sided. The source asks whether finite support in a group algebra can replace finite dimension and presents a characteristic-two counterexample. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Captain: marwahaha

Lech's multiplicity conjectureOpen Problem

Multiplicity measures the growth of infinitesimal neighborhoods in a local ring. The manuscript addresses Lech’s flat-local-map inequality; the available formal target isolates its complete-domain Frobenius-complex component. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

Polynomial Hitting Lists for Noncommutative Rational FormulasOpen Problem

Inversion gates create domains of definition as well as nonzero-value conditions. A rational hitting list must find a point where every inverse exists and where the final value is invertible. The source manuscript presents the surrounding research claim.

7 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

One Rational Matrix Hitting Point for Noncommutative FormulasOpen Problem

Testing a noncommutative polynomial at scalar points can lose its ordered-word structure. Matrix evaluation preserves noncommutativity and permits a single prescribed tuple to test an entire bounded-size formula class. The source manuscript presents the surrounding research claim.

27 thms2 active usersReviewed
🏆Completed
Convex Optimization·Captain: marwahaha

A nonspectrahedral hyperbolicity coneOpen Problem

Hyperbolic polynomials define convex optimization regions through real-rooted line restrictions. A spectrahedral representation would describe the same region by one finite symmetric positive-semidefinite matrix inequality. The source manuscript presents the surrounding research claim.

35 thms2 active usersReviewed
🏆Completed
Algebraic Geometry·Captain: marwahaha

An explicit noncoordinate polynomial with affine three-space zero fibreOpen Problem

A hypersurface can be abstractly affine space without its defining equation being an ambient coordinate. Distinguishing these two properties is the embedding question behind the Abhyankar–Sathaye problem. The source manuscript presents the surrounding research claim.

44 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: marwahaha

The Deligne-Drinfeld conjectureOpen Problem

Compatibility between reassociation and braiding imposes equations on formal Lie expressions. The question is whether those equations leave precisely the free family of odd-weight generators predicted by the Deligne–Drinfeld conjecture. The source manuscript presents the surrounding research claim.

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

Finite algebraic envelopes and the Boone–Higman conjectureResearch Paper

The word problem for a group with a finite generating set asks whether a given word in the generators and their inverses represents the identity; it is decidable if one algorithm answers this for every word. Since Higman's embedding theorem (1961), a recurring theme in combinatorial group theory has been to characterize algorithmic properties of groups by…

13 thms2 active usersReviewed
🏆Completed
Algebraic GeometryRepresentation Theory·Captain: wurtle

Quadratic stabilization of the canonical Foulkes--Howe mapResearch Paper

Plethysm — decomposing Sym⁡a(Sym⁡bV)\operatorname{Sym}^a(\operatorname{Sym}^b V)Syma(SymbV) into irreducible GL(V)\mathrm{GL}(V)GL(V)-representations — is one of the oldest open problems in the representation theory of the general linear group, and it is central to geometric complexity theory, where the coordinate rings of Chow varieties of products of linear forms control lower-bound…

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

The Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjectureResearch Paper

The Hattori–Stallings trace refines the rank of a finitely generated projective module over a group ring CG\mathbb CGCG into one complex number per conjugacy class of GGG. These numbers enter group-ring Euler characteristics, where they retain information that an ordinary numerical Euler characteristic forgets. Bass's trace conjecture (complex group-ring form)…

7 thms2 active usersReviewed
🏆Completed
Representation Theory·Captain: wurtle

A counterexample to Tachikawa's second conjectureResearch Paper

Let AAA be a finite-dimensional algebra over a field. A finite-dimensional module MMM is self-orthogonal if Ext⁡Ai(M,M)=0\operatorname{Ext}^i_A(M,M)=0ExtAi​(M,M)=0 for every i>0i>0i>0. Tachikawa's second conjecture asserts that over a self-injective algebra every self-orthogonal module is projective. It belongs to the cluster of homological conjectures around quasi-Frobenius algebras and…

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

An explicit counterexample to the Auslander-Reiten conjectureResearch Paper

In the representation theory of finite-dimensional algebras, vanishing of Ext⁡\operatorname{Ext}Ext groups is the standard way of detecting projectivity homologically. The Auslander–Reiten conjecture (1975) asserts that a finitely generated module MMM over an Artin algebra RRR is projective as soon as

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

An algebra of infinite little finitistic dimensionResearch Paper

Every module over a ring has a projective resolution, and its length, the projective dimension, measures how far the module is from being projective. Over a finite-dimensional algebra, some modules have infinite projective dimension; the finitistic dimension conjectures ask whether, among the modules whose projective dimension is finite, these finite values…

3 thms2 active usersReviewed
🏆Completed
Algebraic TopologyGroup Theory·Captain: wurtle

A Torsion-Free Group Algebra with Zero DivisorsResearch Paper

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…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsRepresentation Theory·Captain: wurtle

Combinatorial invariance of Kazhdan–Lusztig polynomialsResearch Paper

Kazhdan–Lusztig polynomials Pu,b(q)P_{u,b}(q)Pu,b​(q) are integer polynomials attached to pairs u≤bu\le bu≤b of elements of a Coxeter group. They were introduced through the canonical basis of the Hecke algebra (Kazhdan–Lusztig, 1979). For Weyl groups they compute local intersection cohomology of Schubert varieties, and they enter the Kazhdan–Lusztig conjectures on characters…

15 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

Homogeneous depth-five lower bounds for iterated matrix multiplicationResearch Paper

Iterated matrix multiplication asks for the (1,1)(1,1)(1,1) entry of a product of ddd matrices of size w×ww\times ww×w with independent variable entries,

4 thms2 active usersReviewed
🏆Completed
Mathematical LogicTheoretical Computer Science·Captain: wurtle

Generalized Star Height at Most ThreeResearch Paper

A regular expression describes a set of words using letters, union, concatenation and the Kleene star P∗P^*P∗ (any finite repetition of words from PPP). The star height of an expression is the depth of nesting of its stars, and it measures how many layers of unbounded repetition a regular language genuinely needs. For ordinary expressions this hierarchy is…

2 thms2 active usersReviewed
🏆Completed
Algebraic Geometry·Captain: wurtle

An explicit failure of complex affine-space cancellationResearch Paper

Zariski's cancellation problem asks whether affine space can be recognized from its cylinder: if a variety XXX satisfies X×A1≅An+1X\times\mathbb A^1\cong\mathbb A^{n+1}X×A1≅An+1, must X≅AnX\cong\mathbb A^nX≅An? Algebraically, for a finitely generated commutative C\mathbb CC-algebra AAA and an independent variable www,

41 thms2 active usersReviewed
🏆Completed
Numerical Analysis·Captain: LG

Métodos Numéricos (Freitas) II: Zeros de Polinômios e o Algoritmo de HornerTextbook

Polynomial equations are the special case of root finding where algebra says a great deal before analysis is needed: the number of roots is known, the roots of a real polynomial come in conjugate pairs, the rational candidates can be listed, and the whole complex plane can be narrowed down to an annulus that must contain every root. A numerical method that…

8 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Brown-Gabrielse Invariance Theorem for an Imperfect Penning TrapResearch Paper

The most precisely measured property of an elementary particle is the magnetic moment of the electron. The 2022 Northwestern measurement of Fan, Myers, Sukra and Gabrielse (arXiv:2209.13084) reports −μ/μB=g/2=1.001 159 652 180 59 (13)-\mu/\mu_B=g/2=1.001\,159\,652\,180\,59\,(13)−μ/μB​=g/2=1.00115965218059(13), and, combined with the Standard-Model prediction, α−1=137.035 999 166 (15)\alpha^{-1}=137.035\,999\,166\,(15)α−1=137.035999166(15). Those numbers are…

5 thms2 active usersReviewed
PreviousPage 3 of 4Next

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