Skip to main content

BASIC CONCEPTS AND COMPLEX NUMBERS

By

                               BASIC CONCEPTS

                       AND COMPLEX NUMBERS

               We begin by describing some intuitive ideas about sets.

              A collection of objects under a rule or a property is call a set,
The underlying rule or property will determine, Whether the given object belongs to the collection or not.  The objects which belong to a set are called its members or elements or occasionally its points.

              The theory of sets has been systematically studied only since about 1880, when  G. Cantor formulated the basic definitions and axioms.

              He remarked that a set must consists of definite , "well defined" elements, that is to say If we have in mind some particular collection then we call it a "set" if, given any object we can decide whether it belongs to the collection we are interested in or whether it, doses not. This seemingly obvious property is violated by some objects, we can illustrate this by an example due to Bertrand Russell. Suppose we have a set of letters (alphabets), we call it S, then since S is itself an object, either S will not belong to (the set) S.

               We therefore, see that there are pitfalls in a deep study of set theory. We   shall take it as an axiom that sets do exist and they contain well defined objects.

                The reader may feel that this is in some sense cheating. Let us look at the problem of language. If we look up a word in a dictionary, its meaning is given using other words.

             For instance, take the word "Straight", According to the dictionary, This means "Without bend", so we look up "bend" ; a "bend" is defined to be a "curve" and upon looking up "curve", We see that it is 'a line no part of which is straight" . If we put all these definitions together,We see that we obtain a circular definition ."straight" means "straight".

             We adopt the same viewpoint here that a set is what we would intuitively think of as a collection of objects some.

Comments

Post a Comment

Popular posts from this blog

SETS

By
                                             SETS       INTRODUCTION           We often speak some words in daily life which represent a collection of things, for example, a team of players, a bunch of flowers, a cluster of trees, a group of friends, a swarm of birds and so on. But in mathematics, we can use a single word "set" to denote all such type of words that show the collection of things such as, a set of players, a set of flowers, a set of trees, a set of friends and a set of birds, etc. Thus we can define a set as:     "A collection of distinct and well-defined objects is called a set. "  The objects of a set are called its members or elements.    ...
Post a Comment
Read more

PROBABILITY

By
                                        PROBABILITY                          INTRODUCTION                                                                   The word probability has two meaning:(1) a quantitative measure of uncertainty and (2) a measure of degree of belief in a particular or problem.                                Probability and statistic are fundamentally interrelated. probability is often called the vehicle of statistics. the area of inferential statistics in which we are mainly concerned with drawing inferences from experiments or situations ...
Post a Comment
Read more

Banach Contraction Principle

By
Banach Contraction Principle Let (X,d) be a complete metric space, then each contraction map f : X → X has a unique fixed point. Let h be a contraction constant of the mapping f . We will explicitly construct a sequence converging to the fixed point. Let x0 be an arbitrary but fixed element in X. Define a sequence of iterates {xn} in X by xn = f(xn−1) (= f n(x0)), for all n ≥ 1. Since f is a contraction, we have d(xn, xn+1) = d(f(xn−1), f(xn)) ≤ hd(xn−1, xn), for any n ≥ 1. Thus, we obtain d(xn, xn+1) ≤ hnd(x0, x1), for all n ≥ 1. Hence, for any m > n, we have d(xn, xm) ≤  hn +hn+1 +···+hm−1 d(x0, x1) ≤ hn 1−h d(x0, x1). We deduce that {xn} is Cauchy sequence in a complete space X. Let xn → p ∈ X. Now using the  continuity of the map f , we get p = lim n→∞ xn = lim n→∞ f(xn−1) = f(p). Finally, to show f has at most one fixed point in X, let p and q be fixed points of f . Then, d(p,q) = d(f(p), f(q)) ≤ hd(p,q). Since h < 1, we must have p = q The proof of the BCP yields the ...
Post a Comment
Read more