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
Complexity TheoryTheoretical Computer Science·Captain: mikedeng1

Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting HierarchyResearch Paper

Polynomial maps describe families of algebraic objects through their parameters. Exact image membership asks whether some parameter choice produces a specified object. Membership in the image's closure also permits objects obtained only as limits. This distinction occurs in tensor border rank and in closures of group orbits, applications stated in Corollary…

76 thms5 active usersReviewed
Number Theory·Captain: LG

Weil Conjectures (Wikipedia): Rationality, Functional Equation and Riemann Hypothesis over Finite FieldsTextbook

Counting solutions of polynomial equations over finite fields is one of the oldest themes of number theory, going back to Gauss's count of points on x3+1=y3x^3 + 1 = y^3x3+1=y3 modulo a prime. In 1949 André Weil proposed a precise description of how these counts behave when the field is enlarged: for a smooth projective variety over Fq\mathbb F_qFq​, the generating function…

46 thms4 active usersReviewed
AlgebraComplexity Theory·Captain: mikedeng1

Approximate Polynomial Satisfiability is in the Counting HierarchyResearch Paper

An exact polynomial system asks for values making every output zero. Problems in algebraic complexity also ask whether zero can be approached by outputs of a polynomial map, even when no input gives zero exactly. Approximate polynomial satisfiability, abbreviated APS, expresses this second question using algebraic closure rather than numerical tolerances.…

26 thms3 active usersReviewed
CombinatoricsInformation TheoryNumber Theory+1·Captain: iris

Beating the Gilbert–Varshamov Bound at Alphabet Size 42Research Paper

A code C⊆ΣnC\subseteq\Sigma^nC⊆Σn is a set of words of length nnn over a finite alphabet Σ\SigmaΣ of size qqq. Its rate log⁡q∣C∣/n\log_q|C|/nlogq​∣C∣/n measures information per symbol, and its relative minimum distance δ\deltaδ is the smallest fraction of coordinates on which two distinct codewords differ. The tradeoff between rate and distance is the oldest question of coding theory (Shannon…

38 thms3 active usersReviewed
Captain: benediamond

hodge.computer: Four plus two · suspension remainderOpen 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.

7 thms3 active usersReviewed
AlgebraOptimization·Captain: iris

Sums of Separable and Quadratic Polynomials: Nonnegative SPQ Polynomials in n Variables of Degree d Are All Sums of Squares iff n = 1, d = 2, or (n, d) = (2, 4)Research Paper

Deciding whether a real polynomial is nonnegative on Rn\mathbb R^nRn is NP-hard already in degree 444, while deciding whether it is a sum of squares (sos) is a semidefinite program (Theorem 1.2 of the paper, after Choi–Lam–Reznick and Parrilo). Every sos polynomial is nonnegative, so sos relaxations are the standard tool of polynomial optimization, and their…

26 thms3 active usersReviewed
Number Theory·Captain: LG

Lam–Litt conjecture: algebraicity and integrality of solutions to algebraic ODEsOpen Problem

A classical way to recognize an algebraic function is through the arithmetic of its Taylor coefficients. Eisenstein's theorem (1852) says that if a power series f∈Q[[z]]f\in\mathbb{Q}[[z]]f∈Q[[z]] is algebraic over Q[z]\mathbb{Q}[z]Q[z], only finitely many primes occur in the denominators of its coefficients. The converse fails in general: many transcendental power series have…

6 thms3 active usersReviewed
Geometry & Topology·Captain: LG

Algebraicity of Weil classes on abelian sixfolds of discriminant -1Research Paper

The Hodge conjecture predicts that on a non-singular complex projective variety XXX every rational cohomology class of type (p,p)(p,p)(p,p) is a rational linear combination of the classes of algebraic subvarieties of XXX. Abelian varieties are the oldest testing ground for the conjecture, and the hardest known classes on them were isolated by A. Weil. A 2n2n2n-dimensional…

7 thms3 active usersReviewed
Complexity TheoryComputational Complexity·Captain: iris

Some algebraic and geometric computations in CH via Chow formsResearch Paper

Decomposing an algebraic variety into equidimensional components is a basic task of computer algebra: most algorithms for irreducible decomposition first split a variety by dimension and then factor each piece. Andrews, Garg, Oliveira and Schost (arXiv:2611.05289) place several problems about equidimensional components in the counting hierarchy CH, where…

38 thms2 active usersReviewed
AlgebraComputational ComplexityInformation Theory·Captain: Shuze Chen

Quasilinear Encoding at the Quadratic Alphabet Scale via Short Cartier BasesResearch Paper

A linear code over a finite field FQ\mathbb F_QFQ​ encodes KKK message symbols as NNN codeword symbols; its minimum distance ddd guarantees recovery from ttt errors and eee erasures whenever 2t+e<d2t+e<d2t+e<d. The Singleton bound gives d≤N−K+1d\le N-K+1d≤N−K+1. For a target gap 0<ε<10<\varepsilon<10<ε<1 one asks for codes with

19 thms2 active usersReviewed
Complexity TheoryInformation Theory·Captain: iris

On Proximity Gaps for One-Point Algebraic Geometric CodesResearch Paper

Succinct proof systems of the FRI, STIR and WHIR family test whether a committed word lies close to a code. To test many words at once, they combine them with a random challenge: words u0,…,uℓu_0,\dots,u_\ellu0​,…,uℓ​ are replaced by the single word r(z)=∑j=0ℓujzjr(z)=\sum_{j=0}^{\ell}u_jz^jr(z)=∑j=0ℓ​uj​zj for a random zzz. Correlated agreement (CA) is the property that makes this batching sound. If…

36 thms2 active usersReviewed
Captain: benediamond

hodge.computer: Eight planes · contact arrangementOpen 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.

6 thms2 active usersReviewed
Captain: benediamond

hodge.computer: Quadratic pullback · residual densityOpen 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
Captain: benediamond

hodge.computer: Eight powers · linear-section remainderOpen 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
Captain: benediamond

hodge.computer: Reflection · complementary characterOpen 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
Captain: benediamond

hodge.computer: One reflection · skew couplingOpen 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
Captain: benediamond

hodge.computer: Quadric contact · residual sectorOpen 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
Captain: benediamond

hodge.computer: Cyclic triple cover · complementary characterOpen 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
Captain: benediamond

hodge.computer: Simultaneous permutations · standard sectorOpen 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
Captain: benediamond

hodge.computer: Broken paired signsOpen 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
Captain: benediamond

hodge.computer: Dense rational · full coefficient supportOpen 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
Captain: benediamond

hodge.computer: Polarized split · K3 remainderOpen 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
Captain: benediamond

hodge.computer: Coupled Klein · nontrivial characterOpen 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
Captain: benediamond

hodge.computer: Permutation symmetry · residual sectorOpen 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
Captain: benediamond

hodge.computer: Rank-one coupling · biquartic pencilOpen 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
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