Cartesian product

From Wikipedia, the free encyclopedia

Jump to navigationJump to search
"Cartesian square" redirects here. For Cartesian squares in category theory, see Cartesian square
(category theory).

Cartesian product of the sets and

In set theory (and, usually, in other parts of mathematics), a Cartesian product is a mathematical
operation that returns a set (orproduct set or simply product) from multiple sets. That is, for
sets A and B, the Cartesian product A × B is the set of all ordered pairs(a, b) where a ∈ A and b ∈ B.
Products can be specified using set-builder notation, e.g.

[1]

A table can be created by taking the Cartesian product of a set of rows and a set of columns. If
the Cartesian product rows × columns is taken, the cells of the table contain ordered pairs of the
form (row value, column value).
More generally, a Cartesian product of n sets, also known as an n-fold Cartesian product, can
be represented by an array of ndimensions, where each element is an n-tuple. An ordered pair
is a 2-tuple or couple.
The Cartesian product is named after René Descartes,[2] whose formulation of analytic
geometry gave rise to the concept, which is further generalized in terms of direct product.

Contents
[hide]

 1Examples
o 1.1A deck of cards
o 1.2A two-dimensional coordinate system
 2Most common implementation (set theory)
o 2.1Non-commutativity and non-associativity
o 2.2Intersections, unions, and subsets
o 2.3Cardinality
 3Cartesian products of several sets
o 3.1n-ary Cartesian product
o 3.2n-ary Cartesian power
o 3.3Infinite Cartesian products
 4Other forms
 o 4.1Abbreviated form
o 4.2Cartesian product of functions
o 4.3Cylinder
 5Definitions outside set theory
o 5.1Category theory
o 5.2Graph theory
 6See also
 7References
 8External links

Examples[edit]
A deck of cards[edit]

Standard 52-card deck

An illustrative example is the standard 52-card deck. The standard playing card ranks {A, K, Q,
J, 10, 9, 8, 7, 6, 5, 4, 3, 2} form a 13-element set. The card suits {♠, ♥, ♦, ♣} form a four-element
set. The Cartesian product of these sets returns a 52-element set consisting of 52 ordered pairs,
which correspond to all 52 possible playing cards.
Ranks × Suits returns a set of the form {(A, ♠), (A, ♥), (A, ♦), (A, ♣), (K, ♠), ..., (3, ♣), (2, ♠), (2, ♥),
(2, ♦), (2, ♣)}.
Suits × Ranks returns a set of the form {(♠, A), (♠, K), (♠, Q), (♠, J), (♠, 10), ..., (♥, 6), (♥, 5), (♥,
4), (♥, 3), (♥, 2)}.
Both sets are distinct, even disjoint.
A two-dimensional coordinate system[edit]

Cartesian coordinates of example points

The main historical example is the Cartesian plane in analytic geometry. In order to represent
geometrical shapes in a numerical way and extract numerical information from shapes'
numerical representations, René Descartes assigned to each point in the plane a pair of real
numbers, called its coordinates. Usually, such a pair's first and second components are called
its x and y coordinates, respectively; cf. picture. The set of all such pairs (i.e. the Cartesian
product ℝ×ℝ with ℝ denoting the real numbers) is thus assigned to the set of all points in the
plane.

Most common implementation (set theory)[edit]

Main article: Implementation of mathematics in set theory
A formal definition of the Cartesian product from set-theoretical principles follows from a
definition of ordered pair. The most common definition of ordered pairs, the Kuratowski

definition, is . Under this definition, is an element of , and is a subset of

that set, where represents the power set operator. Therefore, the existence of the
Cartesian product of any two sets in ZFC follows from the axioms of pairing, union, power set,
and specification. Since functions are usually defined as a special case of relations, and
relations are usually defined as subsets of the Cartesian product, the definition of the two-set
Cartesian product is necessarily prior to most other definitions.
Non-commutativity and non-associativity[edit]
Let A, B, C, and D be sets.
The Cartesian product A × B is not commutative,

because the ordered pairs are reversed unless at least one of the following conditions is
satisfied:[3]

 A is equal to B, or
 A or B is the empty set.
For example:
A = {1,2}; B = {3,4}
A × B = {1,2} × {3,4} = {(1,3), (1,4), (2,3), (2,4)}
B × A = {3,4} × {1,2} = {(3,1), (3,2), (4,1), (4,2)}
A = B = {1,2}
A × B = B × A = {1,2} × {1,2} = {(1,1), (1,2), (2,1), (2,2)}
A = {1,2}; B = ∅
A × B = {1,2} × ∅ = ∅
B × A = ∅ × {1,2} = ∅

Strictly speaking, the Cartesian product is not associative (unless one of the
involved sets is empty).

If for example A = {1}, then (A × A) × A = { ((1,1),1) } ≠ { (1,(1,1)) } = A ×

(A × A).
Intersections, unions, and subsets[edit]

Example sets A={y∈ℝ:1≤y≤4},

B={x∈ℝ:2≤x≤5}, and C={x∈ℝ:4≤x≤7}, demonstrating
A×(B∩C) = (A×B)∩(A×C),
A×(B∪C) = (A×B)∪(A×C), and
A×(B \ C) = (A×B) \ (A×C).

(A∪B)×(C∪D) ≠ (A×C)∪(B×D) can be seen from the same example.

Example sets
A={x∈ℝ:2≤x≤5}, B={x∈ℝ:3≤x≤7},
C={y∈ℝ:1≤y≤3}, D={y∈ℝ:2≤y≤4}, demonstrating
(A∩B)×(C∩D) = (A×C)∩(B×D).

The Cartesian product behaves nicely with respect tointersections, cf. left
picture.
 [4]

In most cases the above statement is not true if we replace intersection

with union, cf. middle picture.

In fact, we have that:

For the set difference we also have the following identity:

Here are some rules demonstrating distributivity with other

operators (cf. right picture):[3]

[4]

where denotes the absolute

complement of A.
Other properties related with subsets are:

[5]

Cardinality[edit]
See also: Cardinal arithmetic
The cardinality of a set is the
number of elements of the set. For
example, defining two sets: A =
{a, b} and B = {5, 6}. Both
set A and set B consist of two
elements each. Their Cartesian
product, written as A × B, results
in a new set which has the
following elements:
A × B = {(a,5), (a,6), (b,5), (b,6)}.
Each element of A is paired
with each element of B. Each
pair makes up one element of
 the output set. The number of
values in each element of the
resulting set is equal to the
number of sets whose
cartesian product is being
taken; 2 in this case. The
cardinality of the output set is
equal to the product of the
cardinalities of all the input
sets. That is,
|A × B| = |A| · |B|.
Similarly
|A × B × C| = |A| · |B| · |C|
and so on.
The
set A × B is infinite if
either A or B is infinite
and the other set is
not the empty set.[6]

Cartesian
products of
several setsedit

et Operations

Subjects to be Learned

 union of sets
 intersection of sets
 difference of sets
 complement of set
 ordered pair, ordered n-tuple
 equality of ordered n-tuples
 Cartesian product of sets

Contents
Sets can be combined in a number of different ways to produce another set. Here four
basic operations are introduced and their properties are discussed.

Definition (Union): The union of sets A and B, denoted by A B , is the set defined
as

A B={x|x A x B}

Example 1: If A = {1, 2, 3} and B = {4, 5} , then A B = {1, 2, 3, 4, 5} .

Example 2: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A B = {1, 2, 3, 4, 5} .

Note that elements are not repeated in a set.

Definition (Intersection): The intersection of sets A and B, denoted by A B , is the

set defined as

A B={x|x A x B}

Example 3: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A B = {1, 2} .

Example 4: If A = {1, 2, 3} and B = {4, 5} , then A B= .

Definition (Difference): The difference of sets A from B , denoted by A - B , is the

set defined as

A-B={x|x A x B}

Example 5: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A - B = {3} .

Example 6: If A = {1, 2, 3} and B = {4, 5} , then A - B = {1, 2, 3} .

Note that in general A - B B-A

Definition (Complement): For a set A, the difference U - A , where U is the universe,

is called the complement of A and it is denoted by .
Thus is the set of everything that is not in A.

The fourth set operation is the Cartesian product We first define an ordered
pair and Cartesian product of two sets using it. Then the Cartesian product of multiple
sets is defined using the concept of n-tuple.

Definition (ordered pair):

An ordered pair is a pair of objects with an order associated with them.
If objects are represented by x and y, then we write the ordered pair as <x, y>.

Two ordered pairs <a, b> and <c, d> are equal if and only if a = c and b = d. For
example the ordered pair <1, 2> is not equal to the ordered pair <2, 1>.

Definition (Cartesian product):

The set of all ordered pairs <a, b>, where a is an element of A and b is an element
of B, is called the Cartesian product of A and B and is denoted by A B.
Example 1: Let A = {1, 2, 3} and B = {a, b}. Then
A B = {<1, a>, <1, b>, <2, a>, <2, b>, <3, a>, <3, b>} .

Example 2: For the same A and B as in Example 1,

B A = {<a, 1>, <a, 2>, <a, 3>, <b, 1>, <b, 2>, <b, 3>} .

As you can see in these examples, in

general, A B B A unless A = ,B= or A = B.
Note that A = A= because there is no element in to form ordered
pairs with elements of A.

The concept of Cartesian product can be extended to that of more than two sets. First
we are going to define the concept of ordered n-tuple.

Definition (ordered n-tuple): An ordered n-tuple is a set of n objects with an order

associated with them (rigorous definition to be filled in). If n objects are represented
by x1, x2, ..., xn, then we write the ordered n-tuple as <x1, x2, ..., xn> .

Definition (Cartesian product): Let A1, ..., An be n sets. Then the set of all
ordered n-tuples <x1, ..., xn> , where xi Ai for all i, 1 i n , is called
the Cartesian product of A1, ..., An, and is denoted byA1 ... An .

Example 3:
Let A = {1, 2}, B = {a, b} and C = {5, 6}. Then
A B C = {<1, a, 5>, <1, a, 6>, <1, b, 5>, <1, b, 6>, <2, a, 5>, <2, a, 6>, <2, b,
5>, <2, b, 6>} .

Definition (equality of n-tuples): Two ordered n-tuples <x1, ..., xn> and <y1,
..., yn> are equal if and only if xi = yi for all i, 1 i n .
For example the ordered 3-tuple <1, 2, 3> is not equal to the ordered n-tuple <2, 3,
1>.

Test Your Understanding of Set Operations

.........................

Cartesian product of sets A and B is denoted by A x B.

Set of all ordered pairs (a, b)of elements a∈ A, b ∈B then cartesian product A x B is
{(a, b): a ∈A, b ∈ B}

Example – Let A = {1, 2, 3} and B = {4, 5}. Find A x B and B x A and show that A x B ≠ B x
A.
Solution: AxB = {(1, 4) (1, 5) (2, 4) (2, 5) (3, 4) (3, 5)} and B x A = {(4, 1) (4, 2) (4, 3) (5, 1)
(5, 2) (5, 3)}
From the above, we can see that (1, 4) ∈ A x B but (1, 4) ∉ A x B. So, A x B ≠ B x A.
Remarks:-
1. A ≠ ∅ or B = ∅ Then, A x B = ∅
2. A ≠ ∅ and B ≠ ∅ then A x B ≠ ∅
3.If the set A has ‘m’ elements and the set B has ‘n’ elements, then A x B has mn elements.
4. If A≠ ∅ and B ≠ ∅ wither A or B is an infinite set, so is A x B
5. If A = B then A x B = A 2
6. If A, B and C are three sets then (a, b, c) where a A∈, b∈B and c x c then A x B x C = {(a,
b, c): a ∈A, b∈B c∈c}

Examples on Cartesian product of sets

1) Let A = {a,b,c} and B= {p,q}. Find the cartesian product of sets A and B.(i) A X B (ii) B X A
(iii) A x A (iv) B X B
 Solution :
(i) A X B = { (a,p),(a,q)(b,p)(b,q),(c,p),(c,q)}
(ii)B X A = { (p,a),(p,b)(p,c)(q,a),(q,b),(q,c)}
(iii) A X A = { (a,a),(a,b)(a,c)(b,a),(b,b),(b,c),(c,a), (c,b),(c,c)}
(iv) B x B = { (p,p),(p,q)(q,p)(q,q)}

2) Let A = {1, 2, 3}, B = {3, 4} C = {4, 5, 6} Find A x (B ∩ C)

Solution : A = {1, 2, 3}
B = {3, 4}
C = {4, 5, 6}
So, B ∩ C = {4}
Now, A x (B ∩C) = {(1, 4) (2, 4) (3, 4)}

3) Find x and y if (x + 2, 4) = (5, 2x +y)

Solution: By definition of equal ordered x + 2 = 5
∴x=5–2
x=3
2x + y = 4
2 (3) + y = 4
6+y=4
y=4–6
y = -2
So, x = 3 and y = -2

………………

Cartesian Product of Two Sets

Search

If A and B are two non-empty sets, then their Cartesian product A × B is the set
of all ordered pair of elements from A and B.

A × B = {(x, y) : x ∈ A, y ∈ B}

Suppose, if A and B are two non-empty sets, then the Cartesian product of two sets, A
and set B is the set of all ordered pairs (a, b) such that a ∈A and b∈B which is denoted
as A × B.

For Example;

1. If A = {7, 8} and B = {2, 4, 6}, find A × B.

Solution:

A × B = {(7, 2); (7, 4); (7, 6); (8, 2); (8, 4); (8, 6)}

The 6 ordered pairs thus formed can represent the position of points in a plane, if a and
B are subsets of a set of real numbers.

2. If A × B = {(p, x); (p, y); (q, x); (q, y)}, find A and B.

Solution:

A is a set of all first entries in ordered pairs in A × B.

B is a set of all second entries in ordered pairs in A × B.

Thus A = {p, q} and B = {x, y}

3. If A and B are two sets, and A × B consists of 6 elements: If three elements of A × B

are (2, 5) (3, 7) (4, 7) find A × B.

Solution:

Since, (2, 5) (3, 7) and (4, 7) are elements of A × B.

So, we can say that 2, 3, 4 are the elements of A and 5, 7 are the elements of B.

So, A = {2, 3, 4} and B = {5, 7}

Now, A × B = {(2, 5); (2, 7); (3, 5); (3, 7); (4, 5); (4, 7)}

Thus, A × B contain six ordered pairs.

4. If A = { 1, 3, 5} and B = {2, 3}, then

Find: (i) A × B (ii) B × A (iii) A × A (iv) (B × B)

Solution:

A ×B={1, 3, 5} × {2,3} = [{1, 2},{1, 3},{3, 2},{3, 3},{5, 2},{5, 3}]

B × A = {2, 3} × {1, 3, 5} = [{2, 1},{2, 3},{2, 5},{3, 1},{3, 3},{3, 5}]

A × A = {1, 3, 5} × {1, 3, 5}= [{1, 1},{1, 3},{1, 5},{3, 1},{3, 3},{3, 5},{5,
1},{5, 3},{5, 5}]

B × B = {2, 3} × {2, 3} = [{2, 2},{2, 3},{3, 2},{3, 3}]

Note:

If either A or B are null sets, then A ×B will also be an empty set, i.e., if A = ∅
or

B = ∅, then A × B = ∅

...........

Relation in Math
Search

The concept of relation in math refers to an association of two objects or two

variables based some property possessed by them.

For Example:

1. Rachel is the daughter of Noah.

This statement shows the relation between two persons.

The relation (R) being ‘is daughter of’.

2. 5 is less than 9.

This statement shows the relation between two numbers.

The relation (R) being ‘is less than’.

If A and B are two non-empty sets, then the relation R from A to B is a subset
of A x B, i.e., R ⊆ A x B.

If (a, b) ∈ R, then we write a R b and is read as 'a' related to 'b'.

3. Let A and B denote the set animals and their young ones.

Clearly, A = {cat, dog, cow, goat}

B = {kitten, puppy, calf, kid}

The relation (R) being ‘is young one of ‘.

Then the fact that,

Kitten is the young one of a cat.

Thus, kitten is related to cat.

Puppy is the young one of a dog.

Thus, puppy is related to dog.

Calf is the young one of a cow.

Thus, calf is related to cow.

Kid is the young one of a goat.

Thus, kid is related to goat.

This fact can also be written as set R or ordered pairs.

R = {(kitten, cat), (puppy, dog), (calf, cow), (kid, goat)}

Clearly, R ⊆ B × A

Thus, if A and B are two non-empty sets, then the relation R from A to B is a
subset of A×B, i.e., R ⊆ A × B.

If (a, b) ∈ R, then we write a R b and is read as a is related to b.

Representation of Relation in Math:

The relation in math from set A to set B is expressed in different forms.

(i) Roster form

(ii) Set builder form

(iii) Arrow diagram

i. Roster form:

● In this, the relation (R) from set A to B is represented as a set of ordered

pairs.

● In each ordered pair 1st component is from A; 2nd component is from B.

● Keep in mind the relation we are dealing with. (>, < etc.)

For Example:

1. If A = {p, q, r} B = {3, 4, 5}

then R = {(p, 3), (q, 4), (r, 5)}

Hence, R ⊆ A × B

2. Given A = {3, 4, 7, 10} B = {5, 2, 8, 1} then the relation R from A to B is

defined as ‘is less than’ and can be represented in the roster form as R = {(3,
5) (3, 8) (4, 5), (4, 8), (7, 8)}

Here, 1ˢᵗ component < 2ⁿᵈ component.

In roster form, the relation is represented by the set of all ordered pairs
belonging to R.

If A = {-1, 1, 2} and B = {1, 4, 9, 10}

if a R b means a² = b

then, R (in roster form) = {(-1, 1), (1, 1), (2, 4)

ii. Set builder form:

In this form, the relation R from set A to set B is represented as R = {(a, b): a
∈ A, b ∈ B, a...b}, the blank space is replaced by the rule which associates a
and b.

For Example:

Let A = {2, 4, 5, 6, 8} and B = {4, 6, 8, 9}

Let R = {(2, 4), (4, 6), (6, 8), (8, 10) then R in the set builder form, it can be
written as

R = {a, b} : a ∈ A, b ∈ B, a is 2 less than b}

iii. Arrow diagram:

● Draw two circles representing Set A and Set B.

● Write their elements in the corresponding sets, i.e., elements of Set A in circle
A and elements of Set B in circle B.

● Draw arrows from A to B which satisfy the relation and indicate the ordered
pairs.

For Example:

1. If A = {3, 4, 5} B = {2, 4, 6, 9, 15, 16, 25}, then relation R from A to B is

defined as ‘is a positive square root of’ and can be represented by the arrow
diagram as shown.
Here R = {(3, 9); (4, 16); (5, 25)}

In this form, the relation R from set A to set B is represented by drawing arrows
from 1ˢᵗ component to 2ⁿᵈ components of all ordered pairs which belong to R.
2. If A = {2, 3, 4, 5} and B = {1, 3, 5} and R be the relation 'is less than' from
A to B,
then R = {(2, 3), (2, 5), (3, 5), (4, 5)}

,,,,,,,,,,,,,,,,,,,,

Domain and Range of a Relation

Search

In domain and range of a relation, if R be a relation from set A to set B, then

• The set of all first components of the ordered pairs belonging to R is called the
domain of R.
Thus, Dom(R) = {a ∈ A: (a, b) ∈ R for some b ∈ B}.

• The set of all second components of the ordered pairs belonging to R is called
the range of R.

Thus, range of R = {b ∈ B: (a, b) ∈R for some a ∈ A}.

Therefore, Domain (R) = {a : (a, b) ∈ R} and Range (R) = {b : (a, b) ∈ R}

Note:

The domain of a relation from A to B is a subset of A.

The range of a relation from A to B is a subset of B.

For Example:

If A = {2, 4, 6, 8) B = {5, 7, 1, 9}.

Let R be the relation ‘is less than’ from A to B. Find Domain (R) and Range (R).

Solution:

Under this relation (R), we have

R = {(4, 5); (4, 7); (4, 9); (6, 7); (6, 9), (8, 9) (2, 5) (2, 7) (2, 9)}

Therefore, Domain (R) = {2, 4, 6, 8} and Range (R) = {1, 5, 7, 9}

Solved examples on domain and range of a relation:

1. In the given ordered pair (4, 6); (8, 4); (4, 4); (9, 11); (6, 3); (3, 0); (2, 3)
find the following relations. Also, find the domain and range.

(a) Is two less than

(b) Is less than

(c) Is greater than

(d) Is equal to

Solution:

(a) R₁ is the set of all ordered pairs whose 1ˢᵗ component is two less than the
2ⁿᵈ component.

Therefore, R₁ = {(4, 6); (9, 11)}

Also, Domain (R₁) = Set of all first components of R₁ = {4, 9} and Range (R₂) =
Set of all second components of R₂ = {6, 11}

(b) R₂ is the set of all ordered pairs whose 1ˢᵗ component is less than the second
component.

Therefore, R₂ = {(4, 6); (9, 11); (2, 3)}.

Also, Domain (R₂) = {4, 9, 2} and Range (R₂) = {6, 11, 3}

(c) R₃ is the set of all ordered pairs whose 1ˢᵗ component is greater than the
second component.

Therefore, R₃ = {(8, 4); (6, 3); (3, 0)}

Also, Domain (R₃) = {8, 6, 3} and Range (R₃) = {4, 3, 0}

(d) R₄ is the set of all ordered pairs whose 1ˢᵗ component is equal to the second
component.

Therefore, R₄ = {(3, 3)}

Also, Domain (R) = {3} and Range (R) = {3}

2. Let A = {2, 3, 4, 5} and B = {8, 9, 10, 11}.

Let R be the relation ‘is factor of’ from A to B.

(a) Write R in the roster form. Also, find Domain and Range of R.

(b) Draw an arrow diagram to represent the relation.

Solution:

(a) Clearly, R consists of elements (a, b) where a is a factor of b.

Therefore, Relation (R) in the roster form is R = {(2, 8); (2, 10); (3, 9); (4, 8),
(5, 10)}

Therefore, Domain (R) = Set of all first components of R = {2, 3, 4, 5} and

Range (R) = Set of all second components of R = {8, 10, 9}
(b) The arrow diagram representing R is as follows:

0Save

3. The arrow diagram shows the relation (R) from set A to set B. Write this
relation in the roster form.

0Save

Solution:

Clearly, R consists of elements (a, b), such that ‘a’ is square of ‘b’
i.e., a = b².

So, in roster form R = {(9, 3); (9, -3); (4, 2); (4, -2); (16, 4); (16, -4)}

Worked-out problems on domain and range of a relation:

4. Let A = {1, 2, 3, 4, 5} and B = {p, q, r, s}. Let R be a relation from A in B

defined by
R = {1, p}, (1, r), (3, p), (4, q), (5, s), (3, p)}

Find domain and range of R.

Solution:

Given R = {(1, p), (1, r), (4, q), (5, s)}

Domain of R = set of first components of all elements of R = {1, 3, 4, 5}

Range of R = set of second components of all elements of R = {p, r, q, s}

5. Determine the domain and range of the relation R defined by

R = {x + 2, x + 3} : x ∈ {0, 1, 2, 3, 4, 5}

Solution:

Since, x = {0, 1, 2, 3, 4, 5}

Therefore,

x = 0 ⇒ x + 2 = 0 + 2 = 2 and x + 3 = 0 + 3 = 3

x = 1 ⇒ x + 2 = 1 + 2 = 3 and x + 3 = 1 + 3 = 4

x = 2 ⇒ x + 2 = 2 + 2 = 4 and x + 3 = 2 + 3 = 5

x = 3 ⇒ x + 2 = 3 + 2 = 5 and x + 3 = 3 + 3 = 6

x = 4 ⇒ x + 2 = 4 + 2 = 6 and x + 3 = 4 + 3 = 7

x = 5 ⇒ x + 2 = 5 + 2 = 7 and x + 3 = 5 + 3 = 8

Hence, R = {(2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8)}

Therefore, Domain of R = {a : (a, b) ∈R} = Set of first components of all

ordered pair belonging to R.

Therefore, Domain of R = {2, 3, 4, 5, 6, 7}

Range of R = {b : (a, b) ∈ R} = Set of second components of all ordered pairs

belonging to R.

Therefore, Range of R = {3, 4, 5, 6, 7, 8}

6. Let A = {3, 4, 5, 6, 7, 8}. Define a relation R from A to A by

 R = {(x, y) : y = x - 1}.

• Depict this relation using an arrow diagram.

• Write down the domain and range of R.

Solution:

By definition of relation

R = {(4, 3) (5, 4) (6, 5)}

The corresponding arrow diagram is shown.

We can see that domain = {4, 5, 6} and Range = {3, 4, 5}

7. The adjoining figure shows a relation between the sets A and B.

Write this relation in

• Set builder form

• Roster form

• Find the domain and range

0Save
Solution:

We observe that the relation R is 'a’ is the square of ‘b'.

In set builder form R = {(a, b) : a is the square of b, a ∈ A, b ∈ B}

In roster form R = {(4, 2) (4, -2)(9, 3) (9, -3)}

Therefore, Domain of R = {4, 9}

Range of R = {2, -2, 3, -3}

Note: The element 1 is not related to any element in set A.

.........

Power Set
Search

Definition of power set:

We have defined a set as a collection of its elements so, if S is a set then the
collection or family of all subsets of S is called the power set of S and it is
denoted by P(S).

Thus, if S = a, b then the power set of S is given by P(S) = {{a}, {b}, {a, b},
∅}

We have defined a set as a collection of its elements if the element be sets

themselves, then we have a family of set or set of sets.

Thus, A = {{1}, {1, 2, 3}, {2}, {1, 2}} is a family of sets.

The null set or empty set having no element of its own is an element of the
power set; since, it is a subset of all sets. The set being a subset of itself is also
as an element of the power set.

For example:

1. The collection of all subsets of a non-empty set S is a set of sets. Thus, the
power set of a given set is always non-empty. This set is said to be the power
set of S and is denoted by P(S). If S contains N elements, then P(S) contains
2^n subsets, because a subset of P(S) is either ∅ or a subset containing r
elements of S, r = 1, 2, 3, ……..

Let S = {1, 2, 3} then the power set of S is given by P(S) = {{1}, {2}, {3},
{1, 2}, {2, 3}, {1, 3}, ∅, S}.

2. If S = (a), then P(S) = {(a), ∅}; if again S = ∅, then P(S) = {∅}. It should
be notated that ∅ ≠ {∅}. If S = {1, 2, 3} then the subset of S {1}, {2}, {3},
{1, 2}, {1, 3}, {2, 3}, {1, 2, 3}, ∅.

Hence, P(S) = {{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}, ∅}.

3. We know, since a set formed of all the subset of a set M as its elements is
called a power set of M and is symbolically denoted by P(M). So, if M is a void
set ∅, then P(M) has just one element ∅ then the power set of M is given by
P(M) = {∅}

What is a power set?

Ad by DigitalOcean

Starting a new project? Get started for free.

Scale your deployments with a flexible and predictable pricing model. Free for 60 days.

Learn more at try.digitalocean.com

11 Answers

Alan Bustany, Trinity Wrangler, 1977 IMO

Answered Sep 28 2017 · Upvoted by Justin Rising, PhD in statistics · Author has 5.4kanswers
and 14.8m answer views
Given a set, SS, its power set, P(S)P(S), is the set of all subsets of SS including the empty
set and SS itself.
For example,
given S={a,b},P(S)={{},{a},{b},{a,b}}S={a,b},P(S)={{},{a},{b},{a,b}}.
 If the cardinality of SS is |S||S|, then the cardinality
of P(S)P(S) is |P(S)|=2|S||P(S)|=2|S|which is strictly greater than |S||S| by Cantor’s
Theorem.
In our example, |S|=2|S|=2 so |P(S)|=22=4|P(S)|=22=4 as illustrated above. A set with
three elements would have a power set with 23=823=8 members.
When SS is an infinite set, its power set is infinitely larger than SS. For example
for S=NS=N, the set of all Natural numbers, whose cardinality is denoted ℵ0ℵ0, the power
set consists of all possible sets of Natural numbers. It can be shown that there is a one-to-
one correspondence between this power set and RR, the set of all Real numbers, whose
cardinality is denoted cc, the cardinality of the continuum. Hence we have:
|P(N)|=2ℵ0=|R|=c|P(N)|=2ℵ0=|R|=c
5.6k Views · View Upvoters

Promoted by Developer Economics

Are you working in development for IoT?

What kind of projects are you working on? What is your tool stack? Tell other
developers in this survey!

Start now at s.developereconomics.com

Related QuestionsMore Answers Below

 What is power set of A×A?

 What is the point of power sets?
 What are power sets used for?
 What is a power set example?
 What is the power set of {{}, 2}?
Ask New Question

Luke Joyce
Answered yesterday
Power set is a one type of set.Set is a collection of well defined distinct objects where Power
set is a collection of all sets in S and also include empty sets.Power set represented by P(S).
For example

A= {1,2,3}
B= {a,b}

C= {8,9,10}

P(S)= { {1,2,3} {8,9,10} {a,b} {} }

The power of set is calculated as 2^n where n is no.of elements

12 Views
Your feedback is private.
Is this answer useful?

Jack Ceroni, Aspiring to be a mathematician

Updated Mar 14 2017 · Author has 151 answers and 101k answer views
A power set, denoted by P(S)P(S), where SS is some set. Let’s say that:
S={a0,a1,a2}S={a0,a1,a2}
A power set is essentially all of the possible subsets of some set. Let’s apply this set, SS.
We can say that we have:

P(S)P(S)
Where:

S={a0,a1,a2}S={a0,a1,a2}
Then:

P(S)={{a0},{a0,a1},{a0,a1,a2},{a1},{a1,a2},{a2},{}}P(S)={{a0},{a0,a1},{a0,a1,a2}
,{a1},{a1,a2},{a2},{}}
Edit:

I said that the last element in the defined in in the power set was, {}{}. This is correct, but I
just wanted to say that you may also see this denoted by: ∅∅, which means the same thing.
Both denote empty sets.
1.4k Views · View Upvoters

Michael Carroll, former Teacher (Mathematics - Secondary Level)

Answered Oct 7 2017 · Author has 134 answers and 80.6k answer views
Let’s look at this in little steps.

First of all, let us start with some set which we will call set A.

I will use the following notation for talking about the power set of A: P(A).
P(A) will stand for another set. That is, the power set of A is also a set.

What is in P(A)? We will fill this new set with all the subsets of A itself.

Here is an example:

Let A = {2, h, sun}.

Now, let’s write out the power set of A.

P(A) = { empty set, {2}, {h}, {sun}, {2,h}, {2,sun}, {h,sun}, {2,h,sun} }

Why is this called the power set?

Let’s find out.

How many elements are in set A? There are three members in set A.

How many elements are in set P(A)? There are 8 members in set P(A).

Now notice that 2^3 = 8.

Is this a coincidence? No, it is not.

If A has n elements, then P(A) will have 2^n elements.

For this reason, another notation for P(A) is 2^A.

Now, I hope this has made you curious enough to wonder if 3^A has any special meaning
for sets. It does! But it is a bit too advanced to explain at this point in time.

In fact, for two sets A and B, the set A^B has a special meaning, one that matches up with
the sizes of A and B.

Last, I would like to point out that the ideas being talked about here is one doorway into real
mathematics.
Mathematics is not really about arithmetic, adding, subtraction, fractions, decimals and all
that stuff from primary and most of secondary school. In fact, only geometry really comes
close to giving a hint as to what mathematics is really about.

Mathematics is about understanding how things connect and the rules about how we
describe and formulate those rules. Mathematics is to arithmetic much the same way
grammar is to English.

It is beautiful in and of itself. In many ways it is like poetry.

905 Views
Your feedback is private.
Is this answer useful?

By Quora for Business

Quora has great answers. Have a great solution? Promote it here.

Businesses find great customers by targeting related topics. Create a free account in
minutes.

Sign up at quora.com

Sanket Alekar, I am fairly good at Math

Answered Nov 21 2015 · Author has 345 answers and 609.3k answer views
A power set of a given set S is the set of all subsets of S

Example:

Let S = {1,2,3,4}

Power set of S =

{},
{1},
{1,2},
{1,2,3},
{1,2,4},
{1,2,3,4},
{1,3},
 {1,3,4},
{1,4},
{2},
{2,3},
{2,3,4},
{2,4},
{3},
{3,4},
{4}

The number of subsets of a set is 2(number of elements of S)2(number of elements of S)

Why is this? Think about how you construct a subset of S. For each element in S, you have 2
choices:

a) Pick it as part of your subset

b) Don't pick it as part of your subset

So for every element you have 2 choices. As the choices you make for each element are
independent of each other, you have:

2 x 2 x 2 .... |S| times, where |S| = # of elements in S

= 2|S|2|S|
2.6k Views · View Upvoters

Manish Singh
Answered May 6 2015
Originally Answered: What is power set?
In maths, power set is collection of all the subsets of a set.

Let s={a,b,c} be a set.Then collection of subsets of set s is power set.

It has 2^(No. Of elements of s).

In this case 2^3 =8.So power set has 8 elements as shown.
667 Views
Your feedback is private.
Is this answer useful?
Ahaan Rungta, MIT '19
Answered Dec 1, 2013
The power set of a set SS is the set of all subsets of SS.
1.9k Views · View Upvoters

Naushad Ahmad, Class 11 Mathematics & Mathematics, Saint Christopher Academy (2001)
Answered Jan 22, 2017

It will be

272 Views · View Upvoters

Your feedback is private.
Is this answer useful?

Simran Duvvoori
Answered Dec 30, 2015
In mathematics, the power set (or powerset) of any set S, written P(S),℘(S), P(S),ℙ(S)
or 2S, is the set of all subsets of S, including the empty set and S itself. In axiomatic set
theory (as developed, for example, in theZFC axioms), the existence of the power set of any
set is postulated by theaxiom of power set.

Any subset of P(S) is called a family of sets over S.

2.5k Views · View Upvoters

Li Xuanji, just your average fixed-point combinator

Answered Dec 1, 2013
The power set of S is the set of all subsets of S.
756 Views · View Upvoters
Your feedback is private.
Is this answer useful?
Srinivasan, former Maths B.T.Asst Teacher (Retired) at P.S.G Sarvajana Hr.Sec School (1999-2010)
Answered Sep 28, 2017 · Author has 1.1k answers and 469.9k answer views
The set containing all the subsets as elements is known as a power set

The power set of A is P[A}

...................

Definition of

Power Set
more ...

"The set of all the subsets of a set"

Example: For the set {a,b,c}:

• The empty set {} is a subset of {a,b,c}

• And these are subsets: {a}, {b} and {c}
• And these are also subsets: {a,b}, {a,c} and {b,c}
• And {a,b,c} is a subset of {a,b,c}

And altogether they make the Power Set:

P(S) = { {}, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c} }

.................

Power Set
A Power Set is a set of all the subsets of a set.

OK? Got that? Maybe an example will help...

All The Subsets

 For the set {a,b,c}:

 The empty set {} is a subset of {a,b,c}

 And these are subsets: {a}, {b} and {c}
 And these are also subsets: {a,b}, {a,c} and {b,c}
 And {a,b,c} is a subset of {a,b,c}

And altogether we get the Power Set of {a,b,c}:

P(S) = { {}, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c} }

Think of it as all the different ways we can select the items (the order of the
items doesn't matter), including selecting none, or all.

Example: The shop has banana, chocolate and lemon ice

cream.

What do you order?

 Nothing at all: {}
 Or maybe just banana: {banana}. Or just {chocolate} or just {lemon}
 Or two together: {banana,chocolate} or {banana,lemon} or
{chocolate,lemon}
 Or all three! {banana, chocolate,lemon}
Question: if the shop also has strawberry flavor what are your options? Solution
later.

How Many Subsets

Easy! If the original set has n members, then the Power Set will
have 2n members

Example: {a,b,c} has three members (a,b and c).

So, the Power Set should have 23 = 8, which it does, as we worked out before.

Notation

The number of members of a set is often written as |S|, so when S has n

members we can write:

|P(S)| = 2n

Example: for the set S={1,2,3,4,5} how many members will

the power set have?

Well, S has 5 members, so:

|P(S)| = 2n = 25 = 32

You will see in a minute why the number of members is a power of 2

It's Binary!
And here is the most amazing thing. To create the Power Set, write down the
sequence of binary numbers (using n digits), and then let "1" mean "put the
matching member into this subset".
 So "101" is replaced by 1 a, 0 b and 1 c to get us {a,c}

Like this:

abc Subset
0 000 {}
1 001 {c}
2 010 {b}
3 011 {b,c}
4 100 {a}
5 101 {a,c}
6 110 {a,b}
7 111 {a,b,c}

Well, they are not in a pretty order, but they are all there.

Another Example

Let's eat! We have four flavors of ice cream: banana, chocolate, lemon, and
strawberry. How many different ways can we have them?

Let's use letters for the flavors: {b, c, l, s}. Example selections include:

 {} (nothing, you are on a diet)

 {b, c, l, s} (every flavor)
 {b, c} (banana and chocolate are good together)
 etc
Let's make the table using "binary":
bcls Subset
0 0000 {}
1 0001 {s}
2 0010 {l}
3 0011 {l,s}
... ... etc .. ... etc ...
12 1100 {b,c}
13 1101 {b,c,s}
14 1110 {b,c,l}
15 1111 {b,c,l,s}

And the result is (more neatly arranged):

P = { {}, {b}, {c}, {l}, {s}, {b,c}, {b,l}, {b,s}, {c,l}, {c,s}, {l,s}, {b,c,l},
{b,c,s},
{b,l,s}, {c,l,s}, {b,c,l,s} }

Symmetry

In the table above, did you notice that the first subset is empty and the last has
every member?

But did you also notice that the second subset has "s", and the second last subset
has everything except "s"?

In fact when we mirror that table about the middle we see there is a kind of
symmetry.

This is because the binary numbers (that we used to help us get all those
combinations) have a beautiful and elegant pattern.
 A Prime Example
The Power Set can be useful in unexpected areas.

I wanted to find all factors (not just the prime factors , but all factors) of a
number.

I could test all possible numbers: I could check 2, 3, 4, 5, 6, 7, etc...

That took a long time for large numbers.

But could I try to combine the prime factors?

Let me see, the prime factors of 510 are 2×3×5×17 (using prime factor tool ).

So, all the factors of 510 are:

 2, 3, 5 and 17,
 2×3, 2×5 and 2×17 as well, and
 2×3×5 and 2×3×17 and ...
 .. aha! Just like ice cream I needed a Power Set!

And this is what I got:

2,3,5,17 Subset Factors of 510

0 0000 {} 1
1 0001 {17} 17
2 0010 {5} 5
3 0011 {5,17} 5 × 17 = 85
4 0100 {3} 3
5 0101 {3,17} 3 × 17 = 51
... etc ... ... etc ... ... etc ...
15 1111 {2,3,5,17} 2 × 3 × 5 × 17 = 510
 And the result? The factors of 510 are 1, 2, 3, 5, 6, 10, 15, 17, 30, 34, 51, 85,
102, 170, 255 and 510 (and −1, −2, −3, etc as well). See the All Factors Tool .

Automated
I couldn't resist making Power Sets available to you in an automated way.

So, when you need a power set, try Power Set Maker .

..........

Power set
From Wikipedia, the free encyclopedia
Jump to navigationJump to search
For the search engine developer, see Powerset (company).

The elements of the power set of the set {x, y, z} ordered with respect to inclusion.

In mathematics, the power set (or powerset) of any set S is the set of all subsets of S, including
the empty set and S itself, variously denoted as P(S), 𝒫(S), ℘(S) (using the "Weierstrass
p"), P(S), ℙ(S), or, identifying the powerset of S with the set of all functions from Sto a given set of
two elements, 2S. In axiomatic set theory (as developed, for example, in the ZFC axioms), the
existence of the power set of any set is postulated by the axiom of power set.[1]
Any subset of P(S) is called a family of sets over S.

Contents
[hide]

 1Example
 2Properties
 3Representing subsets as functions
 4Relation to binomial theorem
 5Algorithms
 6Subsets of limited cardinality
 7Power object
 8Functors and quantifiers
 9See also
 10Notes
 11References
 12External links

Example[edit]
If S is the set {x, y, z}, then the subsets of S are

 {} (also denoted or , the empty set or the null set)

 {x}
 {y}
 {z}
 {x, y}
 {x, z}
 {y, z}
 {x, y, z}
and hence the power set of S is {{}, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}}.[2]

Properties[edit]
If S is a finite set with |S| = n elements, then the number of subsets of S is |P(S)| = 2n. This fact,
which is the motivation for the notation 2S, may be demonstrated simply as follows,
First, order the elements of S in any manner. We write any subset of S in the format {γ1, γ2,
..., γn } where γi , 1 ≤ i ≤ n, can take the value of 0 or 1. If γi = 1, the i-th element of S is in
the subset; otherwise, the i-th element is not in the subset. Clearly the number of distinct
subsets that can be constructed this way is 2n as γi ∈ {0, 1} .
Cantor's diagonal argument shows that the power set of a set (whether infinite or not) always
has strictly higher cardinality than the set itself (informally the power set must be larger than the
original set). In particular, Cantor's theorem shows that the power set of a countably infinite set
is uncountably infinite. The power set of the set of natural numberscan be put in a one-to-one
correspondence with the set of real numbers (see Cardinality of the continuum).
The power set of a set S, together with the operations of union, intersection and complement can
be viewed as the prototypical example of a Boolean algebra. In fact, one can show that
any finite Boolean algebra is isomorphic to the Boolean algebra of the power set of a finite set.
For infinite Boolean algebras this is no longer true, but every infinite Boolean algebra can be
represented as a subalgebra of a power set Boolean algebra (see Stone's representation
theorem).
The power set of a set S forms an abelian group when considered with the operation
of symmetric difference (with the empty set as the identity element and each set being its own
inverse) and a commutative monoid when considered with the operation of intersection. It can
hence be shown (by proving the distributive laws) that the power set considered together with
both of these operations forms a Boolean ring.

Representing subsets as functions[edit]

In set theory, XY is the set of all functions from Y to X. As "2" can be defined
as {0,1} (see natural number), 2S (i.e., {0,1}S) is the set of all functions from S to {0,1}. By
identifying a function in 2S with the corresponding preimage of 1, we see that there is
a bijection between 2S and P(S), where each function is the characteristic function of the subset
in P(S) with which it is identified. Hence 2S and P(S) could be considered identical set-
theoretically. (Thus there are two distinct notational motivations for denoting the power set by 2S:
the fact that this function-representation of subsets makes it a special case of the XY notation
and the property, mentioned above, that |2S| = 2|S|.)
This notion can be applied to the example above in which S = {x, y, z} to see the isomorphism
with the binary numbers from 0 to 2n − 1 with n being the number of elements in the set. In S, a
"1" in the position corresponding to the location in the set indicates the presence of the element.
So {x, y} = 110.
For the whole power set of S we get:

 {} = 000 (Binary) = 0 (Decimal)

 {x} = 100 = 4
 {y} = 010 = 2
 {z} = 001 = 1
 {x, y} = 110 = 6
 {x, z} = 101 = 5
 {y, z} = 011 = 3
 {x, y, z} = 111 = 7

Relation to binomial theorem[edit]

The power set is closely related to the binomial theorem. The number of subsets with k elements
in the power set of a set with n elements is given by the number ofcombinations, C(n, k), also
called binomial coefficients.
For example, the power set of a set with three elements, has:

 C(3, 0) = 1 subset with 0 elements (the empty subset),

 C(3, 1) = 3 subsets with 1 element (the singleton subsets),
 C(3, 2) = 3 subsets with 2 elements (the complements of the singleton subsets),
 C(3, 3) = 1 subset with 3 elements (the original set itself).

Algorithms[edit]
If S is a finite set, there is a recursive algorithm to calculate P(S).

Define the operation F (e, T) = {X ∪ {e} | X ∈ T}.

In English, return the set with the element e added to each set X in T.

 If S = { }, then P(S) = { { } } is returned.

 Otherwise:

 Let e be any single element of S.

 Let T = S \ {e}, where S \ {e} denotes the relative complement of e in S.
 And the result: P(S) = P(T) ∪ F (e, P(T)) is returned.
In other words, the power set of the empty set is the set containing the empty set and the
power set of any other set is all the subsets of the set containing some specific element and
all the subsets of the set not containing that specific element.

Subsets of limited cardinality[edit]

The set of subsets of S of cardinality less than κ is denoted by Pκ(S) or P< κ(S). Similarly,
the set of non-empty subsets of S might be denoted by P≥ 1(S).

Power object[edit]
A set can be regarded as an algebra having no nontrivial operations or defining equations.
From this perspective the idea of the power set of X as the set of subsets of Xgeneralizes
naturally to the subalgebras of an algebraic structure or algebra.
Now the power set of a set, when ordered by inclusion, is always a complete atomic
Boolean algebra, and every complete atomic Boolean algebra arises as the lattice of all
subsets of some set. The generalization to arbitrary algebras is that the set of subalgebras
of an algebra, again ordered by inclusion, is always an algebraic lattice, and every algebraic
lattice arises as the lattice of subalgebras of some algebra. So in that regard subalgebras
behave analogously to subsets.
However, there are two important properties of subsets that do not carry over to subalgebras
in general. First, although the subsets of a set form a set (as well as a lattice), in some
classes it may not be possible to organize the subalgebras of an algebra as itself an algebra
in that class, although they can always be organized as a lattice. Secondly, whereas the
subsets of a set are in bijection with the functions from that set to the set {0,1} = 2, there is
no guarantee that a class of algebras contains an algebra that can play the role of 2 in this
way.
Certain classes of algebras enjoy both of these properties. The first property is more
common, the case of having both is relatively rare. One class that does have both is that
ofmultigraphs. Given two multigraphs G and H, a homomorphism h: G → H consists of two
functions, one mapping vertices to vertices and the other mapping edges to edges. The
set HG of homomorphisms from G to H can then be organized as the graph whose vertices
and edges are respectively the vertex and edge functions appearing in that set.
Furthermore, the subgraphs of a multigraph G are in bijection with the graph
homomorphisms from G to the multigraph Ω definable as the complete directed graph on
two vertices (hence four edges, namely two self-loops and two more edges forming a cycle)
augmented with a fifth edge, namely a second self-loop at one of the vertices. We can
therefore organize the subgraphs of G as the multigraph ΩG, called the power object of G.
What is special about a multigraph as an algebra is that its operations are unary. A
multigraph has two sorts of elements forming a set V of vertices and E of edges, and has
two unary operations s,t: E → V giving the source (start) and target (end) vertices of each
edge. An algebra all of whose operations are unary is called a presheaf. Every class of
presheaves contains a presheaf Ω that plays the role for subalgebras that 2 plays for
subsets. Such a class is a special case of the more general notion of elementary topos as
acategory that is closed (and moreover cartesian closed) and has an object Ω, called
a subobject classifier. Although the term "power object" is sometimes used synonymously
with exponential object YX, in topos theory Y is required to be Ω.

Functors and quantifiers[edit]

In category theory and the theory of elementary topoi, the universal quantifier can be
understood as the right adjoint of a functor between power sets, the inverse image functor of
a function between sets; likewise, the existential quantifier is the left adjoint.[3]

See also[edit]
 Set theory
 Axiomatic set theory
 Family of sets
 Field of sets

Notes[edit]
1. Jump up^ Devlin 1979, p. 50
2. Jump up^ Puntambekar 2007, pp. 1–2
3. Jump up^ Saunders Mac Lane, Ieke Moerdijk, (1992) Sheaves in Geometry and
Logic Springer-Verlag. ISBN 0-387-97710-4 See page 58

References[edit]
 Devlin, Keith J. (1979). Fundamentals of contemporary set theory.
Universitext. Springer-Verlag. ISBN 0-387-90441-7. Zbl 0407.04003.
 Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate
Mathematics. van Nostrand Company. Zbl 0087.04403.
 Puntambekar, A. A. (2007). Theory Of Automata And Formal Languages. Technical
Publications. ISBN 978-81-8431-193-8.

External links[edit]
Look up power set in
Wiktionary, the free
dictionary.
  Weisstein, Eric W. "Power Set". MathWorld.
 "Power set". PlanetMath.
 Power set in nLab
 Power object in nLab
 Power set Algorithm in C++

//////////