STABILITY AND SPARSITY IN SETS OF NATURAL NUMBERS 7 1 GABRIELCONANT 0 2 Abstract. GivenasetA⊆N,weconsidertherelationshipbetweenstability r of the structure (Z,+,0,A) and sparsity of the set A. We first show that a a strongenoughsparsityassumptiononAyieldsstabilityof(Z,+,0,A). Specif- M ically, if there is a function f : A −→ R+ such that supa∈A|a−f(a)| < ∞ and {s :s,t∈f(A), t≤s} is closed and discrete, then (Z,+,0,A) is super- t 6 stable(ofU-rankω ifAisinfinite). Suchsetsincludeexamplesconsideredby 2 Palac´ın and Sklinos [17] and Poizat [21], many classical linear recurrence sequences(e.g. theFibonacccinumbers),andanysetinwhichthelimitofratios ] of consecutive elements diverges. Finally, weconsider sparsityconclusions on O setsA⊆N,whichfollowfrommodeltheoreticassumptionson(Z,+,0,A). We L use aresultof Erd˝os, Nathanson, and Sárközy [7]to show that if(Z,+,0,A) . does not define the ordering on Z, then the lower asymptotic density of any h finitary sumset of A is zero. Finally, in a theorem communicated to us by t Goldbring,weusearesultofJin[10]toshowthatif(Z,+,0,A)isstable,then a m theupperBanachdensityofanyfinitarysumsetofAiszero. [ 2 v 1. Introduction 7 8 The group of integers (Z,+,0) is a standard example of a very well-behaved 3 superstable group. The structure of definable sets in (Z,+,0) is completely under- 1 stood(seeFact3.1(d)),andgeneralizestothemodeltheoreticstudyofmodulesand 0 . 1-basedgroups,whichaccountsforsomeoftheearliestworkinstabilitytheoryand 1 model theory (see [18], [23]). On other hand, until recently very little was known 0 about stable expansions of (Z,+,0). Indeed, it was unknown if (Z,+,0) had any 7 1 proper stable expansions, until 2014 when Palac´ınand Sklinos [17] and Poizat[21] : independently gave the first examples. Specifically, these authors considered the v expansion of (Z,+,0) by a unary predicate for the powers of a fixed integer q ≥2, i X which was shown to be superstable of U-rank ω. Palac´ın and Sklinos proved the r same conclusion for other examples including the expansion by a predicate for the a factorial numbers (see Fact 6.1). In this paper, we continue the study of stable expansions of (Z,+,0) obtained by adding a unary predicate for some distinguished subset A ⊆ Z (this expansion isdenotedZ :=(Z,+,0,A)). Thusourworkisin the domainoffollowinggeneral A problem (attributed to Goodrick in [17]). Problem 1.1. Characterize the subsets A⊆Z such that Th(Z ) is stable. A Wewillmainlyfocusonsubsetsofthenaturalnumbers(or,morebroadly,A⊆Z witheitheranupperboundoralowerbound). Forsuchsets,wepursuetheinformal thesisthatstabilityofTh(Z )isconnectedtothe“sparsityofA”. Inparticular,we A willconnectstabilityofTh(Z )tothe asymptoticbehaviorofratiosofelements of A A,andalsotocombinatorialpropertiesoffinitarysumsetsofA(e.g. theasymptotic density of, and arithmetic progressionsin, such sumsets). 1 2 GABRIELCONANT Our main result shows that a strong enough sparsity assumption on A ⊆ N implies stability of Th(Z ). We say that a set A ⊆ N is geometrically sparse if A there is a function f : A −→ R+ such that sup |a−f(a)| < ∞ and the set a A {s :s,t∈f(A), t≤s} is closed and discrete. ∈ t Theorem A. If A⊆N is geometrically sparse and infinite then Th(Z ) is super- A stable of U-rank ω. In Section 6, we catalog many natural examples of geometrically sparse sets. This includes all of the examples considered in [17] (e.g. powers and factorials), as well as any set A ⊆ N such that, if (a ) is a strictly increasing enumeration of n ∞n=0 A, then lim an+1 = ∞. Geometrically sparse sets also include many famous n→∞ an examples of linear recurrence sequences such as the Fibonacci numbers and Pell numbers (more generally,anyrecurrencesequence whosecharacteristicpolynomial is the minimal polynomial of a Pisot number or a Salem number, see Section 6). To prove Theorem A, we use general results on stable expansions by unary predicates, due to Casanovas and Ziegler [5] (which were also used by Palac´ın and Sklinosin[17]). Inparticular,weshowthatforgeometricallysparseA⊆N,stability ofTh(Z )isequivalenttostabilityoftheinducedstructureonAfrom(Z,+,0). We A will then interpretthis induced structure on A in a superstable U-rank1 structure with universe N (specifically, N with the successor function and unary predicates for all subsets of N, which we denote N1). The calculation of U-rank in Theorem s A is obtained by combining a result from [17] (there are no proper finite U-rank expansions of (Z,+,0)) with the following theorem (proved in Section 2). Theorem B. Let M bean infinitefirst-order L-structure,with U(M)=1, and fix an infinite subset A⊆M. Let M denote the expansion of M in the language L A A obtainedbyaddingaunarypredicateforA. LetAind denotetheinducedstructureon A from all 0-definable sets in M. If all L -formulas are bounded modulo Th(M ), A A then U(M )≤U(Aind)·ω. A The proof of this result uses similar techniques as in [17, Theorem 2], which considers the case M = Z and U(Aind) = 1. The condition that all L -formulas A are bounded modulo Th(M ) is defined in Section 2, and is a key ingredient in A the work of Casanovas and Ziegler [5]. We will work with this condition via the stronger notion of a sufficiently small subset A of a structure M, which is a slight variation on a similar property from [5]. In Section 4, we characterize sufficiently small subsets A of (Z,+,0) using the occurrence of nontrivial subgroups of Z in finitarysumsetsof±A,aswellasthelowerasymptoticdensityofsuchsumsets(via aresultofErdo˝s,Nathanson,andSa´rközy[7]oninfinite arithmeticprogressionsin sumsets of sets with positive density). In Section 7.1, we modify an unpublished argumentofPoonentoshowthatanygeometricallysparsesetA⊆Nissufficiently small, and so stability of Th(Z ) reduces to stability of Aind. The rest of Section A 7 is devoted to interpreting Aind in N1 (see Corollary 7.9). In Section 7.4, we s refinetheanalysisofAind forwell-knownexamplesofgeometricallysparsesets(see Theorem 7.16). For example, we use the Skolem-Mahler-Lech Theorem to show thatif A⊆N is a recurrencesequence ofthe kinddiscussedafter TheoremA,then Aind is interpreted in N with the successor function and unary predicates for all arithmetic progressions. Theorem A establishes a sparsity assumption on sets A ⊆ N which is sufficient forstabilityofTh(Z ). InSection8,weaddresssparsityassumptionsnecessary for A STABILITY AND SPARSITY IN SETS OF NATURAL NUMBERS 3 stability. Forinstance,weusethepreviouslymentionedresultofErdo˝s,Nathanson, andSa´rközy[7]to provethat, givenA⊆N,if Th(Z )does notdefine the ordering A on Z, then the lower asymptotic density of any finitary sumset of A is zero (see Theorem 8.3). In the case that Th(Z ) is stable, we use a result of Jin [10] to A strengthen this conclusion and show that the upper Banach density of any finitary sumsets of A is zero (see Theorem 8.8). This latter result and its proof are due to Goldbring, and it is included here with his permission. Finally, we analyze the behaviorof finite arithmetic progressionsin sets A⊆N suchthat Th(Z ) is stable A (see Theorem 8.12). 2. Expansions of first-order structures by unary predicates Throughoutthis section,wefixafirst-orderlanguageL. LetL be thelanguage ∗ consistingofrelationsR (x¯),where ϕ(x¯)is anL-formulaover∅invariablesx¯. Let ϕ M be an L-structure with universe M. Definition 2.1. Fix a subset A⊆M. (1) Let L = L∪{A} where, abusing notation, we use A for a unary relation A symbol not in L. (2) LetM denotethe unique L -structure,withunderlyinguniverseM,sat- A A isfying the following properties: (i) M is the reduct of M to L, A (ii) the unary relation A is interpreted in M as the subset A. A (3) Let Aind be the L -structure, with universe A, such that R is interpreted ∗ ϕ as ϕ(An). (4) An L -formula ϕ(x¯) is bounded modulo Th(M ) if it is equivalent, A A modulo Th(M ), to a formula of the form A Q z ∈A...Q z ∈A(ψ(x¯,z ,...,z )), 1 1 m m 1 m where Q ,...,Q are quantifiers and ψ(x¯,z¯) is an L-formula. 1 m We will use the following result of Casanovas and Ziegler [5], which relates the stability of Th(M ) to stability of Th(M) and Th(Aind). A Fact2.2. [5,Proposition3.1]LetMbeanL-structureandfixA⊆M. Supposeev- eryL -formulais boundedmoduloTh(M ). Then, for anycardinalλ≥|Th(M)|, A A Th(M ) is λ-stable if and only if Th(M) is λ-stable and Th(Aind) is λ-stable. A Casanovas and Ziegler also provide a way to show that formulas are bounded. Definition 2.3. LetMbe anL-structure. AsubsetA⊆M issufficiently small if, for any L-formula ϕ(x,y¯,z¯), there is a model N |= Th(M ) such that, for any A ¯b∈Nz¯, if {ϕ(x,a¯,¯b):a¯∈A(N)y¯} is consistent then it is realized in N. Fact 2.4. [5, Proposition2.1] Let M be an L-structure and fix a sufficiently small subset A ⊆ M. If Th(M) is stable and M does not have the finite cover property over A, then every L -formula is bounded modulo Th(M ). A A Remark2.5. See[5]forthedefinitionof“MhasthefinitecoverpropertyoverA”. The notionof “sufficiently small” is slightly weaker than what is used in [5], where the authors work with so-called small sets. The reader may verify that the proof of[5, Proposition2.1]only requires A to be sufficiently small. Similar variations of these notions, and the relationships between them, are considered in [1]. 4 GABRIELCONANT In later results, we will calculate the U-rank of certain expansions of the group ofintegersbyunarysets. Therefore,thegoaloftherestofthissectionistoidentify a general relationship between the U-ranks of the structures M, Aind, and M , A undercertainassumptions. Fortherestofthissection,wefixasubsetA⊆M such thateveryL -formulaisboundedmoduloTh(M ). LetM denoteaκ-saturated A A ∗A monster model of Th(M ), for some sufficiently large κ. Let A = A(M ). We A ∗ ∗ thenhavethe L -structure(A )ind asgivenbyDefinition2.1. We usethe following ∗ ∗ notation for the various type spaces arising in this situation. (i) Given n>0 and B ⊂M , ∗ S (B) is the set of n-types in L over B consistent with Th(M), n SA(B) is the set of n-types in L over B consistent with Th(M ), n A A SA (B) is the set of p∈SA(B) such that p|=A(x ) for all 1≤i≤n. n,A n i (ii) Given n>0 and B ⊂A , ∗ Sind(B) is the set of n-types in L over B consistent with Th(Aind). n ∗ By assumption on A, we may assume that types in SA(B) only contain L - n A formulas of the form Q z ∈A...Q z ∈A ψ(x¯,z¯) , for some L-formula ψ(x¯,z¯) 1 1 m m and quantifiers Q ,...,Q . 1 m (cid:0) (cid:1) Definition 2.6. (1) Fix an L-formula ψ(x¯,z¯) and consider the L -formula A ϕ(x¯):=Q z ∈A,...,Q z ∈A ψ(x¯,z¯) , 1 1 m m where each Q is a quantifier. Define the L -f(cid:0)ormula(cid:1) i ∗ R (x¯):=Q z ,...,Q z R (x¯,z¯) . ϕ 1 1 n n ψ (2) Fix B ⊂A and n>0. Given p∈SA (B(cid:0) ), define(cid:1)the L -type ∗ n,A ∗ pind ={R (x¯,¯b):ϕ(x¯,y¯)∈L , ¯b∈B, and ϕ(x¯,¯b)∈p}. ϕ A Given p∈Sind(B), define the L -type A A pext ={ϕ(x¯,¯b):ϕ(x¯,y¯)∈L , ¯b∈B, and R (x¯,¯b)∈p}. A ϕ The following remarks are routine exercises, which we leave to the reader. Proposition 2.7. (a) Th(Aind) has quantifier elimination in the language {R :ϕ∈L }. ϕ A (b) Given B ⊂A , the map p7→pind is a bijection from SA (B) to Sind(B), with ∗ n,A n inverse p7→pext. (c) (A )ind is a κ-saturated elementary extension of Aind. ∗ (d) Fix C ⊆B ⊂A , p∈SA (C), and q ∈SA (B) such that q is an extension of ∗ n,A n,A p. Then qind is an extension of pind and, moreover, q is a dividing extension of p if and only if qind is a dividing extension of pind. Lemma 2.8. Fix B ⊂A and p∈SA (B). Then U(p)≥U(pind) and, if Th(M) ∗ n,A is stable, then U(p)=U(pind). STABILITY AND SPARSITY IN SETS OF NATURAL NUMBERS 5 Proof. We show, by induction on ordinals α, that U(pind) ≥ α implies U(p) ≥ α and, if Th(M) is stable, then the converse holds as well. The α = 0 and limit α cases are trivial, so we fix an ordinal α and consider α+1. First, suppose U(pind) ≥ α + 1 and fix a forking extension q ∈ Sind(C) of 0 n pind, with B ⊆ C ⊂ A , such that U(q ) ≥ α. Let q = qext. By parts (c) and ∗ 0 0 (d) of Proposition 2.7, it follows that q is a forking extension of p. By induction, U(q)=U(q )≥α. Therefore U(p)≥α+1. 0 NowassumeTh(M)isstableandU(p)≥α+1. ByFact2.2,Th(M )isstable. A We may fix a small model N |= Th(M ) containing B, and q ∈ SA (N), such A n,A that q is a forking extension of p with U(q) ≥ α. Let A = A(N), and note that ′ B ⊆ A′ ⊂ A∗. Let q′ = q|A′ ∈ SnA,A(A′) and let r ∈ SnA,A(N) be a nonforking extension of q′ to N. Then A(x) ∈ q, A(x) ∈ r, and q|A′ = q′ = r|A′. By [19, Theorem 12.30], it follows that q = r, and so U(q) = U(r) = U(q ). Altogether, ′ we may replace q with q andassume q ∈SA (A) is a forking extensionof p, with ′ n,A ′ U(q)≥α. ByProposition2.7(d), qind isaforkingextensionofpind. SinceA ⊂A , ′ ∗ it follows by induction that U(qind)≥α. Therefore U(pind)≥α+1. (cid:3) Definition 2.9. Define U(A)=sup{U(p):p∈SA (∅)}. 1,A Toclarify, U(A)isthe U-rankofthe formulaA(x) withrespecttoTh(M )(i.e. A the U-rank of the definable set A in M ). On the other hand, U(Aind) is the ∗ ∗A U-rank of Aind as a structure (i.e. the U-rank of Th(Aind)). Theorem 2.10. Fix a structure M and a set A ⊆ M such that all L -formulas A areboundedmoduloTh(M ). Then U(A)≥U(Aind)and, if Th(M)is stable, then A U(A)=U(Aind). Proof. Recall that U(Aind) = sup{U(p) : p ∈ Sind(∅)}. Now apply Proposition 1 2.7(c) and Lemma 2.8. (cid:3) We now restate and prove Theorem B, which uses similar techniques as in the proof of [17, Theorem 2] by Palac´ın and Sklinos. In the following, we use · to denote standard ordinal multiplication, and ⊗ to denote “natural multiplication” using Cantor normal form. Theorem 2.11. Let M be stable of U-rank 1. If A ⊆ M is infinite, and all L -formulas are bounded modulo Th(M ), then U(M )≤U(Aind)·ω. A A A Proof. We may assume Th(Aind) is superstable, since otherwise U(Aind)=∞ and the result holds trivially. By Fact 2.2, Th(M ) is superstable. Let β = U(Aind). A Let T =Th(M). Unless otherwise specified, we work in Th(M ). A Claim: Given c∈M , if c∈acl(A B) then U(c/B)<β·ω. ∗ ∗ Proof: Let a¯ ∈ A be a finite tuple witnessing c ∈ acl(A B). Note U(A ) = β by ∗ ∗ ∗ Theorem2.10 andso, using Lascar’sinequality, U(a¯/B)≤U(a¯)≤β⊗|a¯|. Since A is infinite, we haveβ >0 andso β⊗|a¯|<β·ω . Applying Lascar’sinequality once more, we obtain U(c/B)≤U(a¯/B)<β·ω. ⊣ claim We now show U(M ) ≤ β · ω. In particular, we fix p ∈ SA(M), and show A 1 U(p) ≤ β ·ω. To do this, we fix B ⊇ M and a forking extension q ∈ S (B) of 1 p, and show U(q) < β · ω. After replacing q by some nonforking extension, we may also assume B is a model. Fix b ∈ M realizing q. Let a ∈ M realize a ∗ ∗ nonforking extension of p to B. If a ∈ acl(A B) then U(p) = U(a/B) < β ·ω by ∗ the claim, and the result follows. So we may assume a 6∈ acl(A B), which means ∗ 6 GABRIELCONANT UT(a/A B) = 1. For a contradiction, suppose b 6∈ acl(A B). Then b 6∈ acl(B), ∗ ∗ and so UT(b/B) = 1 = UT(a/B). Since tp (a/M) = p = tp (b/M), and M is a model, it follows from stationarity in T thLat tp (a/B) = tpL(b/B). Similarly, b 6∈ acl(A B) implies UT(b/A B) = 1 and so, sincLe B is a modLel, tp (a/A B) = ∗ ∗ ∗ tp (b/A B) by stationarity in T. By induction on quantifiers over AL, it follows ∗ thaLt a,b realize the same bounded L -formulas over B. By assumption on A, we A have tp (a/B) =tp (b/B)= q, which contradicts that q is a forking extension of p. ThLeArefore b∈acLl(AA B), and so U(q)=U(b/B)<β·ω by the claim. (cid:3) ∗ 3. Preliminaries on the group of integers Let Z = (Z,+,0) denote the group of integers in the group language {+,0}. For n ≥ 2, we let ≡ denote equivalence modulo n, which is definable in Z by n the formula ∃z(x = nz +y). For the rest of the paper, L denotes the expanded language{+,0,(≡ ) }. NotethatanL-termis alinearcombinationofvariables n n 2 ≥ with positive integer coefficients. Since = and ≡ are invariant (modulo Th(Z)) n under addition, there is no harmin abusing notationand allowing negativeinteger coefficients in L-terms. We list some well known facts about Th(Z). Fact 3.1. (a) Th(Z) has quantifier elimination in the language L (see, e.g., [13]). (b) Th(Z) is superstable of U-rank 1, but not ω-stable (see, e.g., [3], [13]). (c) Z does not have the finite cover property. In particular, for any A⊆Z, Z does not have the finite cover property over A. See [2] and [5]. (d) Given n > 0, the Boolean algebra of Z-definable subsets of Zn is generated by cosets of subgroups of Zn (see [23]). It follows that if A ⊆ Z is infinite and bounded above or bounded below, then A is not definable in Z. The next corollary follows from results of [17] and Theorem 2.11. Corollary 3.2. Fix A ⊆ Z. Assume that A is not definable in Z and every L - A formula is boundedmodulo Th(Z ). Then ω ≤U(Z )≤U(Aind)·ω. In particular, A A if U(Aind) is finite then U(Z )=ω. A Proof. Since Z has U-rank 1, the upper bound comes from Theorem 2.11. The lowerboundisfromthe fact, dueto Palac´ınandSklinos[17], thatZ hasnoproper stable expansions of finite U-rank. (cid:3) Finally, we record some notation and facts concerning asymptotic density and sumsets of integers. Let N = {0,1,2,...} denote the set of nonnegative integers. Given n>0, we let [n] denote {1,...,n}. Definition 3.3. Suppose A⊆N. (1) Given n≥1, define A(n)=|A∩[n]|. (2) The lower asymptotic density of A is A(n) δ(A)=liminf . n n →∞ Given two subsets A,B ⊆ Z, we write A ∼ B if A B is finite. The following △ facts are straightforwardexercises. STABILITY AND SPARSITY IN SETS OF NATURAL NUMBERS 7 Fact 3.4. (a) If A,B ⊆ N and A ∼ B, then δ(A) = δ(B). In particular, δ(A) = 0 for any finite A⊆N. (b) If A,B ⊆N and A⊆B, then δ(A)≤δ(B). (c) If m,r ∈N and m>0, then δ(mN+r)= 1. m Definition 3.5. (1) A subset X ⊆Z is symmetric if it is closed under the map x7→-x. (2) Given X ⊆Z and n∈Z, define nX ={nx:x∈X}. (3) Given X,Y ⊆Z, define X+Y ={x+y :x∈X, y ∈Y}. (4) Given X ⊆Z and n≥1, define n(X)=X +X +...+X (n times). (5) Given X ⊆Z and n≥1, define Σ (X)= n k(X). n k=1 We also cite the following result of Erdo˝s, NathSanson, and Sa´rközy [7]. Fact 3.6. [7] Suppose A ⊆ N is such that δ(A) > 0. Then, for some n ≥ 1, n(A) contains an infinite arithmetic progression (and so Σ (A) does as well). n Remark 3.7. Fact3.6canbe viewedasavariantofSchnirel’mann’s basis theorem [24], which says that if A ⊆ N is such that δ(A) > 0 and 1 ∈ A then Σ (A) = N n for some n ≥ 1. Nash and Nathanson [15] use this result to give the following strengthening of Fact 3.6: if δ(A) > 0 then, for some n ≥ 1, Σ (A) is cofinite in n aN, where a=gcd(A). 4. Sparse sets and bounded formulas The goal of this section is to characterize sufficiently small subsets of Z using a combinatorialnotion of sparsity. Definition4.1. A⊆Zissufficientlysparseif,foralln≥1,δ(Σ (±A)∩N)=0. n Proposition 4.2. Given A⊆Z, the following are equivalent. (i) A is sufficiently sparse. (ii) For all n≥1, Σ (±A) does not contain a nontrivial subgroup of Z. n (iii) For all n≥1, Σ (±A) does not contain a coset of a nontrivial subgroup of Z. n Proof. (iii)⇒(ii) is trivial; and (i)⇒(ii) follows from Fact 3.4. (ii) ⇒ (iii). Suppose Σ (±A) contains the coset mZ+r, with m ≥ 1. Then n r∈Σ (±A), and so mZ⊆Σ (±A). n 2n (ii) ⇒ (i): Suppose that δ(B) > 0, where B = Σ (±A)∩N for some n ≥ 1. n By Fact 3.6, there is some k ≥ 1 such that Σ (B) contains an infinite arithmetic k progressionmN+r. Then mZ⊆Σ (±B)⊆Σ (±A). (cid:3) 2k 2kn Lemma 4.3. Suppose X,F ⊆ Z are symmetric, with F finite. If δ(X ∩N) = 0 then δ((X +F)∩N)=0. Proof. Let B =X∩N, C =(B+F)∩N, and D =(X+F)∩N. We wantto show δ(D)=0. Note that C ⊆D ⊆C∪({x∈X :minF ≤x<0}+F), and so C ∼D. Therefore, it suffices to show δ(C)=0. Let t=|F| and s= maxF. Given n≥1, consider the function from C ∩[n] to B∩[n+s] sending x to the least b∈B such that x=b+f for some f ∈F. This functionis(≤t)-to-one,andsoC(n)≤B(n+s)t. Suppose,towardacontradiction, 8 GABRIELCONANT that δ(C) > 0. Then there is some ǫ > 0 and n ≥ 1 such that, for all n ≥ n , inf C(m) ≥ǫ. For any n≥n , we have ∗ ∗ m n m ≥ ∗ B(m)+s B(m+s) C(m) ǫ inf ≥ inf ≥ inf ≥ . m n m m n m m n mt t ≥ ≥ ≥ Therefore, if n≥max{n ,2st}, then ǫ ∗ B(m) B(m)+s s ǫ s ǫ inf ≥ inf − ≥ − ≥ >0. m n m m n m n t n 2t ≥ ≥ It follows that δ(B)>0, which contradicts our assumptions. (cid:3) Lemma4.4. AsetA⊆Zissufficientlysmallifandonlyifitissufficientlysparse. Proof. First,fixasufficientlysparsesetA⊆Z. Letϕ(x,y¯,z¯)beanL-formula. Fix a tuple ¯b ∈ Zz¯ and let ∆(x) = {ϕ(x,a¯,¯b) : a¯ ∈ Ay¯}. Assume ∆(x) is consistent. | | | | We want to show ∆(x) is realized in Z. By quantifier elimination, we may write p ϕ(x,y¯,z¯) as ψ (x,y¯,z¯), where each ψ (x,y¯,z¯) is a conjunction of atomic α=1 α α and negated atomic L-formulas. For any L-term f(x,y¯,z¯) and integer n > 0, the negationoff(Wx,y¯,z¯)≡n 0isequivalentto rn=−11(f(x,y¯,z¯)−r ≡n 0). Therefore,by enlarging the tuple z¯ of variables, and the tuple ¯b of parameters, we may assume W no ψ contains the negation of f(x,y¯,z¯)≡ 0. α n Let c be a realization of ∆(x) in some elementary extension of Z. Let σ : ∗ Ay¯ −→ [p] be such that c realizes ψ (x,a¯,¯b). We may assume σ is surjective. ∗ σ(a¯) If some ψ contains a conjunct of the form f(x,y¯,z¯) = 0, for some term f(x,y¯,z¯) α withnonzerocoefficientonx, thenc isalreadyinZandthe desiredresultfollows. ∗ Altogether, we may assume that, for each α∈[p], ψ is of the form α f (x,y¯,z¯)6=0∧ g (x,y¯,z¯)≡ 0 i j nj i∈Îα j∈^Jα for some finite sets I ,J , L-terms f ,g , and integers n >0. Define the types α α i j j ∆ (x):={f (x,a¯,¯b)6=0:i∈I , a¯∈Ay¯} and 0 i σ(a¯) | | ∆ (x):={g (x,a¯,¯b)≡ 0:j ∈J , a¯∈Ay¯}. 1 j nj σ(a¯) | | Then c realizes ∆ (x)∪∆ (x) and ∆ (x)∪∆ (x) |= ∆(x). Since there are only ∗ 0 1 0 1 finitely many integers n appearing in ∆ (x), and ∆ (x) is consistent, we may use j 1 1 the Chinese Remainder Theorem to find n ≥ 1 and 0 ≤ r < n such that ∆ (x) 1 is equivalent to x ≡ r. Since there are only finitely many terms f appearing in n i ∆ (x), and ¯b is fixed, we may find integers m ,...,m ,k > 0 and c ,...,c ∈ Z 0 1 t 1 t such that {m x−c 6∈Σ (±A):1≤i≤t}∪{x≡ r}|=∆ (x)∪∆ (x). (†) i i k n 0 1 SetB ={x∈Z:m x−c ∈Σ (±A) for some 1≤i≤t}. By(†),itsufficestoshow i i k B does not contain nZ+r. Let m = m ·...·m and set F = { m c ,..., mc }. 1 t m1 1 mt t Given x∈B, there is some 1≤i≤t such that m m mx∈ (Σ (±A)+c )⊆Σ (±A)+ c . r i mr i m m i i Therefore mB ⊆ C := Σ (±A)+F. By Lemma 4.3, we have δ(C ∩N) = 0, and mr so C does not contain mnZ+mr. So B does not contain nZ+r, as desired. STABILITY AND SPARSITY IN SETS OF NATURAL NUMBERS 9 Conversely, suppose A⊆Z is not sufficiently sparse. Without loss of generality, assume 0∈A. By Proposition4.2, there is some n≥1 suchthat Σ (±A) contains n mZ for some m≥1. Then Th(Z )|=∀x(x≡ 0→∃y¯∈An(x=y +...+y )). (††) A m 1 n Let ϕ(x,y¯) := x ≡ 0∧x 6= y +...+y . Fix N |= Th(Z ) and let ∆(x) = m 1 n A {ϕ(x,a¯) : a¯ ∈ A(N)k}. Then ∆(x) is consistent, since mN is infinite, but ∆(x) is not realized in N by (††). (cid:3) Recall that Th(Z) is λ-stable if and only if λ ≥ 2ℵ0 and, moreover, Z does not have the finite cover property. Thus we may combine Lemma 4.4 with Facts 2.2 and 2.4 to make the following conclusion. Theorem 4.5. Suppose A ⊆ Z is sufficiently sparse. Then every L -formula is A bounded modulo Th(ZA) and, for any λ ≥ 2ℵ0, Th(ZA) is λ-stable if and only if Th(Aind) is λ-stable. Note that there are plenty of sets A ⊆ Z, which are not sufficiently sparse, but such that Th(Z ) is stable. In particular, no infinite Z-definable subset A ⊆ Z A canbe sufficiently sparse(by Fact 3.1(d)). For this reason,we will mainly focus on subsetsA⊆Zthatareeitherboundedaboveorboundedbelow. GivensuchasetA, we say the sequence (a ) is a monotonic enumeration of A if A={a :n∈N} n ∞n=0 n and(an)n N is either strictlyincreasingorstrictly decreasing. Any setofthis form ∈ is interdefinable, modulo Z, with a subset of N and so, since our main goal is understanding stability of Th(Z ), we will often focus on subsets of N. A WehaveshownthatifA⊆ZissufficientlysparsethenL -formulasarebounded A modulo Th(Z ), and a natural question asks how much this sparsity assumption A can be weakened. In this spirit, we give examples of sets A ⊆ N, which are still somewhat sparse, but for which L -formulas are not always bounded in Z . A A Proposition 4.6. Fix k ≥3 and let A={nk :n∈N}. Then A has upper Banach density 0, but there are L -formulas that are not bounded in Z . A A Proof. The reader may verify A has upper Banach density 0 (see Definition 8.7). Let (a ) be a monotonic enumeration of A. To show that there unbounded n ∞n=0 L -formulas, we use [5, Proposition 5.3]. In particular, we find an elementary A extension M of Z , and an elementary mapping in M := M | extending ∗ A ∗ +,0 { } a permutation of A = A(M), which is not elementary in M . So let M be an ∗ ∗ ∗ ℵ -saturated model of Th(Z ). Note that (a ) is eventually periodic modulo 0 A n ∞n=0 m, for any m>0. By compactness and saturation there are a,b∈A \Z such that ∗ a 6= b and a ≡ b for all m ≥ 1. Let f be the mapping on Z∪A which is the m ∗ identity on (Z∪A )\{a,b} and exchanges a and b. ∗ We argue first that f is L-elementary. We have f(0) = 0 and, by choice of a and b, f preserves congruences ≡ . So we need to show that f preserves addition m whereverit is defined. So fix nonzerox,y ∈A ∪Z, andsuppose x+y ∈A ∪Z. If ∗ ∗ x6∈Z then y 6∈Z (since lim a −a =∞) and y 6∈A \Z (by Fermat’s Last n n+1 n ∗ →∞ Theorem). Therefore x,y ∈Z, and so f(x+y)=f(x)+f(y). Finally, we show that f cannot be L -elementary. By the Hilbert-Waring The- A orem, there is some m ≥ 1 such that Σ (A) = N. So Th(Z ) contains an L - m A A sentence expressing that, for any distinct x and y exactly one of x−y or y−x can be writtenas a sum ofat mostm elements ofA. Thereforeno L -elementary map A can extend an involution exchanging two distinct elements. (cid:3) 10 GABRIELCONANT Remark 4.7. The proof of the previous result works for any A ⊆ N such that lim a − a = ∞, A is eventually periodic modulo m for any m ≥ 1, if n n+1 n →∞ a,b∈Aaresufficientlylargethena+b6∈A,andΣ (A)=Nforsomem≥1. This m last condition implies that N is definable in Z , and so Th(Z ) is unstable. A A Question 4.8. Is there a set A ⊆ N such that Th(Z ) is stable and not every A L -formula is bounded in Z ? A A 5. Induced structure In the last section, we gave a combinatorial condition on sets A ⊆ Z, which ensures L -formulas are bounded in Z . The next step toward determining sta- A A bility of Th(Z ) is to analyze the induced structure Aind. First, we use quantifier A elimination for Th(Z) in the language L to isolate a sublanguage Lind of L such ∗ that, for any A⊆Z, Aind is a definitional expansion of its reduct to Lind. Definition 5.1. (1) Let Lind be the set of relations R ∈ L , where ϕ is either x = 0 or an 0 ϕ ∗ atomic L-formula of the form x +...+x =y +...+y , 1 k 1 l for some variables x ,...,x ,y ,...,y . 1 k 1 l (2) LetLind =Lind∪{C :0≤r 0 and b ,...,b ∈ {0,...,n − 1}. Let I be the set of tuples r¯ ∈ 1 k {0,...,n−1}k suchthatthereisa¯∈ϕ(Ak)witha ≡ r foralli∈[k]. Notethat, i n i for any r¯∈I and a¯∈Ak, if a ≡ r for all 1≤i≤k then a¯∈ϕ(Ak). Therefore i n i k Aind |=∀x¯ R (x¯)↔ C (x ) . (cid:3) ϕ n,ri i ! r¯ Ii=1 _∈ ^ Convention 5.3. Given A ⊆ Z, we use the previous proposition to identify the L -structure Aind with its reduct to the language Lind. ∗ Definition 5.4. Given A⊆Z, define Aind to be the reduct of Aind to Lind. 0 0 To summarize the situation, consider a set A ⊆ Z. We build Aind in two steps. The firstis Aind, whichdescribes the A-solutions to homogeneouslinearequations. 0 ThenAind is anexpansionofAind by unary predicates for A∩(mZ+r), for all0≤ 0 r

Stability and sparsity in sets of natural numbers

Similar Stability and sparsity in sets of natural numbers