Chapter 1 Flashcards

1
Q

Element

A

A element is an object

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Null set

A

A null set is a set with no elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Well-defined set

A

A set is well-define if for each element we can decide if it is in or if it is not in the set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Universal set

A

All elements under consideration

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Complement

A

Let A be a set; U be the universal set. Ac is everything in the U that’s not in A.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Subsets

A

Every element of A is also an element of B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Equality

A

A=B off A is a subset of B and B is a subset of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Relative complement

A

A\B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Disjoint

A

A and B are disjoint if the intersection of A and B is the empty set.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Demorgan’s laws

A

If A and B are sets, the

a) (AUB)c=Ac and Bc
b) (A and B)c= AcUBc

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Functions

A

Let A and B be sets. A functions, f, from A to B is a rule which associates each element x in A with a unique element f(x) in B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Domain

A

Let f:A->B. A is the domain of f

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Range

A

Let f:A->B. The set of elements in B that have some point of A mapped to them by f is called the range of f.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Equal functions

A

Two functions f and g are equal if

1) domain of f=domain of g
2) f(x)=g(x) for all c in their common domain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

One to one

A

F is a one to one function if different elements of A are mapping to different elements of B.
If x1,x2 in A with x1 does not equal x2, then f(x1) does not equal f(x2)
If x1, x2 in A with f(x1)=f(x2), then x1=x2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Onto

A

F is onto if for all y in B, there exist an x in A such that f(x)=y.
“f uses all of B”

17
Q

Inverse

A

Let f:X->Y be a one to one function. Then the function f-1:R(f)->X defined by f-1(y)=x provided y=f(x) is call the inverse of the function f.

18
Q

Field

A
A field,F, is a non empty set with two operations, + and -, which satisfys the following
  Binary
  Associative
  Commutative
  Distribution works
  Identities
  Additive inverse
  Multiplication inverse
19
Q

The order axiom

A

There is a nonempty subset P(positives) of F for which

1) a,b in P implies a+b is in the positives
2) a,b in P implies a*b is in the positives
3) for any x in F, exactly ONE of the filling holds: x is positive, x is negative , or x is zero.

20
Q

Order field

A

A field satisfying the order axiom is an ordered field.

21
Q

Interval

A

An interval of real numbers is a set, A, containing at least 2 numbers such that if r,s are in A with r

22
Q

Upper bound

A

If there exist a b in R st x

23
Q

Bounded above

A

A set is bounded above if it has an upper bound.

24
Q

Lower bound

A

If there exist a c in R such that c>=x for all x in A. Then A had a lower bound.

25
Q

Bounded below

A

A set is bounded below if it has a lower bound.

26
Q

Bounded

A

If a set is bounded above and below.

27
Q

Unbounded

A

If it is not bounded

28
Q

Least upper bound

A

Let A be a set of real numbers that is bounded above. The number b is called the least upper bound of A if b is an upper bound of A. If k is also an upper bound of A, then b

29
Q

Supremun

A

Least upper bound

30
Q

Greatest lower bound

A

c is a lower bound of A. If l is a lower bound of A, then c>=l.

31
Q

Imfimum

A

Greatest lower bound

32
Q

Complete

A

Let S be an ordered field. Then S is complete if for any nonempty subset A of S that is bounded above, lub(A) is in S.

33
Q

Completeness axiom

A

R is complete

34
Q

The Archimedean principle

A

If a,b are in R with a>0, then there exist an n in the natural numbers such that na >b

35
Q

Cardinal its

A

Two sets A and B have the same cardinality if there is a one to one, onto function from the set A to the set B.

36
Q

Countable

A

A set is countable if it has the same cardinality as some subset of the natural numbers

37
Q

Set

A

A set is a collection of objects

38
Q

Cartesian product

A

Let A1,A2,…An be a finite collection of sets. The Cartesian product of the collection is A1xA2x…xAn={(a1,a2,….,an)|aj is in Aj for j=1,2,3….,n}

Ex: A={1,2,4} and B={3,5,6}
The AxB={(1,3),(1,5),(1,6),(2,3),(2,5), ect

39
Q

Triangle inequality

A

|a+b|