On the size of the fibers of a morphism of algebraic varieties

arXiv:2609.09128 · math.AG · Submitted 2026-09-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "On the size of the fibers of a morphism of algebraic varieties".

Title and authors: Ada: So we’re looking at this paper, "On the size of the fibers of a morphism of algebraic varieties," by Abdelkader Mokkadem. What's the main idea behind this title and who are these authors?

Emmy: It deals with how to study the size distribution of fibers in algebraic geometry. The core question is whether we can characterize exactly which fiber sizes occur, whether they are finite integers or if there's some sort of structure to that set of points.

Kolya: I wonder if this is about getting a general handle on the behavior across all these different kinds of varieties, or if it’s focused on a specific class? I mean, "algebraic varieties" is pretty broad.

Ada: It seems to be aiming for generality. The paper sets up the problem by focusing on the set Fm, which is just the set of points in the target variety W where the fiber size under a morphism u has exactly m, whether m’s a specific number or infinity.

Emmy: And it immediately tackles that by asking if this set Fm is constructible in some sense. Constructible sets are those made up of finite unions of locally closed sets, which is a topological way to say the set has some nice geometric structure we can work with.

Kolya: So, what does "constructible" mean in this context? Is it just about being open and closed, or is there something more subtle when you're talking about fiber sizes?

Ada: It means it has a specific type of topological complexity that allows us to use tools like Chevalley’s theorem later on. They are trying to prove this holds for any integer m or for infinity.

The paper's summary: Emmy: The paper actually outlines the structure of the problem by looking at what happens when the varieties V and W are irreducible, normal, and u is dominant and finite with a separable degree n. In that specific case, they find that these sets Fm are open.

Ada: That’s a strong result for that nice setup. But they also look at the general case where V and W aren't necessarily affine or irreducible, which is where things get more interesting for AI applications.

Kolya: So, in the general case, what’s the main achievement? Are they saying it’s always constructible there?

Emmy: They prove that for any integer m or for infinity, the set Fm is constructible when you consider non-affine and non-irreducible varieties. This is a big step because it removes those restrictive assumptions we often have to make in simpler settings.

Ada: And they achieve this by first tackling the case where m equals zero, which they show is constructible using a new proof of Chevalley’s theorem. That sets the stage for how they handle other sizes too.

Kolya: That sounds like it might be a bit more technical than just saying "it's constructible." Are we talking about the actual size being easy to calculate, or just that the set *exists* in a nice topological way?

Emmy: It means that even if calculating the exact fiber size for every point is hard, the *set* of points having a specific fiber size has a manageable shape. That's what makes it useful for analyzing distributions across these complex spaces.

The paper's improvements: Ada: The authors suggest some structural improvements to how we analyze this problem, specifically focusing on decomposing the morphism u into simpler parts, like compositions involving injective maps.

Emmy: They suggest using tools from the structure of the polynomial rings, specifically looking at a set of generators for kV over kW, and then choosing a subset of those generators to decompose the map phi. That helps them find decompositions that simplify the analysis.

Kolya: How does that decomposition actually help you figure out if a fiber size is finite or infinite? Does it give you a bound on what the size could possibly be?

Ada: It allows them to use methods based on reducing the problem to the separable case and using strong finite cases. This lets them precisely characterize fiber sizes when W is normal and u is a finite dominant morphism, specifically showing that for m between one and n, where n is related to the separable degree s, the set Fm is locally closed.

Emmy: That local closed property in the normal finite case seems really powerful. It means that for those nice situations, we can't just have a random scattering of points; there’s a coherent geometric structure governing where those sizes land.

Kolya: So, if we're looking at the normal finite case, what’s the actual bound they give on the fiber size? Is it always tied directly to that separable degree n?

Ada: Yes, Theorem one establishes that for all points in W, the size of the fiber is less than or equal to n, where n is defined as

k(V): k(W): times s <ref:2609.09128#pg1>. This gives us a concrete limit on how big those finite fibers can get.

Conclusion: Emmy: So to wrap up, the main point of "On the size of the fibers of a morphism of algebraic varieties" is that we can always characterize the set where fiber sizes hit a specific number or infinity as being constructible in general settings.

Ada: They've shown this even in non-affine, non-irreducible cases by first tackling zero and then using structural decompositions to handle other values. It gives us a robust framework for studying these distributions across algebraic varieties.

Kolya: From my perspective, what really sticks is that the authors provide ways to move from just knowing the general set exists to actually characterizing its size bound in the finite case, which helps with concrete applications where you need an exact count.

Emmy: Exactly. And for those normal finite morphisms, they give us a clear local closed condition on the fiber size set for any integer between one and that separable degree times s. It connects the algebraic structure of the map directly to topological properties of the target space W.

Ada: So we have this framework showing constructibility in general, and precise local closed conditions when things are nice, like normal finite maps. This paper lays a foundation for understanding how fiber distributions behave geometrically in these settings.

Kolya: It gives us the tools to predict the topological behavior of these fiber dimension sets under morphisms, which is useful because we know that dimension sets are often easier to handle than exact counts.

Emmy: That’s right. We’re setting up a way for AI systems to analyze the geometric properties of these distributions without getting lost in raw computation.

Ada: And that's what they do in this paper, showing how the distribution of fiber sizes is governed by underlying algebraic geometry and topology.

Université Paris-Saclay · UVSQ · CNRS · Laboratoire de Mathématiques de Versailles

math.AG

Submitted: 2026-09-08

Updated: 2026-11-18

License: http://creativecommons.org/licenses/by-nc-sa/4.0/

The gist: On the size of the fibers of a morphism of algebraic varieties proves that for any integer m or m = ∞, the set of y ∈ W such that u−1(y) has size m is a constructible set.

Key concepts

Constructible Set
A set that can be broken down into a finite union of 'locally closed' sets. A locally closed set is the intersection of an open set and a closed set. This concept allows mathematicians to study sets that are not necessarily simple continuous shapes, but rather those defined by basic algebraic conditions.
Fiber Size
This refers to the number of points in the domain variety V that map onto a single point in the target variety W under the morphism u. The paper studies when this count is exactly a specific integer m or when it is infinite.
Normal Finite Morphism
A special type of mapping where the target variety W has nice properties (it is normal) and the map u covers V finitely many times. This structure allows for precise calculations regarding the maximum possible fiber size and characterizes the sets of points with exact fiber sizes.
Dominant Morphism
A morphism where every point in the target variety W has at least one pre-image in the domain variety V. This condition ensures that we are studying a significant portion of both varieties, which is crucial for proving constructibility results.

Terminology

Summary

On the size of the fibers of a morphism of algebraic varieties proves that for any integer m or m = ∞, the set of y ∈ W such that u−1(y) has size m is a constructible set. p. 0

Where the paper says it

On the size of the fibers of a morphism of algebraic varieties Abdelkader Mokkadem∗ Abstract Let u : V → W be a morphism of algebraic varieties. Given an integer m or m = ∞, we prove that the set of y ∈ W such that u −1 (y) has size m, is a constructible set.

Introduction to Constructibility

The paper investigates whether the set of points in the target variety W whose pre-image under a morphism u has a specific fiber size, denoted by Fm, is constructible. A set is defined as constructible if it is a finite union of locally closed sets, where a locally closed set is the intersection of an open set and a closed set. p. 0

Where the paper says it

For the definition and properties of constructible set, we refer to [5] and [8]. Briefly, a set is said to be constructible if it is a finite union of locally closed sets—a locally closed set being the intersection of an open set and a closed set.

The study focuses on the sets Fm where m ∈ N or m = ∞. p. 0
Where the paper says it

The goal of this paper is to study how the size of the fibers is distributed in W. For this, we will focus in particular on the sets {y ∈ W, |u −1 (y)| = m} where m ∈ N or m = ∞.

Results in the Irreducible and Dominant Case

In the very important special case where V and W are irreducible, W is normal and u is dominant and finite with separable degree n, the set Fs is open. This implies that Fn is open and that for any integer s, the set Fs is a locally closed set. p. 1

Where the paper says it

This set is empty for s > n. This implies in particular that Fn is open and that for any integer s, the set Fs is a locally closed set.

The authors show that for any integer s, the set Fm is open and that for any integer s, the set Fs is a locally closed set. p. 0
Where the paper says it

Given an integer m or m = ∞, we prove that the set of y ∈ W such that u −1 (y) has size m, is a constructible set. We also show that this set is locally closed when W is normal and u is finite.

The General Case and Constructibility

In the general case where V and W are algebraic varieties that are neither affine nor irreducible, it is shown that for any integer s or for s = ∞, the set Fs is constructible. The authors prove this by first considering the set F0, which is shown to be constructible by a new proof of Chevalley’s theorem. p. 7

Where the paper says it

However, we will directly show that F0 is constructible and thus deduce that E0 is constructible. This provides a new proof of Chevalley’s theorem.

The Normal Finite Morphism Case

When W is normal and u: V → W is a finite dominant morphism, Theorem 1 establishes that for all y ∈ W, u−1(y) ≤ n where n = [k(V): k(W)]s. Furthermore, the set of points with fiber size exactly n is given by Un(u), and for all m ≥ 1, the set of points with fiber size greater than or equal to m is Um(u). p. 1

Where the paper says it

More precisely, given a property (P), we study whether the fiber satisfies the property (P) or not. The study of the set of all y ∈ W such that the fiber of y possesses a property (P) is considered within the framework of Grothendieck’s localization problem (see [3]).

Corollary 1 states that under these assumptions, for any 1 ≤ m ≤ n, the set Fm is a locally closed subset of W. p. 6
Where the paper says it

The following corollary is obvious. Corollary 1 (Normal Case) Under the assumptions of Theorem 1, for any 1 ≤ m ≤ n, the set Fm = {y ∈ W, |u −1 (y)| = m} is a locally closed subset of W.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improve fiber size analysis for morphisms of algebraic varieties by proving that for any integer m or m = infinity, the set of y in W such that u-1(y) has size m is a constructible set, and locally closed when W is normal and u is finite. This allows AI systems to rigorously determine if the distribution of fiber sizes follows specific geometric properties.

  2. Enhance understanding of semi-continuity by applying Chevalley's Semi-Continuity Theorem to the study of fiber dimensions, showing that for any integer m, the set dim(u-1(u(x)) = m) is a constructible subset of V and consequently W. This enables AI to predict the topological behavior of fiber dimension sets under morphisms.

  3. Develop algorithms for decomposing dominant morphisms into compositions involving injective maps, such as u = u0 o µ, which can be used to simplify complex morphism analysis by leveraging the structure of k[V] over k[W]. This facilitates more efficient computation in algebraic geometry problems related to fiber analysis.

  4. Implement methods based on the reduction to the separable case (Proposition 2) and the strong finite case (Proposition 4) to precisely characterize fiber sizes for normal finite morphisms, enabling exact calculation of u-1(y) for specific cases. This allows AI systems to solve problems where fibers are known to be bounded by [k(V):k(W)]s.

  5. Generalize the constructibility results from the normal case (Theorem 1) to non-affine and non-irreducible varieties (Theorem 2), allowing AI to analyze fiber size distribution in more complex geometric settings without restrictive assumptions. This extends applicability to a broader class of algebraic variety problems.

  6. Create tools for analyzing the set F0, which is the disjoint union of W - u(V) and u(V) intersect F0, showing it is constructible by proving that if Z is a closed subset and Z intersect F0 is dense in Z, then the closure of Z intersect E0 is a proper subset of Z. This provides a new proof strategy for the general constructibility theorem.

  7. Implement techniques derived from Lemma 2 (Closed subsets) to analyze fiber sizes for full closed subsets Y of V, showing that Fm intersect U is constructible and empty for l < m < infinity in a non-empty open subset U of M. This enables precise characterization of the set Fm within specific geometric constraints on the domain.

Abstract

Let u be a morphism of algebraic varieties. Given m integer or infinite, we prove that the set of points whose fiber has size m is a constructible set.

Related papers