The objects in a collection are dubbed the set"s elements or members. They room usually listed inside braces. We write $x \in A$ if $x$ is an facet (member) that a collection $A$.
You are watching: The number of distinct elements in a set is called the
$\1,2,3\$ is a set with $3$ elements. That is the same as the set $\1,3,2\$ (order does no matter) and also the set $\1,1,2,3,3,3,3\$ (repetition does no matter). Typically, every objects room the exact same (for example, numbers), however they perform not need to be: $\ 1, 3, \textred, \textblue, \textJohn \$ is a set.
Ellipses are provided when a pattern is clear: $\1,2,3,4,\ldots,50\$ is the collection of all integers indigenous $1$ to $50$, inclusive.Some sets we usage a lot:$\mathbbR$ is the collection of real numbers$\mathbbN$ is the collection of organic numbers$\mathbbZ$ is the set of integers$\mathbbQ$ is the collection of reasonable numbers
It is feasible to have actually a collection with no elements: $\\$. This is the empty set and is generally denoted $\emptyset$. This is not the exact same as $\ \emptyset \$, i beg your pardon is a collection with one facet (that wake up to be a (empty) set).
The variety of distinct aspects in a collection $S$ is called its cardinality and is denoted $|S|$. If $|S|$ is limitless (for example, $\mathbbZ$), us say the collection is infinite.
One common way to specify a collection is set builder notation. Below are 2 examples:$\mathbbR = \ r \;$$O = \ x \;$
Set OperationsSeveral operations can be performed on sets.Union: provided two set $A$ and also $B$, the union $A \cup B$ is the set of all aspects that are in either $A$ or $B$. For example, if $A = \ 1,3,5 \$ and $B = \ 2,3,6 \$, climate $A \cup B = \ 1,2,3,4,5,6 \$. Note that $A \cup B = \\; (x \in A) \lor (x \in B) \$.
A set $A$ is a subset that a set $B$ if every facet of $A$ is an element of $B$. We compose $A \subseteq B$. Another method of speak this is that $A \subseteq B$ if and also only if $\forall x\;(x \in A \rightarrow x \in B)$.
For any set S, we have:$\emptyset \subseteq S$
Proof: Must display that $\forall x\;(x \in \emptyset \rightarrow x \in S)$. Since $x \in \emptyset$ is constantly false, the implicit is always true. This is an example of a trivial or vacuous proof.$S \subseteq S$
Proof: Must present that $\forall x\;(x \in S \rightarrow x \in S)$. Deal with an element $x$. Us must show that $x \in S \rightarrow x \in S$. This implication is indistinguishable to $x \in S \lor x \notin S$, i m sorry is a tautology. Therefore, by global Generalization, $S \subseteq S$.If $A \subseteq B$ and $A \neq B$, then us say $A$ is a proper subset of $B$ and also write $A \subset B$.
The power set of a collection $A$ is the set of all subsets of $A$, denoted $\mathcalP(A)$. For example, if $A = \1,2,3\$, then$\mathcalP(A) = \\emptyset,\1\,\2\,\3\,\1,2\,\2,3\,\1,3\,\1,2,3\\$
Notice that $|\mathcalP(A)| = 2^$.
See more: If Somebody Says " You The Real Mvp Meaning, For Example
Two sets are equal if they contain the exact same elements. One means to present that 2 sets $A$ and also $B$ are equal is to display that $A \subseteq B$ and $B \subseteq A$:\beginarraylllA \subseteq B \land B \subseteq A & \equiv & \forall x\;((x \in A \rightarrow x \in B) \land (x \in B \rightarrow x \in A)) \\&\equiv & \forall x\;(x \in A \leftrightarrow x \in B) \\&\equiv & A = B \\\endarray
Note: it is not enough to simply examine if the sets have the exact same size! lock must have actually exactly the very same elements. Remember, though, the order and also repetition carry out not matter.