Atriodic tree-like continua as inverse limits on \([0,1]\) with interval-valued functions (Q2074376)

A compactum is a nonempty compact metric space. A continuum is a connected compactum. A continuum \(X\) is chainable if for each \(\epsilon > 0\), \(X\) admits a finite \(\epsilon\)-chain of open sets covering \(X\). A continuum \(X\) is arclike (tree-like), if for each \(\epsilon > 0\), \(X\) admits an \(\epsilon\)-mapping onto \([0, 1]\) (a tree). In the setting of inverse limits on \([0, 1]\) with interval-valued functions \(\{f_i\}_{i\leq 1}\), or with functions \(\{f_i\}_{i\leq 1}\) where each \(f^{-1}_i\) is interval-valued, the author proves that chainability of the graphs \(G(f_i)\), and chainability of the partial graphs \(G^{i+1}_1\) are necessary conditions to have an atriodic tree-like inverse limit. So, chainability of the graphs \(G(f_i)\) and the partial graphs \(G^{i+1}_1\) are necessary conditions to have a chainable inverse limit. It follows that non-chainable, atriodic tree-like continua cannot be realized as inverse limits on \([0, 1]\) with functions from either of these subclasses of set-valued functions.