No label defined (Q3685663)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3909317
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3909317

      Statements

      0 references
      1985
      0 references
      n-continua
      0 references
      winding number
      0 references
      mapping degree
      0 references
      [For the entire collection see Zbl 0548.00012.] A linearly ordered continuum is a linearly ordered set which is dense, complete and which has at least two elements but no first and no last. So this notion generalizes the real line \({\mathbb{R}}\). An n-continuum is a Cartesian product \(C_ 1\times...\times C_ n\) of n linearly ordered continua. In such a space we have the box topology. So n-continua are topological generalizations of the Euclidean n-space \({\mathbb{R}}^ n\). \textit{F. Riesz} [Math. Ann. 61, 406-421 (1905)] posed the question which theorems of the topology of \({\mathbb{R}}^ n\) can be generalized to n- continua. In a forthcoming paper (to appear in Arch. Math.) I proved that the separation theorem of Jordan-Brouwer-Alexander can be generalized to n-continua. The main tool for the proof of this is the generalization of the winding number (and the mapping degree) to n-continua. If A is the closure of a nonempty bounded open subset of an n-continuum C, \(\partial A\) its boundary and \(f: \partial A\to C\) a continuous mapping, \(p\in C\setminus f\partial A\), the winding number \(D_ A(f,p)\) of f relative to p is defined via a reduction process to the Euclidean situation. It is proved that this notion has analogous properties to those for the case of \({\mathbb{R}}^ n\). In particular the multiplication theorem for the winding number is generalized to n-continua.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references