\documentclass[11pt,a4paper,reqno]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage{amsmath,amssymb,amsthm,mathtools,mathrsfs} \usepackage{geometry} \geometry{left=2.5cm,right=2.5cm} \usepackage{setspace} \setstretch{1.13} \usepackage[dvipsnames]{xcolor} \usepackage[colorlinks=true,linkcolor=MidnightBlue,citecolor=BrickRed,urlcolor=MidnightBlue]{hyperref} \hypersetup{pdftitle={Almost all k-Markov numbers are unique}, pdfauthor={Qiyue Tang},pdfsubject={Fixed-parameter density-one uniqueness}, pdfkeywords={generalized Markov equation, uniqueness, Farey tree}} \usepackage{enumitem} \setlist[enumerate]{label=\textup{(\roman*)},leftmargin=*} \makeatletter \def\@evenhead{{\fontsize{6.5pt}{7.5pt}\selectfont\hfil\leftmark\hfil\thepage}} \def\@oddhead{{\fontsize{6.5pt}{7.5pt}\selectfont\hfil\rightmark\hfil\thepage}} \makeatother \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\R}{\mathbb R} \newcommand{\Q}{\mathbb Q} \newcommand{\Z}{\mathbb Z} \newcommand{\Zp}{\mathbb Z_p} \newcommand{\prim}{\mathbb Z^2_{\mathrm{prim}}} \newcommand{\GL}{\mathrm{GL}_2} \newcommand{\Gam}{\mathrm{SL}_2(\mathbb Z)} \newcommand{\acosh}{\operatorname{arcosh}} \newcommand{\area}{\operatorname{area}} \newcommand{\spanR}{\operatorname{span}_{\mathbb R}} \newcommand{\cont}{\operatorname{cont}} \newcommand{\ball}{\mathcal B} \newcommand{\calC}{\mathcal C} \newcommand{\calF}{\mathcal F} \newcommand{\eps}{\varepsilon} \newcommand{\rot}{\mathcal R} \title[Almost all k-Markov numbers are unique]{Almost all \texorpdfstring{$k$}{k}-Markov numbers are unique} \author{Qiyue Tang} \address{Zhili College, Tsinghua University, Beijing 100084, China} \email{tangqy24@mails.tsinghua.edu.cn} \date{November 8, 2026} \subjclass[2020]{11D25, 11H06, 37P20} \keywords{Generalized Markov equation, uniqueness, Farey tree, convex norm, lattice orbit, $p$-adic interpolation} \begin{document} \raggedbottom \begin{abstract} For every fixed nonnegative integer $k$, we prove that almost every positive integral solution of $x^2+y^2+z^2+k(xy+xz+yz)=3(k+1)xyz$ is uniquely determined, up to permutation, by its largest coordinate. \end{abstract} \maketitle \setcounter{tocdepth}{1} \tableofcontents \section{Introduction} The classical Markov equation \[ x^2+y^2+z^2=3xyz \] arose in Markoff's study of indefinite binary quadratic forms \cite{Markoff1879,Markoff1880}. His work connects its positive integral solutions with the discrete part of the Markov spectrum and with extremal phenomena in Diophantine approximation. The solutions are generated from $(1,1,1)$ by permutations and the Vieta involution $(x,y,z)\mapsto(x,y,3xy-z)$. This recursive description gives a tree of triples. Frobenius \cite{Frobenius} conjectured in 1913 that each triple, after its coordinates have been put in increasing order, is determined by its largest coordinate. Two lines of work on this problem concern arithmetic restrictions on the largest coordinate and the geometry of the solution tree. Baragar \cite{Baragar}, Schmutz \cite{Schmutz}, and Button \cite{Button} obtained uniqueness results in special arithmetic cases. Lang and Tan \cite{LT} gave a short proof of uniqueness when the largest coordinate is a prime power, combining congruences with the geometry of the modular torus. A useful arithmetic invariant of a classical triple $(a,b,m)$ is a root of $u^2+1\equiv0\pmod m$, selected by the relation $au\equiv\pm b\pmod m$. The uniqueness of an appropriate representative of this root underlies several of these results. The geometric interpretation goes back to Cohn \cite{Cohn1955,Cohn1971}. A classical Markov number $m$ occurs as one third of the trace of a simple closed geodesic on the modular torus; the corresponding length is $2\acosh(3m/2)$. The uniqueness problem is thereby related to the multiplicity of simple lengths, with the symmetries of the torus taken into account. McShane and Rivin \cite{MR} extended the simple length function to a norm on the first homology of a punctured torus and counted simple geodesics by primitive lattice points in its unit ball. In the arithmetic formulation, Zagier \cite{Zagier} had obtained an asymptotic of order $(\log H)^2$ for the number of sorted Markov triples with largest coordinate at most $H$. Risager \cite{Risager} recently improved the error in this classical triple count to $o(\log H)$. These asymptotics count each triple. To obtain the same leading term for distinct largest coordinates, one must also control repeated values in the tree. Gyoda and Matsushita \cite{GMats} introduced the family \[ x^2+y^2+z^2+k_1yz+k_2zx+k_3xy =(3+k_1+k_2+k_3)xyz, \qquad k_1,k_2,k_3\in\Z_{\ge0}, \] in the setting of generalized cluster algebras. They proved that all positive integral solutions are generated from $(1,1,1)$ by the three Vieta involutions. Their work also shows that unequal parameters can give distinct triples with the same largest coordinate. The equal-parameter family retains the permutation symmetry of the classical equation and is the subject of the present paper: \begin{equation}\label{eq:markov} x^2+y^2+z^2+k(xy+xz+yz)=3(k+1)xyz, \qquad k\in\Z_{\ge0}. \end{equation} A positive integer appearing in one of its positive integral solutions is called a $k$-Markov number. Gyoda and Maruyama \cite[Conjecture 1.8]{GM} formulated the largest-coordinate uniqueness conjecture for this family. Their generalized Cohn matrices lead to a criterion involving the roots of $u^2+ku+1\equiv0\pmod m$, and to uniqueness results for prime and certain prime-power largest coordinates. The same uniqueness problem appears in Chen and Huang \cite[Conjecture 7.3]{CH}, in their study of mutation-preserving generalized cluster algebras and Laurent mutation invariants. Combinatorial studies include Banaian's work on orderings of $k$-Markov numbers \cite{B}, the study by Banaian and Huang of monotonicity along lines for the extended labels \cite{BH}, and parameter comparisons in \cite{Tang}. These studies compare values at specified labels or parameters. The counting question considered here asks how often any two distinct triples share their largest coordinate for one fixed parameter. For the classical equation, Chen \cite{Chen} proved that almost all represented largest coordinates are unique. His proof uses the geometry of the homology norm to reduce equal lengths to rational linear relations, then combines polynomial dynamics, $p$-adic interpolation, and lattice orbit counting. Doan \cite{Doan} developed this approach for simple lengths on punctured tori and tori with geodesic boundary, and transferred the result to four-cusped spheres. The latter transfer corresponds to the parameter $k=2$ in \eqref{eq:markov}. There is also a direct arithmetic explanation of this special parameter. Gyoda and Matsushita \cite[Theorem 11]{GMats} proved that the $2$-Markov triples are exactly the coordinatewise squares of classical Markov triples. Indeed, squaring $a^2+b^2+c^2=3abc$ gives \eqref{eq:markov} for $(x,y,z)=(a^2,b^2,c^2)$ and $k=2$, and \[ (3ab-c)^2=9a^2b^2-2a^2-2b^2-c^2 \] identifies the two mutation rules. Generation from $(1,1,1)$ gives the converse. Hence the classical density theorem also gives the result for $k=2$. The new parameter range in the following theorem is $k=1$ and $k\ge3$; the statement and proof treat every fixed nonnegative integer $k$ together. For a positive integer $m$ and a real number $H\ge1$, put \[ r_k(m)=\#\{(x,y)\in\Z^2:1\le x\le y\le m,\ (x,y,m) \text{ satisfies }\eqref{eq:markov}\}, \] and define \begin{equation}\label{eq:counts} T_k(H)=\sum_{m\le H}r_k(m),\qquad D_k(H)=\sum_{m\le H}\mathbf1_{r_k(m)>0}. \end{equation} Here $\mathbf1_E$ denotes the indicator of a condition $E$. Thus $T_k$ counts sorted triples and $D_k$ counts their distinct largest coordinates. All limits are taken with $k$ fixed. \begin{theorem}\label{thm:main} For every fixed integer $k\ge0$, there is a constant $C_k>0$ such that \begin{equation}\label{eq:main} T_k(H)\sim D_k(H)\sim C_k(\log H)^2, \qquad T_k(H)-D_k(H)=o_k((\log H)^2). \end{equation} Consequently, \begin{align} \#\{m\le H:r_k(m)\ge2\}&=o_k(D_k(H)),\label{eq:bad-values}\\ \sum_{\substack{m\le H\\r_k(m)\ge2}}r_k(m)&=o_k(T_k(H)).\label{eq:bad-triples} \end{align} The constant is \begin{equation}\label{eq:constant} C_k=\frac{\area(\ball_k)}{12\zeta(2)}, \end{equation} where $\zeta(2)=\pi^2/6$ and $\ball_k$ is the unit ball of the norm constructed in Section~\ref{sec:norm}. \end{theorem} The first density statement concerns the represented largest coordinates; the second counts all solutions in nonunique fibers, with their multiplicities. The square correspondence above gives $T_2(H)=T_0(\sqrt H)$ and $D_2(H)=D_0(\sqrt H)$, so $C_2=C_0/4$. We construct the required norm from the Vieta recursion and Farey labels. Its positive corners at rational directions determine its rational linear isometry group, and its exponentially small variation between consecutive Farey rays confines equal-length pairs to finitely many rational graph planes at each scale. On a fixed graph, integral polynomial dynamics and the interpolation argument of Poonen \cite{Poonen} yield a zero-density statement. The lattice orbit theorem of Burrin--Nevo--R\"uhr--Weiss \cite{BNRW}, with the cusp-width normalization given in Theorem~\ref{thm:orbit-count}, converts the finite congruence counts into real counts. A second Farey partition bounds the sum over graphs of growing complexity. Primitive lattice counting then gives \eqref{eq:main}. \section{Descent, Farey labels, and polynomial dynamics}\label{sec:tree} Throughout the proof, $k$ is fixed. The notation $|v|$ denotes the Euclidean norm. Positive constants $c,C$ may depend on $k$ and may change from line to line. Put \begin{equation}\label{eq:parameters} \kappa=k(k+2),\qquad \nu=k^2(2k+3),\qquad a_0=2k+3. \end{equation} The symbol $\prim$ denotes the set of nonzero primitive vectors in $\Z^2$, with both signs included. Set \[ e_1=(1,0),\quad e_2=(0,1),\qquad \calC=\{(p,q)\in\R^2:p\ge q\ge0\}. \] \begin{lemma}[Descent and the label tree]\label{lem:tree} Every positive integral solution of \eqref{eq:markov} descends by Vieta mutation to $(1,1,1)$. The coordinates of every solution are pairwise coprime. There are integer labels $M_v=M_{-v}\ge1$, indexed by $v\in\prim$, such that \begin{equation}\label{eq:farey-M} M_{u+v}=3(k+1)M_uM_v-k(M_u+M_v)-M_{u-v} \qquad(|\det(u,v)|=1), \end{equation} with $M_{e_1}=M_{e_2}=M_{e_1-e_2}=1$. Primitive vectors in $\calC$ are in bijection with sorted positive solutions, and $M_v$ is the largest coordinate of the corresponding solution. \end{lemma} \begin{proof} For a sorted solution $x\le y\le z$, the other root in the last coordinate is \[ z'=3(k+1)xy-k(x+y)-z=\frac{x^2+y^2+kxy}{z}>0. \] Let $P$ be the monic quadratic in that coordinate. Then \[ P(y)=x^2+2kxy+\{k+2-3(k+1)x\}y^2. \] If $x=1$, this equals $-(y-1)((2k+1)y+1)$. If $x\ge2$, the inequality $x\le y$ gives $P(y)\le3(k+1)(1-x)y^2<0$. Thus $0z$. Hence each noninitial sorted solution has a unique descending parent, and descent terminates because the sum of the coordinates decreases. Pairwise coprimality is preserved along an edge. Indeed, if a prime $p$ divides both $x$ and $z'$, the mutation formula gives $z\equiv-ky\pmod p$. Substitution into the equation modulo $p$ then gives $y^2\equiv0\pmod p$, contradicting $\gcd(x,y)=1$. The other retained coordinate is treated identically. Starting at $(1,1,1)$ proves the claim. In particular, equal coordinates greater than $1$ cannot occur. The dual graph of the Farey triangulation is a tree: adjacent unimodular pairs $(u,v)$ are refined by their mediant $u+v$. Starting with the triangle of unoriented directions $e_1,e_2,e_1-e_2$, assign its three labels the value $1$ and propagate across its edges by \eqref{eq:farey-M}. This gives every label unambiguously. Equivalently, in $\calC$ begin with the boundary vectors $e_1,e_1+e_2$, of labels $1,k+2$, and insert mediants. For an explicit description of the parents of $(p,q)$, where $00. \end{equation} We construct a norm $N=N_k$ with $N(v)=\ell_v$ for every primitive integer vector. Its unit ball will be denoted by $\ball=\ball_k$. \subsection{Fan recurrences and convexity} Fix a primitive vector $u$, and choose $B\in\Z^2$ with $\det(u,B)=1$. Set $a=X_u$ and $z_n=X_{B+nu}$. The Farey recursion gives \begin{equation}\label{eq:fan} z_{n+1}=az_n-z_{n-1}-\kappa,\qquad z_n=d_a+A_+\lambda_a^n+A_-\lambda_a^{-n}, \end{equation} where \[ \lambda_a=\frac{a+\sqrt{a^2-4}}2=e^{\ell_u},\qquad d_a=\frac{\kappa}{a-2}. \] Substitution into \eqref{eq:cubic}, or elimination of $z_0,z_1$, gives \begin{equation}\label{eq:R} A_+A_-=R_k(a):= \frac{(a+k)^2(a+k^2-2)}{(a-2)(a^2-4)} =\frac{a^2+\kappa a+\nu+\kappa^2/(a-2)}{a^2-4}>1. \end{equation} Indeed, using $\lambda_a+\lambda_a^{-1}=a$ in \eqref{eq:fan} gives \begin{align*} z_0^2+z_1^2-az_0z_1+\kappa(z_0+z_1) &=(2-a)d_a^2+2\kappa d_a-(a^2-4)A_+A_-\\ &=\frac{\kappa^2}{a-2}-(a^2-4)A_+A_-. \end{align*} The cubic identity therefore gives $(a^2-4)A_+A_-=a^2+\kappa a+\nu+\kappa^2/(a-2)$, while \[ (a-2)(a^2+\kappa a+\nu)+\kappa^2 =(a+k)^2(a+k^2-2). \] Since \begin{equation}\label{eq:d-bound} a_0(a_0-2)-4\kappa=3,\qquad 0\le d_a0. \] Consequently $c$ is the larger root. Since $4\kappa1. \end{equation} For the second inequality, multiply traces by $3/8$; the first inequality becomes a multiplicative lower bound, and the first coordinates add under mediants. The boundary traces are at least $a_0$, which starts the induction. For a convex positively homogeneous function $N$ and $x\ne0$, define its set of supporting functionals by \[ \partial N(x)=\{\alpha\in(\R^2)^*: \alpha(y)\le N(y) \text{ for all }y\in\R^2,\quad \alpha(x)=N(x)\}. \] We identify linear forms with Euclidean vectors. The set $\partial N(x)$ is a segment in the line $\alpha(x)=N(x)$. Denote its endpoints by $\nabla N(x)^-$ and $\nabla N(x)^+$, ordered so that their difference is a nonnegative multiple of $\rot x$, where $\rot(p,q)=(-q,p)$. They are the extreme supporting gradients on the clockwise and counterclockwise sides of the ray through $x$. \begin{proposition}\label{prop:norm} There is a $K$-invariant strictly convex norm $N$ on $\R^2$ taking the values \eqref{eq:length} on primitive integer vectors. It satisfies $c|v|\le N(v)\le C|v|$. At a primitive vector $v$, the difference of the extreme gradients, in counterclockwise order, is \begin{equation}\label{eq:gradient-jump} \nabla N(v)^+-\nabla N(v)^-=J_k(X_v)\rot v, \qquad J_k(a)=\log R_k(a)>0. \end{equation} \end{proposition} \begin{proof} For a reduced rational $q/p\in[0,1]$, define $f(q/p)=\ell_{(p,q)}/p$. Writing $\eta=\tfrac12\log(A_+/A_-)$ gives \[ z_n=d_a+2\sqrt{R_k(a)}\cosh(n\ell_u+\eta) >2\cosh(n\ell_u+\eta), \] and hence \begin{equation}\label{eq:strict-fan} \ell_{B+nu}>|n\ell_u+\eta|. \end{equation} Suppose $V,U,W$ are consecutive vectors in the Farey sequence of a fixed order. Then $V+W=mU$ for a positive integer $m$. Expressing $V=-B+nU$ and $W=B+(m-n)U$ and applying \eqref{eq:strict-fan} on the two sides of the fan gives \[ \ell_V+\ell_W> |n\ell_U-\eta|+|(m-n)\ell_U+\eta|\ge m\ell_U. \] Writing $V=(p_V,q_V)$, $U=(p_U,q_U)$, and $W=(p_W,q_W)$, the difference between the right and left slopes of the polygonal interpolant at $q_U/p_U$ is \[ p_U(\ell_V+\ell_W)-(p_V+p_W)\ell_U =p_U(\ell_V+\ell_W-m\ell_U)>0. \] Thus the interpolant at every Farey order is convex. A finer interpolant agrees at all previous vertices and, by convexity, lies below each previous chord. The interpolants decrease and are bounded between zero and the endpoint chord. Their limit is finite, convex, and continuous on $(0,1)$. Every interpolant of order at least $p$ takes the value $\ell_{(p,q)}/p$ at the reduced fraction $q/p$, so the limit retains this value. The fan expansions at $e_1$ and $e_1+e_2$ give the endpoint limits along $1/n$ and $n/(n+1)$ and finite limits of the corresponding secant slopes. Convexity then gives continuity and finite one-sided derivatives at both endpoints. At $u=(p,q)$ in the interior, with $B=(r,s)$ and $\det(u,B)=1$, it gives \[ \ell_{B+nu}=n\ell_u+\log A_++o(1),\qquad \ell_{nu-B}=n\ell_u+\log A_-+o(1). \] The two one-sided derivatives therefore satisfy \begin{equation}\label{eq:f-jump} f'_+(q/p)-f'_-(q/p)=p\log(A_+A_-)=pJ_k(X_u). \end{equation} For instance, the first derivative equals $p\log A_+-r\ell_u$, as is seen by evaluating $f((nq+s)/(np+r))$; the second equals $-p\log A_--r\ell_u$. Set $N(0)=0$ and \[ N(p,q)=pf(q/p)\qquad(p>0,\ 0\le q\le p). \] Extend by $K$-invariance. The unique representative in the closed fundamental cone makes the extension well-defined. It is positively homogeneous and even, since $-I\in K$. We check convexity at the boundary of the cone. At either boundary vector, choose the adjacent vector $B=e_2$. The fan traces obey $z_0=z_{-1}$ and hence $z_n=z_{-n-1}$, by the root symmetries. Thus $A_-=A_+/\lambda_a$. The traces at $e_1$ and $(1,1)$ are $a_0$ and $a_1=3k^2+8k+6$, respectively. At $e_1$ the inward derivative is $f'_+(0)=\log A_+$; at $e_1+e_2$ it is $f'_-(1)=-\log A_-$. Since $\log A_+-\log A_-=\ell_u$, these identities give \begin{equation}\label{eq:boundary-jumps} 2f'_+(0)-f(0)=J_k(a_0)>0, \qquad f(1)-2f'_-(1)=J_k(a_1)>0. \end{equation} At $e_1$, the gradients on the two sides are \[ (f(0),f(0)-f'_+(0)),\qquad(f(0),f'_+(0)), \] because the boundary reflection is $(p,q)\mapsto(p+q,-q)$. At $e_1+e_2$, they are \[ (f(1)-f'_-(1),f'_-(1)),\qquad(f'_-(1),f(1)-f'_-(1)). \] Their counterclockwise differences are respectively $J_k(a_0)\rot e_1$ and $J_k(a_1)\rot(e_1+e_2)$. The same property holds at the other cone boundaries by $K$-invariance. On a line of direction $w$ crossing the ray of $v$, the derivative jumps by $J_k(X_v)|\det(v,w)|\ge0$. The restriction of $N$ to a line not through the origin is convex between its finitely many cone crossings and at each crossing, so it is convex on that line. On a line through the origin, $N(tv)=|t|N(v)$ is convex. Thus $N$ is globally convex. The lower bound \eqref{eq:trace-growth} and the endpoint chord give $c|v|\le N(v)\le C|v|$ on rational directions and then everywhere by continuity. Convexity and homogeneity give the triangle inequality, so $N$ is a norm. Formula \eqref{eq:f-jump}, the boundary identities, and unimodularity of $K$ give \eqref{eq:gradient-jump}. Finally a line segment on the unit sphere would make $N$ linear on an open cone. That cone contains a rational ray, contradicting its strictly positive gradient jump. The norm is strictly convex. \end{proof} \subsection{The expanding coefficient} We next estimate the full change of gradient within an open Farey sector. \begin{lemma}\label{lem:expanding} Let $a,b$ be the parent traces of a mediant inside $\calC$, and let $c$ be the new trace. In the fan centered at the first parent, with $z_0=b,z_1=c$, denote the expanding coefficient by $A_{a,b}$. Then \begin{equation}\label{eq:coefficient-bound} \frac18\lambda_b\le A_{a,b}\le\lambda_b, \qquad 0\le\log\lambda_b-\log A_{a,b}\le\frac{C}{ab}. \end{equation} \end{lemma} \begin{proof} Set \[ \widehat c=2\cosh(\log\lambda_a+\log\lambda_b) =\frac{ab+\sqrt{(a^2-4)(b^2-4)}}2. \] If $d$ is the old trace, evaluating the quadratic with roots $c,d$ at $\widehat c$ gives \begin{equation}\label{eq:root-comparison} (\widehat c-c)(\widehat c-d)=4+\kappa(a+b+\widehat c)+\nu. \end{equation} Here $\widehat c$ is to the right of the quadratic's vertex. Its positive value implies $\widehat c>c$, and \[ \widehat c-d\ge\tfrac12\sqrt{(a^2-4)(b^2-4)} \ge\tfrac12(1-4/a_0^2)ab. \] Since $\widehat c\le ab$ and $a,b\ge a_0\ge3$, it follows that $0<\widehat c-c\le C$. Solving the two fan initial equations yields \begin{align} A_{a,b} &=\frac{c-b/\lambda_a-d_a(1-1/\lambda_a)}{\sqrt{a^2-4}}\notag\\ &=\lambda_b- \frac{\widehat c-c+d_a(1-1/\lambda_a)}{\sqrt{a^2-4}}. \label{eq:expanding-formula} \end{align} In particular $0\le\lambda_b-A_{a,b}\le C/a$. For a lower bound, use $c\ge3ab/8$, $\lambda_a\ge a-1$, and $d_a0 \qquad(a\ge3). \] We may therefore replace its denominator by the larger number $a$: \[ A_{a,b}\ge b\left(\frac38-\frac1{a(a-1)}-\frac1{4a}\right) \ge\frac b8\ge\frac{\lambda_b}{8}. \] The middle inequality follows from \[ \frac38-\frac1{a(a-1)}-\frac1{4a}-\frac18 =\frac{(a-3)(a+1)}{4a(a-1)}\ge0. \] Finally $\lambda_b\ge b-1\ge2b/3$, and $-\log t\le8(1-t)$ on $1/8\le t\le1$. These facts prove \eqref{eq:coefficient-bound}. \end{proof} \subsection{Finite fans and small integral normals} Let $\calF_H$ be the fan obtained by taking the Farey fractions of order $\lfloor H\rfloor$ in $[0,1]$ and their $K$-images. Its rays are generated by primitive vectors; an open sector means the open cone between consecutive rays. Increasing the order refines the fan. Every supporting functional $\alpha\in\partial N(x)$ satisfies $c\le|\alpha|\le C$. \begin{proposition}[Farey estimates]\label{prop:farey-estimates} There are positive constants $c,C,\rho,C_{\mathrm{sep}}$, depending only on $k$, with the following properties for $H\ge1$. \begin{enumerate} \item The fan $\calF_H$ has $O(H^2)$ rays, generated by vectors of length at most $CH$. \item In each open sector, all supporting functionals differ by at most $Ce^{-\rho H}$. The sum over all open sectors of their total normal angular variations is at most $Ce^{-\rho H}$. \item The full normal angle at each boundary ray is at least $ce^{-C_{\mathrm{sep}}H}$. \item The total angular width of any $m$ sectors is at most $C\sqrt m/H$. \item If $\alpha$ is a supporting functional at any point of an open sector, then throughout that sector \begin{equation}\label{eq:linear-approx} |N(v)-\alpha(v)|\le C|v|e^{-\rho H}. \end{equation} \end{enumerate} \end{proposition} \begin{proof} For adjacent fractions $q/p\lfloor H\rfloor$, $p,r\le H$, and $ab\ge(8/3)^2\gamma^{p+r}$, summing over the $O(H^2)$ gaps gives $CH^3\gamma^{-H}$, up to an absolute factor. For an open gap $I=(x,y)$, the positive Lebesgue--Stieltjes measure $df'_+$ has mass $f'_-(y)-f'_+(x)$. The support curve on the slice $(1,t)$ satisfies the vector-valued measure identity \[ d(f-tf'_+,f'_+)=(-t,1)\,df'_+, \] because $f$ is Lipschitz and $df=f'_+(t)\,dt$. At each jump, include the full segment between the two extreme supports. The complete gradient variation on $I$ is therefore at most \[ \int_I\sqrt{1+t^2}\,df'_+(t) \le\sqrt2\bigl(f'_-(y)-f'_+(x)\bigr). \] The lower bound on support lengths gives the same estimate, up to a fixed factor, for normal angular variation. The finitely many fixed linear maps in $K$ change these bounds only by constant factors. For a boundary vector $v$, the absolute determinant of the extreme supports equals $N(v)J_k(X_v)$, by \eqref{eq:gradient-jump}. From \eqref{eq:R}, \[ R_k(a)-1= \frac{\kappa a+\nu+4+\kappa^2/(a-2)}{a^2-4}. \] For $k=0$ this is $4a^{-2}+O(a^{-4})$; for $k>0$ it is $\kappa a^{-1}+O_k(a^{-2})$. Using $\log(1+s)=s+O(s^2)$ and $2\cosh t=e^t(1+e^{-2t})$ gives \begin{equation}\label{eq:J-asymptotics} J_k(2\cosh t)\sim \begin{cases} 4e^{-2t},&k=0,\\ k(k+2)e^{-t},&k>0. \end{cases} \qquad(t\longrightarrow\infty). \end{equation} Together with $N(v)\le CH$, positivity on bounded intervals, and $c\le|\alpha|\le C$, they imply (iii). For (iv), let $r$ be the smaller denominator of a Farey gap. Its width is $1/(pr)=O(1/(rH))$, because $p+r>\lfloor H\rfloor$. There are $O(r)$ gaps with smaller denominator $r$. Those with $r\le\sqrt m$ have total width $O(\sqrt m/H)$; any $m$ of the others have the same bound. Angular width is comparable to slope width on $\calC$, and the finite $K$-images preserve the estimate. Assertion (i) is the elementary Farey count, and (v) follows by comparing $\alpha$ with a supporting functional at $v$. \end{proof} Strict convexity means that every nonzero linear form $\beta$ has a unique contact point on $\partial\ball$: the point where it attains its maximum. Its positive ray is called the contact direction of $\beta$. The normal directions of supporting functionals run monotonically around the circle; the normals at a corner fill the arc between its two extreme supports. For nonzero vectors $x,y$, write \[ \angle(x,\{y,-y\})= \arccos\frac{|x\cdot y|}{|x|\,|y|}\in[0,\pi/2] \] for the smaller angle from $x$ to the unoriented line through $y$. \begin{lemma}[Excision of small integral normals]\label{lem:excision} Let $L,M\ge1$ and $H\ge C\log(2+M)$. From $\{v\in\prim:N(v)\le L\}$ remove the rays of $\calF_H$ and every open sector whose closure contains the contact direction of some $0\ne\beta\in\Z^2$ with $|\beta|\le M$. The number removed is at most \begin{equation}\label{eq:excision-cost} C\left(\frac{\log(2+M)}H L^2 +L\log^2(2+M)+H^2\right). \end{equation} For every retained sector, each of its supporting functionals $\alpha$ satisfies \begin{equation}\label{eq:normal-separation} \angle(\alpha,\{\beta,-\beta\})\ge ce^{-C_{\mathrm{sep}}H} \quad(0<|\beta|\le M,\ \beta\in\Z^2). \end{equation} \end{lemma} \begin{proof} Distinct nonparallel integer normals of length at most $M$ have angular separation at least $cM^{-2}$. Choose a preliminary order $H_0=C_{\mathrm{pre}}\log(2+M)$, with $C_{\mathrm{pre}}$ sufficiently large, so that the normal variation inside any of its open sectors is smaller than this separation. Each such sector then contains at most one distinct contact direction for the specified normals. On a boundary ray several normals may have the same contact, but there are only $O(H_0^2)$ such rays. Thus the number of distinct contact directions is $O(\log^2(2+M))$. At order $H$, each contact direction belongs to the closures of at most two sectors. Proposition~\ref{prop:farey-estimates}(iv) bounds their total angular width by $C\log(2+M)/H$. The intersection of each of these sectors with $L\ball$ is convex, has perimeter $O(L)$, and has area at most $CL^2$ times its angular width. The elementary lattice bound $\#(\Z^2\cap D)\le\area(D)+C\operatorname{perimeter}(D)+C$ for a planar convex set proves the first two terms of \eqref{eq:excision-cost}. Each boundary ray contains only one primitive integer vector, giving the $O(H^2)$ term. By deletion of every sector whose \emph{closure} contains a contact, there is a full boundary corner between a retained sector and each specified contact direction, in either direction around the circle. Monotonicity of the normal direction and the complete corner bound in Proposition~\ref{prop:farey-estimates}(iii) yield \eqref{eq:normal-separation}. Normals of both signs are included. \end{proof} \section{Rational linear isometries}\label{sec:isometries} \begin{proposition}\label{prop:isometries} The rational linear isometry group of $N$ is exactly $K$: \[ \{G\in\GL(\Q):N\circ G=N\}=K. \] \end{proposition} \begin{proof} The inclusion of $K$ follows from Proposition~\ref{prop:norm}. Conversely, suppose $G\in\GL(\Q)$ preserves $N$, and write $G=A/d$ with $A$ integral and $d$ a positive integer. For $v\in\prim$, write $Av=g w$ with $w\in\prim$ and $g>0$. Since $\operatorname{adj}(A)Av=(\det A)v$, we have $g\mid|\det A|$. Thus the factor $r=g/d$ in $Gv=rw$ belongs to a fixed finite set. Let $t=N(w)$, so $N(v)=rt$. Positive homogeneity and $N\circ G=N$ give \[ \partial N(v)=G^{\mathsf T}\partial N(Gv) =G^{\mathsf T}\partial N(w). \] The endpoint orders agree when $\det G>0$ and are interchanged when $\det G<0$. Since $w=Gv/r$ and $G^{\mathsf T}\rot G=(\det G)\rot$, formula \eqref{eq:gradient-jump} yields \begin{align*} J_k(2\cosh(rt))\rot v &=\operatorname{sgn}(\det G)G^{\mathsf T} \bigl(J_k(2\cosh t)\rot w\bigr)\\ &=\frac{|\det G|}{r}J_k(2\cosh t)\rot v. \end{align*} Cancelling the nonzero vector $\rot v$ gives \begin{equation}\label{eq:isometry-jump} J_k(2\cosh(rt))=\frac{|\det G|}{r}J_k(2\cosh t). \end{equation} If a fixed $r\ne1$ occurred for infinitely many primitive vectors, their associated $t$ would tend to infinity along a subsequence, whereas \[ \frac{rJ_k(2\cosh(rt))}{J_k(2\cosh t)}=|\det G|. \] By \eqref{eq:J-asymptotics}, the left side tends to zero for $r>1$ and to infinity for $r<1$, a contradiction. Hence all sufficiently large primitive vectors have $r=1$, and \eqref{eq:isometry-jump} then gives $|\det G|=1$. For two sufficiently large consecutive vectors $(n,1),(n+1,1)$, both images under $G$ are integral. Their difference shows that $Ge_1$ is integral, and then $Ge_2$ is integral as well. Therefore $G\in\GL(\Z)$. The shortest primitive vectors for $N$ are precisely $\pm e_1,\pm e_2,\pm(e_1-e_2)$, by Lemma~\ref{lem:tree}. The full group of linear maps permuting this hexagon is $K$: there are six choices for the image of $e_1$ and two compatible choices for the adjacent image of $e_2$, and the twelve elements of $K$ realize them. Thus $G\in K$. \end{proof} \section{Zero density on a fixed rational graph}\label{sec:fixed} \begin{proposition}\label{prop:fixed} For every fixed $G\in\GL(\Q)\setminus K$, \begin{equation}\label{eq:fixed} \#\{v\in\prim:Gv\in\prim,\ N(v)=N(Gv)\le L\}=o_{k,G}(L^2). \end{equation} \end{proposition} \subsection{Finite orbits and a paired action} Let $\Gamma=\Gam$ and $H=\Gamma\cap G^{-1}\Gamma G$. For $m\ge1$, write \[ \Gamma(m)=\{g\in\Gamma:g\equiv I\pmod m\}. \] For a nonzero integral vector $b=(b_1,b_2)$, put $\cont(b)=\gcd(|b_1|,|b_2|)$. Write $G=A/d$, where $d$ is a positive integer and $A$ is a nonsingular integral matrix, and set $\delta=|\det A|$. Then $\Gamma(\delta)\subset H$: for $h=I+\delta B$, $AhA^{-1}=I+\operatorname{sgn}(\det A)AB\operatorname{adj}(A)$ is integral. If $v$ is primitive, $\cont(Av)$ divides both coordinates of $\operatorname{adj}(A)Av=(\det A)v$, hence divides $\delta$. It therefore equals $\gcd((Av)_1,(Av)_2,\delta)$ and is determined by $v$ modulo $\delta$. Thus \[ Gv\in\prim\quad\Longleftrightarrow\quad\cont(Av)=d \] is a residue condition. If $d\nmid\delta$, there are no feasible vectors. Primitive vectors in any one residue class modulo $\delta$ form one $\Gamma(\delta)$-orbit. To see this, complete $v,w$ to matrices $B_v,B_w\in\Gamma$. If $v\equiv w\pmod\delta$, then $B_v^{-1}B_w\equiv T^b\pmod\delta$ for some $b$. Choose $n\equiv-b\pmod\delta$. The matrix $B_wT^nB_v^{-1}\in\Gamma(\delta)$ sends $v$ to $w$. The feasible primitive vectors are therefore a finite union of $H$-orbits. Fix an odd prime $p$, for example $p=3$. Write $\Zp$ for the ring of $p$-adic integers and $\Q_p$ for its fraction field. Let $v_p$ be the valuation normalized by $v_p(p)=1$, and set $|x|_p=p^{-v_p(x)}$ for $x\ne0$ and $|0|_p=0$. Lemma~\ref{lem:action} gives a right action of $H$ on the entire $\Zp^6$: \begin{equation}\label{eq:paired-action} (P,P')\star h=(P*h,P'*(GhG^{-1})). \end{equation} Take $J$ to be the kernel of this action on $(\Z/p^2\Z)^6$. This is a finite-index normal subgroup of $H$; it is finitely generated and contains $-I$. The feasible primitive vectors are still a finite union of $J$-orbits. Fix one such orbit $Ju$, put $w=Gu$, and define \begin{equation}\label{eq:collision-polynomial} z_0=(o,o),\qquad \mathcal P(P,P')=P_u(P)-P_w(P'). \end{equation} Equivariance gives the exact identity \begin{equation}\label{eq:polynomial-orbit} \mathcal P(z_0\star j)=X_{ju}-X_{Gju}\quad(j\in J). \end{equation} \subsection{Analytic interpolation and a zero--one law} The Tate algebra $\Zp\langle x_1,\ldots,x_d\rangle$ is the algebra of power series with integral coefficients tending to zero $p$-adically; it carries the coefficient supremum norm. \begin{lemma}[Interpolation]\label{lem:interpolation} Suppose an integral polynomial automorphism $g$ fixes every point of $(\Z/p^2\Z)^d$, where $p$ is odd. On each residue ball $a+p\Zp^d$, its iterates extend to a jointly analytic action of $\Zp$. \end{lemma} \begin{proof} Choose $a\in\Z^d$ representing the residue ball and use coordinates $x=a+py$. The normalized map $g_a(y)=(g(a+py)-a)/p$ has the form \begin{equation}\label{eq:coefficient-congruence} g_a(y)=y+pR(y),\qquad R\in\Zp[y]^d. \end{equation} In fact, $g(a)-a\equiv0\pmod{p^2}$. Applying the pointwise congruence also to $a+pb$, for every $b\in(\Z/p\Z)^d$, and expanding to first order gives $Dg(a)b\equiv b\pmod p$ for all $b$, so $Dg(a)\equiv I\pmod p$. The integral Taylor coefficients of degree $j\ge2$ acquire a factor $p^{j-1}$ after normalization. This proves coefficientwise congruence in \eqref{eq:coefficient-congruence}. Let $\Delta f=f\circ g_a-f$ on the Tate algebra. By \eqref{eq:coefficient-congruence}, $\Delta$ maps $p^m$ times this algebra into $p^{m+1}$ times it. Therefore \begin{equation}\label{eq:Mahler} \Phi_g(s,y)=\sum_{n\ge0}\binom{s}{n}\Delta^n y \end{equation} converges in the Tate algebra in $(s,y)$: the coefficient valuations of its $n$th summand are at least $n-v_p(n!)\ge n(1-1/(p-1))$, which tend to infinity for odd $p$. For every nonnegative integer $s$ the binomial identity gives $\Phi_g(s,y)=g_a^s(y)$. Density of the nonnegative integers in $\Zp$ and continuity give the group law $\Phi_g(s+t,y)=\Phi_g(s,\Phi_g(t,y))$. This is Poonen's interpolation argument \cite[Theorem 1]{Poonen}, here with coefficient congruence exponent $1>1/(p-1)$. Transport the action back by $x=a+py$, and use $\Phi_g$ for the resulting action on $a+p\Zp^d$. \end{proof} We also recall the elementary zero statement used below. A nonzero one-variable Tate series $f(s)=\sum a_ns^n$ has only finitely many zeros in $\Zp$ (Strassmann's theorem). One proof takes the largest index $m$ at which $|a_m|_p$ is maximal. If $b\in\Zp$ is a zero, division by $s-b$ produces a Tate series whose last maximal index is $m-1$: its coefficients are $c_n=\sum_{j\ge n+1}a_jb^{j-n-1}$, so $|c_{m-1}|_p=|a_m|_p$ and $|c_n|_p<|a_m|_p$ for $n\ge m$. Induction gives at most $m$ zeros, counting multiplicity. Scaling coefficients proves the same statement over $\Q_p$. Let $Y$ be the closure of $z_0\star J$ in $\Zp^6$. Each finite residue image of this orbit is a transitive finite $J$-set. Its uniform probability measures are compatible, since the transition maps have equal-size fibers. Their inverse limit is a $J$-invariant probability measure $\mu$ of full support on $Y$. This action is ergodic: if an integrable function is $J$-invariant, its conditional expectation on every finite residue partition is constant, by transitivity. The residue partitions have diameters tending to zero, so their locally constant functions are dense in $L^1(Y,\mu)$. The conditional expectations therefore converge in $L^1$ to the original function, which is constant almost everywhere. \begin{lemma}[Zero--one law]\label{lem:zero-one} For any integral polynomial $Q$ on the ambient space, \[ \mu\{y\in Y:Q(y)=0\}\in\{0,1\}. \] \end{lemma} \begin{proof} Let $E=Y\cap\{Q=0\}$ and let $g$ be a generator of $J$. The interpolation of Lemma~\ref{lem:interpolation} preserves $Y$: each $p$-adic time is a uniform limit of integer times on the compact residue ball. It also preserves $\mu$, first for continuous test functions by that uniform limit, then for all Borel sets. For each $y\in Y$, the function $s\mapsto Q(\Phi_g(s,y))$ is analytic on $\Zp$. Its zero set is either all of $\Zp$ or finite. In either case, with normalized Haar measure $ds$, \[ \int_{\Zp}\left|\mathbf1_E(\Phi_g(s+1,y))- \mathbf1_E(\Phi_g(s,y))\right|\,ds=0. \] Integrating over $Y$, using Fubini, the group law, and preservation of $\mu$ by $\Phi_g(s,\cdot)$, gives \begin{align*} 0&=\int_{\Zp}\int_Y |\mathbf1_E(\Phi_g(s+1,y))-\mathbf1_E(\Phi_g(s,y))| \,d\mu(y)\,ds\\ &=\int_{\Zp}\int_Y |\mathbf1_E(\Phi_g(1,x))-\mathbf1_E(x)|\,d\mu(x)\,ds =\mu(E\mathbin\triangle g^{-1}E). \end{align*} This holds for all generators. Ergodicity proves the assertion. \end{proof} Apply this lemma to $\mathcal P$ from \eqref{eq:collision-polynomial}. If its zero set has measure one, closedness and full support imply that it vanishes throughout $Y$. At every actual integral orbit point, \eqref{eq:polynomial-orbit} is an equality of integers. Injectivity of $\Z\longrightarrow\Zp$ then gives \[ N(ju)=N(Gju)\qquad(j\in J). \] The directions of $Ju$ are dense in the projective line. Indeed, for a primitive $a$ the parabolic $v\mapsto v+\det(a,v)a$ belongs to $\Gamma$, and some positive power belongs to the finite-index subgroup $J$. If $u$ is not parallel to $a$, its iterates approach the direction of $a$. Omitting the single parallel direction leaves a dense set of rational directions; $-I\in J$ supplies both orientations. Continuity and homogeneity of $N$ would give $N\circ G=N$, contrary to Proposition~\ref{prop:isometries}. Its zero set therefore has measure zero. The sets $\{y\in Y:\mathcal P(y)\equiv0\pmod{p^n}\}$ decrease to $\{y\in Y:\mathcal P(y)=0\}$. Continuity of the probability measure from above gives \begin{equation}\label{eq:residue-zero-density} \mu\{y\in Y:\mathcal P(y)\equiv0\pmod{p^n}\} \longrightarrow0. \end{equation} \subsection{Lattice orbit counting and cusp widths} \begin{theorem}[Finite-index orbit counting]\label{thm:orbit-count} Let $V\le\Gamma$ have finite index and contain $-I$, and let $a\in\prim$. Choose $g_a\in\Gamma$ with $g_ae_1=a$ and let $\omega(a;V)$ be the least positive integer $\omega$ such that $g_aT^\omega g_a^{-1}\in V$. Let \[ \Omega=\{r(\cos\theta,\sin\theta): 0\le r\le r_\Omega(\theta),\ 0\le\theta<2\pi\}, \] where $r_\Omega$ is a fixed nonnegative $2\pi$-periodic Lipschitz function. Then \begin{equation}\label{eq:orbit-count} \#(Va\cap L\Omega)= \frac{\omega(a;V)}{[\Gamma:V]} \frac{\area(\Omega)}{\zeta(2)}L^2+o_{V,a,\Omega}(L^2). \end{equation} \end{theorem} This follows from \cite[Theorem 2.7 and Section 5.2]{BNRW}, which applies to every finite-index subgroup of $\Gamma$. To compute the constant, set $\omega=\omega(a;V)$ and \[ \sigma=g_a\begin{pmatrix}\sqrt\omega&0\\0&1/\sqrt\omega\end{pmatrix}. \] Then $\sigma T\sigma^{-1}=g_aT^\omega g_a^{-1}$ and $\sigma e_1=\sqrt\omega\,a$. The cusp-normalized disk constant in \cite[Section 3.5]{BNRW} is $2/\operatorname{covol}(V)$. Rescaling $\sqrt\omega\,a$ to $a$ multiplies this constant by $\omega$. Since $\operatorname{covol}(V)=[\Gamma:V]\pi/3$, the density per unit Euclidean area is \[ \frac{2\omega}{\pi\operatorname{covol}(V)} =\frac{\omega}{[\Gamma:V]\zeta(2)}. \] In the orbit-map coordinates of \cite[Section 5.2]{BNRW}, integration over a fixed stabilizer interval makes the main term proportional to \[ \int_0^{2\pi}\int_0^{Lr_\Omega(\theta)}r\,dr\,d\theta =L^2\area(\Omega). \] The disk constant therefore gives the stated density for every such region. These constants count both signs, consistently with $-I\in V$. The norm ball $\ball$ has a Lipschitz radial function: on the Euclidean unit circle it is $1/N$, a positive Lipschitz function. \begin{proof}[Proof of Proposition~\ref{prop:fixed}] Continue with the fixed feasible orbit $Ju$. For each $n$, let $U_n$ be the kernel of the action of $J$ on the whole ambient space modulo $p^n$, and write $Q_n=J/U_n$. The group $U_n$ is normal in $J$ and contains $-I$. The stabilizer of the oriented vector $u$ in $\Gamma$ is $g_u\langle T\rangle g_u^{-1}$, so its stabilizer in $J$ is generated by $s=g_uT^\omega g_u^{-1}$, where $\omega=\omega(u;J)$. Write $\bar j$ for the image of $j\in J$ in $Q_n$, and let $r_n$ be the order of $\bar s$. For $j_1,j_2\in J$, \begin{align*} U_nj_1u=U_nj_2u &\Longleftrightarrow j_2^{-1}h j_1\in\langle s\rangle \text{ for some }h\in U_n\\ &\Longleftrightarrow \bar j_1\in\bar j_2\langle\bar s\rangle. \end{align*} Thus the $U_n$-orbits correspond to the orbits of right multiplication by $\langle\bar s\rangle$ in $Q_n$, each of size $r_n$. For $ju$, use the completion $jg_u$. Normality shows that its cusp width for $U_n$ is the least $m>0$ with $g_uT^mg_u^{-1}\in U_n$. Such an $m$ is a multiple $\omega b$, and membership is equivalent to $s^b\in U_n$, or $r_n\mid b$. Every width is therefore $\omega r_n$. Each $U_n$-orbit contains both signs, since $-I\in U_n$. Set \[ E_n=\{\bar j\in Q_n:\mathcal P(z_0\star j)\equiv0\pmod{p^n}\}. \] This set is invariant under right multiplication by $\bar s$: $su=u$ and $(GsG^{-1})w=w$, so equivariance fixes the two coordinate polynomials in \eqref{eq:collision-polynomial}. Moreover, \begin{equation}\label{eq:finite-measure} \frac{|E_n|}{|Q_n|} =\mu\{\mathcal P\equiv0\pmod{p^n}\}. \end{equation} Indeed, the orbit map from $Q_n$ to the finite residue orbit of $z_0$ has equal-size fibers; its uniform group measure pushes forward to uniform orbit measure. Every genuine collision belongs to one of the $|E_n|/r_n$ selected $U_n$-orbits. For a fixed $n$, apply Theorem~\ref{thm:orbit-count} to each of these finitely many orbits, with $\Omega=\ball$. Their total leading coefficient is \[ \frac{|E_n|}{r_n}\, \frac{\omega r_n}{[\Gamma:J]|Q_n|}\, \frac{\area(\ball)}{\zeta(2)}. \] The factor $r_n$ cancels. In particular, if $C_u(L)$ counts collisions in $Ju$, then \[ \limsup_{L\to\infty}\frac{C_u(L)}{L^2} \le \frac{\omega}{[\Gamma:J]} \frac{\area(\ball)}{\zeta(2)}\frac{|E_n|}{|Q_n|}. \] First take $L\to\infty$ for this fixed $n$, and then take $n\to\infty$. Equations \eqref{eq:residue-zero-density} and \eqref{eq:finite-measure} give a zero upper bound. Summing over the finitely many feasible $J$-orbits proves \eqref{eq:fixed}. \end{proof} \section{Uniform summation over rational graphs}\label{sec:tail} We prove that the excess of $K$-orbits over distinct norm values is $o(L^2)$. All constants in this section depend only on the fixed norm and its Farey estimates, except where additional subscripts are displayed. \subsection{Graph complexity and a population bound} For $G\in\GL(\Q)$, put \begin{align*} \Lambda_{\mathrm{in}}(G)&=\Z^2\cap G^{-1}\Z^2, &\Lambda_{\mathrm{out}}(G)&=G\Lambda_{\mathrm{in}}(G),\\ I_{\mathrm{in}}(G)&=[\Z^2:\Lambda_{\mathrm{in}}(G)], &I_{\mathrm{out}}(G)&=[\Z^2:\Lambda_{\mathrm{out}}(G)], \end{align*} and define \begin{equation}\label{eq:complexity} \mathfrak J(G)=\max\{1,I_{\mathrm{in}}(G),I_{\mathrm{out}}(G),h(G)\}, \qquad h(G)=\max_{i,j}|G_{ij}|. \end{equation} \begin{lemma}\label{lem:population} Let $G\in\GL(\Q)$ and $L\ge1$, and let $\mathscr P$ be a set of integral graph points $(v,Gv)$ with $|v|,|Gv|\le CL$. Then, uniformly in $G$, \begin{equation}\label{eq:population} \#\mathscr P\le C\bigl(L^2/\mathfrak J(G)+L+1\bigr). \end{equation} For $Q\ge1$, there are $O(Q^9)$ rational matrices with $\mathfrak J(G)\le Q$. Each of their graph planes has two spanning integer vectors of length $O(Q^2)$. \end{lemma} \begin{proof} If the inputs span a space of dimension at most one, they lie in $\Z u$ for some $u\in\prim$, taking $u=e_1$ if all inputs are zero. An input determines its graph point, so \[ \#\mathscr P\le2\left\lfloor\frac{CL}{|u|}\right\rfloor+1 \le2CL+1. \] This proves \eqref{eq:population} in this case. Otherwise choose two independent inputs. Rounding coordinates in their basis shows that their generated sublattice has covering radius at most half the sum of their lengths, hence $O(L)$. The larger lattice $\Lambda_{\mathrm{in}}(G)$ has no greater covering radius. The Voronoi cells centered at the selected inputs have disjoint interiors, area $I_{\mathrm{in}}(G)$, and lie in a disk of radius $O(L)$. Thus $\#\mathscr P\le CL^2/I_{\mathrm{in}}(G)$. The same argument on the output lattice gives $CL^2/I_{\mathrm{out}}(G)$. If a row of $G$ has length comparable to $h(G)$, the condition $|Gv|\le CL$ confines the inputs to a strip of width $O(L/h(G))$. Its intersection with the input disk has area $O(L^2/h(G))$ and perimeter $O(L)$. The planar lattice bound gives $C(L^2/h(G)+L+1)$. Taking the strongest of these bounds, and the trivial disk bound when necessary, proves \eqref{eq:population}. Let $q$ be the least positive integer for which $qG$ is integral. It is the exponent of the finite group $\Z^2/\Lambda_{\mathrm{in}}(G)$, since $q\Z^2\subset\Lambda_{\mathrm{in}}(G)$ is equivalent to integrality of $qG$. Hence $q\mid I_{\mathrm{in}}(G)$. If $\mathfrak J(G)\le Q$, write $G=A/q$ with $q\le Q$ and the four entries of $A$ bounded by $Q^2$. There are $O(Q^9)$ such choices. The integer vectors $(qe_i,Ae_i)$, $i=1,2$, span its graph plane and have length $O(Q^2)$. \end{proof} \subsection{A first partition and rank reduction} A collision will mean a pair $v,w\in\prim$ satisfying $N(v)=N(w)\le L$ and $w\notin Kv$. Fix a sufficiently large constant $A$, and choose a larger constant $B$ such that \begin{equation}\label{eq:coarse-fine-condition} \rho B>C_{\mathrm{sep}}A+5. \end{equation} Use the coarse fan of order $H_c=\lceil A\log L\rceil$ and the fine fan of order $H_f=\lceil B\log L\rceil$. Apply Lemma~\ref{lem:excision} with $M=C_{\mathrm{rank}}L^3$ at the coarse order, for a fixed sufficiently large $C_{\mathrm{rank}}$, and also remove the fine fan rays. The number of primitive vectors removed is at most \begin{equation}\label{eq:first-deletion} CL^2/A+O_A(L\log^2L+\log^2L). \end{equation} The constants $B$ and $C_{\mathrm{rank}}$ can be fixed once $A$ is fixed. Consider collisions whose two endpoints have survived, in a fixed pair of fine open sectors. Choose supporting functionals $\lambda,\lambda'$ at interior points of these sectors, and put $\ell=(\lambda,-\lambda')\in(\R^4)^*$. Every such collision $z=(v,w)$ satisfies \begin{equation}\label{eq:almost-hyperplane} |z|\le CL,\qquad |\ell(z)|\le CLe^{-\rho H_f}, \qquad c\le|\ell|\le C. \end{equation} Every fine sector containing a retained point lies wholly in a retained coarse sector. Thus the chosen supports themselves satisfy the coarse normal separation \eqref{eq:normal-separation}. We will use the following elementary estimate. If $z_1,\ldots,z_d$ are linearly independent integral vectors of length at most $R$, their $d$-dimensional volume is at least one: its square is the sum of the squares of the integral $d\times d$ minors. The largest $d-1$ singular values of their column matrix are at most $\sqrt d\,R$, so the smallest is at least $(\sqrt d\,R)^{-(d-1)}$. Consequently, \begin{equation}\label{eq:integer-volume} |\ell(z_i)|\le\varepsilon\ (1\le i\le d) \quad\Longrightarrow\quad \|\ell|_{\spanR(z_1,\ldots,z_d)}\| \le d^{d/2}R^{d-1}\varepsilon. \end{equation} \begin{lemma}[Rank reduction]\label{lem:rank-reduction} For all sufficiently large $L$, the collision vectors in one such pair of fine sectors span a space of dimension at most two. \end{lemma} \begin{proof} Four independent integral collision vectors would have determinant of absolute value at least one. Taking the first coordinate along $\ell/|\ell|$, estimate \eqref{eq:almost-hyperplane} instead bounds it by $CL^4e^{-\rho H_f}<1$, a contradiction. Suppose three independent vectors span $W$. Their exterior product is a nonzero integral vector, so their three-dimensional volume is at least one. Since their lengths are $O(L)$, their smallest singular value is at least $cL^{-2}$. It follows that \begin{equation}\label{eq:rank-three-error} \|\ell|_W\|\le CL^3e^{-\rho H_f}. \end{equation} A primitive integral normal to $W$ has the form $(\alpha,\beta)$, of length at most $C_{\mathrm{rank}}L^3$ after fixing $C_{\mathrm{rank}}$ large enough. If $\beta=0$, the output coordinate plane is contained in $W$, and \eqref{eq:rank-three-error} contradicts $|\lambda'|\ge c$. Otherwise write $\ell=t(\alpha,\beta)+r$, with $r\in W$ and $|r|=\|\ell|_W\|$. Projecting the output component onto $\beta^\perp$ gives $|\operatorname{proj}_{\beta^\perp}\lambda'|\le|r|$. Since $|\lambda'|\ge c$, this yields \[ \angle(\lambda',\{\beta,-\beta\})\le CL^3e^{-\rho H_f}. \] This contradicts the lower bound $ce^{-C_{\mathrm{sep}}H_c}$ from the coarse excision, by \eqref{eq:coarse-fine-condition}. Three independent vectors are therefore impossible as well. \end{proof} If a space of dimension at most two has a projection of rank at most one onto one coordinate plane, there are at most two possible primitive vectors at that endpoint. For each, the other endpoint lies on a convex norm circle of radius $O(L)$, with $O(L+1)$ integer points. Indeed, order these points cyclically along the convex boundary. The arc between consecutive points has length at least their Euclidean distance, which is at least one. Their number is therefore bounded by the perimeter, apart from the harmless cases of zero or one point. There are $O_A(\log^4L)$ fine sector pairs, so these degenerate blocks contribute $O_A(L\log^4L)=o_A(L^2)$ collisions. Every remaining two-dimensional space has both projections of rank two. It is the graph $w=Gv$ of a unique rational invertible matrix $G$, since it is spanned by integral vectors. Necessarily $G\notin K$. Lemma~\ref{lem:population} shows that the blocks with $\mathfrak J(G)>(\log L)^5$ have total population at most \begin{equation}\label{eq:large-complexity} O_A(L^2/\log L+L\log^4L)=o_A(L^2). \end{equation} \subsection{A second partition for complexity bands} For integers $j\ge1$, put $Q_j=2^j$ and \[ \mathcal G_j=\{G\in\GL(\Q)\setminus K: Q_j<\mathfrak J(G)\le2Q_j\}. \] We only need $j\le j_{\max}=\lceil5\log_2\log L\rceil$. There are at most $CQ_j^9$ candidates in a band. By Lemma~\ref{lem:population}, if the sum of two distinct graph planes in this band is three-dimensional, it has a primitive integral normal of length at most \begin{equation}\label{eq:band-normal} M_j=C_{\mathrm{band}}Q_j^6. \end{equation} Here $C_{\mathrm{band}}$ is a fixed positive constant. Indeed, choose three independent vectors from their integer spanning pairs of length $O(Q_j^2)$ and take their exterior product. Fix a sufficiently large integer $j_0$. For each $j_0\le j\le j_{\max}$, apply the excision lemma at coarse order $H_j=j^3$ with $M=M_j$, and remove also the rays of a fine fan of order $\lceil B_1j^3\rceil$. Here $B_1>1$ is fixed with \begin{equation}\label{eq:band-condition} \rho B_1>C_{\mathrm{sep}}+1. \end{equation} Since $\log(2+M_j)=O(j)$, all these extra deletions together cost at most \begin{equation}\label{eq:band-deletion} CL^2/j_0+O\bigl(L(\log\log L)^3+(\log\log L)^7\bigr). \end{equation} This follows by summing $C(L^2/j^2+Lj^2+j^6)$. As before, each fine sector with retained points lies in a retained coarse sector at that band. For this second partition, include all retained collisions on each candidate graph; this contains the blocks assigned by the first partition. For a fixed band and a pair of its fine sectors, call the retained collision block in the graph of $G\in\mathcal G_j$ large if its population is at least \begin{equation}\label{eq:large-block-threshold} L^2/Q_j^{20}. \end{equation} In the required range $Q_j\le C(\log L)^5$, \[ \sup_{j\le j_{\max}}\frac{Q_j^{20}}{L} \le C\frac{(\log L)^{100}}{L}\longrightarrow0. \] Thus one sufficiently large $L$ makes the threshold exceed every fixed multiple of $L$, simultaneously for all these bands. \begin{lemma}[A large block contains a well-spread pair]\label{lem:spread} The inputs of a large block contain two vectors with \begin{equation}\label{eq:large-determinant} |\det(v_1,v_2)|\ge L^2/(8Q_j^{20}), \end{equation} for all sufficiently large $L$, uniformly in $j\le j_{\max}$. \end{lemma} \begin{proof} Among the inputs choose a pair maximizing the absolute determinant $D$. A collinear primitive set has at most two points, so $D>0$. Every other input has coordinates in $[-1,1]^2$ in this basis, by maximality of $D$. Thus all inputs lie in a parallelogram of area $4D$ and perimeter $O(L)$. Their number is at most $4D+CL+C$. In view of \eqref{eq:large-block-threshold} and its uniform domination of $L$, inequality \eqref{eq:large-determinant} follows. \end{proof} \begin{lemma}[One large graph per sector pair]\label{lem:one-large} For all sufficiently large fixed $j_0$ and then all sufficiently large $L$, each band $j_0\le j\le j_{\max}$ and each pair of its fine sectors contain at most one large graph block. \end{lemma} \begin{proof} Choose supports $\lambda,\lambda'$ in the two fine sectors and write $\ell=(\lambda,-\lambda')$. For a large graph $G$, put $\theta_G=\lambda-\lambda'\circ G$. At the two points of Lemma~\ref{lem:spread}, the fine approximation gives $|\theta_G(v_i)|\le CLe^{-\rho B_1j^3}$. Their dual basis has length at most $CQ_j^{20}/L$, so \begin{equation}\label{eq:theta} |\theta_G|\le CQ_j^{20}e^{-\rho B_1j^3}. \end{equation} If two different large graphs occurred, their sum $W$ would have dimension $d=3$ or $4$. From their integer spanning vectors of length $O(Q_j^2)$ choose a basis for $W$. On each of these vectors the value of $\ell$ has absolute value at most $CQ_j^{22}e^{-\rho B_1j^3}$, by \eqref{eq:theta}. The integer $d$-volume is at least one, so the smallest singular value is at least $cQ_j^{-2(d-1)}$. Consequently \begin{equation}\label{eq:two-graph-error} \|\ell|_W\|\le CQ_j^{28}e^{-\rho B_1j^3}=:\eps_j. \end{equation} If $d=4$, this contradicts $|\ell|\ge c$ for sufficiently large $j$. If $d=3$, choose its primitive integral normal $(\alpha,\beta)$ as in \eqref{eq:band-normal}. Here $\beta\ne0$: otherwise a linear functional depending only on the input would vanish on a graph with full input projection and hence be zero. Projection onto this normal line and $|\lambda'|\ge c$ give \[ \angle(\lambda',\{\beta,-\beta\})\le C\eps_j. \] The band excision instead gives the lower bound $ce^{-C_{\mathrm{sep}}j^3}$. These contradict one another since \[ 2^{28j}e^{-(\rho B_1-C_{\mathrm{sep}})j^3}\longrightarrow0. \] One choice of $j_0$, depending only on the fixed geometry and $B_1$, suffices. \end{proof} There are $O(j^{12})$ fine sector pairs in band $j$. Summing the small-block bound over its $O(Q_j^9)$ candidate graphs gives $CL^2j^{12}Q_j^{-11}$. By Lemmas~\ref{lem:one-large} and \ref{lem:population}, the large blocks contribute at most $Cj^{12}(L^2Q_j^{-1}+L+1)$. Therefore all bands with $j\ge j_0$ together contribute at most \begin{equation}\label{eq:tail} CL^2\tau(j_0)+O\bigl(L(\log\log L)^{13}\bigr),\qquad \tau(j_0)=\sum_{j\ge j_0}j^{12}(2^{-11j}+2^{-j})\longrightarrow0. \end{equation} The set \[ \{G\in\GL(\Q)\setminus K:\mathfrak J(G)\le2^{j_0+1}\} \] is finite. Proposition~\ref{prop:fixed} gives a total contribution $o_{k,j_0}(L^2)$ from its members. \subsection{From collision bounds to excess} Let \[ \mathscr A(L)=\#\bigl(\{v\in\prim:N(v)\le L\}/K\bigr),\qquad \mathscr D(L)=\#\{N(v):v\in\prim,\ N(v)\le L\}. \] Define the excess $\mathscr E(L)=\mathscr A(L)-\mathscr D(L)$. Discard every complete $K$-orbit that meets the deleted set. If $d(L)$ primitive vectors were deleted, this discards at most $d(L)$ orbits. Deleting one orbit reduces the excess by at most one. All the remaining vectors satisfy the required geometric conditions. Within a retained norm fiber containing $r$ different $K$-orbits, the excess $r-1$ is bounded by the number of non-$K$ collision pairs. Consequently \[ \mathscr E(L)\le d(L)+\#\{\text{retained collisions}\}. \] The preceding estimates give \begin{equation}\label{eq:excess-limsup} \limsup_{L\to\infty}\frac{\mathscr E(L)}{L^2} \le C/A+C/j_0+C\tau(j_0). \end{equation} Here $L\to\infty$ with $A,j_0$ fixed, and the constant on the right is independent of $A,j_0$. Letting $A,j_0\to\infty$ gives \begin{equation}\label{eq:excess} \mathscr A(L)-\mathscr D(L)=o_k(L^2). \end{equation} \section{Completion of the proof}\label{sec:completion} The standard elementary primitive lattice count in a bounded convex body gives \begin{equation}\label{eq:primitive-count} \#(\prim\cap L\ball)=\frac{\area(\ball)}{\zeta(2)}L^2 +O_k(L\log(2+L)). \end{equation} Indeed, count all nonzero lattice points in $t\ball$ as $\area(\ball)t^2+O_k(t+1)$, and apply M\"obius inversion to their common coordinate divisor. With $\mu$ denoting the M\"obius function, the sums $\sum_{d\le CL}\mu(d)/d^2=1/\zeta(2)+O(1/L)$ and $\sum_{d\le CL}1/d=O(\log(2+L))$ give \eqref{eq:primitive-count}. Apart from finitely many primitive vectors, the $K$-action is free: any nonidentity element has its fixed vectors on finitely many lines, and each rational ray has just one primitive vector. Consequently \begin{equation}\label{eq:orbit-asymptotic} \mathscr A(L)=\frac{\area(\ball)}{12\zeta(2)}L^2+o_k(L^2). \end{equation} Combining this with \eqref{eq:excess} proves the same asymptotic for $\mathscr D(L)$. By Lemma~\ref{lem:tree}, a $K$-orbit corresponds to exactly one sorted positive solution, with largest coordinate $M_v$. The map \[ m\longmapsto\acosh\bigl((3(k+1)m-k)/2\bigr) \] is strictly increasing. Thus, with \begin{equation}\label{eq:height-conversion} L_k(H)=\acosh\bigl((3(k+1)H-k)/2\bigr) =\log H+\log(3(k+1))+o(1), \end{equation} we have exactly $T_k(H)=\mathscr A(L_k(H))$ and $D_k(H)=\mathscr D(L_k(H))$. Equations \eqref{eq:excess}--\eqref{eq:height-conversion} prove \eqref{eq:main} and \eqref{eq:constant}. Finally, \[ \#\{m\le H:r_k(m)\ge2\}\le T_k(H)-D_k(H), \qquad \sum_{\substack{m\le H\\r_k(m)\ge2}}r_k(m) \le2\bigl(T_k(H)-D_k(H)\bigr), \] because $r\le2(r-1)$ for integers $r\ge2$. This proves both density statements in Theorem~\ref{thm:main}. \qed \begin{thebibliography}{99} \bibitem{B} E. Banaian, \emph{Orderings on $k$-Markov numbers}, Ramanujan J. \textbf{71} (2026), Article 12. \href{https://doi.org/10.1007/s11139-026-01468-5}{doi:10.1007/s11139-026-01468-5}. \bibitem{BH} E. Banaian and M. Huang, \emph{Orderings of generalized $k$-Markov numbers}, preprint (2026), \href{https://arxiv.org/abs/2604.17445v1}{arXiv:2604.17445v1}. \bibitem{Baragar} A. Baragar, \emph{On the unicity conjecture for Markoff numbers}, Canad. Math. Bull. \textbf{39} (1996), no.~1, 3--9. \bibitem{BNRW} C. Burrin, A. Nevo, R. R\"uhr, and B. Weiss, \emph{Effective counting for discrete lattice orbits in the plane via Eisenstein series}, Enseign. Math. \textbf{66} (2020), no.~3--4, 259--304. The numbering cited here is that of \href{https://arxiv.org/abs/1905.01493v1}{arXiv:1905.01493v1}. \bibitem{Button} J. O. Button, \emph{The uniqueness of the prime Markoff numbers}, J. London Math. Soc. (2) \textbf{58} (1998), no.~1, 9--17. \bibitem{CH} Z. Chen and Y. Huang, \emph{Mutation-preserving generalized cluster algebras and Laurent mutation invariants}, preprint (2026), \href{https://arxiv.org/abs/2608.10551v3}{arXiv:2608.10551v3}. \bibitem{Chen} W. Y. Chen, \emph{Almost all Markoff numbers are unique}, preprint (2026), \href{https://hexagonmath.org/2610.00281v2}{Hexagon:2610.00281v2}. \bibitem{Cohn1955} H. Cohn, \emph{Approach to Markoff's minimal forms through modular functions}, Ann. of Math. (2) \textbf{61} (1955), no.~1, 1--12. \bibitem{Cohn1971} H. Cohn, \emph{Representation of Markoff's binary quadratic forms by geodesics on a perforated torus}, Acta Arith. \textbf{18} (1971), 125--136. \bibitem{Doan} N. M. Doan, \emph{Almost all simple lengths are unique up to isometry}, preprint (2026), \href{https://hexagonmath.org/2610.00298v1}{Hexagon:2610.00298v1}. \bibitem{Frobenius} G. Frobenius, \emph{\"Uber die Markoffschen Zahlen}, Sitzungsber. K\"onigl. Preuss. Akad. Wiss. Berlin (1913), 458--487. \bibitem{GM} Y. Gyoda and S. Maruyama, \emph{Uniqueness theorem of generalized Markov numbers that are prime powers}, Integers \textbf{26} (2026), A91. \href{https://doi.org/10.5281/zenodo.21678095}{doi:10.5281/zenodo.21678095}. \bibitem{GMats} Y. Gyoda and K. Matsushita, \emph{Generalization of Markov Diophantine equation via generalized cluster algebra}, Electron. J. Combin. \textbf{30} (2023), no.~4, P4.10, 20 pp. \href{https://doi.org/10.37236/11420}{doi:10.37236/11420}. \bibitem{LT} M. L. Lang and S. P. Tan, \emph{A simple proof of the Markoff conjecture for prime powers}, Geom. Dedicata \textbf{129} (2007), 15--22. \bibitem{Markoff1879} A. Markoff, \emph{Sur les formes quadratiques binaires ind\'efinies}, Math. Ann. \textbf{15} (1879), 381--406. \bibitem{Markoff1880} A. Markoff, \emph{Sur les formes quadratiques binaires ind\'efinies}, Math. Ann. \textbf{17} (1880), 379--399. \bibitem{MR} G. McShane and I. Rivin, \emph{A norm on homology of surfaces and counting simple geodesics}, Int. Math. Res. Not. (1995), no.~2, 61--69. \bibitem{Poonen} B. Poonen, \emph{$p$-adic interpolation of iterates}, Bull. Lond. Math. Soc. \textbf{46} (2014), no.~3, 525--527. \href{https://math.mit.edu/~poonen/papers/p-iteration.pdf}{Author's version}. \bibitem{Risager} M. S. Risager, \emph{Counting Markov triples and simple geodesics}, preprint (2026), \href{https://arxiv.org/abs/2610.36069v1}{arXiv:2610.36069v1}. \bibitem{Schmutz} P. Schmutz, \emph{Systoles of arithmetic surfaces and the Markoff spectrum}, Math. Ann. \textbf{305} (1996), 191--203. \bibitem{Tang} Q. Tang, \emph{Parameter monotonicity for generalized $k$-Markov numbers}, preprint (2026), \href{https://hexagonmath.org/2611.00023v1}{Hexagon:2611.00023v1}. \bibitem{Zagier} D. Zagier, \emph{On the number of Markoff numbers below a given bound}, Math. Comp. \textbf{39} (1982), no.~160, 709--723. \end{thebibliography} \end{document}