f(S)=(minS)α,∀S∈X, where α≥1. It is easy to see that all such functions are solutions. We now prove that only functions of this form satisfy all the conditions.
Since {1}⋅{1}={1}, N⋅N=N, we have
f({1})2=f({1}),f(N})2=f(N})⟹f({1})=f(N})=1.
For all sets S containing 1, by condition (i), 1=f(N})≤f(S)≤f({1})=1, that is,
f(S)=1.
For positive integer n, define g(n)=f({n}); then condition (ii) tells us
g(m)+g(n)≤g(m+n),g(mn)=g(m)g(n).
The former inequality implies that g is a strictly increasing function on N. Choose α such that g(2)=2α; then 2α=g(2)≥g(1)+g(1)=2 tells us that α≥1.
We now prove g(n)=nα: for n=1,2 this is obvious. For any n≥3 and positive integer k, take a positive integer ℓ such that 2ℓ≤nk<2ℓ+1. Since g is completely multiplicative, we have
2ℓα≤g(n)k<2(ℓ+1)α⟹2ℓ/k≤g(n)1/α<2(ℓ+1)/k.
Since 2ℓ/k≤n<2(ℓ+1)/k, we know
2−1/k<n2ℓ/k≤ng(n)1/α<n2(ℓ+1)/k≤21/k.
Since this holds for all positive integers k, g(n)1/α must equal n, that is, f({n})=g(n)=nα.
For any set S not containing 1, let m=minS. Since {m}⊆S, by condition (i) and the above result,
f(S)≤f({m})=mα.(1)
Since 1=m−(m−1)∈S−{m−1}:={s−(m−1)∣s∈S}, we have
f(S)≥f({m−1})+f(S−{m−1})=(m−1)α+1.
Replacing S in the above with Sk:={s1⋯sk∣s1,…,sk∈S}, we obtain
f(S)k=f(Sk)≥(min(Sk)−1)α+1=(mk−1)α+1.
Therefore, when k>α,
f(S)>(mk−1)α/k=mα(1−mk1)α/k≥mα(1−mk1).
Since this holds for all positive integers k>α, we have f(S)≥mα. Combining this with (1) gives
f(S)=mα=(minS)α.