A combinatorial proof of the Rogers–Ramanujan and Schur identities

We give a combinatorial proof of the first Rogers–Ramanujan identity by using two symmetries of a new generalization of Dysonʹs rank. These symmetries are established by direct bijections.