Ideal Theory in Boolean Algebra and Its Application to Deductive Systems

Ideal Theory in Boolean Algebra and Its Application to Deductive Systems

IDEAL THEORY IN BOOLEAN ALGEBRA AND ITS APPLICATION TO DEDUCTIVE SYSTEMS BY MIss S. PANKAJAM (University of Madras) Received September 9, 1941 (Communicated by Dr. R. Vaidyanathaswamy) THE Ideal Theory of the Distributive Lattice and Boolean Rings was initja- ated by A. Tarski* and developed by M. H. Stone- who in one of his papers points out that Tarski's 'Deductive Systems ' are in fact identical with the additive ideals in the Boolean Algebra of propositions. In this paper a more detailed study of Ideal Theory of the Boolean Algebra is made with the special object of elucidating the series of concepts and theorems which Tarski advances without proof in his paper. * My treatment of the above involves some new ideas (like Boolean-complements$ of ideals) and in the proofs I make use of the concepts ' Comprincipal Ideals' and ` Cut-Complements ' which have been introduced by Dr. Vaidyanatha- swamy§ in a recent paper. Thus, the pr3sent paper which is devoted to a rapid survey of Ideal Theory in a distributive lattice and in a boolean algebra, it is shown that the notion of the product-complement can be expressed in terms of the Cut-complement and boolean-complement. A continuation of this paper will deal with the application of ideal theory to deductive systems and show incidentally that Tarski's observation that even though the original calculus of propositions may be boolean in nature, yet the structure of deductive systems in that calculus departs from the classical type and conforms to that of Intuitionistic Logic, follows from the fact that the negation¶ of deductive systems corresponds to the product-complement in a distributive lattice whereas the negation of a proposition corresponds to its boolean complement. * See A. Tarski, Bibliography. t M. H. Stone (1). See also M. H. Stone (2). Bibiliography. t We notice that these boolean-complements are different from the Ortho-complements of M. H. Stone (see M. H. Stone 3) which are simply product-complements in a boolean ring. § R. Vaidyanathaswamy. Bibliography. I take this opportunity of expressing my indebtedness to the departmental lectures on "Lattice Theory " recently delivered by Dr. Vaidyanathaswamy (University of Madras). ¶ See A.. Tarski. Bibiliography. 670 Ideal Theory in Boolean 4l ehra 67' 1 1. Ideals in a Distributive Lattice L with 0 and 1 Definition 1. An a-ideal (Aa ) is defined as a set of elements of L such that (1) x • y EAa whenever x EA a , y EAa, (we read x • y is in Aa whenever x, y belong to Aa); (2) x +zEAp, whenever xEAa , zeL or alternatively if XeA a then all elements > x are in Aa . Definition 2. A /L-ideal (Aµ) is a set of elements such that (1) x +yeAu, whenever x EAR,,, y EAR,, ; (2) x • z eA,u whenever x EA,,, z cL or alternatively if x CA/h , then all elements <x are in A,,,. Definition 3. If x, y be any two elements of L, then the set of elements > x is easily seen to be an a-ideal which we call the principal a-ideal defined by x [denoted by Pa (x)], while the set of elements <y is the principal µ-ideal Pµ (y) defined by y. THEOREM 1. The a-ideal ([L-ideal*) generated by any sub-set S in L (in other words the smallest a-ideal (p-ideal) containing S) is the set of elements Sa (SN,) greater than some finite product, say Si • S1 • Sk • • • Sm (less than some finite sum, say SZ+S/-+Sk + • • • + Sm) of the elements of the given set S. For, in the first place it is clear that all such elements constitute an a-ideal Sa . Next by def. 1 since any a-ideal A which contains S a must also contain every finite product Si -Si -Sk • • • S,, of elements of Sa and therefore also any element greater than such a finite -product, it follows A >Sa or Sa is the smallest a-ideal which contains S. (Clearly every a-ideal contains 1 and every p-ideal contains 0.) Definition 4. The sum of a family of a-ideals (p,-ideals) is defined as the a-ideal (s-ideal) generated by their set-sum. THEOREM 2. The sum of a family {A,. B, C, } of a- ideals (s-ideals) is identical with the set of finite products (sums) of elements chosen one from each of the several a-ideals (p-ideals). For, {A, B, C, • • • } being a family of a-ideals, every finite product of elements chosen from A, B, C, • • • is evidently > than itself and therefore belongs to the ideal generated by S ={A, B, C, • }. On the other hand, every element t or of the ideal generated by S = {A, B, C, • • •} can be expressed as such as product; for since by Theorem 1, t>xl .x2 • • • xm (where each x belongs to some A) we have t = t + x1 • x2 • • • x,,, = 7T (t + xZ) by the distributive law. Hence since t + xi belongs to the same a-ideal as x, it * Substitution of words within brackets give dual theorems for µ-ideals. As the proofs of the latter are exactly similar to the theorems for a-ideals, we prove only the former. In general, we shall denote a-ideals by capital letters, the suffixes being used only when required to distinguish them from 1L-ideals. The letter P is used to denote principal ideals. 672 Miss S. Pankajam follows that any element t of S can be expressed as a finite product of elements chosen from the a-ideals A, B, C, • - • . Hence the theorem. THEOREM 3. The set K of the common elements of a family (A, B, C, of a-ideals (p-ideals) is an a-ideal (p-ideal). (N.B.—Ka is not null since it contains 1). The proof immediately follows from def. 1 and 2. Thus if k l, k2 be common elements of A, B, C, • - - then kl - k2 is also a common element and therefore belongs to Ka . Again, any element > kI is also an element of each of the ideals A, B, C, • - • and hence of K a . Hence by def. 1, the set K is an a-ideal. We call K the product of the family of a-ideals (µ,-ideals). THEOREM 4. The product of two a-ideals (-ideals) is identical with the set of sums (products) of pairs of elements chosen from the two a-ideals (µ-ideals) respectively. For, if A, B be two a-ideals, then every sum of elements chosen from A, B respectively is a common element of the two ideals; also if t is a common element, then since t EA, t EB, t = t + t and thus every common element of A,. B can be expressed as a sum of elements chosen from them. Hence the theorem. Corollary. The product of any family of a-ideals (µ-ideals) is the set of existing sums (products) of the elements chosen one from each of the a-ideals (µ-ideals). (N.B.—The product is non-null since it contains 0). For, every such existing sum is evidently a common element of the family of a-ideals. Conversely, if t be a common element, then it can be expressed as the sum (t + t + • • •) of elements chosen from them. It may be noticed that when the ideals are principal the sum and product (which we have defined) of a finite* number of the a- (µ-) ideals conforms to the lattice-sum and the lattice product of the elements determining them, thus: y . z ...k) Pa (x)+ P. (Y)+ Pa (z)+... + Pa (k)= Pa (x. P, (x)+P,,(Y)+P,,(z)+...+P,(k)=P9(x+ y+z+...+k) ''a (x) 'Pa (Y).pa (z) ..........pa (k)= Pa (x + y+ z + + k) P, . (x) ' P, . (Y) . p^ ( Z) .......... pP (k) = pµ (x . y . z ... k) . * Even when the infinite product a, b, c • • • exists and = k, it is not necessary that the sum (which always exists by theorem 6) of the principal a-ideals P a (a), Pa (b), etc., should be= Pa, (k) ; for if such were the case, then any convergent ideal would be principal—which is incorrect (see Theorem 29). Ideal Theory in Boolean Algebra 673 It is easily seen that an ideal A is the sum of all the principal ideals con- tained in A. For, if be the sum of all the principal ideals contained in A, it is clear that A> q. But if xEA, then P (x) <A by hypothesis. and there- fore P (x) <q. Hence x is contained in ¢ and therefore any element of A is contained in 0, i.e., A <0. Hence A= 0. 2.1. Structure of the set of a- and µ-ideals in L The totality of the a- and µ-ideals form partially ordered systems L a , L respectively under the ordering relation of 'set-inclusion' (<) which is reflexive, transitive and binary. As noticed before for sums and products, this ordering relation conforms to that in L when the ideals are principal. Thus Pa (x)> Pa (y) and P,,, (x) <P, (y) when and only when x <y. The structure of the sets of a- and µ-ideals in L is seen from the following theorems (viz., Theorems 6, 7, 11). THEOREM 6. La , L, are complete lattices, i.e., lattices in which unres- tricted products and sums exist. For, we have shown (Theorems 2, 4) that the sum (product) of a family of ideals is the smallest ideal which contains every ideal of the family (the largest ideal contained in every ideal) ; therefore the sums and products of any family of ideals which we have defined are lattice-sums and lattice- products respectively.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    15 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us