Lecture 1. Basic Concepts of Set Theory, Functions and Relations

Transcription

1 September 7, 2005 p. 1 Lecture 1. Basic Concepts of Set Theory, Functions and Relations 0. Preliminaries Basic Concepts of Set Theory Sets and elements Specification of sets Identity and cardinality Subsets Power sets Operations on sets: union, intersection More operations on sets: difference, complement...5 Homework 1 notes Preliminaries Aims of the course. Emphasis on math appreciation, aiming to be USEFUL, interesting, may or may not be fun (hope so.). Everything we cover should be doable if you work conscientiously. Creativity is important for really BEING a mathematician, and we ll include some optional problems that ask for creativity, but we ll try to avoid any questions that demand mathematical creativity. Course description: Introduction to some basic mathematical concepts and techniques central to linguistic theory. Set theory, logic and formal systems, modern algebra, automata theory, and model theory. Applications to syntax, phonology, semantics. No prior mathematics assumed. Not open to math majors. Prerequisite: LING 201 or 401 or consent of instructor. [See Syllabus for more.] Textbook: available from instructor, cost $26.00 (Partee s cost direct from publisher with author s discount.) Payment due by next Wednesday, September 14. (Cash or check to Barbara H. Partee.) Sign for book on attendance sheet. Florian or I will give you a receipt when I receive payment. Student questionnaire, to be collected at end of class or next time. Introductions. Florian Schwarz will give some guest lectures when I m away. Reading: Chapter 1 ( ) of Partee-ter Meulen-Wall (MMiL), pp Also Preliminaries from Partee 1979, Fundamentals of Mathematics for Linguistics (xeroxed). 1. Basic Concepts of Set Theory Sets and elements Set theory is a basis of modern mathematics, and notions of set theory are used in all formal descriptions. The notion of set is taken as undefined, primitive, or basic, so we don t try to define what a set is, but we can give an informal description, describe important properties of sets, and give examples. All other notions of mathematics can be built up based on the notion of set. Similar (but informal) words: collection, group, aggregate. Description: a set is a collection of objects which are called the members or elements of that set. If we have a set we say that some objects belong (or do not belong) to this set, are (or are not) in the set. We say also that sets consist of their elements.

2 September 7, 2005 p. 2 Examples: the set of students in this room; the English alphabet may be viewed as the set of letters of the English language; the set of natural numbers 1 ; etc. So sets can consist of elements of various natures: people, physical objects, numbers, signs, other sets, etc. (We will use the words object or entity in a very broad way to include all these different kinds of things.) A set is an ABSTRACT object; its members do not have to be physically collected together for them to constitute a set. The membership criteria for a set must in principle be well-defined, and not vague. If we have a set and an object, it is possible that we do not know whether this object belongs to the set or not, because of our lack of information or knowledge. (E.g. The set of students in this room over the age of 21 : a well-defined set but we may not know who is in it.) But the answer should exist, at any rate in principle. It could be unknown, but it should not be vague. If the answer is vague for some collection, we cannot consider that collection as a set. Another thing: If we have a set, then for any two elements of it, x and y, it should not be vague whether x = y, or they are different. (If they are identical, then they are not actually two elements of it; the issue really arises when we have two descriptions of elements, and we want to know whether those descriptions describe the same element, or two different elements.) For example: is the letter q the same thing as the letter Q? Well, it depends on what set we are considering. If we take the set of the 26 letters of the English alphabet, then q and Q are the same element. If we take the set of 52 upper-case and lower-case letters of the English alphabet, then q and Q are two distinct elements. Either is possible, but we have to make it clear what set we are talking about, so that we know whether or not q = Q. Sometimes we simply assume for the sake of examples that a description is not vague when perhaps for other purposes it would be vague e.g., the set of all red objects. Sets can be finite or infinite. There is exactly one set, the empty set, or null set, which has no members at all. A set with only one member is called a singleton or a singleton set. ( Singleton of a ) Notation: A, B, C, for sets; a, b, c, or x, y, z, for members. b A if b belongs to A (B A if both A and B are sets and B is a member of A) and c A, if c doesn t belong to A. is used for the empty set Specification of sets There are three main ways to specify a set: (1) by listing all its members (list notation); (2) by stating a property of its elements (predicate notation); (3) by defining a set of rules which generates (defines) its members (recursive rules). 1 Natural numbers: 0,1,2,3,4,5,.... No notion of positive or negative. The numbers used for counting. Integers: positive, negative, and 0. See xeroxed section Preliminaries from Partee 1979.

3 September 7, 2005 p. 3 List notation. The first way is suitable only for finite sets. In this case we list names of elements of a set, separate them by commas and enclose them in braces: Examples: {1, 12, 45}, {George Washington, Bill Clinton}, {a,b,d,m}. Three-dot abbreviation : {1,2,..., 100}. (See xeroxed preliminaries, pp xxii-xxiii) {1,2,3,4, } this is not a real list notation, it is not a finite list, but it s common practice as long as the continuation is clear. Note that we do not care about the order of elements of the list, and elements can be listed several times. {1, 12, 45}, {12, 1, 45,1} and {45,12, 45,1} are different representations of the same set (see below the notion of identity of sets). Predicate notation. Example: {x x is a natural number and x < 8} Reading: the set of all x such that x is a natural number and is less than 8 So the second part of this notation is a property the members of the set share (a condition or a predicate which holds for members of this set). Other examples: { x x is a letter of Russian alphabet} {y y is a student of UMass and y is older than 25} General form: { x P(x)}, where P is some predicate (condition, property). The language to describe these predicates is not usually fixed in a strict way. But it is known that unrestricted language can result in paradoxes. Example: { x x x}. ( Russell s paradox ) -- see the historical notes about it on pp 7-8. The moral: not everything that looks on the surface like a predicate can actually be considered to be a good defining condition for a set. Solutions type theory, other solutions; we won t go into them. (If you re interested, see Chapter 8, Sec 2.) Recursive rules. (Always safe.) Example the set E of even numbers greater than 3: a) 4 E b) if x E, then x + 2 E c) nothing else belongs to E. The first rule is the basis of recursion, the second one generates new elements from the elements defined before and the third rule restricts the defined set to the elements generated by rules a and b. (The third rule should always be there; sometimes in practice it is left implicit. It s best when you re a beginner to make it explicit.) 1.3. Identity and cardinality Two sets are identical if and only if 2 they have exactly the same members. So A = B iff for every x, x A x B. For example, {0,2,4} = {x x is an even natural number less than 5} 2 Be careful about if and only if ; its abbreviation is iff. See Preliminaries, p. xxiii.

4 September 7, 2005 p. 4 From the definition of identity follows that there exists only one empty set; its identity is fully determined by its absence of members. Note that empty list notation {} is not usually used for the empty set, we have a special symbol for it. The number of elements in a set A is called the cardinality of A, written A. The cardinality of a finite set is a natural number. Infinite sets also have cardinalities but they are not natural numbers. We will discuss cardinalities of infinite sets a little later (Chapter 4) Subsets A set A is a subset of a set B iff every element of A is also an element of B. Such a relation between sets is denoted by A B. If A B and A B we call A a proper subset of B and write A B. (Caution: sometimes is used the way we are using.) Both signs can be negated using the slash / through the sign. Examples: {a,b} {d,a,b,e} and {a,b} {d,a,b,e}, {a,b} {a,b}, but {a,b} {a,b}. Note that the empty set is a subset of every set. A for every set A. Why? Be careful about the difference between member of and subset of ; the homework gives lots of chance for practice Power sets The set of all subsets of a set A is called the power set of A and denoted as (A) or sometimes as 2 A. For example, if A = {a,b}, (A) = {, {a}, {b}, {a,b}}. From the example above: a A; {a} A; {a} (A) A; A; (A); (A) Be careful with exercise 4 in Homework 1! Pay close attention to the definitions and it should come out all right. But if you don t pay close attention to the definitions, it s easy to make mistakes. Make sure you understand these examples before you try it. (But do try; and if you don t get something right the first time, we give you a chance to redo it.) 1.6. Operations on sets: union, intersection. We define several operations on sets. Let A and B be arbitrary sets. The union of A and B, written A B, is the set whose elements are just the elements of A or B or of both. In the predicate notation the definition is A B = def { x x A or x B} Examples. Let K = {a,b}, L = {c,d} and M = {b,d}, then K L = {a,b,c,d} K M = {a,b,d} L M = {b,c,d}

5 September 7, 2005 p. 5 (K L) M = K (L M) = {a,b,c,d} K K = K K = K = K = {a,b}. There is a nice method for visually representing sets and set-theoretic operations, called Venn diagrams. Each set is drawn as a circle and its members represented by points within it. The diagrams for two arbitrarily chosen sets are represented as partially intersecting the most general case as in Figure 1 1 p.13. The region designated 1 contains elements which are members of A but not of B; region 2, those members in B but not in A; and region 3, members of both B and A. Points in region 4 outside the diagram represent elements in neither set. The Venn diagram for the union of A and B is shown in Figure 1 2, p.13 The results of operations in this and other diagrams are shown by shading areas. --- The intersection of A and B, written A B, is the set whose elements are just the elements of both A and B. In the predicate notation the definition is A B = def { x x A and x B} Examples: K L = K M = {b} L M = {d} (K L) M = K (L M) = K K = K K = K =. The general case of intersection of arbitrary sets A and B is represented by the Venn diagram of Figure 1 3, p.14. The intersection of three arbitrary sets A,B and C is shown in the Venn diagram of Figure 1 4, p More operations on sets: difference, complement Another binary operation on arbitrary sets is the difference A minus B, written A B, which subtracts from A all elements which are in B. [Also called relative complement: the complement of B relative to A.] The predicate notation defines this operation as follows: A B = def { x x A and x B} Examples: (using the previous K, L, M) K L = {a,b} K M = {a} L M = {c} K K = K = K K =.

6 September 7, 2005 p. 6 The Venn diagram for the set-theoretic difference is shown in Figure 1 5, p.16. A B is also called the relative complement of B relative to A. This operation is to be distinguished from the complement of a set A, written A, which is the set consisting of everything not in A. In predicate notation A = def { x x A} It is natural to ask, where do these objects come from which do not belong to A? In this case it is presupposed that there exists a universe of discourse and all other sets are subsets of this set. The universe of discourse is conventionally denoted by the symbol U. Then we have A = def U A The Venn diagram with a shaded section for the complement of A is shown in Figure1 6, p.16 Homework 1 notes. 1. Be careful with problem 4! 2. Strategy for problem 5e, p. 25. In general, when any problem is confusing or difficult, try to break it into smaller steps and SHOW the STEPS. In fact more generally, if it CAN be broken into steps, it usually SHOULD be. So to compute Pow(Pow({a,b})), FIRST compute Pow({a,b}). (It should have 4 members.) Then figure out some systematic way to write down all the subsets of Pow({a,b}), which will be the members of Pow(Pow({a,b})). I think it works best to group them by numbers of members: all the 0-member subsets, all the 1-member subsets, all the 2-member subsets, then 3, then 4. (Hint: there should be 16 in all, including 6 2-member subsets.)

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

Section 2.1 Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the elements, or members of the set. A set is said to contain

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

Math 117 Chapter 7 and Probability Flathead Valley Community College Page 1 of 15 1. A set is a well-defined collection of specific objects. Each item in the set is called an element or a member. Curly

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

ets 4.1 Introduction If we can identify a property which is common to several objects, it is often useful to group them together. uch a grouping is called a set. Engineers for example, may wish to study

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

Set (mathematics) From Wikipedia, the free encyclopedia A set in mathematics is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

THE LNGGE OF SETS ND SET NOTTION Mathematics is often referred to as a language with its own vocabulary and rules of grammar; one of the basic building blocks of the language of mathematics is the language

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

2.1 Symbols and Terminology Definitions: set is a collection of objects. The objects belonging to the set are called elements, ormembers, oftheset. Sets can be designated in one of three different ways:

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

SETS Chapter 1 In these days of conflict between ancient and modern studies; there must surely be something to be said for a study which did not begin with Pythagoras and will not end with Einstein; but

Sets (DSLC 1.2) Intuitively, a set is a collection of things, called its elements, ormembers. To say that x is an element of S, wewrite x 2 S. Other ways of saying this: x belongs to S, S contains x, x

Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Decimal System Grade 6 Math Circles October 15/16, 2013 Binary and Beyond The cool reality is that we learn to count in only one of many possible number

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

Set operations and Venn Diagrams Set operations and Venn diagrams! = { x x " and x " } This is the intersection of and. # = { x x " or x " } This is the union of and. n element of! belongs to both and,

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach

Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.

CHAPTER 1 Sets All of mathematics can be described with sets. This becomes more and more apparent the deeper into mathematics you go. It will be apparent in most of your upper level courses, and certainly

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised January 5, 2011 What is a set? Sets set is a collection of objects. The objects in the set are called elements of

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

Computing Fundamentals 2 Lecture 4 Lattice Theory Lecturer: Patrick Browne Partial Order (e.g. ) A binary relation on a set B is called a partial order on B if it is: reflexive, anti-symmetric, and transitive.

FROM DECIMALS TO FRACTIONS LAMC INTERMEDIATE GROUP - 10/13/13 WARM UP! Deven was a bit curious about what the other instructors favorite numbers were. Unfortunately the Math Circle instructors are very

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Algebra I Pd Basic Inequalities 3A What is the answer to the following questions? Solving and Graphing Inequalities We know 4 is greater than 3, so is 5, so is 6, so is 7 and 3.1 works also. So does 3.01

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Sequences and Series November 30, 2012 What are sequences? A sequence is an ordered

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

Lecture 2 InfA: Deterministic Finite State Machines 2. Introduction In this lecture we will focus a little more on deterministic Finite State Machines. Also, we will be mostly concerned with Finite State

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

Discrete Math in CS CS 280 Fall 2005 (Kleinberg) Quantifiers 1 Quantifiers To formulate more complex mathematical statements, we use the quantifiers there exists, written, and for all, written. If P(x)

ÌÖ Ò ÓÖÑ Ø ÓÒ Ó Ø ÈÐ Ò A transformation of the Euclidean plane is a rule that assigns to each point in the plane another point in the plane. Transformations are also called mappings, or just maps. Examples

Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are