🔢 mathematics

Computing Jet Differentials and the Green-Griffiths-Lang Conjecture for Complements of Smooth Plane Curves

This paper presents an effective computational method for constructing negatively twisted invariant logarithmic 2-jet differentials on the complements of smooth plane curves, enabling explicit verification of the Green-Griffiths-Lang Conjecture and the determination of exceptional loci for specific families.

Original authors: Ryan Contreras, Joseph Cummings, Eric Riedl, Jaziel Torres

Published 2026-08-24

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Ryan Contreras, Joseph Cummings, Eric Riedl, Jaziel Torres

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of mathematics, there is a quiet but persistent question about the shape of space and the paths that can travel through it. Imagine a smooth, curved surface floating in a higher-dimensional world. Mathematicians have long been interested in the "entire curves" that can be drawn on such surfaces—paths that start at one point and continue forever without ever stopping, turning back, or hitting a wall. For most shapes, these paths can wander anywhere, exploring every corner. But for a specific, complex class of shapes known as "general type," a famous prediction called the Green-Griffiths-Lang Conjecture suggests something very different. It proposes that these endless paths are not free to roam; instead, they are forced to stay within a smaller, hidden region, like a river confined to a specific valley. If this conjecture is true, it means that even in an infinite world, there are strict boundaries on where a traveler can go.

The focus of this new research is a specific type of shape: the space left over when you remove a smooth, closed loop (a plane curve) from a flat, two-dimensional projective plane. Think of it as a sheet of paper with a single, perfectly smooth circle drawn on it, and then asking what happens to a traveler who is forbidden from stepping on that circle. For decades, mathematicians have tried to prove that for curves of a certain complexity, the traveler is indeed restricted to a small area. The challenge has been that these shapes are incredibly difficult to analyze directly. The tools required to prove the restriction exist, but they are so complex that calculating them by hand for even a single curve is nearly impossible.

A team of researchers has now developed a powerful new method to tackle this problem, turning a theoretical mystery into a concrete calculation. Instead of trying to visualize the entire infinite journey of a curve, they built a specialized machine—a mathematical framework that tracks not just the position of a traveler, but also the direction they are heading and how that direction is changing. They call this a "jet space." By realizing that this complex space can be represented as a specific geometric shape sitting inside a larger, more familiar grid, they were able to translate the problem into a language that computers can understand. They encoded the rules governing these travelers into a structured set of algebraic instructions, essentially creating a digital blueprint that allows them to compute exactly which paths are allowed and which are forbidden.

Using this computational engine, the team tested the conjecture against a wide variety of smooth curves, ranging from simple loops to highly intricate designs. Their results are a mix of definitive answers and new frontiers. For several families of curves, particularly those with a high degree of complexity, the computer confirmed that the conjecture holds true: the endless paths are indeed trapped. In some of these cases, the researchers were able to go a step further and map out the exact "exceptional locus"—the specific, smaller region where these paths are forced to live. They found that for certain curves, this restricted area is simply a collection of straight lines, a surprising and elegant result that reveals the hidden order within the chaos.

However, the story is not entirely solved. The researchers also identified a group of curves where their method could not reach a conclusion. For these specific shapes, the computer found only a single, isolated piece of information that wasn't quite enough to prove the restriction, leaving the question open. This is not a failure of the method, but rather a clear map of where the current knowledge ends. The team also noted that for the famous Fermat curve—a specific, highly symmetric shape—their method was insufficient to prove the conjecture, even though other mathematicians have proven it true using different techniques. This highlights that while their new tool is powerful and efficient for many cases, it is not a universal key for every door.

The significance of this work lies in its ability to move the field from abstract theory to concrete verification. By providing a way to explicitly compute the restrictions on these paths, the researchers have turned a decades-old conjecture into a testable hypothesis for a wide range of shapes. They have shown that for many smooth plane curves, the universe of possible paths is indeed smaller than it appears, and they have provided the first explicit descriptions of where those paths are confined. While the conjecture remains unproven for every possible curve, this new approach offers a clear path forward, allowing mathematicians to systematically check the behavior of these spaces and bringing them closer to a complete understanding of the hidden boundaries that govern the geometry of the complex world.

Technical Summary: Computing Jet Differentials and the Green-Griffiths-Lang Conjecture for Complements of Smooth Plane Curves

Problem Statement
The paper addresses the Green-Griffiths-Lang (GGL) Conjecture in the context of complements of smooth plane curves. The conjecture posits that for a smooth projective variety $X$ and a simple normal crossing divisor $D$ such that $K_X + D$ is big, there exists a proper subvariety $Z \subset X$ containing the image of all nonconstant entire curves $\gamma: \mathbb{C} \to X \setminus D$ . While significant progress has been made for specific cases (e.g., $X=\mathbb{P}^2$ with specific divisors), the conjecture remains open for the general case where $X = \mathbb{P}^2$ and $D = C$ is a smooth plane curve of degree $d$ . The primary challenge lies in effectively computing and analyzing the space of invariant jet differentials, which are the algebraic tools used to restrict these entire curves.

Methodology
The authors develop an effective computational framework to analyze the space of negatively twisted invariant logarithmic 2-jet differentials, specifically sections of the line bundles $\mathcal{O}_{X_2}(\xi_2 + b\xi_1 - aH)$ on the second logarithmic jet space $X_2$ .

Geometric Realization: The authors realize the first logarithmic jet space $X_1 = \mathbb{P}T\mathbb{P}^2(-\log C)$ as a hypersurface in $\mathbb{P}^2 \times \mathbb{P}^2$ . This is achieved by embedding $X_1$ via the equation $g = \sum a_i \frac{\partial f}{\partial x_i} = 0$ , where $f$ defines the curve $C$ and $a_i$ are fiber coordinates.
Module-Theoretic Encoding: By pushing the tautological line bundle $\mathcal{O}_{X_2}(\xi_2)$ down to $X_1$ , the authors encode the global sections of interest into a finitely generated bigraded module $M_V$ over the bihomogeneous coordinate ring of $X_1$ . This module captures the family of sections $H^0(X_2, \mathcal{O}_{X_2}(\xi_2 + b\xi_1 - aH))$ for all $a, b > 0$ .
Algorithmic Computation: The paper provides an explicit algorithm (implemented in Macaulay2) to compute a minimal set of homogeneous generators for $M_V$ . This allows for the explicit determination of the vanishing loci of these jet differentials.
Theoretical Criteria: The authors adapt results from El Goul and Demailly to establish a criterion where the existence of specific sections in $M_V$ implies the GGL conjecture. The criterion relies on the dimension of the stable base locus of these sections.

Key Contributions

Explicit Computation of Jet Differentials: The paper provides the first effective method to compute the specific family of 2-jet differentials $\mathcal{O}_{X_2}(\xi_2 + b\xi_1 - aH)$ for arbitrary smooth plane curves, translating the geometric problem into a computable algebraic module problem.
Verification Criteria: The authors establish three computational criteria (Theorem 1.1) to verify the GGL conjecture for $\mathbb{P}^2 \setminus C$ $P^{2} ∖ C$ :
- (I) If $d \ge 15$ and no such sections exist.
- (II) If $d \ge 11$ and a single section exists with an irreducible vanishing locus satisfying a specific numerical inequality involving $d, a,$ and $b$ .
- (III) If $d \ge 4$ and at least two sections exist whose common vanishing locus has codimension 2.
Explicit Exceptional Loci: For cases satisfying criterion (III), the authors do not merely prove the existence of the exceptional locus but explicitly characterize it. They describe the leaves of the associated multifoliation on $\mathbb{P}^2$ , identifying the specific lines or curves that constitute the exceptional set.

Results
The authors apply their computational test to various families of smooth plane curves, yielding three distinct outcomes:

Verification via Vanishing: For several curves of degree $d \ge 15$ (e.g., specific perturbations of Fermat curves), the module $M_V$ has no generators in the relevant degrees. This implies the absence of the required jet differentials, and by Theorem 1.1(I), the complement satisfies the GGL conjecture.
Verification via Single Section: For other curves (e.g., $x_{13}^0 + x_0^6 x_1^7 + \dots$ ), a single generator exists satisfying the numerical inequality. This confirms the GGL conjecture for these cases, though the exceptional locus is not explicitly described.
Explicit Exceptional Loci: For a series of curves defined by polynomials of the form $x_0^{2n} + x_0^n x_1^n + x_1^{2n} + \dots$ , the module $M_V$ possesses at least two independent low-degree generators. The authors explicitly compute the common vanishing locus, determining that the exceptional locus consists of a union of specific lines (e.g., $\lambda x_0 - x_1 = 0$ where $\lambda$ satisfies a specific polynomial equation).
Inconclusive Cases: The paper identifies several families of curves (including the Fermat curve $x_0^d + x_1^d + x_2^d$ for $7 \le d \le 20$ ) where the test yields exactly one generator that fails the numerical inequality. For these cases, the method is inconclusive, though the authors note that the GGL conjecture is known to hold for Fermat curves via other methods (Tod71).

Significance
The paper claims significance primarily through the development of a practical, computational framework that moves beyond existence proofs to explicit calculations. By embedding the jet space into $\mathbb{P}^2 \times \mathbb{P}^2$ and utilizing bigraded modules, the authors make the geometry of jet differentials accessible to direct algebraic computation. This allows for the verification of the GGL conjecture for specific, non-generic families of curves and, crucially, the explicit determination of the exceptional locus in cases where multiple independent jet differentials are found. The authors state that their tools are intended to be useful for testing the conjecture on other curves and hope this framework contributes to a broader understanding of the GGL conjecture for complements of smooth plane curves of large degree. The work distinguishes itself from recent computer-assisted methods (e.g., Hou et al.) by focusing on the specific twisted bundles $\mathcal{O}_{X_2}(\xi_2 + b\xi_1 - aH)$ and providing a global representation of sections as bihomogeneous polynomials, facilitating the analysis of zero loci.

More like this