Study sheet: Set Theory Fundamentals

Course Outline

  1. Sets and Their Elements
  2. Finite and Infinite Sets
  3. Subsets and Universal Sets
  4. Set Operations
  5. Set Algebra and Relations
  6. Cardinalities and Counting
  7. Translating Set Descriptions

1. Sets and Their Elements

Key Concepts & Definitions

  • Set : Georg Cantor β€” a collection of clearly distinguished objects considered as a whole.
  • Element membership : The notation a∈Aa \in A means that a belongs to set A, whereas aβˆ‰Aa \notin A means that a does not belong to set A.
  • Set equality : Two sets are equal when they contain exactly the same elements, regardless of the order in which those elements are written.

Essential Points

πŸ“Œ A set can be specified in roster form by listing its elements, or in descriptive form by stating the condition satisfied by its elements.

Memory Hook

Roster form lists elements; descriptive form states a membership condition.

2. Finite and Infinite Sets

β˜… Must-know

πŸ“Œ A finite set has a listing that eventually stops, whereas an infinite set has a listing that never stops.

Further detail

  • The natural divisors of 6 form the finite set T6={1,2,3,6}T_6=\{1{,}2{,}3{,}6\}, while the natural multiples of 6 form the infinite set V6={6,12,18,… }V_6=\{6{,}12{,}18,\dots\}.

Memory Hook

Finite sets stop being listed; infinite sets continue indefinitely.

3. Subsets and Universal Sets

Key Concepts & Definitions

  • Subset : The notation AβŠ‚BA\subset B means that every element of A also belongs to B, and B is then a superset of A.
  • Empty set : The empty set contains no elements and is a subset of every set.
  • Universal set : The universal set G contains all objects allowed in the set discussion, and the sets under consideration are subsets of G.

Essential Points

  • A set with n elements has 2n2^n subsets.

Memory Hook

Picture every subset as a smaller circle inside the universal set G.

4. Set Operations

Key Concepts & Definitions

  • Intersection : The intersection A∩BA\cap B consists of the elements that belong to both A and B.
  • Union : The union AβˆͺBA\cup B consists of the elements that belong to A, to B, or to both.
  • Set difference : The difference Aβˆ–BA\setminus B consists of the elements that belong to A but not to B.
  • Complement : The complement of A consists of all elements of the universal set G that do not belong to A.

Memory Hook

Intersection means both, union means at least one, and difference means the first but not the second.

5. Set Algebra and Relations

β˜… Must-know

πŸ“Œ The identities A∩A=AA\cap A=A, AβˆͺA=AA\cup A=A, and Aβˆ–A=βˆ…A\setminus A=\varnothing simplify repeated set operations.

Further detail

πŸ“Œ The identities A∩(AβˆͺB)=AA\cap(A\cup B)=A and Aβˆͺ(Aβˆ–B)=AA\cup(A\setminus B)=A express absorption in set algebra.

πŸ“Œ Two sets are disjoint when their intersection is empty, written A∩B=βˆ…A\cap B=\varnothing.

Memory Hook

Simplify with intersection, union, difference, and complement.

6. Cardinalities and Counting

Essential Points

πŸ“ Formula β€” For finite sets, the cardinality of a union satisfies ∣AβˆͺB∣=∣A∣+∣Bβˆ£βˆ’βˆ£A∩B∣|A\cup B|=|A|+|B|-|A\cap B|.

πŸ“ Formula β€” The cardinality of a difference satisfies ∣Aβˆ–B∣=∣Aβˆ£βˆ’βˆ£A∩B∣|A\setminus B|=|A|-|A\cap B|.

  • πŸ”„ The counting process is:
    1. count the first set
    2. count the second set
    3. subtract the overlap
    4. obtain the union

Memory Hook

Overlap reduces the union: counting A and B together requires subtracting their intersection.

7. Translating Set Descriptions

β˜… Must-know

  • A set can be converted from descriptive form to roster form by identifying every object that satisfies the stated condition and listing those objects.

Further detail

  • A set can be converted from roster form to descriptive form by identifying the common property of all listed elements and expressing that property as a condition.

  • The set {1,3,7,21}\{1{,}3{,}7{,}21\} can be described as the set of natural divisors of 21.

  • The set {1,4,9,16,25,… }\{1{,}4{,}9{,}16{,}25,\dots\} can be described as the set of natural square numbers.

Memory Hook

Move between words, roster notation, descriptive notation, and set terms.

Synthesis Tables

Basic Set Operations

OperationMeaningNotation
IntersectionIn both A and BA∩BA\cap B
UnionIn A, B, or bothAβˆͺBA\cup B
DifferenceIn A but not BAβˆ–BA\setminus B
ComplementIn G but not AGβˆ–AG\setminus A

Test your knowledge

Test your knowledge on Set Theory Fundamentals with 19 multiple-choice questions with detailed corrections.

1. Which description best defines a set in mathematics?

2. If a∈Aa \in A is true, what does it tell you about aa?

Take the quiz β†’

Review with flashcards

Memorize the key concepts of Set Theory Fundamentals with 34 interactive flashcards.

What is a set according to Georg Cantor?

A collection of clearly distinguished objects considered as a whole.

What does the notation a∈Aa \in A signify?

That a belongs to set A.

What does the notation aβˆ‰Aa \notin A signify?

That a does not belong to set A.

See flashcards β†’

Similar courses

Create your own study sheets

Import your course and AI generates sheets, quizzes and flashcards in 30 seconds.

Sheet generator