We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with the graph structure coming from the weak order. The main geometric argument is valid for any Coxeter group, even infinite ones for which the descent algebra does not exist.