Proof of Uncountable Domain for f:A-->B

  • Thread starter happyg1
  • Start date
  • Tags
    Domain
In summary, if f:A-->B and the range of f is uncountable, then the domain of f must also be uncountable since a countable domain can be mapped to an uncountable range. This can be proven by contradiction or by the contrapositive statement that if the domain is countable, then the range must also be countable. The fact that the function may not be one-to-one or onto does not change this result.
  • #1
happyg1
308
0
hi,
the question I am working on is this:
If f:A-->B and the range of f is uncountable, prove that the domain of f is uncountable.
Intuitively this seems to be true. If the range is uncountable, then function has to map an uncountable number of elements from the domain to the range. I don't know how to make this a rigorous proof. Does the function have to be one to one? Can I say that the inverse exists? I know that this is an easy problem, but I am stuck. Please point me down the right path.
Thanks,
CC
 
Physics news on Phys.org
  • #2
is f: said to be a bijection or 1-1 or onto?...cuz i can't see a inverse trig function satisfying that without more info.

You can't say the inverse exists without knowing 1-1 or onto or both...or can you...its been so long.
 
  • #3
off the top of my head i would try to do it by contradiction. suppose the range of uncountable and the domain is countable. then f must map each element of A to more than one element of the range. contradiction since f is a function. (something like that anyway)

or like this, spose f:A-->B is a function, B is uncountable and A is countable. then make a list of all the elements of the range: f(a_1), f(a_2),... etc then all the elements of the range have been listed since f can't map one thing to more than one thing, so the range is countable. contradiction.
 
  • #4
Let f be a function from A to B, then if the domain of f is countable it follows that f is a surjection from a countable set onto its image, thus what can you say about the image? (this isn't a proof by contradiction but a proof by the contrpositive, ie rather than show A implies B we are proving the equivalent statement not(B) implies not(A))
 
  • #5
Hi guys,
That's all of the info that was given for the problem. My quandry was that I need it to be bijective and I don't know how I can say that it is. I'll try the contrapositive suggestion. I tried contradiction, but I'm not confident with my results. My teacher's hint was "read the book", which I've done...over and over.
Thanks for the input,
CC
 
  • #6
Hi all,
I have been working on this danged problem some more, and I am even more confused...here's why: f(x)=1. Isn't this a function that maps an uncountable domian into a countable range? If this is true then uncountable domain does not necessarily imply uncountable range. Then I am right back where I started...uncountable range, and I need to get at the domain. My head hurts.
CC
 
Last edited:
  • #7
happyg1 said:
Hi all,
I have been working on this danged problem some more, and I am even more confused...here's why: f(x)=1. Isn't this a function that maps an uncountable domian into a countable range? If this is true then uncountable domain does not necessarily imply uncountable range. Then I am right back where I started...uncountable range, and I need to get at the domain. My head hurts.
CC

Yes, that's true but not relevant to the original question which was whether a countable domain could be mapped to an uncountable range. If f is not invertible, as f(x)= 1 is not, those are not the same question.

The definition of function requires that two different y values cannot be given by the same y value. Your reverse example has many different x values giving the same y.

Try this. Suppose the domain is countable. Then we can "list" all members of the domain:x1, x2, ..., xi,...
For any y in the range, label it yi where y= f(xi).
What does that tell you?
 
Last edited by a moderator:
  • #8
does it say if the function is continous.
 
  • #9
Hi,
Thanks for the clarification. I think I have been looking at this particular problem so long that it has stopped making sense to me. I have done the exact thing that Hallsof Ivy suggested. I just kept thinking about 1-1 and onto...but that doesn't matter. I am unproving what I have written by throwing myself some red herrings.

No, it doesn't say that the function is continuous, just that it's a function.

I think I am convinced that this is true. I will write up my proof and go submit it to my professor, who will hopefully agree with this reasoning.

Thanks so much for your time and attention.
CC
 
  • #10
continuity has nothing to do with it, neurocomp.
 

1. What is Proof of Uncountable Domain for f:A-->B?

Proof of Uncountable Domain for f:A-->B is a mathematical concept that proves the existence of an uncountable number of elements in the domain of a function. This means that there are infinite elements in the domain, which cannot be counted or listed.

2. Why is Proof of Uncountable Domain important in science?

Proof of Uncountable Domain is important in science because it allows us to understand and analyze functions and their behaviors in a more precise and accurate manner. It also helps us to make predictions and draw conclusions about real-world phenomena.

3. How is Proof of Uncountable Domain different from Proof of Countable Domain?

The main difference between Proof of Uncountable Domain and Proof of Countable Domain is that the former proves the existence of an uncountable number of elements in the domain, while the latter proves the existence of a countable number of elements. This means that while uncountable domains have infinite elements, countable domains have a finite or enumerable number of elements.

4. Can a function have both a countable and an uncountable domain?

No, a function cannot have both a countable and an uncountable domain. A function can only have one type of domain, either countable or uncountable. This is because a function can only have one input for each output, and having both countable and uncountable inputs would result in multiple outputs for the same input, which goes against the definition of a function.

5. How is Proof of Uncountable Domain applied in scientific research?

Proof of Uncountable Domain is applied in scientific research in various fields such as physics, biology, and computer science. It helps researchers to model and analyze complex systems, make predictions, and understand the behavior of natural phenomena. It is also used in developing algorithms and solving mathematical problems in various scientific disciplines.

Similar threads

Replies
6
Views
1K
  • Precalculus Mathematics Homework Help
Replies
15
Views
604
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
204
  • Precalculus Mathematics Homework Help
Replies
11
Views
487
  • Set Theory, Logic, Probability, Statistics
Replies
14
Views
1K
Replies
2
Views
671
  • Precalculus Mathematics Homework Help
Replies
7
Views
367
  • Differential Geometry
Replies
10
Views
699
  • General Math
Replies
1
Views
962
  • Precalculus Mathematics Homework Help
Replies
13
Views
272
Back
Top