Fundamentals/ICY: Databases 2013/14 WEEK 8 –Monday

Slides:



Advertisements
Similar presentations
Introduction to Set Theory
Advertisements

Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
Relations Chapter 9.
Fundamentals/ICY: Databases 2012/13 WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Objectives: To evaluate and simplify algebraic expressions.
Michaelmas Term 2004 Discrete Mathematics CSC 141 Discrete Mathematics Dr. Corina Sas and Ms. Nelly Bencomo
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Introduction to Set Theory. Introduction to Sets – the basics A set is a collection of objects. Objects in the collection are called elements of the set.
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Intro to Maths for CS: 2012/13 Sets (week 1 part) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2012/13 WEEK 10 (maths, normalization) John Barnden Professor of Artificial Intelligence School of Computer Science University.
Set Theory Dr. Ahmed Elmoasry. Contents Ch I: Experiments, Models, and Probabilities. Ch II: Discrete Random Variables Ch III: Discrete Random Variables.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Objective The student will be able to: recognize and use the commutative and associative properties and the properties of equality.
OTCQ Using [-11, 0) Write its associated: 1) inequality, or 2) set in braces, or 3) number line. (for integers only)
CS201: Data Structures and Discrete Mathematics I
ELEMENTARY SET THEORY.
THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.1 Algebraic Expressions, Mathematical.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Fundamentals/ICY: Databases 2013/14 Week 11 – Monday – relations, ended. John Barnden Professor of Artificial Intelligence School of Computer Science University.
Fundamentals/ICY: Databases 2012/13 WEEK 9 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
CSE 311 Foundations of Computing I Lecture 19 Recursive Definitions: Context-Free Grammars and Languages Spring
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
1.1 – SETS AND SYMBOLS. Goals SWBAT understand basic set notation and set symbols SWBAT solve simple sentences with a given domain SWBAT graph sets of.
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Sets, Permutations, and Combinations. Lecture 4-1: Sets Sets: Powerful tool in computer science to solve real world problems. A set is a collection of.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Chapter two Theory of sets
Part # 1: Due October 10th Part # 2: Due January 16th
Intro to Maths for CS: 2012/13 Sets (contd, week 2)
Discrete Mathematical The Set Theory
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Set, Combinatorics, Probability & Number Theory
Sets Section 2.1.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Fundamentals/ICY: Databases 2010/11 WEEK 6
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
CS100: Discrete structures
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Set-Builder Notation.
Model the non-negative even integers
Relationships Between Sets
Advanced Algorithms Analysis and Design
دوره‏ی ضمن خدمت کشوری ریاضی پایه‏ی نهم مرداد 1394.
Precalculus Essentials
Mathematical Background 1
Mathematical Background 1
Real Numbers and their Properties
Discrete Mathematics CS 2610
The aim of education is to teach students how to think rather than what to think. Sets The set is the fundamental discrete structure on which all other.
MCS680: Foundations Of Computer Science
Fundamentals/ICY: Databases 2013/14 WEEK 6 - Friday
Lecture Sets 2.2 Set Operations.
John Barnden Professor of Artificial Intelligence
SETS, RELATIONS, FUNCTIONS
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Objective The student will be able to:

Lecture 3 Strings and Things (Section 1.1)
REAL NUMBERS.
Terminology and Symbols
Presentation transcript:

Fundamentals/ICY: Databases 2013/14 WEEK 8 –Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

Reminder

Some More Examples {JAB, “JAB”} has 2 members: me, and a 3-char string. {3, {4,5}, 4, 6}has 4 members, one of which is a set. {3, {5,4}, 4, 6} is that same set. { {4,5} } has 1 member, which is a set. {4,5} has 2 members, both numbers. {} is a singleton set. Its only member is the empty set. {{}} is a different singleton set. 3

New

Membership Relationship a  A means that a is a member of A. 5  {4,5} {5,4}  {3, {4,5}, 4, 6} a  A means that a is not a member of A. 5  {3, {4,5}, 4, 6} {5}  {3, {4,5}, 4, 6} {4,6}  {3, {4,5}, 4, 6} {3,4,5}  {3, {4,5}, 4, 6} 5

Subsets and Supersets A  B means that A is a “subset” of B (and that B is a “superset” of A). I.e., every member of A is also a member of B. Carefully distinguish between subset-of and member-of !!! The symbol  means the same as   does NOT mean that there cannot be equality. Examples:   {4,5} {5}  {4,5,6}, {6,4}  {4,5,6,7}, {6,4,7,5}  {4,5,6,7} {n | n is an EVEN whole number}  {n | n is a whole number}

Subsets and Supersets   A for any set A. A  A for any set A. (Reflexivity) If A  B and B  A then A = B. (Antisymmetry) If A  B and B  C then A  C. (Transitivity)

A Note about Antisymmetry In arithmetic, both < and ≤ (and similarly > and ≥) are antisymmetric under the definition: A (mathematical) relationship is antiymmetric iff: IF it applies in both directions between items A and B then A and B are the same item. It’s just that in the case of < and > it can never apply in both directions between any A, B.

A Note about Antisymmetry (with extra explanation added after lecture) In arithmetic, both < and ≤ (and similarly > and ≥) are antisymmetric under the definition: A (mathematical) relationship is antiymmetric iff the following holds: IF it applies in both directions between items A and B then A and B are the same item. Another way of putting that definition: A (mathematical) relationship is antiymmetric iff the following holds: IF it applies in one direction between two DIFFERENT items A and B then it cannot apply in the other direction. < (similarly >) can never apply in both directions between any A, B—so the first purple rule is vacuously satisfied. But ≤ (similarly ≥) can be in both directions—though only when A=B.

Some Operations on Sets Union of sets A and B: A  B = the set of things that are in A or B (or both). NB: no repetitions created. Intersection of sets A and B: A  B = the set of things that are in both A and B. Difference of sets A and B: A  B = the set of things that are in A but not B. Note: also notated by a backslash instead of a minus sign. The minus sign is also more standardly used as in A  a to mean remove member a from A (if it’s a member of A at all).

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 for union-only or intersection-only cases: A  B  C  D A  B  C  D

Bad Associations … Caution: if an operation is not associative, the position of parentheses is normally important. In arithmetic, division is non-associative. (x/y)/z is usually a different value from x/(y/z).

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)