Skip to content

Mathematics · Ch 1 — Sets, Relations and Functions

Sets

1.2

Sets

Sets recap. A set is a well-defined, distinguishable collection of objects: given any object, we must be able to decide definitively whether it belongs to the collection or not. "The collection of all beautiful flowers in Ooty Rose Garden" is not a set (beauty is not sharply defined), but "the collection of all red flowers in Ooty Rose Garden" is a set. Likewise "old men in Tamil Nadu" is not well-defined, but "men in Tamil Nadu older than 70" is.

Membership across sets. The symbol ∈\in normally sits between an element and a set, but it is meaningful to write A∈BA\in B when AA itself is an element of BB (i.e. BB contains the set AA as one of its members). For example, if A={1,2}A=\{1,2\} and B={1,{1,2},3,4}B=\{1,\{1,2\},3,4\}, then A∈BA\in B, because the object {1,2}\{1,2\} is literally one of BB's four listed elements.

Subsets.

  • The empty set ∅\varnothing (or { }\{\ \}) has no elements.
  • A⊆BA\subseteq B means every element of AA is an element of BB; then AA is a subset of BB and BB is a superset of AA.
  • A⊆BA\subseteq B and B⊆AB\subseteq A together force A=BA=B.
  • For any set AA: ∅⊆A\varnothing\subseteq A and A⊆AA\subseteq A -- these are the trivial subsets of AA. A⊆AA\subseteq A in particular makes AA its own improper subset.
  • AA is a proper subset of BB (A⊊BA\subsetneq B) if A⊆BA\subseteq B and A≠BA\ne B: every element of AA is in BB, and BB has at least one extra element.
  • The standard chain of number systems is N⊂W⊂Z⊂Q⊂RN\subset W\subset Z\subset Q\subset R, where NN = natural numbers, WW = non-negative integers, ZZ = integers, QQ = rationals, RR = reals. The irrationals are a subset of RR but of none of N,W,Z,QN,W,Z,Q.

Union and intersection.

A∪B={x:x∈A or x∈B},A∩B={x:x∈A and x∈B}.A\cup B=\{x:x\in A \text{ or } x\in B\},\qquad A\cap B=\{x:x\in A \text{ and } x\in B\}.

AA and BB are disjoint if A∩B=∅A\cap B=\varnothing.

Indexed union/intersection. Just as ∑i=1nai\sum_{i=1}^na_i abbreviates a1+a2+⋯+ana_1+a_2+\cdots+a_n, we write

⋃i=1nAi={x:x∈Ai for some i},⋂i=1nAi={x:x∈Ai for each i}\bigcup_{i=1}^nA_i=\{x:x\in A_i\text{ for some }i\},\qquad \bigcap_{i=1}^nA_i=\{x:x\in A_i\text{ for each }i\}

for A1∪A2∪⋯∪AnA_1\cup A_2\cup\cdots\cup A_n and A1∩A2∩⋯∩AnA_1\cap A_2\cap\cdots\cap A_n respectively.

Power set. For a set AA, the power set P(A)={B:B⊆A}P(A)=\{B:B\subseteq A\} is the set of all subsets of AA (including ∅\varnothing and AA itself). If n(A)=nn(A)=n, then n(P(A))=2nn(P(A))=2^n.

Universal set and complement. All sets in a given discussion are usually thought of as subsets of one fixed universal set UU. If A⊆UA\subseteq U, the complement of AA is A′=Ac={x:x∈U and x∉A}A'=A^c=\{x:x\in U\text{ and }x\notin A\}.

Set difference and symmetric difference.

A−B=A∖B={a:a∈A and a∉B}.A-B=A\setminus B=\{a:a\in A\text{ and }a\notin B\}.

Immediate consequences: U−A=A′U-A=A'; A−A=∅A-A=\varnothing; ∅−A=∅\varnothing-A=\varnothing; A−∅=AA-\varnothing=A; A−U=∅A-U=\varnothing. …