Distinct relations in sets











up vote
0
down vote

favorite












Having done only set theory (or more specifically, trying to grasp it) so far, can someone explain what's meant with distinct relations in sets?
For example, assuming I have the sets: A={a, b} and B={c, d, e} and I would want to find out the distinct relations from A to B, how would one solve this and what's the meaning behind it?










share|cite|improve this question


















  • 1




    Please provide more context.
    – Berci
    Nov 16 at 21:14






  • 1




    The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
    – Eric Wofsey
    Nov 16 at 21:19










  • So basically just A x B?
    – K. Meyer
    Nov 16 at 21:22










  • Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
    – JMoravitz
    Nov 16 at 21:22










  • People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
    – JMoravitz
    Nov 16 at 21:27















up vote
0
down vote

favorite












Having done only set theory (or more specifically, trying to grasp it) so far, can someone explain what's meant with distinct relations in sets?
For example, assuming I have the sets: A={a, b} and B={c, d, e} and I would want to find out the distinct relations from A to B, how would one solve this and what's the meaning behind it?










share|cite|improve this question


















  • 1




    Please provide more context.
    – Berci
    Nov 16 at 21:14






  • 1




    The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
    – Eric Wofsey
    Nov 16 at 21:19










  • So basically just A x B?
    – K. Meyer
    Nov 16 at 21:22










  • Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
    – JMoravitz
    Nov 16 at 21:22










  • People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
    – JMoravitz
    Nov 16 at 21:27













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Having done only set theory (or more specifically, trying to grasp it) so far, can someone explain what's meant with distinct relations in sets?
For example, assuming I have the sets: A={a, b} and B={c, d, e} and I would want to find out the distinct relations from A to B, how would one solve this and what's the meaning behind it?










share|cite|improve this question













Having done only set theory (or more specifically, trying to grasp it) so far, can someone explain what's meant with distinct relations in sets?
For example, assuming I have the sets: A={a, b} and B={c, d, e} and I would want to find out the distinct relations from A to B, how would one solve this and what's the meaning behind it?







elementary-set-theory relations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 16 at 21:09









K. Meyer

11




11








  • 1




    Please provide more context.
    – Berci
    Nov 16 at 21:14






  • 1




    The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
    – Eric Wofsey
    Nov 16 at 21:19










  • So basically just A x B?
    – K. Meyer
    Nov 16 at 21:22










  • Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
    – JMoravitz
    Nov 16 at 21:22










  • People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
    – JMoravitz
    Nov 16 at 21:27














  • 1




    Please provide more context.
    – Berci
    Nov 16 at 21:14






  • 1




    The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
    – Eric Wofsey
    Nov 16 at 21:19










  • So basically just A x B?
    – K. Meyer
    Nov 16 at 21:22










  • Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
    – JMoravitz
    Nov 16 at 21:22










  • People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
    – JMoravitz
    Nov 16 at 21:27








1




1




Please provide more context.
– Berci
Nov 16 at 21:14




Please provide more context.
– Berci
Nov 16 at 21:14




1




1




The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
– Eric Wofsey
Nov 16 at 21:19




The term "distinct relation" has no standard meaning, unless the word "distinct" is just for emphasis and it merely means to list all the relations from $A$ to $B$.
– Eric Wofsey
Nov 16 at 21:19












So basically just A x B?
– K. Meyer
Nov 16 at 21:22




So basically just A x B?
– K. Meyer
Nov 16 at 21:22












Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
– JMoravitz
Nov 16 at 21:22




Remember that a relation from $A$ to $B$ is merely a subset of $Atimes B$. One example of a relation from $A$ to $B$ is the relation ${(a,c),(a,d),(a,e)}$. Another example is ${(a,c),(b,d)}$. Yet another would be $emptyset$. The list goes on. If you want to actually write them all out, you can follow a simple algorithm to do so, but noone generally bothers, it is easier to refer to the set of all relations from $A$ to $B$ simply as $mathcal{P}(Atimes B)$ where $mathcal{P}(~)$ refers to the powerset. The number of such relations would be $2^{|A|times |B|}$
– JMoravitz
Nov 16 at 21:22












People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
– JMoravitz
Nov 16 at 21:27




People use relations all the time in their everyday life, we just have specific names for those relations. For example, let $A$ be the set of English letters ${a,b,c,d,dots,z}$ and let $B$ be the set of English words appearing in the Oxford Dictionary: $B={text{aardvark, abacus, abate},dots}$. Then one example of a relation is the "is the first letter of" relation, where $a$ is related to "aardvark" since the first letter of "aardvark" is $a$. A different relation would be "is a letter in" where not only is $a$ related to "aardvark" but so too is $d$ and $v$ etc...
– JMoravitz
Nov 16 at 21:27















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3001641%2fdistinct-relations-in-sets%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3001641%2fdistinct-relations-in-sets%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown