MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Reductivity of the automorphism group of K-polystable Fano varieties

Author(s)
Alper, Jarod; Blum, Harold; Halpern-Leistner, Daniel; Xu, Chenyang
Thumbnail
Download222_2020_987_ReferencePDF.pdf (425.6Kb)
Open Access Policy

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We prove that K-polystable log Fano pairs have reductive automorphism groups. In fact, we deduce this statement by establishing more general results concerning the S-completeness and Θ-reductivity of the moduli of K-semistable log Fano pairs. Assuming the conjecture that K-semistability is an open condition, we prove that the Artin stack parametrizing K-semistable Fano varieties admits a separated good moduli space.
Date issued
2020-07
URI
https://hdl.handle.net/1721.1/128467
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Inventiones mathematicae
Publisher
Springer Berlin Heidelberg
Citation
Alper, Jarod et al. "Reductivity of the automorphism group of K-polystable Fano varieties." Inventiones mathematicae 220 (July 2020): 995–1032 © 2020 Springer-Verlag
Version: Author's final manuscript
ISSN
0020-9910
1432-1297

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.