Logarithmic Quot spaces, boundedness, and K-tropicalizations

Abstract

Logarithmic Hilbert and Quot spaces are generalizations of their traditional versions adapted to study pairs and degenerations. The logarithmic Quot spaces of (X,D) parameterize "algebraically transverse" (logarithmically flat) quotient sheaves on degenerations of X. We prove boundedness and deduce properness of logarithmic Quot spaces. The results complete the basic foundations of logarithmic Quot spaces and specialize to work of Li-Wu and Maulik and the second author in special cases. Boundedness relies on two results of independent interest. First, we show that for a simple normal crossing pair (X, D) and a subscheme Z, there is a smallest logarithmic space X modifying X such that the strict transform of Z is algebraically transverse. Precisely, given Z in X, there is a canonical logarithmic space X over X with the following universal property - an snc logarithmic blowup X' X makes the strict transform of Z algebraically transverse if and only if X' is a modification of X. Parallel results hold for arbitrary coherent sheaves. This proves boundedness for logarithmic quotients with fixed tropicalization. A logarithmic quotient sheaf defines a K-tropicalization, an enhancement of tropicalization that is sensitive to scheme structures. The K-tropicalization has the same relationship to K-theory as traditional tropicalization has to Chow, and is related to Gr\"obner theory and convex geometry via state and secondary polytopes. Using the K-theory of toric bundles, we derive a balancing condition for K-tropicalizations that imposes strong finiteness properties. The second key result is that K-tropicalizations with fixed numerics are parametrized by a finite-dimensional polyhedral complex.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…