Atoms in infinite dimensional free sequence-set algebras
Mohamed Khaled, Istv\'an N\'emeti

TL;DR
This paper investigates the atomic structure of free algebras in various classes related to cylindric algebras, confirming Tarski's conjecture for some classes and providing counterexamples for others.
Contribution
It proves Tarski's conjecture holds for certain classes of algebras but shows the free $ ext{Crs}_ ext{alpha}$ algebra is atomless, highlighting differences among algebra classes.
Findings
Tarski's conjecture is true for $ ext{D}_ ext{alpha}$ and $ ext{G}_ ext{alpha}$ classes.
The free $ ext{Crs}_ ext{alpha}$ algebra is atomless.
Confirmed the conjecture for classes $ ext{D}_ ext{alpha}$ and $ ext{G}_ ext{alpha}$.
Abstract
A. Tarski proved that the m-generated free algebra of , the class of cylindric algebras of dimension , contains exactly zero-dimensional atoms, when is a finite cardinal and is an arbitrary ordinal. He conjectured that, when is infinite, there are no more atoms. This conjecture has not been confirmed or denied yet. In this article, we show that Tarski's conjecture is true if is replaced by , , but the -generated free algebra is atomless.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Atoms in infinite dimensional free sequence-set algebras
Mohamed Khaled
Mohamed Khaled, Faculty of Engineering and Natural Sciences, Bahçeşehir University, Istanbul, Turkey.
and
István Németi
István Németi, Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary.
Abstract.
A. Tarski proved that the m-generated free algebra of , the class of cylindric algebras of dimension , contains exactly zero-dimensional atoms, when is a finite cardinal and is an arbitrary ordinal. He conjectured that, when is infinite, there are no more atoms. This conjecture has not been confirmed or denied yet. In this article, we show that Tarski’s conjecture is true if is replaced by , , but the -generated free algebra is atomless.
1. Introduction
Free algebras play an important role in universal algebra, and especially in the theory of Boolean algebras with operators (BAO’s), see, e.g., [5], [3], [2, §5.6] and [11]. One of the first things to investigate about these free algebras is whether they are atomic or not, i.e., whether their Boolean reducts are atomic or not. An atomic Boolean algebra is an algebra in which below every non-zero element there is an atom, i.e., a minimal non-zero element. Let be a class of similar algebras. For each cardinal , let stand for the -generated free algebra.
Cylindric algebras are special BAO’s that were introduced by A. Tarski around 1947. These are Boolean algebras equipped with unary operations, called cylindrifications, and constant symbols, called diagonals. These algebras capture the intrinsic algebraic side of first order logic (FOL), see [1, section 4.3]. Let be any ordinal.
Definition 1.1**.**
A cylindric algebra of dimension is an algebra of the form
[TABLE]
where is a non-empty set, are binary operations, are unary operations, are constant symbols, and satisfies the following postulates for every and every :
- (CA 0)
is Boolean algebra, 2. (CA 1)
, 3. (CA 2)
, 4. (CA 3)
, 5. (CA 4)
, 6. (CA 5)
, 7. (CA 6)
If , then , 8. (CA 7)
If , then .
The class of all cylindric algebras of dimension is denoted by . Atoms in the free cylindric algebras correspond to finitely axiomatizable complete and consistent theories of FOL. In the present paper, we are interested in the case when is infinite, so is assumed throughout the paper.
We will prove some results connected to a conjecture of A. Tarski [1, Remark 2.5.12 and Problem 2.6]. This conjecture is concerned with atoms and zero-dimensional elements in the finitely generated free cylindric algebras of dimension . An element of a cylindric algebra is said to be zero-dimensional if it is a fixed-point of all the cylindrifications, i.e., if for each .
In this section, we outline the background for this conjecture and we state our main theorems. Let be any cardinal. Let be a class of cylindric algebras containing at least one non-trivial algebra (i.e., having more than one-element). The following are true:
- (Fact 1)
If is infinite, then is atomless. This is due to D. Pigozzi [1, Theorem 2.5.13], and the proof can be easily generalized for any class of Boolean algebras with operators. 2. (Fact 2)
Assume that is finite. In [1, Theorem 2.5.11], it is proved that contains exactly zero-dimensional atoms (i)(i)(i)Tarski’s proof is only about , but it works verbatim for the class .. 3. (Fact 3)
The [math]-generated free algebra contains exactly one atom, namely , by [1, Theorem 2.5.11]. We show that it contains no other atom. Indeed, let be such that . It is not hard to see that, for every , the set is finite (which means is locally finite dimensional, see [1, Definition 1.11.1 (i)]). This is true because is [math]-generated. So, we can find such that , and . By [1, Theorem 1.3.19], it follows that . Now, by the cylindric equations (CA 0) - (CA 7), we have
[TABLE]
[TABLE]
Hence, and . Thus, is not an atom as desired. 4. (Fact 4)
Suppose that . Tarski conjectured that all the atoms in the free algebra are zero-dimensional. See [1, Remark 2.5.12 and Problem 2.6]. To the best of our knowledge, this conjecture remains open.
denotes the class of -dimensional representable cylindric algebras, it will be defined in the next section. First, we show that Tarski’s conjecture is true when is replaced by .
Theorem 1.2**.**
For each finite cardinal , there are exactly many atoms in , each of these atoms is zero-dimensional.
Proof.
Recall from (Fact 2) that the free algebra contains exactly many zero-dimensional atoms. These atoms are listed in Lemma 3.2 herein (and also in [1, Theorem 2.5.11]), and it is apparent that their sum is . It remains to prove that there is no atom below in the algebra . We use the fact that is generated as a variety by its locally finite dimensional algebras, see [2, Theorem 3.1.123]. Assume that is such that . We show that is not an atom. We may assume that is a term, so it has a value in any algebra and evaluation pair. By in we have that in some locally finite dimensional algebra (with an appropriate evaluation of the variables occurring in ). In the algebra , we can find such that , and . Recall , so [1, Theorem 1.3.18 (iii)] implies that is also true in . Again, similarly to our argument in (Fact 3),
[TABLE]
[TABLE]
Hence, and are true in . Thus, the same is true in the free algebra , so is not an atom, as desired. ∎
In this article, we investigate whether the above theorem remains true if is replaced by any of the relativized classes of cylindric algebras , , . These classes will be defined in the next section. The notion of a relativized algebra was introduced in algebraic logic by L. Henkin. Relativization was proved potent in obtaining positive results in logic, see, e.g., [12], [8] and [6]. For some properties of these classes, see, e.g., [10], [4] and [7]. For instance, in contrary to , the equational theories of the classes and are decidable [3, 6]. The decidability of the equational theory of the class remains open.
Theorem 1.3** (Main Result 1).**
Let be an infinite ordinal and let be a finite cardinal. The following are true:
- (1)
The free algebra is atomless. 2. (2)
The free algebra is not atomic, but it contains exactly -many atoms each of which is zero-dimensional, when is any of , or .
The proof of Theorem 1.2 depends essentially on the fact that is generated by locally finite dimensional algebras. The same is not true for the relativized classes of cylindric algebras, therefore the same argument cannot be used to prove Theorem 1.3. We will prove a stronger theorem, Theorem 2.4 in the next section, which will imply Theorem 1.3.
The proofs of Theorem 1.3 and Theorem 2.4 go by showing that there are no elements in the free algebras that are disjoint from all the diagonals . Theorem 1.4 below shows that the same is not true for , therefore for settling the conjecture for , one has to use other techniques, too.
Theorem 1.4** (Main Result 2).**
Let be any ordinal and let be a finite cardinal. Then, there is such that and for every with .
It is worth of note that atomicity of these free algebras correspond to the failure of a version of Gödel’s incompleteness theorem for the corresponding logics. For more detail about this correspondence, see [3], [13] and [15]. For results concerning the atomicity of free algebras of logics, one can see [1, 2, 3, 5, 9, 11, 13, 14, 15, 16, 17, 18].
2. Algebras of sets of sequences
Throughout, fix an infinite ordinal . A function with domain is called a sequence of length (a sequence for short). For every and every two sequences , we write if and only if for some , where is the sequence which agrees with everywhere except that it’s value at equals . Let be a set of sequences of length . Such set is called an -dimensional unit. The smallest set that satisfies is called the base of the unit .
Let . Define the -diagonal of the unit as follows: . For each , define . This is called the -cylindrification of in the direction . When no confusion is likely, we omit the superscript from the above defined objects.
Definition 2.1**.**
The full cylindric-like algebra over the unit is an algebra of the form
[TABLE]
where is the family of all subsets of , are the Boolean set-theoretic operations, is the empty set, and the ’s and the ’s are as defined above.
Let be a class of algebras of same signature. Then, , and are the classes that consist of the isomorphic copies, subalgebras and homomorphic images, respectively, of the members of .
Definition 2.2**.**
We define the following classes of cylindric-like set algebras.
- •
The class of all relativized cylindric set algebras is given by
[TABLE]
- •
The class of diagonalizable cylindric set algebras is given by
[TABLE]
where an -dimensional unit is diagonalizable if it satisfies , for each and each .
- •
The class of locally square cylindric set algebras is given by
[TABLE]
where a union of -dimensional squares is an -dimensional unit of the form for some family of non-empty sets .
- •
The class of generalized cylindric set algebras is given by
[TABLE]
where is a union of mutually disjoint -dimensional squares if there is a family of mutually disjoint non-empty sets such that .
We note that , , and are varieties, and it is still open whether . Since we are dealing with many classes, it is more convenient to prove a general theorem which implies Theorem 1.3. We need to generalize our definitions, too.
Definition 2.3**.**
Let be a class of -dimensional units.
- •
We say that supports diagonalization iff for each , each and each .
- •
We say that requires diagonalization iff contains a singleton, and for each , each and each .
For any class of -dimensional units, if requires diagonalization then must also support diagonalization, but the converse is not necessarily true. Let be a class of similar algebras, then stands for the smallest variety containing . One can easily see that each of the classes , and can be viewed as for some class of -dimensional units that require diagonalization. The same is not true for the class . However, can be introduced as the variety generated by the class of full algebras of all -dimensional units.
Theorem 2.4**.**
Let be a class of cylindric-type algebras such that for some class of -dimensional units. Let be a finite cardinal. The following are true:
- (1)
If supports diagonalization, then the free algebra is not atomic. 2. (2)
If requires diagonalization, then the following are true:
- (a)
* contains exactly -many atoms.* 2. (b)
All the atoms of are zero-dimensional. 3. (c)
There is a decomposition such that , is discrete and is atomless. 3. (3)
If is the class of all -dimensional units, then is atomless.
Theorem 2.3 implies Theorem 1.2 since the classes of -units, -units and -units require diagonalization, while the class of -units supports diagonalization. We divide the proof of Theorem 2.4 into some lemmas and propositions. Throughout the remaining part of this paper, fix classes and , and a cardinal satisfying the assumptions of the Theorem 2.4.
3. The atomic part in
Let be the algebraic type of cylindric-like algebras, it consists of binary operations , , unary operations () and constant symbols (). Let be any set, the set of all terms generated by in the signature is defined to be the smallest set satisfying:
- •
and for each ,
- •
For each , we have ,
- •
For each and each , we have .
Note that the equational theory of coincides with the equational theory of . So, for example, whenever we say that , for some term , we will assume that there is a unit , and an evaluation such that . The latter means that is a member of the interpretation of in the algebra under the evaluation . Examples of equations that are true inf the class (cf., [9, Theorem 9.4] and [1, Theorem 1.2.6 (ii) and Theorem 1.2.11]): For with ,
- (Eq 1)
. 2. (Eq 2)
. 3. (Eq 3)
. 4. (Eq 4)
. 5. (Eq 5)
. 6. (Eq 6)
. 7. (Eq 7)
.
Let be the generating set of the free algebra . Let , such function is called a choice function for . For each , let if otherwise let . Define .
Lemma 3.1**.**
Suppose that requires diagonalization. Let be such that , and let be a choice function. Then,
[TABLE]
Consequently, is a zero-dimensional element in the algebra .
Proof.
Suppose that , , and are as required above. Let , and be such that . Then . Suppose that . Since requires diagonalization then , and . This implies that which contradicts the assumptions. Hence, and similarly . Now, we show that . Suppose towards a contradiction that . Then there is in the base of and such that . Hence, . By assumptions, we have and . Then , which implies . This contradicts the assumptions. Thus, . We have shown that . The desired follows by the symmetry of indices.
Let . To show that is zero-dimensional, we need to prove that . By the first part, we have
[TABLE]
Thus,
[TABLE]
Hence, is zero-dimensional and we are done. ∎
Now, we will show that each of the zero-dimensional elements, given in the above lemma, is an atom in the free algebra .
Lemma 3.2**.**
Suppose that requires diagonalization. Let be such that , and let be a choice function. Then is an atom in the free algebra .
Proof.
Suppose that requires diagonalization. Let be such that , and let be a choice function. Let . Let , such unit is guaranteed to exist by the assumption that requires diagonalization. Define as follows: For each , let if and otherwise. Clearly, , i.e., is not zero in . To prove that is an atom in , it is enough to prove the following: For any term ,
[TABLE]
We prove (3.1) by induction on the complexity of the term . Obviously, (3.1) holds if for some . Also, Lemma 3.1 guarantees that (3.1) is true if for some . It is not hard to see that the induction step holds for the Boolean connectives. We will show that the induction step also holds for the cylindrification operations. To do that, we will use that fact that cylinderifications are additive and complemented operators. Let for some and . Remember that is zero-dimensional, so and . By the induction hypothesis, we have one of the following cases.
- (a)
Either, . In this case, we have
[TABLE] 2. (b)
Or, . Here,
[TABLE]
We have proved (3.1). Therefore, is an atom in . ∎
We showed that contains at least zero-dimensional atoms if requires diagonalization. Note that, in this case, the sum of all these atoms in is equal to which can be shown to be zero-dimensional element by the argument used in Lemma 3.1. In the following section, we will prove that does not contain any extra atom.
4. The non-atomic part in
For each term , we let be the set of all indices that appear in . Let and let be two sequences of length . We write if and only if for each . We start with the following proposition.
Proposition 4.1**.**
Suppose that supports diagonalization. Then there is no atom below in the free algebra .
Proof.
Suppose that supports diagonalization. Let be a cylindric-term that satisfies . We prove that is not an atom in . Let , and be an evaluation such that . We can find such that , for some , and . Let , since every term is built up from finitely many symbols in the signature then must be finite. Let be such that .
Case 1: Suppose that . Recall that . So, without loss of generality, we may assume that . Let
[TABLE]
Note that because supports diagonalization. Define as follows: For each ,
[TABLE]
For each and each , if and , then
[TABLE]
This can be shown by a simple induction argument on the complexity of the term as follows. Obviously, (4.1) is true for the case when and when , . Also, it is not hard to see that the induction step holds for the Boolean connectives. Now, suppose that and . That means and , too. Let be such that . Note that for any , if then and so . Now by the induction hypothesis, we have
[TABLE]
Similarly, . We have shown that (4.1) is true. Thus, in particular, we have
[TABLE]
By the choice of , we have for each . Hence,
[TABLE]
On the other hand, and . Whence, it follows that
[TABLE]
Therefore, by (4.2), (4.3) and (4.4), is not an atom in .
Case 2: Suppose that . Let
[TABLE]
Again, the assumption on guarantees that . Define as follows: For each ,
[TABLE]
Similarly to the above case, cf. (4.1), one can easily show that
[TABLE]
Moreover, the choice of and implies
[TABLE]
Therefore, again by (4.5) and (4.6), is not an atom in . ∎
Now, we are ready to prove the main result of this paper.
Proof of Theorem 2.4.
Let be a class of -dimensional units and let be a finite cardinal.
- (1)
If supports diagonalization, then Proposition 4.1 implies that is not atomic. 2. (2)
Suppose that requires diagonalization. By Lemma 3.1, Lemma 3.2 and Proposition 4.1, we have shown that contains exactly -many atoms, each of which is zero-dimensional. Let be the subalgebra generated by , and let be the subalgebra generated by . It is not hard to see that is an isomorphism from onto . Clearly, and satisfy the desired of item (c). 3. (3)
Suppose that is the class of all -dimensional units. Let be the generating set of the free algebra . Let be any term such that . We will show that is not an atom in .
Let , and be an evaluation such that . Let and let be such that . Pick brand new elements that are not in the base of such that . For every with , let be the sequence given as follows: , and , for every . Set . Define the evaluation as follows. For each , let . We are going to show that for every and every , if and then
[TABLE]
This can be shown by an induction on the complexity of the term as follows. Obviously, (4.7) is true for the case when and when , . Again, it is not hard to see that the induction step holds for the Boolean connectives. Now, suppose that and . That means and , too. Let be such that . By the induction hypothesis, we have
[TABLE]
We have shown that (4.7) is true. Thus, in particular, we have . But, by the choice of and , we have
[TABLE]
Therefore, both and are non-zero in the free algebra , i.e., is not an atom in , as desired.∎
By the argument we used in (Fact 3), see page (Fact 3) herein, we know that each of the free algebras and contains exactly atom which happens to be zero-dimensional. This argument cannot be used to obtain similar results for the [math]-generated free algebras of the classes and because none of these is locally finite dimensional. Moreover, our method here to obtain the results concerning these classes depends essentially on the assumption , see Proposition 4.1.
Problem**.**
Are there any non-zero-dimensional atoms in or in ? Is any of and atomic?
5. On Tarski’s conjecture
Now, we prove Theorem 1.4. This theorem shows a difference between and and points to the direction that Tarski’s conjecture [1, Remark 2.5.12] might fail. We will use several notions from the theory of cylindric algebras, e.g., generalized cylindrifications [1, Definition 1.7.1], substitutions [1, Definition 1.5.1], reducts of ’s, [1, Definition 2.6.1] and neat reducts of ’s [1, 2.6.28]. For instance, for each and each with , we let
[TABLE]
Proof of Theorem 1.4.
Remember that . Let be one of the free generators of . We will define a -term with the desired property as follows: , where
[TABLE]
and . Clearly, . Now we prove that in (ii)(ii)(ii)We note that in by Theorem 1.3..
Claim 1**.**
* in .*
Proof.
It suffices to construct an such that for some . Let be the identity sequence defined by: for each . Let for some . Let be defined by if and . Let be such that and let . Define,
\begin{array}[]{rl}d_{ii}=&B,\\ d_{ij}=&\{q\in{{}^{\alpha}\alpha}:q(i)=q(j)\},\\ c_{i}X=&\{q\in B:(\exists t\in X)\ h(q)\equiv_{i}h(t)\}.\end{array}
We construct as follows: . It is easy to check that satisfies the postulates (CA 0)-(CA 7) of Definition 1.1. Therefore, .
Let . Then . It can be checked that , , and , hence , and . ∎
Claim 2**.**
Let be such that . Then in .
Proof.
Consider the following system of equations:
\begin{array}[]{ll}&X\cdot y=0,\ X\not=0,\\ &c_{i}X=c_{i}Y\ \text{ for }i\in 2,\\ &c_{i}(d_{01}\cdot c_{k}X)\cdot c_{k}X\leq d_{01}\ \text{ for }\{i,k\}=2.\end{array}
Let , and . First we show that holds in .
- (A)
since and . 2. (B)
by Claim 1. 3. (C)
Let . By , we have and similarly , hence since . This implies . 4. (D)
Let be such that . By , we again have
[TABLE]
by .
Let be such that . Let and . Assume that . Then . Now, by and by [1, Section 1.5], we have that also holds in . Let be the reduct of resulting by ignoring the operations that contain indices in . Consider the neat reduct . Then, by [2, Theorem 3.2.65]. Let and . Then and holds in . This is a contradiction since and it is not diificult to verify that fails in for every . That means our assumption cannot hold, i.e., . ∎
Therefore, there is such that and for every with . We note that this proof works to prove Theorem 1.4 if is any arbitrary ordinal, but the theorem is interesting only for the case . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Henkin, J. D. Monk and A. Tarski (1971). Cylindric Algebras Part I. vol 64 of studies in logic and the foundation of mathematics. North Holland.
- 2[2] L. Henkin, J. D. Monk and A. Tarski (1985). Cylindric Algebras Part II. vol 115 of studies in logic and the foundation of mathematics. North Holland.
- 3[3] I. Németi (1986). Free algebras and decidability in algebraic logic. Academic Doctoral Dissertation (in Hungarian), Hungarian Academy of Sciences, Budapest. http://www.renyi.hu/~nemeti/N Dis/N Dis 86.pdf .
- 4[4] H. Andréka and R. J. Thompson (1988). A Stone type representation theorem for algebras of relations of higher rank. Transactions of the American Mathematical Society 309, pp. 671-682.
- 5[5] H. Andréka, B. Jónsson and I Németi (1991). Free algebras in discriminator varieties. Algebra Universalis, 28, pp. 401–447.
- 6[6] I. Németi (1995). Decidable versions of first order logic and cylindric-relativized set algebras. In: Logic colloquium’92, Eds: L. Cisirma, D. M. Gabbay and M. de Rijke, CSLI Publications, Stanford, California, and European Association for Logic, Language and Information, pp.177-241.
- 7[7] I. Németi (1985). Cylindric-relativized set algebras have strong amalgamation. J. Symbolic Logic 50, pp. 689-700.
- 8[8] Sz. Mikulás (1998). Taming first-order logic. Logic Journal of the IGPL 6 (2), pp. 305-316.
