[guided]Fix an invariant Borel probability measure $\mu$ and a finite Borel partition $\mathcal P=\{P_1,\dots,P_m\}$ of $X$. The goal is to compare the measurable orbit names from $\mathcal P$ with the orbit names allowed by one fixed finite open cover. The cover must be fixed before $n$ varies, because topological entropy controls the growth of $N(\mathcal U_0^{n-1})$ for a fixed cover $\mathcal U$.
Choose $\alpha>0$. Since $X$ is compact metric, every Borel probability measure on $X$ is regular. Therefore, for each $1\le i\le m$, choose a compact set $K_i\subset P_i$ such that
\begin{align*}
\mu(P_i\setminus K_i)<\frac{\alpha}{m}.
\end{align*}
Define the compact set $K\subset X$ by $K=K_1\cup\dots\cup K_m$. The compact sets $K_i$ are pairwise disjoint because the $P_i$ are disjoint. Since $X$ is metric and there are only finitely many of them, choose pairwise disjoint open sets $U_i\subset X$ with $K_i\subset U_i$ for $1\le i\le m$. Define the finite open cover
\begin{align*}
\mathcal U:=\{U_1,\dots,U_m,X\setminus K\}.
\end{align*}
This cover is the topological object that will encode the non-exceptional part of the partition names.
Define the finite Borel partition $\mathcal R=\{R_0,R_1,\dots,R_m\}$ by $R_i=K_i$ for $1\le i\le m$ and $R_0=X\setminus K$. If $x\in R_i$ with $i\ge1$, then $x\in P_i$, so the $\mathcal R$-atom determines the $\mathcal P$-atom. The only possible failure of determination is the exceptional set $R_0$, and finite subadditivity gives
\begin{align*}
\mu(R_0)\le\sum_{i=1}^m\mu(P_i\setminus K_i)<\alpha.
\end{align*}
Let $H_2:[0,1]\to[0,\log 2]$ denote the binary entropy function $H_2(t)=-t\log t-(1-t)\log(1-t)$, with $0\log0=0$.
We now prove the conditional-entropy estimate used at one time. Let $\mathcal A$ be a finite partition with at most $M$ atoms, let $\mathcal B$ be a finite partition, and let $E\subset X$ be a Borel set with $\mu(E)\le\alpha$. Assume that $\mathcal A$ is determined by $\mathcal B$ on $X\setminus E$. Define the two-atom partition $I_E=\{E,X\setminus E\}$. The chain rule and monotonicity of conditional entropy give
\begin{align*}
H_\mu(\mathcal A\mid\mathcal B)\le H_\mu(I_E\mid\mathcal B)+H_\mu(\mathcal A\mid\mathcal B\vee I_E).
\end{align*}
[Conditioning reduces entropy](/theorems/1652), so
\begin{align*}
H_\mu(I_E\mid\mathcal B)\le H_\mu(I_E)\le H_2(\alpha).
\end{align*}
On $X\setminus E$, the atom of $\mathcal A$ is already determined by the atom of $\mathcal B$, so no conditional entropy remains there. On $E$, there are at most $M$ possible atoms of $\mathcal A$, so the contribution is at most $\mu(E)\log M\le\alpha\log M$. Hence
\begin{align*}
H_\mu(\mathcal A\mid\mathcal B)\le H_2(\alpha)+\alpha\log M.
\end{align*}
Applying this with $\mathcal A=\mathcal P$, $\mathcal B=\mathcal R$, $E=R_0$, and $M=m$ gives
\begin{align*}
H_\mu(\mathcal P\mid\mathcal R)\le H_2(\alpha)+\alpha\log m.
\end{align*}
For $n\in\mathbb N$, the chain rule for finite partition entropy gives
\begin{align*}
H_\mu(\mathcal P_0^{n-1})\le H_\mu(\mathcal R_0^{n-1})+\sum_{k=0}^{n-1}H_\mu(T^{-k}\mathcal P\mid T^{-k}\mathcal R).
\end{align*}
Since $\mu$ is $T$-invariant, the entropy of the pulled-back conditional partition is unchanged:
\begin{align*}
H_\mu(T^{-k}\mathcal P\mid T^{-k}\mathcal R)=H_\mu(\mathcal P\mid\mathcal R).
\end{align*}
Therefore
\begin{align*}
H_\mu(\mathcal P_0^{n-1})\le H_\mu(\mathcal R_0^{n-1})+n\bigl(H_2(\alpha)+\alpha\log m\bigr).
\end{align*}
It remains to bound $H_\mu(\mathcal R_0^{n-1})$ by the open-cover complexity. Let $\mathcal V_n\subset\mathcal U_0^{n-1}$ be a subcover with $|\mathcal V_n|=N(\mathcal U_0^{n-1})$. Since $\mathcal V_n$ is finite, define a measurable tie-breaking map $C_n:X\to\mathcal V_n$ by fixing an ordering $\mathcal V_n=\{V_1,\dots,V_N\}$ and setting $C_n(x)=V_l$ for the least $l$ such that $x\in V_l$. Each fibre of $C_n$ is Borel because it is obtained from finitely many Borel cover elements by intersections and differences.
For $0\le k\le n-1$, define $E_k=T^{-k}R_0$ and $I_k=\{E_k,X\setminus E_k\}$. Invariance gives $\mu(E_k)=\mu(R_0)<\alpha$, hence
\begin{align*}
H_\mu(I_k)\le H_2(\alpha).
\end{align*}
We claim that the atom of $\mathcal R_0^{n-1}$ containing $x$ is determined by $C_n(x)$ together with the atoms of $I_0,\dots,I_{n-1}$ containing $x$. Write the selected cover element in the form
\begin{align*}
C_n(x)=V_0\cap T^{-1}V_1\cap\cdots\cap T^{-(n-1)}V_{n-1},
\end{align*}
with $V_k\in\mathcal U$. If $x\in E_k$, then $T^k x\in R_0$, so the $k$th $\mathcal R$-symbol is $0$. If $x\notin E_k$, then $T^k x\in K_i$ for a unique $i\ge1$. Because the sets $U_1,\dots,U_m$ are pairwise disjoint and $K_i\subset U_i$, the condition $T^k x\in V_k$ identifies this unique index $i$. Thus the selected cover element plus the exceptional indicators determines every symbol in the $\mathcal R$-name.
Consequently, the entropy of $\mathcal R_0^{n-1}$ is bounded by the entropy of the finite-valued map $C_n$ plus the entropy of the joined indicator partition $I_0\vee\cdots\vee I_{n-1}$. The map $C_n$ has at most $N(\mathcal U_0^{n-1})$ values, so
\begin{align*}
H_\mu(C_n)\le \log N(\mathcal U_0^{n-1}).
\end{align*}
Subadditivity of finite entropy gives
\begin{align*}
H_\mu(I_0\vee\cdots\vee I_{n-1})\le\sum_{k=0}^{n-1}H_\mu(I_k)\le nH_2(\alpha).
\end{align*}
Hence
\begin{align*}
H_\mu(\mathcal R_0^{n-1})\le \log N(\mathcal U_0^{n-1})+nH_2(\alpha).
\end{align*}
Combining this estimate with the previous estimate for $H_\mu(\mathcal P_0^{n-1})$ and dividing by $n$ gives
\begin{align*}
\frac{1}{n}H_\mu(\mathcal P_0^{n-1})\le \frac{1}{n}\log N(\mathcal U_0^{n-1})+2H_2(\alpha)+\alpha\log m.
\end{align*}
Because $\mathcal U$ is fixed, the open-cover definition of topological entropy implies
\begin{align*}
h_\mu(T,\mathcal P)\le h_{\mathrm{top}}(T)+2H_2(\alpha)+\alpha\log m.
\end{align*}
Finally let $\alpha\downarrow0$. Since $H_2(\alpha)\to0$, we obtain
\begin{align*}
h_\mu(T,\mathcal P)\le h_{\mathrm{top}}(T).
\end{align*}
Taking the supremum over all finite Borel partitions gives $h_\mu(T)\le h_{\mathrm{top}}(T)$, and then taking the supremum over $\mu\in\mathcal M_T(X)$ gives the desired upper bound.[/guided]