A nonempty set T1 is finite if and only if there is a bijection from T1->T2?

In summary, a nonempty set T1 is finite if and only if there is a bijection from T1 onto a finite set T2, where "finite" means having a specific number of elements or being empty. Two solutions to this problem can be found online, but it may be difficult for some to understand.
  • #1
phillyolly
157
0

Homework Statement



Prove that a nonempty set T1 is finite if and only if there is a bijection from T1 onto a finite set T2.


The Attempt at a Solution



There are at least two different solutions to this problem that I found online:

http://answers.yahoo.com/question/index?qid=20090319202703AACrlT8

http://www.cramster.com//answers-sep-10/advanced-math/bijection-finite-set-prove-nonempty-set-t1-finite_921466.aspx

Is there any other solution? For a dummy like me these solutions are hard enough to understand them completely. If you can help me get the idea, I will really appreciate it.
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
Hi Phillyolly! :smile:

What is your definition of finite?
 
  • #3
Hi Micromass! :-)

Definition of finite:

A set S is said to be finite if it has n elements for some n in N or is empty.
 
  • #4
Well...

<-

Assume there exists a bijection from T1 to T2. Since there exists a bijection from T1 to T2, this means that |T1| = |T2|. Since T2 is finite...

->

T1 is finite. Define T2 to be T1, so...
 
  • #5
Well, first you'll need to know what it means that "a set has n elements"...
 

Related to A nonempty set T1 is finite if and only if there is a bijection from T1->T2?

1. What is a bijection?

A bijection is a function that maps each element from one set to a unique element in another set. In other words, there is a one-to-one correspondence between the elements of the two sets.

2. How do you determine if a function is a bijection?

A function is a bijection if it is both injective (one-to-one) and surjective (onto). This means that each element in the domain is mapped to a unique element in the codomain, and every element in the codomain has at least one preimage in the domain.

3. What does it mean for a set to be finite?

A set is finite if it has a finite number of elements. This means that the elements in the set can be counted and the count will eventually come to an end.

4. How do you prove that a set is finite using a bijection?

If there exists a bijection between two sets T1 and T2, it means that the sets have the same number of elements. Therefore, if T1 can be mapped bijectively to a finite set, then T1 itself must also be finite.

5. Can a nonempty set be finite if there is no bijection to another set?

No, a nonempty set cannot be finite if there is no bijection to another set. This is because a finite set must have a finite number of elements, and if there is no bijection to another set, it means that the set is infinite.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
15
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
3K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
Replies
4
Views
2K
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
4K
Back
Top