Arithmetic and its remedies select the evidence on learned geometry
The paper investigates how arithmetic constraints define a computable region for hyperbolic geometry in language models. It shows that standard methods fail to capture this structure, and a specific constraint—a difference of two growing terms—is necessary. This constraint allows arithmetic and its remedies to select stable training runs, proving that geometry itself is not inert but is selected by these numerical bounds.