2 Matching Annotations
  1. Last 7 days
    1. Z orn ’s lemma. Suppose S, < is a partially ordered set with the property that every chain in S has an upper bound. Then S contains amaximal element.

      typo : < should be ≤

    2. The axiom o f choice. Suppose {Si}, i E I, is a family of nonemptysets. Then there is a function / from I into U / Si such that f(i) E Sifor each i e I.

      For any collection of non-empty sets, one can create a set by choosing one element from each set in the given collection.

      There are a variety of other equivalent ways to state this as well as names. One variation is Zorn's lemma.