By $\emptyset^{\large\emptyset}$ i mean the set of functions from $\emptyset$ to $\emptyset$.
Is it the empty set or the set containing the empty set?
I just dont know how to prove it.
By $\emptyset^{\large\emptyset}$ i mean the set of functions from $\emptyset$ to $\emptyset$.
Is it the empty set or the set containing the empty set?
I just dont know how to prove it.
The set $\emptyset^\emptyset$ contains one and only one element, which is $\emptyset$. For more details, see this question and its answers.
Lets approach this problem from a category theory perspective. Since $\textsf{Set}$ is a category, note that it has the following property:
For every object (set) $A$ of $\textsf{Set}$, there exists (at least) one morphism (function) $1_A \in \text{Hom}_\textsf{Set} (A,A)$, the 'identity' on $A$.
Noting that $\emptyset \in \text{Obj($\textsf{Set}$)}$, then the set $\emptyset^\emptyset = \text{Hom}_\textsf{Set} (\emptyset,\emptyset) \neq \emptyset$, that is, it contains at least one function. And yes, that element in $\emptyset^\emptyset$ is $\emptyset$.
Also, never forget the crucial thing you're taught when learning set theory! For every set $A$, $\emptyset \subseteq A$.