These properties can be used as one of the alternative definitions of a finite matroid: if (E,r) satisfies these properties, then the independent sets of a matroid over E can be defined as those subsets A of E with r(A)=|A|. In the language of partially ordered sets, such a matroid structure is equivalent to the geometric lattice whose elements are the subsets A\subset M, partially ordered by inclusion.
