(Above, $ℙ≔\{\text{all primes}_ℤ\}$.)
Are there any analytic functions that will give a unique prime output for every distinct prime input? Analyticity should preclude cheap reiterating upon a prime-counting "function", but permiss non-elementary mathematical operation. I’m curious what the a priori maximal and (non-trivial )minimal domain and especially codomain are of various $f()$ (i.e. without $$ predefined as a non-composite integer), and if there any $f$ with the full desired codomain that are not monotonic over its fully defined (ostensibly equivalent) domain —despite being injective, but presumably not wholly surjective.
If such mappings do exist, then those with the greatest simplicity and lowest computational complexity ought to be sought. Also minimizing the magnitude of the growth rate would be preferred (e.g. minimal $\mathrm{deg}(f(p))$ for algebraic polynomial $f$), while retaining self-definedness.