For a DFA, the definition of the transition function for a string is:
$$ \widehat{\delta}:Q\times\Sigma^\star\to Q $$
The first part (before the arrow) defines all combinations of all strings with all states by using the cartesian product. Each one of those combinations can result in change of the state of the machine. This is the part behind the arrow.
I'm having a hard time understanding first part of the transition function for a string for a NFA. My book says the definition is: $$ \widehat{\delta}:2^Q\times\Sigma^\star\to 2^Q $$ I understand the part behind the arrow, which indicates that because we're talking about an NFA, multiple changes of state can be possible given a string. The set of those possibly, multiple states are a subset of Q and thus member of the power set of Q.