\section{Order ten: a pentagon and fractional classes}\label{sec:ten} \subsection{An elementary separation criterion} \begin{lemma}[Translated intervals]\label{lem:separator} Let $[L_i,U_i]$ be coordinate intervals and $h_i$ a fixed representative. If every representative of the same element is $h_i+s$ for a common translation, any pair $i,j$ with \begin{equation}\label{eq:gap} g=(L_i-h_i)-(U_j-h_j)>0 \end{equation} excludes feasibility even for real $s$. \end{lemma} \begin{proof} Feasibility requires $s\ge L_i-h_i$ and $s\le U_j-h_j$. \end{proof} The following arguments select separators structurally. No exclusion table is a premise, and $n$ always denotes a nonnegative integer. \subsection{The ordinary branch: three support types} Let $Y=-\zeta$ be a primitive fifth root and $F(Y)=1+Y+\cdots+Y^4$. Set $z_r=(-1)^rc_r$. The algebraic element vanishes exactly when $z$ is constant, and five-coordinate representatives differ by multiples of $\one=(1,1,1,1,1)$. \begin{lemma}[Pentagonal oscillation]\label{lem:pentagon} Multiplication by $H$ on $Y$-coordinates is \begin{equation}\label{eq:pentagon} (\mathcal H_Bv)_r=(B^2+1)v_r+B(v_{r-1}+v_{r+1}),\qquad r\pmod5. \end{equation} For every $v\in\R^5$, \begin{equation}\label{eq:pentagon-osc} \osc(\mathcal H_Bv)\ge(B-1)^2\osc(v). \end{equation} \end{lemma} \begin{proof} Substitute $\zeta=-Y$ in \eqref{eq:H}. Between a maximum and a minimum coordinate of $v$, the diagonal contributes $(B^2+1)\osc(v)$. The two neighbours subtract at most $2B\osc(v)$. \end{proof} \begin{lemma}[Three supports in marked boxes]\label{lem:pentagon-types} For every $B\ge2$, the transformed box of length $5B-1$ for odd $B$, or $5B+2$ for even $B$, contains no vector $\mathcal H_Bv+s\one$ with real $s$ and nonconstant $v\in\{0,1\}^5$. Three support types suffice in the original coordinates of the box. \end{lemma} \begin{proof} Put $A=B^2+1$, $D=B-1$. The transformed intervals are \begin{equation}\label{eq:marked-box} L_r=-T-D\mathbf1_{E_L}(r),\qquad U_r=T+D\mathbf1_{E_U}(r), \end{equation} with the following data, obtained from \eqref{eq:box}: \begin{center} \begin{tabular}{c c c c}\toprule Base&$T$&$E_U$&$E_L$\\\midrule odd&$D^2/2$&$\{0,2\}$&$\{1,3\}$\\ even&$BD/2$&$\{0\}$&$\{1\}$\\\bottomrule \end{tabular} \end{center} Thus \begin{equation}\label{eq:marked-capacity} U_j-L_i=2T+D(\mathbf1_{E_U}(j)+\mathbf1_{E_L}(i)). \end{equation} A high coordinate $j$ and low coordinate $i$ of $h=\mathcal H_Bv$ give margin $g=h_j-h_i-(U_j-L_i)$ in Lemma~\ref{lem:separator}. Choose the smaller of the support and its complement, denoted $S$. Do not rotate the box. For $v=\mathbf1_S$, with $p$ arbitrary modulo 5, \begin{center}\small \begin{tabular}{c c c c c}\toprule Type&$S$&high indices&low indices&difference\\\midrule P1&$\{p\}$&$\{p\}$&$\{p+2,p+3\}$&$A$\\ P2&$\{p,p+1\}$&$S$&$\{p+3\}$&$A+B$\\ P3&$\{p,p+2\}$&$S$&$\{p+3,p+4\}$&$A-B$\\\bottomrule \end{tabular} \end{center} For P3 the support entries equal $A$, their common neighbour equals $2B$, and the low entries equal $B$. We have $A>2B$. For complements, $\mathcal H_B(\one-v)=(B+1)^2\one-\mathcal H_Bv$ exchanges highs and lows without changing the difference. It does not assert that the box is invariant under complementation. For P1 and odd $B$, capacity is at most $D^2+2D=B^2-1$, giving $g\ge2$. For even $B$, each chosen high--low pair has cyclic distance two, also after complementation. It cannot be $(0,1)$, the only pair activating both markers. Capacity is at most $BD+D=B^2-1$, again giving 2. For P2, global capacity is at most $B^2-1$ for odd $B$ and $BD+2D=B^2+B-2$ for even $B$. The difference $A+B$ gives margins at least $B+2$ and 3, in every position and for complements. For P3 both index sets have size two. For even $B$, choose high $j\ne0$ and low $i\ne1$. Neither marker contributes, and $A-B=BD+1$ gives margin 1. For odd $B$, it suffices to choose $j\notin\{0,2\}$ or $i\notin\{1,3\}$; capacity is then at most $D^2+D=BD$. If no high index lies outside $\{0,2\}$, the high set equals $\{0,2\}$. It cannot arise from a complement, whose two high indices are adjacent. Hence $S=\{0,2\}$, the low set is $\{3,4\}$, and $i=4$ works. All margins are positive. The classification is exhaustive: a smaller support has one or two elements, and a pair is adjacent or nonadjacent. Each type has five positions and their complements; this count is not used in proving the inequalities. \end{proof} \begin{proposition}[Ordinary order-ten boundary]\label{prop:binary5} Suppose $B\not\equiv4\pmod5$. No failure exists at length $5B-1$ for odd $B\ge5$, or at length $5B+2$ for even $B\ge6$. \end{proposition} \begin{proof} Proposition~\ref{prop:delta} gives $\delta=1$, so $\alpha\in\Lambda$ has form $H\beta$ with $\beta\in\A$. Choose an integer representative $v$ of $\beta$ with $\min v=0$. A failure means that $v$ is nonconstant. The class digit counts are $(B,B,B,B,B-1)$ at the odd boundary and $(B+1,B+1,B,B,B)$ at the even boundary. Equation~\eqref{eq:box} and the alternating signs give \[ \osc(z)\le \begin{cases}(B+1)(B-1),&B\text{ odd},\\(B+2)(B-1),&B\text{ even}.\end{cases} \] Lemma~\ref{lem:pentagon} bounds $\osc(v)$ by $(B+1)/(B-1)<2$ or $(B+2)/(B-1)<2$ on the stated domains. Integrality forces a nonconstant binary vector, excluded by Lemma~\ref{lem:pentagon-types}. The box argument also holds at exceptional bases, but the reduction to integral classes needs $\delta=1$. \end{proof} Bases 2 and 3 are handled in Proposition~\ref{prop:residual-deductive}. \subsection{The exceptional branch}\label{subsec:fifths} \begin{lemma}[The fractional classes]\label{lem:fifths} If $B\equiv-1\pmod5$, put \[ V(Y)=\sum_{r=0}^4rY^r,\qquad \beta_*=\frac{V(Y)}5=\frac1{Y-1}. \] Then \begin{equation}\label{eq:fifth-lattice} H^{-1}\Lambda=\A+\Z\beta_*. \end{equation} \end{lemma} \begin{proof} The identity $(Y-1)V=4(Y^5-1)+5-F$ becomes $(Y-1)V=5$ modulo $F$. The coordinates $(0,1/5,2/5,3/5,4/5)$ cannot become integral by a common translation, so $\beta_*$ has order 5 modulo $\A$. With $S=(B+1)^2/5\in\Z$, \[ \mathcal H_B(0,1/5,2/5,3/5,4/5)=(B,S,2S,3S,4S-B). \] The corresponding $X$-polynomial has coefficients $c_*=(B,-S,2S,-3S,4S-B)$ and satisfies \begin{equation}\label{eq:star-quotients} \frac{C_*(B)}{\Phi_{10}(B)}=\frac{4B(B+1)}5,\qquad \frac{B^4C_*(B^{-1})}{\Phi_{10}(B)}=\frac{4(B+1)}5. \end{equation} These quotients are integral, so $H\beta_*\in\Lambda$. The subgroup $\A+\Z\beta_*$ has index 5 over $\A$, equal to $[H^{-1}\Lambda:\A]$ by Proposition~\ref{prop:ideals}. The established inclusion is therefore equality. \end{proof} \begin{lemma}[A single endpoint identity]\label{lem:ramp-endpoints} For $j\in\{1,2,3,4\}$ and $a\in\Z/5\Z$, put \begin{equation}\label{eq:patterns5} w_r=((r-a)j\bmod5),\qquad v_r=w_r/5, \end{equation} using residues in $\{0,1,2,3,4\}$. Let $b$ be the unique index with $w_b=4$. For $h=\mathcal H_Bv$, \begin{equation}\label{eq:ramp-endpoints} h_a=B,\quad h_b=\frac{4(B^2+1)+3B}5,\quad h_b-h_a=\frac{4B^2-2B+4}5. \end{equation} \end{lemma} \begin{proof} The neighbours of $a$ have residues $j,5-j$, summing to 5. Those of $b$ have residues $4-j,j-1$, summing to 3. Substitute in \eqref{eq:pentagon}. The exact values suffice; $a,b$ need not be extrema of $h$. \end{proof} \begin{proposition}[Exceptional boundary without a table]\label{prop:grid5} For $B=5n+9$, $n\ge0$, no failure exists at length $4B-5$. \end{proposition} \begin{proof} Put $D=B-1$, $T=(2n+3)D$. Class 0 has $4n+7$ digits and the others $4n+6$. After the sign change the box is \begin{equation}\label{eq:exceptional-safe-box} L_r=-T,\qquad U_r=T+D\mathbf1_{\{0\}}(r). \end{equation} Write $\alpha=H\beta$ using \eqref{eq:fifth-lattice} and choose a rational representative $v$. Lemma~\ref{lem:pentagon} gives \[ \osc(v)\le\frac{2T+D}{D^2}=\frac{4B-1}{5(B-1)}<1. \] In the integral class, normalization to minimum zero therefore gives zero. In each other class the fractional parts, up to a common constant, are $jr/5$ modulo 1 for $j=1,2,3,4$, and are distinct. Subtracting the minimum at index $a$ forces precisely \eqref{eq:patterns5}: adding a positive or negative integer to any normalized coordinate violates the range. This proves completeness, not merely feasibility of twenty examples. The entries $h_r$ are integral, since $w_{r-1}+w_{r+1}\equiv2w_r\pmod5$ and $B\equiv-1\pmod5$. Every representative is $h+s\one$. The endpoint identity gives \begin{equation}\label{eq:exceptional-structural-gap} \begin{split} h_b-h_a-(U_b-L_a) &=8n+14-(5n+8)\mathbf1_{\{0\}}(b)\\ &=\begin{cases}8n+14,&b\ne0,\\3n+6,&b=0.\end{cases} \end{split} \end{equation} Both are positive, so Lemma~\ref{lem:separator} excludes every step and position without rotating the box. \end{proof} For each $j$ exactly one position has $b=0$, explaining the multiplicities 16 and 4 of the two margins; these counts are not proof premises. \subsection{The entire first exceptional fibre}\label{subsec:exceptional-fibre} \begin{theorem}[One nonzero class at the threshold]\label{thm:exceptional-fibre} Let $B=5n+9$, $n\ge0$, and $K=4B-4$. The folded failure vectors at length $K$ are precisely \begin{equation}\label{eq:exceptional-all-folds} c=c^{(0)}+\ell(1,-1,1,-1,1),\qquad \ell\in\Z,\quad0\le\ell\le2n+2, \end{equation} where \[ c^{(0)}=(10n^2+34n+30,\ 10n^2+36n+32,\ -5n^2-21n-21,\ n+1,\ 5n^2+19n+19). \] Thus there are $2n+3=(2B-3)/5$ folded vectors, all representing the same nonzero class modulo $\Phi_{10}$. This does not count digit words. \end{theorem} \begin{proof} At length $K$, only the lower marker at coordinate 1 is added: \begin{equation}\label{eq:exceptional-sharp-box} L_r=-T-D\mathbf1_{\{1\}}(r),\qquad U_r=T+D\mathbf1_{\{0\}}(r). \end{equation} The representative of $\beta$ has oscillation at most \[ \frac{2T+2D}{D^2}=\frac{4n+8}{5n+8}\le1. \] For $n\ge1$, no nonzero integral class remains. For $n=0$ ($B=9$), it would have a nonconstant binary representative; the box at $K=32$ lies in the box at $5B-1=44$, so Lemma~\ref{lem:pentagon-types} excludes it without needing $\delta=1$. Distinct fractional parts cannot differ by exactly 1. Thus \eqref{eq:patterns5} remains exhaustive even at $B=9$. The endpoint margin is $8n+14-D(\mathbf1_{\{0\}}(b)+\mathbf1_{\{1\}}(a))$. With zero or one marker it is positive, forcing $a=1$, $b=0$. Then $(b-a)j\equiv4\pmod5$ forces $j=1$. The unique normalized representative is $v=(4,0,1,2,3)/5$. With $S=(B+1)^2/5=5(n+2)^2$, \[ h=\mathcal H_Bv=(4S-B,\ B,\ S,\ 2S,\ 3S). \] Since $S-B-D=5n^2+10n+3>0$, coordinate 1 imposes the greatest lower bound for $s$, and coordinate 0 the least upper bound: for $r\ne1$, $h_r\ge B+D$, and for $r\ne0$, $h_r\le h_0-D$. Hence feasibility is exactly \begin{equation}\label{eq:exceptional-shifts} s_-=-T-D-B\le s\le s_+=T+D-4S+B,\qquad s_+-s_-=2n+2. \end{equation} Both endpoints and $s$ are integral. Set $s=s_-+\ell$ and return to $c_r=(-1)^r(h_r+s)$ to obtain \eqref{eq:exceptional-all-folds}. The element $H\beta$ is nonzero since $H$ is invertible and $v$ nonconstant, and it lies in $\Lambda$ by Lemma~\ref{lem:fifths}. Lemma~\ref{lem:fold} realizes every vector with digits. Proposition~\ref{prop:grid5} and padding establish minimality. The difference between two folded polynomials is $(\ell-\ell')\Phi_{10}(X)$, so all have the same nonzero remainder: \begin{equation}\label{eq:exceptional-remainder} \begin{split} &(5n^2+15n+11)+(15n^2+55n+51)X\\ &\hspace{9mm}-(10n^2+40n+40)X^2+(5n^2+20n+20)X^3. \end{split} \end{equation} \end{proof} The cyclotomic vectors are $z=s\one$ with $-T\le s\le T$, giving $2T+1$ vectors at both $K-1$ and $K$. At $K$ precisely the $2n+3$ failures above are added. This does not count words realizing a vector. \subsection{Base four without box enumeration}\label{subsec:base4} \begin{proposition}[Base four and folded uniqueness]\label{prop:base4} We have $K_{10}(4)=14$. The unique noncyclotomic, doubly divisible folded vector at length 14 is $(6,1,1,6,0)$. The 49\,000-state enumeration at length 13 is only a check. \end{proposition} \begin{proof} Here $D=3$, and the transformed boxes are \[ \begin{array}{c|c|c} k&L&U\\\hline 13&(-3,-6,-3,-3,-3)&(6,3,6,3,3)\\ 14&(-3,-6,-3,-6,-3)&(6,3,6,3,3). \end{array} \] Both have global oscillation at most 12, so $\osc(\mathcal H_4v)\ge9\osc(v)$ gives $\osc(v)\le4/3$. The normalized integral class is binary and is excluded by Lemma~\ref{lem:pentagon-types}, since both boxes lie in the box at 22. For a fractional class normalize the minimum to zero at $a$ and put $w=5v$. Its five residues occur once each as in \eqref{eq:patterns5}, with $0\le w_r\le6$. There are only two types: the ramp with values $0,1,2,3,4$, or the ramp with its value 1 replaced by 6. This reduction does not enumerate $7^5$ tuples. For the second type let $d$ be the position of 6. If $j=1$ or 4, its neighbours are 0 and 2, while the neighbours of $a$ sum to 10. Thus $h_d=22$, $h_a=8$, giving difference $14>12$. If $j=2$ or 3, the respective neighbour sums are 7 and 5, giving $h_d=26$, $h_a=4$, and difference $22>12$. This type is excluded. For the ramp, Lemma~\ref{lem:ramp-endpoints} gives $h_a=4$, $h_b=16$. A difference of 12 requires $L_a=-6$, $U_b=6$, forcing $s=-10$. At length 13 this leaves $a=1$, $b\in\{0,2\}$; at 14, $a=3$ is added. Three of the four possible pairs fail directly: \begin{center}\small \begin{tabular}{c c c}\toprule $(a,b)$&$j$&coordinate of $h-10\one$ outside the box\\\midrule $(1,0)$&1&$z_4=5>3$\\ $(1,2)$&4&$z_3=5>3$\\ $(3,2)$&1&$z_1=5>3$\\\bottomrule \end{tabular} \end{center} The remaining pair $(3,0)$ forces $j=2$ and gives \[ w=(4,1,3,0,2),\quad h=(16,9,11,4,10),\quad z=(6,-1,1,-6,0). \] It lies in the box at 14 but not at 13. The folded vector is $c=(6,1,1,6,0)$. For $C(X)=6+X+X^2+6X^3$, \[ C(4)=410=2\cdot205,\qquad4^4C(1/4)=1640=8\cdot205,\qquad 205=\Phi_{10}(4). \] The remainder is nonzero since $0\ne C$ has degree less than 4. Digit realization gives length 14 and padding excludes all smaller lengths. The same classification proves uniqueness. \end{proof} The exceptional family for $B\ge9$ cannot be blindly extended: at the hypothetical boundary $4B-5=11$ the oscillation bound is 1, not strictly less than 1; at lengths 13 and 14 it is $4/3$, requiring the second ramp type to be excluded separately. The accepted ramp has step 2, not step 1. No argument assuming $n\ge0$ is used at $n=-1$.