Let $e$ be the Euclidian metric on $\mathbb{R}$. That is, $$e(x,y):=|x-y|.$$ We define another metric $d$ on $[0,1)$ by $$d(x,y):=\inf_{k\in\mathbb{Z}}|x-y+k|.$$ For $N\in\mathbb{N}$ we can define a map $f\colon[0,1)\to[0,1)$ by $$f_{N}(x):=Nx-\lfloor Nx\rfloor.$$ I want to compare orbits of points in $[0,1)$ with respect to $d$. For $x,y\in[0,1)$ we can compare their orbit segments $$\{x,f_{N}(x),f_{N}^{2}(x),\ldots,f_{N}^{n}(x)\}\qquad\text{and}\qquad\{y,f_{N}(y),f_{N}^{2}(y),\ldots,f_{N}^{n}(y)\}$$ of length $n\in\mathbb{N}\cup\{0\}$ with another metric $d_{n}$ on $[0,1)$ defined by $$d_{n}(x,y):=\max_{0\leq i\leq n}d(f_{N}^{i}(x),f_{N}^{i}(y)).$$
Suppose that $0<\delta\leq1$. I want to prove that for all $x\in [0,1)$, $$B_{d_{n}}(x,\delta)=B_{e}(x,\delta/2N^{n})\mod1.$$ Here $B_{\text{metric}}(\text{point},\text{radius})$ denotes an open ball with respect to the metric in the subscript.
I was hoping to prove "$\supset$" with one of my previous posts, but I didn't really succeed. I'm really struggling with the infimum in the definition of $d$. Any help would be greatly appreciated. Thanks in advance!
We can simplify your problem a little bit. First, we can interpret $d$ as the shortest path in $\Bbb R/\Bbb Z$ (I don't think this has a formal definition, but it helps to see what is happening).
Next, note that for any integer $k$, $$d(x+k,y)=d(x,y).$$ Therefore $$d_n(x,y)=\max_{0\leq i\leq n}d(N^ix,N^iy).$$ Fix $x\in[0,1)$. Then, for $y\in B_e(x,\frac\delta{N^n})$ and $i\in\{0,\ldots,n\}$, $$d(N^ix,N^iy)\leq|N^ix-N^iy|<N^i\frac\delta{N^n}\leq\delta,$$ so $y\in B_{d_n}(x,\delta)$. This proves the $\supseteq$ inclusion.