Note on the semiampleness theorem for the log canonical divisors on klt varieties which are nef and abundant
Shigetaka Fukuda

TL;DR
This paper offers an alternative proof of the Kawamata semiampleness theorem for log canonical divisors on klt varieties that are nef and abundant, building on existing finite generation results and previous proofs.
Contribution
The paper provides a new proof approach for the semiampleness theorem, referencing and acknowledging prior work by Fujino and others, and clarifies the relationship with finite generation of lc rings.
Findings
Alternative proof of Kawamata semiampleness theorem.
Connection between finite generation of lc rings and semiampleness.
Acknowledgment of prior proofs and results in the field.
Abstract
We give another alternative proof to the Kawamata semiampleness theorem for the log canonical divisors on klt varieties which are nef and abundant. After the first version of this article was posted to the e-print Arxiv, Prof. Fujino notified the author that the quick and essential proof ([Fujino. On Kawamata's theorem.(EMS 2011), Rem 2.7]) is already known. The author would like to thank him. More precisely, Prof. Fujino already gave the quick and essential proof ([Fujino. On Kawamata's thm.(EMS 2011), Rem 2.7], [Fujino. Finite generation of the lc ring in dim 4. (Kyoto J. Math. 50 (2010)), Rem 3.15]) from the finite generation thm (Birkar-Cascini-Hacon-McKernan [BCHM]) of the lc rings for klt pairs and from the fact (cf. Mourougane-Russo [MoRu, C.R.A.S. Math. 325 (1997)]) that a nef and abundant -divisor is semiample if its graded ring is finitely generated:"For a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Commutative Algebra and Its Applications · Polynomial and algebraic computation
