Model Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions
|
|
- Ami Tyler
- 6 years ago
- Views:
Transcription
1 Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical, the T is complete. Solutio: Let M, N be models of T. By assumptio both are ifiite so, by the Dowwards Löweheim-Skolem Theorem, each has a coutable elemetary substructure: M 0 M, N 0 N. By assumptio M 0 N 0, hece M 0 N 0. So we have M M 0 N 0 N ad M N, as required. Exercise 7.7. Show that T dlo is ot κ-categorical where κ is the cardiality of the cotiuum. Solutio: There are various possible solutios. We have to produce two models of cardiality 2 ℵ0 which are ot isomorphic. A useful basic costructio is to take two (or more) ordered sets ad the put oe above the other. For example, take (Q; ) ad(r ad produce two o-isomorphic models of T dlo by placig (R above (Q i the first ad placig (Q above (R i the secod. Explicitly, defie P 1 =({0} Q) ({1} R ad order this by (0,x) < (1,y) for all x, y ad, for i =1, 2, (i, x) (i, y) iffx y. The defie a orderig o P 2 =({0} R) ({1} Q i the same way. Note that the cardialities of both P 1 ad P 2 are that of the cotiuum. Also both are easily see to be desely, totally, ordered ad to have o greatest or least elemet. But they are ot isomorphic because there are elemets a P 1 such that there are oly coutably may b P 1 with b<a; whereas every elemet i P 2 has ucoutably may elemets below it. p. 29 of the Notes Show that the property ( ), which characterises the Radom Graph, is elemetary, meaig that there is some setece σ orset,σ,of seteces i the appropriate laguage L such that the L-structures with property ( ) are exactly those which satisfy σ/σ. Solutio: I fact we eed to use a ifiite set of seteces. For each m, (i fact, it would be eough to do it for m = ) we write dow a setece which says that, give two disjoit sets, the first with m elemets ad the secod with elemets, there is a elemet which is related to each poit i the first set ad to oe of those i the secod set. Formally, this is i=m,j= ( x 1,...,x m, y 1,...,y ( i=1,j=1 m x i y j ) z ( R(z,x i ) R(z,y j )) ). Exercise 8.7 Prove that if W is ay fiite subset of Ra the the iduced subgraph o Ra \ W is isomorphic to the Radom Graph. Solutio: We check property ( ). So let U, V be fiite disjoit subsets of Ra \ W. The W U, V are fiite disjoit subsets of Ra so there is z RawhichiscoectedtoeachelemetofW U adtooelemetofv. I particular, z is coected to each elemet of U ad to o elemet of V. i=1 j=1 9
2 Furthermore, sice z iscoectedtoeachelemetofw ad there are o loops i R, z Ra \ W. As required. Exercise 8.8 Does the coclusio of 8.6 still hold if we do t assume that the X i are disjoit? Solutio: No; we ca produce a couterexample. For example, fix z 0 Ra. Let U be the set of w Ra which are coected to z 0 ad let V be the set of those which are ot. So U,V form a partitio of Ra. Note that z V,soV does ot satisfy ( ), hece V is ot a copy of the Radom Graph. Set U = U {z}. Sicez is coected to every poit of U except itself, U also fails to satisfy ( ), hece is ot isomorphic to the Radom Graph. Exercise 8.9 Let S be a coutable model of (Zermelo-Fraekel) set theory. O S defie a graph by joiig x to y iff either x y or y x. Prove that the resultig graph is isomorphic to R. Solutio: Let U, V be fiite disjoit sets of elemets of S. Note that V is a elemet of S ad so, therefore, is Z = U {V }. If u U the u Z, soz is coected to each elemet of U. O the other had, let v V. If v were coected to Z the either v Z - but the, sice U V =, wewouldhave v = V, hece V V which cotradicts the Axiom of Foudatio - or Z v, but the v V Z v - agai cotradictig the Axiom of Foudatio. So we have ( ) as required. Exercise 8.10 R R c where, for ay graph G, we defie G c by replacig the edges of G with o-edges ad the o-edges of G with edges. Solutio: Oce agai, we check coditio ( ); but this is immediate o swappig the roles of U ad V i that coditio. Exercise 8.12 A relatioal structure is said to be ℵ 0 -homogeeous if every isomorphism betwee fiite substructures exteds to a automorphism of the structure. Prove that the Radom Graph is ℵ 0 -homogeeous. Solutio: (Sketch) Give a isomorphism betwee fiite substructures, regard this as the startig poit (a partial isomorphism with fiite domai) of buildig a automorphism of R, ad the use the back-ad-forth argumet (i the lecture otes for Sectio 7) that shows uiqueess of the Radom Graph up to isomorphism. Exercise 8.14 For some specific examples of L, write dow a formula for S(L,). Solutio: This rather depeds o the example(s). Exercise 8.15 Let L be a laguage with o fuctio symbols, oe costat symbol c ad oe uary relatio symbol R, show that S(R(c),) = S( R(c),). Solutio: We show that, for 2, half the models with uderlyig set {1,...,} satisfy R(c) ad half do t (that is, satisfy R(c)). For that it will be eough to defie a bijectio betwee those two sets of L-structures (o a give uderlyig set). That is achieved by pairig the L-structure M =(M; X), where X = R M,withtheL-structure M 0 =(M; M \ X). To see that this gives a bijectio as required, ote that (M 0 ) 0 = M ad that exactly oe of M, M 0 satisfies R(c). Exercise 8.18 Prove that, for ay seteces σ 1,...,σ k T as,wehave k i=1 σ i 10
3 T as. Show that T as is deductively closed, thatis T as = T as. Solutio: Give ε>0, choose 0 such that, for every 0, p(σ, ) > 1 ε k. It follows that p( k i=1 σ i) > 1 ε. Therefore k i=1 σ i T as. Suppose that τ T as,thatis,τ is true i every model of T as. By Compactess (see Corollary/Exercise 9.4) there is a fiite subset {σ 1,σ 2,...,σ k } of T as such that τ is true i all models of {σ 1,σ 2,...,σ k }, that is, i all models of k i=1 σ i. So p(τ,) p( k i=1 σ i,) ad the latter 1as. Hece p(τ,) 1as ad so τ T as, as required. Exercise 8.20 Give a example to show that eve for a laguage with just oe fuctio symbol the 0/1-law will fail. Solutio: We ca try to approach this by thikig up a property which looks like it stads a chace of beig true i (say) about half of all L-structures. The try to prove that this is the case by computig (or estimatig) the proportio of structures o the set {1,...,} of size i which it is true. The umber of L-structures o {1, 2,...,}, that is, fuctios from that set to itself, is. Obvious properties, like beig a bijectio, or omittig just oe elemet from the! 1 rage, do t work (the relevat proportios, ad, ted to zero as teds to ifiity). So we might try to come up with some property that kid of alterates with, or ca roughly be paired with, its opposite. Ad where the umbers ca be computed (at least, estimated) reasoably easily. Ad, if that fails, just try a property where it looks as if the relevat proportios ca be computed/estimated. Which is how I came to try the property of havig at least oe fixed poit (o doubt other properties will work). If we have a set with elemets, the the umber of fuctios from that set to itself with a give fixed poit is ( 1) 1 (sice such a fuctio is essetially a arbitrary fuctio o the remaiig 1 elemets). There are possible fixed poits, so that gives ( 1) 1 such fuctios, except that we have double-couted the fuctios with two or more fixed poits. But, by the same sort of cout, there are o more tha 1 2 ( 1)( 2) 2 of these, so there are at least ( 1) 1 1 2( 1)( 2) 2 fuctios with at least oe fixed poit. Let s ow estimate what fractio this is of all the fuctios from a -elemet set to itself, as. The fractio is: ( 1) 1 1 2( 1)( 2) 2 = ( 1 1 ) ( 1 1 )( 2 ) 2 1 = ( 1 ) ( 2 ) 1 = ( 1 ) 1 ( 1 ) ( 2 ) ( x ) Now take the limit as, usig the formula lim 1+ = e x,to obtai e e 2, which is about 0.3. This shows that the exact value of the limit of the fractios is ot 0 ad, sice it is also bouded above by e 1 < 1, or is it 1. Therefore the 0/1 law does ot hold for this laguage (observe that the property of havig at least oe fixed poit is defiable, by the L-formula xf(x) =x). 11
4 4 Additioal Exercises 1. For each of T dlo ad the (theory of the) Radom Graph, determie all (quatifier-free) 1-, 2- ad 3- types. Solutio: The first thig to otice is that ay type ca be realised i a coutable model (by the Dowwards Löweheim-Skolem Theorem). I the case of T dlo that model is, by 7.3, a copy of (Q; ). Furthermore, by 7.1/7.8, if two fiite tuples from (Q; ) have the same quatifier-free type, that is, the same order-type, the there is a automorphism of (Q; ) takig oe to the other, ad hece (by 4.14, or 12.14) they have the same type. So it is eough to cout the possible order-types of -tuples for =1, 2, 3. By 8.4 ad 8.13 the same applies to the Radom Graph. Start with (Q; ). If = 1 the there is just oe possibility (reflectig that, give ay two elemets, there is a automorphism takig oe to the other). If = 2 the the possibilities are: x 1 = x 2, x 1 <x 2, x 1 >x 2, so there are three 2-types. If = 3 the either x 1 = x 2 = x 3,orx 1 = x 2 with either x 3 <x 1 or x 3 >x 1, or the similar cases with x 1 = x 3 ad with x 2 = x 3 - that makes 7 3-types so far - or all three are distict, ad oe ca see that there are 6 ways of orderig these. So we get 13 3-types altogether. I the case of the Radom Graph the cout goes as follows. If = 1 the there is just oe possibility. If = 2 the the possibilities are: x 1 = x 2, x 1 ad x 2 are coected, x 1 ad x 2 are ot coected, so there are three 2-types. If = 3 the either x 1 = x 2 = x 3,orx 1 = x 2 with either x 3 ad x 1 coected or ot coected, or the similar cases with x 1 = x 3 ad with x 2 = x 3 - that makes 7 3-types so far (just as i the T dlo case). It remais to cout the possibilities whe all three elemets are distict. The we may have: o coectios; oe coectio (three possibilities: x 1 coected to x 2 ; x 1 coected to x 3 ; x 2 coected to x 3 ); two coectios (so oe o-coectio - agai three possibilies); all are coected. That gives = 8 more 3-types, hece 15 3-types altogether. 2.. Give a iteger let K deote the complete graph o vertices (i.e. every vertex is joied to every other vertex). Prove that the theory of K has elimiatio of quatifiers. Solutio: As at the ed of Sectio 7 we must show that the type of a tuple of elemets depeds oly o the isomorphism type of the substructure (that is, subgraph) iduced o that tuple. Suppose that (a 1,...,a m )ad(b 1,...,b m ) are tuples such that, if a i = a j,theb i = b j ad also such that the iduced subgraph o the first tuple is isomorphic, uder the map which takes a i to b i,to the iduced subgraph o the secod tuple - hece, ote, each is isomorphic to K k if k is the umber of distict elemets i the tuples. The ay permutatio of K which is a extesio of the partial isomorphism which takes a i to b i will (fairly clearly) be a automorphism of K ; hece these tuples have the same type, as required. 3. Describe a example of a fiite graph whose theory does ot have elimiatio of quatifiers. 12
5 Solutio: Cosider the graph o {a, b, c} which has a ad b coected but c coected to either. The a ad c satisfy the same quatifier-free formulas (sice the iduced graphs o each of {a} ad {c} are isomorphic, so the apply 4.16(iii)). But the formula yr(x, y) isithetypeofa (take y = b) but ot i the type of c, so that formula caot be equivalet to a quatifier-free oe. 13
Lecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationHomework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.
Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationCS 336. of n 1 objects with order unimportant but repetition allowed.
CS 336. The importat issue is the logic you used to arrive at your aswer.. Use extra paper to determie your solutios the eatly trascribe them oto these sheets. 3. Do ot submit the scratch sheets. However,
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationCardinality Homework Solutions
Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationLecture XVI - Lifting of paths and homotopies
Lecture XVI - Liftig of paths ad homotopies I the last lecture we discussed the liftig problem ad proved that the lift if it exists is uiquely determied by its value at oe poit. I this lecture we shall
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationTopologie. Musterlösungen
Fakultät für Mathematik Sommersemester 2018 Marius Hiemisch Topologie Musterlösuge Aufgabe (Beispiel 1.2.h aus Vorlesug). Es sei X eie Mege ud R Abb(X, R) eie Uteralgebra, d.h. {kostate Abbilduge} R ud
More information3 Gauss map and continued fractions
ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationTest One (Answer Key)
CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationNotes 27 : Brownian motion: path properties
Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More informationUNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY
UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationSingular Continuous Measures by Michael Pejic 5/14/10
Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More informationPUTNAM TRAINING PROBABILITY
PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationSequences, Series, and All That
Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3
More informationProof of Goldbach s Conjecture. Reza Javaherdashti
Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce
More informationPart A, for both Section 200 and Section 501
Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationTutorial F n F n 1
(CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationTheorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.
Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationWorksheet on Generating Functions
Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationMath778P Homework 2 Solution
Math778P Homework Solutio Choose ay 5 problems to solve. 1. Let S = X i where X 1,..., X are idepedet uiform { 1, 1} radom variables. Prove that E( S = 1 ( 1 1 Proof by Day Rorabaugh: Let S = X i where
More informationA REMARK ON A PROBLEM OF KLEE
C O L L O Q U I U M M A T H E M A T I C U M VOL. 71 1996 NO. 1 A REMARK ON A PROBLEM OF KLEE BY N. J. K A L T O N (COLUMBIA, MISSOURI) AND N. T. P E C K (URBANA, ILLINOIS) This paper treats a property
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationpage Suppose that S 0, 1 1, 2.
page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The
More informationSYDE 112, LECTURE 2: Riemann Sums
SYDE, LECTURE : Riema Sums Riema Sums Cosider the problem of determiig the area below the curve f(x) boud betwee two poits a ad b. For simple geometrical fuctios, we ca easily determie this based o ituitio.
More information