Is There a Bijective Correspondence Between AxB and BxA?

  • Thread starter Thread starter Unassuming
  • Start date Start date
  • Tags Tags
    Bijection
Click For Summary

Homework Help Overview

The discussion revolves around establishing a bijective correspondence between the Cartesian products AxB and BxA, where A and B are sets. Participants are exploring the implications of this relationship, particularly in the context of set theory and the definitions of bijections.

Discussion Character

  • Conceptual clarification, Assumption checking, Mixed

Approaches and Questions Raised

  • Participants discuss the creation of a function g that maps elements from AxB to BxA. There are questions about the validity of this function when considering empty sets and the implications of the axiom of empty set. Some participants express uncertainty about the definitions and properties of the sets involved.

Discussion Status

The conversation is ongoing, with various interpretations being explored. Some participants have provided guidance on the function's validity, while others are questioning the assumptions made regarding empty sets and the use of terminology like "WLOG." There is no explicit consensus on the points raised.

Contextual Notes

There are discussions about the need for a complete answer that addresses cases where either set may be empty. The conversation also touches on the implications of set cardinality and the definitions of bijections in the context of infinite sets.

Unassuming
Messages
165
Reaction score
0

Homework Statement



Show that there is a bijective correspondence of AxB with BxA.


Homework Equations





The Attempt at a Solution



I am lacking the general understanding of this. Can I create a function g such that,

g: (a in A, b in B) --> (b in B, a in A).

If A and B are sets, then are AxB and BxA the same?
 
Physics news on Phys.org
You just did create such a function. If (a,b) is in AxB, then let g((a,b))=(b,a), which is what you said, if not what you meant. (b,a) is in BxA. Now you just have to prove it's a bijection
 
Unassuming said:

Homework Statement



Show that there is a bijective correspondence of AxB with BxA.


Homework Equations





The Attempt at a Solution



I am lacking the general understanding of this. Can I create a function g such that,

g: (a in A, b in B) --> (b in B, a in A).
Yes, you can do that. Now you have to prove that is a "bijection": its both "one-to-one" (an injection) and "onto", (a surjection).

If A and B are sets, then are AxB and BxA the same?
No, absolutely not! But there exist an injection between them so they have the same "cardinality". For example, if A= {x} and B= {y} then A x B= {(a, b)} and B x A= {(b, a)}. Those two sets have the same cardinality (1) but are different sets because they contain different pairs: as an ordered pair, (a, b) is NOT the same as (b, a).
 
Unassuming said:
I am lacking the general understanding of this. Can I create a function g such that,

g: (a in A, b in B) --> (b in B, a in A).

HallsofIvy said:
Yes, you can do that. Now you have to prove that is a "bijection": its both "one-to-one" (an injection) and "onto", (a surjection).

But only if WLOG A is not an empty set, because the Zermelo–Fraenkel set theory (the standard set theory) defines in the "axiom of empty set" that there isn't an a in A.

[tex]\exists X\, \forall y\, \lnot (y \in X)[/tex]

And do not forget to make your answer save to sets with infinite cardinality.
 
Gnollenbaum said:
But only if WLOG A is not an empty set, because the Zermelo–Fraenkel set theory (the standard set theory) defines in the "axiom of empty set" that there isn't an a in A.

[tex]\exists X\, \forall y\, \lnot (y \in X)[/tex]

And do not forget to make your answer save to sets with infinite cardinality.

It's not clear exactly what you're saying. But it doesn't seem to be relevant to anything anyone else said.
 
Sorry, my english is not very good, but i will try to explain it.

You can not prove a bijective correspondence of AxB with BxA for any set A, B by an function that says nothing for empty sets.

The function says:
g: (a in A, b in B) --> (b in B, a in A)

The "axiom of empty set" says:
[tex]\exists X\, \forall y\, \lnot (y \in X)[/tex]
It means that there is an set A with no a in A. We call it emtpy set.

If you look again at the function g you will see that it is not defined for empty sets. Because if WLOG (Without loss of generality) A is the empty set, there is no a in A and so you don't know what (a in A, b in B) --> (b in B, a in A) means, or do you know what (,) -> (,) means?

So if you prove that g: (a in A, b in B) --> (b in B, a in A) is bijective, than you only know that there is a bijective correspondence of AxB with BxA when neither A nor B is an empty set.
Sure it is trivial that there is a bijective correspondence of {} and {}, but if you have to answer an basic question it should be an complete anwser without the "trivial"-option.

If i have to correct such an answer i would mark this point red, so i wanted to show this point before anyone will really mark this answer red.
 
Last edited:
Actually, the function definition [itex]f:A \times B \rightarrow B \times A: (a,\ b) \mapsto (b,\ a)[/itex] is perfectly valid even in the case where at least one of A or B are empty. Why? Because in that case, [itex]A \times B = \emptyset[/itex], so it is http://en.wikipedia.org/wiki/Vacuous_truth" ).
 
Last edited by a moderator:
knollen baum said:
Because if WLOG (Without loss of generality) A is the empty set,
You're use of 'WLOG' here is incorrect; assuming A to be empty is a loss of generality.
 
Hurkyl said:
You're use of 'WLOG' here is incorrect; assuming A to be empty is a loss of generality.

"Your use of 'WLOG'":devil:
 

Similar threads

Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
6
Views
8K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K