This is a problem from CMI Entrance 2014 based on Map from a power set to n-set.
Problem: Map from a power set to n-set
(1) Let A = {1, ... , k} and B = {1, ... , n}. Find the number of maps from A to B .
(2) Define $latex \mathbf{ P_k } $ be the set of subsets of A. Let f be a map from $latex \mathbf{P_k to B }$ such that if $latex \mathbf{ U , V \in P_k }$ then $latex \mathbf{ f(U \cup V) }$= $latex \mathbf{\text{max} { f(U) , f(V) } }$ . Find the number of such functions. (For example if k = 3 and n =4 then answer is 100)
Discussion:
(1) For each member x of set A we have n choices for f(x) in B. Hence the number of functions is $latex mathbf{ n^k }$
(2) Claim (i): $latex \mathbf{ f(\phi) }$ is minimum for any such function f from $latex \mathbf{P_k to B }$ . This is because $latex \mathbf{ f(A_1) = f(\phi \cup A_1 ) = \text{max} { f(A_1), f(\phi) } }$ hence $latex \mathbf{f(A_1)}$ must be larger than $latex \mathbf{ f(\phi) }$ for any member $latex \mathbf{A_1}$ of $latex \mathbf{ P_k }$
Claim (ii) If we fix the values of the singleton sets then the entire function is fixed. That is if we fix the values of f({1}) , f({2}) , ... , f({k}). Since for any member $latex \mathbf{A_1}$ of $latex \mathbf{P_k , {A_1} }$ is union of several singleton sets. Hence it's value is the maximum of the functional values of those singleton sets. For example let $latex \mathbf{ A_1 = (1, 2) }$ then $latex \mathbf{f(A_1) = f({1}\cup{2}) = \text {max} {f({1}) , f({2}) } }$
Claim (iii) f({1}) , ... , f({k}) are individually independent of each other.
Now we fix $latex \mathbf{ f(\phi) = i}$. Since it is the smallest, the singleton sets map to i to n.
Hence if $latex \mathbf{ f(\phi) = 1}$ each of the singleton sets have n choices from 1 to n; hence there are $latex \mathbf{ n^k }$ functions. Similarly $latex \mathbf{ f(\phi) = 2}$ each of the singleton sets have n-1 choices from 2 to n; hence there are $latex \mathbf{ (n-1)^k }$ functions.
Thus the total number of functions = $latex \mathbf{ \sum_{i=1}^n i^k }$
Publishing original scientific research in a peer-reviewed journal is an achievement many scholars work toward for years. Achieving this feat early in one's academic journey requires exceptional intellectual rigor, creativity, and persistence. Aaditya Punatar and Muskan Sadana have reached this remarkable milestone, successfully publishing their collaborative research paper in the prestigious Journal of Emerging Investigators […]
Her project on quantum-accelerated Steiner trees for 15-minute cities earned a place among the finalists at the world's largest pre-college STEM competition. Prishaa Shrimali of Marymount School of New York, was selected as a Grand Finalist at the 2026 Regeneron International Science and Engineering Fair (ISEF) in Phoenix, Arizona. Her project was Optimizing Urban Accessibility: […]
In 2026, the following Cheenta students have been successful for Indian Statistical Institute's M.Stat Entrance. They ranked within the first 50 in the entire country in these entrances. I.S.I. M.Stat Entrance
In 2026, the following Cheenta students have been successful for Indian Statistical Institute's B.Stat Entrance and Chennai Mathematical Institute's B.Sc. Math Entrance. They ranked within the first 200 in the entire country in these entrances. Most of these students attended the problem solving workshops regularly, which happen 5 days every week. CMI B.Sc. Math Entrance […]
[…] Let A = {1, … , k} and B = {1, … , n}. Find the number of maps from A to B . Define be the set of subsets of A. Let f be a map from such that if then = . Find the number of such functions. (For example if k = 3 and n =4 then answer is 100). Solution […]