Free Online Flashcard Deck

02 Sets and Set Operations Free Online FlashCards

Study 02 Sets and Set Operations with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.

12 cards
01
Front

What is a set?

Back

A set is a well-defined collection of distinct objects called elements or members; order and repetition do not matter.

02
Front

What does A⊆BA\subseteq B mean?

Back

The notation A⊆BA\subseteq B means every element of AA is also an element of BB.

03
Front

How can set equality be proved?

Back

Two sets are equal exactly when they contain the same elements. Equivalently, A=BA=B iff A⊆BA\subseteq B and B⊆AB\subseteq A.

04
Front

What does set union contain?

Back

The union A∪BA\cup B contains every element that belongs to AA, to BB, or to both.

05
Front

What does set intersection contain?

Back

The intersection A∩BA\cap B contains exactly the elements common to both AA and BB.

06
Front

What is A∖BA\setminus B?

Back

The difference A∖BA\setminus B contains elements that are in AA but not in BB. In general, A∖B≠B∖AA\setminus B\ne B\setminus A.

07
Front

What is the complement AcA^c?

Back

Relative to a specified universal set UU, the complement is Ac=U∖AA^c=U\setminus A: all elements of UU that are not in AA.

08
Front

What is the Cartesian product A×BA\times B?

Back

The Cartesian product A×BA\times B is the set of ordered pairs (a,b)(a,b) with a∈Aa\in A and b∈Bb\in B.

09
Front

How large is A×BA\times B?

Back

For finite sets, ∣A×B∣=∣A∣∣B∣|A\times B|=|A||B|. If ∣A∣=m|A|=m and ∣B∣=n|B|=n, there are mnmn ordered pairs.

10
Front

What is the power set P(A)\mathcal{P}(A)?

Back

The power set P(A)\mathcal{P}(A) is the set of all subsets of AA, including ∅\varnothing and AA itself.

11
Front

How many subsets does an nn-element set have?

Back

If ∣A∣=n|A|=n, then ∣P(A)∣=2n|\mathcal{P}(A)|=2^n, because each element is either included in or omitted from a subset.

12
Front

What does an indexed union represent?

Back

An indexed union contains elements belonging to at least one family member: ⋃i∈IAi={x∣∃i∈I, x∈Ai}\bigcup_{i\in I}A_i=\{x\mid\exists i\in I,\,x\in A_i\}.