Find all finite sets A so that A x P(A) = P(A) x A, where P(A) is the power set of A.












3












$begingroup$


Now I'm a beginner at Discrete Math so I'm not sure how to tackle this problem. I was expecting that a set with elements would provided to prove this. My best hunch is that all sets should work since its the same on both sides of the equal sign. If you could help me find out how work through the question, instead of just an answer that would be great!










share|cite|improve this question







New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    @Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    @N.S. I didn't catch that; you're right.
    $endgroup$
    – Hyperion
    1 hour ago
















3












$begingroup$


Now I'm a beginner at Discrete Math so I'm not sure how to tackle this problem. I was expecting that a set with elements would provided to prove this. My best hunch is that all sets should work since its the same on both sides of the equal sign. If you could help me find out how work through the question, instead of just an answer that would be great!










share|cite|improve this question







New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    @Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    @N.S. I didn't catch that; you're right.
    $endgroup$
    – Hyperion
    1 hour ago














3












3








3





$begingroup$


Now I'm a beginner at Discrete Math so I'm not sure how to tackle this problem. I was expecting that a set with elements would provided to prove this. My best hunch is that all sets should work since its the same on both sides of the equal sign. If you could help me find out how work through the question, instead of just an answer that would be great!










share|cite|improve this question







New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




Now I'm a beginner at Discrete Math so I'm not sure how to tackle this problem. I was expecting that a set with elements would provided to prove this. My best hunch is that all sets should work since its the same on both sides of the equal sign. If you could help me find out how work through the question, instead of just an answer that would be great!







discrete-mathematics






share|cite|improve this question







New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question







New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question






New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 1 hour ago









BrownieBrownie

162




162




New contributor




Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Brownie is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • $begingroup$
    If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    @Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    @N.S. I didn't catch that; you're right.
    $endgroup$
    – Hyperion
    1 hour ago


















  • $begingroup$
    If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
    $endgroup$
    – Hyperion
    1 hour ago










  • $begingroup$
    @Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    @N.S. I didn't catch that; you're right.
    $endgroup$
    – Hyperion
    1 hour ago
















$begingroup$
If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
$endgroup$
– Hyperion
1 hour ago




$begingroup$
If by $times$ you mean the Cartesian Product, then it is not true that $A times mathcal{P}(A) = mathcal{P}(A) times A$. $mathcal{P}(A)$ is composed of sets of $A$ and $A$ is composed of elements of $A$, so I can't think of any scenario where this would be true.
$endgroup$
– Hyperion
1 hour ago












$begingroup$
In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
$endgroup$
– Hyperion
1 hour ago




$begingroup$
In fact, $A times B neq B times A$ unless $A = B$, and because $mathcal{P}(A) neq A$, they can never be equal.
$endgroup$
– Hyperion
1 hour ago












$begingroup$
@Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
$endgroup$
– N. S.
1 hour ago




$begingroup$
@Hyperion $ emptyset times mbox{ anything } = mbox{ anything } times emptyset$.
$endgroup$
– N. S.
1 hour ago












$begingroup$
@N.S. I didn't catch that; you're right.
$endgroup$
– Hyperion
1 hour ago




$begingroup$
@N.S. I didn't catch that; you're right.
$endgroup$
– Hyperion
1 hour ago










2 Answers
2






active

oldest

votes


















3












$begingroup$

Hint 1: $mathcal P (A)$ always has more elements than $A$. In particular $A neq mathcal P(A)$.



Hint 2: If $A times B =B times A$ then you can prove that either $A=B$ or one of $A,B$ is empty.



Indeed, if you assume by contradiction that you have $A neq B$ and that neither $A$ nor $B$ is empty, then you can find an element $x$ which is in exactly one of the sets $A$ or $B$. Now, by using that neither $A$ nor $B$ is empty, you can pick some $y$ in the other set. Look at $(x,y)$.



Hint 3 Conclude that $A=emptyset$ is the only solution.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
    $endgroup$
    – Brownie
    1 hour ago








  • 1




    $begingroup$
    @Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    @Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
    $endgroup$
    – N. S.
    1 hour ago



















1












$begingroup$

Assuming that "x" is the Cartesian product of two sets, we have the definition




For two sets $A$ and $B$, the cartesian product is given by
$$Atimes B={ (a,b):ain A, bin B}$$




Suppose that $Atimes P(A)$ for some set $A$.
Then, each element of $P(A)$ must be in $A$.
However, by Cantor's theorem, we have that $|A|<|P(A)|$ for any $A$, thus there is at least one element of $P(A)$ that is not in $A$.

Thus it cannot be true that $Atimes P(A)=P(A)times A$ for any set $A$.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    "Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
    $endgroup$
    – N. S.
    1 hour ago








  • 3




    $begingroup$
    Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    Thank you for the correction, will edit.
    $endgroup$
    – 高田航
    1 hour ago











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',
autoActivateHeartbeat: false,
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
});


}
});






Brownie is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3090408%2ffind-all-finite-sets-a-so-that-a-x-pa-pa-x-a-where-pa-is-the-power-set%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









3












$begingroup$

Hint 1: $mathcal P (A)$ always has more elements than $A$. In particular $A neq mathcal P(A)$.



Hint 2: If $A times B =B times A$ then you can prove that either $A=B$ or one of $A,B$ is empty.



Indeed, if you assume by contradiction that you have $A neq B$ and that neither $A$ nor $B$ is empty, then you can find an element $x$ which is in exactly one of the sets $A$ or $B$. Now, by using that neither $A$ nor $B$ is empty, you can pick some $y$ in the other set. Look at $(x,y)$.



Hint 3 Conclude that $A=emptyset$ is the only solution.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
    $endgroup$
    – Brownie
    1 hour ago








  • 1




    $begingroup$
    @Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    @Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
    $endgroup$
    – N. S.
    1 hour ago
















3












$begingroup$

Hint 1: $mathcal P (A)$ always has more elements than $A$. In particular $A neq mathcal P(A)$.



Hint 2: If $A times B =B times A$ then you can prove that either $A=B$ or one of $A,B$ is empty.



Indeed, if you assume by contradiction that you have $A neq B$ and that neither $A$ nor $B$ is empty, then you can find an element $x$ which is in exactly one of the sets $A$ or $B$. Now, by using that neither $A$ nor $B$ is empty, you can pick some $y$ in the other set. Look at $(x,y)$.



Hint 3 Conclude that $A=emptyset$ is the only solution.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
    $endgroup$
    – Brownie
    1 hour ago








  • 1




    $begingroup$
    @Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    @Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
    $endgroup$
    – N. S.
    1 hour ago














3












3








3





$begingroup$

Hint 1: $mathcal P (A)$ always has more elements than $A$. In particular $A neq mathcal P(A)$.



Hint 2: If $A times B =B times A$ then you can prove that either $A=B$ or one of $A,B$ is empty.



Indeed, if you assume by contradiction that you have $A neq B$ and that neither $A$ nor $B$ is empty, then you can find an element $x$ which is in exactly one of the sets $A$ or $B$. Now, by using that neither $A$ nor $B$ is empty, you can pick some $y$ in the other set. Look at $(x,y)$.



Hint 3 Conclude that $A=emptyset$ is the only solution.






share|cite|improve this answer











$endgroup$



Hint 1: $mathcal P (A)$ always has more elements than $A$. In particular $A neq mathcal P(A)$.



Hint 2: If $A times B =B times A$ then you can prove that either $A=B$ or one of $A,B$ is empty.



Indeed, if you assume by contradiction that you have $A neq B$ and that neither $A$ nor $B$ is empty, then you can find an element $x$ which is in exactly one of the sets $A$ or $B$. Now, by using that neither $A$ nor $B$ is empty, you can pick some $y$ in the other set. Look at $(x,y)$.



Hint 3 Conclude that $A=emptyset$ is the only solution.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 1 hour ago

























answered 1 hour ago









N. S.N. S.

103k6111208




103k6111208












  • $begingroup$
    This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
    $endgroup$
    – Brownie
    1 hour ago








  • 1




    $begingroup$
    @Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    @Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
    $endgroup$
    – N. S.
    1 hour ago


















  • $begingroup$
    This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
    $endgroup$
    – Brownie
    1 hour ago








  • 1




    $begingroup$
    @Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    @Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
    $endgroup$
    – N. S.
    1 hour ago
















$begingroup$
This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
$endgroup$
– Brownie
1 hour ago






$begingroup$
This helps out a lot, I understand why it works this way because of how a Cartesian products of sets are defined. If you don't mind me asking how would I continue to prove that they are not equal. Is it sufficient to state that because of how we define a Cartesian product , and because P(A) and A are not the same unless A is an empty set the two sides cannot be equal? Also this is my first post ever, and the lightning fast detailed response is really great, and super helpful. Thanks for helping people out
$endgroup$
– Brownie
1 hour ago






1




1




$begingroup$
@Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
$endgroup$
– N. S.
1 hour ago




$begingroup$
@Viz-sa There are many ways to show that $mathcal P(A)$ is bigger. For example $f : A to mathcal{P}(A)$ defined by $f(x)= { x }$ is one to one but not onto, since it doesn't take the "value" ${ emptyset } in P(A)$.... Or you can show that if $A$ has $n$ elements, then $P(A)$ has $2^n$ and that $2^n >n$ for all $n geq 0$.
$endgroup$
– N. S.
1 hour ago




1




1




$begingroup$
@Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
$endgroup$
– N. S.
1 hour ago




$begingroup$
@Viz-sa Or you can use the Cantor theorem, which proves the claim even for infinite sets :)
$endgroup$
– N. S.
1 hour ago











1












$begingroup$

Assuming that "x" is the Cartesian product of two sets, we have the definition




For two sets $A$ and $B$, the cartesian product is given by
$$Atimes B={ (a,b):ain A, bin B}$$




Suppose that $Atimes P(A)$ for some set $A$.
Then, each element of $P(A)$ must be in $A$.
However, by Cantor's theorem, we have that $|A|<|P(A)|$ for any $A$, thus there is at least one element of $P(A)$ that is not in $A$.

Thus it cannot be true that $Atimes P(A)=P(A)times A$ for any set $A$.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    "Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
    $endgroup$
    – N. S.
    1 hour ago








  • 3




    $begingroup$
    Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    Thank you for the correction, will edit.
    $endgroup$
    – 高田航
    1 hour ago
















1












$begingroup$

Assuming that "x" is the Cartesian product of two sets, we have the definition




For two sets $A$ and $B$, the cartesian product is given by
$$Atimes B={ (a,b):ain A, bin B}$$




Suppose that $Atimes P(A)$ for some set $A$.
Then, each element of $P(A)$ must be in $A$.
However, by Cantor's theorem, we have that $|A|<|P(A)|$ for any $A$, thus there is at least one element of $P(A)$ that is not in $A$.

Thus it cannot be true that $Atimes P(A)=P(A)times A$ for any set $A$.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    "Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
    $endgroup$
    – N. S.
    1 hour ago








  • 3




    $begingroup$
    Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    Thank you for the correction, will edit.
    $endgroup$
    – 高田航
    1 hour ago














1












1








1





$begingroup$

Assuming that "x" is the Cartesian product of two sets, we have the definition




For two sets $A$ and $B$, the cartesian product is given by
$$Atimes B={ (a,b):ain A, bin B}$$




Suppose that $Atimes P(A)$ for some set $A$.
Then, each element of $P(A)$ must be in $A$.
However, by Cantor's theorem, we have that $|A|<|P(A)|$ for any $A$, thus there is at least one element of $P(A)$ that is not in $A$.

Thus it cannot be true that $Atimes P(A)=P(A)times A$ for any set $A$.






share|cite|improve this answer









$endgroup$



Assuming that "x" is the Cartesian product of two sets, we have the definition




For two sets $A$ and $B$, the cartesian product is given by
$$Atimes B={ (a,b):ain A, bin B}$$




Suppose that $Atimes P(A)$ for some set $A$.
Then, each element of $P(A)$ must be in $A$.
However, by Cantor's theorem, we have that $|A|<|P(A)|$ for any $A$, thus there is at least one element of $P(A)$ that is not in $A$.

Thus it cannot be true that $Atimes P(A)=P(A)times A$ for any set $A$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 1 hour ago









高田航高田航

1,313418




1,313418








  • 1




    $begingroup$
    "Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
    $endgroup$
    – N. S.
    1 hour ago








  • 3




    $begingroup$
    Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    Thank you for the correction, will edit.
    $endgroup$
    – 高田航
    1 hour ago














  • 1




    $begingroup$
    "Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
    $endgroup$
    – N. S.
    1 hour ago








  • 3




    $begingroup$
    Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
    $endgroup$
    – N. S.
    1 hour ago






  • 1




    $begingroup$
    Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
    $endgroup$
    – N. S.
    1 hour ago










  • $begingroup$
    Thank you for the correction, will edit.
    $endgroup$
    – 高田航
    1 hour ago








1




1




$begingroup$
"Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
$endgroup$
– N. S.
1 hour ago






$begingroup$
"Then, each element of $P(A)$ must be in $A$" is not true.... You need the extra assumption that $A$ is not empty to deduce that.
$endgroup$
– N. S.
1 hour ago






3




3




$begingroup$
Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
$endgroup$
– N. S.
1 hour ago




$begingroup$
Note that $A=emptyset$ satisfies $A times P(A)=P(A) times A$.
$endgroup$
– N. S.
1 hour ago




1




1




$begingroup$
Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
$endgroup$
– N. S.
1 hour ago




$begingroup$
Note that if $B times C subset D times E$, you need the extra assumption that $C neq emptyset$ to conclude that $B subset D$.
$endgroup$
– N. S.
1 hour ago












$begingroup$
Thank you for the correction, will edit.
$endgroup$
– 高田航
1 hour ago




$begingroup$
Thank you for the correction, will edit.
$endgroup$
– 高田航
1 hour ago










Brownie is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















Brownie is a new contributor. Be nice, and check out our Code of Conduct.













Brownie is a new contributor. Be nice, and check out our Code of Conduct.












Brownie is a new contributor. Be nice, and check out our Code of Conduct.
















Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3090408%2ffind-all-finite-sets-a-so-that-a-x-pa-pa-x-a-where-pa-is-the-power-set%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







Popular posts from this blog

404 Error Contact Form 7 ajax form submitting

How to know if a Active Directory user can login interactively

TypeError: fit_transform() missing 1 required positional argument: 'X'