Jump to ContentJump to Main Navigation
Flips for 3-folds and 4-folds$
Users without a subscription are not able to see the full content.

Alessio Corti

Print publication date: 2007

Print ISBN-13: 9780198570615

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198570615.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 27 June 2019

Extension theorems and the existence of flips

Extension theorems and the existence of flips

Chapter:
(p.76) 5 Extension theorems and the existence of flips
Source:
Flips for 3-folds and 4-folds
Author(s):

Christopher D. Hacon

James McKernan

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198570615.003.0005

This chapter provides a detailed and self-contained exposition of Hacon and McKernan's construction of pl flips in dimension n assuming minimal models with scaling in dimension n-1. The construction is based on the key notion of an ‘adjoint algebra’. The chapter contains an introduction to multiplier ideals, and the celebrated lifting lemma is developed from first principles. Key ideas of the minimal model program for real pairs are also developed from the ground up.

Keywords:   Hacon, McKernan, adjoint algebra, multiplier ideal sheaf, real minimal model program, lifting lemma

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .