Set of ordered pairs [closed]
$begingroup$
Let $X$ be a set of ordered pairs. How can I show that there exists sets $A$ and $B$ that $Xsubseteq A times B$?
elementary-set-theory
$endgroup$
closed as off-topic by Saad, Anurag A, Lord_Farin, mrtaurho, Namaste Dec 25 '18 at 15:06
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, Anurag A, Lord_Farin, mrtaurho, Namaste
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
$begingroup$
Let $X$ be a set of ordered pairs. How can I show that there exists sets $A$ and $B$ that $Xsubseteq A times B$?
elementary-set-theory
$endgroup$
closed as off-topic by Saad, Anurag A, Lord_Farin, mrtaurho, Namaste Dec 25 '18 at 15:06
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, Anurag A, Lord_Farin, mrtaurho, Namaste
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
$begingroup$
Let $X$ be a set of ordered pairs. How can I show that there exists sets $A$ and $B$ that $Xsubseteq A times B$?
elementary-set-theory
$endgroup$
Let $X$ be a set of ordered pairs. How can I show that there exists sets $A$ and $B$ that $Xsubseteq A times B$?
elementary-set-theory
elementary-set-theory
edited Dec 25 '18 at 11:31
Asaf Karagila♦
306k33438769
306k33438769
asked Dec 25 '18 at 7:57
t.ysnt.ysn
1397
1397
closed as off-topic by Saad, Anurag A, Lord_Farin, mrtaurho, Namaste Dec 25 '18 at 15:06
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, Anurag A, Lord_Farin, mrtaurho, Namaste
If this question can be reworded to fit the rules in the help center, please edit the question.
closed as off-topic by Saad, Anurag A, Lord_Farin, mrtaurho, Namaste Dec 25 '18 at 15:06
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, Anurag A, Lord_Farin, mrtaurho, Namaste
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Just take $A={amidexists b; (a,b)in X}$.
Any idea of your own now what to take for $B $?
$endgroup$
add a comment |
$begingroup$
Let A be the domain of X (first element of every pair in X), and B be the range of X (second element of every pair in X). These do exist, and X is surely the subset of their cartesian product.
$endgroup$
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Just take $A={amidexists b; (a,b)in X}$.
Any idea of your own now what to take for $B $?
$endgroup$
add a comment |
$begingroup$
Just take $A={amidexists b; (a,b)in X}$.
Any idea of your own now what to take for $B $?
$endgroup$
add a comment |
$begingroup$
Just take $A={amidexists b; (a,b)in X}$.
Any idea of your own now what to take for $B $?
$endgroup$
Just take $A={amidexists b; (a,b)in X}$.
Any idea of your own now what to take for $B $?
answered Dec 25 '18 at 8:04
drhabdrhab
103k545136
103k545136
add a comment |
add a comment |
$begingroup$
Let A be the domain of X (first element of every pair in X), and B be the range of X (second element of every pair in X). These do exist, and X is surely the subset of their cartesian product.
$endgroup$
add a comment |
$begingroup$
Let A be the domain of X (first element of every pair in X), and B be the range of X (second element of every pair in X). These do exist, and X is surely the subset of their cartesian product.
$endgroup$
add a comment |
$begingroup$
Let A be the domain of X (first element of every pair in X), and B be the range of X (second element of every pair in X). These do exist, and X is surely the subset of their cartesian product.
$endgroup$
Let A be the domain of X (first element of every pair in X), and B be the range of X (second element of every pair in X). These do exist, and X is surely the subset of their cartesian product.
answered Dec 25 '18 at 8:01
FrostFrost
1776
1776
add a comment |
add a comment |