Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent

Source abstract

We construct arbitrarily large finite sets $A$ of real algebraic integers such that both $|A+A|$ and $|AA|$ are at most $|A|^{1.95835}$. The construction combines truncated ideal-smooth $S$-unit fibres with a coprime additive factor. A tensor-product rank argument, using a two-dimensional local feature at each selected prime ideal, controls the loss in the additive factor, while a direct estimate for an outer parallel body improves the sumset packing bound. The arithmetic input is an unramified pro-$2$ tower over a known degree-ten field, with simultaneous Frobenius cuts controlling the small prime ideals. We use unconditional Tsfasman--Vlăduţ inequalities for the joint class-number--regulator cost. All finite numerical comparisons entering the exponent are certified by outward rational interval arithmetic. No unproved hypothesis is used.