\section{Order twelve: two coupled triangles}\label{sec:twelve} Proposition~\ref{prop:delta} gives $\delta=1$ in every base. Thus $\alpha\in\Lambda$ has form $H\beta$, $\beta\in\A$. For an integer representative $u\in\Z^6$ put \[ y=(u_0,-u_2,u_4),\qquad z=(u_1,-u_3,u_5). \] By \eqref{eq:zero-fold}, the represented element vanishes exactly when both triangles are constant. Independent integer translations normalize $\min y=\min z=0$. \begin{lemma}[Triangular multiplication and oscillation]\label{lem:triangles} Multiplication by $H$ becomes, with indices modulo three, \begin{align} y'_r&=(B^2+1)y_r+B(z_{r-1}-z_r),\label{eq:triangle-y}\\ z'_r&=(B^2+1)z_r+B(y_{r+1}-y_r).\label{eq:triangle-z} \end{align} For $M=\max\{\osc(y),\osc(z)\}$, \begin{equation}\label{eq:triangle-osc} \max\{\osc(y'),\osc(z')\}\ge(B-1)^2M. \end{equation} \end{lemma} \begin{proof} Multiply $\sum u_rX^r$ by $B^2+1-B(X+X^{-1})$, using $X^6=-1$. The first original coordinate is $(B^2+1)u_0-Bu_1+Bu_5=y'_0$. Also $y'_2=(B^2+1)u_4-Bu_3-Bu_5$ and $z'_2=(B^2+1)u_5+Bu_0-Bu_4$. The same index shifts give the remaining coordinates, including the endpoint signs. In the triangle attaining $M$, choose a maximum and a minimum. The diagonal difference is $(B^2+1)M$ and the coupling subtracts at most $2BM$. \end{proof} \begin{lemma}[Four binary regimes and markers]\label{lem:triangle-types} Let $y,z\in\{0,1\}^3$ have minimum zero and not both vanish. For every $B\ge2$, their images in \eqref{eq:triangle-y}--\eqref{eq:triangle-z}, even after independent real translations, lie outside the transformed box at length $6B-1$ for odd $B$, or $6B+1$ for even $B$. Four oscillation regimes suffice. \end{lemma} \begin{proof} Put $A=B^2+1$, $D=B-1$ and use \eqref{eq:marked-box} separately in the two triangles. The exact boxes are \begin{center}\small \begin{tabular}{c c c c c c}\toprule Base&$T$&$E_U^y$&$E_L^y$&$E_U^z$&$E_L^z$\\\midrule odd&$D^2/2$&$\{0,2\}$&$\{1\}$&$\{0\}$&$\{1\}$\\ even&$BD/2$&$\{0\}$&$\varnothing$&$\varnothing$&$\varnothing$\\\bottomrule \end{tabular} \end{center} Both permitted oscillations are at most $B^2-1$. For even $B$ the second triangle has the stronger bound $BD$. If one triangle vanishes and the other is nonconstant, the latter's image has oscillation $A>B^2-1$, with margin 2. Otherwise, modulo their separate constants, \[ y=\varepsilon e_p,\quad z=\eta e_q,\qquad \varepsilon,\eta\in\{1,-1\},\quad p,q\in\Z/3\Z. \] A singleton has positive sign and its complement negative sign. Adding a constant to $y$ adds $A$ times that constant to $y'$ and does not change $z'$; likewise with $y,z$ exchanged. For $d=q-p$ and $\sigma=\varepsilon\eta$, \[ y'=A\varepsilon e_p+B\eta(e_{q+1}-e_q),\qquad z'=A\eta e_q+B\varepsilon(e_{p-1}-e_p). \] Since $A>2B$, both oscillations are \begin{center} \begin{tabular}{c c c}\toprule $d$&$\sigma=1$&$\sigma=-1$\\\midrule 0&$A-B$&$A+2B$\\1&$A+B$&$A+B$\\2&$A+2B$&$A-B$\\\bottomrule \end{tabular} \end{center} This follows by substitution in three basis vectors with arbitrary $p$, not by enumerating 36 pairs; simultaneous sign reversal preserves oscillation. The regimes $A+B,A+2B$ exceed $B^2-1$ by $B+2,2B+2$. In the remaining regime $A-B=BD+1$, maximum and minimum indices are \begin{center}\small \begin{tabular}{c c c c c}\toprule Type&$y$&$z$&$(j_y,i_y)$&$(j_z,i_z)$\\\midrule I$+$&$e_p$&$e_p$&$(p,p-1)$&$(p,p+1)$\\ I$-$&$-e_p$&$-e_p$&$(p-1,p)$&$(p+1,p)$\\ II$+$&$e_p$&$-e_{p-1}$&$(p,p+1)$&$(p+1,p-1)$\\ II$-$&$-e_p$&$e_{p-1}$&$(p+1,p)$&$(p-1,p+1)$\\\bottomrule \end{tabular} \end{center} Omitted constants affect neither differences nor extremal indices. For even $B$, use the second triangle, whose capacity is $2T$: the margin is 1. For odd $B$, in types I$+$, II$+$, II$-$ the minimum indices differ, so at least one is not the sole lower marker 1. Choose that triangle; even with a marked maximum, capacity is $2T+D=BD$, leaving margin 1. In type I$-$ both minima equal $p$. The same argument works if $p\ne1$. If $p=1$, the second triangle has maximum at 2, outside $E_U^z=\{0\}$, so again at most one marker contributes. This exhausts all vectors. As a count check, there are 12 cases with one active triangle. Of the other 36, each regime $A-B,A+B,A+2B$ occurs 12 times, from three choices of $p$, two simultaneous signs and the table rows. \end{proof} \begin{proposition}[Order-twelve boundary]\label{prop:binary3} For $B\ge4$ no failure exists at length $6B-1$ for odd $B$, or $6B+1$ for even $B$. \end{proposition} \begin{proof} The six digit counts are $(B,B,B,B,B,B-1)$ and $(B+1,B,B,B,B,B)$, respectively. In coordinates $(c_0,-c_2,c_4)$ and $(c_1,-c_3,c_5)$, \eqref{eq:box} bounds each oscillation by $B^2-1$. Lemma~\ref{lem:triangles} gives $M\le(B+1)/(B-1)<2$. The normalized integer triangles are therefore binary, neither is $(1,1,1)$, and a failure cannot have both zero. Lemma~\ref{lem:triangle-types} excludes them. \end{proof} The $(2^3-1)^2-1=48$ pairs per parity are a redundant check. Bases 2 and 3 require the inverse estimates in Proposition~\ref{prop:residual-deductive}; a binary lemma alone does not justify omitting the height reduction.