🔢 mathematics

Bounding Pinch Point Schemes of Projected Surfaces

This paper establishes a lower bound for the length of the pinch scheme of a general linear projection of a finitely ramified surface in $\mathbb{P}^N$ ( $N \geq 4$ ) to $\mathbb{P}^3$ , proving that this bound is achieved if and only if the surface is a rational normal scroll.

Original authors: Adam Cartisano, Anand Patel

Published 2026-08-05

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Adam Cartisano, Anand Patel

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

Imagine you are an artist trying to paint a 3D object, like a sculpture, onto a flat 2D canvas. If you just squint and look at it from one angle, some parts might overlap, creating messy blurs or strange kinks where the surface folds over itself. In the world of mathematics, specifically a field called algebraic geometry, scientists study shapes that exist in many dimensions—far more than the three we can see. They often ask: "If we take a smooth, perfect shape living in a high-dimensional space and project it down into our familiar 3D world, what kind of 'mess' or 'kinks' will appear?"

These kinks are called singularities. Think of them as the mathematical equivalent of a wrinkle in a sheet of paper or a pinch in a balloon. Mathematicians have known for a long time that when you project a smooth surface from a high dimension down to 3D, you generally get three types of wrinkles: a line where the surface crosses itself, a few spots where three layers meet, and a special kind of pinch point. The big question this paper tackles is: "How many of these pinch points must appear?" It turns out the answer depends on how high up in the dimensional ladder the shape started. If you start in a space with $N$ dimensions, there is a hard, mathematical floor below which the number of pinch points cannot fall.

The Great Pinch-Point Hunt

In this paper, Adam Cartisano and Anand Patel act like cosmic detectives, hunting for the minimum number of "pinch points" that must exist when a smooth surface is squashed down from a high-dimensional world into our 3D space. They aren't just guessing; they are proving a strict rule.

Imagine you have a smooth, perfect sheet of fabric floating in a giant, invisible room with $N$ dimensions (where $N$ is at least 4). Now, you shine a light through it to cast a shadow onto a 3D wall. Because the room is so big, the fabric has to twist and turn to fit into the shadow. Where it twists the most, it creates a "pinch point"—a spot where the surface looks like the tip of a cone or a sharp fold.

The authors prove a very specific rule: No matter how you arrange your smooth surface, if it starts in $N$ dimensions, the resulting shadow in 3D will have at least $2N - 6$ pinch points.

For example:

If your shape starts in 4 dimensions, it must have at least 2 pinch points ( $2 \times 4 - 6 = 2$ ).
If it starts in 5 dimensions, it must have at least 4 pinch points ( $2 \times 5 - 6 = 4$ ).
If it starts in 6 dimensions, it must have at least 6 pinch points.

This isn't just a "maybe." The authors have mathematically proven that you simply cannot have fewer. It's a hard limit, like gravity.

The "Perfect" Shape

The story gets even more interesting when they ask: "Okay, we know the minimum number. But which shapes actually hit this minimum?"

The authors discovered that there is only one specific family of shapes that manages to be so efficient that it creates exactly the minimum number of pinch points ( $2N - 6$ ) and no more. These shapes are called rational normal scrolls.

To visualize a rational normal scroll, think of a piece of paper that you roll into a tube, but instead of a simple cylinder, you twist it as you roll it. It's a surface that is "ruled by lines," meaning you can draw a straight line across every single point on the surface. If your shape is anything else—a twisted knot, a complex curve, or a weird blob—it will inevitably create more than the minimum number of pinch points. The paper proves that if you see exactly $2N - 6$ pinch points, you know for a fact that the original shape was a rational normal scroll. If it's any other shape, the count will be higher.

How They Solved It

The authors didn't just look at one shape and guess. They used a clever strategy called "induction," which is like climbing a ladder one rung at a time.

The Setup: They started with the idea of "uncrumpled maps." Imagine taking a smooth surface and projecting it. If the projection is "uncrumpled," it means the surface hasn't been squashed into a flat, boring line or a cone; it's still a proper, interesting 2D shape.
The Inner Projection Trick: They imagined taking a point on the shape and "blowing it up" (a mathematical way of zooming in and smoothing out a sharp corner) to create a new, slightly different shape in one fewer dimension.
The Counting Game: They found a mathematical formula that counts the pinch points. When they moved from the big $N$ -dimensional world down to the smaller $N-1$ world, they realized the count of pinch points dropped by exactly 4.
The Two Paths: They realized there were only two paths the shape could take:
- Path A (The Scroll): The shape is ruled by straight lines. In this case, they could calculate the pinch points directly and found they hit the minimum exactly when the shape is a rational normal scroll.
- Path B (The Twist): The shape is not ruled by lines. In this case, they proved that the shape must have more pinch points than the minimum. It's impossible for a non-scroll shape to be that efficient.

Why It Matters

You might wonder, "Who cares about pinch points in invisible dimensions?"

While it sounds abstract, this work helps mathematicians understand the fundamental "DNA" of shapes. Just as a biologist might study the minimum number of bones a creature needs to walk, these mathematicians are studying the minimum number of "kinks" a shape needs to exist when projected. It tells us that the universe of shapes is not random; there are strict, elegant rules governing how smooth things can become messy.

The paper also hints at future mysteries. They found that for certain special shapes (like the Veronese surface, which is a specific way of curving a flat plane), the number of pinch points is slightly higher than the minimum, but still very low. They leave the door open for other mathematicians to explore: "What about shapes in even higher dimensions? Are there other families of shapes that are almost as efficient as scrolls?"

In short, Cartisano and Patel have drawn a map. They've shown us the lowest valley in the landscape of pinch points and told us exactly which mountain range (the rational normal scrolls) sits right on that valley floor. Everything else is just higher ground.

Technical Summary: Bounding Pinch Point Schemes of Projected Surfaces

Problem Statement
The paper addresses the numerical limitations of singularities arising from the general linear projection of a smooth projective surface $X \subset \mathbb{P}^N$ (with $N \geq 4$ ) to $\mathbb{P}^3$ . According to the classical General Projection Theorem, the image of such a projection contains three types of ordinary singularities: a curve of double points, finitely many triple points, and finitely many pinch points. While the existence of these singularities is well-established, the paper focuses specifically on quantifying the pinch point scheme.

The central problem is to determine a sharp lower bound for the length of the pinch point scheme, denoted by the invariant $\gamma_2$ , in terms of the ambient dimension $N$ . The authors seek to characterize the surfaces that achieve this minimum. The invariant $\gamma_2$ is a projective character defined via Chern classes of the Gauss map, specifically the coefficient of the dual Schubert class $\sigma^*_{2}$ in the pullback of the fundamental class of the surface.

Methodology
The authors employ a combination of intersection theory, birational geometry, and inductive arguments on the dimension of the ambient projective space.

Generalization of the Setting: Rather than restricting attention to embedded surfaces, the paper introduces the concept of an "uncrumpled map" $\phi: X \to \mathbb{P}^N$ . A map is uncrumpled if its image is non-degenerate, the map is birational onto its image, and the ramification scheme is finite. This generalization allows the authors to work with maps that are not necessarily embeddings, facilitating the use of inner projections.
Inner Projections and Induction: The core of the proof relies on the technique of inner projection. By blowing up a general point $x \in X$ and projecting from its image $y = \phi(x)$ , the authors construct a map to $\mathbb{P}^{N-1}$ . They analyze how the pinch point invariant $\gamma_2$ changes under this operation.
Case Analysis: The proof distinguishes between two geometric cases for the image surface $Y = \phi(X)$ $Y = ϕ (X)$ :
- Non-ruled surfaces: Using lemmas regarding the properties of inner projections, the authors show that if $Y$ is not ruled by lines, the inner projection remains uncrumpled. They establish a recursive relationship where the invariant drops by exactly 4 ( $\tilde{\gamma}_2 = \gamma_2 - 4$ ) upon moving from $\mathbb{P}^N$ to $\mathbb{P}^{N-1}$ .
- Ruled surfaces: If $Y$ is ruled by lines, the surface is identified as a $\mathbb{P}^1$ -bundle over a base curve. In this case, the authors perform a direct computation using the geometry of ruled surfaces to derive the formula $\gamma_2 = 2d + 4g - 4$ , where $d$ is the degree and $g$ is the genus of the base.
Intersection Theoretic Computations: The authors utilize the Chow ring of the blow-up to compute the change in the Chern class expression defining $\gamma_2$ . This provides a rigorous algebraic derivation of the reduction in the invariant, avoiding purely geometric arguments used in previous literature.

Key Contributions and Results

Theorem 1.1 (Main Result): For a non-degenerate, smooth projective surface $X \subset \mathbb{P}^N$ with $N \geq 4$ , the number of pinch points of a general projection to $\mathbb{P}^3$ satisfies:
$\gamma_2 \geq 2N - 6$
Equality holds if and only if $X$ is a rational normal scroll.
This result provides a sharp lower bound for $\gamma_2$ in terms of $N$ and identifies the unique class of surfaces minimizing this invariant.
Generalization to Uncrumpled Maps (Theorem 2.5): The bound and the characterization of equality are extended to the broader context of uncrumpled maps $\phi: X \to \mathbb{P}^N$ , not just embeddings. This demonstrates the robustness of the invariant under birational modifications.
Classification of Near-Minimal Surfaces (Theorem 4.2): The paper classifies surfaces where the pinch point count is slightly higher than the minimum. Specifically, if $\gamma_2 = 2N - 6 + 2i$ for a fixed integer $i$ , the surface must be one of the following:
1. A ruled surface with specific degree and genus constraints.
2. The Veronese surface in $\mathbb{P}^5$ (where $N=5, i=1$ ).
3. A del Pezzo surface of degree $N$ (where $4 \leq N \leq 9$ and $i = N-3$ ).
Comparison with Curves and Previous Work: The paper draws an analogy to the Riemann–Hurwitz formula for curves, where the minimal ramification occurs for rational normal curves. It also contrasts its findings with E. Marchionna's 1950s results on hyperplane section singularities, noting that while Marchionna's bound involves the degree $d$ , the pinch point bound depends linearly on $N$ . The authors explicitly state that their methods are entirely different from those used by Marchionna.

Significance and Future Directions
The paper claims significance in establishing a sharp lower bound for a fundamental projective invariant, $\gamma_2$ , which describes the geometry of a surface's embedding. By identifying rational normal scrolls as the unique minimizers, the work clarifies the extremal behavior of projective surfaces.

The authors note that their methods differ entirely from those of Marchionna, utilizing modern intersection theory and inductive inner projections. The paper concludes by pointing toward natural extensions of this work:

Higher Dimensions: Investigating the one-row character $\gamma_n$ for smooth varieties of dimension $n$ , specifically determining the sharp lower bound for $\gamma_n$ and classifying the varieties that attain it.
Enumerative Geometry: Defining a "projection-ramification map" $\Phi$ from the Grassmannian of projection centers to the symmetric product of the surface. The authors pose the problem of determining the degree of this map for rational normal scrolls, noting that for scrolls of the form $S(1, b)$ , this reduces to the degree of the Wronski map for rational normal curves.

The work does not propose experimental applications but rather frames these results as foundational steps in the geometry of projective varieties, inviting further study into the enumerative properties of projection ramification.

The Great Pinch-Point Hunt

The "Perfect" Shape

How They Solved It

Why It Matters

Technical Summary: Bounding Pinch Point Schemes of Projected Surfaces

More like this