Encyclopedia Britannica
Encyclopedia Britannica
SUBSCRIBE
SUBSCRIBE
SUBSCRIBE TO PREMIUM
  • Home
  • Biographies
  • Animals & Nature
  • History & Society
  • Science & Tech
  • Geography & Travel
  • Arts & Culture
  • ProCon
  • Money
  • Games & Quizzes
  • Videos
  • Today in History
  • Dictionary
  • New Articles
Biographies
  • Browse Biographies
Animals & Nature
  • Birds, Reptiles & Other Vertebrates
  • Environment
  • Fossils & Geologic Time
  • Insects & Other Invertebrates
  • Mammals
  • Plants
History & Society
  • History
  • Philosophy & Religion
  • Politics, Law & Government
  • Society & Social Issues
Science & Tech
  • Health & Medicine
  • Science
  • Technology
Geography & Travel
  • Geography & Travel
Arts & Culture
  • Entertainment & Pop Culture
  • Literature
  • Sports & Recreation
  • Visual Arts
  • Image Galleries
  • Podcasts
  • Summaries
  • Top Questions
  • Lists and Stories
  • Britannica Kids
Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos
closed under unions of chains
References
Britannica AI Icon

closed under unions of chains

mathematics
Also known as: sets closed under unions of chains
Written by
The Information Architects of Encyclopaedia Britannica

The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.

The Information Architects of Encyclopaedia Britannica

Learn about this topic in these articles:

  • Zorn’s lemma

    …is said to be “closed under unions of chains” if whenever a chain C is included in S (i.e., C ⊆ S), then its union belongs to S (i.e., ∪ Ck ∊ S). A member of S is said to be maximal if it is not a subset of…

    Read More

    …is said to be “closed under unions of chains” if whenever a chain C is included in S (i.e., C ⊆ S), then its union belongs to S (i.e., ∪ Ck ∊ S). A member of S is said to be maximal if it is not a subset of…

    Read More