No label defined (Q3687358)

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 3911307
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3911307

      Statements

      1985
      0 references
      closed, orientable 3-manifold
      0 references
      essential embedded 2-sphere
      0 references
      represented by embedded 2-spheres
      0 references
      [For the entire collection see Zbl 0561.00016.] For a closed, orientable 3-manifold, M, the sphere theorem asserts that \(\pi_ 2(M)\neq 0\) if and only if M contains an essential embedded 2- sphere (and so \(M=S^ 2\times S^ 1\) or M is a nontrivial connected sum and \(\pi_ 1(M)\) is a free product). The problem considered here is to decide which elements of \(\pi_ 2(M)\) are simple - can be represented by embedded 2-spheres. This is treated in the case that \(\pi_ 1(M)\cong G_ 1*...*G_ n\) is a free product of some number, n, of indecomposable, non-cyclic groups (the presence of cyclic factors complicates the description of both \(\pi_ 2(M)\) and \(Aut(\pi_ 1(M))\). In this case there are n disjoint, embedded 2-spheres \(S_ 1,...,S_ n\) in M which realize the associated splitting of M as a connected sum and which are known to represent \(\pi_ 1(M)\)-module generators for \(\pi_ 2(M).\) Now given an essential, embedded 2-sphere, S, in M there is a homeomorphism \(h: M\to M\) with h(S) disjoint from \(S_ 1,...,S_ n\). The corresponding automorphism \(\phi =h_*\) of \(\pi_ 1(M)\) is promised by the Kurosh subgroup theorem. The known structure of \(Aut(\pi_ 1(M))\) (in the case under consideration) determines the action of h on \(\pi_ 2(M):\) its matrix must be a product of certain types of elementary matrices and therefore determines the form of \([S]=h_*^{- 1}([S_{i_ 1}]+[S_{i_ 2}]+...)\). The recognition of whether a given matrix has the given form seems, in general, to be difficult. However a necessary condition for an element to be simple is given as is an algorithm, for the case of \(n=3\) factors, to detect simple elements.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references