The abundance conjecture for log canonical pairs
The abundance conjecture for log canonical pairs
Let be a log canonical (lc) pair, and suppose that is nef over . A divisor is semi-ample over if it defines a contraction over after a suitable positive multiple; here this means that there are a contraction and an ample over -divisor on . Abundance conjecture. The divisor is semi-ample over , so that
The conjecture is stated in the source as proved through work of Miyaoka, Kawamata, and Keel–Matsuki–McKernan, although the surrounding discussion also describes higher-dimensional abundance as an important problem; the supplied parser status marks this candidate as resolved.
Equivalent formulations 2
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
The abundance conjecture for log canonical pairs
Let be a log canonical (lc) pair. A divisor is nef over if it is nef relative to , and semi-ample over if it defines a relatively semi-ample divisor.
Abundance conjecture. If is nef over , then it is semi-ample over .
Abundance is a fundamental open problem in the minimal model program. The paper notes that, in higher dimensions, there has been little progress on this conjecture and identifies nonvanishing as a central conceptual obstacle.
source: Caucher Birkar, “On existence of log minimal models II”, arXiv:0907.4170 (2009).
The abundance conjecture for log canonical pairs
Let be a log canonical pair, where is a -divisor.
Abundance conjecture. If is nef, then it is semiample.
This is a central problem in birational geometry. The conjecture is known in several cases, including projective K-trivial threefolds, but is not known in full generality.
source: Haidong Liu and Roberto Svaldi, “Rational curves and strictly nef divisors on Calabi–Yau threefolds”, arXiv:2010.12233 (2020).
Sources & referencesView supporting material
Primary source
Caucher Birkar, “Lectures on birational geometry”, arXiv:1210.2670 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.