FINITE SUBSTRUCTURE LATTICES OF MODELS ... - Semantic Scholar
proceedings of the american mathematical society Volume 117, Number 3, March 1993
FINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC JAMES H. SCHMERL (Communicated by Andreas R. Blass) Abstract. Some new finite lattices (for example, A/4 , M7, and the hexagon lattice) are shown to be isomorphic to the lattice of elementary substructures of a model of Peano Arithmetic.
The set of elementary substructures of a model JV of Peano Arithmetic forms a lattice Lt(yf), the substructure lattice of jV. It is unknown whether there are finite lattices that are not isomorphic to any substructure lattice. Indeed, it was conjectured in [8] that for any finite lattice L there is some jV 1=PA for which L = \X(JV). It was proved in [8] that if 2 < n < co, then there is JV such that Lt(^T) = n(«). (The partition lattices U(n) are defined below.) For 3 < n < co, the lattice Mn is the unique lattice that has n + 2 elements and n atoms. Thus, the lattice A/3, which is isomorphic to n(3), is isomorphic to a substructure lattice, although it is known from [2] or [4] that if yV is a model of True Arithmetic and 3 < n < co, then Lt(yT) ^ Mn . Other examples of finite lattices that are not substructure lattices of models of True Arithmetic are given in [8]. The lattices Mn for 4 < n < co and the hexagon lattice were identified in [8] as specific finite lattices that were not known to be isomorphic to substructure lattices. It is a consequence of the theorem in this note that M„ , whenever n = p" + 1 for some prime p, the hexagon lattice, and the lattice Mi are isomorphic to substructure lattices. It is still unknown whether or not Mx! is isomorphic
to a substructure lattice. All previously known positive results about finite substructure lattices are contained in [8]. Prior to [8], Paris [4] proved that all finite distributive lattices occur as substructure lattices. (Also see [7].) Wilkie [9] showed that the pentagon lattice is a substructure lattice, and Paris [5] proved that M3 is a sublattice of an infinite substructure lattice. More generally, intermediate structure lattices will be considered. For „# -
n(,4, J?~) is a lattice isomorphism. For n > 1 let a": L —>11(^4") be the representation such that for each c, d £ A" and x £ L, c« d
(mod q"(x)) «• for every i a for each a £ A. Then L and U(A, y)
are
isomorphic lattices. In fact, let a: L —► 11(A) be such that for each x £ L, a(x) is the partition whose only equivalence class that (possibly) is not a singleton is {a £ A : a> x} . Then a: L —>Y1(A, y) is a lattice isomorphism.
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
MODELSOF PEANO ARITHMETIC
835
Let F be a finite field of order q, and let n = q + 1. Let A = F x F, and let / £ y iff there are a, b, c, d £ F such that f(x, y) = (ax + b, cy + d). Then U(A, y) 3 Mn . An observation due to Feit [ 1] implies that Mj has a finite congruence representation.
Finally, let A = {0, 1, 2, 3, 4, 5, 6}. Then there is y such that n(,4, y) is isomorphic to the hexagon lattice. Specifically, n(^, y) = {(L,, 1^ , {{0},
{1,2}, {3,4}, {5,6}}, {{0, 1,2}, {3,4}, {5,6}}, {{0}, {1,3}, {4,6}, {2,5}}, {{0,4,6}, {1,3}, {2,5}}}. We now proceed with the proof of the theorem.
Lemma 1. Suppose L is a finite lattice, a: L —>11(^4) is a representation, and
2 U(A, y) is a lattice isomorphism. Without loss of generality assume that y has the identity function and all constant functions as members. Let % be the set of all functions g: A" —► A" for which there are fo, fi,..., fn-\ £ S? such that g((a0,ax, ... , a„_.)) = (/o(a0), f (a.),..., /„_i(a„_i)). We introduce the following notation to be used for the rest of this proof: for any x we denote by x the n-tuple (x, x, ... , x). Now let §?x be the set of all functions g: A" —► A" where for some i < n , g((an, ai, ... , a„_i)) = ~a[. Let ^ = £b U &\. We claim that a": L -> n(^" , ^) is a lattice isomorphism. First we show that a"(x) e n(^4" , ,f) for x £ L. Suppose g £ % , so that g((a0,ai, ... ,a„_i)) = (/o(tfo), f\(a\), ■■■, fn-\(an-\)) ■Then c w a" (mod a"(x)) => for all / < n, c,-w a", (mod a(x)) => for all i < n, f(Cj) w //(a1,) (mod a(x)) => /n-i(rfn-i)) =*>g(c) « £?(#") (mod a"(x)).
(moda"(x))
Next suppose g e ^i, so that g((ao, ax, ... , an-\)) = a7. Then c « cf (mod a"(x)) =$■Cj « a",- (mod a(x))
=>cj « a",- (mod a"(x)) =*S(c)**(• for each i < n , c, « a", (mod a(x)) => c k d (moda"(x)). To show that 7r < a"(x), consider c, d £ A" for which c « d (mod a"(x)). Let g0, Si, • • • , gn-\ € % be such that for i < n, gi((a0, a, , ... , a„_.)) =
(60, 61,... , 6„-i}, where
{dj
if /' < /, a, if j = i, Cj if 7 > i
for_all (a0, a., ... , a„_.) € /I". Then c = £0(co), gi(ci) * c?/(^/) (mod rc), i?/(^i) = c?!+i(c7+T),and g„_i(a'„_1) = a". Therefore, c « a" (mod rc). n Definition. Let a: L —>FI(/4) and /?: L —► n(fl) be representations of L. Then a arrows ft (in symbols: a —>/?) if whenever n £ 11(A) there is an injection 6: B -+ A such that (1) whenever x £ L and a, b £ B, then
a « b (mod /?(*)) «- 0(a) « 0(6)
(mod a(x))
and (2) there is x e L such that whenever a, b £ B , then
aztb
(mod 0(x))& 6(a)* 6(b)
We will refer to such a function
(modn).
6 as a n-demonstrator for a —► /?.
The next lemma is a consequence of the canonical partition theorem of Promel and Voigt [6]. This lemma was explicitly stated in Example 3.3 of [8] and was used there to prove the instance (see [8, Corollary 5.5]) of the theorem
when L 9£11(A).
Lemma 2. Let A be a finite set and let y: 11(A)—>11(A) be the identity representation. Then for each m > 1 there is n such that y" -» ym . The next lemma is the main ingredient in the proof of the theorem. Lemma 3. Suppose a: L -* Yl(A) is a finite congruence representation. Then there is n>\ such that a" —► a. Proof. Let a: L —>H(A) be a finite congruence representation. Let (A,&~) be a unary algebra such that a: L -+ U(A , y) is a lattice isomorphism. Without loss of generality, we assume that the identity function is in y (so y ^ 0 ) and that y is closed under composition. Let m — \Sr\ > 1 . Letting y: 11(A) —>
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
MODELSOF PEANO ARITHMETIC
837
n(^4) be the identity function, we can get n by Lemma 2 so that y" —>ym . We claim that a" —>a. In order to prove that a" -> a, consider some n £ Y1(A"). To obtain a ft-demonstrator for a" —>a, let y = {^o, f\, ■■■, fm-1} >and let F: A —>Am be the function for which F(a) = (fo(a), f(a), ... , fm-\(a)) for each a £ A . Let 0j be a zr-demonstrator for 7" —>ym , and then let 6 = 6Xo F. We will show that 0 is a n-demonstrator for a" —>a. Conditions (1) and (2) in the definition need to be proved.
Proof of (1). Suppose c, d £ A" and x £ L. Notice that ak = yk o a for 1 < k < co. Then each of the following equivalences is clear.
6(c) x 6(d) (mod an(x))&6x(F(c))& 6x(F(d)) (mod y"(a(x))) &F(c)*F(d) (mod ym(a(x))) &F(c)*F(d) (modam(x)) •» for each i < m, f(c) « f(d) (mod a(x)) «• c « d (moda(x)). This proves (1) in the definition. Proof of (2). Suppose that n £ U(A"), and let p £ U(A) be the partition such
that a « b (mod p) & 6(a) « 6(b) (mod n) whenever a, b £ A . In order to prove (2), we need to show that p £ X1(A, S* ). To do this, consider some i < m and arbitrary a, b £ A for which a « b (mod p). Then 6(a) w 6(b) (mod n). Hence, there is px £ Y1(A, SF) such that F(a) « F(b) (mod ym(px)), so that for each k < m, /fc(a) « /*(£) (mod px). Since y is closed under composition, for each j < m , f(f(a)) «
fj(f(b)) (mod //,). It follows that F(y)(a)) « F(f(b)) (mod yw(//i)), so that 6x(F(f(a))) « 6x(F(f(b))) (mod y"(px)); consequently, 0(^(a)) « &(/■(&)) (mod n), so that yj-(a)« ^(/3) (mod //). This proves p £ U(A, SF). □ The following corollary generalizes Lemma 2. Corollary 4. Suppose a: L —>n(^) is a finite congruence representation. Then for each m > 1 f/zeve w n such that a" —► am . Proof. This follows immediately from Lemmas 1 and 3 and the observation that (a")k and ank are isomorphic representations. □
We can now conclude the following corollary, which involves a technical definition from [8]. The reader is referred to [8] for a precise statement of this definition.
Corollary 5. // L is a finite lattice that has a finite congruence representation, then for each n < co, L has an n-CPP representation. Proof. The «-CPP representation a„ of L is obtained as follows. Let a be a finite congruence representation of L. Let an = a2, which by Lemma 1 is a nontrivial finite congruence representation. Recursively obtain finite congruence representations an+x so that an+x —► an . This is possible by Lemmas 1 and 3. The representation an is an n-CPP representation of L. □ The theorem follows immediately from Corollary 5, Theorem 4.1 of [8], and
Remark 5.1 of [8].
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
838
j. h. schmerl
References 1. W. Feit, An interval in the subgroup lattice of a finite group which is isomorphic to M-,,
AlgebraUniversalis17 (1983), 220-221. 2. H. Gaifman, Models and types ofPeano's arithmetic, Ann. Math. Logic 9 (1976), 223-306. 3. G. Gratzer and E. T. Schmidt, Characterizations of congruence lattices of abstract algebras.
Acta. Sci. Math. (Szeged)24 (1963), 34-39. 4. J. Paris, On models of arithmetic, Conference in Mathematical Logic, London '70, Lecture
Notes in Math., vol. 225, Springer-Verlag, Heidelberg and New York, 1972, pp. 252-280.
5. _,
Modelsof arithmetic and the 1-3-1lattice, Fund. Math. 95 (1977), 195-199.
6. H. J. Promel and B. Voigt, Canonical partition theorems for parameter sets, J. Combin.
Theory (A) 35 (1983), 309-327. 7. J. H. Schmerl, Extending models of arithmetic, Ann. Math. Logic 14 (1978), 89-109. 8. _,
Substructure lattices of models of Peano Arithmetic, Logic Colloquium '84, North-
Holland, Amsterdam, 1986, pp. 225-243. 9. A. Wilkie, On models of arithmetic having non-modular substructure lattices, Fund. Math.
95(1977), 223-237. Department
of Mathematics,
University
of Connecticut,
E-mail address: [email protected]
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
Storrs,
Connecticut
06269
FINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC JAMES H. SCHMERL (Communicated by Andreas R. Blass) Abstract. Some new finite lattices (for example, A/4 , M7, and the hexagon lattice) are shown to be isomorphic to the lattice of elementary substructures of a model of Peano Arithmetic.
The set of elementary substructures of a model JV of Peano Arithmetic forms a lattice Lt(yf), the substructure lattice of jV. It is unknown whether there are finite lattices that are not isomorphic to any substructure lattice. Indeed, it was conjectured in [8] that for any finite lattice L there is some jV 1=PA for which L = \X(JV). It was proved in [8] that if 2 < n < co, then there is JV such that Lt(^T) = n(«). (The partition lattices U(n) are defined below.) For 3 < n < co, the lattice Mn is the unique lattice that has n + 2 elements and n atoms. Thus, the lattice A/3, which is isomorphic to n(3), is isomorphic to a substructure lattice, although it is known from [2] or [4] that if yV is a model of True Arithmetic and 3 < n < co, then Lt(yT) ^ Mn . Other examples of finite lattices that are not substructure lattices of models of True Arithmetic are given in [8]. The lattices Mn for 4 < n < co and the hexagon lattice were identified in [8] as specific finite lattices that were not known to be isomorphic to substructure lattices. It is a consequence of the theorem in this note that M„ , whenever n = p" + 1 for some prime p, the hexagon lattice, and the lattice Mi are isomorphic to substructure lattices. It is still unknown whether or not Mx! is isomorphic
to a substructure lattice. All previously known positive results about finite substructure lattices are contained in [8]. Prior to [8], Paris [4] proved that all finite distributive lattices occur as substructure lattices. (Also see [7].) Wilkie [9] showed that the pentagon lattice is a substructure lattice, and Paris [5] proved that M3 is a sublattice of an infinite substructure lattice. More generally, intermediate structure lattices will be considered. For „# -
n(,4, J?~) is a lattice isomorphism. For n > 1 let a": L —>11(^4") be the representation such that for each c, d £ A" and x £ L, c« d
(mod q"(x)) «• for every i a for each a £ A. Then L and U(A, y)
are
isomorphic lattices. In fact, let a: L —► 11(A) be such that for each x £ L, a(x) is the partition whose only equivalence class that (possibly) is not a singleton is {a £ A : a> x} . Then a: L —>Y1(A, y) is a lattice isomorphism.
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
MODELSOF PEANO ARITHMETIC
835
Let F be a finite field of order q, and let n = q + 1. Let A = F x F, and let / £ y iff there are a, b, c, d £ F such that f(x, y) = (ax + b, cy + d). Then U(A, y) 3 Mn . An observation due to Feit [ 1] implies that Mj has a finite congruence representation.
Finally, let A = {0, 1, 2, 3, 4, 5, 6}. Then there is y such that n(,4, y) is isomorphic to the hexagon lattice. Specifically, n(^, y) = {(L,, 1^ , {{0},
{1,2}, {3,4}, {5,6}}, {{0, 1,2}, {3,4}, {5,6}}, {{0}, {1,3}, {4,6}, {2,5}}, {{0,4,6}, {1,3}, {2,5}}}. We now proceed with the proof of the theorem.
Lemma 1. Suppose L is a finite lattice, a: L —>11(^4) is a representation, and
2 U(A, y) is a lattice isomorphism. Without loss of generality assume that y has the identity function and all constant functions as members. Let % be the set of all functions g: A" —► A" for which there are fo, fi,..., fn-\ £ S? such that g((a0,ax, ... , a„_.)) = (/o(a0), f (a.),..., /„_i(a„_i)). We introduce the following notation to be used for the rest of this proof: for any x we denote by x the n-tuple (x, x, ... , x). Now let §?x be the set of all functions g: A" —► A" where for some i < n , g((an, ai, ... , a„_i)) = ~a[. Let ^ = £b U &\. We claim that a": L -> n(^" , ^) is a lattice isomorphism. First we show that a"(x) e n(^4" , ,f) for x £ L. Suppose g £ % , so that g((a0,ai, ... ,a„_i)) = (/o(tfo), f\(a\), ■■■, fn-\(an-\)) ■Then c w a" (mod a"(x)) => for all / < n, c,-w a", (mod a(x)) => for all i < n, f(Cj) w //(a1,) (mod a(x)) => /n-i(rfn-i)) =*>g(c) « £?(#") (mod a"(x)).
(moda"(x))
Next suppose g e ^i, so that g((ao, ax, ... , an-\)) = a7. Then c « cf (mod a"(x)) =$■Cj « a",- (mod a(x))
=>cj « a",- (mod a"(x)) =*S(c)**(• for each i < n , c, « a", (mod a(x)) => c k d (moda"(x)). To show that 7r < a"(x), consider c, d £ A" for which c « d (mod a"(x)). Let g0, Si, • • • , gn-\ € % be such that for i < n, gi((a0, a, , ... , a„_.)) =
(60, 61,... , 6„-i}, where
{dj
if /' < /, a, if j = i, Cj if 7 > i
for_all (a0, a., ... , a„_.) € /I". Then c = £0(co), gi(ci) * c?/(^/) (mod rc), i?/(^i) = c?!+i(c7+T),and g„_i(a'„_1) = a". Therefore, c « a" (mod rc). n Definition. Let a: L —>FI(/4) and /?: L —► n(fl) be representations of L. Then a arrows ft (in symbols: a —>/?) if whenever n £ 11(A) there is an injection 6: B -+ A such that (1) whenever x £ L and a, b £ B, then
a « b (mod /?(*)) «- 0(a) « 0(6)
(mod a(x))
and (2) there is x e L such that whenever a, b £ B , then
aztb
(mod 0(x))& 6(a)* 6(b)
We will refer to such a function
(modn).
6 as a n-demonstrator for a —► /?.
The next lemma is a consequence of the canonical partition theorem of Promel and Voigt [6]. This lemma was explicitly stated in Example 3.3 of [8] and was used there to prove the instance (see [8, Corollary 5.5]) of the theorem
when L 9£11(A).
Lemma 2. Let A be a finite set and let y: 11(A)—>11(A) be the identity representation. Then for each m > 1 there is n such that y" -» ym . The next lemma is the main ingredient in the proof of the theorem. Lemma 3. Suppose a: L -* Yl(A) is a finite congruence representation. Then there is n>\ such that a" —► a. Proof. Let a: L —>H(A) be a finite congruence representation. Let (A,&~) be a unary algebra such that a: L -+ U(A , y) is a lattice isomorphism. Without loss of generality, we assume that the identity function is in y (so y ^ 0 ) and that y is closed under composition. Let m — \Sr\ > 1 . Letting y: 11(A) —>
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
MODELSOF PEANO ARITHMETIC
837
n(^4) be the identity function, we can get n by Lemma 2 so that y" —>ym . We claim that a" —>a. In order to prove that a" -> a, consider some n £ Y1(A"). To obtain a ft-demonstrator for a" —>a, let y = {^o, f\, ■■■, fm-1} >and let F: A —>Am be the function for which F(a) = (fo(a), f(a), ... , fm-\(a)) for each a £ A . Let 0j be a zr-demonstrator for 7" —>ym , and then let 6 = 6Xo F. We will show that 0 is a n-demonstrator for a" —>a. Conditions (1) and (2) in the definition need to be proved.
Proof of (1). Suppose c, d £ A" and x £ L. Notice that ak = yk o a for 1 < k < co. Then each of the following equivalences is clear.
6(c) x 6(d) (mod an(x))&6x(F(c))& 6x(F(d)) (mod y"(a(x))) &F(c)*F(d) (mod ym(a(x))) &F(c)*F(d) (modam(x)) •» for each i < m, f(c) « f(d) (mod a(x)) «• c « d (moda(x)). This proves (1) in the definition. Proof of (2). Suppose that n £ U(A"), and let p £ U(A) be the partition such
that a « b (mod p) & 6(a) « 6(b) (mod n) whenever a, b £ A . In order to prove (2), we need to show that p £ X1(A, S* ). To do this, consider some i < m and arbitrary a, b £ A for which a « b (mod p). Then 6(a) w 6(b) (mod n). Hence, there is px £ Y1(A, SF) such that F(a) « F(b) (mod ym(px)), so that for each k < m, /fc(a) « /*(£) (mod px). Since y is closed under composition, for each j < m , f(f(a)) «
fj(f(b)) (mod //,). It follows that F(y)(a)) « F(f(b)) (mod yw(//i)), so that 6x(F(f(a))) « 6x(F(f(b))) (mod y"(px)); consequently, 0(^(a)) « &(/■(&)) (mod n), so that yj-(a)« ^(/3) (mod //). This proves p £ U(A, SF). □ The following corollary generalizes Lemma 2. Corollary 4. Suppose a: L —>n(^) is a finite congruence representation. Then for each m > 1 f/zeve w n such that a" —► am . Proof. This follows immediately from Lemmas 1 and 3 and the observation that (a")k and ank are isomorphic representations. □
We can now conclude the following corollary, which involves a technical definition from [8]. The reader is referred to [8] for a precise statement of this definition.
Corollary 5. // L is a finite lattice that has a finite congruence representation, then for each n < co, L has an n-CPP representation. Proof. The «-CPP representation a„ of L is obtained as follows. Let a be a finite congruence representation of L. Let an = a2, which by Lemma 1 is a nontrivial finite congruence representation. Recursively obtain finite congruence representations an+x so that an+x —► an . This is possible by Lemmas 1 and 3. The representation an is an n-CPP representation of L. □ The theorem follows immediately from Corollary 5, Theorem 4.1 of [8], and
Remark 5.1 of [8].
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
838
j. h. schmerl
References 1. W. Feit, An interval in the subgroup lattice of a finite group which is isomorphic to M-,,
AlgebraUniversalis17 (1983), 220-221. 2. H. Gaifman, Models and types ofPeano's arithmetic, Ann. Math. Logic 9 (1976), 223-306. 3. G. Gratzer and E. T. Schmidt, Characterizations of congruence lattices of abstract algebras.
Acta. Sci. Math. (Szeged)24 (1963), 34-39. 4. J. Paris, On models of arithmetic, Conference in Mathematical Logic, London '70, Lecture
Notes in Math., vol. 225, Springer-Verlag, Heidelberg and New York, 1972, pp. 252-280.
5. _,
Modelsof arithmetic and the 1-3-1lattice, Fund. Math. 95 (1977), 195-199.
6. H. J. Promel and B. Voigt, Canonical partition theorems for parameter sets, J. Combin.
Theory (A) 35 (1983), 309-327. 7. J. H. Schmerl, Extending models of arithmetic, Ann. Math. Logic 14 (1978), 89-109. 8. _,
Substructure lattices of models of Peano Arithmetic, Logic Colloquium '84, North-
Holland, Amsterdam, 1986, pp. 225-243. 9. A. Wilkie, On models of arithmetic having non-modular substructure lattices, Fund. Math.
95(1977), 223-237. Department
of Mathematics,
University
of Connecticut,
E-mail address: [email protected]
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
Storrs,
Connecticut
06269
