Sets

A set is a well

A set is a well-defined collection of distinct objects enclosed in curly brackets {}. Elements are denoted using ∈ (belongs to) and ∉ (does not belong

Roster form lists all elements explicitly

Roster form lists all elements explicitly like A = {1, 2, 3}. Set-builder form defines elements by a common property like A = {x : x is a natural numb

Empty set (∅) has no elements

Empty set (∅) has no elements. Finite sets have countable elements. Infinite sets have uncountable elements. Universal set (μ) contains all elements u

Subset (A ⊆ B) means all

Subset (A ⊆ B) means all elements of A are in B. Equal sets (A = B) have exactly the same elements. Every set is a subset of itself, and empty set is

Union (A ∪ B) combines all

Union (A ∪ B) combines all elements from both sets. Intersection (A ∩ B) contains common elements. Difference (A - B) contains elements in A but not i