Introduction to Number Systems
Introduction to Number Systems
Definition of a Set
A set is defined as any collection of objects specified in such a way that we can determine whether a given object is or is not a member of the collection.
Key Points
Sets are denoted by capital letters such as π΄, π΅, πΆ, etc.
Each object within a set is referred to as an element or member of that set.
Sets can be described in the following ways:
Roster Notation: Listing all elements between braces.
Example: π΄ = {1, 2, 3}.
The notation 2 β π΄ indicates that 2 is an element of set π΄, while 4 β π΄ indicates that 4 is not a member of this set.
Set-builder Notation: Enclosing a rule within braces.
Example: π΅ = {π₯ β β | 1 β€ π₯ β€ 5}.
This notation expresses that π΅ includes all natural numbers π₯ that satisfy the condition of being between 1 and 5, which can also be written in Roster Notation as π΅ = {1, 2, 3, 4, 5}.
A set can be classified as finite or infinite:
A finite set has a countable number of elements; for instance, π΄ = {1, 2, 3} is finite.
An infinite set does not end; for example, πΆ = {2, 4, 6, 8, 10, β¦} is infinite.
When listing a set, elements are not repeated.
Special Types of Sets
Empty Set (Null Set): A set with no elements, denoted by either {} or β .
Equality of Sets
Two sets π΄ and π΅ are equal if they contain the same elements.
For example, if π΄ = {1, 2, 3} and π΅ = {3, 1, 2}, then π΄ = π΅ since both sets comprise the same elements.
Types of Numbers
Natural numbers (β): The set of positive integers {1, 2, 3, β¦}.
Integers (β€): The set of whole numbers β¦, -3, -2, -1, 0, 1, 2, 3, β¦
Rational numbers (β): Numbers that can be expressed in the form , where and .
Examples include -, 0.1, , 2, -10, 0, etc.
Irrational numbers (β): Numbers that cannot be written as the fraction of integers, such as .
Real numbers (β): The union of rational and irrational numbers (β βͺ β).
Note
The default set for this course will be the set of real numbers: .
Relational Symbols
Equal to ( = ): if and are the same.
Not equal to ( β ): if and are not the same.
Less than ( < ): x < y when is smaller than .
Greater than ( > ): x > y when is larger than .
Less than or equal to ( β€ ): when is either smaller than or equal to .
Greater than or equal to ( β₯ ): when is either larger than or equal to .
Implies ( β ): means that if is true, then is true.
If and only if ( β ): means that if is true, then is also true, and vice versa.
Set Operations
Union ( βͺ ): The union of two sets includes elements in either set:
if or .
Example:
Let π΄ = {1, 2, 3}, π΅ = {3, 4, 5}, πΆ = {6}.
Then, and .
Intersection ( β© ): The intersection of two sets contains elements common to both sets:
if and .
Example:
Using previous sets, , while .
Difference ( β ): The difference of two sets includes elements that are in one set but not the other:
is true if and .
Example:
For sets π΄ and π΅ as stated previously, and .
Subset ( β ): A set π΄ is a subset of set π΅ if every element of π΄ is also an element of π΅:
Example:
Let π΄ = {1, 2, 3} and π΅ = {1, 2, 3, 4, 5}. Thus, , but .
Important Notes on Subsets
Two sets π΄ and π΅ are equal if both and hold true.
The relationship between number sets: .
The union of rational numbers with irrational numbers results in the real numbers: .
The Universal Set (U) is the set of all elements under consideration in a particular problem. All other sets must be subsets of .
Complement: The complement of a set π΄ (relative to the Universal Set π), denoted as π΄β² or π΄αΆ, contains all elements in π that are not in π΄:
Symbolically, this is represented as π΄β² = {π₯ β π | π₯ β π΄}.
Example:
If and , then .
Important property: .
Proper Subset ( β ): A set π΄ is a proper subset of set π΅ if every element of π΄ is contained in π΅, and there exists at least one element in π΅ that is not in π΄:
Example:
With π΄ = {1, 2, 3} and π΅ = {1, 2, 3, 4, 5}, then it holds that .