Skip to main content
QUICK REVIEW

[Paper Review] Finite generation of adjoint ring for log surfaces

Kenta Hashizume|arXiv (Cornell University)|May 9, 2015
Algebraic Geometry and Number Theory4 references4 citations
TL;DR

This paper proves the finite generation of the adjoint ring for $$\mathbb{Q}$-factorial log surfaces over any algebraically closed field, using the minimal model program and abundance theorems for $$\mathbb{R}$-divisors. The key result establishes that the adjoint ring $\mathcal{R}(\pi,\Delta^{\bullet})$ is a finitely generated $\mathcal{O}_U$-algebra, extending previous results to arbitrary characteristic and non-log canonical pairs.

ABSTRACT

We prove the finite generation of the adjoint ring for $\mathbb{Q}$-factorial log surfaces over any algebraically closed field.

Motivation & Objective

  • To establish the finite generation of the adjoint ring for $$\mathbb{Q}$-factorial log surfaces in arbitrary characteristic.
  • To generalize Fujita's and Fujino's results on finite generation to non-log canonical pairs and higher $n$-tuples of divisors.
  • To extend the finite generation result beyond the projective case and over fields of positive characteristic.
  • To resolve the finite generation problem for adjoint rings in the context of the minimal model program for surfaces.
  • To provide a general framework for adjoint ring finite generation using cone decomposition and rational polytopes.

Proposed method

  • Reduces the finite generation problem to the case where $K_X + \Delta_i$ is semi-ample over $U$ using Shokurov's ideas.
  • Applies the minimal model program and abundance theorem for $\mathbb{Q}$-factorial log surfaces over any algebraically closed field.
  • Employs cone decomposition techniques on the cone of pseudo-effective divisors to analyze the structure of the adjoint ring.
  • Uses rational polytopes and graded ring theory to handle the combinatorial structure of the ring generators.
  • Applies properties of $\mathbb{R}$-divisors and linear equivalence over $U$ to control the behavior of divisor classes.
  • Utilizes a finite simplex covering of rational polytopes to decompose the problem into manageable convex pieces.

Experimental results

Research questions

  • RQ1Does the adjoint ring $\mathcal{R}(\pi,\Delta^{\bullet})$ remain finitely generated when $X$ is $\mathbb{Q}$-factorial and $\Delta_i$ are not necessarily log canonical?
  • RQ2Can the finite generation of adjoint rings for log surfaces be established over fields of arbitrary characteristic?
  • RQ3Is it possible to reduce the general finite generation problem to the case where $K_X + \Delta_i$ is semi-ample over $U$?
  • RQ4How can cone decomposition and rational polytopes be used to analyze the structure of adjoint rings in higher-dimensional divisorial settings?
  • RQ5What role do the minimal model program and abundance theorems for $\mathbb{R}$-divisors play in proving finite generation in positive characteristic?

Key findings

  • The adjoint ring $\mathcal{R}(\pi,\Delta^{\bullet})$ is a finitely generated $\mathcal{O}_U$-algebra for any proper morphism $\pi: X \to U$ from a $\mathbb{Q}$-factorial surface to a variety over an algebraically closed field.
  • The result holds without requiring $\Delta_i$ to be log canonical, generalizing Fujita's and Fujino's results.
  • Finite generation is established in arbitrary characteristic, including positive characteristic, via Tanaka's extension of the minimal model program.
  • The proof reduces the general case to the semi-ample case using cone decomposition and rational polytope techniques.
  • The method relies on the minimal model program and abundance theorems for $\mathbb{R}$-divisors, which are valid over any algebraically closed field.
  • The use of rational polytopes and simplex coverings ensures the existence of a finite generating set for the adjoint ring.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.