English

A Cobham theorem for scalar multiplication

Logic 2024-07-23 v1 Logic in Computer Science

Abstract

Let α,βR>0\alpha,\beta \in \mathbb{R}_{>0} be such that α,β\alpha,\beta are quadratic and Q(α)Q(β)\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta). Then every subset of Rn\mathbb{R}^n definable in both (R,<,+,Z,xαx)(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x) and (R,<,+,Z,xβx)(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \beta x) is already definable in (R,<,+,Z)(\mathbb{R},{<},+,\mathbb{Z}). As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to β\beta-numeration systems, where β\beta is a quadratic irrational.

Keywords

Cite

@article{arxiv.2407.15118,
  title  = {A Cobham theorem for scalar multiplication},
  author = {Philipp Hieronymi and Sven Manthe and Chris Schulz},
  journal= {arXiv preprint arXiv:2407.15118},
  year   = {2024}
}
R2 v1 2026-06-28T17:48:41.406Z