\documentclass[11pt]{amsart} \pdfsuppressptexinfo=-1 \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage[margin=1.1in]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{booktabs,enumitem,array,placeins} \usepackage[hidelinks]{hyperref} \raggedbottom \hypersetup{pdftitle={Certified upper bounds for two sum-difference exponents}, pdfauthor={Tejasvi Singh Tomar}} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newtheorem*{remark*}{Remark} \numberwithin{equation}{section} \setlength{\emergencystretch}{2em} \newcommand{\R}{\mathbb{R}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\Q}{\mathbb{Q}} \newcommand{\GG}{\mathbf{G}} \newcommand{\gp}{\mathbin{\overset{G}{+}}} \newcommand{\gm}{\mathbin{\overset{G}{-}}} \newcommand{\cl}{\operatorname{cl}} \newcommand{\KT}{\mathrm{KT}} \newcommand{\file}[1]{\texttt{#1}} %% Values that change when a certificate is replaced. %% BEGIN MACROS (values computed from the certificates) \newcommand{\CbFormsUsed}{41} \newcommand{\CbUp}{1.8272963} \newcommand{\CbFrac}{\frac{4\,785\,864\,240\,814\,563\,464\,816\,432\,634\,036\,471\,899}{2\,619\,096\,017\,836\,492\,522\,862\,695\,316\,182\,077\,572}} \newcommand{\CbLamXd}{\frac{925\,252\,334\,339\,885\,103\,560\,423\,126\,733\,856\,553}{1\,309\,548\,008\,918\,246\,261\,431\,347\,658\,091\,038\,786}} \newcommand{\CbLamYd}{\frac{424\,585\,766\,727\,935\,297\,449\,756\,583\,005\,066\,048}{654\,774\,004\,459\,123\,130\,715\,673\,829\,045\,519\,393}} \newcommand{\CbLamSd}{\frac{1\,237\,016\,505\,223\,052\,067\,896\,560\,048\,548\,494\,601}{2\,619\,096\,017\,836\,492\,522\,862\,695\,316\,182\,077\,572}} \newcommand{\CbLemMatusMax}{62} \newcommand{\CbLemDFZ}{5, 7, 8, 33, 35, 56, 60, 77, 107, 109} \newcommand{\CbDomain}{groups without $2$-torsion} \newcommand{\CbDiv}{$c=2^k$} \newcommand{\CgFormsUsed}{20} \newcommand{\CgSlash}{9\,213/5\,036} \newcommand{\CgUp}{1.8294282} \newcommand{\CgLamXd}{\frac{882}{1\,259}} \newcommand{\CgLamYd}{\frac{1\,609}{2\,518}} \newcommand{\CgLamSd}{\frac{2\,467}{5\,036}} \newcommand{\CrSlash}{841/459} \newcommand{\CrUp}{1.8322441} \newcommand{\LmLamFrac}{\frac{20\,486\,493\,787}{14\,418\,560\,416}} \newcommand{\LmLamUp}{1.42084184} \newcommand{\LmCaFrac}{\frac{26\,554\,427\,158}{20\,486\,493\,787}} \newcommand{\LmCaUp}{1.29619190} \newcommand{\LmBsum}{2} \newcommand{\LmDepth}{12} \newcommand{\LmWvars}{w,v,u} \newcommand{\LmWintro}{let $w$, $v$, $u$ be random variables of type $(1,0)$, that is, with law $\mu$} \newcommand{\LmWadd}{three further variables with the law of $X_1$} \newcommand{\LmDispA}{8\,959\,609\,957\,200\,L\le 13\,623\,518\,368\,355\,S\\ +115\,396\,751\,750\,h(0,1)+500\,183\,187\,638\,h(0,3)\\ +248\,591\,603\,812\,h(0,4)+900\,281\,603\,795\,h(1,2)\\ +967\,541\,424\,815\,h(2,1)+386\,723\,275\,812\,h(3,0)\\ +73\,889\,341\,268\,h(3,1)+156\,315\,592\,518\,h(4,0)\\ -115\,396\,751\,750\,h(0,2)-115\,396\,751\,750\,h(1,1)\\ -11\,215\,940\,128\,h(1,3)-3\,735\,646\,057\,220\,h(2,2)} \newcommand{\LmDispB}{628\,732\,719\,440\,L+115\,396\,751\,750\,h(0,1)\\ +500\,183\,187\,638\,h(0,3)+248\,591\,603\,812\,h(0,4)\\ +900\,281\,603\,795\,h(1,2)+967\,541\,424\,815\,h(2,1)\\ +386\,723\,275\,812\,h(3,0)+73\,889\,341\,268\,h(3,1)\\ +156\,315\,592\,518\,h(4,0)\\ \le 115\,396\,751\,750\,h(0,2)+115\,396\,751\,750\,h(1,1)\\ +11\,215\,940\,128\,h(1,3)+3\,735\,646\,057\,220\,h(2,2)} \newcommand{\LmHcount}{12} \newcommand{\LmABsumL}{9\,588\,342\,676\,640} \newcommand{\LmAS}{13\,623\,518\,368\,355} %% END MACROS \newcommand{\ZenodoDOI}{10.5281/zenodo.23716681} \newcommand{\RepoURL}{https://github.com/tejasvi/sum-difference-exponents/tree/v4} \begin{document} \title{Certified upper bounds for two sum-difference exponents} \author{Tejasvi Singh Tomar} \renewcommand{\urladdrname}{{\itshape ORCID}} \urladdr{\href{https://orcid.org/0000-0003-4668-3639}{https://orcid.org/0000-0003-4668-3639}} \subjclass[2020]{11B13, 11B30; 94A17, 90C05, 68V05} \keywords{Sumsets, difference sets, sum-difference exponents, arithmetic Kakeya conjecture, Shannon entropy, copy lemma, non-Shannon inequalities, linear programming, computer-assisted proof} \begin{abstract} For finite sets $A,B$ of real numbers and $G\subseteq A\times B$, Katz and Tao proved in 1999 that $\{a-b:(a,b)\in G\}$ has at most $N^{11/6}$ elements whenever $A$, $B$ and $\{a+b:(a,b)\in G\}$ have at most $N$ elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent $11/6$ to $1.8273$, and to $1.8295$ in every abelian group. We also prove $|X-Y|\le|X+Y|^{1.4209}$ for all finite sets $X,Y$ of integers, improving the exponent $1.4543$ of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from $1.3124$ to $1.2962$. Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean~4. \end{abstract} \maketitle \section{Introduction}\label{sec:intro} For finite subsets $A,B$ of an abelian group and $G\subseteq A\times B$ we write \[ A\gp B=\{a+b:(a,b)\in G\},\qquad A\gm B=\{a-b:(a,b)\in G\}. \] Bourgain \cite{Bou99} showed that bounds $|A\gm B|\le N^{2-\varepsilon}$, valid whenever $|A|,|B|,|A\gp B|\le N$, give lower bounds for the dimension of Kakeya sets, and he proved such a bound with $\varepsilon=1/13$. Katz and Tao \cite{KT99} proved it with $\varepsilon=1/6$ in any abelian group. The Kakeya bounds obtained in this way are no longer the best known in any dimension \cite[page 3b]{TaoC}. Let $C_{3b}$ be the least exponent $C$ such that \begin{equation}\label{eq:setform} |A\gm B|\le\max\bigl(|A|,|B|,|A\gp B|\bigr)^{C} \end{equation} for all finite $A,B\subset\R$ and $G\subseteq A\times B$. By \cite{GR19} (see also \cite[\S1]{Tao25}), $C_{3b}$ is also the least $C$ such that \begin{equation}\label{eq:entform} H(X-Y)\le C\max\bigl(H(X),H(Y),H(X+Y)\bigr) \end{equation} for all real random variables $X,Y$ with finitely many values, not necessarily independent, where $H$ denotes Shannon entropy. We prove our bounds in both forms (Lemma~\ref{lem:reduction}). The relation of $C_{3b}$ to the arithmetic Kakeya conjecture is discussed in \cite{KT02,GR19,Tao25}. The notation $C_{3b}$ is that of Tao's list of optimization constants \cite{TaoC}, where it is constant 3b, and $C_{3b}$ is also Problem~6.30 of \cite{GGTW25}. The upper bound $11/6=1.8333\ldots$ of \cite{KT99} is the best one recorded in these two sources, and the lower bounds recorded there are slightly above $1.7789$ \cite{Le15,MI26}. Farnamfar \cite{Fa26a,Fa26b} proves that several families of combinatorial constructions that certify upper bounds for $C_{3b}$ cannot improve $11/6$, and that an improving construction must have dimension at least three. The proof of Theorem~\ref{thm:3b} uses entropy inequalities instead of such constructions. \begin{theorem}\label{thm:3b} There are rational numbers $\lambda_X\approx0.706543$, $\lambda_Y\approx0.648446$ and $\lambda_S\approx0.472307$, given exactly in Appendix~\ref{app:const}, with sum less than $\CbUp$, such that the following hold. \begin{enumerate}[label=\textup{(\alph*)}] \item\label{thm:3b:ent} If $X,Y$ are random variables with finitely many values in a torsion-free abelian group, then $H(X-Y)\le\lambda_XH(X)+\lambda_YH(Y)+\lambda_SH(X+Y)$. \item\label{thm:3b:set} If $A,B$ are finite subsets of a torsion-free abelian group and $G\subseteq A\times B$, then $|A\gm B|\le|A|^{\lambda_X}|B|^{\lambda_Y}|A\gp B|^{\lambda_S}$. \end{enumerate} In particular $C_{3b}\le\CbUp$ in both formulations \eqref{eq:setform} and \eqref{eq:entform}. \end{theorem} \begin{theorem}\label{thm:3ball} Statements \ref{thm:3b:ent} and \ref{thm:3b:set} of Theorem~\ref{thm:3b} hold in all abelian groups with \[ (\lambda_X,\lambda_Y,\lambda_S)=\bigl(\CgLamXd,\CgLamYd,\CgLamSd\bigr), \] whose sum is $\CgSlash<\CgUp$. \end{theorem} For finite subsets $X,Y$ of an abelian group, Ruzsa's triangle inequality and Pl\"unnecke's inequality give $|X-Y|\le|X+Y|^{3/2}$ \cite[\S1]{GHR07}. Kleinwaks \cite[Theorem~2.1]{Kle26} proved the exponent $\lambda_\infty=(9451e-3286)/(5378e+787)=1.454277\ldots$ for finite subsets of any abelian group. Taking $X=Y$ shows that such an exponent is at least the single-set exponent of \cite[Problem~6.43]{GGTW25}, the least $C$ with $|A-A|\le|A+A|^{C}$ for all finite $A\subset\Z$, which lies between $\log(1+\sqrt2)/\log2=1.2715\ldots$ \cite{HRY99} and $4/3$ \cite{FP73}. Kleinwaks also proved that an exponent $\lambda$ valid for all finite $X,Y\subset\Z$ gives the bound $2-1/\lambda$ for the sum-difference constant $C_{3a}$ of Gyarmati, Hennecart and Ruzsa \cite[Theorem~2.2]{Kle26}. This constant is the supremum of the exponents $t$ for which there are finite sets $A,B\subset\Z$ with $B\ne\emptyset$, $|A|$ arbitrarily large, $|A+B|\le K|A|$ and $|A-B|\ge c|A+B|^{t}$ for some constants $K$ and $c>0$ \cite[page 3a]{TaoC}. It is Problem~6.44 of \cite{GGTW25}. The sources state its quantifiers differently, and Section~\ref{sec:transfer} compares the readings. Gyarmati, Hennecart and Ruzsa proved $C_{3a}\le4/3$ \cite[Corollary~3]{GHR07}, and Kleinwaks proved $C_{3a}\le2-1/\lambda_\infty=1.312373\ldots$ \cite[Corollary~2.3]{Kle26}. The lower bounds recorded in \cite[page 3a]{TaoC} reach $1.19102809$ with an explicit construction and $1.19519192$ as a limit of constructions. \begin{theorem}\label{thm:pair} For all finite subsets $X,Y$ of a torsion-free abelian group, \[ |X-Y|\le|X+Y|^{\lambda},\qquad \lambda=\LmLamFrac<\LmLamUp. \] \end{theorem} \begin{corollary}\label{cor:3a} \[ C_{3a}\le2-\frac1\lambda=\LmCaFrac<\LmCaUp. \] \end{corollary} \begin{remark}\label{rem:erdos} A set $A$ of $n$ integers determines at most $n^{\CbUp}$ distinct positive common differences of three-term arithmetic progressions. This improves the exponent $11/6$ of Katz and Tao \cite{KT99} for Erd\H{o}s problem \#1097, which asks how many such differences there can be. Chan observed that this problem is equivalent to the sums-differences question of Bourgain recalled above \cite{EP1097}. For the proof, choose for each such difference $d>0$ an $a_d$ with $a_d,a_d+d,a_d+2d\in A$, and let $G$ consist of the pairs $(a_d+2d,a_d)$. Their differences $2d$ are distinct, so $|A\gm A|$ is the number of such $d$, and their sums $2(a_d+d)$ lie in $\{2a:a\in A\}$, so $|A\gp A|\le n$. Part~\ref{thm:3b:set} of Theorem~\ref{thm:3b} with $B=A$ gives $|A\gm A|\le n^{\lambda_X+\lambda_Y+\lambda_S}\le n^{\CbUp}$. \end{remark} \subsection*{The method} Both proofs are entropy arguments in the style of \cite{Kle26}; entropy methods in additive combinatorics are developed in \cite{Ru09,Tao10}. For Theorems~\ref{thm:3b} and~\ref{thm:3ball} we take a random pair $(X,Y)$ such that $X-Y$ is injective on its support. Three applications of the copy lemma put six copies of the pair on one probability space. This configuration is a variant, in entropy form, of the one behind the bound $11/6$ of \cite{KT99}: in it \[ 6H(X,Y)=4H(X)+4H(Y)+3H(X+Y)-\Delta_\KT, \] where $\Delta_\KT\ge0$ is a sum of five mutual informations between coordinates and sums of the copies (Proposition~\ref{prop:kt}). An improvement of $11/6$ therefore amounts to a lower bound for $\Delta_\KT$ in terms of $H(X)$, $H(Y)$ and $H(X+Y)$. Integer combinations of the coordinates of the copies are random variables, and Shannon inequalities hold for their joint entropies. The forms $x$, $y$, $x+y$ and $x-y$ of a single copy $(x,y)$ do not suffice (Remark~\ref{rem:cross}). We call the other combinations \emph{cross forms}. They are new random variables built from several copies at once, and Shannon inequalities that involve them constrain the joint law of the copies in ways that the standard forms do not detect. For example, if two copies $(x_0,y_0)$ and $(x_2,y_0)$ share their second coordinate, then $x_0+y_0+x_2$ is a cross form. Shannon inequalities among five cross forms already bound $\Delta_\KT$ from below and give the exponent $\CrSlash<11/6$ in every abelian group (Appendix~\ref{app:short}). For a fixed finite set of cross forms, a linear program finds a nonnegative combination that bounds $H(X,Y)$ by $\lambda_XH(X)+\lambda_YH(Y)+\lambda_SH(X+Y)$; it combines Shannon inequalities, the identities given by the copy lemma and non-Shannon inequalities, each of the latter proved from the copy lemma. We call such a combination a \emph{certificate}. Linear programs over linear forms of glued copies of a random pair, with copy-lemma variables, were used before in \cite{MI26L} for the Katz--Tao problem with many slopes. With $\CbFormsUsed$ cross forms this gives Theorem~\ref{thm:3b}, and without non-Shannon inequalities $\CgFormsUsed$ cross forms give Theorem~\ref{thm:3ball}. For Theorem~\ref{thm:pair} we start from Kleinwaks' coupling, a random pair $(X_1,Y_1)$ uniform on a set $\Gamma\subseteq X\times Y$ with one pair for each element of $X-Y$. Kleinwaks uses two independent copies of this pair and the entropies $h(i,j)$ of sums of independent copies of its marginals. We add \LmWadd, independent of the two copies and of each other. Besides symmetries of the whole configuration, we use partial symmetries and partial reflections, which act only on the independent blocks that occur in a set of forms (Section~\ref{sec:conf2}). Shannon inequalities among integer combinations of these coordinates give an inequality between $\log|X-Y|$, $\log|X+Y|$ and $\LmHcount$ values of $h$ (Proposition~\ref{prop:config}). Finitely many of Kleinwaks' inequalities for $h$ eliminate these values (Lemma~\ref{lem:grid}). With the two copies alone, only sums of at most two coordinates are identified with values of $h$; the added variables bring in sums of up to five independent variables (Remark~\ref{rem:w}). Unlike the two-copy inequality of \cite[Proposition~5.1]{Kle26}, which uses ten instances of the non-Shannon families of Mat\'u\v{s} \cite{Mat07} and of Csirmaz and Csirmaz \cite{CC26}, our certificate uses only Shannon inequalities. We do not know how far larger configurations, more cross forms or further non-Shannon inequalities can lower the two exponents. \subsection*{Verification} The weights in the certificates are exact rational numbers, obtained from floating-point solutions of the linear programs. Section~\ref{sec:verify} describes how each certificate is verified in exact rational arithmetic by two independently written checkers and how the results above are proved in Lean~4. Section~\ref{sec:tools} collects the entropy tools. Section~\ref{sec:3b} proves Theorems~\ref{thm:3b} and~\ref{thm:3ball}, and Section~\ref{sec:pair} proves Theorem~\ref{thm:pair} and Corollary~\ref{cor:3a}, including a proof of Kleinwaks' transfer theorem. Appendix~\ref{app:short} works through the short certificate. \section{Entropy tools}\label{sec:tools} All random variables below take finitely many values and are defined on a common probability space, which we enlarge when we construct new variables. We write $H$ for Shannon entropy with the natural logarithm, treat a tuple of random variables as one random variable, and put \[ I(U;V\mid W)=H(U,W)+H(V,W)-H(U,V,W)-H(W),\qquad I(U;V)=I(U;V\mid\emptyset). \] We use Shannon's inequality $I(U;V\mid W)\ge0$, the inequality $H(f(U))\le H(U)$ for any function $f$, with equality if $f$ is injective on the range of $U$, and the identity $H(U,V)=H(U)+H(V)$ for independent $U$ and $V$. \begin{lemma}[copy lemma {\cite{ZY98,DFZ11}}]\label{lem:copy} Let $A,B,C$ be random variables. On an enlarged probability space there is a random variable $A'$ such that $(A',B)$ has the law of $(A,B)$ and $A'$ is conditionally independent of $(A,C)$ given $B$. In particular \[ H(A',A,B,C)+H(B)=H(A,B,C)+H(A',B). \] \end{lemma} \begin{proof} Put $P(A=a,B=b,C=c,A'=a')=P(A=a,B=b,C=c)\,P(A=a'\mid B=b)$ for all $b$ with $P(B=b)>0$. This law extends the law of $(A,B,C)$, the pair $(A',B)$ has the law of $(A,B)$, and the conditional law of $A'$ given $(A,B,C)$ depends on $B$ only. \end{proof} Every relation that holds almost surely between $A$ and $B$ therefore holds between $A'$ and $B$. For random variables $a,b,c,d$ let \[ [abcd]=I(a;b\mid c)+I(a;b\mid d)+I(c;d)-I(a;b) \] be the Ingleton expression. \begin{lemma}\label{lem:copyineq} Let $a_1,\dots,a_r$ be random variables and let $\psi=\sum_Sc_SH(a_S)$, where $S$ runs over the nonempty subsets of $\{1,\dots,r\}$ and $a_S=(a_i)_{i\in S}$. Suppose that random variables $b_1,\dots,b_q$ are obtained from $a_1,\dots,a_r$ by successive applications of Lemma~\ref{lem:copy}, and that $\psi$ is identically, as a linear combination of entropies, the sum of nonnegative multiples of Shannon inequalities and of inequalities that hold for all random variables, applied to joint variables made of the $a_i$ and $b_j$, and of a linear combination of the identities given by these applications: the identity of Lemma~\ref{lem:copy} and the equalities of entropies that follow from the equality of the laws of $(A',B)$ and $(A,B)$. Then $\psi\ge0$ for all random variables $a_1,\dots,a_r$. \end{lemma} \begin{proof} The applications of Lemma~\ref{lem:copy} do not change the joint law of $a_1,\dots,a_r$. At the constructed variables the identities vanish and the remaining terms are nonnegative. \end{proof} Dougherty, Freiling and Zeger prove the inequalities of their list \cite[Section~VIII]{DFZ11} in this way. Mat\'u\v{s}'s inequality \[ M_s(a,b,c,d)=I(b;c\mid a)+s\,[abcd]+\tbinom{s+1}{2}\bigl(I(a;c\mid b)+I(a;b\mid c)\bigr)\ge0 \] \cite[Corollary~3, formula~(4)]{Mat07} follows for each $s\ge1$ from the case $s-1$ by Lemma~\ref{lem:copyineq}, with one copy of $a$ over $(b,c)$ \cite[(80) and Rule~{[1]}]{DFZ11}. \subsection{Linear forms and closures}\label{sec:closure} Let $\GG$ be an abelian group, let $Z=(Z_1,\dots,Z_m)$ be a random vector in $\GG^m$, and let $\mathcal R\subseteq\Z^m$ be a set of integer vectors $r$ with $\sum_ir_iZ_i=0$ almost surely. A \emph{form} is a vector $f\in\Z^m$, which defines the random variable $f(Z)=\sum_if_iZ_i$. For a finite set $F$ of forms, $H[F]$ denotes the entropy of the tuple $(f(Z))_{f\in F}$, and $\langle F\rangle$ denotes the subgroup of $\Z^m$ generated by $F$ and $\mathcal R$. \begin{lemma}\label{lem:closure} Let $F$ be a finite set of forms and let $f$ be a form. \begin{enumerate}[label=\textup{(\alph*)}] \item\label{cl:span} If $f\in\langle F\rangle$, then $f(Z)$ is a function of $(g(Z))_{g\in F}$. \item\label{cl:div} If $cf\in\langle F\rangle$ for an integer $c\ne0$ such that $u\mapsto cu$ is injective on $\GG$, then $f(Z)$ is a function of $(g(Z))_{g\in F}$. \item\label{cl:inj} Let $x,y$ be forms such that $(x(Z),y(Z))$ lies almost surely in a set on which $(u,v)\mapsto u-v$ is injective. If $(x-y)(Z)$ is a function of $(g(Z))_{g\in F}$, then so are $x(Z)$ and $y(Z)$. \end{enumerate} \end{lemma} \begin{proof} For \ref{cl:span} write $f=\sum_{g\in F}a_gg+r$ with $r$ in the subgroup generated by $\mathcal R$, so that $f(Z)=\sum_ga_gg(Z)$ almost surely. For \ref{cl:div}, $cf(Z)$ is a function of $(g(Z))_{g\in F}$ by \ref{cl:span}, and $u\mapsto cu$ is injective. Part \ref{cl:inj} is immediate. \end{proof} Fix a finite ground set $E$ of forms and a list of pairs $(x,y)$ as in \ref{cl:inj}. The \emph{closure} $\cl F$ of $F\subseteq E$ is the smallest subset of $E$ that contains $F$ and is closed under the rules \ref{cl:span}--\ref{cl:inj}, where \ref{cl:div} is used exactly for the integers $c\ne0$ for which $u\mapsto cu$ is injective on $\GG$, for example for all $c\ne0$ if $\GG$ is torsion-free. By Lemma~\ref{lem:closure}, $H[\cl F]=H[F]$. \section{The Kakeya-type exponent}\label{sec:3b} \subsection{Reduction to injective pairs} A pair $(X,Y)$ of random variables in an abelian group is \emph{injective} if $(x,y)\mapsto x-y$ is injective on the support of $(X,Y)$. Then $H(X,Y)=H(X-Y)$. \begin{lemma}\label{lem:reduction} Let $\GG$ be an abelian group and $\lambda_X,\lambda_Y,\lambda_S\ge0$. Suppose that \begin{equation}\label{eq:inj} H(X,Y)\le\lambda_XH(X)+\lambda_YH(Y)+\lambda_SH(X+Y) \end{equation} for every injective pair $(X,Y)$ in $\GG$. Then \begin{enumerate}[label=\textup{(\alph*)}] \item\label{red:ent} $H(X-Y)\le\lambda_XH(X)+\lambda_YH(Y)+\lambda_SH(X+Y)$ for all pairs $(X,Y)$ in $\GG$, and \item\label{red:set} $|A\gm B|\le|A|^{\lambda_X}|B|^{\lambda_Y}|A\gp B|^{\lambda_S}$ for all finite $A,B\subseteq\GG$ and $G\subseteq A\times B$. \end{enumerate} \end{lemma} \begin{proof} \ref{red:set} We may assume $G\ne\emptyset$. Choose $G'\subseteq G$ with exactly one pair $(a,b)$ satisfying $a-b=z$ for each $z\in A\gm B$, and let $(X,Y)$ be uniform on $G'$. This pair is injective, $H(X,Y)=\log|G'|=\log|A\gm B|$, and $X$, $Y$, $X+Y$ take values in $A$, $B$, $A\gp B$. Since a random variable with values in a finite set $T$ has entropy at most $\log|T|$, \ref{red:set} follows from \eqref{eq:inj}. \ref{red:ent} We use the construction in the proof of \cite[Proposition~3.6]{Tao25}. Let $D=X-Y$. For each $z$ in the range of $D$ choose a random pair $\varphi(z)$ with the conditional law of $(X,Y)$ given $D=z$, independently for different $z$ and independently of $(X,Y)$, and put $(X',Y')=\varphi(D)$. Given $D=z$, both $(X,Y)$ and $(X',Y')$ have the conditional law of $(X,Y)$ given $D=z$, so $(X',Y')$ has the law of $(X,Y)$, and $X'-Y'=D$. For a value $\varphi_0$ of $\varphi$, the conditional law of $(X',Y')$ given $\varphi=\varphi_0$ is the law of $\varphi_0(D)$, which is supported on points with distinct differences, so \eqref{eq:inj} applies to it. Averaging over $\varphi_0$ gives \begin{align*} H(X',Y'\mid\varphi)&\le\lambda_XH(X'\mid\varphi)+\lambda_YH(Y'\mid\varphi)+\lambda_SH(X'+Y'\mid\varphi)\\ &\le\lambda_XH(X)+\lambda_YH(Y)+\lambda_SH(X+Y), \end{align*} because conditioning does not increase entropy. Given $\varphi$, the pair $\varphi(D)$ and $D$ determine each other, so $H(X',Y'\mid\varphi)=H(D\mid\varphi)=H(D)$, since $\varphi$ is independent of $D$. \end{proof} With $C=\lambda_X+\lambda_Y+\lambda_S$, Lemma~\ref{lem:reduction} gives \eqref{eq:setform} and \eqref{eq:entform} with this $C$ for subsets and random variables of $\GG$. \subsection{The configuration}\label{sec:config} Let $(X,Y)$ be an injective pair in an abelian group $\GG$. We construct six pairs $g_v=(x_v,y_v)$, $0\le v\le5$, each with the law of $(X,Y)$, by three applications of Lemma~\ref{lem:copy}, starting from $g_0=(X,Y)$: \begin{enumerate}[label=(S\arabic*)] \item\label{S1} $g_1$ is a copy of $g_0$ over $x_0$; \item\label{S2} $(g_2,g_3)$ is a copy of $(g_0,g_1)$ over $(y_0,y_1)$; \item\label{S3} $(g_4,g_5)$ is a copy of $(g_0,g_1)$ over $(x_0+y_0,y_1)$. \end{enumerate} In each step, Lemma~\ref{lem:copy} is applied with $A$ the tuple $U$ of pairs to be copied, $B$ the tuple $V$ of variables it is copied over, and $C$ the pairs constructed before. The new pairs satisfy the relations that $U$ satisfies with $V$: \[ x_1=x_0;\qquad y_2=y_0,\ y_3=y_1,\ x_3=x_2;\qquad x_4+y_4=x_0+y_0,\ y_5=y_1,\ x_5=x_4 \] almost surely. Hence all twelve coordinates are integer combinations of the five \emph{free coordinates} $x_0,y_0,y_1,x_2,x_4$: \begin{equation}\label{eq:config} \begin{aligned} &g_0=(x_0,y_0),\qquad g_1=(x_0,y_1),\qquad g_2=(x_2,y_0),\\ &g_3=(x_2,y_1),\qquad g_4=(x_4,x_0+y_0-x_4),\qquad g_5=(x_4,y_1). \end{aligned} \end{equation} We apply Section~\ref{sec:closure} to the vector $Z\in\GG^{12}$ of all coordinates, with $\mathcal R$ the seven relations above, so that forms are integer combinations of the free coordinates. The \emph{standard forms} are $ax_v+by_v$ with $(a,b)\in\{(1,0),(0,1),(1,1),(1,-1)\}$ and $0\le v\le5$. All other forms are \emph{cross forms}. We write $s_v=x_v+y_v$ and $d_v=x_v-y_v$. The construction gives three further rules. \begin{enumerate}[label=(\textsc{\roman*})] \item[(CI)] For each step, with $O$ the pairs constructed before it, $U'$ the new pairs and $V$ the variables copied over, $H(V,U')+H(O)=H(O,U')+H(V)$. This is the identity of Lemma~\ref{lem:copy}. \item[(EL)] For each step and each set $S$ of standard forms of the pairs in $U$ and variables in $V$, $H[S]=H[\tau S]$, where $\tau$ replaces each pair of $U$ by its copy and fixes $V$. This holds because $(U',V)$ has the law of $(U,V)$. \item[(INJ)] Rule \ref{cl:inj} of Lemma~\ref{lem:closure} applies to $(x_v,y_v)$ for $0\le v\le5$, because $g_v$ has the law of the injective pair $(X,Y)$. \end{enumerate} \begin{proposition}\label{prop:kt} Let $a=H(X)$, $b=H(Y)$ and $c=H(X+Y)$. In the configuration \eqref{eq:config}, \[ 6H(X,Y)=4a+4b+3c-\Delta_\KT, \] where \[ \Delta_\KT=I(y_0;y_1)+I(s_0;y_1)+I\bigl(x_0;(s_3,s_5,y_4)\bigr)+I(s_3;y_4)+I\bigl(s_5;(s_3,y_4)\bigr)\ge0. \] In particular $H(X,Y)\le\tfrac23H(X)+\tfrac23H(Y)+\tfrac12H(X+Y)$ for all injective pairs in all abelian groups. \end{proposition} \begin{proof} Let $L=H(X,Y)$ and $\Omega=(x_0,y_0,y_1,x_2,x_4)$. In step \ref{S1}, (CI) and $H(x_0,g_1)=H(g_1)=L$ give $H(g_0,g_1)=2L-a$. In step \ref{S2}, $H(y_0,y_1,g_2,g_3)=H(g_2,g_3)=H(g_0,g_1)$ by the relations and (EL), so (CI) gives $H(g_0,\dots,g_3)=2H(g_0,g_1)-H(y_0,y_1)$. In the same way step \ref{S3} gives $H(\Omega)=H(g_0,\dots,g_3)+H(g_0,g_1)-H(s_0,y_1)$. Hence \[ H(\Omega)=6L-3a-H(y_0,y_1)-H(s_0,y_1). \] On the other hand $(s_3-s_5)+(x_0-y_4)=x_2-y_0=d_2$, so by (INJ) the forms $x_0,s_3,s_5,y_4$ determine $x_2$ and $y_0$, then $x_4=x_2-s_3+s_5$ and $y_1=s_5-x_4$. Thus $H(\Omega)=H(x_0,s_3,s_5,y_4)$. The pairs $g_1,g_3,g_4,g_5$ have the law of $(X,Y)$, so $H(y_1)=H(y_4)=b$ and $H(s_3)=H(s_5)=c$, and expanding the five terms gives \[ \Delta_\KT=\bigl(2b-H(y_0,y_1)\bigr)+\bigl(b+c-H(s_0,y_1)\bigr)+\bigl(a+b+2c-H(x_0,s_3,s_5,y_4)\bigr). \] Comparing the two expressions for $H(\Omega)$, we obtain the identity. No step uses rule \ref{cl:div}, so the argument is valid in every abelian group. \end{proof} Combined with Lemma~\ref{lem:reduction}, Proposition~\ref{prop:kt} yields the exponent $11/6$. It adapts the counting argument in \cite[\S3]{KT99} to entropy. \subsection{Certificates}\label{sec:lp} Fix a finite set $E$ of cross forms and take as ground set the standard forms together with $E$, with the pairs $(x_v,y_v)$ in rule \ref{cl:inj}. Consider the linear program with one variable $h(F)$ for each closed set $F$ and $h(\emptyset)=0$, which maximizes $h(\cl\{x_0,y_0\})$ subject to the following constraints, where $K$ runs over closed sets and $i,j$ over the ground set: \begin{enumerate}[label=(\roman*)] \item\label{lp:sh} $h(\cl(K\cup\{i\}))+h(\cl(K\cup\{j\}))-h(\cl(K\cup\{i,j\}))-h(K)\ge0$ and $h(\cl(K\cup\{i\}))-h(K)\ge0$; \item\label{lp:ci} the three identities (CI); \item\label{lp:el} $h(\cl S)=h(\cl\tau S)$ for the identifications (EL); \item\label{lp:matus} instances of inequalities proved by Lemma~\ref{lem:copyineq} for joint variables made of closed sets, each with its proof, where the joint entropy of several closed sets is $h$ of the closure of their union; \item\label{lp:norm} $h(\cl\{x_0\})\le1$, $h(\cl\{y_0\})\le1$ and $h(\cl\{x_0+y_0\})\le1$. \end{enumerate} For every injective pair with $\max(a,b,c)>0$, the vector $F\mapsto H[F]/\max(a,b,c)$ is feasible. A \emph{certificate} consists of a set $E$, the identifications \ref{lp:el} that it uses, a finite list of rows $R_k$ of types \ref{lp:sh}, \ref{lp:ci} and \ref{lp:matus} with rational multipliers $\mu_k$, nonnegative except on rows of type \ref{lp:ci}, and rational numbers $\lambda_X,\lambda_Y,\lambda_S\ge0$, such that \begin{equation}\label{eq:identity} h(\cl\{x_0,y_0\})+\sum_k\mu_kR_k=\lambda_X\,h(\cl\{x_0\})+\lambda_Y\,h(\cl\{y_0\})+\lambda_S\,h(\cl\{x_0+y_0\}) \end{equation} holds identically in the variables $h$ after the identifications \ref{lp:el}. At the entropy vector of an injective pair the rows of types \ref{lp:sh} and \ref{lp:matus} are nonnegative and the rows of type \ref{lp:ci} vanish, so \eqref{eq:inj} follows from \eqref{eq:identity}. We solve the linear programs with HiGHS \cite{HiGHS} in floating point. Rows of type \ref{lp:matus} are added when the current optimum violates them. For the certificate we keep the rows whose floating-point multipliers exceed a tolerance and solve the dual equations on these rows exactly over $\Q$. \subsection{Proofs of Theorems \ref{thm:3b} and \ref{thm:3ball}} \begin{proof}[Proof of Theorem~\ref{thm:3b}] The certificate for Theorem~\ref{thm:3b} \cite{Cert} uses the configuration \eqref{eq:config}, $\CbFormsUsed$ cross forms and identifications (EL). Its rows are inequalities of both kinds in \ref{lp:sh}, the identities (CI) and applications of the inequalities that the certificate proves by Lemma~\ref{lem:copyineq}. Its coefficients are the numbers $\lambda_X,\lambda_Y,\lambda_S$ of Theorem~\ref{thm:3b}, and the weighted rows satisfy \eqref{eq:identity}. The closures use rule \ref{cl:div} of Lemma~\ref{lem:closure}, so \eqref{eq:inj} holds for injective pairs in torsion-free groups, and Lemma~\ref{lem:reduction} gives \ref{thm:3b:ent} and \ref{thm:3b:set}. Since $\R$ is torsion-free, $C_{3b}\le\lambda_X+\lambda_Y+\lambda_S$. The proved inequalities include Mat\'u\v{s}'s inequality for $s\le\CbLemMatusMax$ and the inequalities numbered \CbLemDFZ\ in \cite[Section~VIII]{DFZ11}, so the proof uses only Shannon inequalities and Lemma~\ref{lem:copy}.\end{proof} \begin{remark}\label{rem:s30} This certificate applies rule \ref{cl:div} with \CbDiv\ only, so Theorem~\ref{thm:3b} holds in all abelian \CbDomain. \end{remark} \begin{remark}\label{rem:weight} Among the Shannon inequalities of the certificate for Theorem~\ref{thm:3b}, which all have unit coefficients on their entropies, the largest total multipliers fall on those that contain the cross forms $y_0-x_4$, $x_0-x_2-x_4$, $x_0+y_1+x_2$ and $x_0-x_2$. The first and the third of these are among the five cross forms of Appendix~\ref{app:short}, all of which occur in the certificate. \end{remark} \begin{proof}[Proof of Theorem~\ref{thm:3ball}] The certificate for Theorem~\ref{thm:3ball} \cite{Cert} combines inequalities of type \ref{lp:sh} with the identities (CI), after identifications (EL), and uses no row of type \ref{lp:matus}. Its coefficients $\lambda$ are those of Theorem~\ref{thm:3ball}. For each set of forms in it, the closure with rule \ref{cl:div} equals the closure without it, and the relations of Section~\ref{sec:config} have integer coefficients. Hence the rules it uses are valid in any abelian group, and Lemma~\ref{lem:reduction} applies. \end{proof} \begin{remark}\label{rem:cross} Cross forms are what make the improvement possible: on the configuration \eqref{eq:config} with standard forms only, the floating-point optimum of the linear program with constraints \ref{lp:sh}, \ref{lp:ci}, \ref{lp:el} and \ref{lp:norm} is $11/6$, the value of Proposition~\ref{prop:kt}. Adding to the ground set any three of the $65$ forms with coefficients $\pm1$ on at most three free coordinates does not lower this optimum, while the five cross forms of Appendix~\ref{app:short} do. \end{remark} \section{The two-set exponent}\label{sec:pair} \subsection{Kleinwaks' setting}\label{sec:kl} Let $X,Y\subset\Z$ be finite and nonempty. Choose $\Gamma\subseteq X\times Y$ with exactly one pair $(x,y)$ satisfying $x-y=z$ for each $z\in X-Y$ \cite[Lemma~4.1]{Kle26}, let $(X_1,Y_1)$ be uniform on $\Gamma$, and let $\mu$ and $\nu$ be the laws of $X_1$ and $Y_1$. Put \[ L=\log|X-Y|=H(X_1,Y_1),\qquad S=\log|X+Y|,\qquad h(i,j)=H(\mu^{*i}*\nu^{*j})\quad(i,j\ge0), \] where $\alpha*\beta$ is the law of $U+V$ for independent $U\sim\alpha$, $V\sim\beta$, and $H$ of a law is the entropy of a random variable with that law. Kleinwaks proved \cite[Lemmas~4.2 and~4.3]{Kle26} that for all $i,j\ge0$ \begin{enumerate}[label=(G\arabic*)] \item\label{G1} $h(i+2,j)+h(i,j)\le2h(i+1,j)$ and $h(i,j+2)+h(i,j)\le2h(i,j+1)$; \item\label{G2} $h(i,j)\le h(i+1,j)$, $h(i,j)\le h(i,j+1)$ and $h(i,j)\ge0$; \item\label{G3} $L+h(i,j)\le h(i+1,j)+h(i,j+1)$; \item\label{G4} $h(1,1)\le S$. \end{enumerate} Here \ref{G1} is Madiman's inequality for sums of independent variables \cite{Mad08}, and \ref{G3} holds because $(X_1+V,Y_1+V)$ determines $(X_1,Y_1,V)$ for $V$ independent of $(X_1,Y_1)$, as $x-y$ determines $(x,y)$ on $\Gamma$. \subsection{The configuration}\label{sec:conf2} Let $D_0=(x_0,y_0)$ and $D_1=(x_1,y_1)$ be independent copies of $(X_1,Y_1)$, and \LmWintro, such that $D_0$, $D_1$ and the variables in $\mathcal W=\{\LmWvars\}$ are mutually independent. We call $D_0$, $D_1$ and the variables in $\mathcal W$ the \emph{blocks} of the configuration. Each variable in $\mathcal W$ carries a \emph{type} $(i,j)$, given with the configuration, and has law $\mu^{*i}*\nu^{*j}$. We apply Section~\ref{sec:closure} to the vector $Z$ of the coordinates $x_0,y_0,x_1,y_1$ and the variables in $\mathcal W$, with $\mathcal R=\emptyset$, so that forms are integer combinations of these coordinates. The following rules hold. \begin{enumerate}[label=(R\arabic*)] \item\label{R1} Closure: rules \ref{cl:span}--\ref{cl:inj} of Lemma~\ref{lem:closure}, with \ref{cl:inj} for the pairs $(x_k,y_k)$, $k=0,1$. \item\label{R2} Independence: the joint entropy of $D_0,D_1$ and the variables in $\mathcal W$ is the sum of their entropies. \item\label{R3} Symmetry: $H[F]=H[\tau F]$ for all sets $F$ of forms and all permutations $\tau$ of the coordinates that map the pairs $D_0,D_1$ to $D_0,D_1$ (with $x$ to $x$ and $y$ to $y$) and each variable in $\mathcal W$ to a variable in $\mathcal W$ of the same type. \item\label{R4} $H(x_k,y_k)=L$ for $k=0,1$. \item\label{R5} Grid identification: if $f=\sum_{k\in I}x_k+\sum_{k\in J}y_k+\sum_{u\in U}u$ with $I\cap J=\emptyset$ and $U\subseteq\mathcal W$, then $H(f)=h(i,j)$, where $(i,j)$ is $(|I|,|J|)$ plus the sum of the types of the variables in $U$. \item\label{R6} Support: $H(a+b)\le S$ if $a$ is one of $x_0,x_1$ or a variable in $\mathcal W$ of type $(1,0)$, and $b$ is one of $y_0,y_1$ or a variable in $\mathcal W$ of type $(0,1)$. \end{enumerate} Rule \ref{R1} holds because $\Z$ is torsion-free and $(x_k,y_k)\in\Gamma$. Rule \ref{R3} holds since $D_0$ and $D_1$ are independent copies of one pair, variables in $\mathcal W$ of the same type are independent copies of one variable, and all of them are independent. Rule \ref{R5} holds because $f$ is a sum of independent variables, each with law $\mu$ or $\nu$ or one of the laws of the variables in $\mathcal W$. Differences such as $w-v$, however, are not identified with entries of $h$. Rule \ref{R6} holds because $x_k$ and variables of type $(1,0)$ take values in $X$, while $y_l$ and variables of type $(0,1)$ take values in $Y$. Without $\mathcal W$ and without rule \ref{cl:div}, rules \ref{R1}--\ref{R6} correspond to the rules (R1)--(R7) of \cite[\S4.3]{Kle26}. \begin{enumerate}[label=(R\arabic*),resume] \item\label{R7} Reflection: $\Gamma'=\{(-y,-x):(x,y)\in\Gamma\}$ is a subset of $(-Y)\times(-X)$ with distinct differences, $|\Gamma'|=|X-Y|$ and $|(-Y)+(-X)|=|X+Y|$. Its marginals are the reflections of $\nu$ and $\mu$, so the numbers attached to $\Gamma'$ are $L$, $S$ and $h'(i,j)=h(j,i)$ \cite[proof of Corollary~5.3]{Kle26}. Hence \ref{R1}--\ref{R6} also hold for the configuration built from $\Gamma'$, in which a variable of type $(i,j)$ has law $\mu'^{*i}*\nu'^{*j}$ for the marginals $\mu',\nu'$ of $\Gamma'$, with $h(i,j)$ replaced by $h(j,i)$ in \ref{R5}. \item\label{R9} Partial symmetry: $H[\tau F]=H[F]$ for each set $F$ of forms and each permutation $\tau$ of the coordinates that maps the coordinates of each block that occur in $F$ into a single block, different blocks into different blocks, and preserves laws in the following sense. If both $x_k$ and $y_k$ occur in $F$, then $\tau(x_k)=x_m$ and $\tau(y_k)=y_m$ for some $m$. A coordinate that occurs alone in its block is mapped to one of the same law: $x_k$ and variables of type $(1,0)$, which have law $\mu$, to some $x_m$ or to a variable of type $(1,0)$; $y_k$ and variables of type $(0,1)$, which have law $\nu$, to some $y_m$ or to a variable of type $(0,1)$; and other variables in $\mathcal W$ to variables of the same type. The rule holds because the blocks are independent, so the coordinates that occur in $F$ and their images under $\tau$ have the same joint law, namely the product of the laws of the pairs and of the single coordinates. The same holds in the configuration built from $\Gamma'$, with the laws $\mu'$, $\nu'$ of its marginals in place of $\mu$, $\nu$. \item\label{R10} Partial reflection: $H'[F]=H[\sigma F]$ for each set $F$ of forms of the configuration built from $\Gamma'$, where $H'$ is entropy in that configuration and $\sigma$ substitutes $c\mapsto-\tau(c)$ for the coordinates $c$ that occur in $F$. Here $\tau$ maps the coordinates of each block of the reflected configuration that occur in $F$ into a single block of the configuration built from $\Gamma$, different blocks into different blocks, as follows. If both $x'_k$ and $y'_k$ occur, then $\tau(x'_k)=y_m$ and $\tau(y'_k)=x_m$ for some $m$. A coordinate that occurs alone in its block is mapped to one of the transposed law: $x'_k$ and variables of type $(1,0)$ to some $y_m$ or to a variable of type $(0,1)$; $y'_k$ and variables of type $(0,1)$ to some $x_m$ or to a variable of type $(1,0)$; and a variable of type $(i,j)$ to a variable of type $(j,i)$. The rule holds because $(x'_k,y'_k)$ has the law of $(-y_m,-x_m)$, so that $x'_k$ has the law of $-y_m$ and $y'_k$ that of $-x_m$, because a variable of type $(i,j)$ in the reflected configuration has the law of $-u$ for $u$ of type $(j,i)$, and because in both configurations the blocks are independent.\end{enumerate} \subsection{Proof of Theorem \ref{thm:pair}} \begin{proposition}\label{prop:config} In the setting of Section~\ref{sec:kl}, \begin{multline*} \LmDispA. \end{multline*} \end{proposition} \begin{proof} The certificate for Theorem~\ref{thm:pair} \cite{Cert} lists instances of the rules of Section~\ref{sec:conf2} with rational multipliers, each for the configuration of $\Gamma$ or of $\Gamma'$. Besides Shannon inequalities among joint entropies of forms and $\LmBsum$ support inequalities \ref{R6}, they are identities \ref{R2}--\ref{R5}, \ref{R9} and~\ref{R10}. The multipliers of the inequalities are nonnegative. In the weighted sum, after each $H[F]$ is replaced by $H[\cl F]$, the coefficients of all joint entropies cancel, and what remains is the stated inequality. \end{proof} \begin{lemma}\label{lem:grid} Let $L\in\R$ and $h\colon\{0,\dots,\LmDepth\}^2\to\R$ satisfy \ref{G1}--\ref{G3} whenever all indices involved are at most $\LmDepth$. Then \begin{multline*} \LmDispB. \end{multline*} \end{lemma} \begin{proof} The inequality is a sum of instances of \ref{G1}--\ref{G3} with nonnegative rational multipliers, listed in the certificate. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:pair}] If $X$ or $Y$ is empty, both sides vanish. For nonempty $X,Y\subset\Z$, the sum of Proposition~\ref{prop:config} and Lemma~\ref{lem:grid} is $\LmABsumL\,L\le\LmAS\,S$, that is, $L\le\lambda S$. Finite subsets $X,Y$ of a torsion-free abelian group lie in a subgroup isomorphic to $\Z^d$ for some $d$. A homomorphism $\phi\colon\Z^d\to\Z$ that is injective on the finite sets $X+Y$ and $X-Y$ exists, because only finitely many hyperplanes must be avoided. Since $\phi(X)\pm\phi(Y)=\phi(X\pm Y)$, the integer case applied to $\phi(X),\phi(Y)$ gives the general case. \end{proof} \begin{remark}\label{rem:w} The gain over \cite{Kle26} comes from the variables in $\mathcal W$: for the configuration of $D_0$ and $D_1$ alone, with all forms whose coefficients lie in $\{-1,0,1\}$ and rules \ref{R1}--\ref{R7}, the floating-point optimum of the Shannon linear program is $1.4621$, larger than Kleinwaks' exponent $\lambda_\infty$ and equal to the optimum of \ref{G1}--\ref{G4} alone for indices up to $12$. \end{remark} \subsection{The transfer theorem}\label{sec:transfer} In \cite[page 3a]{TaoC} and \cite[Problem~6.44]{GGTW25}, $C_{3a}$ is the supremum of the $t$ for which there exist arbitrarily large finite $A,B\subset\Z$ with $|A+B|\ll|A|$ and $|A-B|\gg|A+B|^{t}$ (in \cite{GGTW25}, $|A-B|\gg|A|^{t}$), the implied constants being independent of $A$ and $B$. Gyarmati, Hennecart and Ruzsa \cite[(5)]{GHR07} and Kleinwaks \cite[\S2.2]{Kle26} ask for such sets for every $K>1$ in $|A+B|\le K|A|$, which can only give a smaller supremum. If $|A+B|\le K|A|$ and $t\ge0$, then $|A-B|\ge c|A|^t$ implies $|A-B|\ge cK^{-t}|A+B|^t$, so the next theorem, stated with $|A-B|\ge c|A+B|^t$, bounds $C_{3a}$ in each of these readings. Although Kleinwaks formalized it in Lean for his reading \cite{Kle26}, we include the proof, which follows \cite[\S3]{Kle26}. Its main estimate, \cite[Proposition~3.5]{Kle26}, holds for every $K$. \begin{theorem}[Kleinwaks]\label{thm:transfer} Let $\lambda\ge1$ be such that $|X-Y|\le|X+Y|^\lambda$ for all finite $X,Y\subset\Z$. Let $K\ge1$, $c>0$ and $t\in\R$, and suppose that there are finite nonempty $A,B\subset\Z$ with $|A|$ arbitrarily large, $|A+B|\le K|A|$ and $|A-B|\ge c|A+B|^{t}$. Then $t\le2-1/\lambda$. \end{theorem} \begin{proof} Let $A,B\subset\Z$ be finite and nonempty, and write $M_h=|hB-hB|$, where $hB$ is the $h$-fold sumset. \emph{Packing.} For a finite nonempty $D$, a set $T\subseteq A$ of maximal size such that the translates $t+D$, $t\in T$, are pairwise disjoint satisfies: for each $a\in A$ there is $t\in T$ with $a-t\in D-D$. Otherwise $a\notin T$ and $a+D$ is disjoint from all the translates $t+D$, which contradicts the maximality of $T$. This is Ruzsa's covering argument \cite{Ru99}. \emph{Localization.} We show that \begin{equation}\label{eq:local} |A-B|\,|D|\le|D-D-B|^{1-1/\lambda}\,|A+B|\,|D-D+D-B|. \end{equation} Assign each $a\in A$ to one $t\in T$ with $a-t\in D-D$, and let $A_t$ be the set of elements assigned to $t$. Then $A_t-B\subseteq t+(D-D-B)$, so $x=|A_t-B|$ satisfies $x\le U:=|D-D-B|$ and, by hypothesis, $x\le|A_t+B|^\lambda$. Hence $x=x^{1-1/\lambda}x^{1/\lambda}\le U^{1-1/\lambda}|A_t+B|$, and $|A-B|\le\sum_t|A_t-B|\le U^{1-1/\lambda}\sum_t|A_t+B|$. If $u\in A_t+B$, say $u=a+b$ with $a\in A_t$ and $a-t=d_1-d_2$ with $d_1,d_2\in D$, then $t+D=u-b-d_1+d_2+D\subseteq u+(D-D+D-B)$. The translates $t+D$ with $u\in A_t+B$ are disjoint, so there are at most $|D-D+D-B|/|D|$ of them, and $\sum_t|A_t+B|\le|A+B|\,|D-D+D-B|/|D|$. \emph{One scale.} Take $D=hB-hB$ with $h\ge1$. Then $D-D-B=2hB-(2h+1)B$ and $D-D+D-B=3hB-(3h+1)B$. Since $B\ne\emptyset$, $|mB-nB|$ does not decrease in $m$ or $n$, so both sets have at most $M_{4h}$ elements, and \eqref{eq:local} gives $|A-B|\,M_h\le M_{4h}^{2-1/\lambda}|A+B|$. \emph{Several scales.} Let $d=|A-B|$, $s=|A+B|$ and $m_j=M_{4^j}$. By induction on $j$, $d^jm_0\le s^jm_j^{1+j(1-1/\lambda)}$: the case $j=0$ is an equality, and the step multiplies by $d\,m_j\le m_{j+1}^{2-1/\lambda}s$ and uses $m_j\le m_{j+1}$. Now $m_0\ge1$, and if $|A+B|\le K|A|$, the Pl\"unnecke--Ruzsa inequality $|kB-lB|\le K^{k+l}|A|$ \cite[Theorem~1.2]{Pet12} gives $m_J\le K^{2\cdot4^J}|A|\le K^{2\cdot4^J}s$. Hence, for every $J\ge1$, \[ d\le s\,\bigl(K^{2\cdot4^J}s\bigr)^{(1+J(1-1/\lambda))/J}=C_{K,J}\,s^{2-1/\lambda+1/J}. \] For the sets of the theorem $s\ge|A|$ is arbitrarily large and $d\ge cs^t$, so $t\le2-1/\lambda+1/J$. Letting $J\to\infty$, we conclude that $t\le2-1/\lambda$. \end{proof} \begin{proof}[Proof of Corollary~\ref{cor:3a}] The number $\lambda\ge1$ of Theorem~\ref{thm:pair} satisfies the hypothesis of Theorem~\ref{thm:transfer}, so all exponents $t$ in the definition of $C_{3a}$ satisfy $t\le2-1/\lambda$. \end{proof} \section{Verification}\label{sec:verify} Each certificate is checked by two programs, written independently of each other, neither of which imports the programs that found the certificates. For a certificate of Section~\ref{sec:3b} or Appendix~\ref{app:short}, the first checker recomputes the relations of each copy step from Lemma~\ref{lem:copy} and the closures by exact elimination over $\Q$ together with rule (INJ), rebuilds each row from its definition, merges the closed sets identified by (EL), checks the proof of each inequality that the certificate proves by Lemma~\ref{lem:copyineq}, including the absence of cycles among these proofs, and compares the two sides of \eqref{eq:identity} coefficient by coefficient. For the certificate of Section~\ref{sec:pair}, it rebuilds the closures with \ref{R1}, checks that each row is an instance of its rule (each permutation or partial map respects pairs, types and laws as required, each identification \ref{R5} has the indices of its form, transposed for $\Gamma'$, each support row has the form required in \ref{R6}, and the grid indices are at most $\LmDepth$), and verifies that the weighted rows sum to $\lambda S-L$. Both checkers reject negative multipliers on inequality rows. The second checkers represent the configurations by explicit parametrizations and closed sets by reduced row echelon bases; for the certificates of Section~\ref{sec:3b} we confirmed that the two checkers compute the same relations and the same closures. For the inequalities proved inside the certificate of Theorem~\ref{thm:3b}, the second checker re-implements the check of the first, following the same steps; those from the list of Dougherty, Freiling and Zeger are also re-derived from their copy steps by an exact linear program, and all of them are compared with the published formulas. Theorems~\ref{thm:3b}--\ref{thm:pair}, Corollary~\ref{cor:3a} and the bound of Remark~\ref{rem:erdos} are also proved in Lean~4 \cite{Lean4} with Mathlib \cite{Mathlib}. The proofs build on Kleinwaks' Lean library \cite{Kle26}, which we ported to a newer version of Lean and Mathlib without changing its statements. A program translates each certificate into Lean source: each row becomes a lemma proved from general facts, two sets of forms with the same closure are shown to determine each other by explicit derivations with the rules \ref{cl:span}--\ref{cl:inj} of Lemma~\ref{lem:closure}, which the kernel checks by evaluation, the tactic \texttt{linear\_combination} checks the weighted sum of the rows, and each inequality that the certificate of Theorem~\ref{thm:3b} proves by Lemma~\ref{lem:copyineq} becomes a Lean theorem about arbitrary random variables. The formal statements, listed in the supplement \cite{Cert} with the definitions they use, do not mention the certificates, so the translation need not be trusted. They are parts~\ref{thm:3b:ent} and~\ref{thm:3b:set} of Theorem~\ref{thm:3b} over $\R$ and in every abelian group without $2$-torsion, the same parts with the numbers of Theorem~\ref{thm:3ball} in every abelian group, the bound of Remark~\ref{rem:erdos}, Theorem~\ref{thm:pair}, and Corollary~\ref{cor:3a} in the readings of Section~\ref{sec:transfer} with fixed $K$ and $c$ and with every $K>1$. They depend only on the three standard axioms of Lean. \FloatBarrier \appendix \section{A short certificate}\label{app:short} This appendix works through a certificate that is small enough to be checked by hand. The short certificate in \cite{Cert} proves \[ H(X,Y)\le\tfrac{314}{459}H(X)+\tfrac{302}{459}H(Y)+\tfrac{225}{459}H(X+Y) \] for injective pairs in any abelian group. By Lemma~\ref{lem:reduction} it gives the exponent $\CrSlash<\CrUp$ in all abelian groups. \emph{The forms.} Besides the standard forms of the configuration \eqref{eq:config}, the certificate uses the five cross forms \[ y_0-x_4,\quad x_0+y_0+x_2,\quad x_0+y_1+x_2,\quad x_0+y_1-x_4,\quad y_0+y_1+x_2. \] Each of them is built from two pairs of the configuration that share a coordinate or a sum. The form $x_0+y_0+x_2$ is the sum of the three coordinates of $g_0=(x_0,y_0)$ and $g_2=(x_2,y_0)$, which share $y_0$; in the same way $x_0+y_1+x_2$ belongs to $g_1$ and $g_3$, which share $y_1$, and $y_0+y_1+x_2$ to $g_2$ and $g_3$, which share $x_2$. The form $x_0+y_1-x_4=s_1-x_4$ combines $g_1$ and $g_5$, which share $y_1$, and $y_0-x_4=y_4-x_0$ combines $g_0$ and $g_4$, which have the same sum $s_0=s_4$. \emph{The identity.} Let $\mathrm{CI}_t=H(V,U')+H(O)-H(O,U')-H(V)$ be the expression of (CI) for step (S$t$), and let $I_k$ be the $72$ mutual informations of Table~\ref{tab:shortrows} with weights $w_k$. Then \begin{equation}\label{eq:short} 459\,H(X,Y)+\sum_kw_kI_k-220\,\mathrm{CI}_1-79\,\mathrm{CI}_2-69\,\mathrm{CI}_3=314\,H(X)+302\,H(Y)+225\,H(X+Y) \end{equation} holds after each joint entropy is replaced by the entropy of the closure of its forms and the identifications of Table~\ref{tab:shortel} are applied. Since $I_k\ge0$ and $\mathrm{CI}_t=0$, \eqref{eq:short} gives the stated inequality. In the certificate file each $I_k$ is expanded by the chain rule into inequalities of the first kind in \ref{lp:sh}, all with the weight $w_k/459$. \emph{Checking the identity.} Write each $I_k=I(A;B\mid C)$ as $H(A,C)+H(B,C)-H(A,B,C)-H(C)$, and write $\mathrm{CI}_t$ out with the pairs $O$, $U'$ and the variables $V$ of step (S$t$). The closures need only rules \ref{cl:span} and \ref{cl:inj}: starting from the integer combinations of the given forms, add the two coordinates of a pair $g_v$ whenever $d_v$ is such a combination, and repeat. For example, $d_5=x_4-y_1=(y_0+x_2)-(y_1+x_2)-(y_0-x_4)$, so the closure of $\{y_1+x_2,\,y_0-x_4,\,y_0+x_2\}$ contains $x_4$ and $y_1$, and hence also $y_0$ and $x_2$. Next, merge the closed sets that Table~\ref{tab:shortel} identifies; each identification is an instance of (EL) for the step shown. After these replacements every entropy except those of $x_0$, $y_0$ and $x_0+y_0$ and of the sets identified with them cancels, and the remaining coefficients are $314$, $302$ and $225$. \emph{What it says about $\Delta_\KT$.} Since $\mathrm{CI}_t=0$, subtracting $76.5$ times the identity of Proposition~\ref{prop:kt} from \eqref{eq:short} gives \[ \sum_kw_kI_k=76.5\,\Delta_\KT+8H(X)-4H(Y)-4.5H(X+Y), \] so that \[ 153\,\Delta_\KT\ge8H(Y)+9H(X+Y)-16H(X). \] In particular $\Delta_\KT\ge1/153$ when $H(X)=H(Y)=H(X+Y)=1$. \begin{table}[ht] \centering \caption{The identifications (EL) of the short certificate, by copy step.}\label{tab:shortel} \small \begin{tabular}{@{}cl@{\qquad}cl@{}} \toprule Step & Identification & Step & Identification\\ \midrule 1 & $H[y_0]=H[y_1]$ & 2 & $H[(x_0+y_1, x_0+y_0)]=H[(y_1+x_2, y_0+x_2)]$\\ 1 & $H[x_0+y_0]=H[x_0+y_1]$ & 2 & $H[(y_1, x_0+y_0)]=H[(y_1, y_0+x_2)]$\\ 1 & $H[x_0-y_0]=H[x_0-y_1]$ & 3 & $H[x_0]=H[x_4]$\\ 2 & $H[x_0]=H[x_2]$ & 3 & $H[y_0]=H[x_0+y_0-x_4]$\\ 2 & $H[x_0+y_0]=H[y_0+x_2]$ & 3 & $H[x_0-y_0]=H[x_0+y_0-2x_4]$\\ 2 & $H[x_0+y_1]=H[y_1+x_2]$ & 3 & $H[x_0-y_1]=H[y_1-x_4]$\\ 2 & $H[(x_0-y_1, y_0)]=H[(y_1-x_2, y_0)]$ & 3 & $H[(x_0-y_1, y_0)]=H[(y_1-x_4, x_0+y_0-x_4)]$\\ 2 & $H[(x_0+y_1, y_0)]=H[(y_1+x_2, y_0)]$ & 3 & $H[(x_0+y_1, y_0)]=H[(y_1+x_4, x_0+y_0-x_4)]$\\ \bottomrule \end{tabular} \end{table} \begin{table}[p] \centering \caption{The $72$ Shannon inequalities $I_k\ge0$ of the short certificate with their weights $w_k$. A tuple in parentheses is one random variable, and a list after the bar is the conditioning tuple.}\label{tab:shortrows} \small \begin{tabular}{@{}rl@{\quad}rl@{}} \toprule $w_k$ & $I_k$ & $w_k$ & $I_k$\\ \midrule 81 & $I(y_0;y_1)$ & 2 & $I(y_0;x_4\,|\,x_0+y_1+x_2)$ \\ 68 & $I(x_0+y_0;y_1)$ & 2 & $I(x_0+y_1;x_4\,|\,y_0+x_2)$ \\ 38 & $I(y_0;x_0+y_1)$ & 2 & $I(y_0-x_4;x_0+y_0+x_2\,|\,x_0+y_1+x_2)$ \\ 22 & $I(x_0+y_0;x_0+y_1)$ & 1 & $I(y_1;y_0+x_2\,|\,x_4)$ \\ 20 & $I(x_0;y_0+x_2)$ & 10 & $I(y_0;y_1\,|\,x_0, x_2)$ \\ 19 & $I(x_0+y_0;x_2)$ & 7 & $I(x_0;x_4\,|\,y_1, x_0+y_0)$ \\ 17 & $I(x_0+y_0+x_2;(y_1+x_4, x_0+y_0-x_4))$ & 5 & $I(y_1;x_2\,|\,x_0, y_1+x_4)$ \\ 14 & $I(x_0+y_1+x_2;(y_1+x_4, x_0+y_0-x_4))$ & 5 & $I(x_2;x_0\,|\,y_1-x_4, x_0+y_0+x_2)$ \\ 13 & $I(x_0;x_0+y_0-x_4)$ & 5 & $I(x_0;x_0+y_0-x_4\,|\,x_2, y_1+x_4)$ \\ 12 & $I(x_0;y_1+x_2)$ & 5 & $I(y_0-x_4;y_1+x_4\,|\,x_0, y_0+x_2)$ \\ 12 & $I(x_0+y_1;x_2)$ & 5 & $I(x_0+y_1;y_0-x_4\,|\,x_2, y_1+x_4)$ \\ 11 & $I(y_0;x_4)$ & 4 & $I(x_0;y_0+x_2\,|\,x_0+y_1, x_0+y_0-2x_4)$ \\ 11 & $I(y_0-x_4;(y_0+x_2, y_1+x_2))$ & 4 & $I(x_0;y_1\,|\,x_2, x_0+y_0-2x_4)$ \\ 9 & $I(x_0+y_0-x_4;(y_0+x_2, y_1+x_2))$ & 3 & $I(x_0;x_2\,|\,y_0, y_1-x_4)$ \\ 7 & $I(x_0;x_0+y_1-x_4)$ & 3 & $I(x_0;y_1+x_2\,|\,x_4, y_0+x_2)$ \\ 7 & $I(x_0+y_1;x_4)$ & 3 & $I(y_0;y_1+x_2\,|\,x_4, x_0+y_0+x_2)$ \\ 5 & $I(y_0+x_2;(x_0, y_1+x_4))$ & 2 & $I(x_0;x_4\,|\,y_1, x_0+y_0+x_2)$ \\ 5 & $I(x_0+y_0+x_2;y_0+y_1+x_2)$ & 2 & $I(x_0;x_0+y_0-x_4\,|\,x_0+y_1, y_0+x_2)$ \\ 3 & $I(x_0+y_0-x_4;(x_0, y_0+x_2))$ & 2 & $I(x_0+y_0;y_1\,|\,x_4, x_0+y_1+x_2)$ \\ 2 & $I(x_0;(y_0+x_2, y_1+x_2))$ & 2 & $I(x_0;y_0\,|\,y_1-x_4, x_0+y_1+x_2)$ \\ 2 & $I(x_0;(y_0+x_2, x_0+y_1-x_4))$ & 2 & $I(x_0;x_0+y_0-x_4\,|\,x_0+y_0+x_2, x_0+y_1+x_2)$ \\ 2 & $I(y_1+x_2;(x_0, y_0-x_4))$ & 2 & $I(x_0;y_0\,|\,y_0-x_4, x_0+y_1+x_2)$ \\ 2 & $I(x_0+y_1+x_2;y_0+y_1+x_2)$ & 2 & $I(x_0;x_2\,|\,x_0+y_1+x_2, x_0+y_0-2x_4)$ \\ 19 & $I(x_0;x_2\,|\,x_0+y_0+x_2)$ & 2 & $I(y_1;x_0+y_0-x_4\,|\,y_0, x_0+y_1+x_2)$ \\ 12 & $I(x_0;x_2\,|\,x_0+y_1+x_2)$ & 2 & $I(x_4;y_1+x_2\,|\,y_0+x_2, x_0+y_1-x_4)$ \\ 11 & $I(x_0;y_0\,|\,y_0-x_4)$ & 1 & $I(x_0;x_4\,|\,y_1, y_0+x_2)$ \\ 10 & $I(x_0;y_1+x_4\,|\,x_2)$ & 5 & $I(y_0;x_0\,|\,x_2, y_1+x_4, y_0-x_4)$ \\ 9 & $I(x_2;x_4\,|\,x_0-y_0)$ & 5 & $I(y_1;y_0\,|\,x_2, y_1+x_4, x_0+y_0-x_4)$ \\ 7 & $I(y_0;y_1\,|\,y_0+y_1+x_2)$ & 5 & $I(x_0;y_0\,|\,x_2, x_0+y_1, y_1+x_4)$ \\ 7 & $I(x_4;(y_0+x_2, y_1+x_2)\,|\,x_0+y_1-x_4)$ & 3 & $I(x_0;y_1\,|\,y_0, x_4, x_0+y_0+x_2)$ \\ 4 & $I(x_0+y_1;x_2\,|\,x_0+y_0-2x_4)$ & 3 & $I(y_0;x_0+y_0\,|\,x_4, y_0+x_2, y_1+x_2)$ \\ 3 & $I(x_0;x_4\,|\,x_0+y_0+x_2)$ & 3 & $I(y_1;x_0\,|\,x_4, y_1+x_2, x_0+y_0+x_2)$ \\ 3 & $I(y_0;x_0+y_0+x_2\,|\,y_1-x_4)$ & 2 & $I(y_0;y_1\,|\,x_0, y_0+x_2, y_0-x_4)$ \\ 2 & $I(x_2;x_4\,|\,x_0-y_1)$ & 2 & $I(x_0;x_2\,|\,y_0, x_0+y_0-x_4, x_0+y_1+x_2)$ \\ 2 & $I(x_4;y_1+x_2\,|\,x_0-y_0)$ & 2 & $I(x_2;y_0\,|\,x_0+y_0-x_4, x_0+y_0+x_2, x_0+y_1+x_2)$ \\ 2 & $I(y_0;x_0+y_0+x_2\,|\,y_1)$ & 2 & $I(x_4;y_0\,|\,x_0+y_1, y_0+x_2, x_0+y_0-x_4)$ \\ \bottomrule \end{tabular} \end{table} \FloatBarrier \section{The constants of Theorem~\ref{thm:3b}}\label{app:const} The rational numbers of Theorem~\ref{thm:3b}, which are the coefficients of its certificate, are \begin{align*} \lambda_X&=\CbLamXd,\\ \lambda_Y&=\CbLamYd,\\ \lambda_S&=\CbLamSd, \end{align*} and \[ \lambda_X+\lambda_Y+\lambda_S=\CbFrac<\CbUp. \] \section*{Data availability} The certificates (\file{c3b\_torsionfree.json} for Theorem~\ref{thm:3b}, \file{c3b\_allgroups.json} for Theorem~\ref{thm:3ball}, \file{c3b\_short.json} for Appendix~\ref{app:short} and \file{pair\_exponent.json} for Theorem~\ref{thm:pair}), the checkers, the Lean proofs and the programs that found the certificates are archived in \cite{Cert} and available at \url{\RepoURL}. \section*{Acknowledgements} Generative AI tools were used to write code, run analyses and draft text; the author directed the work and takes full responsibility for its content. \begin{thebibliography}{99} \bibitem{EP1097} T.~F.~Bloom, \emph{Erd\H{o}s problem \#1097}, \url{https://www.erdosproblems.com/1097}, accessed October 20, 2026; the problem was posed at the 1989 Great Western Number Theory problem session. \bibitem{Bou99} J.~Bourgain, \emph{On the dimension of Kakeya sets and related maximal inequalities}, Geom. Funct. Anal. \textbf{9} (1999), 256--282. \bibitem{CC26} E.~P.~Csirmaz and L.~Csirmaz, \emph{Information inequalities for five random variables}, Computation \textbf{14} (2026), no.~2, article~42; arXiv:2512.23316. \bibitem{DFZ11} R.~Dougherty, C.~Freiling and K.~Zeger, \emph{Non-Shannon information inequalities in four random variables}, arXiv:1104.3602, 2011. \bibitem{Fa26a} A.~Farnamfar, \emph{Sharp optimality of $11/6$ for literal ladder constructions}, Zenodo, \href{https://doi.org/10.5281/zenodo.23337952}{doi:10.5281/zenodo.23337952}, 2026. \bibitem{Fa26b} A.~Farnamfar, \emph{Sharp colour bounds and structural obstructions for three-direction sums--differences constructions}, Zenodo, \href{https://doi.org/10.5281/zenodo.23385419}{doi:10.5281/zenodo.23385419}, 2026. \bibitem{FP73} G.~A.~Freiman and V.~P.~Pigarev, \emph{The relation between the invariants $R$ and $T$} (Russian), Kalinin. Gos. Univ., Moscow, 1973, 172--174. \bibitem{GGTW25} B.~Georgiev, J.~G\'omez-Serrano, T.~Tao and A.~Z.~Wagner, \emph{Mathematical exploration and discovery at scale}, arXiv:2511.02864, 2025; published as \emph{Mathematical discovery and exploration can be done at scale}, Proc. Natl. Acad. Sci. USA \textbf{123} (2026), no.~40, e2536158123. Problem numbers refer to the arXiv version. \bibitem{GR19} B.~Green and I.~Z.~Ruzsa, \emph{On the arithmetic Kakeya conjecture of Katz and Tao}, Period. Math. Hungar. \textbf{78} (2019), 135--151. \bibitem{GHR07} K.~Gyarmati, F.~Hennecart and I.~Z.~Ruzsa, \emph{Sums and differences of finite sets}, Funct. Approx. Comment. Math. \textbf{37} (2007), 175--186. \bibitem{HRY99} F.~Hennecart, G.~Robert and A.~Yudin, \emph{On the number of sums and differences}, Ast\'erisque \textbf{258} (1999), 173--178. \bibitem{HiGHS} Q.~Huangfu and J.~A.~J.~Hall, \emph{Parallelizing the dual revised simplex method}, Math. Program. Comput. \textbf{10} (2018), 119--142. \bibitem{KT99} N.~H.~Katz and T.~Tao, \emph{Bounds on arithmetic projections, and applications to the Kakeya conjecture}, Math. Res. Lett. \textbf{6} (1999), 625--630. \bibitem{KT02} N.~H.~Katz and T.~Tao, \emph{New bounds for Kakeya problems}, J. Anal. Math. \textbf{87} (2002), 231--263. \bibitem{Kle26} L.~J.~Kleinwaks, \emph{Improved sum-difference inequalities in abelian groups}, proof paper, version~1.1 (October 6, 2026), and Lean formalization, \url{https://github.com/kleinwaks/sum-difference}, archived as \href{https://doi.org/10.5281/zenodo.23200803}{doi:10.5281/zenodo.23200803}. \bibitem{Le15} M.~Lemm, \emph{New counterexamples for sums-differences}, Proc. Amer. Math. Soc. \textbf{143} (2015), 3863--3868. \bibitem{Mad08} M.~Madiman, \emph{On the entropy of sums}, in: Proc. IEEE Information Theory Workshop, Porto, 2008, 303--307. \bibitem{Mathlib} The mathlib Community, \emph{The Lean mathematical library}, in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381. \bibitem{Mat07} F.~Mat\'u\v{s}, \emph{Infinitely many information inequalities}, in: Proc. IEEE Int. Symp. Information Theory, Nice, 2007, 41--44. \bibitem{MI26L} Mosaic Intelligence, \emph{A mechanized certificate ladder and a certified Shannon wall for the Katz--Tao sum--difference problem}, Zenodo, \href{https://doi.org/10.5281/zenodo.20646386}{doi:10.5281/zenodo.20646386}, 2026. \bibitem{MI26} Mosaic Intelligence, \emph{Certified sum-difference lower-bound certificates for $C_{3a}$, $C_{3b}$, and $C_{3c}$}, certificate archive, \href{https://doi.org/10.5281/zenodo.20794135}{doi:10.5281/zenodo.20794135}, 2026. \bibitem{Lean4} L.~de~Moura and S.~Ullrich, \emph{The Lean 4 theorem prover and programming language}, in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. \textbf{12699}, Springer, 2021, 625--635. \bibitem{Pet12} G.~Petridis, \emph{New proofs of Pl\"unnecke-type estimates for product sets in groups}, Combinatorica \textbf{32} (2012), 721--733. \bibitem{Ru99} I.~Z.~Ruzsa, \emph{An analog of Freiman's theorem in groups}, Ast\'erisque \textbf{258} (1999), 323--326. \bibitem{Ru09} I.~Z.~Ruzsa, \emph{Sumsets and entropy}, Random Structures Algorithms \textbf{34} (2009), 1--10. \bibitem{Tao10} T.~Tao, \emph{Sumset and inverse sumset theory for Shannon entropy}, Combin. Probab. Comput. \textbf{19} (2010), 603--639. \bibitem{Tao25} T.~Tao, \emph{Sum-difference exponents for boundedly many slopes, and rational complexity}, arXiv:2511.15135, 2025. \bibitem{TaoC} T.~Tao et al., \emph{Optimization constants in mathematics}, \url{https://teorth.github.io/optimizationproblems/}, pages 3a and 3b, accessed October 19, 2026. \bibitem{Cert} T.~S.~Tomar, \emph{Certificates, programs and Lean proofs for ``Certified upper bounds for two sum-difference exponents''}, Zenodo, \href{https://doi.org/\ZenodoDOI}{doi:\ZenodoDOI}, 2026. \bibitem{ZY98} Z.~Zhang and R.~W.~Yeung, \emph{On characterization of entropy function via information inequalities}, IEEE Trans. Inform. Theory \textbf{44} (1998), 1440--1452. \end{thebibliography} \end{document}