- Last updated

- Save as PDF

- Page ID
- 242

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}}}\) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

All of mathematics can be seen as the study of relations between collections of objects by rigorous rational arguments. More often than not the patterns in those collections and their relations are more important than the nature of the objects themselves. The power of mathematics has a lot to do with bringing patterns to the forefront and abstracting from the “real” nature if the objects. In mathematics, the collections are usually called sets and the objects are called the elements of the set. Functions are the most common type of relation between sets and their elements and the primary objects of study in Analysis are functions having to do with the set of real numbers. It is therefore important to develop a good understanding of sets and functions and to know the vocabulary used to deﬁne sets and functions and to discuss their properties.

A set is an unordered collection of distinct objects, which we call its elements. \(A\) set is uniquely determined by its elements. If an object a is an element of a set \(A\), we write \(a \in A\), and say that a belongs to \(A\) or that \(A\) contains a. The negation of this statement is written as \(a \not\in A\), i.e., a is not an element of \(A.\) Note that both statements cannot be true at the same time

If \(A\) and \(B\) are sets, they are identical (this means one and the same set), which we write as \(A = B\), if they have exactly the same elements. In other words \(A = B\) if and only if forall \(a \in A\) we have \(a \in B\), and for all \(b \in B\) we have \(b \in A.\) Equivalently, \(A \neq B\) if and only if there is a diﬀerence in their elements: there exists \(a \in A\) such that \(a \not\in B\) or there exists \(b \in B\) such that \(b \not\in A.\)

**Example B.1.1.** We start with the simplest examples of sets.

- The
**empty set**(a.k.a. the**null set**), is what it sounds like: the set with no elements. We usually denote it by \(\emptyset\) or sometimes by \(\{~\}\). The empty set, \(\emptyset\), is uniquely determined by the property that for all \(x\) we have \(x \not\in \emptyset\). Clearly, there is exactly one empty set. - Next up are the
**singletons**. A singleton is a set with exactly one element. If that element is \(x\) we often write the singleton containing \(x\) as \(\{x\}\). In spoken language, ‘the singleton \(x\)’ actually means the set \(\{x\}\) and should always be distinguished from the element \(x: x \neq \) {\(x\)}. A set can be an element of another set but no set is an element of itself (more precisely, we adopt this as an axiom). E.g., \(\{\{x\}\}\) is the singleton of which the unique element is the singleton \(\{x\}\). In particular we also have \(\{x\} \neq \{\{x\}\}.\) - One standard way of denoting sets is by listing its elements. E.g., the set \(\{\alpha, \beta, \gamma\}\) contains the ﬁrst three lower case Greek letters. The set is completely determined by what is in the list. The order in which the elements are listed is irrelevant. So, we have \(\{\alpha, \gamma, \beta\} = \{\gamma, \beta, \alpha\} = \{\alpha, \beta, \gamma\},\) etc. Since a set cannot contain the same element twice (elements are distinct) the only reasonable meaning of something like \(\{ \alpha, \beta, \alpha, \gamma\}\) is that it is the same as \(\{\alpha, \beta, \gamma\}\). Since \(x \neq \{x\}, \{x, \{x\}\}\) is a set with two elements. Anything can be considered as an element of a set and there is not any kind of relation is required of the elements in a set. E.g., the word ‘apple’ and the element uranium and the planet Pluto can be the three elements of a set. There is no restriction on the number of diﬀerent sets a given element can belong to, except for the rule that a set cannot be an element of itself.
- The number of elements in a set may be inﬁnite. E.g., \(\mathbb{Z}, \mathbb{R},\) and \(\mathbb{C}\), denote the sets of all integer, real, and complex numbers, respectively. It is not required that we can list all elements.

When introducing a new set (new for the purpose of the discussion at hand) it is crucial to deﬁne it unambiguously. It is not required that from a given deﬁnition of a set \(A\), it is easy to determine what the elements of \(A\) are, or even how many there are, but it should be clear that, in principle, there is unique and unambiguous answer to each question of the form “is \(x\) an element of \(A\)?”. There are several common ways to deﬁne sets. Here are a few examples.

**Example B.1.2.**

1. The simplest way is a generalization of the list notation to inﬁnite lists that can be described by a pattern. E.g., the set of positive integers \(\mathbb{N} = \{1, 2, 3, \ldots \}.\) The list can be allowed to be bi-directional, as in the set of all integers \(\mathbb{Z} = \{\ldots , -2, -1, 0, 1, 2, \ldots \}.\)

Note the use of triple dots \(\ldots\) to indicate the continuation of the list.

2. The so-called set builder notation gives more options to describe the membership of a set. E.g., the set of all even integers, often denote by \(2 \mathbb{Z}\), is deﬁned by

\[2\mathbb{Z} = \{2a ~|~ a \in \mathbb{Z}\} .\]

Instead of the vertical bar, |, a colon, :, is also commonly used. For example, the open interval of the real numbers strictly between \(0\) and \(1\) is deﬁned by

\[(0, 1) = \{x \in \mathbb{R} : 0 < x < 1\}.\]

**Deﬁnition B.2.1.** Let \(A\) and \(B\) be sets. \(B\) is a subset of \(A\), denoted by \(B \subset A\), if and only if for all \(b \in B\) we have \(b \in A.\) If \(B \subset A\) and \(B \neq A,\) we say that \(B\) is a** proper subset **of \(A.\)

If \(B \subset A\), one also says that \(B\) is contained in \(A\), or that \(A\) contains \(B\), which is sometimes denoted by \(A \supset B.\) The relation \(\subset\) is called** inclusion**. If \(B\) is a proper subset of \(A\) the inclusion is said to be strict. To emphasize that an inclusion is not necessarily strict, the notation \(B \subseteq A\) can be used but note that its mathematical meaning is identical to \(B \subset A.\) Strict inclusion is sometimes denoted by \(B \subsetneq A\), but this is less common.

**Example B.2.2.** The following relations between sets are easy to verify:

- We have \(\mathbb{N} \subset \mathbb{Z} \subset \mathbb{Q} \subset \mathbb{R} \subset \mathbb{C}\), and all these inclusions are strict.
- For any set \(A\), we have \( \emptyset \subset A\), and \(A \subset A.\)
- \((0, 1] \subset (0, 2).\)
- For \(0 < a \leq b, [-a, a] \subset [-b, b].\) The inclusion is strict if \(a < b.\)

In addition to constructing sets directly, sets can also be obtained from other sets by a number of standard operations. The following deﬁnition introduces the basic operations of taken the **union**,** intersection**, and **diﬀerence** of sets.

**Deﬁnition B.2.3**. Let \(A\) and \(B\) be sets. Then

- The
**union**of \(A\) and \(B\), denoted by \(A \cup B\), is deﬁned by \[A \cup B = \{x ~|~ x \in A {\it{~or~}} x \in B\}.\] - The
**intersection**of \(A\) and \(B\), denoted by \(A \cap B\), is deﬁned by \[A \cap B = \{x~ |~ x \in A {\it{~and~}} x \in B\}.\] - The set
**diﬀerence**of \(B\) from \(A\), denoted by \(A \setminus B\), is deﬁned by \[A \setminus B = \{x ~|~ x \in A {\it{~and~}} x \not\in B\}.\]

Often, the context provides a ‘universe’ of all possible elements pertinent to a given discussion. Suppose, we have given such a set of ‘all’ elements and let us call it \(U\). Then, the **complement** of a set \(A\), denoted by \(A^c\) , is deﬁned as \(A^c = U \setminus A.\) In the following theorem the existence of a universe \(U\) is tacitly assumed.

**Theorem B.2.4.** *Let* \(A, B,\) *and* \(C\) *be sets. Then*

- (
*distributivity*) \(A \cap (B \cup C) = (A \cap B) \cup (A \cap C)\)*and*\(A \cup (B \cap C) = (A \cup B) \cap (A \cup C).\) - (
*De Morgan’s Laws*) \((A \cup B)^c = A^c \cap B^c\)*and*\((A \cap B)^c = A^c \cup B^c .\) - (
*relative complements*) \(A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)\)*and*\(A \setminus (B \cap C) = (A \setminus B) \cup (A \setminus C).\)

To familiarize your self with the basic properties of sets and the basic operations if sets, it is a good exercise to write proofs for the three properties stated in the theorem.

The so-called **Cartesian product** of sets is a powerful and ubiquitous method to construct new sets out of old ones.

**Deﬁnition B.2.5**. Let \(A\) and \(B\) be sets. Then the **Cartesian product** of \(A\) and \(B\), denoted by \(A \times B\), is the set of all ordered pairs \((a, b),\) with \(a \in A\) and \(b \in B.\) In other words,

\[A \times B = \{(a, b) ~|~ a \in A, b \in B\} .\]

An important example of this construction is the Euclidean plane \(\mathbb{R}^2 = \mathbb{R} \times \mathbb{R}\). It is not an accident that \(x\) and \(y\) in the pair \((x, y)\) are called the *Cartesian* coordinates of the point \((x, y)\) in the plane.

In this section we introduce two important types of relations: order relations and equivalence relations. A **relation** \(R\) between elements of a set \(A\) and elements of a set \(B\) is a subset of their Cartesian product: \(R \subset A \times B.\) When \(A = B\), we also call \(R\) simply a relation on \(A\).

Let \(A\) be a set and \(R\) a relation on \(A\). Then,

- \(R\) is called
**reﬂexive**if for all \(a \in A, (a, a) \in R.\) - \(R\) is called
**symmetric**if for all \(a, b \in A,\) if \((a, b) \in R\) then \((b, a) \in R.\) - \(R\) is called
**antisymmetric**if for all \(a, b \in A\) such that \((a, b) \in R\) and \((b, a) \in R, a = b.\) - \(R\) is called
**transitive**if for all \(a, b, c \in A\) such \((a, b) \in R\) and \((b, c) \in R\), we have \((a, c) \in R.\)

**Deﬁnition B.3.1.** Let \(R\) be a relation on a set \(A\). \(R\) is an **order relation** if \(R\) is *reﬂexive, antisymmetric, and transitive*. \(R\) is an equivalence relation if \(R\) is *reﬂexive, symmetric, and transitive.*

The notion of subset is an example of an order relation. To see this, ﬁrst deﬁne the** power set** of a set \(A\) as the set of all its subsets. It is often denoted by \({\cal{P}}(A).\) So, for any set \(A, {\cal{P}}(A) = \{B : B \subset A\}.\) The, the inclusion relation is deﬁned as the relation \(R\) by setting

\[R = \{(B, C) \in {\cal{P}}(A) \times {\cal{P}}(A)~ |~ B \subset C\}\]

Important relations, such as the subset relation, are given a convenient notation of the form \(a <symbol> b\), to denote \((a, b) \in R.\) The symbol for the inclusion relation is \(\subset\).

**Proposition B.3.2.** *Inclusion is an order relation. Explicitly,*

- (
*reﬂexive*)*For all*\(B \in {\cal{P}}(A), B \subset B.\) - (
*antisymmetric*)*For all*\(B, C \in {\cal{P}}(A),\)*if*\(B \subset C\)*and*\(C \subset B\),*then*\(B = C.\) - (
*transitive*)*For all*\(B, C, D \in {\cal{P}}(A),\)*if*\(B \subset C\)*and*\(C \subset D,\)*then*\(B \subset D.\)

Write a proof of this proposition as an exercise.

For any relation \(R \subset A \times B\), the **inverse relation**, \(R^{-1} \subset B \times A\), is deﬁned by

\[R^{-1} = \{(b, a) \in B \times A ~| ~(a, b) \in R\}.\]

Let \(A\) and \(B\) be sets. A **function** with **domain** \(A\) and **codomain** \(B\), denoted by \(f : A \rightarrow B\), is relation between the elements of \(A\) and \(B\) satisfying the properties: for all \(a \in A,\) there is a unique \(b \in B\) such that \((a, b) \in f \). The symbol used to denote a function as a relation is an arrow: \((a, b) \in f\) is written as \(a \rightarrow b\) (often also \(a \mapsto b\)). It is not necessary, and a bit cumbersome, to remind ourselves that functions are a special kind of relation and a more convenient notation is used all the time: \(f (a) = b.\) If \(f\) is a function we then have, by deﬁnition, \(f (a) = b\) and \(f (a) = c\) implies \(b = c\). In other words, for each \(a \in A\), there is exactly one \(b \in B\) such that \(f (a) = b.\) \(b\) is called the** image** of a under \(f\) . When \(A\) and \(B\) are sets of numbers, \(a\) is sometimes referred to as the **argument** of the function and \(b = f (a)\) is often referred to as the **value** of \(f\) in \(a\).

The requirement that there is an image \(b \in B\) for all \(a \in A\) is sometimes relaxed in the sense that the domain of the function is a, sometimes not explicitly speciﬁed, subset of \(A\). It important to remember, however, that a function is not properly deﬁned unless we have also given its domain.

When we consider the **graph** of a function, we are relying on the deﬁnition of a function as a relation. The graph \(G\) of a function \(f : A \rightarrow B\) is the subset of \(A \times B\) deﬁned by

\[G = \{(a, f (a)) ~|~ a \in A\}.\]

The **range** of a function \(f : A \rightarrow B\), denoted by \(range (f ),\) or also \(f (A),\) is the subset of its codomain consisting of all \(b \in B\) that are the image of some \(a \in A:\)

\[range (f ) = \{b \in B ~|~ {\rm{~there ~exists~}} a \in A {\rm{~such ~that~}} f (a) = b\}.\]

The **pre-image** of \(b \in B\) is the subset of all \(a \in A\) that have \(b\) as their image. This subset if often denoted by \(f^{-1} (b).\)

\[f^{-1} (b) = \{a \in A ~|~ f (a) = b\}.\]

Note that \(f^{-1} (b) = \emptyset\) if and only if \(b \in B \setminus range (f ).\)

Functions of various kinds are ubiquitous in mathematics and a large vocabulary has developed, some of which is redundant. The term *map* is often used as an alternative for function and when the domain and codomain coincide the term *transformation* is often used instead of function. There is large number of terms for functions in particular context with special properties. The three most basic properties are given in the following deﬁnition.

**Deﬁnition B.4.1.** Let \(f : A \rightarrow B\) be a function. Then we call \(f\)

**injective**(\(f\) is an**injection**) if \(f (a) = f (b)\) implies \(a = b\). In other words, no two elements of the domain have the same image. An injective function is also called**one-to-one**.**surjective**(\(f\) is a**surjection**) if \(range (f ) = B.\) In other words, each \(b \in B\) is the image of at least one \(a \in A\). Such a function is also called**onto**.**bijective**(\(f\) is a**bijection**) if \(f\) is both injective and surjective, i.e.,**one-to-one and onto**. This means that f gives a one-to-one correspondence between all elements of \(A\) and all elements of \(B\).

Let \(f : A \rightarrow B\) and \(g : B \rightarrow C\) be two functions so that the codomain of \(f\) coincides with the domain of \(g\). Then, the **composition** ‘\(g\) after \(f\) ’, denoted by \(g \circ f\) , is the function \(g \circ f : A \rightarrow C,\) deﬁned by \(a \mapsto g(f (a)).\)

For every set \(A\), we deﬁne the **identity map**, which we will denote here by \({\rm{id}}_A\) or \({\rm{id}}\) for short. \({\rm{id}}_A : A \rightarrow A\) is deﬁned by \({\rm{id}}_A (a) = a\) for all \(a \in A\). Clearly, \({\rm{id}}_A\) is a bijection.

If \(f\) is a bijection, it is invertible, i.e., the inverse relation is also a function, denoted by \(f^{ -1} \). It is the unique bijection \(B \rightarrow A\) such that \(f^{-1} \circ f = {\rm{id}}_A\) and \(f \circ f^{-1 }= {\rm{id}}_B\) .

**Proposition B.4.2.** *Let* \(f : A \rightarrow B\) *and* \(g : B \rightarrow C\) *be bijections. Then, their composition* \(g \circ f\) *is a bijection and*

\[(g \circ f )^{-1} = f^{ -1} \circ g^{ -1} .\]

Prove this proposition as an exercise.

## Contributors

- Isaiah Lankham, Mathematics Department at UC Davis
- Bruno Nachtergaele, Mathematics Department at UC Davis
- Anne Schilling, Mathematics Department at UC Davis

Both hardbound and softbound versions of this textbook are available online at WorldScientific.com.

## FAQs

### What are the language of sets? ›

A set may be specified using the **set-roster notation** by writing all of its elements between braces. For example, {1, 2, 3} denotes the set whose elements are 1, 2, and 3. A set is finite if the number of elements in the set can be counted and infinite if there is no end in counting its elements.

**What is the language of set theory? ›**

The formal language of set theory is **the first-order language whose only non-logical symbol is the binary relation symbol \(\in\)**.

**What are the 12 types of sets? ›**

**What is Set, What are Types of Sets, and Their Symbols?**

- Empty Sets. The set, which has no elements, is also called a null set or void set. ...
- Singleton Sets. The set which has just one element is named a singleton set. ...
- Finite and Infinite Sets. ...
- Equal Sets. ...
- Subsets. ...
- Power Sets. ...
- Universal Sets. ...
- Disjoint Sets.

**Why do we need to study the language of sets? ›**

Answer. **It allows us to better understand infinite objects, and the assumptions needed to better control their behavior**.

**What are the 4 types of sets? ›**

Answer: There are various kinds of sets like – **finite and infinite sets, equal and equivalent sets, a null set**. Further, there are a subset and proper subset, power set, universal set in addition to the disjoint sets with the help of examples.

**What are the 3 types of sets? ›**

**What are the types of Sets?**

- Empty Set or Null set: It has no element present in it. ...
- Finite Set: It has a limited number of elements. ...
- Infinite Set: It has an infinite number of elements. ...
- Equal Set: Two sets which have the same members.

**Is set theory part of calculus? ›**

Thus, set theory has become the standard foundation for mathematics, as every mathematical object can be viewed as a set, and **every theorem of mathematics can be logically deduced in the Predicate Calculus from the axioms of set theory**.

**Is set theory math or logic? ›**

Set theory is the branch of **mathematical logic** that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole.

**How hard is set theory? ›**

Although Elementary Set Theory is well-known and straightforward, **the modern subject, Axiomatic Set Theory, is both conceptually more difficult and more interesting**. Complex issues arise in Set Theory more than any other area of pure mathematics; in particular, Mathematical Logic is used in a fundamental way.

**What are the 10 examples of set? ›**

**Examples of sets :**

- The collection of first five natural numbers.
- The collection of vowels of the English Alphabet.
- The collection of whole numbers between 20 and 25.
- The collection of natural numbers between 30 and 35.
- The collection of letters that are there in the word "MANGO".

### What are the basic sets in math? ›

These different types of sets in basic set theory are: **Finite set: The number of elements is finite**. **Infinite set: The number of elements are infinite**. **Empty set: It has no elements**.

**What are the 10 types of sets? ›**

The different types of sets are **empty set, finite set, singleton set, equivalent set, subset, power set, universal set, superset and infinite set**.

**What is the use of set language in real life? ›**

Set language is **a mathematical way of representing a collection of objects**. In our daily life, we often deal with collection of objects like books, stamps, coins, etc. Set language is a mathematical way of representing a collection of objects.

**What is the use of sets in real life? ›**

Why is set important in our daily life? Sets are used **to store a collection of linked things**. They are essential in all fields of mathematics because sets are used or referred to in some manner in every branch of mathematics. They are necessary for the construction of increasingly complicated mathematical structures.

**What are sets in our daily life example? ›**

Examples of Sets in Real Life

Most of us have **collections of our favorite things, groups of objects, like our favorite clothes, favorite foods, favorite people and places**, etc. These are all parts of sets, and we use them every day.

**What are the 5 operations of sets? ›**

Set Operations include **Set Union, Set Intersection, Set Difference, Complement of Set, and Cartesian Product**.

**What are the 7 number sets? ›**

Number Systems: **Naturals, Integers, Rationals, Irrationals, Reals**, and Beyond.

**What are the 2 types of set *? ›**

What are **Finite and Infinite** Types of Sets? Any set that is empty or consists of a definite and countable number of elements is referred to as a finite set. Whereas, sets with uncountable or indefinite numbers of elements are called infinite sets.

**What are elements of a set? ›**

**The objects in a set are called the elements (or members ) of the set**; the elements are said to belong to the set (or to be in the set), and the set is said to contain the elements. Usually the elements of a set are other mathematical objects, such as numbers, variables, or geometric points.

**What are the four properties of sets? ›**

**What are the Basic Properties of Sets?**

- Property 1. Commutative property.
- Property 2. Associative property.
- Property 3. Distributive property.
- Property 4. Identity.
- Property 5. Complement.
- Property 6. Idempotent.

### How many elements in a set? ›

A set may have **infinitely many elements**, so we can't list all of them. For example let E = {all even integers greater than or equal to 1}. We write this as E = {2,4,6,...}, where “...” should be read as “et cetera”.

**Why Is set theory difficult? ›**

Most (but not all) of the difficulties of Set Theory arise from the **insistence that there exist 'infinite sets', and that it is the job of math- ematics to study them and use them**. In perpetuating these notions, modern mathematics takes on many of the aspects of a religion.

**Why is set theory not taught? ›**

"Why is set theory not taught at the outset of math education?" simple: **because the easier topics are done before the harder topics**.

**Is set theory outdated? ›**

**Bourbaki's treatment of set theory and foundational material is outdated**. It's only meant to provide a solid starting point for the 'real math' in the subsequent volumes, not to study set theory in itself.

**Who is the father of sets? ›**

**Georg Cantor**, in full Georg Ferdinand Ludwig Philipp Cantor, (born March 3, 1845, St. Petersburg, Russia—died January 6, 1918, Halle, Germany), German mathematician who founded set theory and introduced the mathematically meaningful concept of transfinite numbers, indefinitely large but distinct from one another.

**What does ⊂ mean? ›**

The symbol "⊆" means "**is a subset of**". The symbol "⊂" means "is a proper subset of". Example. Since all of the members of set A are members of set D, A is a subset of D. Symbolically this is represented as A ⊆ D.

**What is ∈? ›**

The symbol ∈ **indicates set membership and means “is an element of”** so that the statement x∈A means that x is an element of the set A. In other words, x is one of the objects in the collection of (possibly many) objects in the set A.

**What grade do you learn sets in math? ›**

**6th - 8th Grade** Math: Sets - Chapter Summary

They make it easy to review the basics of mathematical set theory, explaining the terms your student has been learning in class.

**Do set designers use math? ›**

Math is used everyday in a wide range of professions, and the theater industry is no exception. **Set designers make frequent use of geometry to calculate angles, lengths, and area of common shapes**, which are then translated into large scale painted or constructed components of the stage.

**What should I study for set? ›**

**SET preparation Books**

- NCERT Books of 9th to 12th class.
- Mental Aptitude by Subhkamna Publications.
- Quantitative Aptitude for Competitive Examinations by R.S. Agarwal.
- Data Interpretation and Logical Reasoning by Arun Sharma.

### How do you solve a set in math? ›

The set formula is given in general as **n(A∪B) = n(A) + n(B) - n(A⋂B)**, where A and B are two sets and n(A∪B) shows the number of elements present in either A or B and n(A⋂B) shows the number of elements present in both A and B.

**What is sets in math grade 7? ›**

A set is **a collection of unique objects** i.e. no two objects can be the same. Objects that belong in a set are called members or elements.

**What is the example of a set function? ›**

Example. **f : N → N, f(x) = x + 2** is surjective. f : R → R, f(x) = x^{2} is not surjective since we cannot find a real number whose square is negative.

**What are the laws of set theory? ›**

**The union of sets A and B is the set A ∪ B = {x : x ∈ A ∨ x ∈ B}**. The intersection of sets A and B is the set A ∩ B = {x : x ∈ A ∧ x ∈ B}. The set difference of A and B is the set A \ B = {x : x ∈ A ∧ x ∈ B}.

**What are the properties of sets? ›**

The six properties of sets are **commutative property, associative property, distributive property, identity property, complement property, idempotent property**.

**What are the symbols in sets? ›**

Symbol | Symbol Name | Meaning |
---|---|---|

{ } | set | a collection of elements |

A ∪ B | union | Elements that belong to set A or set B |

A ∩ B | intersection | Elements that belong to both the sets, A and B |

A ⊆ B | subset | subset has few or all elements equal to the set |

**How many methods are there in sets? ›**

**Two methods** of describing sets are the roster method and set-builder notation. Example: B = {1, 2, 3, 4, 5} Example: C = {x| x ∈ N where x > 4} Example: Write B = {1, 4, 9, 16, …} in set builder notation.

**How many forms of sets are there? ›**

Sets can be classified into many types. Some of which are finite, infinite, subset, universal, proper, singleton set, etc.

**What are the 4 important uses of language? ›**

The functions of language include **communication, the expression of identity, play, imaginative expression, and emotional release**.

**Why is language a weapon? ›**

Some words are like weapons, they wound like bullets, some are like poison, they slowly affect the mind and activate a lethal semantics. **Using language as a tool in order to discriminate against and demonize human beings as members of a hostile group**, can lead to radical political and social consequences in a society.

### What are the 3 uses of language? ›

The primary uses of language are **informative, expressive, and directive** in nature.

**What are the benefits of set? ›**

**Advantages of Set:**

- Set can be used to store unique values in order to avoid duplications of elements present in the set.
- Elements in a set are stored in a sorted fashion which makes it efficient.
- Set are dynamic, so there is no error of overflowing of the set.
- Searching operation takes O(logN) time complexity.

**What is the main characteristic of a set in mathematics? ›**

The foremost property of a set is that **it can have elements, also called members**. Two sets are equal when they have the same elements. More precisely, sets A and B are equal if every element of A is an element of B, and every element of B is an element of A; this property is called the extensionality of sets.

**What are the common sets? ›**

Name | Symbol | Elements of Number Set |
---|---|---|

Composite Numbers | P′ | {4,6,8,9,12,14,15,16,18,20,21,22,23,24,25,26,28,30,32,33,34,35,36,…} |

Whole Numbers | W | {0,1,2,3,4,5,…} |

Integer Numbers | Z | {0,±1,±2,±3,±4,±5,…} |

Rational Numbers | Q | {x∣x=pq,q≠0,p∈Z,q∈Z} |

**What is our universal set? ›**

The universal set U consists of **all natural numbers**, such that, U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10,….}. Therefore, as we know, all the even and odd numbers are a part of natural numbers. Therefore, Set U has all the elements of Set A and Set B.

**What is set Give 5 examples? ›**

Expert-Verified Answer

The collection of first five natural numbers. The collection of vowels of the English Alphabet. The collection of whole numbers between 20 and 25. The collection of natural numbers between 30 and 35.

**What are the 5 sets of numbers? ›**

**Types of numbers**

- Natural Numbers (N), (also called positive integers, counting numbers, or natural numbers); They are the numbers {1, 2, 3, 4, 5, …}
- Whole Numbers (W). ...
- Integers (Z). ...
- Rational numbers (Q). ...
- Real numbers (R), (also called measuring numbers or measurement numbers).

**What is set in simple language? ›**

A set is **a collection of objects or groups of objects**. These objects are often called elements or members of a set. For example, a group of players in a cricket team is a set.

**What language did Jesus speak? ›**

Most religious scholars and historians agree with Pope Francis that the historical Jesus principally spoke a **Galilean dialect of Aramaic**.

**What language did Adam and Eve speak? ›**

The **Adamic language**, according to Jewish tradition (as recorded in the midrashim) and some Christians, is the language spoken by Adam (and possibly Eve) in the Garden of Eden.

### What is the 4th hardest language? ›

4. **Russian**. Ranking fourth on our list of hardest languages to learn, Russian uses a Cyrillic alphabet — made up of letters both familiar and unfamiliar to us.

**How do we use sets in real life? ›**

In everyday life, using sets simply implies **gathering a bunch of items that we desire or don't want**. 1) As an example: A grouping of music from your playlist. Sets aid in the identification of groupings of similar things. Set operations, such as relations and functions, are used to link and operate with sets.

**How many types of sets are there in math? ›**

Q. 3 How many types of sets are there? Ans. 3 The different types of sets are **empty set, finite set, singleton set, equivalent set, subset, power set, universal set, superset and infinite set**.

**What type of number is 13? ›**

Whole numbers are the set of natural numbers including 0 (zero) and all positive numbers whereas, excluding integers, decimals, and fractions. Example – 0, 1, 2, 3, 4, 5, 6….. etc. Therefore 13 is a **whole number** because 13 is a part of all the natural numbers in the number system.

**What is a set of 10 called? ›**

Usage and terms

A collection of ten items (most often ten years) is called **a decade**. The ordinal adjective is decimal; the distributive adjective is denary.

**What Is set language example? ›**

Set language is **a mathematical way of representing a collection of objects**. Study the problem: 16 students play only Cricket, 18 students play only Volley ball and 3 students play both Cricket and Volley ball, while 2 students play neither Cricket nor Volley ball. Totally 39 students are there in a class.