Scribd
Upload
268 views2 pages

Chapter 2 Set Theory Lesson 5 Multisets

This document discusses multisets, which allow elements to have a multiplicity greater than one. It defines multisets and provides examples. It then describes several operations on multisets: union, intersection, difference, sum. It gives examples to illustrate each operation. Finally, it briefly introduces ordered sets, ordered pairs, ordered triples, and ordered n-tuples.

Uploaded by

あなたを 食べたい鮎麻呂
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
268 views2 pages

Chapter 2 Set Theory Lesson 5 Multisets

This document discusses multisets, which allow elements to have a multiplicity greater than one. It defines multisets and provides examples. It then describes several operations on multisets: union, intersection, difference, sum. It gives examples to illustrate each operation. Finally, it briefly introduces ordered sets, ordered pairs, ordered triples, and ordered n-tuples.

Uploaded by

あなたを 食べたい鮎麻呂
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Discrete Mathematics

Chapter II Sets Theory Lesson 5 Multisets

Multisets
A multiset is an unordered collection of elements, in which the multiplicity of an element may
be one or more than one or zero. The multiplicity of an element is the number of times the
element repeated in the multiset. In other words, we can say that an element can appear any
number of times in a set.

Example:
A = {l, l, m, m, n, n, n, n}
B = {a, a, a, a, a, c}

Operations on Multisets
1. Union of Multisets: The Union of two multisets A and B is a multiset such that the
multiplicity of an element is equal to the maximum of the multiplicity of an element in A and B
and is denoted by A ∪ B.

Example:

Let A = {l, l, m, m, n, n, n, n}
B = {l, m, m, m, n},
A ∪ B = {l, l, m, m, m, n, n, n, n}

2. Intersections of Multisets: The intersection of two multisets A and B, is a multiset such


that the multiplicity of an element is equal to the minimum of the multiplicity of an element in
A and B and is denoted by A ∩ B.

Example:

Let A = {l, l, m, n, p, q, q, r}
B = {l, m, m, p, q, r, r, r, r}
A ∩ B = {l, m, p, q, r}.

3. Difference of Multisets: The difference of two multisets A and B, is a multiset such that the
multiplicity of an element is equal to the multiplicity of the element in A minus the multiplicity
of the element in B if the difference is +ve, and is equal to 0 if the difference is 0 or negative

Example:

Let A = {l, m, m, m, n, n, n, p, p, p}
B = {l, m, m, m, n, r, r, r}
A - B = {n, n, p, p, p}

4. Sum of Multisets: The sum of two multisets A and B, is a multiset such that the
multiplicity of an element is equal to the sum of the multiplicity of an element in A and B
Discrete Mathematics
Chapter II Sets Theory Lesson 5 Multisets

Example:

Let A = {l, m, n, p, r}
B = {l, l, m, n, n, n, p, r, r}
A + B = {l, l, l, m, m, n, n, n, n, p, p, r, r, r}

5. Cardinality of Sets: The cardinality of a multiset is the number of distinct elements in a


multiset without considering the multiplicity of an element

Example:

A = {l, l, m, m, n, n, n, p, p, p, p, q, q, q}
The cardinality of the multiset A is 5.

Ordered Set
It is defined as the ordered collection of distinct objects.

Example:

Roll no {3, 6, 7, 8, 9}
Week Days {S, M, T, W, W, TH, F, S, S}

Ordered Pairs
An Ordered Pair consists of two elements such that one of them is designated as the first
member and other as the second member.

(a, b) and (b, a) are two different ordered pair. An ordered triple can also be written regarding
an ordered pair as {(a, b) c}

An ordered Quadrable is an ordered pair {(((a, b), c) d)} with the first element as ordered triple.

An ordered n-tuple is an ordered pair where the first component is an ordered (n - 1) tuples,
and the nth element is the second component.

{(n -1), n}

Example:

You might also like