Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.
|
|
- Denis Singleton
- 5 years ago
- Views:
Transcription
1 Algebra of Sets Aditya Ghosh April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. 1 The Basics This article is only about the algebra of sets, and does not deal with the foundations of set theory (e.g. answering questions like Can a set contain itself? ) A brief list of symbols with their meanings: (belongs to), (implies), (if and only if), : (such that), (such that), (for all) and (there exists). These also have negations like / (does not belong to), (does not imply), (does not exist) etc. And φ denotes the empty set. Set algebra starts with union and intersection of sets 1 : A B = {x : x A or x B}, A B = {x : x A and x B} For example, if A = {1, 2, 3}, B = {2, 4} the A B = {1, 2, 3, 4} and A B = {2}. Now, some obvious facts about and are: A A = A, A A = A, A φ = A, A φ = φ Then some facts which are easy to visualise: A B = B A, A B = B A, A (B C) = (A B) C, A (B C) = (A B) C These remind us of a + b = b + a, a b = b a and a + (b + c) = (a + b) + c, a (b c) = (a b) c where a, b, c are real numbers. In algebra of real numbers, we call these laws as commutative law and associative law respectively. In algebra of sets, they have the exactly same name. You might wonder why I replaced by + and by, why not the opposite? Notice that if we identify them like above, then not only the commutative and associative laws, even the laws A φ = A, A φ = φ will remind us of a + 0 = a, a 0 = 0. However, this gives us no clue about A A = A, A A = A. Still, we pursue this understanding, because several laws of set algebra (some will come next) remind us of ordinary algebra of numbers, if you relate and to addition and multiplication. 1 Pronounciation: Call A B as A union B or A cup B and A B as A intersection B or A cap B. 1
2 The next law of algebra of numbers that comes in our mind is the distributive law: a (b + c) = a b + a c. In algebra of sets, this will look like A (B C) = (A B) (A C). Is this true? To see whether it is true or not, we first pick any element in LHS and see whether it belongs to RHS or not: x A (B C) x A and (x B C) x A and (x B or x C) (x A and x B) or (x A and x C) (x A B) or (x A C) x (A B) (A C) So any element of A (B C) is also included in (A B) (A C). This is not enough to say these two sets are equal, because, for instance, the first one could be {1} and the other {1, 2}. So, in order to argue they are equal, we should see whether any element in RHS belongs to LHS or not. Before watching the solution below, why do not you try it yourself? Now if you have tried it, you will find that the steps are exactly the steps shown above, this time backwards. So we can simply summarise our solution as: x A (B C) x A and (x B C) x A and (x B or x C) (x A and x B) or (x A and x C) (x A B) or (x A C) x (A B) (A C) This shows that we indeed have the distributive law: A (B C) = (A B) (A C). Now, surprising is the fact that, in algebra of sets, we have another distributive law: A (B C) = (A B) (A C). In algebra of numbers, we certainly don t have any law like a + bc = (a + b)(a + c), but in case of sets, it holds. Can you prove it? I assure you that the proof is essentially similar to the previous proof. And you should try it before moving to the next paragraph. If you are still not convinced why the last law holds, you should take some examples 2. Taking examples and working out the LHS and RHS is the best way to get convinced about any equation you come across. 2 Venn Diagram can help as well. 2
3 So, we have two distributive laws in set algebra: A (B C) = (A B) (A C), A (B C) = (A B) (A C) Observe that the any of them can be obtained from the other by interchanging the s and s. Not only that, if you interchange the s and s in the proof of any of them, you will get the proof of the other one. This not only holds for this law, but also for any other law in set theory, provided you don t forget to interchange φ with U (universal set 3 ). A task you may take now: Prove all the laws that I stated before the distributive laws. The structure of the proof will be similar (and simpler!) to the proof of distributive laws. While doing all the proofs, you have noticed that we showing any element that belongs to the LHS, also belongs to the RHS and vice-versa. And I already discussed (with the examples LHS={1} and RHS={1, 2}) that showing only one direction is not enough. This notion of x A x B has a name in set theory: if it holds, we say that A is a subset of B. For example, A = { kolkata, chennai } is a subset of B = { delhi, chennai, kolkata, bengaluru }. We denote this by A B. Note that A A for any set A and A = B if and only if A B, B A. When A B, but A B, we say A is a proper subset of B. Some books denote it as A B, while some others write it as A B. There are some more operations on sets. One is the complement operation: A = {x : x U but x / A}. (warning: A is NOT defined as {x : x / A}. Because without defining the totality, how can we see which are the objects that are not in A!) What if we take complement of union or intersections of two sets? (A B) is the set of all common elements of A and B. And thus (A B) is the set of elements that are either missing in A or in B. So these are the elements of either A or B. And this hints at the the law (A B) = A B. Can you write a proof of it? And, as I already mentioned, if you interchange the s and s, what you get will be another law. Here it wil be (A B) = A B. Can you visualise why is this true? Can you now write a proof of it? The last two laws are known as De Morgan s laws. Another operation is the difference of sets, defined as A\B = {x : x A but x / B}. So, it is just the set obtained from A, by throwing away the objects of B. You can also denote it as A B. 3 Here I mean the univeral set in any given context. For example, if you take a test of 50 marks, your marks will be in {0, 1, 2,..., 50}. So in this context, this set can be taken as the universal set U. 3
4 An example would be good to understand the difference operation: Say A = {1, 2}, B = {2, 3}, C = {3, 1}. Then, A B = {1}, B A = {3}, B C = {2} etc. One thing you might observe that, A B = {x : x A but x / B} = {x : x A and x B } = A B. This is very much useful, when you try to do any problem involving difference of sets. 2 How They Work Together Till now, we have seen various laws of set algebra. Now its time to see some examples to understand how they all work together to give new results. Alongside examples, some exercises are also given below. 1. We have seen commutative law and associative law for and. Are the laws valid for? Before going into sets, ask yourself, are these valid for real numbers? Is it true that a b = b a, or a (b c) = (a b) c? No, right? Now lets think about sets. A B is the set obtained after throwing away elements of B from A, that is, set of objects which are in A but not in B. Whereas B A is the set of objects which are in B but not in A. Now it can be the case that B contain some element which is not in A, so that element remains in B A, but not in A B. So it seems (strongly!) that A B B A. Lets find one 4 counter-example then. We take A = {1}, B = {1, 2}. Then A B = φ and B A = {2}. So A B = B A is false. Next, what about A (B C) = (A B) C? What do you think, is it true or false? 2. Is it true or false: A (B C) = A B A C? Again, first think of real numbers. We surely have a(b c) = ab ac for any real numbers a, b, c. So the analogy of set algebra with algebra of numbers says that it should be true. Lets try it with an example. Take the example of A = {1, 2}, B = {2, 3}, C = {3, 1}. Here A (B C) = {1, 2} {2} = {2}, and A B = {2}, A C = {1} so A B A C = {2} {1} = {2}. Okay, so it seems to be true. Then lets try for a proof. This time we will not go for the LHS=RHS type proofs, rather we will make use of the laws we learned in the previous section. 4 In mathematics, whenever you need to disprove a statement, one counter-example is enough. However, to prove a statement, even millions of examples are not sufficient! 4
5 A B A C = (A B) (A C) (definition) = (A B) (A C ) (De Morgan) Which law will work now? Distributive, right? But it will look messy if we blindly write the whole thing. So let us write A B = P, and then (A B) (A C ) = P (A C ) Now, P A = (A B) A = (P A ) (P C ) (distributive law) = A (A B) (commutative law) = (A A) B (associative law) = φ B = φ and P C = (A B) C = A (B C ) (associative law) = A (B C) Hence (P A ) (P B ) = φ (A (B C)) = A (B C). Done! Just observe how all the laws worked together, as a team to give the final result! Comment: I intentionally split the proof into several parts and mentioned the names of the laws, just to illustrate how the laws worked. You could also write the proof in one go: A B A C = (A B) (A C) = (A B) (A C ) = ((A B) A ) ((A B) C ) = (A (A B)) (A (B C )) = ((A A) B) (A (B C)) = (φ B) (A (B C)) = φ (A (B C)) = A (B C). If you completely understood the solution of this problem, then try the following problem: 3. Is it true or false: A (B C) = (A B) (A C)? 5
6 4. Suppose A φ. Can A be non-empty? Answer: No. Because if a A then a φ which is not possible. So we must have A = φ. 5. Suppose B C = φ. What can you say about B and C? Answer. B = C = φ. Can you tell why? 6. Suppose B, C are sets such that A B = A C holds for any set A. Does this imply B = C? This is a tricky problem. Since the equation is valid for all sets A, we can just put A = φ to get φ B = φ C. Clearly, LHS is B and RHS is C. Hence B = C. 7. Suppose B, C are non-empty sets such that A B = A C holds for any set A φ. Does this imply B = C? Note that here you can not put A = φ, but can put A = something other than φ that will do the job. Why not try it yourself before looking at the solution! 8. Suppose B, C are sets such that A B = A C holds for any set A φ. Does this imply B = C? Can you see the difference between this and the previous question? 9. Suppose B, C are sets such that A B = A C holds for any set A φ. Does this imply B = C? Before going to the next problem, we define another operatio on sets, called the symmetric difference of A, B. Formally it is defined as A B = (A B) (B A). Note that RHS is the set of elements which are either in A but not in B or, are in B but not in A. So A B is the set of all things which are included in either A or B, but not in both. (This intuition is little helpful to understand why it is called symmetric difference. See 12. and 15. below for more meaning of the symmetry in it) Let us see a few examples. A = {1, 2, 3}, B = {3, 4}, C = {1, 5}. Then A B = {1, 2, 4}, B C = {1, 3, 4, 5}, C A = {2, 3, 5}. Now observe one thing, A B is the set obtained by throwing away the common elements of A, B from their union, so it seems that A B = (A B) (A B), right? Okay, then lets go for a proof of it! 6
7 10. Show that (A B) (B A) = (A B) (A B) This is much similar to 2. and hence I leave this for you. One hint that I can give: Start with the RHS first. Now let us try some more problems on symmetric difference. 11. Suppose X = {1, 2, 3,..., 9} and B = {1, 2, 3, 4}. How many subsets A X are there which satisfy A B = {3}? This problem is not very tough if you think intuitively what does mean. If you are still stuck, then let me give a hint: Take some subsets A of X and work out what is A B. Try to make some subsets A X such that A B = {3} holds. 12. Is it true that A B = B A? Thinking intuitively, this question should be very easy. Can you write a quick proof of it? 13. Show that, A (B C) = (A (B C)) (A B C). This is another typical problem where you need to just manipulate the laws. However, there are two definitions for B C, namely (B C) (C B) and (B C) (B C), and recall that X Y = X Y. What do you think, which one of the two definitions will make our job easier? Since we have A (B C) = A (B C) so it would be better if we get one inside (B C), which means, we want a inside B C. So let us put B C = (B C) (B C) = (B C) (B C). A (B C) = A (B C) = A ( (B C) (B C) ) Following is a similar problem. = A ( (B C) (B C) ) (using (X ) = X) = (A (B C) ) (A (B C)) = (A (B C)) (A B C). 14. Show that, (B C) A = (B (C A)) (C (A B)) 15. Is it true that A (B C) = (A B) C? This problem gives use more insight about the symmetry in symmetric difference. 7
8 To first guess whether this is true or not, draw Venn diagrams 5 to see what are contained in the LHS and what are contained in the RHS. You will find that both the LHS and RHS contain the elements which belong to exactly one the sets A, B, C or all of them. And hence the answer is Yes. We shall prove it, but before that, can you observe the symmetry in A B C? Here are the outlines of the proof, the rest have to be filled by you: A (B C) = ( A (B C) ) ( (B C) A ) I hope now you can understand why I put the problems 13. and 14. above. Just use them to find that LHS is just the set (B (C A)) (C (A B)) (A (B C)) (A B C). Next, do similar things for the RHS. (Again you have to use 13. and 14.) Finally, note that RHS is the union of the same 4 sets as above, possibly in some other ordering. 16. Prove that there exists a set O which satisfy A O = A for all sets A. Is this choice of O unique? 17. For any set A, prove that there exists a set B which satisfy A B = O. Is this choice of B unique? Both these questions are tricky, you have to guess what can be O and what can be B. To prove the uniqueness part in 16., assume that there are two such O, lets call them O 1 and O 2. Then O 1 O 2 = O 1 and O 2 O 1 = O 2. And of course O 1 O 2 = O 2 O 1. Do something similar for the uniqueness part of 17. I end this section with the next problem. 18. For any set X, let P (X) denote the set of all subsets of X (called the power set of X). Show that A B if and only if P (A) P (B). Note that the definition of power-set says Y P (X) if and only if Y X. This is the main tool we need for this problem. If A B, then for any C P (A), we have C A. So C A B. Now, C B implies C P (B). This proves the only if part. For the if part, we have to show that P (A) P (B) implies A B. Note that A A, so A P (A). As P (A) P (B), we get A P (B). This implies A B. 5 But Venn diagrams are not proofs, you need to always write a proof if it holds and give at least one counter-example if it is false. To argue why Venn diagram is less helpful as proofs, I suggest you to draw a general Venn digram for say 5 sets or 8 sets. Can you draw it? 8
9 3 More Problems Here are some more problems on algebra of sets. For problems of the form Is it true that, if the answer is yes then you have to prove it, and if the answer is no then you need to give just one counter-example. I emphasize on the fact that by giving examples we can not prove any statement. 1. Prove that A A B and A B A for any sets A and B. 2. For any set A, what are A A, A φ, φ A? 3. If A C and B C then show that A B C. 4. If C A and C B then show that C A B. 5. Prove that A (A B) = A B. 6. Is it true that A (B C D) = (A B) (A C) (A D)? Can you make this more general? What about A (B C D)? 7. Is it true that (A B C) = A B C? Can you make it more general? What about (A B C)? 8. Is it true that C (A B) = (C A) (C B)? 9. Is it true that C (A B) = (C A) (C B)? 10. Is it true that C (A B) = (C A) (C B)? 11. Prove that (B A) C = (B C) A = B (C A) 12. Is it true that (B A) C = (B C) (A C)? 13. Show that (X A) B if and only if A B = X. 14. Prove that A (B C) = (A B) C if and only if C A. 15. If A C = B C, then is it necessary that A = B? 16. Prove that A (B C) = (A B) (A C). 17. Show that (A B) C = A (B C) holds if and only if A C. 18. If C B A then is it true that A C = (A B) (B C)? 19. If A C = B C and A C = B C then is it necessary that A = B? 20. Let A, B, C be any three sets. Prove that C (A B) if and only if C (A B) and A B C = φ. 9
Algebra of Sets (Mathematics & Logic A)
Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for
More information1.1 - Introduction to Sets
1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018
More informationSets 1. The things in a set are called the elements of it. If x is an element of the set S, we say
Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it
More information(Refer Slide Time 3:31)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationLECTURE 2 An Introduction to Boolean Algebra
IST 210: Boot Camp Ritendra Datta LECTURE 2 An Introduction to Boolean Algebra 2.1. Outline of Lecture Fundamentals Negation, Conjunction, and Disjunction Laws of Boolean Algebra Constructing Truth Tables
More informationSemantics via Syntax. f (4) = if define f (x) =2 x + 55.
1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)
More information3.1 Constructions with sets
3 Interlude on sets Sets and functions are ubiquitous in mathematics. You might have the impression that they are most strongly connected with the pure end of the subject, but this is an illusion: think
More informationBOOLEAN ALGEBRA AND CIRCUITS
UNIT 3 Structure BOOLEAN ALGEBRA AND CIRCUITS Boolean Algebra and 3. Introduction 3. Objectives 3.2 Boolean Algebras 3.3 Logic 3.4 Boolean Functions 3.5 Summary 3.6 Solutions/ Answers 3. INTRODUCTION This
More informationDiscrete Mathematics
Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application
More informationIntroduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
More informationReview of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationSETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.
SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,
More information3.7. Vertex and tangent
3.7. Vertex and tangent Example 1. At the right we have drawn the graph of the cubic polynomial f(x) = x 2 (3 x). Notice how the structure of the graph matches the form of the algebraic expression. The
More informationSets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element
More informationTaibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
More informationMATH 271 Summer 2016 Assignment 4 solutions
MATH 7 ummer 06 Assignment 4 solutions Problem Let A, B, and C be some sets and suppose that f : A B and g : B C are functions Prove or disprove each of the following statements (a) If f is one-to-one
More informationRational Numbers CHAPTER Introduction
RATIONAL NUMBERS Rational Numbers CHAPTER. Introduction In Mathematics, we frequently come across simple equations to be solved. For example, the equation x + () is solved when x, because this value of
More information2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
More informationIntersection of sets *
OpenStax-CNX module: m15196 1 Intersection of sets * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 We have pointed out that a set
More informationPublication Data. Reading Options. Licence and permissions ISBN Mark Jago, 2007
Running Head The World is all that is the case http//www.humanities-ebooks.co.uk Philosophy Insights General Editor: Mark ddis Formal Logic Mark Jago What makes an argument valid? For advice on use of
More informationThe Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
More informationAn Interesting Way to Combine Numbers
An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis October 12, 2016 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly
More informationExcerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.
Chapter 5 Using the Integers In spite of their being a rather restricted class of numbers, the integers have a lot of interesting properties and uses. Math which involves the properties of integers is
More informationLecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets
Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Saul Glasman 14 September 2016 Let s give the definition of an open subset of R. Definition 1. Let U R. We
More informationIntroduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
More informationSets. {1, 2, 3, Calvin}.
ets 2-24-2007 Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More information1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationSets. Sets. Subset, universe. Specifying sets, membership. Examples: Specifying a set using a predicate. Examples
Sets 2/36 We will not give a precise definition of what is a set, but we will say precisely what you can do with it. Sets Lectures 7 and 8 (hapter 16) (Think of a set as a collection of things of which
More informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More information1 Sets, Fields, and Events
CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationProofwriting Checklist
CS103 Winter 2019 Proofwriting Checklist Cynthia Lee Keith Schwarz Over the years, we ve found many common proofwriting errors that can easily be spotted once you know how to look for them. In this handout,
More informationEquations of planes in
Roberto s Notes on Linear Algebra Chapter 6: Lines, planes and other straight objects Section Equations of planes in What you need to know already: What vectors and vector operations are. What linear systems
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation-6: Hardness of Inference Contents 1 NP-Hardness Part-II
More informationor else take their intersection. Now define
Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only
More informationStarting Boolean Algebra
Boolean Algebra March 2, 27 Diagram for FunChip2 Here is a picture of FunChip2 that we created more or less randomly in class on /25 (used in various Activities): Starting Boolean Algebra Boolean algebra
More informationThe Further Mathematics Support Programme
Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements
More informationc) the set of students at your school who either are sophomores or are taking discrete mathematics
Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B
More informationCS103 Spring 2018 Mathematical Vocabulary
CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming
More informationFundamental Mathematical Concepts Math 107A. Professor T. D. Hamilton
Fundamental Mathematical Concepts Math 107A Professor T. D. Hamilton January 17, 2007 2 Contents 1 Set Theory 7 What is a set?.......................................... 7 Describing a Set.........................................
More informationMath 187 Sample Test II Questions
Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationLecture - 8A: Subbasis of Topology
Lecture - 8A: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline 1 Introduction 2 3 4 Introduction I As we know that topology generated by a basis B may
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationAlgebraic Specifications
Object-Oriented Design Lecture 2 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 11, 2007 Algebraic Specifications Last time I said a word about the abstraction barrier, separating the clients from the implementors.
More informationIntroduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
More informationContinuous functions and homeomorphisms
Continuous functions and homeomorphisms 1 Motivation Up to now we have defined just a few topological properties, like the first three T -axioms and the countability properties (separable, ccc, first and
More information5. Lecture notes on matroid intersection
Massachusetts Institute of Technology Handout 14 18.433: Combinatorial Optimization April 1st, 2009 Michel X. Goemans 5. Lecture notes on matroid intersection One nice feature about matroids is that a
More informationOrthogonal complements
Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 3 Orthogonal complements What you need to know already: What orthogonal and orthonormal bases are. What you can learn here: How we can
More informationEquality for Abstract Data Types
Object-Oriented Design Lecture 4 CSU 370 Fall 2008 (Pucella) Tuesday, Sep 23, 2008 Equality for Abstract Data Types Every language has mechanisms for comparing values for equality, but it is often not
More informationCantor s Diagonal Argument for Different Levels of Infinity
JANUARY 2015 1 Cantor s Diagonal Argument for Different Levels of Infinity Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes develop the classic Cantor
More information(Refer Slide Time: 01.26)
Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationProblem One: A Quick Algebra Review
CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning
More informationCS2 Language Processing note 3
CS2 Language Processing note 3 CS2Ah 5..4 CS2 Language Processing note 3 Nondeterministic finite automata In this lecture we look at nondeterministic finite automata and prove the Conversion Theorem, which
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More information1.2 Venn Diagrams and Partitions
1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark
More informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More informationCOMP combinational logic 1 Jan. 18, 2016
In lectures 1 and 2, we looked at representations of numbers. For the case of integers, we saw that we could perform addition of two numbers using a binary representation and using the same algorithm that
More informationLimitations of Algorithmic Solvability In this Chapter we investigate the power of algorithms to solve problems Some can be solved algorithmically and
Computer Language Theory Chapter 4: Decidability 1 Limitations of Algorithmic Solvability In this Chapter we investigate the power of algorithms to solve problems Some can be solved algorithmically and
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationBases of topologies. 1 Motivation
Bases of topologies 1 Motivation In the previous section we saw some examples of topologies. We described each of them by explicitly specifying all of the open sets in each one. This is not be a feasible
More informationCS40-S13: Functional Completeness
CS40-S13: Functional Completeness Victor Amelkin victor@cs.ucsb.edu April 12, 2013 In class, we have briefly discussed what functional completeness means and how to prove that a certain system (a set)
More information11 Sets II Operations
11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric
More informationNotes on Minimum Cuts and Modular Functions
Notes on Minimum Cuts and Modular Functions 1 Introduction The following are my notes on Cunningham s paper [1]. Given a submodular function f and a set S, submodular minimisation is the problem of finding
More informationLECTURE 8: SETS. Software Engineering Mike Wooldridge
LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More informationTechnische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for
More information1. (10 points) Draw the state diagram of the DFA that recognizes the language over Σ = {0, 1}
CSE 5 Homework 2 Due: Monday October 6, 27 Instructions Upload a single file to Gradescope for each group. should be on each page of the submission. All group members names and PIDs Your assignments in
More informationBinary Relations Part One
Binary Relations Part One Outline for Today Binary Relations Reasoning about connections between objects. Equivalence Relations Reasoning about clusters. A Fundamental Theorem How do we know we have the
More informationTechnische Universität München Zentrum Mathematik
Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16
More information2. BOOLEAN ALGEBRA 2.1 INTRODUCTION
2. BOOLEAN ALGEBRA 2.1 INTRODUCTION In the previous chapter, we introduced binary numbers and binary arithmetic. As you saw in binary arithmetic and in the handling of floating-point numbers, there is
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationUnit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers
Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationGreedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d
Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,
More informationdefinition. An angle is the union of two rays with a common end point.
Chapter 3 Angles What s the secret for doing well in geometry? Knowing all the angles. As we did in the last chapter, we will introduce new terms and new notations, the building blocks for our success.
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationOne of the most important areas where quantifier logic is used is formal specification of computer programs.
Section 5.2 Formal specification of computer programs One of the most important areas where quantifier logic is used is formal specification of computer programs. Specification takes place on several levels
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationSets and set operations. Lecture 5 ICOM 4075
Sets and set operations Lecture 5 ICOM 4075 Reviewing sets s defined in a previous lecture, a setis a collection of objects that constitute the elementsof the set We say that a set containsits elements,
More informationLattice Tutorial Version 1.0
Lattice Tutorial Version 1.0 Nenad Jovanovic Secure Systems Lab www.seclab.tuwien.ac.at enji@infosys.tuwien.ac.at November 3, 2005 1 Introduction This tutorial gives an introduction to a number of concepts
More informationMathematics for Computer Science Exercises from Week 4
Mathematics for Computer Science Exercises from Week 4 Silvio Capobianco Last update: 26 September 2018 Problems from Section 4.1 Problem 4.3. Set Formulas and Propositional Formulas. (a) Verify that the
More information9 R1 Get another piece of paper. We re going to have fun keeping track of (inaudible). Um How much time do you have? Are you getting tired?
Page: 1 of 14 1 R1 And this is tell me what this is? 2 Stephanie x times y plus x times y or hm? 3 R1 What are you thinking? 4 Stephanie I don t know. 5 R1 Tell me what you re thinking. 6 Stephanie Well.
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
More informationJohns Hopkins Math Tournament Proof Round: Point Set Topology
Johns Hopkins Math Tournament 2019 Proof Round: Point Set Topology February 9, 2019 Problem Points Score 1 3 2 6 3 6 4 6 5 10 6 6 7 8 8 6 9 8 10 8 11 9 12 10 13 14 Total 100 Instructions The exam is worth
More informationLECTURE NOTES ON SETS
LECTURE NOTES ON SETS PETE L. CLARK Contents 1. Introducing Sets 1 2. Subsets 5 3. Power Sets 5 4. Operations on Sets 6 5. Families of Sets 8 6. Partitions 10 7. Cartesian Products 11 1. Introducing Sets
More informationLecture 2. 1 Introduction. 2 The Set Cover Problem. COMPSCI 632: Approximation Algorithms August 30, 2017
COMPSCI 632: Approximation Algorithms August 30, 2017 Lecturer: Debmalya Panigrahi Lecture 2 Scribe: Nat Kell 1 Introduction In this lecture, we examine a variety of problems for which we give greedy approximation
More informationIntermediate Algebra. Gregg Waterman Oregon Institute of Technology
Intermediate Algebra Gregg Waterman Oregon Institute of Technology c 2017 Gregg Waterman This work is licensed under the Creative Commons Attribution 4.0 International license. The essence of the license
More informationSets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
More information