ASU MAT 371 Kuiper Definitions

Study online at quizlet.com/_bao0l

28.

The 5 equivalent statements for an accumulation point

Equivalent statements for the definition of an accumulation point: (a) Every epsilon neighborhood of x contains infinitely many points of S. (b) Every neighborhood of x contains infinitely many points of S. (c) Every neighborhood of x contains a point of S that is different from x. (d) Every epsilon neighborhood of x contains a point of S that is different from x. (e) There exists a sequence {xn}n=1 such that n N we have xn S and limn xn = x. Let S be a set of real numbers. A real number A is said to be an accumulation point of S iff every neighborhood of A contains infinitely many points of S. A function that is both injective and surjective Bolzano-Weierstrass Theorem: Every bounded infinite set of real numbers has at least one accumulation point. ???

26.

Cauchy sequence

A sequence {an}n=1 is said to be Cauchy iff for > 0 there is a positive integer N such that for all nN and all mN we have|anam|<. The completeness property of the real numbers states that every nonempty set of real numbers that is bounded from above has a least upper bound. ???

21.

Completeness property

9.

Composition of two functions Convergence of a sequence

23.

Convergence of a sequence: A sequence {an}n=1 is said to converge to the real number A iff for > 0 there is a positive integer N such that for all n N we have |an A| < . A set that is empty or is cardinally equivalent to the subset or {1, 2, . . . n} of N is said to be a finite set. We say that {1, 2, . . . n} has cardinality is n and that the empty set has cardinality 0. A set that is cardinally equivalent to N is said to be countably infinite. We say its cardinality is 0"( aleph naught"). A set is said to be countable if it is finite or countably infinite. A set that is cardinally equivalent to R is said to have cardinality c. The cardinality of 2R is denoted by 2c. In general we denote the cardinality of the set S by |S|. Yes. Theorem: Every Cauchy sequence converges to real number. (This is equivalent to the completeness property of real numbers).

27.

Accumulation point

16.

Countable sets

12.

Bijective function Bolzano-Weierstrass Theorem

29.

20.

Bounded above, bounded below, bounded, upper bound, lower bound. Least upper bound (i.e. supremum), greatest lower bound (i.e. infimum). Can a set and its power set be cardinally equivalent? Cantor-Bernstein Theorem Cardinally equivalent

30.

Does every Cauchy sequence converge to real numbers? Epsilon neighborhood Equivalence class

17.

No. Theorem. A set cannot be cardinally equivalent to its power set. If A and B are two sets such that both |A| |B| and |B| |A| then |A|=|B|i.e. AB. Let U be a family of sets that includes at least R and all of its subsets. On this set we define an equivalence relation as follows: A B if there exists a bijection f : A B. If A B then we say A and B are (cardinally) equivalent. The cartesian product, A x B, of two sets A and B is the set of all ordered pairs {(a,b) : a A, bB}.

24.

If > 0 the the interval (x , x + ) is called an epsilon neighborhood of x. Let be an equivalence relation on a set A. The equivalence class containing the point a A is the subset {c A : c a} and this set may be denoted by [a]. Note: Each element x of S belongs to exactly one equivalence class. Therefore we say that the equivalence classes form a partition of S. A relation R that is reflexive, symmetric and transitive is called an equivalence relation. In this case we use the notation a b to indicate that (a, b) R.

6.

19.

14.

5.

Equivalence relation

1.

Cartesian product

31.

Every Cauchy DOES NOT converge to real numbers. True or false. Function. Domain. Range

False. Theorem: Every Cauchy sequence converges to real number. (This is equivalent to the completeness property of real numbers). A function f from the set D to the set S is a rule that associates a unique element y S with each element x D. The element y associated to x is denoted by y = f(x). D is called the domain of the function.The range of f is the set{y : x D st y=f(x)}. We use the notation f:DS to denote such a function from D to S. If R is a relation on the set A then we say (a) The relation is reflexive if a A we have (a, a) R. (b) The relation is symmetric if (a, b) R we have (b, a) R. (c) The relation is transitive if (a, c) R whenever both (a, b) R and (b, c) R. Let f:DS be a function. The image of a point x D is the point y=f(x)S. The image of a set UD is the set {yS : x U st y=f(x)}. The pre-image of a set TS is the set f1(T) := {x D | f(x) T}. (1-1) A set Q of real numbers is said to be a neighborhood of x if there exists an > 0 such that (x,x+) Q. Let S be a set. Its power set P(S), or simply P is the family of all subsets of S. Hence P(S):={A | AS}. (p. 12)

11.

Surjective function

(onto function)

7.

4.

If R is a relation on the set A then we say...

8.

Image of a point. Image of a set. Preimage Injective function Neighborhood of x

10.

25.

15.

Power Set

13.

Principle of mathematical induction Prove that |A| |B|.

18.

Let A and B be two sets and suppose that there is an injection f : A B. Then we say that |A| |B|. A relation between the sets A and B is a subset R of A B. The domain of this relation is {a : bB st (a,b)R} and its range is {b : a A st (a,b)R}. A relation on a set A is a relation between A and itself. Sequence A sequence is a function whose domain is N. Note: Sometimes authors will allow the domain to be any set of integers of the form {k,k + 1,k + 2,}.

2.

Relationship between the sets A and B. Domain? Range? Relationship on a set Sequence

3.

22.