Frobenius splitting, point-counting, and degeneration

Abstract

Let f be a polynomial of degree n in ZZ[x1,..,xn], typically reducible but squarefree. From the hypersurface f=0 one may construct a number of other subschemes Y by extracting prime components, taking intersections, taking unions, and iterating this procedure. We prove that if the number of solutions to f=0 in pn is not a multiple of p, then all these intersections in n_p just described are reduced. (If this holds for infinitely many p, then it holds over as well.) More specifically, there is aFrobenius splitting on n_p compatibly splitting all these subschemes Y. We determine when a Gr\"obner degeneration f0=0 of such a hypersurface f=0 is again such a hypersurface. Under this condition, we prove that compatibly split subschemes degenerate to compatibly split subschemes, and stay reduced. Our results are strongest in the case that f's lexicographically first term is Πi=1n xi. Then for all large p, there is a Frobenius splitting that compatibly splits f's hypersurface and all the associated Y. The Gr\"obner degeneration Y' of each such Y is a reduced union of coordinate spaces (a Stanley-Reisner scheme), and we give a result to help compute its Gr\"obner basis. We exhibit an f whose associated Y include Fulton's matrix Schubert varieties, and recover much more easily the Gr\"obner basis theorem of [Knutson-Miller '05]. We show that in Bott-Samelson coordinates on an opposite Bruhat cell Xv in G/B, the f defining the complement of the big cell also has initial term Πi=1n xi, and hence the Kazhdan-Lusztig subvarieties Xvw degenerate to Stanley-Reisner schemes. This recovers, in a weak form, the main result of [Knutson '08].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…