🔢 mathematics

Bounds on the F-Pure Threshold of Isolated Hypersurface Singularities

This paper establishes bounds for the $F$ -pure threshold of isolated hypersurface singularities in positive characteristic using classical invariants like Milnor and Tjurina numbers, as well as value semigroup generators for curve singularities, to derive analogous bounds for the log canonical threshold and Briançon-Skoda exponent in the complex case.

Original authors: Yotam Svoray

Published 2026-06-04

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Yotam Svoray

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 a detective trying to understand the "roughness" of a shape at a single, tiny point where it folds or twists. In mathematics, this point is called a singularity. The paper you are asking about is a guidebook for measuring exactly how "sharp" or "bad" this point is, but with a specific twist: it does the measuring using a special kind of arithmetic called positive characteristic (think of it as doing math on a clock with a prime number of hours, like 5 or 7, rather than the infinite number line we use in everyday life).

Here is the breakdown of the paper's main ideas, translated into everyday language:

1. The Goal: Measuring the "Sharpness"

The author, Yotam Svoray, wants to find a way to calculate a specific number called the F-pure threshold. You can think of this number as a "sharpness score."

A low score means the singularity is very sharp and messy.
A high score (closer to 1) means the singularity is relatively smooth.

The problem is that calculating this score directly is often very hard, like trying to count the grains of sand in a storm. The paper's main achievement is finding shortcuts (bounds) to estimate this score using other, easier-to-measure tools.

2. The Tools: The "Milnor" and "Tjurina" Numbers

To estimate the sharpness, the author uses two existing tools that mathematicians already know how to calculate:

The Milnor Number: Think of this as a count of how many "loops" or "holes" are created when you slightly nudge the shape. It measures the complexity of the twist.
The Tjurina Number: This is a similar count, but it's a stricter measure that also looks at the specific equation defining the shape.

The Big Discovery (Theorem 1.1):
The paper proves a simple rule of thumb:

The sharper the singularity (the lower the F-pure threshold), the larger these complexity numbers must be.

Specifically, the author shows that the "sharpness score" is always at least a certain amount determined by these two numbers.

If you know the Tjurina number and the Milnor number, you can draw a "floor" for the sharpness score. You might not know the exact number, but you know it can't be lower than this floor.
Analogy: Imagine you are trying to guess the height of a building. You don't have a ladder, but you know the size of the foundation (Tjurina) and the number of windows (Milnor). The paper says, "Based on these, the building is definitely at least 50 feet tall."

3. The Special Case: Curves (One-Dimensional Shapes)

The paper gets even more specific when looking at curves (shapes that look like lines that cross themselves). For these, the author uses a concept called a Value Semigroup.

Analogy: Imagine a musical scale. A semigroup is like a specific set of notes you are allowed to play. The "generators" are the first two notes in that scale.
The Discovery (Theorem 1.2): For curves, the author shows that if you know the first two "notes" (generators) of this scale, you can often calculate the sharpness score exactly.
This is a "positive characteristic" version of a famous formula discovered by a mathematician named Igusa in the complex world. The author essentially says, "Igusa had a formula for the smooth world; here is the matching formula for our clock-arithmetic world."

4. The Payoff: Connecting to the "Real" World

The most exciting part of the paper is the "bridge" it builds.

Mathematicians often study shapes using Complex Numbers (the standard, infinite math we use for physics and engineering). This is called the Log Canonical Threshold.
The author shows that if you take a shape defined by whole numbers (integers), reduce it modulo a prime number (put it on the clock), and measure the "F-pure threshold," you get a clue about the "Log Canonical threshold" of the original complex shape.

Corollary 1.3 (The Result):
By using the shortcuts found in the "clock math" world, the author can now give better estimates for the sharpness of shapes in the "complex math" world.

Analogy: It's like trying to understand the weather in a distant country. You can't go there, but you can look at the weather patterns of a similar climate in a different season (the positive characteristic world) and use those patterns to make a very good guess about the distant weather.

Summary of the Paper's Claims

We can bound the "sharpness" (F-pure threshold) of a singular point using the "complexity numbers" (Milnor and Tjurina).
For curves, we can often calculate the exact sharpness just by looking at the first two numbers in the shape's "value sequence."
These results in "clock math" allow us to improve our estimates for the sharpness of shapes in standard "complex math" (Log Canonical Threshold) and other related mathematical concepts (Briançon–Skoda exponent).

The paper does not claim these results apply to medicine, engineering, or climate science directly. It stays strictly within the realm of abstract algebra and geometry, providing new tools for mathematicians to understand the fundamental structure of shapes.

Technical Summary: Bounds on the F-Pure Threshold of Isolated Hypersurface Singularities

Problem Statement
The paper addresses the problem of bounding the F-pure threshold (fpt) of isolated hypersurface singularities defined over an algebraically closed field $k$ of positive characteristic $p > 0$ . The F-pure threshold is a fundamental invariant in positive characteristic commutative algebra and singularity theory, serving as an analogue to the log canonical threshold (lct) in characteristic zero. While the F-pure threshold is well-understood for homogeneous or quasi-homogeneous polynomials, obtaining bounds for general isolated singularities in terms of classical invariants remains a significant challenge. Specifically, the author seeks to relate the fpt to the Milnor number ( $\mu$ ) and the Tjurina number ( $\tau$ ), and to extend these results to curve singularities using value semigroups.

Methodology
The paper employs a combination of techniques from local algebra, singularity theory, and reduction modulo $p$ .

Algebraic Invariants and Determinacy: The author utilizes the definitions of the Jacobian ideal, Milnor number, and Tjurina number. A central tool is the theory of contact and right determinacy, which establishes that singularities with finite $\tau$ or $\mu$ are determined by their truncations to a certain order. This allows the author to treat power series as polynomials for the purpose of computing invariants.
Valuation Semigroups: For curve singularities ( $n=2$ ), the paper leverages the semigroup of values $\Gamma(f)$ . By analyzing the minimal generating sequence of this semigroup, specifically the first two generators ( $\beta_0, \beta_1$ ), the author relates the geometry of the singularity to the algebraic structure of the F-pure threshold.
Approximation and Limits: To handle cases where the Milnor number is infinite but the Tjurina number is finite, the author constructs a sequence of perturbations $f_l = f + a^l$ that render the Milnor number finite. By taking the limit as $l \to \infty$ and utilizing the lower semi-continuity of the F-pure threshold, bounds for the original singularity are derived.
Reduction Modulo $p$ : To connect positive characteristic results to the complex case, the paper uses the relationship between the F-pure threshold of a reduction $f_p$ and the log canonical threshold of the original integer polynomial $f$ . This involves lifting singularities from characteristic $p$ to characteristic zero (or $\mathbb{Z}$ ) while preserving the value semigroup structure.

Key Contributions and Results

Bounds via Milnor and Tjurina Numbers:
The paper establishes lower bounds for the F-pure threshold of an isolated hypersurface singularity $f$ in terms of $\mu(f)$ and $\tau(f)$ :
- If $\mu(f) < \infty$ , then $\text{fpt}(f) \geq \frac{1}{\tau(f)} - \frac{1}{\mu(f)}$ .
- If $\mu(f) = \infty$ (but $\tau(f) < \infty$ ), then $\text{fpt}(f) \geq \frac{1}{\tau(f)}$ .
  These results generalize previous bounds and provide a unified framework for both finite and infinite Milnor number cases.
Curve Singularities and Value Semigroups:
For irreducible curve singularities $f \in k[[x,y]]$ , the paper provides an upper bound and an exact computation formula based on the minimal generators $\beta_0, \beta_1$ of the value semigroup $\Gamma(f)$ :
- Upper Bound: $\text{fpt}(f) \leq \frac{1}{\beta_0} + \frac{1}{\beta_1}$ .
- Exact Computation: If $\Gamma(f)$ is generated by exactly two elements, then $\text{fpt}(f) = \text{fpt}(x^{\beta_0} + y^{\beta_1})$ . This reduces the computation for a broad class of curve singularities to that of diagonal hypersurfaces (Fermat-type polynomials), for which explicit formulas exist.
Applications to Characteristic Zero:
By applying the positive characteristic bounds to reductions of integer polynomials, the paper derives analogous results for the log canonical threshold (lct) and the Briançon–Skoda exponent ( $e_{BS}$ ) of complex isolated hypersurface singularities:
- Log Canonical Threshold: If $f \in \mathbb{Z}[[x]]$ has finite $\mu(f)$ , then $\text{lct}(f) \geq \frac{1}{\tau(f)} - \frac{1}{\mu(f)}$ .
- Briançon–Skoda Exponent: The paper establishes the inequality $\text{lct}(f) \cdot \mu(f) + 1 \geq e_{BS}(f)$ .
- Igusa's Formula: The paper provides a positive-characteristic analogue of Igusa's formula for the log canonical threshold of irreducible plane curves, showing that $\text{lct}(f) \leq \frac{1}{\beta_0} + \frac{1}{\beta_1}$ , with equality holding if the value semigroup is generated by two elements.

Significance and Claims
The author claims that this work bridges the gap between the study of isolated hypersurface singularities and the F-pure threshold, demonstrating that classical invariants like $\mu$ and $\tau$ are effective tools for bounding this threshold.

Analogue to Igusa's Result: A primary claim is the establishment of a positive-characteristic analogue to Igusa's formula for the log canonical threshold of plane curves, utilizing the value semigroup generators.
Reduction of Complexity: The result that curve singularities with two-generated semigroups have the same F-pure threshold as diagonal hypersurfaces simplifies the computation of these invariants significantly.
Unification: The paper unifies the treatment of singularities with finite and infinite Milnor numbers by showing that the bound involving the Tjurina number holds universally for isolated singularities, with the Milnor term vanishing in the infinite case.

The work is presented as part of the author's PhD thesis, aiming to provide explicit bounds and computational methods for the F-pure threshold, thereby offering new perspectives on the relationship between characteristic $p$ and characteristic $0$ singularity invariants.

1. The Goal: Measuring the "Sharpness"

2. The Tools: The "Milnor" and "Tjurina" Numbers

3. The Special Case: Curves (One-Dimensional Shapes)

4. The Payoff: Connecting to the "Real" World

Summary of the Paper's Claims

More like this