Does Equal Cardinality in Nested Infinite Sets Imply Equality Throughout?

Click For Summary

Homework Help Overview

The discussion revolves around a proof concerning the cardinality of nested sets, specifically addressing the relationship between sets A, B, and C where A is a subset of B, B is a subset of C, and the cardinalities of A and C are equal. The participants are exploring whether this implies that the cardinality of A is also equal to that of B.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the initial assumptions regarding the subsets and the implications of the cardinality condition. Some suggest applying known theorems, such as the Schroder-Bernstein theorem, while others question how to establish the necessary injections between the sets.

Discussion Status

The conversation is ongoing, with participants sharing insights about potential approaches and theorems that could be relevant. There is an acknowledgment of the need to clarify the details of the injections and bijections involved in the proof.

Contextual Notes

Participants express uncertainty about how to begin the proof and the application of specific theorems, indicating a need for further exploration of the foundational concepts involved in set cardinality.

rideabike
Messages
15
Reaction score
0

Homework Statement


Prove that if A,B, and C are nonempty sets such that A \subseteq B \subseteq C and |A|=|C|, then |A|=|B|

The Attempt at a Solution


Assume B \subset C and A \subset B (else A=B or B=C), and there must be a bijection f:A\rightarrowC...
 
Physics news on Phys.org
rideabike said:

Homework Statement


Prove that if A,B, and C are nonempty sets such that A \subseteq B \subseteq C and |A|=|C|, then |A|=|B|

The Attempt at a Solution


Assume B \subset C and A \subset B (else A=B or B=C), and there must be a bijection f:A\rightarrowC...

So far you are just stating what the problem told you. Don't you have some theorems you might apply?
 
rideabike said:

Homework Statement


Prove that if A,B, and C are nonempty sets such that A \subseteq B \subseteq C and |A|=|C|, then |A|=|B|

The Attempt at a Solution


Assume B \subset C and A \subset B (else A=B or B=C), and there must be a bijection f:A\rightarrowC...

Why not start with the given condition, that A \subseteq B \subseteq C and |A|=|C|?
 
Dick said:
So far you are just stating what the problem told you. Don't you have some theorems you might apply?
I know, I don't really know where to start. Schroder-Bernstein maybe?
 
rideabike said:
I know, I don't really know where to start. Schroder-Bernstein maybe?

That's the one! Try and apply it. Here's a hint. If A is subset of B, then there's an injection from A into B, right?
 
Last edited:
Dick said:
That's the one! Try and apply it. Here's a hint. If A is subset of B, then there's an injection from A into B, right?

Right. And we want to show there's an injection from B to A. Would it be that since there's an injection from B to C and and injection from C to A, there must be an injection from B to A?
 
rideabike said:
Right. And we want to show there's an injection from B to A. Would it be that since there's an injection from B to C and and injection from C to A, there must be an injection from B to A?

Sure. That's wasn't so hard, was it? You might want to spell out some of the details, like what the actual injections are in terms of your bijection f:A->C. But that's the idea.
 

Similar threads

Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K