Maps into Dynkin diagrams arising from regular monoids

Abstract

AbstractIt has been shown by one of the authors that the system of idempotents of monoids on a group G of Lie type with Dynkin diagram Γ can be classified by the following data: a partially ordered set U with maximum element 1 and a map λ: U → 2Γ with λ(1) = Γ and with the property that for all J1, J2, J3 ∈ U with J1 > J2 > J3, any connected component of λ(J2) is contained in either λ(J1) or λ(J3). In this paper we show that λ comes from a regular monoid if and only if the following conditions are satisfied: (1) U is a ∧-semilattice; (2) If J1, J2 ∈ U, then λ(J1)∧ λ(J2) λ(J1 ∧ J2); (3) If θ ∈ Γ, J ∈ U, then max{J1 ∈ U|J1 > J, θ ∈ λ (J1)} exists; (4) If J1, J2 ∈ U with J1 > J2 and if X is a two element discrete subset of λ(J1) ∪ λ(J2), then X λ(J) for some J ∈ UJ with J1 > J > J2.