[Paper Review] Degenerations of Curves in Projective Space and the Maximal Rank Conjecture

Eric Larson|arXiv (Cornell University)|Sep 16, 2018

Algebraic Geometry and Number Theory7 citations

TL;DR

This paper presents a novel degeneration technique to prove the Maximal Rank Conjecture for general Brill–Noether curves in projective space, reducing the problem to verifying systems of linear inequalities with polynomial coefficients. The key contribution is a general method to establish maximal rank of restriction maps via inductive degeneration and convex geometry, culminating in a complete proof of the conjecture for all $ r \geq 3 $.

ABSTRACT

In this note, we give an overview of a new technique for studying Brill--Noether curves in projective space via degeneration. In particular, we give a roadmap to the proof of the Maximal Rank Conjecture.

Motivation & Objective

• To develop a uniform method for constructing degenerations of Brill–Noether curves in projective space to study their geometric properties.
• To overcome three fundamental obstacles in applying degeneration techniques: ad-hoc construction of reducible curves, fiber dimension control, and non-curve components in inductive steps.
• To establish a general inductive framework that reduces maximal rank conditions to solvability of systems of linear inequalities with polynomial coefficients.
• To prove the Maximal Rank Conjecture, which determines the Hilbert function of a general BN-curve in $ \mathbb{P}^r $ for $ r \geq 3 $.

Proposed method

• Construct reducible curves $ C = C' \cup C'' $ by requiring them to pass through a general set of points $ \Gamma $, with $ C' $ transverse to a hypersurface $ S $ and $ C'' \subset S $.
• Use the long exact sequence in cohomology of the ideal sheaf short exact sequence to relate maximal rank of $ C $ to maximal rank of $ C' $ and $ C'' \cup (C' \cap S) $.
• Reduce the existence of such degenerations to the solvability of systems of linear inequalities in integer variables, derived from Brill–Noether conditions.
• Apply convex geometry to verify that a compact convex polyhedron lies within the union of two convex sets by checking vertex and edge conditions.
• Verify positivity of multivariate polynomials in $ r $, $ k $, and $ \binom{r+k}{k} $ using Newton polygon analysis and leading coefficient criteria.
• Use computer-assisted verification and brute-force search for edge cases where the main method fails, particularly near non-integer vertices of polyhedra.

Experimental results

Research questions

• RQ1 Can a uniform construction of reducible curves be developed to enable inductive degeneration arguments for general Brill–Noether curves?
• RQ2 How can fiber dimension and moduli-theoretic control be maintained in degenerations to ensure the curves remain in the expected component of the moduli space?
• RQ3 Can the inductive step be made to work when the intersection $ C'' \cup (C' \cap S) $ is not a curve, but a 0-dimensional scheme?
• RQ4 Is it possible to reduce the maximal rank conjecture to the solvability of systems of linear inequalities with polynomial coefficients in $ r $, $ k $, and binomial coefficients?
• RQ5 Can positivity of multivariate polynomials arising in the inequality systems be verified algorithmically for all $ r \geq 3 $, $ k \geq 2 $?

Key findings

• The Maximal Rank Conjecture is fully proven for all $ r \geq 3 $, confirming that restriction maps $ H^0(\mathcal{O}_{\mathbb{P}^r}(k)) \to H^0(\mathcal{O}_C(k)) $ are of maximal rank for a general Brill–Noether curve $ C \subset \mathbb{P}^r $.
• The proof reduces the maximal rank condition to verifying the existence of integer solutions to systems of linear inequalities derived from Brill–Noether theory and cohomological vanishing.
• The method successfully handles the inductive challenge of non-curve components by using convex geometry to verify that polyhedral regions lie within unions of convex sets.
• For $ r = 17 $, $ k = 4 $, the method fails at a non-integer vertex of the polyhedron, but brute-force search confirms existence of required integer solutions, showing the proof is tight.
• The positivity of multivariate polynomials in $ r $, $ k $, and $ \binom{r+k}{k} $ is verified using Newton polygon analysis and leading coefficient criteria, ensuring correctness across all $ r \geq 3 $, $ k \geq 2 $.
• The proof is algorithmically implementable, with supporting computer code and verification procedures detailed in Appendix E of the referenced work.