2. Properties of Functions
|
|
- Lindsey Wilkerson
- 6 years ago
- Views:
Transcription
1 2. PROPERTIES OF FUNCTIONS Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique. In this ase, (a ) (f(a) f()). 2. f is onto or surjetive if every y B has a preimage. In this ase, the range of f is equal to the oomain. 3. f is ijetive if it is surjetive an injetive (one-to-one an onto). We egin y isussing three very important properties funtions efine aove. 1. A funtion is injetive or one-to-one if the preimages of elements of the range are unique. In other wors, if every element in the range is assigne to eatly one element in the omain. For eample, if a funtion is efine from a suset of the real numers to the real numers an is given y a formula y = f(), then the funtion is one-to-one if the equation f() = has at most one solution for every numer. 2. A funtion is surjetive or onto if the range is equal to the oomain. In other wors, if every element in the oomain is assigne to at least one value in the omain. For eample, if, as aove, a funtion is efine from a suset of the real numers to the real numers an is given y a formula y = f(), then the funtion is onto if the equation f() = has at least one solution for every numer. 3. A funtion is a ijetion if it is oth injetive an surjetive Eamples. Eample Let A = {a,,, } an B = {, y, z}. The funtion f is efine y the relation piture elow. This funtion is neither injetive nor surjetive. a y z
2 2. PROPERTIES OF FUNCTIONS 112 Eample f : A B where A = {a,,, } an B = {, y, z} efine y the relation elow is a surjetion, ut not an injetion. a y z Eample f : A B where A = {a,,, } an B = {v, w,, y, z} efine y the relation elow is an injetion, ut not a surjetion. a v w y Eample f : A B where A = {a,,, } an B = {v, w,, y} efine y the relation elow oth a surjetion an an injetion, an therefore a ijetion. Notie that for a funtion to e a ijetion, the omain an oomain must have the same arinality. z a v w y
3 2. PROPERTIES OF FUNCTIONS 113 The eamples illustrate funtions that are injetive, surjetive, an ijetive. Here are further eamples. Eample Let f : [0, ) [0, ) e efine y f() =. This funtion is an injetion an a surjetion an so it is also a ijetion. Eample Suppose f() = 2. If the omain an oomain for this funtion is the set of real numers, then this funtion woul e neither a surjetion nor an injetion. It is not a surjetion eause the range is not equal to the oomain. For eample, there is no numer in the omain with image 1 whih is an element of the oomain. It is not an injetion sine more than one istint element in the omain is mappe to the same element in the oomain. For eample, f( 1) = f(1) ut 1 1. Eerise What if we say the omain of the funtion in Eample is the set of all reals an the oomain is [0, ). Whih properties woul the funtion have (injetive an/or surjetive)? Eplain. Eerise Now, if we say the omain an the oomain are oth [0, ). What properties oes the funtion in Eample have? Eplain Eample Eample Prove that the funtion f : N N e efine y f(n) = n 2 is injetive. Proof. Let a, N e suh that f(a) = f(). This implies a 2 = 2 y the efinition of f. Thus a = or a =. Sine the omain of f is the set of natural numers, oth a an must e nonnegative. Thus a =. This shows a [f(a) = f() a = ], whih shows f is injetive. In Eample we prove a funtion is injetive, or one-to-one. Notie that to prove a funtion, f : A B is one-to-one we must show the following: This is equivalent to showing ( A)( y A)[( y) (f() f(y))]. ( A)( y A)[(f() = f(y)) ( = y)]. To prove this statement (whih atually uses the ontrapositive of the efinition) we egin y hoosing two aritrary elements of the omain an assume the hypothesis
4 2. PROPERTIES OF FUNCTIONS 114 of the impliation, i.e. we egin with Let, y A an assume f() = f(y). We then use the rules of algera to show that the onlusion must follow Eample Eample Prove that the funtion g : N N, efine y g(n) = n/3, is surjetive. Proof. Let n N. Notie that g(3n) = (3n)/3 = (3n)/3 = n. Sine 3n N, this shows n is in the range of g. Hene g is surjetive. To prove a funtion, f : A B is surjetive, or onto, we must show f(a) = B. In other wors, we must show the two sets, f(a) an B, are equal. We alreay know that f(a) B if f is a well-efine funtion. While most funtions enountere in a ourse using algerai funtions are well-efine, this shoul not e an automati assumption in general. With that sai, though, we will usually assume the funtions given to us are well efine, so all that must e shown is that B f(a). To o this we may use the efinition of a suset: show every element of B is also an element of f(a). Thus we egin the proof y fiing an aritrary element of B. We then use the tools at our isposal (efinition of the funtion, algera, any other known information) to show that this aritrary element must in fat e the image of some element of A Eample Eample Prove that the funtion g : N N, efine y g(n) = n/3, is not injetive. Proof. The numers 1 an 2 are in the omain of g an are not equal, ut g(1) = g(2) = 0. Thus g is not injetive. To show a funtion is not injetive we must show [( A)( y A)[( y) (f() f(y))]]. This is equivalent to ( A)( y A)[( y) (f() = f(y))].
5 2. PROPERTIES OF FUNCTIONS 115 Thus when we show a funtion is not injetive it is enough to fin an eample of two ifferent elements in the omain that have the same image Eample Eample Prove that the funtion f : N N e efine y f(n) = n 2, is not surjetive. Proof. The numer 3 is an element of the oomain, N. However, 3 is not the square of any integer. Therefore, there is no element of the omain that maps to the numer 3, so f is not surjetive. To show a funtion is not surjetive we must show f(a) B. Sine a well-efine funtion must have f(a) B, we shoul show B f(a). Thus to show a funtion is not surjetive it is enough to fin an element in the oomain that is not the image of any element of the omain. You may assume the familiar properties of numers in this moule as one in the previous eamples Inverse Funtions. Definition Suppose f : A B is a ijetion. Then the inverse of f, enote f 1 : B A, is the funtion efine y the rule f 1 (y) = if an only if f() = y. If a funtion f is a ijetion, then it makes sense to efine a new funtion that reverses the roles of the omain an the oomain, ut uses the same rule that efines f. This funtion is alle the inverse of the f. If the funtion is not a ijetion, it oes not have an inverse. You have seen many funtions in algera an alulus that are efine as inverses of other funtions. For eample, the square-root funtion is efine y the rule y = if an only if y 0 an y 2 =. That is, the square-root funtion is the inverse of the square funtion. Before we an invert the square funtion, however, its usual omain, the set of all real numers, must e restrite to the set of nonnegative real numers in orer to have a ijetion. That is, if A = B = { R : 0},
6 2. PROPERTIES OF FUNCTIONS 116 then the funtion f : A B efine y f() = 2 is a ijetion, an its inverse f 1 : B A is the square-root funtion, f 1 () =. Another important eample from algera is the logarithm funtion. If a is a positive real numer, ifferent from 1, an R + = { R : > 0}, the funtion f : R R + efine y f() = a is a ijetion. Its inverse, f 1 : R + R, is the logarithm funtion with ase a: f 1 () = log a. In other wors y = log a if an only if a y =. Eample Let f : A B, where A = {a,,, } an B = {v, w,, y}, e efine as follows a v w y Then the inverse funtion is f 1 : B A efine as follows v a w y Eample Suppose f : R {2} R {1} is efine y f() = 2. Then the funtion f 1 () = 2 is the inverse of f. This is a goo eample of an 1 algeraially efine funtion whose inverse has a nie formula speifying its rule. You may reall that the formula efining f 1 an e otaine y setting y = f() = 2, interhanging an y, an solving algeraially for y. Eerise Fin the inverse of the funtion f : R { 2} R {1} efine y f() =
7 2. PROPERTIES OF FUNCTIONS 117 Eerise Fin the inverse of the funtion f : R (, 1) efine y f() = 1 e. Theorem If a funtion is a ijetion, then its inverse is also a ijetion. Proof. Let f : A B e a ijetion an let f 1 : B A e its inverse. To show f 1 is a ijetion we must show it is an injetion an a surjetion. Let 1, 2 B e suh that f 1 ( 1 ) = f 1 ( 2 ). Then y the efinition of the inverse we have 1 = f(f 1 ( 2 )) = 2. This shows f 1 is injetive. We leave the proof that f 1 is surjetive as an eerise for the reaer. Eerise Finish the proof of Theorem Inverse Image. Definition Let f : A B an let S e a suset of B. Then the inverse image of S uner f is the set f 1 (S) = { A f() S}. There is no requirement for f to e injetive or surjetive for this efinition to hol. Eample Let f : A B, where A = {a,,, } an B = {, y, z} e efine as follows a y z f 1 ({z}) = {, } f 1 ({, y}) = {a, } We revisit the efinition of the inverse image of a set to emphasize the ifferene etween the inverse image of a suset of the oomain an the inverse of a funtion. The inverse image of a set is the set of all elements that map into that set. The funtion oes not have to e injetive or surjetive to fin the inverse image of a set. For eample, the funtion f(n) = 1 with omain an oomain all natural numers
8 2. PROPERTIES OF FUNCTIONS 118 woul have the following inverse images: f 1 ({1}) = N an f 1 ({5, 6, 7, 8, 9}) =. This funtion oes not have an inverse, however. The ontet of the use of the notation f 1 usually iniates if the inverse image or the inverse funtion is intene. If A is a suset of the oomain we woul always assume f 1 (A) is the inverse image of A. When isussing a ijetion the istintion etween the inverse image an inverse funtion is often lurre. Eerise Fin an eample of a funtion f : A B an a set S A where f(s) f(s). Eerise Let f : A B e a funtion an let S B. Prove f 1 (S) = f 1 (S) 2.9. Composition. Definition Let f : A B an g : B C. The omposition of g with f, enote g f, is the funtion from A to C efine y (g f)() = g(f()). Eample Let A = {a,,, }, B = {v, w,, y}, an C = {r, s, t}; an let f : A B an g : B C y efine as follows a v v r w w s t y y Then the omposition g f is as follows a r s t
9 2. PROPERTIES OF FUNCTIONS 119 The omposition of two funtions is efine y following one funtion y another. To efine the omposition g f we must have the range of f ontaine in the omain of g Eample Eample Prove that the omposition of two injetive funtions is injetive. Proof. Let A, B, an C e sets an let f : A B an g : B C e two injetions. Suppose an y are elements of A suh that (g f)() = (g f)(y). This means g(f()) = g(f(y)). Sine the oomain of f is B, f() B an f(y) B. Thus we have two elements of B, f() an f(y), suh that g(f()) = g(f(y)). Sine g is injetive, we must have f() = f(y). But now we may use the fat that f is injetive to onlue = y. This shows that g f is an injetion. Sometimes we have to prove properties aout funtions without any speifi formula for the funtions. In Eample we prove that the omposition of two injetions is again an injetion. We annot use speifi eamples of funtion eause that woul not prove this more general statement. We have to use the tools given y the assumptions, namely, that we know the two funtions that make up the omposition are known to e injetions. Eerise Prove the omposition of two surjetions is a surjetion. Theorem (Corollary to Eample an Eerise ). The omposition of two ijetions is a ijetion. Eerise Prove or isprove: if the omposition of two funtions is an injetion then the two original funtions must e injetions too. Eerise Prove or isprove: if the omposition of two funtions is an surjetion then the two original funtions must e surjetions too.
RED. Name: Math 290 Fall 2016 Sample Exam 3
RED Name: Math 290 Fall 2016 Sample Exam 3 Note that the first 10 questions are true false. Mark A for true, B for false. Questions 11 through 20 are multiple choice. Mark the correct answer on your ule
More informationImplementing the Law of Sines to solve SAS triangles
Implementing the Law of Sines to solve SAS triangles June 8, 009 Konstantine Zelator Dept. of Math an Computer Siene Rhoe Islan College 600 Mount Pleasant Avenue Proviene, RI 0908 U.S.A. e-mail : kzelator@ri.eu
More informationOn the Reverse Problem of Fechnerian Scaling
On the Reverse Prolem of Fehnerian Saling Ehtiar N. Dzhafarov Astrat Fehnerian Saling imposes metris on two sets of stimuli relate to eah other y a isrimination funtion sujet to Regular Minimality. The
More informationA population of 50 flies is expected to double every week, leading to a function of the x
4 Setion 4.3 Logarithmi Funtions population of 50 flies is epeted to doule every week, leading to a funtion of the form f ( ) 50(), where represents the numer of weeks that have passed. When will this
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationMath 225B: Differential Geometry, Homework 6
ath 225B: Differential Geometry, Homework 6 Ian Coley February 13, 214 Problem 8.7. Let ω be a 1-form on a manifol. Suppose that ω = for every lose urve in. Show that ω is exat. We laim that this onition
More informationThe numbers inside a matrix are called the elements or entries of the matrix.
Chapter Review of Matries. Definitions A matrix is a retangular array of numers of the form a a a 3 a n a a a 3 a n a 3 a 3 a 33 a 3n..... a m a m a m3 a mn We usually use apital letters (for example,
More informationMAC Calculus II Summer All you need to know on partial fractions and more
MC -75-Calulus II Summer 00 ll you need to know on partial frations and more What are partial frations? following forms:.... where, α are onstants. Partial frations are frations of one of the + α, ( +
More informationChapter 9. There are 7 out of 50 measurements that are greater than or equal to 5.1; therefore, the fraction of the
Pratie questions 6 1 a y i = 6 µ = = 1 i = 1 y i µ i = 1 ( ) = 95 = s n 95 555. x i f i 1 1+ + 5+ n + 5 5 + n µ = = = f 11+ n 11+ n i 7 + n = 5 + n = 6n n = a Time (minutes) 1.6.1.6.1.6.1.6 5.1 5.6 6.1
More informationZero-Free Region for ζ(s) and PNT
Contents Zero-Free Region for ζs an PN att Rosenzweig Chebyshev heory ellin ransforms an Perron s Formula Zero-Free Region of Zeta Funtion 6. Jensen s Inequality..........................................
More informationEuler and Hamilton Paths
Euler an Hamilton Paths The town of Königserg, Prussia (now know as Kaliningra an part of the Russian repuli), was ivie into four setion y ranhes of the Pregel River. These four setions C A D B Figure:
More informationI F I G R e s e a r c h R e p o r t. Minimal and Hyper-Minimal Biautomata. IFIG Research Report 1401 March Institut für Informatik
I F I G R e s e a r h R e p o r t Institut für Informatik Minimal and Hyper-Minimal Biautomata Markus Holzer Seastian Jakoi IFIG Researh Report 1401 Marh 2014 Institut für Informatik JLU Gießen Arndtstraße
More informationZero-Knowledge Protocols
he People Zero-Knowlege Protools 2 he wars Prover (Peggy) Claim I Verifier (Vi) S Seret Deision 2 {true, false} zero-knowlege protool allows Peggy to Convine Vi that her laim is true an that she knows
More informationThe Natural Logarithm
The Natural Logarithm -28-208 In earlier courses, you may have seen logarithms efine in terms of raising bases to powers. For eample, log 2 8 = 3 because 2 3 = 8. In those terms, the natural logarithm
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationLesson 23: The Defining Equation of a Line
Student Outomes Students know that two equations in the form of ax + y = and a x + y = graph as the same line when a = = and at least one of a or is nonzero. a Students know that the graph of a linear
More informationMost results in this section are stated without proof.
Leture 8 Level 4 v2 he Expliit formula. Most results in this setion are stated without proof. Reall that we have shown that ζ (s has only one pole, a simple one at s =. It has trivial zeros at the negative
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 informationExpressiveness of the Interval Logics of Allen s Relations on the Class of all Linear Orders: Complete Classification
Proeeings of the Twenty-Seon International Joint Conferene on Artifiial Intelligene Expressiveness of the Interval Logis of Allen s Relations on the Class of all Linear Orers: Complete Classifiation Dario
More informationcosh x sinh x So writing t = tan(x/2) we have 6.4 Integration using tan(x/2) 2t 1 + t 2 cos x = 1 t2 sin x =
6.4 Integration using tan/ We will revisit the ouble angle ientities: sin = sin/ cos/ = tan/ sec / = tan/ + tan / cos = cos / sin / tan = = tan / sec / tan/ tan /. = tan / + tan / So writing t = tan/ we
More informationDeterminant and Trace
Determinant an Trace Area an mappings from the plane to itself: Recall that in the last set of notes we foun a linear mapping to take the unit square S = {, y } to any parallelogram P with one corner at
More informationReview Topic 4: Cubic polynomials
Review Topi : ui polynomials Short answer Fatorise Px ( ) = x + 5x + x- 9 into linear fators. The polynomial Px ( ) = x - ax + x- leaves a remainer of when it is ivie y ( x - ) an a remainer of - when
More information3.2 Differentiability
Section 3 Differentiability 09 3 Differentiability What you will learn about How f (a) Might Fail to Eist Differentiability Implies Local Linearity Numerical Derivatives on a Calculator Differentiability
More informationMcCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König
1. Introution MCreight s Suffix Tree Constrution Algorithm Milko Izamski B.S. Informatis Instrutor: Barbara König The main goal of MCreight s algorithm is to buil a suffix tree in linear time. This is
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring
c Dr Oksana Shatalov, Spring 2016 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 informationSummation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant
Computer Science Dept Va Tech August 005 005 McQuain WD Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant g f g f ) ) ))
More informationLogarithms. For example:
Math Review Summation Formulas Let >, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant ± ± g f g f ) ) )) ) S: separate summed terms C C ) 6 ) ) Computer
More information6.4 Dividing Polynomials: Long Division and Synthetic Division
6 CHAPTER 6 Rational Epressions 6. Whih of the following are equivalent to? y a., b. # y. y, y 6. Whih of the following are equivalent to 5? a a. 5, b. a 5, 5. # a a 6. In your own words, eplain one method
More informationLet N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1)
Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: k Cf ( k) C k S: factor out constant f ( k) k ( f ( k) ± g( k)) k S: separate summed terms f ( k) ± k g(
More informationGLOBAL EDITION. Calculus. Briggs Cochran Gillett SECOND EDITION. William Briggs Lyle Cochran Bernard Gillett
GOBA EDITION Briggs Cohran Gillett Calulus SECOND EDITION William Briggs le Cohran Bernar Gillett ( (, ) (, ) (, Q ), Q ) (, ) ( Q, ) / 5 /4 5 5 /6 7 /6 ( Q, 5 5 /4 ) 4 4 / 7 / (, ) 9 / (, ) 6 / 5 / (Q,
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationAdditional Exercises for Chapter 10
Aitional Eercises for Chapter 0 About the Eponential an Logarithm Functions 6. Compute the area uner the graphs of i. f() =e over the interval [ 3, ]. ii. f() =e over the interval [, 4]. iii. f() = over
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 informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More information(, ) Anti Fuzzy Subgroups
International Journal of Fuzzy Mathematis and Systems. ISSN 2248-9940 Volume 3, Number (203), pp. 6-74 Researh India Publiations http://www.ripubliation.om (, ) Anti Fuzzy Subgroups P.K. Sharma Department
More informationRelative Maxima and Minima sections 4.3
Relative Maxima and Minima setions 4.3 Definition. By a ritial point of a funtion f we mean a point x 0 in the domain at whih either the derivative is zero or it does not exists. So, geometrially, one
More informationx = c of N if the limit of f (x) = L and the right-handed limit lim f ( x)
Limit We say the limit of f () as approaches c equals L an write, lim L. One-Sie Limits (Left an Right-Hane Limits) Suppose a function f is efine near but not necessarily at We say that f has a left-hane
More informationMATH 216T Homework 1 Solutions
MATH 216T Homew 1 Solutions 1. Find the greatest ommon divis of 5321 and 1235 and write it as a linear omination of 5321 and 1235. Solution : Using our implementation of the Eulidean Algithm, we easily
More informationUNDERSTANDING INTEGRATION
UNDERSTANDING INTEGRATION Dear Reaer The concept of Integration, mathematically speaking, is the "Inverse" of the concept of result, the integration of, woul give us back the function f(). This, in a way,
More informationPOSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive
More informationON TAUBERIAN CONDITIONS FOR (C, 1) SUMMABILITY OF INTEGRALS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 54, No. 2, 213, Pages 59 65 Publishe online: December 8, 213 ON TAUBERIAN CONDITIONS FOR C, 1 SUMMABILITY OF INTEGRALS Abstract. We investigate some Tauberian
More informationAuthors Gregory Hartman, Ph.D. Brian Heinold, Ph.D. Troy Siemers, Ph.D. Dimplekumar Chalishajar, Ph.D. Editor Jennifer Bowen, Ph.D.
Section 7 Derivatives of Inverse Functions AP E XC I Version 0 Authors Gregory Hartman, PhD Department of Applie Mathema cs Virginia Military Ins tute Brian Heinol, PhD Department of Mathema cs an Computer
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationSampler-B. Secondary Mathematics Assessment. Sampler 521-B
Sampler-B Seonary Mathematis Assessment Sampler 51-B Instrutions for Stuents Desription This sample test inlues 15 Selete Response an 5 Construte Response questions. Eah Selete Response has a value of
More informationIf the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:
Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions
More informationComplete Shrimp Game Solution
Complete Shrimp Game Solution Florian Ederer Feruary 7, 207 The inverse demand urve is given y P (Q a ; Q ; Q ) = 00 0:5 (Q a + Q + Q ) The pro t funtion for rm i = fa; ; g is i (Q a ; Q ; Q ) = Q i [P
More informationfinalsol.nb In my frame, I am at rest. So the time it takes for the missile to reach me is just 8µ106 km
finalsol.n Physis D, Winter 005 Final Exam Solutions Top gun a v enemy = 0.4 in my enemy's frame, v' missile = 0.7 0.4 + 0.7 so, in my frame, v missile = Å º 0.859 +H0.4 H0.7 (it must e less than!) In
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 informationJournal of Mathematical Analysis and Applications
J. Math. Anal. Appl. 371 (010) 759 763 Contents lists available at SieneDiret Journal of Mathematial Analysis an Appliations www.elsevier.om/loate/jmaa Singular Sturm omparison theorems Dov Aharonov, Uri
More informationSupplementary Materials for A universal data based method for reconstructing complex networks with binary-state dynamics
Supplementary Materials for A universal ata ase metho for reonstruting omplex networks with inary-state ynamis Jingwen Li, Zhesi Shen, Wen-Xu Wang, Celso Greogi, an Ying-Cheng Lai 1 Computation etails
More informationSolutions to Practice Problems Tuesday, October 28, 2008
Solutions to Practice Problems Tuesay, October 28, 2008 1. The graph of the function f is shown below. Figure 1: The graph of f(x) What is x 1 + f(x)? What is x 1 f(x)? An oes x 1 f(x) exist? If so, what
More information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationOptimization Notes. Note: Any material in red you will need to have memorized verbatim (more or less) for tests, quizzes, and the final exam.
MATH 2250 Calculus I Date: October 5, 2017 Eric Perkerson Optimization Notes 1 Chapter 4 Note: Any material in re you will nee to have memorize verbatim (more or less) for tests, quizzes, an the final
More information2.6 Absolute Value Equations
96 CHAPTER 2 Equations, Inequalities, and Problem Solving 89. 5-8 6 212 + 2 6-211 + 22 90. 1 + 2 6 312 + 2 6 1 + 4 The formula for onverting Fahrenheit temperatures to Celsius temperatures is C = 5 1F
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationDerivatives and the Product Rule
Derivatives an the Prouct Rule James K. Peterson Department of Biological Sciences an Department of Mathematical Sciences Clemson University January 28, 2014 Outline Differentiability Simple Derivatives
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More informationcosh x sinh x So writing t = tan(x/2) we have 6.4 Integration using tan(x/2) = 2 2t 1 + t 2 cos x = 1 t2 We will revisit the double angle identities:
6.4 Integration using tanx/) We will revisit the ouble angle ientities: sin x = sinx/) cosx/) = tanx/) sec x/) = tanx/) + tan x/) cos x = cos x/) sin x/) tan x = = tan x/) sec x/) tanx/) tan x/). = tan
More informationAvoiding maximal parabolic subgroups of S k
Discrete Mathematics an Theoretical Computer Science 4, 2000, 67 77 Avoiing maximal paraolic sugroups of S k Toufik Mansour 1 an Alek Vainshtein 2 Department of Mathematics an Department of Computer Science,
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationarxiv: v1 [quant-ph] 30 Jan 2019
Universal logial gates with onstant overhea: instantaneous Dehn twists for hyperoli quantum oes Ali Lavasani, Guanyu Zhu, an Maissam Barkeshli Department of Physis, Conense Matter Theory Center, University
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationSection 2.1 The Derivative and the Tangent Line Problem
Chapter 2 Differentiation Course Number Section 2.1 The Derivative an the Tangent Line Problem Objective: In this lesson you learne how to fin the erivative of a function using the limit efinition an unerstan
More informationLecture 4 : General Logarithms and Exponentials. a x = e x ln a, a > 0.
For a > 0 an x any real number, we efine Lecture 4 : General Logarithms an Exponentials. a x = e x ln a, a > 0. The function a x is calle the exponential function with base a. Note that ln(a x ) = x ln
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationSIMPLE NONLINEAR GRAPHS
S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle
More informationStructural and Strongly Structural Input and State Observability of Linear Network Systems
Strutural an Strongly Strutural Input an State Oservaility of Linear Network Systems Sein Gray Feeria Garin Alain Kiangou To ite this version: Sein Gray Feeria Garin Alain Kiangou Strutural an Strongly
More informationMicroeconomic Theory I Assignment #7 - Answer key
Miroeonomi Theory I Assignment #7 - Answer key. [Menu priing in monopoly] Consider the example on seond-degree prie disrimination (see slides 9-93). To failitate your alulations, assume H = 5, L =, and
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationModule FP2. Further Pure 2. Cambridge University Press Further Pure 2 and 3 Hugh Neill and Douglas Quadling Excerpt More information
5548993 - Further Pure an 3 Moule FP Further Pure 5548993 - Further Pure an 3 Differentiating inverse trigonometric functions Throughout the course you have graually been increasing the number of functions
More informationChapter 2: One-dimensional Steady State Conduction
1 Chapter : One-imensional Steay State Conution.1 Eamples of One-imensional Conution Eample.1: Plate with Energy Generation an Variable Conutivity Sine k is variable it must remain insie the ifferentiation
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationFunctions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2
Functions 4-3-2008 Definition. A function f from a set X to a set Y is a subset S of the product X Y such that if (, y 1 ), (, y 2 ) S, then y 1 = y 2. Instead of writing (, y) S, you usually write f()
More informationComputing 2-Walks in Cubic Time
Computing 2-Walks in Cubi Time Anreas Shmi Max Plank Institute for Informatis Jens M. Shmit Tehnishe Universität Ilmenau Abstrat A 2-walk of a graph is a walk visiting every vertex at least one an at most
More informationBidirectionalizing Graph Transformations
Biiretionalizing Graph Transformations Soihiro Hiaka Kazuhiro Inaa Zhenjiang Hu Hiroyuki Kato National Institute of Informatis, Japan {hiaka,hu,kinaa,kato}@nii.a.jp Kazutaka Matsua Tohoku University, Japan
More informationChapter 2. Exponential and Log functions. Contents
Chapter. Exponential an Log functions This material is in Chapter 6 of Anton Calculus. The basic iea here is mainly to a to the list of functions we know about (for calculus) an the ones we will stu all
More informationMethods of evaluating tests
Methods of evaluating tests Let X,, 1 Xn be i.i.d. Bernoulli( p ). Then 5 j= 1 j ( 5, ) T = X Binomial p. We test 1 H : p vs. 1 1 H : p>. We saw that a LRT is 1 if t k* φ ( x ) =. otherwise (t is the observed
More informationSection 7.2. The Calculus of Complex Functions
Section 7.2 The Calculus of Complex Functions In this section we will iscuss limits, continuity, ifferentiation, Taylor series in the context of functions which take on complex values. Moreover, we will
More informationThe Complete Energy Translations in the Detailed. Decay Process of Baryonic Sub-Atomic Particles. P.G.Bass.
The Complete Energy Translations in the Detailed Deay Proess of Baryoni Su-Atomi Partiles. [4] P.G.Bass. PGBass P12 Version 1..3 www.relativitydomains.om August 218 Astrat. This is the final paper on the
More informationLesson 2.1 Inductive Reasoning
Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,
More informationf(x + h) f(x) f (x) = lim
Introuction 4.3 Some Very Basic Differentiation Formulas If a ifferentiable function f is quite simple, ten it is possible to fin f by using te efinition of erivative irectly: f () 0 f( + ) f() However,
More informationDECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x),
More informationNOTES ON GROUPOIDS, IMAGINARIES AND INTERNAL COVERS
NOTES ON GROUPOIDS, IMAGINARIES AND INTERNAL COVERS OLEG CHTERENTAL April 30, 2009 These notes are an exposition of the beginning of Ehud Hrushovski s paper Groupoids, Imaginaries and Internal Covers.
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationDEBRUIJN-LIKE SEQUENCES AND THE IRREGULAR CHROMATIC NUMBER OF PATHS AND CYCLES
DEBRUIJN-LIKE SEQUENCES AND THE IRREGULAR CHROMATIC NUMBER OF PATHS AND CYCLES MICHAEL FERRARA, CHRISTINE LEE, PHIL WALLIS DEPARTMENT OF MATHEMATICAL AND STATISTICAL SCIENCES UNIVERSITY OF COLORADO DENVER
More informationMATH Non-Euclidean Geometry Exercise Set #8 Solutions
MATH 68-9 Non-Euliean Geometry Exerise Set #8 Let ( ab, :, ) Show that ( ab, :, ) an ( a b) to fin ( a, : b,, ) ( a, : b,, ) an ( a, : b, ) Sine ( ab, :, ) while Likewise,, we have ( a, : b, ) ( ab, :,
More informationTWO TO ONE IMAGES AND PFA
TWO TO ONE IMAGES AND PFA ALAN DOW Astract. We prove that all maps on N that are exactly two to one are trivial if PFA is assumed. 1. Introduction A map f : X K is precisely two to one if for each k K,
More informationSolving Right Triangles Using Trigonometry Examples
Solving Right Triangles Using Trigonometry Eamples 1. To solve a triangle means to find all the missing measures of the triangle. The trigonometri ratios an be used to solve a triangle. The ratio used
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More information1 Lecture 13: The derivative as a function.
1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple
More informationExamining Applied Rational Functions
HiMAP Pull-Out Setion: Summer 1990 Eamining Applied Rational Funtions Flod Vest Referenes Environmental Protetion Agen. Gas Mileage Guide. (Copies an usuall e otained from a loal new ar dealer.) Information
More information