Not indeed.
Cartesian product produces tuples as the result, but I am interested
in the set form of these tuples.
if there are two sets like X={A,B,C} & Y={A,B}
then The Cartesian product will be:
X.Y={(A,A),(A,B),(B,A),(B,B),(C,A),(C,B)}
Whereas if insted of tuples sets were produced it would be like the
followings:
X.Y={{A}, {A,B}, {B}, {A,C}, {B,C}}
P.
On Feb 9, 2010, at 5:21 AM, vignesh radhakrishnan wrote:
The unordered pair will be a subset of cartesian product. What is
the significance of it?
On 8 February 2010 21:18, pinco1984 <[email protected]> wrote:
Hi all,
I have came across a problem and I am not aware if there is such a
thing in set theory and if so what is it called.
Mainly I have several sets that I am interested in their cartesian
product. But this cartesian product should not be a set of ordered
pairs but a set of sets. Basically unordered pairs.
I wonder if this concept is well defined and what is it called.
Thanks.
P.
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to [email protected]
.
For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en
.
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to [email protected]
.
For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en
.
Parisa
--
You received this message because you are subscribed to the Google Groups "Algorithm
Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
