Abundance theorem for numerically trivial log canonical divisors of semi-log canonical pairs

TL;DR

This paper proves the abundance theorem for log canonical divisors that are numerically trivial in the context of log canonical and semi-log canonical pairs, advancing the understanding of their geometric properties.

Contribution

It establishes the abundance theorem specifically for numerically trivial log canonical divisors in semi-log canonical pairs, a case previously unresolved.

Findings

Proves the abundance theorem for these pairs.

Shows that numerically trivial divisors are semi-ample.

Extends known results to semi-log canonical pairs.

Abstract

We prove the abundance theorem for numerically trivial log canonical divisors of log canonical pairs and semi-log canonical pairs.