Review: set theoretic definition of the numbers. Natural numbers:

Size: px
Start display at page:

Download "Review: set theoretic definition of the numbers. Natural numbers:"

Transcription

1 Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies ; (T) trnsitive if nd c implies c, i.e. p ^ cq ñ c An equivlence reltion on set A is inry reltion tht is reflexive, symmetric, nd trnsitive. Review: set theoretic definition of the numers. Nturl numers: Let 0 H. Given n, definethesuccessor to n s Spnq n Ytnu. (By successor to n we siclly men n ` 1.) Let Z 0 e the set of ll sets generted y 0 nd S. Integers: Define Z y formlly letting Z 0 t n n P Z 0 u, where 0 0; nd Z Z 0 Y Z 0.ExtendS : Z Ñ Z y defining Sp q for ny P N t0u s Sp q, where Spq. Some opertions: Define ` : N ˆ N Ñ N y, for ll, P N, y ` 0 nd ` Spq Sp ` q. Define : N ˆ N Ñ N y, for ll, P N, n 0 0 nd Spq p q`.

2 Review: Some properties of ` nd (we present without proof): 1. Addition nd multipliction stisfy commuttivity, ssocitivity, nd distriutivity. 2. We still hve ` 0 0 ` (dditive identity) nd 1 1 (multiplictive identity) forll P Z. 3. We lso hve `p q 0 (prove). (dditive inverses) We cll ny numer system tht hs n ddition nd multipliction tht stisfy ll these properties (commuttive) ring. Order: For, P Z, wesy if SpSp Spq qq. Properties of order (we present without proof): (i) For ll, P N, wehve or. (ii) If nd, then. (iii) If nd c, then c. (iv) If then ` c ` c. (v) If then c c. Rtionl numers Let Q Z ˆpZ t0uq, nd define n equivlence reltion on Q y p, q px, x q for ll x P Z t0u. Under this equivlence reltion, write rp, qs. Then rtionl numers re! ) Q ˇ, P Z, 0. (Note tht we get lzy, nd write 1.) Define ` : Q ˆ Q Ñ Q nd : Q ˆ Q Ñ Q y ` c d d ` c nd d c d c d.

3 Let Q Z ˆpZ t0uq nd define n equivlence reltion on Q y p, q px, x q for ll x P Z t0u. Under this equivlence reltion, write rp, qs (writing 1 ). Then rtionl numers re! ) Q ˇ, P Z, 0. Define ` : Q ˆ Q Ñ Q nd : Q ˆ Q Ñ Q y ` c d d ` c nd d c d c d. Agin Addition nd multipliction still stisfy commuttivity, ssocitivity, nd distriutivity. 2. We still hve x ` 0 x (dditive identity) ndx 1 x (multiplictive identity) forllxpq. 3. We lso hve tht x `p xq 0. (dditive inverses) So Q is lso (commuttive) ring. In ddition, for ll { P Q with 0, 1 This mkes Q field (gin, modern lger). (multiplictive inverses). Order on Q Define (you cn show á ). We define on Q y the following: for,, c, d P N, wehve 1. c d 2. c d ;nd whenever d c; 3. c d whenever c d. Then, gin, (i) For ll, P N, wehve or. (ii) If nd, then. (iii) If nd c, then c. (iv) If then ` c ` c. (v) If nd 0 c, thenc c. This mkes Q into n ordered field.

4 Let X e n ordered set of numers (think N, Z, Q, nd, eventully, R), nd let S e nonempty suset of X. () If S contins lrgest element x (x P S nd for ll y P S, y x), then we cll x mxpsq the mximum if S. Creful writing note: Compre to, The mximum of S is n element x P S stisfying y x for ll y P S. Wht s wrong? () If S contins smllest element x (x P S nd for ll y P S, y x), then we cll x minpsq the minimum of S. Ex: If S t 2, 1{2, 100{3u, thenminpsq 2, mxpsq 100{3. Ex: If S Ñ Z 0 is finite, then mxpsq s nd minpsq s. sps sps Ex: If S is finite, then mxpsq nd minpsq exist. Ex: For S Z 0, minpsq 1 nd mxpsq does not exist. Ex: For S Q 0, minpsq nd mxpsq do not exist. Note: Min/mx don t depend on the set X! Let X e n ordered set of numers (think N, Z, Q, nd, eventully, R), nd let S e nonempty suset of X. () If there exists u P X such tht s u for ll s P S, thenu is clled n upper ound of S nd the set S is sid to e ounded ove (y u). Ex: S Q 0 Ñ Q doesn t hve mximl element, ut it does hve n upper ound: u 0. In fct, it hs lots of upper ounds: u 1, u 100, u 101{15, etc.but u 1 is not n upper ound since 1{2 P S nd 1{2 1. Ex: S Q 0 Ñ Q doesn t hve ny upper ounds. Ex: As suset of X Q 0, S Q 0 doesn t hve n upper ound. () Similrly, if there exists ` P X such tht s ` for ll s P S, then ` is clled lower ound of S nd the set S is sid to e ounded elow (y `). Note: Upper nd lower ounds do depend on the set X.

5 Consider X Q nd S tx P Q x 2 ` x 1 0u y y x 2 ` x 1 S Mth Orcle: We cn compute x 2 ` x 1 0 ô x 1 2 p 1?5q RQ. So S doesn t hve minimum or mximum. But S is ounded ove nd elow, e.g. u 1 nd ` 2; or u.62 nd ` 1.62; or... But wht is the est ound? Does it even hve est ound? Orcle: In R, the est ounds re ` 1 2 p 1?5q nd u 1?5q. 2p 1 ` x Let X e n ordered set of numers (think N, Z, Q, nd, eventully, R), nd let S e nonempty suset of X. From efore: If there exists u P X such tht s u for ll s P S, thenu is clled n upper ound of S nd the set S is sid to e ounded ove (y u). Similrly, lower ound is numer ` P X such tht s ` for ll s P S; if` exists, we sy S is ounded elow. () If S is ounded ove, we cll n upper ound U stisfying U u for ll upper ounds u the lest upper ound or supremum of S, denoted y sup S. sup S min ptu P X u s for ll s P Suq () If S is ounded elow, we cll lower ound L stisfying L ` for ll lower ounds ` the gretest lower ound or infimum of S, denoted y inf S. inf S mx pt` P X ` s for ll s P Suq

6 Bck to X Q nd S tx P Q x 2 ` x 1 0u. y Orcle: In R, lower ounds Therefore, even though inf S S sup S y x 2 ` x 1 x upper ounds inf S 1 2 p 1?5q nd sup S 1?5q. p 1 ` 2 t` P X ` s for ll s P Su nd tu P X u s for ll s P Su re non-empty, inf S nd sup S don t exist in Q. Thm. The rtionl numers re incomplete in the sense tht there exist ounded susets tht do not hve infimums or supremums. Gol: Define the completion of Q the smllest set contining Q so tht every set tht s ounded ove/elow hs sup/inf. (R) Completeness Axiom: Every non-empty suset of R tht is ounded ove hs lest upper ound, i.e. for ll S Ñ R, ifs is ounded ove, then sup S exists nd is in R. The rel numers Let R e the set of susets of Q tht stisfy the following: C P R whenever 1. C à Q nd C H (C is proper, non-empty suset of Q); 2. for ll x P C, ify P Q stisfies y x, theny P C 3. mx C does not exist. (if x P C, theneverythinglessthnx is lso in C); (Recll, in contrst to upper ounds, mx C hs to e n element of C.) Orcle: R consists entirely of sets of the form tx P Q x u p 8,q Sets in R re clled Dedekind cuts, nd R R is the set of rel numers. for some fixed P R. Intuition: identify P R with the cut tx P Q x u PR. Thm. The completeness xiom holds. (This should feel uncomfortle... n xiom shouldn t hve to e proven! Whether this is n xiom or theorem depends on your perspective... )

7 Opertions Intuition: R consists entirely of sets of the form For, tx P Q x u p 8,q for some fixed P R. P R, define ` t` P,P u. Creful: wedo not wnt to define y t P,P u! Exmple: Consider p 1q p 1q. We certinly need this to e 1 tx P Q x 1u. Compre to t, Pp 1q u. This ltter set contins, for exmple, p 2qp 3q 6 R 1. Insted: for non-negtive, P R (i.e. 0, 0 H), define 1. t P 0,P 0 uyq 0 ; 2. t x P Q x for ll P u; 3. p q; nd 4. p q p q. x Addition: For, P R, define ` t ` P,P u. Multipliction: For non-negtive, P R (i.e. 0, 0 H), define t P 0,P 0 uyq 0 ; t x P Q x for ll P u; p q; nd p q p q. Agin Addition nd multipliction still stisfy commuttivity, ssocitivity, nd distriutivity. 2. We still hve ` 0 x (dditive identity) nd 1 (multiplictive identity) forll P R. 3. We lso hve tht `p q 0. (dditive inverses) 4. Dor ll P R with 0, thereexists 1 P R tht stisfies 1 1 (multiplictive inverses). So R field (gin, modern lger).

8 Intuition: R consists entirely of sets of the form tx P Q x u p 8,q for some fixed P R. For ll P Q, we cn concretely identify with tx P Q x u PR. Nmely, Q Ñ R defined y fiñ is n injective mp, which will respect ddition, multipliction, nd order (once we define them). Comprisons: For, P R, define whenever Ñ. Thm. (Archimeden property) If, 0, thenthereexists n P N such tht n. Thm. (Denseness of Q) If, thenthereexistsc P Q such tht c. x

9 Wrpping up 1. Context is king! You cn do most mth t ny level of strction. For exmple, there s huge di erence etween wht you cn ssume when working in set theory versus clculus. 2. Go slowly when reding/writing new mth. Py ttention to detils! For exmple, the simple inversion of quntifiers cn mess whole sttement up. 3. Alwys do exmples! Illustrtive exmples cn help you understnd the ig picture; extreme exmples help you understnd the detils. And if you don t know where to strt, then do n exmple! 4. Revise, revise, revise. When solving mth prolems, lot goes on ehind the scenes. Don t e frid to write down logicl fllcies (like strting with the conclusion, or proof y exmple ) in the privcy of your own home. Just don t stop there! Tip: Keep old ides or notes to yourself in your.tex file, commented out with % s, in cse you need them gin lter. 5. Mth isn t liner; mth is frctl. While logicl rgument needs to come in logicl order, there isn t just one good order to explin ll of mth. In prticulr, every good nswer spins o mny good questions! 6. You cn do it!! Be kind to yourself! If you don t get something right wy, tht doesn t men you re stupid, or tht you cn t get there. Mth is hrd, ut dole; nd the struggle is wht mkes the rekthroughs so fun!

In words: Let be the relation on Z given by a b if a b. (Note that we use language like in definitions, where if actually means if and only if.

In words: Let be the relation on Z given by a b if a b. (Note that we use language like in definitions, where if actually means if and only if. Reltions A binry reltion on set A is subset R Ñ A ˆ A, where elements p, bq re written s b. Exmple: A Z nd R t b bu. In words: Let be the reltion on Z given by b if b. (Note tht we use lnguge like in definitions,

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Theory of the Integral

Theory of the Integral Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:

More information

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

Lecture 2: Fields, Formally

Lecture 2: Fields, Formally Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of

More information

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4) 10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonal Complement (pages ) Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

More information

Beginning Darboux Integration, Math 317, Intro to Analysis II

Beginning Darboux Integration, Math 317, Intro to Analysis II Beginning Droux Integrtion, Mth 317, Intro to Anlysis II Lets strt y rememering how to integrte function over n intervl. (you lerned this in Clculus I, ut mye it didn t stick.) This set of lecture notes

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #1 CORRECTION Alger I 2 1 / 0 9 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O 1. Suppose nd re nonzero elements of field F. Using only the field xioms,

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Exercises with (Some) Solutions

Exercises with (Some) Solutions Exercises with (Some) Solutions Techer: Luc Tesei Mster of Science in Computer Science - University of Cmerino Contents 1 Strong Bisimultion nd HML 2 2 Wek Bisimultion 31 3 Complete Lttices nd Fix Points

More information

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q. 1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

MAT 215: Analysis in a single variable Course notes, Fall Michael Damron

MAT 215: Analysis in a single variable Course notes, Fall Michael Damron MAT 215: Anlysis in single vrible Course notes, Fll 2012 Michel Dmron Compiled from lectures nd exercises designed with Mrk McConnell following Principles of Mthemticl Anlysis, Rudin Princeton University

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Improper Integrals, and Differential Equations

Improper Integrals, and Differential Equations Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

Lecture 2 : Propositions DRAFT

Lecture 2 : Propositions DRAFT CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte

More information

The usual algebraic operations +,, (or ), on real numbers can then be extended to operations on complex numbers in a natural way: ( 2) i = 1

The usual algebraic operations +,, (or ), on real numbers can then be extended to operations on complex numbers in a natural way: ( 2) i = 1 Mth50 Introduction to Differentil Equtions Brief Review of Complex Numbers Complex Numbers No rel number stisfies the eqution x =, since the squre of ny rel number hs to be non-negtive. By introducing

More information

7. Indefinite Integrals

7. Indefinite Integrals 7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

The Henstock-Kurzweil integral

The Henstock-Kurzweil integral fculteit Wiskunde en Ntuurwetenschppen The Henstock-Kurzweil integrl Bchelorthesis Mthemtics June 2014 Student: E. vn Dijk First supervisor: Dr. A.E. Sterk Second supervisor: Prof. dr. A. vn der Schft

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

IMPORTANT THEOREMS CHEAT SHEET

IMPORTANT THEOREMS CHEAT SHEET IMPORTANT THEOREMS CHEAT SHEET BY DOUGLAS DANE Howdy, I m Bronson s dog Dougls. Bronson is still complining bout the textbook so I thought if I kept list of the importnt results for you, he might stop.

More information

Introduction to Algebra - Part 2

Introduction to Algebra - Part 2 Alger Module A Introduction to Alger - Prt Copright This puliction The Northern Alert Institute of Technolog 00. All Rights Reserved. LAST REVISED Oct., 008 Introduction to Alger - Prt Sttement of Prerequisite

More information

Advanced Calculus I (Math 4209) Martin Bohner

Advanced Calculus I (Math 4209) Martin Bohner Advnced Clculus I (Mth 4209) Spring 2018 Lecture Notes Mrtin Bohner Version from My 4, 2018 Author ddress: Deprtment of Mthemtics nd Sttistics, Missouri University of Science nd Technology, Roll, Missouri

More information

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved.

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved. Clculus Module C Ares Integrtion Copright This puliction The Northern Alert Institute of Technolog 7. All Rights Reserved. LAST REVISED Mrch, 9 Introduction to Ares Integrtion Sttement of Prerequisite

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018 CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA

More information

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2. Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot

More information

Finite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh

Finite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is

More information

Lecture 09: Myhill-Nerode Theorem

Lecture 09: Myhill-Nerode Theorem CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives

More information

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.) MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6.1 INTRO to LAPLACE TRANSFORMS Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

10. AREAS BETWEEN CURVES

10. AREAS BETWEEN CURVES . AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

More information

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

and that at t = 0 the object is at position 5. Find the position of the object at t = 2. 7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we

More information

Chapter 1: Fundamentals

Chapter 1: Fundamentals Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,

More information

Math Lecture 23

Math Lecture 23 Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

QUADRATIC EQUATIONS OBJECTIVE PROBLEMS

QUADRATIC EQUATIONS OBJECTIVE PROBLEMS QUADRATIC EQUATIONS OBJECTIVE PROBLEMS +. The solution of the eqution will e (), () 0,, 5, 5. The roots of the given eqution ( p q) ( q r) ( r p) 0 + + re p q r p (), r p p q, q r p q (), (d), q r p q.

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016

MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016 Nme (Lst nme, First nme): MTH 502 Liner Algebr Prctice Exm - Solutions Feb 9, 206 Exm Instructions: You hve hour & 0 minutes to complete the exm There re totl of 6 problems You must show your work Prtil

More information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

CS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7

CS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7 CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop

More information

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS 33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

More information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model: 1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd

More information

Math Solutions to homework 1

Math Solutions to homework 1 Mth 75 - Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

Linear Algebra 1A - solutions of ex.4

Linear Algebra 1A - solutions of ex.4 Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Multidimensional. MOD Planes. W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache

Multidimensional. MOD Planes. W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache Multidimensionl MOD Plnes W. B. Vsnth Kndsmy Ilnthenrl K Florentin Smrndche 2015 This book cn be ordered from: EuropNov ASBL Clos du Prnsse, 3E 1000, Bruxelles Belgium E-mil: info@europnov.be URL: http://www.europnov.be/

More information

Algebraic systems Semi groups and monoids Groups. Subgroups and homomorphisms Cosets Lagrange s theorem. Ring & Fields (Definitions and examples)

Algebraic systems Semi groups and monoids Groups. Subgroups and homomorphisms Cosets Lagrange s theorem. Ring & Fields (Definitions and examples) Prepred y Dr. A.R.VIJAYALAKSHMI Algeric systems Semi groups nd monoids Groups Sugroups nd homomorphms Cosets Lgrnge s theorem Ring & Fields (Definitions nd exmples Stndrd Nottions. N :Set of ll nturl numers.

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C. Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex

More information

NOTES ON HILBERT SPACE

NOTES ON HILBERT SPACE NOTES ON HILBERT SPACE 1 DEFINITION: by Prof C-I Tn Deprtment of Physics Brown University A Hilbert spce is n inner product spce which, s metric spce, is complete We will not present n exhustive mthemticl

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Lecture 6. Notes. Notes. Notes. Representations Z A B and A B R. BTE Electronics Fundamentals August Bern University of Applied Sciences

Lecture 6. Notes. Notes. Notes. Representations Z A B and A B R. BTE Electronics Fundamentals August Bern University of Applied Sciences Lecture 6 epresenttions epresenttions TE52 - Electronics Fundmentls ugust 24 ern University of pplied ciences ev. c2d5c88 6. Integers () sign-nd-mgnitude representtion The set of integers contins the Nturl

More information