Analogue of the Bruhat decomposition for algebraic monoids. II: The length function and the trichotomy (Q1895645)

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 783943
Language Label Description Also known as
default for all languages
No label defined
    English
    Analogue of the Bruhat decomposition for algebraic monoids. II: The length function and the trichotomy
    scientific article; zbMATH DE number 783943

      Statements

      Analogue of the Bruhat decomposition for algebraic monoids. II: The length function and the trichotomy (English)
      0 references
      0 references
      11 September 1995
      0 references
      This is a continuation of part I [J. Algebra 101, 303-338 (1986; Zbl 0595.20064)] where \(B \times B\) orbits on a reductive monoid \(M\) were studied. Let \(M\) be a reductive monoid with unit group \(G\) and let \(B \subseteq G\) be a Borel subgroup with maximal torus \(T\). Then \(B \times B\) orbits can be identified with a finite monoid \(\mathcal R\) defined by: \({\mathcal R} = R/T\) where \(R = \overline {N_G(T)} \subseteq M\) (Zariski closure). A length function on \(\mathcal R\) is introduced and its properties are established. This leads to the set of order preserving elements \(\gamma \subseteq {\mathcal R}\). A varied assortment of results about the \(B \times B\) orbits on \(M\) are obtained from the main theorem: Any \(r \in {\mathcal R}\) can be uniquely written as \(r = r_+ r_0 r_-\), where \(r{\mathcal J}\) \(r_+{\mathcal J} r_-\), \(r_+, r_- \in \gamma\) and \(BHB = H\), where \(H\) is the \(\mathcal H\)-class of \(r_0\) in \(M\).
      0 references
      Green relations
      0 references
      reductive monoid
      0 references
      unit group
      0 references
      Borel subgroup
      0 references
      maximal torus
      0 references
      orbits
      0 references
      finite monoid
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references