Scribd
Upload
206 views23 pages

4-The Four Basic Concepts

The document defines four basic concepts: sets, notation for sets, subsets, and functions. It provides examples and explanations for each concept. Sets are collections of distinct objects that are considered as a single object. Notation lists the elements of a set separated by commas within curly brackets. A subset contains elements that are also contained in the original set. A function relates an input to a single output, with the input coming before the output in an ordered pair.

Uploaded by

Samantha Kaye Tupos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
206 views23 pages

4-The Four Basic Concepts

The document defines four basic concepts: sets, notation for sets, subsets, and functions. It provides examples and explanations for each concept. Sets are collections of distinct objects that are considered as a single object. Notation lists the elements of a set separated by commas within curly brackets. A subset contains elements that are also contained in the original set. A function relates an input to a single output, with the input coming before the output in an ordered pair.

Uploaded by

Samantha Kaye Tupos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

The Four Basic

Concepts
Sets
A collection of distinct objects,
considered as an object in its own
right.
Example:
The items you wear: hat, shirt, jacket,
pants, and so on.
Types of fingers: Thumb, Index,
Middle, Ring, and Pinky.
Notation
 There is a fairly simple notation for sets. We
simply list each element (or "member")
separated by a comma, and then put some
curly brackets around the whole thing:
Example:
 {socks, shoes, watches, shirts, ...}
◦ We call an Infinite set
 {thumb, index, middle, ring, pinky}

◦ We call an Finite set

the set of letters:


{a, b, c, ..., x, y, z}
Example:
 Certain sets of numbers are so
frequently referred to that they are
given special symbolic names.

Symbol Set
ℝ Set of all real numbers
ℤ Set of all integers
ℚ Set of all rational numbers, or
quotients of integers
Set-builder Notation

Notes:
• The x is just a variable, it could be anything.
• Some people use “:” instead of "|“, so they
write { x : x > 0 }
Example:

“The set of all x’s is an element of real


number such that x is greater than or
equal 3”
Subsets
 When we define a set, if we take
pieces of that set, we can form what is
called a subset.
Example:
The set A={1, 2, 3, 4, 5}
• A subset of this is B={1, 2, 3}. Another
subset is C={3, 4} or even another is
D={1}, etc.

Symbolically:
 A⊆B means that “For all elements x, if x∈A then x ∈B.
Example:
 Is A a subset of B, where A = {1, 3, 4}
and B = {1, 4, 3, 2}?
 Let A be all multiples of 4 and B be all

multiples of 2. Is A a subset of B? And


is B a subset of A?
Proper Subset
A is a proper subset of B if and only if
every element in A is also in B, and
there exists at least one element in B
that is not in A.
Example:
a. A={1,2,3} B={1,2,3}
b. A={1,2,3} B={1,2,3,4}
Cartesian Product
  
The product of two sets.
 “A cross B”

Symbolically:

Example:
 

Let A= B=
a. Find .
b. Find .
c. Find .
Function
A function relates an input to an
output.
Input, Relationship, Output
Example: "Multiply by 2" is a very simple
function.
Names
 Themost common name is "f", but we
can have other names like "g" ... or
even "marmalade" if we want.

Example:
 An input of 4.
 Becomes the output of 16.
A Function is special
A function has a special rules:
 It must work for every possible input value
 And it has only one relationship for each

input value
Vertical Line Test
On a graph, the idea of single
valued means that no vertical line ever
crosses more than one value.
Ordered Pair
 They are called ordered pairs because
the input always comes first, and the
output second.
(input, output)
Example: 
{(2,4), (3,5), (7,3)} is a function that
says "2 is related to 4", "3 is related to
5" and "7 is related 3".
Binary Operation
 Binary operations on a set are calculations
that combine two elements of the set (called
operands) to produce another element of the
same set.
Types of Binary Operation
 Commutative

◦ A binary operation * on a set A is


commutative if a * b = b * a, for all
(a, b) ∈ A (non-empty set).
Example:
Let addition be the operating binary
operation for a = 8 and b = 9, a + b =
17 = b + a.
Types of Binary Operation
 Associative

◦ The associative property of binary


operations hold if, for a non-empty set A,
we can write (a * b) *c = a*(b * c).
Example:
Suppose N be the set of natural numbers
and multiplication be the binary operation.
Let a = 4, b = 5 c = 6. We can write (a × b)
× c = 120 = a × (b × c).
Types of Binary Operation
 Distributive
◦ Let * and o be two binary operations defined on a
non-empty set A. The binary operations are
distributive if a*(b o c) = (a * b) o (a * c) or (b o
c)*a = (b * a) o (c * a).
Example:
Consider * to be multiplication and o be
subtraction. And a = 2, b = 5, c = 4. Then, a*(b o
c) = a × (b − c) = 2 × (5 − 4) = 2. And (a * b) o (a *
c) =  (a × b) − (a × c) = (2 × 5) − (2 × 4) = 10 − 6
= 2.
Types of Binary Operation
 Identity

◦ If A be the non-empty set and * be the


binary operation on A. An element e is the
identity element of a ∈ A, if a * e = a = e *
a.
Example:
If the binary operation is addition(+), e = 0
and for * is multiplication(×), e = 1.
Inverse
 Ifa binary operation * on a set A
which satisfies a * b = b * a = e, for all
a, b ∈ A. a-1 is invertible if for a * b =
b * a= e, a-1 = b. 1 is invertible when *
is multiplication.

You might also like