Proving Nonempty Fibers of a Map Partition the Domain

SNOOTCHIEBOOCHEE
Messages
141
Reaction score
0

Homework Statement



Prove that the nonempty fibers of a map form a partition of the domain.

The Attempt at a Solution



Ok so we have some map phi: S -->T

And we want to show that its pre-image phi-1(t) = {s in S | phi(s)=t} forms a partition of the domain.

Im really confused here. I assume that it is talking about that domian of phi which is S (i think) but i have no clue how this preimage forms partitions.
 
Last edited:
Physics news on Phys.org
any thoughts?
 
Doesn't phi^(-1)(t) for t in T constitute a set of non-overlapping sets that cover S? Look up partition.
 
Well a partition P of S is a subdivision of S into nonoverlapping subsets

How do you know phi^(-1)(t) for t in T constitute a set of non-overlapping sets that cover S
 
Prove it. Can any two fibers that correspond to different elements of T intersect nontrivially? Is there anything in S that doesn't lie in a fiber?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top