A set in Python represents an unordered collection of distinct elements. It is widely used for removing duplicates and performing mathematical operations like union, intersection, and difference. Sets are mutable but only store hashable, immutable objects.

Creation and Initialization

Creating a set requires careful syntax. Curly braces {} define a dictionary, not a set. An empty set must be created with the set() constructor:

empty_dict = {}
print(type(empty_dict) is dict)   # True

single_set = {100}
print(isinstance(single_set, set))  # True

# Correct empty set
my_set = set()
print(my_set)   # set()

You can also build a set from any iterable:

chars = set("abracadabra")
print(chars)   # possibly {'a', 'r', 'b', 'c', 'd'}

Core Properties

• Uniqueness: Duplicate elements are automatically eliminated. Adding an existing element has no effect.
• Unordered nature: There is no guarantee about iteration order. While small inetgers may appear sorted due to hashing details, this behavior should not be relied upon.
• No key‑value pairs: Unlike dictionaries, sets contain only elemetns. There are no associated keys or values; you simply test for membership.

sample = {5, 2, 8, 2, 1}
print(sample)   # output order is arbitrary, e.g., {1, 2, 5, 8}

sample.add(5)
print(sample)   # {1, 2, 5, 8} – no duplication

Modifying a Set

Adding Elements

• add(elem) inserts a single element.
• update(iterable) merges all elements from another collection.

fruits = {'apple', 'banana'}
fruits.add('cherry')
fruits.add('apple')
print(fruits)   # {'banana', 'cherry', 'apple'}

fruits.update({'banana', 'orange', 'grape'})
print(fruits)   # {'orange', 'grape', 'banana', 'cherry', 'apple'}

Removing Elements

Three methods handle deletion with different error behaviours:

• discard(elem) silently ignores missing elements.
• remove(elem) raises KeyError if the element is absent.
• pop() removes and returns an arbitrary element; raises KeyError on an empty set.

data = {10, 20, 30}
data.discard(20)
print(data)     # {10, 30}
data.discard(40)  # no error

data = {10, 20, 30}
data.remove(20)
# data.remove(40)  # KeyError

removed = data.pop()
print(removed, data)  # popped value and remaining set

Set Algebra Operations

Intersection

Common elements of two sets are returned by intersection(). The intersection_update() variant modifies the caller in place.

group_a = {1, 2, 3}
group_b = {3, 4, 5}
common = group_a.intersection(group_b)
print(common)   # {3}

group_a.intersection_update(group_b)
print(group_a)  # {3} – group_a is now the intersection

Union

All unique elements from both sets are26 combined using union().

odds = {1, 3, 5}
evens = {2, 4, 6}
all_nums = odds.union(evens)
print(all_nums)  # {1, 2, 3, 4, 5, 6}

Difference

Elements present in one set but not the other are07 extracted by difference(). Again, an _update version exists.

x = {1, 2, 3}
y = {3, 4, 5}
diff = x.difference(y)
print(diff)   # {1, 2}

x.difference_update(y)
print(x)      # {1, 2}

These operations also support operator syntax (&, |, -, ^), but the method forms are explicit and easier to read for beginners. Understanding these fundamentals provides a solid foundation for working with sets in Python efficiently.