Documente Academic
Documente Profesional
Documente Cultură
Field Axioms
Along with the set of real numbers we assume the existence of two operations,
called addition and multiplication such that for every pair of real numbers and the sum
and the product are real numbers uniquely determined by and y satisfying the
following axioms
(in the axioms that appear below, represent arbitrary real numbers unless
something is said to the contrary.)
Axiom 1: ; (commutative laws)
Axiom 2: ; (associative laws)
Axiom 3: ; (distributive laws)
Axiom 4: Given any two real numbers and there exists a real number such that
.
This is denoted by ; the number is denoted by . (It can be
proved that is independent of .) We write – for and call – the
negative of
Axiom 5: There exists at least one real number . If and are two real numbers
with then there exists a real number such that .
This is denoted by ; the number is denoted by . (It can be
proved that is independent of .) We write for 1/ if and call
the reciprocal of .
The Order Axioms
Axiom 1: Exactly one of the relations ; ; holds.
Note: means the same as
Axiom 2: If then for every we have
Axiom 3: If and then
Axiom 4: If and then
Note:
1. A real number is called positive if and negative if
2. denotes the set of all positive real numbers
3. denotes the set of all negative real numbers
Theo: Given real numbers such that for every then
Intervals
The set of all points between is called an interval.
Defi: Assume
a) the open interval is defined to be the set
b) the closed interval is defined to be the set
c) The half-open intervals is defined to be the set
d) The half-open intervals is defined to be the set
e) Infinite intervals are defined as followed
i)
ii)
iii)
iv)
Note:
1. The real line is sometimes referred to as the open interval
2. The single point is considered as a “degenerate” closed interval.
Integers
Defi:
A set of real numbers is called an inductive set if it has the following two properties
a) The number 1 is in the set
b) For every in the set, the number is also in the set.
Ex: R, R+, Z+ are inductive sets.
Defi: A real number is called a positive integer if it belongs to every inductive set. The set
of positive integers is denoted by Z+.
The fundamental theorem state that
1) Every integer can be represented as a product of prime factors and
2) This factorization can be done in only one way, apart from the order of the
factors.
Theo: Every integer is either a prime or a product of primes
Rational Numbers
Quotients of integers (where ) are called rational numbers
Completeness Axiom
Theo: The set Z+ of positive integers 1,2,3…. Is unbounded above.
Theo: For every real there is a positive integer such that .
Theo: If and if is an arbitrary real number, there is a positive integer such that
.
Results
1. We denote R by and R* by .
2. The points in R are called “ finite”
3. Every open interval is called neighborhood of or a ball with center .
4. Every open interval is called neighborhood of or a ball with center .
Algebraic number
Transcendental Number
Cantor Set
The Cantor set is the set of all numbers in which have a ternary expansion
without the digit 1.
Binary expansion of a real uses only Ternary expansion of a real uses only
the digits 0 and 1. Thus (2) the digits 0, 1 and 2. Thus (3)
means where (2) means where (3)
denotes binary expansion.
denotes ternary expansion.
Example,
Example,
PG – TRB Questions
SETS
Finite Set: A set is said to be a finite set if it contains only a finite number of elements in it.
Cardinal Numbers
If a set is finite, then we define the cardinality of to be the number of elements in
. Cardinality of a set is denoted by .
Result
1. Cardinal Number of empty set is Zero. Ie.
2. If a set is infinite, then we denote the cardinality of by a symbol .
Example
1. The function is defined by is 1-1
2. The function is defined by is not 1-1
Equivalent
If and is one-to-one (denoted 1-1) then is called a 1-1 correspondence
between set set . If there exists a 1-1 correspondence between the set set , then set
set are called equivalent we write
Example
Result
1. Every set is equivalent to itself.
2. If set and set are equivalent, then and are equivalent.
3. If set and set are equivalent and and are equivalent then and are
equivalent
Countable
Defi: The set is said to be countable (or denumerable) if is equivalent to the set of
positive integers. Thus is countable if there exists a 1-1 function from onto .
Note
1. There are many sizes of infinite sets, the smallest size is called countable.
2. is countable means that its elements can be counted.
Examples
1. If then is countable.
Since by
Results
1. A Sub set of a countable set is countable
2. If is an infinite subset of the countable set , then is countable.
3. Any infinite set contains a countable subset.
4. Any collection of disjoint intervals of positive length is countable.
Properties
1. If and are countable then is countable
2. If are countable then is countable
In words, the countable union of countable sets is countable.
3. If and are countable sets then the Cartesian product is countable
Ex: The set of all ordered pairs of integers is countable.
ie. The set is countable.
Prepared by D.Thirumaran, M.Sc., B.Ed., 5
Real Analysis Countable, Uncountable & L.U.B, G.L.B
PG – TRB – Questions
Uncountable
Examples
Properties
PG – TRB – Questions
Examples Examples
1. 1.
2. Empty set 2. Empty set
3. The set of negative integers. 3. The set of positive integers
Bounded
The subset is both bounded above and abounded below, we say that is
bounded. Thus is bounded if and only if for some interval of finite
length.
Examples
1. 1.
2. 2.
3. Empty set 3. Infinite sets
4. Singleton set 4. The set of integers
5. Finite sets 5. The set of rational numbers
Let the subset be bounded above. The number is called the least upper
bound for if
Let the subset be bounded below. The number is called the greatest lower
bound for if
Note
(i) We denote “least upper bound” as (or ) and greatest lower bound as
(ii) No set can have more than one and more than one
(iii) The and of a set may or may not belong to the set.
Examples
Mini. Maxi.
Set / interval
Ele. Ele.
If is any nonempty subset of that is bounded above, then has a least upper
bound in .
Note:
This axiom says roughly that has no holes in it. But the set of all rational numbers
does have holes in it. Ie. The axiom does not hold if is replaced by the set of all rational
numbers.
For Example:
If is any nonempty subset of that is bounded below, then has a greatest lower
bound in .
Result
Let
PG – TRB – Questions
a) is bounded b) is unbounded
c) has l.u.b. only d) has g.l.b only