Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Algebraic Geometry

74 missions · 29 completed

Missions

Open45Completed29All74
Captain: benediamond

hodge.computer: Cyclic coupling · pole order twoOpen Problem

The hodge.computer project studies a case of the generalized Hodge conjecture for sextic fourfolds with an involution, posed by Voisin. Diamond's reduction turns this Hodge-theoretic prediction into the explicit rational-vector-field problem below; it is the basis of the certificate formalism used in these missions.

5 thms2 active usersReviewed
Group Theory·Captain: iris

Anti-affine algebraic groups: Classification over an abelian variety by Galois-stable sublattices of A∨(ks)A^\vee(k_s)A∨(ks​) and subspaces of H1(A,OA)H^1(A, \mathcal{O}_A)H1(A,OA​)Research Paper

Group schemes of finite type over a field split into two complementary kinds. Affine group schemes are the linear groups, and their theory is extensive. Anti-affine groups are the group schemes GGG with O(G)=k\mathcal O(G)=kO(G)=k: every regular function is constant. Any connected group scheme GGG has a smallest normal subgroup scheme GantG_{\mathrm{ant}}Gant​ with affine quotient,…

22 thms2 active usersReviewed
AlgebraGroup Theory·Captain: mikedeng1

Observable actions of algebraic groups: a reductive action is observable iff some closed orbit has maximal dimension, and the socle is the largest observable closed subsetResearch Paper

An action of an affine algebraic group GGG on an affine variety XXX is observable when invariant regular functions see every nonzero GGG-stable ideal of the coordinate ring: if I⊆k[X]I\subseteq k[X]I⊆k[X] is a nonzero GGG-stable ideal, then IG≠(0)I^G\neq(0)IG=(0). The notion goes back to Grosshans' theory of observable subgroups (F. D. Grosshans, Observable groups and Hilbert's fourteenth…

10 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Nash Equilibrium Problems of Polynomials: For Generic Polynomial Data the KKT-Cut Algorithm Terminates Finitely, Finding a Nash Equilibrium or Certifying That None ExistsResearch Paper

A Nash equilibrium problem (NEP) asks for strategies of several players such that no player can lower its own cost by deviating while the others keep theirs fixed. NEPs model competition in electricity markets, environmental agreements, and the training of generative adversarial networks. When the players' problems are nonconvex, an equilibrium requires…

13 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization: The Set of Transition Points of the Optimal Partition Is FiniteResearch Paper

Sensitivity analysis asks how the solution of an optimization problem changes when its data move. For linear optimization the answer has been known since the 1990s: as the objective is perturbed along a fixed direction, the optimal partition (which variables can be positive at an optimum and which slacks can) stays constant on open intervals and changes…

11 thms2 active usersReviewed
CombinatoricsDiscrete Geometry·Captain: mikedeng1

On the Number of Incidences Between Points and Planes in Three Dimensions: m Points and n ≤ m Planes in P³ (char ≠ 2, n = O(p²)) Have O(m√n + km) Incidences, k the Maximum Number of Collinear PlanesResearch Paper

Incidence bounds count how often points can lie on lines, planes or other simple objects. Over the reals the model result is the Szemerédi–Trotter theorem for points and lines in the plane (Szemerédi–Trotter 1983). Its proofs use the order or topology of R\mathbb RR (cuttings, crossing numbers, polynomial partitioning), so they say nothing over finite fields…

12 thms2 active usersReviewed
AnalysisOptimization·Captain: mikedeng1

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization 1: A G-Linear Functional Is Integration Against a G-Invariant Measure on K iff Its Symmetrized Localizing Forms Are PSDResearch Paper

Polynomial optimization asks for the minimum f∗f^*f∗ of a polynomial fff over a set K⊆RnK\subseteq\mathbb R^nK⊆Rn cut out by polynomial inequalities. Lasserre's moment relaxation (Lasserre 2001) replaces the minimization over points by a minimization over probability measures on KKK, and then over linear functionals on polynomials that satisfy semidefinite constraints. The…

7 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Optimality Conditions and Finite Convergence of Lasserre's Hierarchy II: Off a Proper Zariski-Closed Set of Input Data, the Classical Optimality Conditions Hold at Every Local MinimizerResearch Paper

Lasserre's hierarchy is a sequence of semidefinite relaxations for minimizing a polynomial over a set defined by polynomial equations and inequalities (Lasserre 2001). Under the archimedean condition its optimal values converge to the true minimum, but only asymptotically in general; in practice the hierarchy is often exact at a small relaxation order. J.…

15 thms2 active usersReviewed
AlgebraConvex 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
Dynamical Systems·Captain: LG

Albouy–Kaloshin: Finiteness of Planar Five-Body Central ConfigurationsResearch Paper

A central configuration of the Newtonian nnn-body problem is a placement of nnn point masses in which the gravitational acceleration of every body points toward the centre of mass and is proportional to its distance from it. Central configurations generate the only explicitly known solutions of the nnn-body problem (the homographic, or self-similar, motions),…

10 thms2 active usersReviewed
AlgebraNumber 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
Computational ComplexityNumber Theory·Captain: Shuze Chen

Deterministic Root-Finding over Finite Fields with Elliptic CurvesResearch Paper

Let Fq\mathbb F_qFq​ be a finite field with q=peq = p^eq=pe elements. Root-finding asks, given a polynomial f∈Fq[X]f \in \mathbb F_q[X]f∈Fq​[X] that is split (a product of linear factors) and separable (coprime with its derivative), for the set of its roots in Fq\mathbb F_qFq​. Factoring arbitrary polynomials over Fq\mathbb F_qFq​ reduces to this problem in deterministic polynomial time (Berleka…

12 thms1 active userReviewed
AlgebraComplexity 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
AlgebraComplexity 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
OptimizationRepresentation Theory·Captain: mikedeng1

A Convex Form That Is Not a Sum of Squares: For k ≥ 17 the Octonionic Cauchy–Schwarz Form Plus (1/4)(‖x‖² + ‖y‖²)² Is a Convex Quartic in 16k Variables That Is Not a Sum of SquaresResearch Paper

A convex form is a homogeneous polynomial of even degree whose value is convex as a function of its real variables. Every convex form is nonnegative, so it is natural to ask whether it can always be written as a sum of squares (SOS) of real polynomials. This matters in polynomial optimization because an SOS certificate can be searched for through…

11 thms1 active userReviewed
Optimization·Captain: mikedeng1

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions: The Sign-Symmetry-Adapted Block-Diagonal SOS Hierarchy Converges Monotonically to the Global MinimumResearch Paper

A sum of rational functions is a common objective when several performance measures each have a polynomial numerator and a positive polynomial denominator. Such problems appear, for example, in the applications to computer vision and signal processing cited by Guo, Wang and Zheng in their 2024 preprint. Even when all constraints and numerators are…

13 thms1 active userReviewed
AlgebraOptimization·Captain: mikedeng1

A Sparse Version of Reznick’s Positivstellensatz: Under the Running Intersection Property, a Sparse Positive Definite Form Is a Sum of Sparse SOS Fractions with Uniform DenominatorsResearch Paper

A polynomial that is positive away from the origin can be certified by writing it as a sum of squares after multiplication by a suitable power of the squared Euclidean norm. This is the uniform denominator theorem of Reznick (1995). In polynomial optimization, the size of a sum of squares certificate is governed by the number of variables in each square. A…

10 thms1 active userReviewed
Optimization·Captain: mikedeng1

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization 2: A Symmetric Quartic Is Nonnegative iff Each Restriction f^ω to a 2-Partition ω Is a Sum of SquaresResearch Paper

Deciding whether a real polynomial is non-negative on Rn\mathbb R^nRn is NP-hard already for quartics, and the standard computational substitute is to ask whether it is a sum of squares (SOS) of polynomials, which is a semidefinite feasibility problem. The two notions agree only in three cases, determined by Hilbert in 1888: univariate polynomials, quadratic…

7 thms1 active userReviewed
AnalysisPure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables X: Hypervarieties and Their Singular SetsTextbook

Zero sets of holomorphic functions are the basic objects of local complex-analytic geometry. In one variable they are discrete, and nothing more needs to be said; in two or more variables the zero set of a single function is a surface, a curve or a higher-dimensional object that can have singular points, such as the cusp {z13=z22}\{z_1^3 = z_2^2\}{z13​=z22​} or the crossing…

19 thms1 active userReviewed
AlgebraAnalysisPure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables IX: Weierstrass Preparation and the Ring of GermsTextbook

Local complex analytic geometry studies zero sets of holomorphic functions near a point. The natural algebraic object for this is the ring of germs Op\mathcal{O}_pOp​ of holomorphic functions at p∈Cnp \in \mathbb{C}^np∈Cn: two functions are identified if they agree near ppp. The ring Op\mathcal{O}_pOp​ is the local ring of the complex manifold Cn\mathbb{C}^nCn at ppp in the sense of…

10 thms1 active userReviewed
PreviousPage 2 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