Rado-Edmonds Greedy Theorem for Matroids is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite set, and let be an independence system, meaning that and whenever , one has . For a weight function and a linear ordering of in nonincreasing order of weight, the greedy algorithm scans the elements in that order and adds.