- Pseudo-arc
In
point-set topology , the pseudo-arc is the simplest nondegenerate hereditarily indecomposable continuum. It was first discovered, in 1922, by the renowned Polish topologistBronislaw Knaster . The following definitions are, with slight modifications, due toWayne Lewis (see the references section below). Other definitions have appeared in papers byR.H. Bing andEdwin E. Moise ; they yieldhomeomorphic spaces.Definitions
Chains
At the heart of the definition of the pseudo-arc is the concept of a "chain", which is defined as follows:
:A chain is a finite collection of
open set s in ametric space such that if and only if The elements of a chain are called its links, and a chain is called an ε-chain if each of its links hasdiameter less than ε.While being the simplest of the type of spaces listed above unlike only the other cant be described toward one., the pseudo-arc is actually very complex. The concept of a chain being "crooked" (defined below) is what endows the pseudo-arc with its complexity. Informally, it requires a chain to follow a certain recursive zig-zag pattern in another chain. To 'move' from the "m"th link of the larger chain to the "n"th, the smaller chain must first move in a crooked manner from the "m"th link to the ("n"-1)th link, then in a crooked manner to the ("m"+1)th link, and then finally to the "n"th link.
More formally:
:Let and be chains such that
:# each link of is a subset of a link of , and:# for any indices "i", "j", "m", and "n" with , , and
Wikimedia Foundation. 2010.