Before revision:  We define the least upper bound and the greatest lower bound for both sides of the matching market , and we prove that with these binary operations the set of random stable matchings forms two dual lattices.
After revision:  We define the least upper bound and the greatest lower bound for both sides of the matching market . Then, we prove that with these binary operations the set of random stable matchings forms two dual lattices.