🔢 mathematics

Rigidity of multisections to the universal cubic plane curve

This paper resolves a question posed by Farb regarding the continuous selection of $n$ distinct points on smooth cubic plane curves by proving that such a choice is unique up to homotopy for $n=27$ and impossible for $n=36k+18$ .

Original authors: Jinwen Yao (Tsinghua University)

Published 2026-07-17✓ Author reviewed ⓘ

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Jinwen Yao (Tsinghua University)

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 by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are standing in a vast, magical gallery filled with smooth, looping curves drawn on a flat canvas. In the world of mathematics, these are called "cubic curves." They look like fancy, wavy loops, and they have a special property: no matter how you wiggle the curve (as long as it stays smooth and doesn't break), certain special points on it behave in a very predictable way. Some of these points are like "corners" where the curve bends sharply (called inflection points), and others are "sweet spots" with a unique rhythm (called sextatic points).

Mathematicians have long known that every smooth cubic curve has exactly 9 of those "corner" points and 27 of those "sweet spot" points. But here is the big puzzle: If you have a machine that can smoothly morph one cubic curve into another, can you also smoothly pick out a specific number of points on every curve in the gallery at the same time? For instance, can you always pick exactly 27 points that move gracefully as the curve changes? This is the question the paper tackles. It's like asking if you can always find a perfect, unbroken dance routine for a specific number of dancers, no matter how the stage (the curve) changes shape.

The Story of the Point Hunters

This paper is a detective story about finding these special points on moving cubic curves. The authors, led by Jinwen Yao, are trying to solve a riddle posed by a mathematician named Farb: "For which numbers $n$ can we pick $n$ distinct points on every smooth cubic curve in a way that they move continuously?"

Think of the curves as a family of shapeshifting rubber bands. The "points" are stickers you want to place on them. The rule is that as the rubber band stretches and twists, your stickers must slide along the surface without jumping, disappearing, or crashing into each other. If you can do this for a specific number of stickers, say 27, you have found a "multisection."

The paper builds on previous work that had already solved some cases. We knew we could pick 9 points (the corners) and 18 points was impossible. But what about 27? What about 36? What about 54? The authors set out to map out exactly which numbers work and which don't.

The Main Discovery: The Case of 27

The first big victory in the paper is proving that for 27 points, there is only one way to do it. If you want to pick 27 points that move smoothly on every cubic curve, you must be picking the "sextatic points" (the 27 sweet spots mentioned earlier). There are no other hidden tricks or alternative patterns. It's like discovering that if you want to find 27 specific stars in a shifting sky, there is only one constellation that fits the description. The authors proved that any other attempt to pick 27 points would eventually break the rules of smooth movement.

The "No-Go" Zones

The paper also draws a hard line in the sand for certain numbers. It proves that you can never pick 36k + 18 points (where $k$ is any whole number like 0, 1, 2...).

This means you can't pick 18 points (which was already known).
It also means you can't pick 54 points ( $36 \times 1 + 18$ ).
And you can't pick 90 points ( $36 \times 2 + 18$ ).

The authors show that for these specific numbers, the "dance" of the points simply cannot be choreographed without the stickers crashing into each other or vanishing. It's a mathematical impossibility.

The "Indecomposable" Mystery

The authors also looked at "indecomposable" multisections. Imagine a multisection as a bundle of stickers. If you can split that bundle into two smaller, independent bundles that each work on their own, it's "decomposable." An "indecomposable" bundle is one that is stuck together; you can't split it up.

The paper proves that the only indecomposable bundles we know for sure are the ones with 9 points (the inflection points) and 27 points (the sextatic points). If you try to make an indecomposable bundle with any other number of points, the math says the number of points must be divisible by 36. So, if you find a bundle that can't be split and has, say, 45 points, it's a mystery. But if it has 18 points, it's impossible.

The Remaining Mysteries

While the paper solves the case for 27 and rules out the 36k+18 family, it leaves a few doors slightly ajar. The authors admit they don't yet know if indecomposable bundles exist for numbers like 36, 45, or 63. They suspect that if such bundles exist, they are very strange and don't follow the simple patterns of the 9 or 27 point cases. They even propose a specific question: "Does a bundle of exactly 36 points exist that cannot be split?" The paper doesn't answer this yet, but it sets the stage for future detectives to solve it.

How They Did It

To solve these puzzles, the authors used a mix of topology (the study of shapes and spaces) and group theory (the study of symmetry). They imagined the curves as a giant, twisting tunnel. They tracked how the "monodromy group" (a fancy name for the symmetry rules of the tunnel) behaves.

They used a clever trick involving "braids." Imagine the points on the curve as strings. As the curve moves, the strings twist around each other, forming a braid. The authors showed that for certain numbers of points, the only way the strings can twist without tangling into a knot is if they follow the specific patterns of the 9 or 27 point cases. If you try to force a different number, the strings inevitably tangle, proving that such a smooth selection is impossible.

The Bottom Line

This paper is a significant step forward in understanding the geometry of cubic curves. It confirms that the 27-point selection is unique and rules out a whole family of impossible numbers (18, 54, 90, etc.). While it doesn't solve every single number in the infinite list, it clears the path and tells us exactly where the dead ends are, leaving the remaining mysteries for the next generation of mathematicians to explore.

Technical Summary: Rigidity of Multisections to the Universal Cubic Plane Curve

Problem Statement
This paper addresses a question posed by Benson Farb regarding the existence and classification of continuous selections of points on smooth cubic plane curves. Specifically, the authors investigate for which positive integers $n$ it is possible to choose an unordered $n$ -tuple of distinct points continuously on every smooth cubic curve in $\mathbb{CP}^2$ . This problem is framed in terms of the existence of multisections (sections of the unordered configuration space bundle) over the moduli space $X$ of nonsingular cubic curves.

Building upon the foundational work of Chen [4] and Banerjee-Chen [2], which established that any such multisection must have a degree divisible by 9 and classified cases for small degrees, this paper focuses on the rigidity of these multisections. The authors aim to determine the homotopy classes of indecomposable multisections and resolve specific open cases regarding the existence of multisections for degrees $n = 27$ and $n = 36k + 18$ .

Methodology
The paper employs a topological approach, utilizing the concept of "virtual sections" (defined as triples $(\tilde{X}_n, p_n, s_n)$ where $p_n$ is a covering map and $s_n$ is a section map) which are shown to be in bijection with injective multisections. The core methodology involves:

Monodromy Analysis: The authors analyze the monodromy group $\Gamma_n \subset SL_2(\mathbb{Z})$ associated with a connected virtual section. They divide the analysis into two primary cases based on whether the element $-I$ (the negative identity matrix) is contained in $\Gamma_n$ .
Cohomological Obstruction: For the case where $-I \in \Gamma_n$ , the authors utilize the cohomology group $H^1(\Gamma_n; \mathbb{Z}_2)$ to classify the homotopy classes of section maps. They prove that if $-I \in \Gamma_n$ , the virtual section must be homotopic to either the inflection point section ( $\tilde{X}_{flex}$ ) or the sextatic point section ( $\tilde{X}_{sext}$ ).
Braid Group Contradictions: A central technical contribution is the construction of braids in Artin's braid group $Br_m$ (where $m = n/9$ or $n/27$ ) over specific loops in the covering spaces. By constructing loops $\gamma$ such that $\gamma \cdot \gamma$ is null-homotopic but $\gamma$ is not, and analyzing the resulting braid relations (specifically $b(\gamma)^2 = \Delta^2$ ), the authors derive contradictions unless the degree corresponds to the known indecomposable cases. This step relies on the properties of the tangent bundle vector bundles $\xi_{flex}$ and $\xi_{sext}$ .
Euler Class Calculations: To handle non-connected virtual sections, the paper extends the results to show that a virtual section cannot contain more than one component homotopic to $\tilde{X}_{flex}$ or $\tilde{X}_{sext}$ . This is achieved by calculating the Euler classes of the bundles $\xi_{flex}$ and $\xi_{sext}$ , proving they are non-zero, and showing that the existence of multiple such components would imply a vanishing Euler class, leading to a contradiction.
Subgroup Classification: For cases where $-I \notin \Gamma_n$ , the authors use group-theoretic arguments to show that the index of the subgroup must be divisible by 4, implying the degree $n$ must be divisible by 36.

Key Contributions and Results
The paper establishes three main theorems that refine the classification of multisections:

Theorem 1.2 (Rigidity of Degree 27): Every degree 27 multisection is homotopic to the standard sextatic point multisection ( $\sigma_{sext}$ ). This resolves the smallest open case for indecomposable multisections.
Theorem 1.3 (Classification of Indecomposables): Up to homotopy, the only indecomposable multisections are $\sigma_{flex}$ (degree 9) and $\sigma_{sext}$ (degree 27), unless the degree is divisible by 36. This significantly narrows the search space for new indecomposable structures.
Theorem 1.4 (Non-existence for $36k+18$ ): There does not exist any multisection of degree $n = 36k + 18$ for any non-negative integer $k$ . This provides a negative answer to Farb's question for this infinite family of degrees.

Additionally, the paper provides a comprehensive summary of known and unknown cases for virtual sections with degree up to 99. It identifies that the only remaining open cases for Question 1.1 are $n = 108k + 45$ and $n = 108k + 63$ .

Significance
The paper claims significance as a continuation and refinement of the work by Banerjee and Chen [2]. By proving the rigidity of the degree 27 case and establishing the non-existence of multisections for degrees of the form $36k+18$ , the authors eliminate several potential candidates for new multisections. The methodology, particularly the use of braid group relations derived from monodromy loops and the cohomological analysis of section maps, is presented as the most original and creative part of the work.

The authors note that their current methods reach a limit when addressing the existence of indecomposable multisections of degree 36 (Question 1.5), as the cohomology groups become computationally intractable without the condition $-I \in \Gamma_n$ . Consequently, the paper concludes by highlighting the classification of connected virtual sections with $-I \notin \Gamma_n$ as a necessary future direction to fully resolve the open cases.

More like this