1 / 34

Intro to Maths for CS: 2012/13 Sets (contd, week 2)

Intro to Maths for CS: 2012/13 Sets (contd, week 2). John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK. Reminder of Week 1. Some Properties of those Operations. Union and intersection are commutative (“can switch”) : A  B = B  A

reed-gamble
Download Presentation

Intro to Maths for CS: 2012/13 Sets (contd, week 2)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Intro to Maths for CS:2012/13Sets (contd, week 2) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

  2. Reminder of Week 1

  3. Some Properties of those Operations • Union and intersection are commutative • (“can switch”): • AB = BA • A  B = B  A • Union and intersection are associative • (“can group differently”): • A (B  C) = (AB)  C • A  (B  C) = (A  B)  C • Because of associativity, we can omit parentheses: • AB  C  D A  B  C  D

  4. Two Other Properties • Union distributes over intersection: • A(B  C) = (AB)  (A  C) • Intersection distributes over union: • A(B  C) = (AB) (A  C)

  5. New for Week 2

  6. Same Difference? • Exercises for bath-time: • Is the difference operation commutative or associative? • And does it take part in any distributivity with the other operations?

  7. Size (Cardinality) of a Set When set A is finite, the size or cardinality of A(its number of members) is denoted |A|. Some obvious points (where A, B are finite) … || = 0 |{}| = 1 If A  B but A  B, then|A| < |B| |A|, |B|  |A  B|  |A| + |B| | A  B | |A|, |B|

  8. Powersets(reminder from last term) The set of all the subsets of a set A is called the powersetof A, denoted ℙ(A)or sometimes 2A ℙ( {1,2,3} ) = { , {1}, {2}, {3}, {1,2}, {2,3}, {3,1}, A} ℙ( {1} ) = { , {1} } ℙ(  ) = { } When A is finite,|ℙ(A) | = 2|A| (remember why?) So when |A| = 12, |ℙ(A) | = 212 = 4096

  9. “Tuples” • A “tuple” is an ordered sequence of items of any sort. We will only deal with finite tuples. ItemsCAN be duplicated. • Can also be called a “vector.” • Notation: 6, JAB, 5, “JAB”, 5, , 9> • Or:(6, JAB, 5, “JAB”, 5, , 9) • Singleton and empty tuples: <6>, <> • <6, 6, 3>, <6,3> , <6,6,3,6> and <6,3,6> are all different.

  10. Ordered Pairs • Bernd Bohnet in Term 1mentioned ordered pairs of numbers, when discussing graphs (textbook p.152). • An ordered pair is simply a tuple of length two: •  6, JAB > •  “JAB”,  > •  -6, -6 > •  5, -6 > •  ,  >

  11. “Cartesian Products” and “Relations” • The set of all possible tuples formed from some sets is called the Cartesian product of the sets. • Notation, e.g.: D  E F  G  H • if D, E, F, G, H are the sets—not necessarily different. • Each tuple is of form <d,e,f,g,h> where d D, e  E, etc. • Any subsetat all of that Cartesian product is called a relation on the sets in question (D, E, …) • even the whole of the product (even if infinite) • and even the empty set. • I.e., a relation on D, E, …, H is just some set of tuples that are each of form <d,e, …, h> where d  D, e  E, …, h  H.

  12. Examples • Let A = {3, 8, 2} and B = {‘jjj’, ‘bb’}. • Then A  B = • { <3, ‘jjj’>, <3, ‘bb’>, <8, ‘jjj’>, <8, ‘bb’>, <2, ‘jjj’>, <2, ‘bb’> }. • B  B = { <‘jjj’, ‘jjj’>, <‘jjj’, ‘bb’>, <‘bb’, ‘jjj’>, <‘bb’, ‘bb’>}. • A   =  =   A • A  {JAB} = { <3, JAB>, <8, JAB>, <2, JAB> } • Some relations on A andB: • {<3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>} • { <2, ‘bb’> } • A  B • 

  13. Relations from Somewhere to Somewhere • A relation R “from” set A “to” set B is the same thing as a relation “on” A “and” B — just different terminology. • Similarly, a relation from A, B, C to D, E is the same thing as a relation on A, B, C, D, E.

  14. Changing the Sets in a Relation Around • A relation R on A, B, C, D, E, say, obviously “induces” (i.e., gives rise to, in a natural way) a relation on any reordering of the sets, such as D, A, B, E, C, just byreordering each tuple in the same way. • Thus, R induces a relation from, say, D, A to B, E, C. • When there are just two sets A and B, the (only possible) reordering of the sets gives the inverse of R.

  15. Inverse Example • Suppose R = {<3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>} • Then the inverse of R, notated R-1 • is the relation {<‘jjj’, 3>, <‘bb’, 3>, <‘jjj’, 2>}

  16. Restriction of a Relation • Consider a relation R from A to B, • and a subset AA of A. • Then the restrictionof R to AAis the relation derived from R by restricting attention to AA, • i.e., including only tuples whose first element is in AA. • The new relation is notated R|AA

  17. Restriction Example • A = {3, 8, 2}, B = {‘jjj’, ‘bb’, ‘c’}. • R = {<3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>, <8, ‘c’>, <2, ‘c’> } • AA ={3, 8}. • Then R|AA= {<3, ‘jjj’>, <3, ‘bb’>, <8, ‘c’>}

  18. Functional Relations(Partial Functions) • A relation R from A to B is functional if, for any a in A, there is AT MOST one (but perhaps no)b in B such that a, b> is in R. • So several things in A can be related to the same thing in B. • But you can’t have several things in B related to the same thing in A. • A functional relation from A to B is also called a partial functionfrom A to B.

  19. Examples • A = {3, 8, 2, 100}, B = {‘jjj’, ‘bb’, ‘c’, ‘x’, ‘y’}. • R = { <3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>, <8, ‘c’>, <2, ‘c’> } • NOT functional,because 3 maps to both ‘jjj’ and ‘bb’, and … • R = {<3, ‘jjj’>, <2, ‘jjj’>, <100, ‘x’>} • IS functional • (NB: 8 doesn’t map to anything, and both 3 and 2 map to ‘jjj’)

  20. Totality of Relations • A relation R from A to B is total (on A)if it relates everythinginA to AT LEAST one thinginB. • I.e., for every member a of A, there is at least one b in Bsuch that a, b>is in R. • A relation may be merelypartial (on Aabove) in not being total. However, technically all relations are “partial”, with total being a special case.

  21. Examples • A = {3, 8, 2, 100}, B = {‘jjj’, ‘bb’, ‘c’, ‘x’, ‘y’}. • R = { <3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>, <8, ‘c’>, <100, ‘y’>} • IS total • (NB: 3 maps to more than one thing) • R = {<3, ‘jjj’>, <2, ‘jjj’>, <100, ‘x’>} • NOT total, because 8 fails to map to anything.

  22. Functions • A totalfunctional relation from A to B is called a function from A to B. • Eachthing in A is related to exactly one thing in B. (But two different things in A can be related to the same thing in B, and not everything in B needs to be related to anything in A. So the inverse relation is not necessarily either functional or total.) • Caution: every function is also a partial function.

  23. Examples • A = {3, 8, 2, 100}, B = {‘jjj’, ‘bb’, ‘c’, ‘x’, ‘y’}. • R = { <3, ‘jjj’>, <3, ‘bb’>, <2, ‘jjj’>, <8, ‘c’>, <100, ‘y’>} • NOT a function,because 3 maps to more than one thing • R = {<3, ‘jjj’>, <2, ‘jjj’>, <100, ‘x’>} • NOT a function, because 8 fails to map to anything. • R = {<3, ‘jjj’>, <2, ‘jjj’>, <100, ‘x’>, <8, ‘x’>} • IS a function.

  24. From Partiality to Totality by Restriction • We can always turn a merely-partial R from A to B into a total one by slimming A down enough! Just remove the members of A that aren’t related to anything by R, to get a new set AA. We don’t remove any tuples from R. • R (as a relation from AA to B) is total on AA. • And note that R|AA = R. • AA is called the domain of R, notated dom(R).

  25. Totality contd. and “Onto” • A relation R from A to B is ontoif foreverythingin B there is at least one thing inA that is related by R to it. I.e.: • For every member bof B, • there is at least one a in Asuch that a, b> is in R. • Onto-ness is just totality in the other direction. • You can also say that R is total on B, or that the inverse of R is total.

  26. Other Categories of Relation • A relation R from A to B is one-to-one (1-1) if, for anya in A, there is at most oneb in B such that a, b> is in R, AND for anyb in B, there is at most onea in A such that a, b> is in R. • That is, both the relation and its inverse from B to A are functional. (But they don’t need to be total.) • To put it another way: it is functional and different members of A map to (= are related to) different members of B. • Or again: Different members of A map to different members of B and different members of B map to different members of A.

  27. Example • A = {3, 8, 2, 100}, B = {‘jjj’, ‘bb’, ‘c’, ‘x’, ‘y’}. • R = { <3, ‘jjj’>, <8, ‘c’>, <100, ‘y’>} • IS 1-1

  28. Other categories, contd. • A one-to-onecorrespondence between a set A and B is a SPECIAL one-to-one relation from A to B (or B to A): • it is not onlyone-to-one but also TOTAL (on A) and ONTO (B). (Or we can say: total on both A and B.)

  29. Example • A = {3, 8, 2, 100}, B = {‘jjj’, ‘bb’, ‘c’, ‘y’}. • R = { <3, ‘jjj’>, <8, ‘c’>, <100, ‘y’>} • NOT a 1-1 correspondence between A and B, even though it is 1-1, as 2 is left out from A, and ‘bb’ is left out from B. • R = { <3, ‘jjj’>, <2, ‘bb’>, <8, ‘c’>, <100, ‘y’>} • IS a 1-1 correspondence between A and B

  30. Other categories, contd. • But any 1-1 relation from A to B is a 1-1 correspondence between the subsets of A, B consisting of those members that do happen to feature in the relation!

  31. Countable and Uncountable Sets [Brief Intro] A set X is countable if it can be placed in a one-to-one correspondence with some subset of N, the set of natural numbers from 1. Trivial case: X = N Let R be the relation {<x,x> | x  X}. This is the identity relation on X. Then R is a 1-1 correspondence between X and X.

  32. Countable Sets, contd 1 Similarly for any proper subset X of N: just use the identity relation on X again. More interesting case: X = the set of all whole numbers (negative, positive and zero). Let R be the relation {<x, 2x> | x  X, x  0}  {<x, -1-2x> | x  X, x < 0 } So R = {(0,0), (-1,1), (1,2), (-2,3), (2,4), (-3,5), (3,6), …} Then R is a 1-1 correspondence between X and N.

  33. Countable Sets, contd 2 Yet more interesting case: X = the set of positive rational numbers. Can get our relation R by putting the possible fractions (with positive whole number parts) in a square infinite table with numerators increasing horizontally and denominators increasing vertically: 1/1 2/13/14/15/16/1 … 1/22/23/24/25/26/2 … 1/3 2/33/34/3 5/36/3 … 1/4 2/4 2/5 2/6 : : … : : : : : : … Then traverse through the numbers in sequence by going up and down diagonals, with steps on edges as necessary, and missing out fractions that are not in simplest form (missed out ones are shown in brackets): 1/1,2/1, 1/2, 1/3, (2/2), 3/1, 4/1, 3/2, 2/3, 1/4, 1/5, (2,4), (3,3), (4,2), 5/1, … Count as: 1 2 3 4 5 6 7 8 9 10 11

  34. Uncountable Sets All finite sets are countable. And they needn’t be sets of numbers! The set of socks in this class is countable. We have seen that some infinite ones are countable … Even if the set X contains the natural numbers as a tiny proper subset!! E.g., X = the set of rational numbers. But some infinite sets are not countable: notably the set of real numbers (rational and irrational numbers together), or even the set of real numbers between 0 and 1. Can be shown by a “diagonalization” argument based on the decimal representations of the numbers.

More Related