Volume 19, issue 1 (2019)

 Recent Issues
 The Journal About the Journal Editorial Board Editorial Interests Subscriptions Submission Guidelines Submission Page Policies for Authors Ethics Statement ISSN (electronic): 1472-2739 ISSN (print): 1472-2747 Author Index To Appear Other MSP Journals
Relative phantom maps

Kouyemon Iriye, Daisuke Kishimoto and Takahiro Matsushita

Algebraic & Geometric Topology 19 (2019) 341–362
Abstract

The de Bruijn–Erdős theorem states that the chromatic number of an infinite graph equals the maximum of the chromatic numbers of its finite subgraphs. Such determination by finite subobjects appears in the definition of a phantom map, which is classical in algebraic topology. The topological method in combinatorics connects these two, which leads us to define the relative version of a phantom map: a map $f:X\to Y$ is called a relative phantom map to a map $\phi :B\to Y$ if the restriction of $f$ to any finite subcomplex of $X$ lifts to $B$ through $\phi$, up to homotopy. There are two kinds of maps which are obviously relative phantom maps: (1) the composite of a map $X\to B$ with $\phi$; (2) a usual phantom map $X\to Y\phantom{\rule{0.3em}{0ex}}$. A relative phantom map of type (1) is called trivial, and a relative phantom map out of a suspension which is a sum of (1) and (2) is called relatively trivial. We study the (relative) triviality of relative phantom maps and, in particular, we give rational homology conditions for the (relative) triviality.

Keywords
relative phantom maps, de Bruijn–Erdos theorem, box complexes, relative triviality
Primary: 55P99