The only finite graph that is an inverse limit with a set valued function on \([0,1]\) is an arc (Q409508)

\textit{W. S. Mahavier} [``Inverse limits with subsets of \([0,1] \times [0,1]\)'', Topology Appl. 141, No. 1-3, 225--231 (2004; Zbl 1078.54021)] introduced the study of inverse limits with set valued functions. In the paper under review, the author considers the particular case in which all the spaces are equal to the interval \([0,1]\) and all the functions coincide. For this particular case, the inverse limit can be defined as follows. Take a closed subset \(M\) in the unit square \([0,1] \times[0,1]\) such that both projections of \(M\) onto \([0,1]\) are onto. Then \(\lim_{\leftarrow} M\) is defined as the set of sequences \((x_n)_n\) in the Hilbert cube such that \((x_{n+1},x_{n})\in M\) for each \(n\). A fundamental question on this topic is: What spaces can be obtained as this type of inverse limit? The reviewer showed in [``A circle is not the generalized inverse limit of a subset of \([0,1]^2\)'', Proc. Am. Math. Soc. 139, No. 8, 2987--2993 (2011; Zbl 1232.54030)] that a simple closed curve cannot be obtained in this way. In a previous paper [``Finite graphs that are inverse limits with a set valued function on \([0,1]\)'', Topology Appl. 158, No. 10, 1226--1233 (2011; Zbl 1236.54017)], the present author proved that if a finite graph \(G\) can be obtained as \(\lim_{\leftarrow} M\) for some \(M\), then \(G\) is an arc or a simple triod. In the paper under review the author finally solves the problem for finite graphs by proving that the arc is the only finite graph that can be obtained as such an inverse limit.