A Cobham theorem for scalar multiplication
Abstract
Let α,β ∈ R>0 be such that α,β are quadratic and Q(α)≠ Q(β). Then every subset of Rn definable in both (R,<,+,Z,x α x) and (R,<,+,Z,x β x) is already definable in (R,<,+,Z). As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to β-numeration systems, where β is a quadratic irrational.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.