Fix an algebraic number $\beta$ and consider a complex number $\alpha$ which admits multiple representations in base $\beta$. If one representation of $\alpha$ is ultimately periodic, must every other representation of $\alpha$ be ultimately periodic?
Bonus question: Does this depend on the choice of the set of digits?
Edit: John Bentin showed that this is false in general, even with $\beta \in \Bbb{Q}$. Is this true at least for $\beta$ algebraic integer?
Edit 2: This question came up when trying to solve this problem of mine.
All I know so far is that if $\beta$ is a Pisot integer, i.e. if it is a real algebraic integer greater than $1$ with every conjugate lying in the unit circle, then $\alpha \in \Bbb{Q}(\beta)$ if and only if it has an ultimately periodic expansion (which is stronger than my question).
We have $2=\frac23+\frac49+\cdots+(\frac23)^k+\cdots$, which is clearly periodic. Let us write, alternatively, $$2=1+\dfrac23+\dfrac{8}{27}+\dfrac{512}{19683}+\cdots,$$or$$1=\dfrac23+\dfrac{8}{27}+\dfrac{512}{19683}+\cdots=\sum_{k=1}^{\infty}\dfrac{2^k}{3^k}a_k,$$ where $a_1=1,a_2=0,a_3=1,a_4=\cdots=a_{8}=0,a_{9}=1,$ and generally $a_n=1$ if $$1-\sum_{k=1}^{n-1}\dfrac{2^k}{3^k}a_k>\dfrac{2^n}{3^n},$$ with $a_n=0$ otherwise. A proof that $\sum_{k=1}^{\infty}\left(\frac23\right)\!^ka_k=1$ is appended below. We will show that the sequence $(a_1,a_2,...)$ cannot be eventually periodic. To do this, suppose the contrary. Then there are integers $l\geqslant0$ and $m\geqslant1$ such that$$1-\left(\dfrac23+\dfrac{8}{27}+\dfrac{512}{19683}+\cdots+\dfrac{2^l}{3^l}\right) =\dfrac{2^{l+1}}{3^{l+1}}\sum_{k=1}^{m}\dfrac{2^{k-1}}{3^{k-1}}a_{l+k}\sum_{k=0}^\infty\dfrac{2^{mk}}{3^{mk}}$$ $$\qquad\qquad\qquad\quad\qquad\qquad\quad=\dfrac{2^{l+1}p}{3^l(3^m-2^m)},$$ where $p$ is an integer. Now the fraction on the LHS, in its lowest terms, has an odd numerator, while the fraction on the RHS has an even numerator: a contradiction.
Edit: To prove that $\sum_{k=1}^{\infty}\left(\frac23\right)\!^ka_k=1,$ we show by induction that $$0<1-\sum_{k=1}^{n-1}\dfrac{2^k}{3^k}a_k<2\frac{2^n}{3^n}\quad(n=1,2,..).$$This is true for $n=1,$ since $0<1<\frac43.$ Now suppose that it has been established for $n=j,$ namely $$0<1-\sum_{k=1}^{j-1}\dfrac{2^k}{3^k}a_k<2\frac{2^j}{3^j}.$$(Case 1) If $$1-\sum_{k=1}^{j-1}\frac{2^k}{3^k}a_k>\frac{2^j}{3^j},$$then $a_j=1,$ and $$0<1-\sum_{k=1}^j\frac{2^k}{3^k}a_k=1-\sum_{k=1}^{j-1}\dfrac{2^k}{3^k}a_k-\frac{2^j}{3^j}<2\frac{2^j}{3^j}-\frac{2^j}{3^j}=\frac{2^j}{3^j}<2\frac{2^{j+1}}{3^{j+1}}.$$(Case 2) If $$1-\sum_{k=1}^{j-1}\frac{2^k}{3^k}a_k<\frac{2^j}{3^j},$$then $a_j=0,$ and $$0<1-\sum_{k=1}^j\frac{2^k}{3^k}a_k=1-\sum_{k=1}^{j-1}\frac{2^k}{3^k}a_k<\frac{2^j}{3^j}<2\frac{2^{j+1}}{3^{j+1}}.$$This completes the inductive step.