Mathematics I - Sets

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/14

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering basic set definitions, subset relations, power sets, set operations, algebraic laws, and Cartesian products from Mathematics I.

15 Terms

1
New cards

Set

A collection of distinct objects or elements.

2
New cards

Element

An object contained in a set, denoted by lowercase letters (e.g., a∈Aa \in A indicates that aa is an element of set AA, while a∉Aa \notin A means it is not).

3
New cards

Empty Set

The set that contains no elements, denoted by ∅\emptyset. It is a subset of every set (∅⊆A\emptyset \subseteq A).

4
New cards

Subset

A set AA is a subset of BB if every element of AA is an element of BB, denoted A⊆B:  ⟺  (∀x:x∈A  ⟹  x∈B)A \subseteq B :\iff (\forall x : x \in A \implies x \in B).

5
New cards

Set Equality

Two sets AA and BB are equal if and only if each is a subset of the other: A=B  ⟺  A⊆B and B⊆AA = B \iff A \subseteq B \text{ and } B \subseteq A.

6
New cards

Cardinality

The number of elements in a finite set AA, denoted by ∣A∣|A|, card(A)\text{card}(A), or #A\#A.

7
New cards

Power Set

The set of all subsets of a set AA, denoted P(A):={B∣B⊆A}\mathcal{P}(A) := \{B \mid B \subseteq A\}. If a finite set AA has nn elements, card(P(A))=2n\text{card}(\mathcal{P}(A)) = 2^n.

8
New cards

Intersection

A set operation containing all elements that belong to both set AA and set BB, defined as A∩B:={x∣x∈A and x∈B}A \cap B := \{x \mid x \in A \text{ and } x \in B\}.

9
New cards

Union

A set operation containing all elements that belong to at least one of the sets AA or BB, defined as A∪B:={x∣x∈A or x∈B}A \cup B := \{x \mid x \in A \text{ or } x \in B\}.

10
New cards

Set Difference

The set of all elements of AA that are not elements of BB, denoted A∖BA \setminus B or A−BA - B, defined as A∖B:={x∣x∈A and x∉B}A \setminus B := \{x \mid x \in A \text{ and } x \notin B\}.

11
New cards

Symmetric Difference

The set containing all elements that belong to exactly one of two sets AA and BB, defined as AΔB:=(A∖B)∪(B∖A)A \Delta B := (A \setminus B) \cup (B \setminus A).

12
New cards

Complement

The set containing all elements of a universe UU that are not elements of AA, defined as Ac:={x∈U∣x∉A}=U∖AA^c := \{x \in U \mid x \notin A\} = U \setminus A.

13
New cards

De Morgan's Laws (Sets)

The identities relating unions and intersections via complementation: (A∪B)c=Ac∩Bc(A \cup B)^c = A^c \cap B^c and (A∩B)c=Ac∪Bc(A \cap B)^c = A^c \cup B^c.

14
New cards

Cartesian Product

The set of all ordered pairs (a,b)(a, b) formed from two sets AA and BB, defined as A×B:={(a,b)∣a∈A,b∈B}A \times B := \{(a, b) \mid a \in A, b \in B\}. In general, A×B≠B×AA \times B \neq B \times A.

15
New cards

Element Table

A verification method analogous to truth tables in propositional logic, used to prove set identities by systematically listing element membership (∈\in or ∉\notin) across all combinations.