Documente online.
Zona de administrare documente. Fisierele tale
Am uitat parola x Creaza cont nou
 HomeExploreaza
upload
Upload




SET THEORY Algebra'

mathematics


SET THEORY Algebra

Without doubt, all sciences, as well as our everyday language, currently make use of sets. Since many elementary and high schoolbooks contain set theoretical elements, we have to explain why we start again with this topic. The reason is based on the desire to present noncontradictory theories, and to complete the general knowledge with some new specific results, which in particular 656t194g concern the cardinal and ordinal numbers.



§ 1. Noncontradictory set theories

The notion of set is primary, i.e. it has no definition to reduce it to other notions, and represents a product of our everyday experience. There are plenty of examples, which have the common feature (perhaps the only one) of describing several "thought together" objects. More exactly, according to the Cantor's point of view, a set is defined whenever we specify the properties of its constituent elements. Following P. R. Halmos (see [HPR]), this simple approach of sets is frequently qualified as a naïve set theory. The pejorative connotation of the term naïve is due to the fact that in this theory we may encounter paradoxes (antinomies, impossible situations). Facing contradictions in the simplest set theory has generated the famous crisis of mathematics, at the beginning of the 20th century. The presence of some hidden but actual paradoxes in mathematics could equally affect many other sciences, and revoke the entire scientific method of investigation. The simplicity of the most examples of paradoxes has also increased the danger of inconsistency in all branches of knowledge.

The contradictions of the naïve set theory represent logic antinomies of a particular topic, which involves the notion of set. However, many semantic paradoxes can be reformulated in terms of sets. For example, the set of men in a community can be divided into two subsets, according to the capability of waking up by oneself. The watchman's paradox, i.e. the impossibility to decide who shall wake the watchman, becomes a problem of membership to one of these subsets. Of course, there exist more sophisticated paradoxes involving the notion of set, as for example those concerning the "set" of all cardinal (respectively ordinal) numbers (see the subsequent sections).

1.1. Example. The wordy definition of numbers leads to a simple paradox, usually attributed to B. Russell (1902), and later analyzed by H. Poincaré (1913). It appears when we are going to find the smallest natural number n, which cannot be defined by less than 100 words. Trying to solve this problem, we may establish the following facts:

The set of all natural numbers, which can be defined by less than 100 words, is finite, since our vocabulary (dictionary) is so.

N is infinite, hence there exist numbers that cannot be defined in this way. They form a set M, for which M N.

n exists because each subset of N has a smallest element.

In the above description of n we have used less than 100 words, when we have said that "n is the smallest natural number that cannot be defined by less than 100 words".

The very definition of n by 13 words contradicts the membership n M.

A deeper analysis of the situation leads to a problem of classification of the numbers based on sorting the sentences used to define these numbers. However, we cannot end the sorting process and then start the classification of the numbers, because some sentences may involve the classification, as in the case of n.

1.2. Example. The quotation paradox is a variant of the watchman's or the barber's paradox, also attributed to B. Russell (1918), and later studied by W.E. Beth (1955) and others. The starting point is that the books of any library (collection, etc.) can be divided into the following categories:

(A) books not quoted in themselves, and

(B) books quoted in themselves (e.g. in supplies lists, bibliography, etc.).

The problem is that we cannot write a book a, where to quote all the books of type (A). In fact, we will be wrong if we cite a in itself, as well as if we don't, because in the first case a(A), hence it should be not quoted, while in the second one a(A), hence it should be quoted.

In the other variants, the problem is to identify the set that "contains" the element watchman, respectively barber, etc.

1.3. A set theoretical paradox. If we try to reformulate the paradoxes from the above examples in abstract terms, we have to discuss the possibility of accepting the situation . In mathematics and other sciences, it is not the case, hence we generally have , as for example a set of numbers is not a number, a set of electrons is not an electron, etc. However, we may conceive sets, say bizarre, for which holds, e.g. the Universe

U = .

The normal sets, for which , form a subset of U, noted

N = .

The paradox rises when we try to establish whether N is normal or bizarre.

In fact, if N is supposed to be normal, then N N, hence it has the property of its elements, and consequently we should have NN. On the other hand, if N is considered bizarre, i.e. NN, then it must fulfil the property of its elements, namely N N. Because NN and N N can not be simultaneously accepted, and tertium non datur, we must conclude that objects like N and U should not be considered. In other words, one source of paradoxes is thinking of "a set of all sets".

1.4. Ways to avoid paradoxes. Among the most frequent methods, which were so far used to avoid paradoxes, we mention the following:

1. The algebra of parts (G. Boole). In this theory we fix a total set T, and we restrict ourselves to operate with parts of T. The algebraic character of the study is due to the central role of the operations , , and by a single axiom, namely:

We can formulate other equivalent descriptions of a Boolean algebra in terms of lattices (see the next section).

Besides the properties in proposition 1.6., we may add:

1.10. Proposition. The following properties hold in every algebra of parts:

1. is a partial order in P (T) (if necessary, see the next section);

2. = is an equivalence in P (T);

3. A= A, AT = A;

4. AT = T, A;

5. AB A AB;

6. A B holds iff AB A, and equivalently AB = B;

7. R R .

1.14. Proposition. The following properties hold:

Every ring of sets is closed under finite intersections;

Every s-ring of sets is closed under countable intersections;

Every ring of sets is closed under symmetric differences;

R whenever R ;

R is an algebra of sets iff T R .

Proof 1) According to the De Morgan laws, we have

Similarly to Theorem 1.12, we have:

1.15. Theorem. (M.H. Stone, 1948) Every Boolean ring is isomorphic to a ring of parts.

The following type of subfamilies of P (T), where T , is frequently met in the Mathematical Analysis and Topology:

1.16. Definition. A non-void family F P (T) is called (proper) filter if

[F0] F ;

[F1] A, B F ABF ;

[F2] (AF and BA) BF .

Sometimes condition [F0] is omitted, and we speak of filters in generalized (improper) sense. In this case, F = P (T) is accepted as improper filter.

If family F is a filter, then any subfamily B F for which

[BF] AF BB such that BA,

(in particular F itself) is called base of the filter F.

By duality, if we replace by T, by , and by , then we obtain the notion of ideal. More exactly, a non-void family I P (T) is called (proper) ideal if:

[I0] F ;

[I1] A, B F ABF ;

[I2] (AF and B A) BF .

The connection between filters and ideals goes through complementation:

1.17. Proposition. Family F is a (proper) filter in P (T), iff

I =

is a (proper) ideal.

The proof is immediate. It is based on the properties of ,

then F is a filter, and a base of F is B = . It is easy to see that = .

b) The family F P (N), defined by

F = ,

is a filter in P (N) for which B = is a base, and

= .

c) Let BP (R2) be the family of interior parts of arbitrary regular polygons centered at some fixed (x, y) R2 . Then

F =

is a filter for which family C , of all interior parts of the disks centered at (x, y), is a base (as well as B itself).

1.19. Proposition. In an arbitrary total set T we have:

(i)       Any base B of a filter FP (T) satisfies the condition

[FB] A, BB CB such that C AB.

(ii)     If BP (T) satisfies condition [FB] (i.e. together with [F0] it is a proper filter base), then the family of oversets

G =

is a filter in P (T); we say that filter G is generated by B.

(iii) If B is a base of F, then B generates F .

The proof is direct, and we recommend it as an exercise.


Document Info


Accesari: 1138
Apreciat: hand-up

Comenteaza documentul:

Nu esti inregistrat
Trebuie sa fii utilizator inregistrat pentru a putea comenta


Creaza cont nou

A fost util?

Daca documentul a fost util si crezi ca merita
sa adaugi un link catre el la tine in site


in pagina web a site-ului tau.




eCoduri.com - coduri postale, contabile, CAEN sau bancare

Politica de confidentialitate | Termenii si conditii de utilizare




Copyright © Contact (SCRIGROUP Int. 2024 )