Definition. A function f from A to B is a relation from A to B such that:
|
|
- Charles Norton
- 7 years ago
- Views:
Transcription
1 Functions
2 Definition A function f from A to B is a relation from A to B such that: (i) Dom(f) = A, and (ii) If (x,y) f and (x,z) f then y = z. If A = B, we say that f is a function on A. In terms of ordered pairs, (i) and (ii) say that every element of A appears as a first coordinate in one and only one ordered pair. If f is a function and (x,y) f then we will write y = f(x). Since f is the name of a relation we could write x f y, but absolutely no one ever writes that.
3 More Terminology Functions are also called mappings. We usually write f: A B read as "f maps A to B" The set B is called the codomain of f. Recall that the range of f, Rng(f) is the set of second coordinates of the relation f. So, Rng(f) B, but they need not be equal. Example: Consider f : {1,2,3} {a,b,c,d,e} given by f = {(1,a), (2,b), (3,c)} f is a function, Rng(f) = {a,b,c}, Codomain of f = {a,b,c,d,e}, Dom (f) = {1,2,3}, f(1) = a, f(2) = b and f(3) = c.
4 More Examples Consider: f : {1,2,3,4} {a,b,c,d,e} given by f = {(1,a), (2,b), (3,c)} This is not a function since Dom(f) A. Consider: f : {1,2,3} {a,b,c,d,e} given by f = {(1,a), (2,b), (3,c), (1,e)} This is not a function since 1 appears as a first coordinate in more than one ordered pair.
5 More Terminology If f: A B is a function and f(x) = y we say that: y is the value of f at x; y is the image of x under f; x is the pre-image of y under f; x is an argument of f. Notice that f(x) is the image of x under f, it is NOT the name of the function, f is the name of the function. It is an abuse of the language to call f(x) a function, although many people do.
6 Functions Notice that each argument of a function has exactly one image, but an element of the codomain may have several pre-images or none at all. Given a function f: A B we may write f = {(x, f(x)) x A }. This underscores the notion that a function is a set... however, we don't often think of functions that way. Typically, we specify a function by giving a "rule" for computing the image of an arbitrary argument such as: f(x) = 2x -3 where x Z. Note that giving the "rule" by itself does not define a function, you must also specify the domain ( x Z in the above example).
7 Real-Valued Functions A real-valued function is a function whose codomain is R. A real-valued function of a real variable is a function whose codomain is R and whose domain is a subset of R. Real-valued functions of a real variable are so common in some branches of mathematics that we have a special convention concerning them: If the domain of a function is not specified, it is assumed to be a real-valued function of a real variable whose domain is the largest set of real numbers for which the "rule" produces a real value.
8 Real-Valued Functions Examples: f(x) = 5x 2-2x + ½ by convention is a function f : R R. f x = x2 2 x 3 x 1 x 5 by convention is a function f :R { 1,5} R. f x = x 2 4 by convention is a function f :R { 2,2 } R.
9 Equality of Functions Since functions are sets of ordered pairs, we already know what it means for two functions to be equal, since we know what it means for two sets to be equal and we know what it means for two ordered pairs to be equal. But we shall restate this in the function terminology: Two functions f and g are equal iff (a) Dom(f) = Dom(g), and (b) x Dom(f), f(x) = g(x).
10 Examples { x2 1 } f x = for x 1 x 1 2 for x=1 and g x =x 1 are the same function, but f(x) = 2x and g(x) = 2x for x Z are not the same function.
11 Inverses and Compositions Since functions are special types of relations, the definitions of inverses and compositions of relations applies to them. However, the definitions of inverses and compositions do not guarantee that the inverse or composition of functions will be a function. For instance, the function given by f(x) = x 2 contains the ordered pairs (1, 1), (-1, 1), (2, 4), (-2, 4),... etc. The inverse would contain (1,1), (1,-1), (4,2), (4,-2),... etc. and it is not a function (but it still is a relation). Only under special conditions, which we shall see later, will the inverse of a function be a function.
12 Composition of Functions Recall that if f: A B and g: B C are functions then g f = {(x,z) y B so that (x,y) f and (y,z) g }. Using our functional notation we can rewrite this as: g f = {(x,z) y B so that f(x) = y and g(y) = z }. Now, because f is a function, for each x A, there is a y B (and only one) so that f(x) = y and because g is a function, there will be a z C (again, only one) so that g(y) = z. So, we can go further and write: g f (x) = z = g(y), where y = f(x) or even more compactly: g f (x) = g(f(x)). The formula above is the reason for choosing the "backwards" notation for composition.
13 Composition of Functions Theorem: If f: A B and g: B C are functions then g f : A C is a function. Pf: We already know that g f is a relation between A and C. Suppose that (x,y) g f and (x,z) g f. We then have y = g f (x) = g(f(x)) and z = g f (x) = g(f(x)). Since g is a function y = z. Dom(g f ) A by the definition of composition. Suppose a A. Since f is a function, Dom(f) = A and f(a) B. Because g is a function and Dom(g) = B, g(f(a)) exists in C. Thus, a Dom(g f ) so A Dom(g f ). We now have Dom(g f ) = A, so g f is a function.
14 Restrictions If f: A B is a function and D A, we can define a new function, the restriction of f to D, denoted by f D, by keeping only the ordered pairs of f which have their first coordinate in D. The domain of the restriction of f to D is D. It is clear that the restriction of a function is also a function.
15 Surjections We know that for a function f: A B, the range of f need not be the same as the codomain. Definition: A function f: A B is onto B iff Rng(f) = B. Such functions are referred to as onto functions or surjections. Note that the common English word "onto" has a technical mathematical meaning. One should be careful when using this word in any mathematical context. Also, realize that you can not tell if a function is onto unless you know the codomain. The range can be calculated, but generally you have to be told what the codomain is.
16 Examples Let f: Z Z be given by f(x) = x 2. This function is not onto since, for instance, 6 in the codomain is not in the range of f. For this function, the Rng(f) consists only of squares, and the codomain Z also contains non-squares. Let f: R [0, ) be given by f(x) = x 2. This function is a surjection because Rng(f) = [0, ). That is, every non-negative real number is the square of a real number. More precisely, if real number c 0 is the square of c, which is a real number, i.e., f( c) = c.
17 Proving a Function is Onto Suppose that f: A B is a function that we wish to prove is a surjection. Since we always have Rng(f) B, we need to prove B Rng(f). That is we need to show that ( b) ( b B b Rng(f)). To show that b Rng(f), we have to find an x in Dom(f) = A so that f(x) = b. Example: Show that the function given by f(x) = 2x + 3 is onto. By convention, the codomain of this function is R and the domain is also R. Let z R be an arbitrary element of the codomain. We seek an x in the domain, so that f(x) = z, i.e., 2x + 3 = z. Solving for x we get x = ½(z 3). Now this x is a real number if z is a real number, so is in the domain of f and f(½(z 3)) = z. So f is onto.
18 Proving a Function is Not Onto Suppose that f: A B is a function that we wish to prove is not a surjection. We usually show that a function is not onto by providing a counterexample, i.e., an element of the codomain which is not in the range of the function. We often locate such a counterexample by trying to prove the function is onto... and failing. Example: Show that the function f: Z Z given by f(x) = 2x + 3 is not onto. The codomain of this function is given as Z and the domain is also Z. Let z Z be an arbitrary element of the codomain. We seek an x in the domain, so that f(x) = z, i.e., 2x + 3 = z. Solving for x we get x = ½(z 3). Now if z 3 is not even, the x we get is not an integer, so will not be in the domain. So, for instance, z = 4 is a counterexample, since it is in the codomain, but there is no integer x so that f(x) = 4.
19 Surjections Theorem 4.7: The composition of two surjections is a surjection. Pf: Let f: A B and g: B C be surjections and consider the composition g f : A C. Let c C be an arbitrary element of the codomain. Since g is onto, there is a b B so that g(b) = c. Now, because f is onto, there exists an a A so that f(a) = b. For this a, g f (a) = g(f(a)) = g(b) = c. Thus, c is in Rng(g f ). Since c was arbitrary, every element of the codomain is in the range, i.e., g f is a surjection.
20 Theorem 4.8 If the composition g f : A C is a surjection, then g is onto. Pf: Let f: A B and g: B C be the functions that are being composed. Let c be an arbitrary element of C (which is the codomain of both g and g f. Since g f is a surjection, there is an a A, so that g f(a)= c. Thus, g(f(a)) = c. Since A is the domain of f, there is a b B so that f(a) = b. Hence, g(b) = c. Since c was arbitrary, g is a surjection.
21 Injections For an onto function, each element of the codomain appears as a second coordinate at least once. We get another type of function if we require that each element of the codomain appears at most once. Definition: A function f: A B is one-to-one iff whenever x z, then f(x) f(z). One-to-one functions are also called injections. The conditional in this definition can be replaced by its contrapositive, so we can also say that a function f is an injection iff whenever f(x) = f(z) then x = z. In this form the definition gives a method for providing a direct proof that a function is an injection.
22 Examples The function f: Z Z given by f(x) = 2x + 3 is an injection. Suppose that f(x) = f(z). Then 2x + 3 = 2z + 3. Subtracting 3 and dividing by 2 on each side of the equation gives x = z. Therefore f is a one-to-one function. The function f: Z Z given by f(x) = 2x is not one-to-one. Suppose that f(x) = f(z). Then 2x = 2z This gives x 2 = z 2. But this only gives x = z and not x = z. A counterexample is given by two numbers (not equal) with the same absolute value, like 2 and -2. f(2) = 11 and f(-2) = 11.
23 Composition Theorem 4.11: The composition of injective functions is an injection. Pf: Let f: A B and g: B C be injections and consider the composition g f : A C. Suppose g f (x) = g f (z). Then g(f(x)) = g(f(z)). Because g is one-to-one, we conclude that f(x) = f(z). Then, because f is one-to-one, we get x = z. Therefore, g f is an injection.
24 Inverses We have already noticed that the inverse of a function need not be a function, we now see when the inverse is a function. Theorem 4.9: Let f: A B. Then f -1 is a function from Rng(f) to A iff f is one-to-one. Furthermore, if f -1 is a function then f -1 is an injection. Pf: Suppose that f is one-to-one. Suppose that (x, y) and (x, z) are in f -1. Then, (y,x) and (z,x) f. Since f is one-to-one, and we have f (y) = x = f(z), we must have y = z. Thus, f -1 is a function. Now suppose that f -1 is a function. Suppose that f(x) = f(y) = z. Then (x,z) and (y,z) f. Therefore, (z,x) and (z,y) f -1. But since f -1 is a function, x = y. Hence, f is one-to-one. Furthermore, if f -1 (u) = f -1 (v) = w, then (u,w) and (v,w) f -1. Thus, (w,u) and (w,v) f, and so u = v since f is a function. Hence, f -1 is an injection.
25 Caveat Be careful, the last theorem says that if f: A B is an injection then f -1 : Rng(f) A is a function. It does not say that f -1 : B A is a function. Of course, these two statements would be the same if Rng(f) = B, that is, if f is onto. So, we have the important Corollary 4.10: If f: A B is a one-to-one and onto function, then f -1 : B A is a one-to-one and onto function.
26 Bijections Definition: A function which is both one-to-one and onto its codomain, is called a one-to-one correspondence. Such functions are also called bijections. For a bijection, each element of the codomain appears as a second coordinate once and only once. Example: The function given by f(x) = ax + b for any a and b with a 0 is a bijection. Recall that by convention, the domain and codomain of this function is R. Note that f(x) = b is neither an injection nor a surjection.
27 Example The function f: N N N given by f(n,m) = 2 n-1 (2m 1) is a bijection. We first show that f is one-to-one. Suppose f(n,m) = f(r,s), then 2 n-1 (2m-1) = 2 r-1 (2s-1). Divide both sides by 2 r-1 (2m-1), which can not be 0, to get 2 n-r = (2s-1)/(2m-1). (If n-r is negative, take reciprocals of both sides.) The right hand side is an odd number, and the only power of 2 which is odd is 2 0 = 1. Thus, n = r. Now return to 2 n-1 (2m-1) = 2 r-1 (2s-1). Since n = r we can divide both sides by 2 n-1 to get 2m 1 = 2s 1. From this we conclude m = s. Hence f is one-to-one.
28 Example The function f: N N N given by f(n,m) = 2 n-1 (2m 1) is a bijection. Now we need to show that f is onto. Let b be an arbitrary natural number. By the fundamental theorem of arithmetic we can write b = 2 a (some odd positive integer) = 2 a (2k+1) where a and k are integers that are 0. Let n = a + 1 and m = k + 1. We have n and m N and f(n,m) = 2 n-1 (2m-1) = 2 a+1-1 (2(k+1)-1) = 2 a (2k+1) = b. Therefore, any element of the codomain is in the range and f is a surjection. Thus f is a bijection.
29 Bijections The basic properties of bijections can be obtained by combining the results we have already obtained concerning surjections and injections. Thus, Theorem: The composition of two bijections is a bijection. Pf: Combine Theorem 4.11 and Theorem 4.7. Theorem: The inverse of a bijection is a bijection. Pf: This is just a rewording of Corollary 4.10.
30 Inverses and Composition Theorem: Let f: A B and g: B A. Then g = f -1 iff g f = I A and f g = I B. Pf: Suppose that g = f -1. Then for any a A, let f(a) = b and therefore f -1 (b) = a. So, g f (a) = g(f(a)) = g(b) = f -1 (b) = a. Thus, g f = I A. For any b B, let f -1 (b) = c, so f(c) = b. Now f g(b) = f(g(b)) = f(f -1 (b)) = f(c) = b, so f g = I B. Now assume that g f = I A and f g = I B. If f -1 exists, then f -1 = f -1 I B = f -1 (f g) = (f -1 f ) g = I A g = g. So we only need to show that f -1 exists. Suppose that f(x) = f(y). Then g(f(x)) = g(f(y)) since g is a function. Since g f = I A we have x = y, and so f is an injection. Thus, f -1 is a function.
Cartesian 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 information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationChapter 7. Functions and onto. 7.1 Functions
Chapter 7 Functions and onto This chapter covers functions, including function composition and what it means for a function to be onto. In the process, we ll see what happens when two dissimilar quantifiers
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More information1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance 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 informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationChapter 7 - Roots, Radicals, and Complex Numbers
Math 233 - Spring 2009 Chapter 7 - Roots, Radicals, and Complex Numbers 7.1 Roots and Radicals 7.1.1 Notation and Terminology In the expression x the is called the radical sign. The expression under the
More informationGRE Prep: Precalculus
GRE Prep: Precalculus Franklin H.J. Kenter 1 Introduction These are the notes for the Precalculus section for the GRE Prep session held at UCSD in August 2011. These notes are in no way intended to teach
More informationTo define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions
Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions
More informationCardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.
Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection
More informationBasic Concepts of Set Theory, Functions and Relations
March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More informationComputability Theory
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationSolutions Manual for How to Read and Do Proofs
Solutions Manual for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationAdding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors
1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number
More informationSettling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationFunctions CHAPTER 2. Introduction. 2.1 Some Basic Terminology. Terminology for Sets
CHAPTER 2 Functions Introduction Functions play a fundamental role in nearly all of mathematics Combinatorics is no exception In the next section we review the basic terminology and notation for functions
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationLecture Notes on Discrete Mathematics
Lecture Notes on Discrete Mathematics A. K. Lal September 26, 2012 2 Contents 1 Preliminaries 5 1.1 Basic Set Theory.................................... 5 1.2 Properties of Integers.................................
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More information3.1. RATIONAL EXPRESSIONS
3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More information25 Integers: Addition and Subtraction
25 Integers: Addition and Subtraction Whole numbers and their operations were developed as a direct result of people s need to count. But nowadays many quantitative needs aside from counting require numbers
More informationx 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1
Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationFixed Point Theorems in Topology and Geometry
Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationTwo Fundamental Theorems about the Definite Integral
Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than
More informationALGEBRA REVIEW LEARNING SKILLS CENTER. Exponents & Radicals
ALGEBRA REVIEW LEARNING SKILLS CENTER The "Review Series in Algebra" is taught at the beginning of each quarter by the staff of the Learning Skills Center at UC Davis. This workshop is intended to be an
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More information3.3 Real Zeros of Polynomials
3.3 Real Zeros of Polynomials 69 3.3 Real Zeros of Polynomials In Section 3., we found that we can use synthetic division to determine if a given real number is a zero of a polynomial function. This section
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationMathematics Georgia Performance Standards
Mathematics Georgia Performance Standards K-12 Mathematics Introduction The Georgia Mathematics Curriculum focuses on actively engaging the students in the development of mathematical understanding by
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationChapter 7. Homotopy. 7.1 Basic concepts of homotopy. Example: z dz. z dz = but
Chapter 7 Homotopy 7. Basic concepts of homotopy Example: but γ z dz = γ z dz γ 2 z dz γ 3 z dz. Why? The domain of /z is C 0}. We can deform γ continuously into γ 2 without leaving C 0}. Intuitively,
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationUnit 7: Radical Functions & Rational Exponents
Date Period Unit 7: Radical Functions & Rational Exponents DAY 0 TOPIC Roots and Radical Expressions Multiplying and Dividing Radical Expressions Binomial Radical Expressions Rational Exponents 4 Solving
More informationRIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES
RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES GAUTAM BHARALI AND INDRANIL BISWAS Abstract. In the study of holomorphic maps, the term rigidity refers to certain types of results that give us very specific
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationBX in ( u, v) basis in two ways. On the one hand, AN = u+
1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More information