 One-sided bounds for adjoining a positive element

Assume $uv\le v^2{u}^2$ for all $u,v\ge 1$ in a lattice-ordered group. For a convex lattice subgroup $H$ and $a\ge 1$, the displayed bounds allow $h\in H$ with $h\ge 1$ and integers $n\ge 0$. To prove the first set is a subgroup, use $(h{a}^n)(k{a}^m)\le h{k}^2{a}^{2n+m}$. Products and inverse products are both bounded because $xy\le |x||y|$ and $(xy{)}^{-1}\le |y||x|$. Taking the larger exponent and a join of the two bounds in $H$ bounds their absolute value in a lattice-ordered group. Inversion preserves that absolute value; common bounds using $h\vee k$ prove lattice closure and convexity. The set contains $H$ and $a$, and any convex lattice subgroup containing them contains the entire set. The second equality follows by applying the proof to the opposite group, where the required inequality is the original one with the variables interchanged.