Intersection of sets *

Similar documents
1.1 - Introduction to Sets

2.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

Lecture 15: The subspace topology, Closed sets

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

What is Set? Set Theory. Notation. Venn Diagram

Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable *

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

11 Sets II Operations

2 Review of Set Theory

Topology Homework 3. Section Section 3.3. Samuel Otten

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee

CSC Discrete Math I, Spring Sets

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

Discrete Mathematics

Figure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets

1.2 Venn Diagrams and Partitions

Algebra of Sets (Mathematics & Logic A)

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4

The Intersection of Two Sets

Polar Coordinates. OpenStax. 1 Dening Polar Coordinates

Functions and Graphs: Graphs of Inverse Functions (Grade 12) *

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

1 Sets, Fields, and Events

9.5 Equivalence Relations

Sets and set operations

Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1

Lecture - 8A: Subbasis of Topology

Lecture-12: Closed Sets

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra

Math Week in Review #5

MATH HOMEWORK 2 1

Chapter 3. Set Theory. 3.1 What is a Set?

2.1 Sets 2.2 Set Operations

Fundamental Properties of Graphs

1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula

3 No-Wait Job Shops with Variable Processing Times


9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

c) the set of students at your school who either are sophomores or are taking discrete mathematics

Tilings of the Euclidean plane

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

Tuesday, November 5, 2013 Name: Per:

Algebraic Properties of CSP Model Operators? Y.C. Law and J.H.M. Lee. The Chinese University of Hong Kong.

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Solution: It may be helpful to list out exactly what is in each of these events:

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Introduction. Sets and the Real Number System

EXTREME POINTS AND AFFINE EQUIVALENCE

CS100: DISCRETE STRUCTURES

2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to

Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example

Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets

COUNTING AND PROBABILITY

Mathematics for Computer Science Exercises from Week 4

Lecture : Topological Space

Chapter 1. Preliminaries

16 Greedy Algorithms

Module 2: Single Step Methods Lecture 4: The Euler Method. The Lecture Contains: The Euler Method. Euler's Method (Analytical Interpretations)

On the Max Coloring Problem

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Lecture IV - Further preliminaries from general topology:

Monotone Paths in Geometric Triangulations

Trigonometry * Scott Starks. 1 Trigonometry

A stack eect (type signature) is a pair of input parameter types and output parameter types. We also consider the type clash as a stack eect. The set

Bijective Proofs of Two Broken Circuit Theorems

Generell Topologi. Richard Williamson. May 6, 2013

DeMorgan's Theorem. George Self. 1 Introduction

Johns Hopkins Math Tournament Proof Round: Point Set Topology

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.

FUDMA Journal of Sciences (FJS) Maiden Edition Vol. 1 No. 1, November, 2017, pp ON ISOMORPHIC SOFT LATTICES AND SOFT SUBLATTICES

These notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.

Generell Topologi. Richard Williamson. May 27, 2013

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set

Section 6.3: Further Rules for Counting Sets

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Propositional Logic. Andreas Klappenecker

Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Sections p.

Sets and set operations. Lecture 5 ICOM 4075

Lecture 11 COVERING SPACES

Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np

Simplicial Cells in Arrangements of Hyperplanes

Classification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5

(a) (b) Figure 1: Bipartite digraph (a) and solution to its edge-connectivity incrementation problem (b). A directed line represents an edge that has

Discharging and reducible configurations

Let us dene the basic notation and list some results. We will consider that stack eects (type signatures) form a polycyclic monoid (introduced in [NiP

Molecular Shapes and Surfaces *

Generell Topologi. Richard Williamson. May 6, 2013

The Rectangular Coordinate Systems and Graphs

Characterization of Boolean Topological Logics

LECTURE 8: SETS. Software Engineering Mike Wooldridge

Section Sets and Set Operations

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

Section 13. Basis for a Topology

Mathematically Rigorous Software Design Review of mathematical prerequisites

Set and Set Operations

Transcription:

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 representing a real situation is not an isolated collection. Sets, in general, overlaps with each other. It is primarily because a set is dened on few characteristics, whereas elements generally can possess many characteristics. Unlike union, which includes all elements from two sets, the intersection between two sets includes only common elements. Denition 1: Intersection of two sets The intersection of sets A and B is the set of all elements common to both A and B. The use of word and between two sets in dening an intersection is quite signicant. Compare it with the denition of union. We used the word or between two sets. Pondering on these two words, while deciding membership of union or intersection, is helpful in application situation. The intersection operation is denoted by the symbol, " ". We can write intersection in set builder form as : * Version 1.2: Oct 19, 2007 8:05 am -0500 http://creativecommons.org/licenses/by/2.0/

OpenStax-CNX module: m15196 2 Intersection of two sets The intersection set consists of elements common to two sets. A B = {x : x A and x B} Again note use of the word and in set builder qualication. We can read this as x is an element, which belongs to set A and set B. Hence, it means that x belongs to both A and B. In order to understand the operation, let us consider the earlier example again, A = {1, 2, 3, 4, 5, 6} Then, B = {4, 5, 6, 7, 8} A B = {4, 5, 6} On Venn diagram, an intersection is the region intersected by circles, which represent two sets.

OpenStax-CNX module: m15196 3 Intersection of two sets The intersection set consists of elements common to two sets. 1 Interpretation of Intersection set Let us examine the dening set of intersection : A B = {x : x A and x B} We consider an arbitrary element, say x, of the intersection set. Then, we interpret the conditional meaning as : If x A B x A and x B. The conditional statement is true in opposite direction as well. Hence, Ifx A and x B x A B. We summarize two statements with two ways arrow as : x A B x A and x B In addition to two ways relation, there is an interesting aspect of intersection. Intersection is subset of either of two sets. From Venn diagram, it is clear that :

OpenStax-CNX module: m15196 4 Intersection of two sets The intersection set consists of elements common to two sets. and (A B) A (A B) B 1.1 Intersection with a subset Since all elements of a subset is present in the set, it emerges that intersection with subset is subset. Hence, if A is subset of set B, then : B A = A 1.2 Intersection of disjoint sets If no element is common to two sets A and B, then the resulting intersection is an empty set : A B = φ In that case, two sets A and B are disjoint sets.

OpenStax-CNX module: m15196 5 1.3 Multiple intersections If A 1, A 2, A 3,........., A n is a nite family of sets, then their intersections one after another is denoted as : A 1 A 2 A 3....... An 2 Important results In this section we shall discuss some of the important characteristics/ deductions for the intersection operation. 2.1 Idempotent law The intersection of a set with itself is the set itself. A A = A This is because intersection is a set of common elements. Here, all elements of a set is common with itself. The resulting intersection, therefore, is set itself. 2.2 Identity law The intersection with universal set yields the set itself. Hence, universal set functions as the identity of the intersection operator. A U = A It is easy to interpret this law. Only the elements in "A" are common to universal set. Hence, intersection, being the set of common elements, is set "A". 2.3 Law of empty set Since empty set is element of all other sets, it emerges that intersection of an empty set with any set is an empty set (empty set is only common element between two sets). φ A = φ 2.4 Commutative law The order of sets around intersection operator does not change the intersection. Hence, commutative property holds in the case of intersection operation. A B = B A 2.5 Associative law The associative property holds with respect to intersection operator. (A B) C = A (B C) The intersection of sets A and B on Venn's diagram is :

OpenStax-CNX module: m15196 6 Intersection of two sets The intersection is a set of common elements and shown as colored region. In turn, the intersection of set A B and set C is the small region in the center :

OpenStax-CNX module: m15196 7 Intersection inloving three sets Intersection of a set with "the intersection set of two sets" It is easy to visualize that the ultimate intersection is independent of the sequence of operation. 2.6 Distributive law The intersection operator( ) is distributed over union operator ( ) : A (B C) = (A B) (A C) We can check out this relation with the help of Venn diagram. For convenience, we have not shown the universal set. In the rst diagram on the left, the colored region shows the union of sets B and C ie. B C. The colored region in the second diagram on the right shows the intersection of set A with the union obtained in the rst diagram i.e. B C.

OpenStax-CNX module: m15196 8 Distributive law Distribution of intersection operator over union operator We can now interpret the colored region in the second diagram from the point of view of expression on the right hand side of the equation : A (B C) = (A B) (A C) The colored region is indeed the union of two intersections : " A B" and " A C". Thus, we conclude that distributive property holds for "intersection operator over union operator". In the same manner, we can prove distribution of union operator over intersection operator : A (B C) = (A B) (A C) 2.6.1 Analytical proof Distributive properties are important and used for practical application. In this section, we shall prove the same in analytical manner. For this, let us consider an arbitrary element x, which belongs to set " A (B C)" : Then, by denition of intersection : x A (B C) x A and x (B C)

OpenStax-CNX module: m15196 9 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) or (A C) x (A B) (A C) But, we had started with " A (B C) " and used its denition to show that x belongs to another set. It means that the other set consists of the elements of the rst set at the least. Thus, A (B C) (A B) (A C) Similarly, we can start with " (A B) (A C) " and reach the conclusion that : (A B) (A C) A (B C) If sets are subsets of each other, then they are equal. Hence, A (B C) = (A B) (A C) Proceeding in the same manner, we can also prove other distributive property of union operator over intersection operator : A (B C) = (A B) (A C)