LESSON RELATIONS & FUNCTION THEORY
|
|
- Philip Cannon
- 5 years ago
- Views:
Transcription
1
2 2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular order, i.e., (p,q), p P and q Q. Cartesian Product Given two non-empty sets P and Q. The cartesian product P Q is the set of all ordered pairs of elements from P and Q, i.e., P Q = { (p,q) : p P, q Q } If either P or Q is the null set, then P Q will also be empty set, i.e., P Q = Note: (i) Two ordered pairs are equal, if and only if the corresponding first elements are equal and the second elements are also equal. (ii) If there are p elements in A and q elements in B, then there will be pq elements in A B, i.e., if n(a) = p and n(b) = q, then n(a B) = pq. (iii) If A and B are non-empty sets and either A or B is an infinite set, then so is A B. (iv) A A A = {(a, b, c) : a, b, c A}. Here (a, b, c) is called an ordered triplet. Relations The concept of the term relation in mathematics has been drawn from the meaning of relation in English language, according to which two objects or quantities are related if there is a recognisable connection or link between the two objects or quantities. A relation R from a non-empty set A to a non-empty set B is a subset of the cartesian product A B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A B. The second element is called the image of the first element. Domain of a Relation The set of all first elements of the ordered pairs in a relation R from a set A to a set B is called the domain of the relation R. Range of a Relation The set of all second elements in a relation R from a set A to a set B is called the range of the relation R. The whole set B is called the codomain of the relation R. Note that range codomain. Note: The total number of relations that can be defined from a set A to a set B is the number of possible subsets of A B. If n(a ) = p and n(b) = q, then n (A B) = pq and the total number of relations is 2 pq.
3 3 Functions Introduction If to every value (considered as real unless otherwise stated) of a variable x, which belongs to some collection (Set) E, there corresponds one and only one finite value of the quantity y, then y is said to be a function (single valued) of x or a dependent variable defined on the set E; x is the argument or independent variable. If to every value of x belonging to some set E there corresponds one or several values of the variable y, then y is called a multiple valued function of x defined on E. Conventionally the word Function is used only as the meaning of single valued function, unless otherwise stated. Domain, Co-domain and Range Let f: A B, then the set A is known as the domain of f and the set B is known as co-domain of f. The set of all f images of elements of A is known as the range of f. Thus, Domain of f = {f(a) aa, (a, f(a)) f}, Range of f = {f(a) a A, f(a) B} It should be noted that range is a subset of co-domain. If only the rule of function is given then the domain of the function is the set of those real numbers, where function is defined. Some frequently used real functions Constant function A function f:a B, A, B R, is said to be a constant function if there exists a real number k such that f(x) = k, for all x A k Domain: A; Range: Notes for graph of f(x) = k: (i) The graph is a line parallel to x-axis. (ii) If k > 0, the graph will be a line above the x-axis and parallel to it. (iii) If k = 0, then the graph coincides with the x-axis. (iv) If k < 0, then the graph will be a line below the x-axis and parallel to it. Identity function The function from R to R that associates to each x R the same x, is called the identity function and is usually denoted by I. More precisely, we write I(x) = x, for all x R Domain: R; Range: R Notes for graph y = x: (i) The graph is a straight line (ii) It passes through the origin. (iii) Its slope is 1. Polynomial function A function f: R R is said to be a polynomial function if for each x in R, f(x) is a polynomial in x. The functions f (x) x x 2, g(x) x 2x
4 4 3 are some examples of polynomial functions whereas the function h(x) x 2x is not a polynomial function. Domain: R; Range: Depends on the polynomial representing the function. Notes for graph y = x 2 (A particular case): (i) The graph of y = x 2 is a parabola (ii) It is above the x-axis, except at one point, x = 0. (iii) It passes through the origin. (iv) It is symmetric with respect to the y-axis, sincef( x) f(x), for all x R. Modulus function The function f: R R defined by x, if x 0 f (x) x x, if x 0 is called the modulus function. It is also called absolute value function. Domain: R; Range: R 0 = {x: x is a non-negative real number} Notes for graph y = x : (i) The graph is symmetric with respect to the y-axis. (ii) It is above the x-axis, except at one point, x = 0. (iii) It passes through the origin. (iv) In the first quadrant, it coincides with the graph of the identity function. Square root function If x is a positive real number, then there are two square roots for x, of which one is positive. If we associate only the positive square root to any positive real number x, then we get a function f: R 0 R, called square root function and is given by f(x) = x. Domain: R 0 ; Range: R 0 : ( R 0 is set [0, )) Notes for graph y = x (i) The graph passes through the origin. (ii) It is above the x-axis except at one point, x = 0. (iii) As we move from left to right, the graph goes on rising above the x-axis, i.e., y increases as x increases. Signum Function The function f defined by 1, if x 0 f (x) 0, if x 0 1, if x 0 is called the signum function. Domain: R; Range:{ 1,0,1} 2 Greatest Integer function (Floor function)
5 5 The function f: R R defined by f(x) = [x] or x, x R is called the greatest integer function or the floor function. It is also called a step function. For example [4.2] = 4, [4.2] = 5, etc. Domain: R; Range: Z Notes for graph of y [x] (i) The graph consists of infinitely many broken pieces. (ii) Each piece of the graph coincides with the graph of a constant function. (iii) The graph lies within the first and third quadrants with the exception of one piece in [0, 1) which lies on x-axis. Smallest Integer Function (Ceiling function) The function f: R R defined by f (x) x, x R is called the Smallest integer function or the ceiling function. It is also a step function. Domain: R; Range: Z Notes for graph of y x (i) All the observations made for the floor function are also valid for this function (ii) The graph lies within the first and third quadrant with the exception of one piece in (1, 0] which lies on x-axis. Exponential function If a is a positive real number and a 1, then the function defined by x f (x) = a, x R is called an exponential function to the base a. Domain: R; Range: R +, the set of positive real numbers. x Notes for graph of y = 2 (A particular case) (i) The graph is above the x-axis. (ii) As we move from left to right, the graph goes on rising above the x-axis. (iii) The graph meets the y-axis at (0, 1). (iv) In the second quadrant, the graph approaches the x-axis but never meets it. Logarithmic function If a > 0 and a 1, then the function loga x y is called the logarithmic function (it is the inverse of the exponential function y to the base a), if and only if a x. Domain: R, the set of all positive real numbers; Range: R Notes for graph of y = log 2 x (A particular case) (i) The graph is on the right side of the y-axis. (ii) As we move from left to right, the graph goes on rising. (iii) The graph meets the x-axis at (1, 0).
6 (iv) In the fourth quadrant, the graph approaches to the y-axis but never touches it. 6 Trigonometric functions The domains and ranges of some of the trigonometric functions are as given below: Function (given by) Domain Range sin x R [1,1] cos x R [1,1] tan x R R (2n 1) : n Z 2 R n : n Z R cot x sec x (, 1] [1, ) R (2n 1) : n Z 2 R n : n Z (, 1] [1, ) cosec x Inverse trigonometric functions The domain and range (confining only to principal values) of inverse trigonometric functions are as given below: Function (given by) Domain Range (Principal Value) 1 sin x [1,1], cos x [1,1] [0, ] 1 tan x R, cot x R (0, ) 1 sec x (, 1] [1, ) 0,, cos ec x, 1][1, ),0 2 0, 2 CLASS XII Types of Relation In this section, we intend to define various types of relations of a given set A. 1. Empty/Void Relation Let A be a set. Then A A and so it is a relation on A. This relation is called the void or empty relation on A. 2. Universal Relation Let A be a set. Then A A A A and so it is a relation on A. This relation is called the universal relation on A. Note: The void and the universal relations on a set A are respectively the smallest and the largest relations of A.
7 7 3. Identity Relation Let A be a set. Then the relation I A = {(a, a) : a A} on A is called the identity relation on A. In other words, a relation I A on A is called the identity relation if every element of A is related to itself only. Example: The relation I A = {(1, 1), (2, 2), (3, 3)} is the identity relation on set A = {1, 2, 3}. But relations R 1 = {(1, 1), (2, 2)} and R 2 = {(1, 1), (2, 2), (3, 3), (1, 3)} are not identity relations on A, because (3, 3) R 1 and in R 2 element 1 is related to elements 1 and Reflexive Relation A relation R on a set A is said to be reflexive if every element of A is related to itself. Thus, R is reflexive (a, a) R for all a A. A relation R on a set A is not reflexive if there exists an element a A such that (a, a) R. Example: Let A = {1, 2, 3} be a set. Then R = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)} is a reflexive relation on A. But R 1 = {(1, 1), (3, 3), (2, 1), (3, 2)} is not a reflexive relation on A, because 2 A but (2, 2) R 1. Example: A relation R on N defined by (x, y) R x y is a reflexive relation on N, because every natural number is greater than or equal to itself. Example: Let X be a non-void set and P(X) be the power set of X. A relation R on P(X) defined by (A, B) R A B is a reflexive relation since every set is subset to itself. Note 1: The identity relation on a non-void set A is always reflexive relation on A. However, a reflexive on A is not necessarily the identity relation on A. For example, the relation R = {(a, a), (b, b), (c, c), (a, b)} is a reflexive relation on set A = {a, b, c} but it is not the identity relation on A. Note 2: The universal relation on a non-void set A is reflexive. 5. Symmetric Relation A relation R on a set A is said to be a symmetric relation iff (a, b) R (b, a) R for all a, b A i.e. arb bra for all a, b A Example: Let L be the set of all lines in plane and let R be a relation defined on L by the rule (x, y) R x is perpendicular to y. Then R is symmetric relation on L, because L 1 L 2 L 2 L 1 i.e. (L 1, L 2 ) R (L 2, L 1 ) R. Example: Let S be a non-void set and R be a relation defined on power set P(S) by (A, B) R A B for all A, B P(S). Then R is not a symmetric relation. Example: Let A = {1, 2, 3, 4} and let R 1 and R 2 be relation on A given by R 1 = {(1, 3), (1, 4), (3, 1), (2, 2) (4, 1)} and R 2 = {(1, 1), (2, 2), (3, 3), (1, 3)}. Clearly, R 1 is a symmetric relation on A. However, R 2 is not so, because (1, 3) R 2 but (3, 1) R 2. Note 1: The identity and the Universal relations on a non-void set are symmetric relations. Note 2: A relation R on a set A is not a symmetric relation if there are at least two elements a, b A such that (a, b) R but (b, a) R. Note 3: A reflexive relation on a set A is necessarily symmetric. For example, the relation R= {(1, 1), (2, 2), (3, 3), (1, 3)} is a reflexive relation on set A = {1, 2, 3} but it is not symmetric. 6. Transitive Relation Let A be any set. A relation R on A is said to be a transitive relation iff (a, b) R and (b, c) R (a, c) R for all a, b, c A.
8 i.e. arb and brc arc for all a, b, c A. Note: The identity and the universal relations on a non-void set are transitive. 8 Example: The relation R on the set N of all natural numbers defined by (x, y) R x divides y, for all x, y N is transitive. Solution Let x, y, z N be such that (x, y) R and (y, z) R. Then (x, y) R and (y, z) R x divides y and y divides z there exists p, q N such that y = xp and z = yq z = (xp) q z = x(pq) x divides z [ pq N] (x, z) R Thus, (x, y) R, (y, z) R (x, z) R for all x, y, z N. Hence, R is a transitive relation on N. 7. Equivalence Relation A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. Composite Function Let f: A B & g: B C be two functions. Then the function gof: A C defined by (gof) (x) = g (f(x)) x A is called the composite of the two functions f and g gof is defined if x A. f(x) is an element of the domain of g so that we can take its g-image. Properties of composite functions: (i) The composite of function is not commutative i.e. gof fog. (ii) The composite of functions is associative i.e. if f, g, h are three functions such that fo(goh) and (fog)oh are defined, then fo(goh) = (fog)oh. Kinds of Functions If f: A B is a function, then f associates all elements of set A to elements in set B such that an element of set A is associated to a unique element of set B. Following these two conditions we may associate different elements of set A to different elements of set B or more than one element of set A may be associated to the same element of set B. Similarly, there may be some elements in B which do not have their pre-images in A and all elements in B may have their pre-images in A. Corresponding to each of these possibilities we define some types of a function as given below. One-One Function (Injection) A function f: A B is said to be a one-one function or an injection if different elements of A have different images in B. Thus, f: A B is one one a b f(a) f(b) for all a, ba f(a) = f(b) a = b for all a, b A Note: Let f: A B and let x, y A. Then, x = y f(x) = f(y) is always true from the definition. But, f(x) = f(y) x = y is true only when f is one-one.
9 9 Many-One Function A function f: A B is said to be a many-one function if two or more elements of set A have the same image in B. Thus, f: A B is a many-one function if there exist x, y A such that x y but f(x) = f(y). In other words, f: A B is a many-one function if it is not a one-one function. Onto Function (Surjection) A function f: A B is said to be an onto function or a surjection if every element of B is the f- image of some element of A i.e., if f(a) = B or range of f is the co-domain of f. Thus, f: A B is a surjection iff for each b B, there exists a A such that f(a) = b. Into function A function f: A B is an into function if there exists an element in B having no pre-image in A. In other words, f: A B is an into function if it is not an onto function. Bijection (one-one onto function) A function f: A B is a bijection if it is one-one as well as onto. In other words, a function f: A B is a bijection if (i) It is one-one i.e. f(x) = f(y) x = y for all x, y A. (ii) It is onto i.e. for all y B, there exists x A such that f(x) = y. Inverse of a Function Let f: A B be a one-one and onto function, then there exists a unique function g: B A such that f(x) = y g(y) = x, x A & y B. Then g is said to be inverse of f. Thus g = f 1 : B A = {(f(x), x) (x, f(x)) f}. Properties of inverse function: (i) Inverse of a bijection is unique. (ii) If f: A B is a bijection and g: B A is the invese of f, then fog = I B and gof = I A, where I A & I B are identity functions on the sets A and B respectively. Note that the graph of f and g are the mirror images of each other on the line y = x. (iii) The inverse of an Identity function is the function itself, i.e. (f 1 ) 1 = f. (iv) The inverse of a bijection is also a bijection. (v) If f and g are two bijections f: A B, g: B C then the inverse of gof exists and (gof) 1 = f 1 og 1. Binary Operations Binary Operation: Let S be a non-empty set. A function f: S S S is called a binary operation on set S. 2 n If the finite set S has n elements, then total number of binary operations on S is n. Note for binary operations A binary operation on a set S associates each ordered pair (a, b) S S to a unique element f(a, b) in S. Instead of writing f (a, b) for the image of an orderd pair (a, b) S S, conventionally we will prefer to write a f b, that is we write f (a, b) as a f b.
10 10 Generally binary operations are denoted by the symbols *, 0, +, etc instead of the letters f, g, h etc. Thus, a binary operation *on a set S associates each ordered pair (a, b) in S S to a unique element a * b in S. Since an ordered pair is made of two elements of S. So, we can say that a binary operation * on a set S associates any two elements a, b of S to a unique element a * b in S. Types of Binary Operations 1. Commutativity: A binary operation on a set S is said to be a commutative binary operation, if a b = b a for all a, bs 2. Associativity: A binary operation on a set S is said to be an associative binary operation, if (a b) c = a (b c) for all a, bs 3. Distributivity: Let S be a non-empty set and and be two binary operations on S. Then, is said to be distributive over, if a (b c) = (a b) (a c) and, (b c) a = (b a) (c a) for all a, b, cs. Identity element: Let ''' be a binary operation on a set S. If there exists an element es such that a e = a = e a for all as. Then, e is called an identity element for the binary operation '' on set S. If S has an identity element for, then it is unique. Inverse of an element: Let be a binary operation on a set S, and let e be the identity element in S for the binary operation on S. Then, an element as is called an invertible element if there exists an element bs such that a b = e = b a The element b is called an inverse of element a. Addition Modulo n: Let n be a positive integer greater than 1 and a, bz n, where Z n = {0, 1, 2,.., (n 1)}. Then, we define addition modulo n i.e. + n as follows: a + n b = Least non-negative remainder when a + b is divided by n. Multiplication Modulo n: Let n be a positive integer greater than 1 and a, bz n, where Z n = {0, 1, 2, 3,, (n 1} Then, we define multiplication modulo n i.e., n as follows: a n b = Least non-negative remainder when ab is divided by n. Some useful methods for finding injectivity and surjectivity of a function Method to Check the Injectivity of a Function I Take two arbitrary elements x, y (say) in the domain of f. II Put f(x) = f(y) III Solve f (x) = f(y). If f(x) = f(y) gives x = y only, then f: A B is a one-one function (or an injection). Otherwise not. Method for Checking the Surjectivity of a Function Let f: A B be the given function. I Choose an arbitrary element y in B. II Put f(x) = y III Solve the equation f(x) = y for x and obtain x in terms of y. Let x = g(y)
11 IV If for all values of y B, the values of x obtained from x = g(y) are in A, then f is onto. If there are some y B for which x, given by x = g(y), is not in A. Then f is not onto. 11
Relations, Functions & Binary Operations
Relations, Functions & Binary Operations Important Terms, Definitions & Formulae 0 TYPES OF INTERVLS a) Open interval: If a and b be two real numbers such that a b then, the set of all the real numbers
More informationRELATIONS AND FUNCTIONS
For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)
More informationQUESTION BANK II PUC SCIENCE
QUESTION BANK II PUC SCIENCE I. Very Short answer questions. (x9=9). Define Symmetric relation. Ans: A relation R on the set A is said to be symmetric if for all a, b, A, ar b Implies bra. i.e. (a, b)
More informationMATHEMATICS. IMPORTANT FORMULAE AND CONCEPTS for. Final Revision CLASS XII CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION.
MATHEMATICS IMPORTANT FORMULAE AND CONCEPTS for Final Revision CLASS XII 2016 17 CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist (Elect.),
More informationCLASS12 RELATIONS AND FUNCTIONS
CLASS12 RELATIONS AND FUNCTIONS Deepak sir 9811291604 Relations and functions, domain, co-domain and range have been introduced in Class XI along with different types of specific real valued functions
More informationMore Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com
More informationRELATIONS AND FUNCTIONS
Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we
More informationFunctions Functions and Modeling A UTeach/TNT Course
Definition of a Function DEFINITION: Let A and B be sets. A function between A and B is a subset of A B with the property that if (a, b 1 )and(a, b 2 ) are both in the subset, then b 1 = b 2. The domain
More informationFREE Download Study Package from website: &
SHORT REVISION (FUNCTIONS) THINGS TO REMEMBER :. GENERAL DEFINITION : If to every value (Considered as real unless otherwise stated) of a variable which belongs to some collection (Set) E there corresponds
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationFunctions. Given a function f: A B:
Functions Given a function f: A B: We say f maps A to B or f is a mapping from A to B. A is called the domain of f. B is called the codomain of f. If f(a) = b, then b is called the image of a under f.
More informationMATHEMATICS. MINIMUM LEVEL MATERIAL for CLASS XII Project Planned By. Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad
MATHEMATICS MINIMUM LEVEL MATERIAL for CLASS XII 05 6 Project Planned By Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist
More information9/21/2018. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions
How can we prove that a function f is one-to-one? Whenever you want to prove something, first take a look at the relevant definition(s): x, y A (f(x) = f(y) x = y) f:r R f(x) = x 2 Disproof by counterexample:
More informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationNotes. Functions. Introduction. Notes. Notes. Definition Function. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y.
Functions Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Section 2.3 of Rosen cse235@cse.unl.edu Introduction
More informationCHAPTER 1: RELATIONS AND FUNCTIONS
CHAPTER 1: RELATIONS AND FUNCTIONS Previous Years Board Exam (Important Questions & Answers) 1. If f(x) = x + 7 and g(x) = x 7, x R, find ( fog) (7) Given f(x) = x + 7 and g(x) = x 7, x R fog(x) = f(g(x))
More information9/21/17. Functions. CS 220: Discrete Structures and their Applications. Functions. Chapter 5 in zybooks. definition. definition
Functions CS 220: Discrete Structures and their Applications Functions Chapter 5 in zybooks A function maps elements from one set X to elements of another set Y. A B Brian C Drew range: {A, B, D} Alan
More informationfunction independent dependent domain range graph of the function The Vertical Line Test
Functions A quantity y is a function of another quantity x if there is some rule (an algebraic equation, a graph, a table, or as an English description) by which a unique value is assigned to y by a corresponding
More informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationRelations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) : (a A) and (b B)}. The following points are worth special
More informationFUNCTIONS. Note: Example of a function may be represented diagrammatically. The above example can be written diagrammatically as follows.
FUNCTIONS Def : A relation f from a set A into a set is said to be a function or mapping from A into if for each A there eists a unique such that (, ) f. It is denoted b f : A. Note: Eample of a function
More informationMATHEMATICS HIGHER SECONDARY FIRST YEAR VOLUME II REVISED BASED ON THE RECOMMENDATIONS OF THE TEXT BOOK DEVELOPMENT COMMITTEE
MATHEMATICS HIGHER SECONDARY FIRST YEAR VOLUME II REVISED BASED ON THE RECOMMENDATIONS OF THE TEXT BOOK DEVELOPMENT COMMITTEE Untouchability is a sin Untouchability is a crime Untouchability is inhuman
More informationToday s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions
Today s Topics Set identities Methods of proof Relationships to logical equivalences Functions Important definitions Relationships to sets, relations Special functions Set identities help us manipulate
More informationCS 220: Discrete Structures and their Applications. Functions Chapter 5 in zybooks
CS 220: Discrete Structures and their Applications Functions Chapter 5 in zybooks Functions A function maps elements from one set X to elements of another set Y. A Brian Drew Alan Ben B C D F range: {A,
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationFunctions. Remark 1.2 The objective of our course Calculus is to study functions.
Functions 1.1 Functions and their Graphs Definition 1.1 A function f is a rule assigning a number to each of the numbers. The number assigned to the number x via the rule f is usually denoted by f(x).
More informationSection Summary. Definition of a Function.
Section 2.3 Section Summary Definition of a Function. Domain, Cdomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More information9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2018 1 9 FUNCTIONS 9.1 The Definition of Function DEFINITION 1. Let X and Y be nonempty sets. A function f from the set X to the set Y is a correspondence that assigns to each
More informationIntroduction to Decision Sciences Lecture 6
Introduction to Decision Sciences Lecture 6 Andrew Nobel September 21, 2017 Functions Functions Given: Sets A and B, possibly different Definition: A function f : A B is a rule that assigns every element
More informationQF101: Quantitative Finance August 22, Week 1: Functions. Facilitator: Christopher Ting AY 2017/2018
QF101: Quantitative Finance August 22, 2017 Week 1: Functions Facilitator: Christopher Ting AY 2017/2018 The chief function of the body is to carry the brain around. Thomas A. Edison 1.1 What is a function?
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationChapter 1. Functions 1.1. Functions and Their Graphs
1.1 Functions and Their Graphs 1 Chapter 1. Functions 1.1. Functions and Their Graphs Note. We start by assuming that you are familiar with the idea of a set and the set theoretic symbol ( an element of
More informationFor all Engineering Entrance Examinations held across India. Mathematics
For all Engineering Entrance Eaminations held across India. JEE Main Mathematics Salient Features Ehaustive coverage of MCQs subtopic we. 946 MCQs including questions from various competitive eams. Prece
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationMockTime.com. (a) 36 (b) 33 (c) 20 (d) 6
185 NDA Mathematics Practice Set 1. Which of the following statements is not correct for the relation R defined by arb if and only if b lives within one kilometer from a? R is reflexive R is symmetric
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
More information2 Functions. 2.1 What is a function?
Functions After working through this section, you should be able to: (a) determine the image of a given function; (b) determine whether a given function is one-one and/or onto; (c) find the inverse of
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
More informationSETS. set of natural numbers by N set of integers by Z set of rational numbers by Q set of irrational numbers by T
Chapter SETS. Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions... Set and their representations A set is
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More information1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
Math120 - Precalculus. Final Review. Fall, 2011 Prepared by Dr. P. Babaali 1 Algebra 1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationFunc%ons. function f to the element a of A. Functions are sometimes called mappings or transformations.
Section 2.3 Func%ons Definition: Let A and B be nonempty sets. A function f from A to B, denoted f: A B is an assignment of each element of A to exactly one element of B. We write f(a) = b if b is the
More informationCLASS XII MATHEMATICS. Weightage (Marks) (i) Relations and Functions 10. Type of Questions Weightage of Number of Total Marks each question questions
CLASS XII MATHEMATICS Units Weightage (Marks) (i) Relations and Functions 0 (ii) Algebra (Matrices and Determinants) (iii) Calculus 44 (iv) Vector and Three dimensional Geometry 7 (v) Linear Programming
More informationBRAIN TEASURES FUNCTION BY ABHIJIT KUMAR JHA EXERCISE I. log 5. (ii) f (x) = log 7. (iv) f (x) = 2 x. (x) f (x) = (xii) f (x) =
EXERCISE I Q. Find the domains of definitions of the following functions : (Read the symbols [*] and {*} as greatest integers and fractional part functions respectively.) (i) f () = cos 6 (ii) f () = log
More informationRELATIONS AND FUNCTIONS-I
Relations -I MDULE - I RELATINS AND FUNCTINS-I In our daily life, we come across many patterns that characterise relations such as brother and sister, father and son, teacher and student etc. In mathematics
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More information5 FUNCTIONS. 5.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2017 1 5 FUNCTIONS 5.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationDIRECTORATE OF EDUCATION GOVT. OF NCT OF DELHI
456789045678904567890456789045678904567890456789045678904567890456789045678904567890 456789045678904567890456789045678904567890456789045678904567890456789045678904567890 QUESTION BANK 456789045678904567890456789045678904567890456789045678904567890456789045678904567890
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationADDITIONAL MATHEMATICS
ADDITIONAL MATHEMATICS GCE Ordinary Level (Syllabus 4018) CONTENTS Page NOTES 1 GCE ORDINARY LEVEL ADDITIONAL MATHEMATICS 4018 2 MATHEMATICAL NOTATION 7 4018 ADDITIONAL MATHEMATICS O LEVEL (2009) NOTES
More informationChapter12. Relations, Functions, and Induction
. Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a
More informationRelations and Functions (for Math 026 review)
Section 3.1 Relations and Functions (for Math 026 review) Objective 1: Understanding the s of Relations and Functions Relation A relation is a correspondence between two sets A and B such that each element
More informationSec$on Summary. Definition of a Function.
Section 2.3 Sec$on Summary Definition of a Function. Domain, Codomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationFoundations of Calculus. November 18, 2014
Foundations of Calculus November 18, 2014 Contents 1 Conic Sections 3 11 A review of the coordinate system 3 12 Conic Sections 4 121 Circle 4 122 Parabola 5 123 Ellipse 5 124 Hyperbola 6 2 Review of Functions
More informationCalculus I. 1. Limits and Continuity
2301107 Calculus I 1. Limits and Continuity Outline 1.1. Limits 1.1.1 Motivation:Tangent 1.1.2 Limit of a function 1.1.3 Limit laws 1.1.4 Mathematical definition of a it 1.1.5 Infinite it 1.1. Continuity
More informationCOT3100 SI Final Exam Review
1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many
More informationChapter 1- Polynomial Functions
Chapter 1- Polynomial Functions Lesson Package MHF4U Chapter 1 Outline Unit Goal: By the end of this unit, you will be able to identify and describe some key features of polynomial functions, and make
More informationADDITIONAL MATHEMATICS
ADDITIONAL MATHEMATICS GCE NORMAL ACADEMIC LEVEL (016) (Syllabus 4044) CONTENTS Page INTRODUCTION AIMS ASSESSMENT OBJECTIVES SCHEME OF ASSESSMENT 3 USE OF CALCULATORS 3 SUBJECT CONTENT 4 MATHEMATICAL FORMULAE
More informationModule 2: Language of Mathematics
Module 2: Language of Mathematics Theme 1: Sets A set is a collection of objects. We describe a set by listing all of its elements (if this set is finite and not too big) or by specifying a property that
More informationCS100: DISCRETE STRUCTURES
1 CS100: DISCRETE STRUCTURES Computer Science Department Lecture 2: Functions, Sequences, and Sums Ch2.3, Ch2.4 2.3 Function introduction : 2 v Function: task, subroutine, procedure, method, mapping, v
More informationPólya Enrichment Stage Table of Contents
Pólya Enrichment Stage Table of Contents George Pólya (1887-1985) v Preface ix Chapter 1. Functions 1 Chapter 2. Symmetric Polynomials 15 Chapter 3. Geometry 22 Chapter 4. Inequalities 34 Chapter 5. Functional
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationAMB111F Notes 1: Sets and Real Numbers
AMB111F Notes 1: Sets and Real Numbers A set is a collection of clearly defined objects called elements (members) of the set. Traditionally we use upper case letters to denote sets. For example the set
More information1 The distributive law
THINGS TO KNOW BEFORE GOING INTO DISCRETE MATHEMATICS The distributive law The distributive law is this: a(b + c) = ab + bc This can be generalized to any number of terms between parenthesis; for instance:
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationMATHEMATICS. MINIMUM LEVEL MATERIAL for CLASS XII Project Planned By. Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad
MATHEMATICS MINIMUM LEVEL MATERIAL for CLASS XII 06 7 Project Planned By Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationINFINITY.THINK BEYOND.
RELATIONS & FUNCTIONS SCHEMATIC DIAGRAM Topic Concepts Degree of importance References NCERT Text Book XII Ed. 007 Relations & (i).domain, Co domain & * (Previous Knowledge) Functions Range of a relation
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
Chapter 5 COMPLEX NUMBERS AND QUADRATIC EQUATIONS 5. Overview We know that the square of a real number is always non-negative e.g. (4) 6 and ( 4) 6. Therefore, square root of 6 is ± 4. What about the square
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationPURE MATHEMATICS Unit 1
PURE MATHEMATICS Unit 1 FOR CAPE EXAMINATIONS DIPCHAND BAHALL CAPE is a registered trade mark of the Caribbean Examinations Council (CXC). Pure Mathematics for CAPE Examinations Unit 1 is an independent
More information