Interpret each of the base $p$ Lyndon Words $W$ of length $n$ as a base $p$ number and let it represent the $p-$adic number which it naturally represents:
$\displaystyle{\sum_{k=0}^\infty}p^{kn}W$
So e.g. $1_2$ represents the number $-1$ and $01_2$ represents $-\frac13$
The function $x\mapsto(x-2^{\nu_2(x)})$ acts on 2-adic numbers by orbiting the cycles of each Lyndon word if we give ourselves a little leeway in ignoring some trailing zeroes.
Letting $m$ count the number of $1$'s in any base $2$ Lyndon word, then $f(x)=\dfrac{x-2^{\nu_2(x)}}{2^{n/m}}$ deals with any trailing zeroes such that $f$ is now periodic with $f^m(x)=x$ provided the 2-adic valuations are reliable.
By $\nu_2(x)$ being "algebraically reliable" I mean for all possible valuations $\nu$ then $f(\nu x)=\nu f(x)$. Note that $f$ is a special case of $ax+b$.
Question
Are these 2-adic valuations for $2^{-n/m}$ algebraically reliable?
I've seen extensions I think for $2^{-1/2^n}$ and for roots of unity but I don't know how far this principle extends and whether it extends to $p^{-n/m}$.
EDIT
I have this much which I need to parse:
an element $α$ whose minimal polynomial over $\Bbb Q_2$ has degree $d$ is given the value $|N_{\mathbb{Q}_2(\alpha)|\mathbb{Q}_2}(\alpha)|^{1/d}$. This is treated extensively in any book on p-adics, local fields etc.
From this, I think if $x=2^{m/n}$ then its minimal polynomial is the unique irreducible monic polynomial of smallest degree $p(x)$ with rational coefficients such that $p(x)=0$ and whose leading coefficient is $1$.
So if I simplify initially to find for $m=1$ then by Eisenstein's irreducibility criterion I think I want $\alpha$ to be the solution to a polynomial $x^n-p$, i.e. $x^n-2$.
But then I can't parse $|N_{\mathbb{Q}_2(\alpha)|\mathbb{Q}_2}(\alpha)|^{1/d}$