Let $L := (+,-,0)$ be the language of abelian groups and let $T = Th(\frac{\mathbb{R}}{\mathbb{Z}})$. Is there a model of $T$ which is periodic, i.e. every member of the domain has finite order. In model theoretic terms this can be restated as: Is there a model of $T$ which omits the partial type $P(x) = \{nx\neq 0 | n \in \mathbb{N}_0\} \cup T$? Since $T$ is complete this is iff $P$ is non-principal. I'm not really sure how I'm supposed to show that $P$ is non-principal in this case ( or in general). Any hints/ideas? Many thanks.
2026-04-24 20:01:25.1777060885
Is there a model of $Th(\frac{\mathbb{R}}{\mathbb{Z}})$ which is a periodic group?
149 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GROUP-THEORY
- What is the intersection of the vertices of a face of a simplicial complex?
- Group with order $pq$ has subgroups of order $p$ and $q$
- How to construct a group whose "size" grows between polynomially and exponentially.
- Conjugacy class formula
- $G$ abelian when $Z(G)$ is a proper subset of $G$?
- A group of order 189 is not simple
- Minimal dimension needed for linearization of group action
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- subgroups that contain a normal subgroup is also normal
- Could anyone give an **example** that a problem that can be solved by creating a new group?
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in MODEL-THEORY
- What is the definition of 'constructible group'?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Existence of indiscernible set in model equivalent to another indiscernible set
- A ring embeds in a field iff every finitely generated sub-ring does it
- Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree
- What would be the function to make a formula false?
- Sufficient condition for isomorphism of $L$-structures when $L$ is relational
- Show that PA can prove the pigeon-hole principle
- Decidability and "truth value"
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Both your approach and the approach in the comments work: Your type $P(x)$, expressing that $x$ has infinite order, is not isolated. Also, $\mathbb{Q}/\mathbb{Z}$ is an elementary substructure of $\mathbb{R}/\mathbb{Z}$.
To start, here's an observation that's useful whenever you want to prove that a type is not isolated (or a theory is not finitely axiomatizable).
Claim: Let $p$ be a (partial) type. If $p$ is isolated (relative to a theory $T$), then there are finitely many formulas $\varphi_1,\dots,\varphi_n\in p$ such that $p$ is isolated by $\bigwedge_{i=1}^n \varphi_i$ (relative to $T$).
Proof: If $p$ is isolated, there is a formula $\theta$ such that $T\cup \{\theta\}\models p$. Then $T\cup p\cup \{\lnot \theta\}$ is inconsistent. By compactness, $T\cup \{\varphi_1,\dots,\varphi_n\}\cup \{\lnot\theta\}$ is inconsistent, for some $\varphi_1,\dots,\varphi_n\in p$. Then $T\cup \{\bigwedge_{i=1}^n\varphi_i\}\models \theta$, so $T\cup \{\bigwedge_{i=1}^n\varphi_i\}\models p$. $\square$
Now if your type $P(x)$ is isolated, then it is isolated by $\bigwedge_{i=1}^k n_ix\neq 0$ for some $n_1,\dots,n_k>0$, so letting $N = \prod_{i=1}^k n_i$, it is isolated by $Nx\neq 0$. But this is impossible, since e.g. $\frac{1}{N+1}$ satisfies $Nx \neq 0$ but does not satisfy $P(x)$. Thus $P(x)$ is not isolated and can be omitted in some model of $T$.
Now let's show that $\mathbb{Q}/\mathbb{Z}\preceq \mathbb{R}/\mathbb{Z}$. User mihaild's suggestion in the comments to use an Ehrenfeucht-Fraïssé game is a reasonable way to go, but let's take a different approach.
It's a theorem of Wanda Szmielew that for any abelian group $A$, the complete theory of $(A;+,-,0,(n{\mid})_{n\in \mathbb{N}})$ has quantifier elimination, where each symbol $n{\mid}$ is a unary relation symbol which holds of the elements of $A$ divisible by $n$. Note that this language is a definitional expansion of the pure group language: $n{\mid}x$ is definable by $\exists y\,(\underbrace{y+\dots+y}_{n\text{ times}} = x)$.
See the answers to this question for references and lots of other information about theories of abelian groups.
Now $\mathbb{R}/\mathbb{Z}$ is a divisible abelian group, so for every $n>0$, every element is divisible by $n$. Thus the symbols $(n{\mid})$ are interpreted trivially in $\mathbb{R}/\mathbb{Z}$, and the theory of this group actually admits QE in the abelian group language.
At this point, you could apply the Tarski-Vaught test to show $\mathbb{Q}/\mathbb{Z}\preceq \mathbb{R}/\mathbb{Z}$. This amounts to showing that for every quantifier-free formula in the language of abelian groups, $\varphi(x,b_1,\dots,b_n)$, with $b_1,\dots,b_n\in \mathbb{Q}/\mathbb{Z}$, if the formula has a realization in $\mathbb{R}/\mathbb{Z}$, then it has one in $\mathbb{Q}/\mathbb{Z}$. This shouldn't be too difficult.
But instead, for fun, let's bring in the big guns. Szmielew also classified the complete theories of abelian groups by four families of invariants (see Tim Campion's answer to the question I linked to above). In the case of a divisible group $A$, $nA = A$ for all $n>0$, so we have: \begin{align*} Tf(p;\mathbb{R}/\mathbb{Z}) = Tf(p;\mathbb{Q}/\mathbb{Z}) &= 0\\ D(p;\mathbb{R}/\mathbb{Z}) = D(p;\mathbb{Q}/\mathbb{Z}) &= 1\\ Exp(\mathbb{R}/\mathbb{Z}) = Exp(\mathbb{Q}/\mathbb{Z}) &= \infty\\ U(p,n;\mathbb{R}/\mathbb{Z}) = U(p,n;\mathbb{Q}/\mathbb{Z}) &= 0 \end{align*} It follows that $\mathbb{R}/\mathbb{Z}$ and $\mathbb{Q}/\mathbb{Z}$ are elementarily equivalent. From the definitions of the invariants we can extract the following axiomatization of their common complete theory: $A$ is a divisible abelian group of unbounded exponent such that for all primes $p$, $|\{x\in A\mid px = 0\}| = p$.
Now $\mathbb{Q}/\mathbb{Z}$ is a substructure of $\mathbb{R}/\mathbb{Z}$, and the common theory of these two groups admits quantifier elimination, so $\mathbb{Q}/\mathbb{Z}\preceq\mathbb{R}/\mathbb{Z}$.