\section{Four residual boundaries without enumeration}\label{sec:finite} The direct oscillation bounds omit bases 2 and 3. Inverse identities recover the lost precision and settle these boundaries without enumerating boxes. \subsection{Inverse identities and optimal constants} \begin{lemma}[Inversion on differences]\label{lem:inverse-differences} Let $B\ge2$ and $A=B^2+1$. In the pentagon, with $h=\mathcal H_Bv$ and $q_{10}=\Phi_{10}(B)$, indices are modulo five and \begin{align} q_{10}(v_r-v_{r+1})&=A(h_r-h_{r+1})+B(h_{r+2}-h_{r+4}),\label{eq:inverse5-adj}\\ q_{10}(v_r-v_{r+2})&=(A-B)(h_r-h_{r+2})+B(h_{r+3}-h_{r+4}).\label{eq:inverse5-diag} \end{align} For the triangles, put $a=y'$, $b=z'$ in \eqref{eq:triangle-y}--\eqref{eq:triangle-z} and $q_{12}=\Phi_{12}(B)$. With indices modulo three, \begin{align} q_{12}(y_r-y_{r+1})&=A(a_r-a_{r+1})+B(2b_r-b_{r-1}-b_{r+1}),\label{eq:inverse3-y}\\ q_{12}(z_r-z_{r+1})&=A(b_r-b_{r+1})+B(a_r+a_{r-1}-2a_{r+1}).\label{eq:inverse3-z} \end{align} These identities are invariant under adding a constant to $h$, or independent constants to $a,b$. \end{lemma} \begin{proof} Substitute the multiplication formulas of Lemmas~\ref{lem:pentagon} and \ref{lem:triangles}. In the first identity the coefficients of $v_r,v_{r+1}$ are $A^2-AB-B^2=q_{10}$ and $-q_{10}$, with the other three zero. The second has $q_{10},-q_{10}$ at positions $r,r+2$. In the triangular identities the other triangle cancels, leaving $A^2-3B^2=q_{12}$. Coefficients in each block sum to zero, proving invariance under constants. \end{proof} \begin{proposition}[Exact inverse oscillation norms]\label{prop:inverse-norms} For real vectors in these coordinates, \begin{align} \osc(v)&\le\frac{B^2+B+1}{\Phi_{10}(B)}\osc(h),\label{eq:sharp-inverse5}\\ \osc(y)&\le\frac{A\osc(a)+2B\osc(b)}{\Phi_{12}(B)},\qquad \osc(z)\le\frac{A\osc(b)+2B\osc(a)}{\Phi_{12}(B)}.\label{eq:mixed-inverse3} \end{align} In particular, for $M=\max\{\osc(y),\osc(z)\}$ and $M'=\max\{\osc(a),\osc(b)\}$, \begin{equation}\label{eq:sharp-inverse3} M\le\frac{(B+1)^2}{\Phi_{12}(B)}M'. \end{equation} The constants in \eqref{eq:sharp-inverse5} and \eqref{eq:sharp-inverse3} are optimal on the respective real spaces modulo constants. \end{proposition} \begin{proof} Pentagon vertices have distance one or two. Equation~\eqref{eq:inverse5-adj} bounds a difference by $(A+B)\osc(h)/q_{10}$; \eqref{eq:inverse5-diag} gives the smaller $A\osc(h)/q_{10}$, since $A-B>0$. Every distinct triangular pair is consecutive in one orientation, and $|2b_r-b_{r-1}-b_{r+1}|\le2\osc(b)$. This gives the mixed inequalities and then \eqref{eq:sharp-inverse3}. For optimality both real multiplication matrices are invertible: their diagonal $A>2B$ exceeds the sum of absolute off-diagonal entries. A maximum absolute coordinate of a kernel vector would give $A|v_r|\le2B|v_r|$, forcing zero. We may therefore prescribe the image. In the pentagon take $h=(1,0,1,0,0)$: at $r=0$ the identity gives $v_0-v_1=(A+B)/q_{10}$ and $\osc(h)=1$. In the triangles take $a=b=(1,0,0)$: then $y_0-y_1=(A+2B)/q_{12}$ and $M'=1$. The upper bounds already proved show equality in both norms. \end{proof} The improved direct constants satisfy \begin{align*} \frac{\Phi_{10}(B)}{B^2+B+1}&=(B-1)^2+\frac{B^2}{B^2+B+1},\\ \frac{\Phi_{12}(B)}{(B+1)^2}&=(B-1)^2+\frac{B^2}{(B+1)^2}. \end{align*} The positive terms matter at the integral boundary. Optimality concerns arbitrary real vectors, not the digit box or only the integer lattice; the boundary arguments still use integer differences and, in one case, markers. \subsection{Four arithmetic exclusions} \begin{proposition}[Residual boundaries]\label{prop:residual-deductive} There are no failures in the boxes \[ (t,B,k)=(10,2,12),\ (10,3,14),\ (12,2,13),\ (12,3,17). \] Only inverse identities and the structural binary lemmas are needed. \end{proposition} \begin{proof} In all four cases $\delta=1$, so a lattice element is $H\beta$, $\beta\in\A$. Choose integer representatives with minimum zero in each block. Their images differ from transformed digit vectors only by block constants. The inverse identities therefore apply, with integer differences on the left. Oscillation less than 2 reduces to binary representatives, excluded by Lemmas~\ref{lem:pentagon-types} and \ref{lem:triangle-types}, unless they represent zero. For order 10, base 3, the transformed box at $k=14$ is \[ [-2,4]\times[-4,2]\times[-2,4]\times[-4,2]\times[-2,2]. \] Its oscillation is at most 8. Since $q_{10}=61$ and $A+B=13$, \eqref{eq:sharp-inverse5} gives $\osc(v)\le104/61<2$. For order 12, base 2, $k=13$, the box is \[ a\in[-1,2]\times[-1,1]^2,\qquad b\in[-1,1]^3. \] Thus $\osc(a)\le3$, $\osc(b)\le2$, and with $A=5$, $q_{12}=13$, \[ \osc(y)\le\frac{5\cdot3+4\cdot2}{13}=\frac{23}{13}<2,\qquad \osc(z)\le\frac{5\cdot2+4\cdot3}{13}=\frac{22}{13}<2. \] For base 3 and $k=17$, both transformed oscillations are at most 8. Now $q_{12}=73$, $A+2B=16$, so $M\le128/73<2$. For order 10, base 2, $k=12$, the transformed box is \begin{equation}\label{eq:binary-pentagon-box} z\in[-1,2]\times[-2,1]\times[-1,1]^3. \end{equation} Relative to $[-1,1]^5$, only the upper bound of coordinate 0 and the lower bound of coordinate 1 are extended by 1. Hence \begin{equation}\label{eq:two-marker-max} \max\sum_i\lambda_i z_i =\sum_i|\lambda_i|+\max(\lambda_0,0)+\max(-\lambda_1,0). \end{equation} An oriented adjacent difference in \eqref{eq:inverse5-adj} has coefficients $5,-5,2,0,-2$ cyclically, or their negatives, with absolute sum 14. The two marker increments total 10 only when $+5$ is at 0 and $-5$ at 1, namely for $v_0-v_1$. Otherwise they total at most $5+2=7$. Since $q_{10}=11$, every other oriented adjacent difference is at most $21/11<2$, while $v_0-v_1\le24/11<3$. For a nonadjacent pair the coefficients are $3,0,-3,2,-2$ or their negatives: absolute sum 10, with marker increments at most $3+3$. Such differences are at most $16/11<2$. All integer differences are therefore at most 1, except possibly $v_0-v_1=2$. Without this exception the binary lemma applies. With it, minimum-zero normalization forces all remaining values to 1: \[ v=(2,0,1,1,1),\qquad \mathcal H_2v=(12,6,7,9,11). \] The image difference between coordinates 0 and 1 is 6, but \eqref{eq:binary-pentagon-box} allows only $2-(-2)=4$. No common translation repairs it. \end{proof} \subsection{Safe counts, witnesses and assembly} \begin{proposition}[Five boundaries and witnesses]\label{prop:small} In each row below, the doubly divisible integer folded vectors at length $K-1$ are exactly the cyclotomic vectors, with the stated counts. The displayed word at length $K$ is a failure. \begin{center}\small \begin{tabular}{r r r r r l}\toprule $t$&$B$&$K$&states at $K-1$&doubly divisible&word at $K$\\\midrule 10&2&13&432&3&\texttt{1011001001101}\\ 10&3&15&12\,005&5&\texttt{120210020022222}\\ 10&4&14&49\,000&7&\texttt{30033022033333}\\ 12&2&14&972&9&\texttt{11010100101011}\\ 12&3&18&84\,035&25&\texttt{102201020020222222}\\\bottomrule \end{tabular} \end{center} \end{proposition} \begin{proof} Propositions~\ref{prop:residual-deductive} and \ref{prop:base4} exclude all failures in the preceding boxes. For order 10 the cyclotomic vectors are $(a,-a,a,-a,a)$ with $-(B-1)\le a\le B-1$, giving 3,5,7. For order 12 they are $(a,b,-a,-b,a,b)$ with independent $a,b\in[-(B-1),B-1]$, giving 9,25. Multiplying the integer interval lengths in \eqref{eq:box} gives the state counts. The words have respective folded vectors \[ (2,-1,2,1,-1),\quad(3,4,0,4,3),\quad(6,1,1,6,0), \] \[ (2,2,-1,1,-1,1),\qquad(3,0,4,4,0,3). \] They lie in the boxes at $K$, and direct folding gives an explicit realization. For the folded polynomial $C$, all necessary arithmetic identities are below; remainders use increasing coefficients in $1,X,X^2,X^3$. \begin{center}\small \begin{tabular}{r r r r r l}\toprule $t$&$B$&$q$&$C(B)/q$&$B^{m-1}C(1/B)/q$&remainder\\\midrule 10&2&11&0&3&$(3,-2,3,0)$\\ 10&3&61&6&6&$(0,7,-3,7)$\\ 10&4&205&2&8&$(6,1,1,6)$\\ 12&2&13&2&7&$(3,1,-2,2)$\\ 12&3&73&12&12&$(3,-3,4,7)$\\\bottomrule \end{tabular} \end{center} Integer substitution and monic division verify the table without search. The quotients are integral and the remainders nonzero. Lemma~\ref{lem:fold} transfers both properties to the words. The zero folded value $C(2)=0$ in the first row does not mean that the polynomial or its displayed remainder vanishes. \end{proof} \begin{proof}[Assembly of Theorem~\ref{thm:exact}] Appendix~\ref{sec:four} proves \eqref{eq:K4}. Propositions~\ref{prop:binary5}, \ref{prop:grid5} and \ref{prop:binary3} exclude the boundaries $K-1$ on their domains. Proposition~\ref{prop:base4} treats base 4 and Proposition~\ref{prop:residual-deductive} covers the four remaining cases. No table of exclusions or box enumeration is needed. Proposition~\ref{prop:families} gives failures at $K$ for all ordinary bases, including 2 and 3. Theorem~\ref{thm:exceptional-fibre} and Proposition~\ref{prop:base4} cover the exceptional branch. The numerical words above are examples rather than substitutes for the proved families. Lemma~\ref{lem:endpoints} extends exclusion at the boundary to every smaller length. These are therefore first failure lengths. \end{proof} \begin{corollary}[Decimal specialization]\label{cor:decimal} $\Phi_{10}(10)=9091$, $\Phi_{12}(10)=9901$, $K_{10}(10)=53$, and $K_{12}(10)=62$. The safe bounds are 52 and 61 digits, with the full modulus and with palindromes allowed. \end{corollary} \begin{proof} Substitute $B=10$ in \eqref{eq:K10}--\eqref{eq:K12}. \end{proof}