Is A x B equal to B x A if and only if A equals B?

Click For Summary
SUMMARY

The discussion centers on proving that the Cartesian product of two sets A and B, denoted as A x B, is equal to B x A if and only if A equals B. Participants clarify that the proof should start by assuming A = B to show A x B = B x A, and then use a proof by contradiction to demonstrate the converse. Additionally, it is established that if either set is empty, the Cartesian product will also be empty, which simplifies the proof in such cases.

PREREQUISITES
  • Understanding of Cartesian products in set theory
  • Familiarity with proof techniques, particularly proof by contradiction
  • Basic knowledge of set equality and elements
  • Experience with mathematical notation and logic
NEXT STEPS
  • Study the properties of Cartesian products in set theory
  • Learn about proof by contradiction and its applications in mathematics
  • Explore set equality and methods to prove two sets are equal
  • Investigate the implications of empty sets in Cartesian products
USEFUL FOR

Mathematics students, educators, and anyone interested in set theory and proof techniques, particularly those studying Cartesian products and set equality.

Willy_Will
Messages
15
Reaction score
0
Hi all...

Homework Statement



Let A, B be non-empty sets, proof that A x B = B x A iff A = B


Homework Equations



A x B = Cartesian Product
iff = if and only if
^ = and


The Attempt at a Solution



Let (x,y) є A x B = B x A
iff (x,y) є (A X B) ^ (x,y) є (B x A)
iff (x є A ^ y є B) ^ (x є B ^ y є A)
iff (x є A ^ y є A) ^ (x є B ^ y є B)
iff (x,y) є A ^ (x,y) є B
iff (x,y) є A = B

Its that right?

Also, if one of the sets if empty, will the statement hold?

Thanks guys!
 
Physics news on Phys.org
Your proof is correct in essence, but hugely confusing and ungrammatical. (x,y) for x in A and y in A is not an element of A. It's an element of AxA. First prove if A=B then AxB=BxA. That's pretty easy, right? Now prove if AxB=BxA then A=B. It's actually easiest (and much more clear) to prove this by contradiction. And if one of the sets is empty then the cartesian product is empty. Does that make that case easy?
 
Hi, I do not understand the proof and I see that my proof is inadequate. How would you do this by contradiction? And does AxA need to be in the proof? This is what I did:

assume AxB=BxA
let x be an element of A,B ^ y be an element of A,B
(x,y) is an element of A ^ (x,y) is an element of B
so A=B
 
To prove two sets are equal, you want to prove every element of one is an element of the other. Start with your assumption AxB=BxA. Pick any x in A and any y in B. Then (x,y) is an element of AxB. But since AxB=BxA that mean (x,y) is also an element of BxA. Hence?
 
Thanks for responding and helping me, but I'm not sure if I'm following, here is what I get: I should show

assume AxB=BxA
let x be an element of A ^ y be an element of B
(x,y) is an element of AxB
if yes then (x,y) is an element of BxA
so AxB=BxA
so A=B
 
No, no. You assumed AxB=BxA. You don't conclude it. If (x,y) is an element of BxA then x is an element of B and y is an element of A. But remember x was ANY element of A and y was ANY element of B. So A=B BECAUSE any element of A is an element of B and vice-versa.
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
Replies
7
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
17
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K