OurBigBook About$ Donate
 Sign in Sign up

Finite union (⋃j=1m​Aj​)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Set Set union
Created 2026-10-14 Updated 2026-10-25  0 By others on same topic  0 Discussions Create my own version
A finite union is a union of finitely many sets. The indexing set is finite; its member sets need not be finite sets. The union of an empty indexed family is the empty set.

 Ancestors (7)

  1. Set union
  2. Set
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (6)

  • Cofinite topology
  • Finite union
  • Past exam of the options I course of the University of Oxford / 2004 / E / E1 / Solution
  • Past exam of the topology course of the University of Oxford / 2014 / 1 / b / iv / Solution
  • Past exam of the topology course of the University of Oxford / 2017 / 2 / a / i / Solution
  • Pasting lemma for closed subspaces

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook