Jump to ContentJump to Main Navigation
The Disc Embedding Theorem$
Users without a subscription are not able to see the full content.

Stefan Behrens, Boldizsar Kalmar, Min Hoon Kim, Mark Powell, and Arunima Ray

Print publication date: 2021

Print ISBN-13: 9780198841319

Published to Oxford Scholarship Online: September 2021

DOI: 10.1093/oso/9780198841319.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 04 December 2021

The Ball to Ball Theorem

The Ball to Ball Theorem

Chapter:
(p.131) 10 The Ball to Ball Theorem
Source:
The Disc Embedding Theorem
Author(s):

Stefan Behrens

Boldizsár Kalmár

Daniele Zuddas

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198841319.003.0010

The ball to ball theorem is presented, which states that a map from the 4-ball to itself, restricting to a homeomorphism on the 3-sphere, whose inverse sets are null and have nowhere dense image, is approximable by homeomorphisms relative to the boundary. The approximating homeomorphisms are produced abstractly, as in the previous chapter, with no need to investigate the decomposition elements further. In the proof of the disc embedding theorem, a decomposition of the 4-ball will be constructed, called the gaps+ decomposition. The ball to ball theorem will be used to prove that this decomposition shrinks; this is called the β-shrink.

Keywords:   ball to ball theorem, null decomposition, β-shrink, disc embedding theorem, gaps+ decomposition

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 .