Recursively squeezable sets are squeezable
Fredric D. Ancel

TL;DR
This paper proves that null decompositions with recursively squeezable non-singleton elements are shrinkable, removing previous restrictions on filtration length, thus advancing understanding of decompositions in 4-manifold topology.
Contribution
It introduces the concepts of squeezable and squashable sets, showing their equivalence and extending shrinkability results to recursively squeezable sets without filtration length bounds.
Findings
Null decompositions with squeezable elements are shrinkable.
Recursively squashable sets are squashable, unifying the concepts.
Main theorem extends previous results by removing filtration length restrictions.
Abstract
In work by Freedman [F2] and Freedman-Quinn [FQ] on the topology of 4-manifolds, null decompositions whose non-singleton elements are, in the terminology of [MOR], recursively starlike-equivalent sets of filtration length 1 arise and are shown to be shrinkable. The main result of [MOR] is a general theorem covering these types of decompositions. It establishes the shrinkability of null decompositions whose non-singleton elements are recursively starlike-equivalent sets whose filtration lengths have a uniform finite upper bound. That result is the inspiration for this article. Here it is shown that the hypothesis of a uniform finite upper bound on filtration lengths is unnecessary. In outline: notions of squeezable subsets and squashable subsets of a compact metric space are defined. It is observed that starlike-equivalent sets are squeezable, and that any null decomposition of a compact…
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
TopicsLogic, Reasoning, and Knowledge · Constraint Satisfaction and Optimization
