Test 1 Flashcards

(51 cards)

1
Q

Form of an even natural number

A

2k

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

Form of an odd natural number

A

2k-1

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

Every non-empty subset of N has a smallest element

A

Well-Ordering Principle

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

If an integer is odd, then the square of that integer is

A

odd

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

If n^2 is even, then n is

A

even

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

Define the rational numbers

A

Q = {m/n: m,n ∈ Z, n=/=0}

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

There exists no P∈Q s.t. p^2 = 2

A

True

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

What is the largest element of A = {p∈Q, p>0: p^2<2}

A

There is no largest element

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

What is the smallest element of B = {p∈Q, p>0: p^2>2}

A

There is no smallest element

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

Properties of an ordered set

A

1) One of the following is true: x<y, x=y, y<x (Trichotomy)
2) If x<y and y<z, then x<z

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

Definition of an ordered set

A

A set in which an order is defined.

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

Definiton of Bounded above

A

If there exists a B∈S s.t. for any x∈E, x<=B, E is bounded above by B

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

Definition of bounded below

A

If there exists an A∈S s.t. for any x∈E A<=x then E is bounded below

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

Properties of a supremum (least upper bound)

A

1) b is an upper bound of E
2) If a<b then a is not an upper bound of E.

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

Properties of infimum (greatest lower bound)

A

1) a is a lower bound of E
2) if a < b, then b is not a lower bound of E

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

Def of least upper bound property

A

An ordered set S is said to have the LUB prop if for all E subset S s.t. E=/=0 and E is bound above, then sup(E) exists in S.

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

Def of Field

A

A set equipped with two opperations, addition and multiplication

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

Addition Axioms

A

A1) If x,y∈F then x+y∈F
A2) x+y = y+x for all x,y∈F
A3) (x+y)+z = x+(y+z) for all x,y,z∈F
A4) There exists a 0∈F s.t. 0+x=x for all x∈F
A5) There exists a -x∈F s.t. x+(-x)=0 for all x∈F

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

Multiplication Axioms

A

M1) If x,y∈F then xy∈F
M2) x
y = yx for all x,y∈F
M3) (x
y)z = x(yz) for all x,y,z∈F
M4) There exists a 1∈F s.t. 1=/=0 and 1
x=x for all x∈F
M5) For all x∈F/{0} there exists an x^-1 s.t. x*x^-1 =1

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

Distribution Axiom

A

x(y+z) = xy+x*z for all x,y,z∈F

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

Properties of Ordered Field

A

A field which has the following properties:
1)If x<y then x+z<y+z
2) If x,y>0 then 0<x*y

22
Q

Define absolute value of x

A

x, x>=0
-x, x<0

23
Q

Triangle Inequality

A

|x+y| <= |x|+|y|

24
Q

Reverse Triangle Inequality

A

||x|-|y|| <= |x-y|

25
The Archemedian Principle
If x,y∈R and x>0 then there exists n∈N s.t. n*x>y. Hence, for all x∈R there exists an n∈N x
26
Density of the rational numbers
For all x=/=y∈R, there exists a q∈Q s.t. x
27
Def of an interval
Let J be a subset of R. For all x,y∈J with x<=y and for all z∈R s.t. x<=z<=y, z∈J.
28
Def of function
A rule that assigns to each element x∈A excatly one element in set B
29
Def of surjective (onto)
f:A->B is onto if for each b∈B there exists an a∈A with f(a)=b
30
Def of injective (1-1)
f:A->B is 1-1 if for a,b∈A with a=/=b then f(a)=/=f(b)
31
Def of bijective
f:A->B is both injective and surjective.
32
Def of same cardinality (A~B or |A|=|B|)
If there exists a bijection from A into B.
33
Def of relation
R:A->B is a set whose elements are all ordered pairs (x,y) where x∈A and y∈B.
34
Properties of equivalence relations
1) Reflexive 2) Symmetric 3) Transitive
35
Def of finite
If |A|=|Nn| for some n∈N or A={0}
36
Def of infinite
if A is not finite
37
Definite of countable
If |A| =|N|
38
Def of uncountable
If A is neither finite nor countable
39
Def of at most countable
if A is either finite or countable
40
Def of a sequence
A function f:N->A s.t. for each n∈N denote xn=f(n)
41
Def of enumeration
A bijection f:N->A written A={xn: n=1,2,3,...}
42
When does a sequence converge to a∈R
For all ε>0 there exists an N∈N s.t. for all n>=N |xn-a|<ε
43
When does a sequence diverge
If it does not converge
44
When is a sequence bounded
if there exists an M>0 s.t. |xn|<=M for all n∈N
45
Squeeze Thm
{xn}{yn}{zn} are subsets of R with xn->a, yn->a as n->infinity If xn<=zn<=yn for all n∈N then zn->a as n->infinity
46
Increasing sequence
xn+1>=xn for all n∈N
47
strictly increasing sequence
xn+1 > xn for all n∈N
48
decreasing sequence
xn+1<=xn for all n∈N
49
strictly decreasing sequence
xn+1
50
monotone sequence
if {xn} is either increasing or decreasing
51
If {xn} is monotonic and converges then
{xn} is bounded