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
CombinatoricsRepresentation Theory·Captain: mikedeng1

On the Blocks of the Walled Brauer Algebra: In Characteristic Zero, Two Simple Modules Lie in the Same Block Exactly When Their Weights Lie in One Orbit of the ρ(δ)-Shifted Dot Action of Σ_{r+s}Research Paper

Let VVV be the natural representation of GLnGL_nGLn​ and V∗V^*V∗ its dual. The walled Brauer algebra Br,s(δ)B_{r,s}(\delta)Br,s​(δ) describes the endomorphisms of mixed tensor space V⊗r⊗V∗⊗sV^{\otimes r}\otimes V^{*\otimes s}V⊗r⊗V∗⊗s that commute with GLnGL_nGLn​, through mixed Schur–Weyl duality. It was introduced in this role independently by Turaev, Koike and…

17 thms2 active usersReviewed
CombinatoricsDiscrete GeometryInformation Theory·Captain: mikedeng1

A Large Family of Maximum Scattered Linear Sets of PG(1, q^n) and Their Associated MRD Codes 2: For Odd q = p^r and t > 4, a Lower Bound on the Number of PΓL-Classes of the Linear Sets L_{h,t}Research Paper

A linear set of the projective line PG(1,qn)\mathrm{PG}(1, q^n)PG(1,qn) is the set of points ⟨u⟩Fqn\langle u\rangle_{\mathbb F_{q^n}}⟨u⟩Fqn​​ spanned by the nonzero vectors uuu of an Fq\mathbb F_qFq​-subspace U⊆Fqn2U \subseteq \mathbb F_{q^n}^2U⊆Fqn2​. The extremal ones, the maximum scattered linear sets, are given by scattered polynomials fff over Fqn\mathbb F_{q^n}Fqn​, and each such fff also gives an …

13 thms2 active usersReviewed
CombinatoricsDiscrete GeometryLinear algebra·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 5: For h ≥ 2, Two h-Scattered Linear Sets Are PΓL(r, qⁿ)-Equivalent iff Their Subspaces Are ΓL(r, qⁿ)-EquivalentResearch Paper

Linear sets are point sets of a finite projective space defined by a subspace over a subfield. They appear throughout finite geometry, for instance in the study of semifields and, through the correspondence studied by Sheekey and Van de Voorde (arXiv:1806.05929), maximum rank distance (MRD) codes; see Polverino's survey (doi:10.1016/j.disc.2009.04.007). In…

9 thms2 active usersReviewed
CombinatoricsDiscrete Geometry·Captain: mikedeng1

Maximum Scattered Linear Sets and Complete Caps in Galois Spaces 2: For q = 2^t, t Even, and n ≥ 4 Even, AG(n, q) Has a Complete Cap of Size 2√(q^(n−1))Research Paper

A cap in an affine or projective space over a finite field is a set of points no three of which are collinear; a cap is complete when it is maximal with respect to inclusion, so that every point outside it lies on a line through two of its points. Caps are closely connected with error-correcting codes: projective caps can serve as parity-check columns for…

14 thms2 active usersReviewed
CombinatoricsDiscrete GeometryLinear algebra·Captain: mikedeng1

Maximum Scattered Linear Sets and Complete Caps in Galois Spaces 1: Scattered 𝔽_q-Linear Sets of Rank rt/2 Exist in PG(r − 1, q^t) for t Even, in Three Families of (q, t)Research Paper

Linear sets are the main tool for building point sets with few intersection sizes in finite projective spaces: sets meeting every hyperplane, two-intersection sets, translation ovoids, and the geometric side of finite semifields and rank-metric codes (Polverino, 2010). Among them, scattered linear sets are those whose points all carry the smallest possible…

15 thms2 active usersReviewed
Algebraic GeometryConvex OptimizationOptimization·Captain: mikedeng1

Semidefinite Programming Relaxations for Semialgebraic Problems 1: A Polynomial System Has No Real Solution if and only if Its Degree-d Positivstellensatz SDP Is Feasible for All Large dResearch Paper

Deciding whether a system of real polynomial equations, inequations and inequalities has a solution is the basic feasibility question behind nonconvex quadratic programming, polynomial optimization, robustness analysis in control, and combinatorial relaxations. Over the complex numbers, Hilbert's Nullstellensatz turns infeasibility into an algebraic…

13 thms2 active usersReviewed
Analysis·Captain: LG

Smale's Mean Value ConjectureOpen Problem

The mean value problem, also called Smale's mean value conjecture, was posed by Stephen Smale in 1981 in his study of the complexity of root-finding algorithms for polynomials (Smale 1981). For a real differentiable function the mean value theorem produces, between two points, a point where the derivative equals a difference quotient. For a complex…

10 thms2 active usersReviewed
Algebraic GeometryNumber Theory·Captain: vatsj

Milnor conjecture (Voevodsky 2003), formalizedResearch Paper

For a field FFF, two invariants built from very different data turn out to carry the same mod-2 information. One is Milnor K-theory KnM(F)K^M_n(F)KnM​(F), defined by generators and relations from the multiplicative group F×F^\timesF× alone. The other is Galois cohomology Hn(F,Z/2)H^n(F,\mathbb{Z}/2)Hn(F,Z/2), the continuous cohomology of the absolute Galois group of FFF. In 1970 Milnor…

14 thms2 active usersReviewed
Number Theory·Captain: LG

Schanuel's ConjectureOpen Problem

Almost every classical transcendence theorem is a statement about the interaction between the additive structure of C\mathbb{C}C and the exponential function. Hermite proved in 1873 that eee is transcendental, Lindemann in 1882 that eαe^{\alpha}eα is transcendental for every nonzero algebraic α\alphaα — hence that π\piπ is transcendental and the circle cannot be…

39 thms2 active usersReviewed
AnalysisComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Multiplying matrices via polynomials: operational asymptotic spectrum barrierResearch Paper

The exponent of matrix multiplication ωF\omega_{\mathbb F}ωF​ is the least τ\tauτ such that n×nn\times nn×n matrices over a field F\mathbb FF can be multiplied with O(nτ+o(1))O(n^{\tau+o(1)})O(nτ+o(1)) arithmetic operations; equivalently, it measures the growth of the tensor rank of the matrix multiplication tensor ⟨n,n,n⟩\langle n,n,n\rangle⟨n,n,n⟩. In October 2026 OpenAI announced a proof that …

15 thms1 active userReviewed
Computational ComplexityTheoretical Computer Science·Captain: iris

Demystifying Border of Structured Algebraic Circuits via Differential EquationsResearch Paper

Algebraic complexity theory asks how many additions and multiplications are needed to compute a polynomial. Next to exact computation it studies approximate computation: a polynomial fff is in the border of a class of circuits if circuits from the class, with constants depending on a parameter ε\varepsilonε, compute f+εgf+\varepsilon gf+εg, so that fff is their limit as …

36 thms1 active userReviewed
CombinatoricsComplexity TheoryTheoretical Computer Science·Captain: iris

Private PCPs from Product ExpansionResearch Paper

The PCP theorem says that the witness of an NP problem can be written as a proof that a verifier checks by reading a few random positions. Its quantum analogue for QMA is open. A main obstacle is local indistinguishability: a witness stored in a quantum code of distance ddd cannot be read from any d−1d-1d−1 positions, so local tests cannot tell a YES witness from a…

36 thms1 active userReviewed
Complexity TheoryComputational Complexity·Captain: mikedeng1

Factor Closure in Noncommutative Algebraic ComplexityResearch Paper

A basic structural question in algebraic complexity is whether factors of a polynomial with a small circuit also have small circuits. In the commutative setting small-circuit bounds for factors were established by Kaltofen ([10]), closure of commutative VNP in characteristic zero and sufficiently large characteristic was proved by Chou, Kumar and Solomon…

19 thms1 active userReviewed
Complexity Theory·Captain: mikedeng1

Almost-Linear Modular Composition over Arbitrary Commutative RingsResearch Paper

Polynomial algorithms often need to substitute one polynomial into another while retaining only its remainder modulo a third polynomial. This operation is called modular composition. It describes evaluation in a polynomial quotient algebra, so it appears whenever an algebraic element is represented by a polynomial relation. Over finite fields it occurs in…

16 thms1 active userReviewed
Complexity TheoryLinear algebra·Captain: mikedeng1

Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed CyclesResearch Paper

A permutation monomial of a square matrix chooses one entry from each row and each column. The determinant adds these monomials with signs recording permutation parity. In a field of characteristic two, adding an element to itself gives zero, so minus one equals one. The determinant therefore gives the sum of all permutation monomials, but its signs no…

30 thms1 active userReviewed
Algebraic GeometryComplexity TheoryInformation Theory+1·Captain: iris

Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed–Solomon CodesResearch Paper

A Reed–Solomon code of rate R=k/nR=k/nR=k/n consists of the evaluation vectors of polynomials of degree below kkk at nnn distinct points of a finite field Fq\mathbb F_qFq​ [RS60]. List decoding asks for every codeword within a given relative Hamming distance ρ\rhoρ of a received word. Information-theoretically, a code of rate RRR over a large alphabet can be list decoded up to…

26 thms1 active userReviewed
Linear algebraTheoretical Computer Science·Captain: iris

Subquadratic Time Matrix Multiplication Data Structures Beyond the Dual Exponent, with ApplicationsResearch Paper

The matrix multiplication data structure problem asks to preprocess an N×DN\times DN×D matrix AAA and a D×ND\times ND×N matrix BBB so that any entry of ABABAB can be returned quickly. Computing the product outright takes about N2N^2N2 time at best, and reading one entry from scratch takes 2D2D2D reads of the input. A solution is nontrivial if its preprocessing takes …

47 thms1 active userReviewed
Group TheoryTheoretical Computer Science·Captain: iris

Copyless Cost Register Automata and Algebraic Groups: An Exact Characterization for Invertible Weighted AutomataResearch Paper

A finite automaton reads its input once, left to right, with constant memory. Adding finitely many registers that hold rational numbers and are updated at each step by expressions in their old values gives the cost register automata (CRA) of Alur, D'Antoni, Deshmukh, Raghothaman and Yuan (ADD+13). With linear updates over a field, CRA are exactly weighted…

29 thms1 active userReviewed
Number TheoryTheoretical Computer Science·Captain: iris

Rational and Gaussian long integer multiplicationResearch Paper

Toom–Cook-kkk multiplication splits each of two long integers into kkk pieces, reads the pieces as the coefficients of two polynomials of degree k−1k-1k−1, evaluates both polynomials at 2k−12k-12k−1 points, multiplies the values pointwise, and recovers the 2k−12k-12k−1 coefficients of the product polynomial by interpolation. The scheme underlies the mid-range multiplication routines…

19 thms1 active userReviewed
Linear algebraTheoretical Computer Science·Captain: iris

Burnside Problems for Matrix Semigroup Quotients with Applications to Border ComplexityResearch Paper

In 1902 Burnside asked whether a finitely generated group in which every element has finite order must be finite. The answer is negative in general (Novikov and Adian, 1968), but positive for groups of complex invertible matrices (Schur), for invertible matrices over any field (Kaplansky), and for finitely generated matrix semigroups over any field…

23 thms1 active userReviewed
Algebraic GeometryComplexity TheoryTheoretical Computer Science·Captain: iris

An Exponential Top Fan-In Hierarchy for Border Depth-4 CircuitsResearch Paper

A central question about constant-depth algebraic circuits is what one additional summand at the output gate buys. Deterministic identity testing for depth-3 circuits of top fan-in kkk runs in time polynomial in the size with an exponent that grows with kkk (Kayal and Saxena, 2007), so it is natural to ask whether the power of these circuits grows with kkk.…

41 thms1 active userReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

On the Cost of Set-Multilinearisation in Positive CharacteristicResearch Paper

An algebraic circuit computes a polynomial from variables and constants with additions and multiplications. Proving superpolynomial lower bounds against arbitrary circuits is the algebraic version of the central question of complexity theory, and depth reduction makes low-depth circuits a meaningful target: a strong enough bound for depth four would…

32 thms1 active userReviewed
Representation Theory·Captain: iris

Non-abelian extensions of topological Lie algebras: classification by factor systems mod C1(g,n)C^1(\mathfrak g,\mathfrak n)C1(g,n); Ext[S]\mathrm{Ext}_{[S]}Ext[S]​ affine over H2(g,z(n))SH^2(\mathfrak g,\mathfrak z(\mathfrak n))_SH2(g,z(n))S​Research Paper

An extension of a Lie algebra g\mathfrak gg by a Lie algebra n\mathfrak nn is a Lie algebra g^\widehat{\mathfrak g}g​ containing n\mathfrak nn as an ideal with quotient g^/n≅g\widehat{\mathfrak g}/\mathfrak n\cong\mathfrak gg​/n≅g. Extensions are how larger Lie algebras are assembled from smaller ones: central extensions produce the Virasoro and affine Kac–Moody algebras from…

17 thms1 active userReviewed
Representation Theory·Captain: mikedeng1

Gradings on Walled Brauer Algebras and Khovanov's Arc Algebra: Mixed Schur–Weyl Duality for gl(m|n) — B_{r,s}(m−n) Maps onto End_g(V^{⊗r}⊗W^{⊗s}), Injectively iff r+s < (m+1)(n+1)Research Paper

Schur–Weyl duality says that on the tensor power V⊗NV^{\otimes N}V⊗N of the natural representation of glm(C)\mathfrak{gl}_m(\mathbb C)glm​(C), the symmetric group ΣN\Sigma_NΣN​ acting by place permutations generates the full commutant of glm\mathfrak{gl}_mglm​. It is the bridge between representations of general linear groups and of symmetric groups. Two extensions matter in…

12 thms1 active userReviewed
CombinatoricsRepresentation Theory·Captain: mikedeng1

Rational Semistandard Tableaux and Character Formula for the Lie Superalgebra ĝl∞|∞: A Jacobi–Trudi Determinant Formula for the Characters of A/B-Semistandard TableauxResearch Paper

The Lie superalgebra gl^∞∣∞\widehat{\mathfrak{gl}}_{\infty|\infty}gl​∞∣∞​, a central extension of the Lie superalgebra of infinite matrices of finite support, appears in the representation theory of the W1+∞W_{1+\infty}W1+∞​ vertex algebra and in Howe-type dualities with gln\mathfrak{gl}_ngln​ (Kac–Radul; Cheng–Lam). Its irreducible quasi-finite highest weight modules of positive…

12 thms1 active userReviewed
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