Subconsensus Tasks: Renaming Is Weaker Than Set Agreement

We consider the the relative power of two important synchronization problems: set agreement and renaming. We show that renaming is strictly weaker than set agreement, in a round-by-round model of computation. We introduce new techniques, including previously unknown connections between properties of manifolds and computation, as well as novel “symmetry-breaking” constructions.