is an Abelian group, whose identity we denote as .
is an Abelian group, whose identity we denote as .
There is a distributive law of over . That is, for all .
About Fields
There are a lot of things to say about fields. We won't say a lot here. We'll rather take our familiarity with real numbers for granted, and capture some important properties.
Ordered Field
An ordered set that is also a field is an ordered field if:
implies for any .
if and then .
Informal
Essentially, an ordered field is one such that order plays nice with multiplication and addition in a familiar way.
The following statements are true in every ordered field. We will not prove these.
For the sake of contradiction, suppose is empty, which means that for any element of the set , . Hence, for example is an upperbound for . Therefore, there exists . But since , we have . Which means that is not an upper bound of . so we have some such that , allow . Then, . Which is a contradiction because is an element of , which is greater than the supremum of .
The idea is to choose and apply the Archimedean property, which will tell us that the set is non empty, and then we allow to be the least element of by the well ordering property of .
Any real number is sandwiched between two consecutive integers
let there exists such that .
Let , then by Archimedean property, choosing , the set is non empty. Therefore, the well ordering property furnishes to be the least element of . which means that . Hence, .
if then, we have . Equivalently, setting We have . In such a case, if , we are done, as . if , , and we are done.
Finally if , .
For each real and natural number there is exactly one real such that
WLOG assume that then clearly, so at most one of and is equal to .
Now, consider the set . First, notice that , due to the following inequality holding, when and as well:
now, setting , and , we first notice that
the rightmost inequality owing to . Now using , taking the only the ends of the inequality, we have
So clearly, , but , contradicting the fact that is an upper bound for .
On the other hand, if , put . Here, if , we have
Hence, therefore , is an upper bound for . but hence contradicting the fact that is the least upper bound of .
Extended reals:
We have two extra symbols , where each has . We have the following definitions:
, ,
if , , . if the signs get switched.
Due the lack of definitions for additive and multiplicative inverses of , the extended reals don't form a field, as defined above.
Complex field
the field of complex numbers is just with vector addition, and a special multiplication we are all familiar with. To show field structure is left for the reader.
if the conjugate of , which is a reflection about the real axis.
We know for example that the conjugate distributes over and , and that the double conjugate is the identity transform.
The norm of a complex number is given by the positive square root of which is a positive real number.
The norm distributes over and has a triangle inequality over , namely .
Complex Cauchy Schwarz inequality:
Cauchy Schwarz inequality
If and are complex numbers, then
Put (in all sums in this proof, runs over the values ). If , then , and the conclusion is trivial. Assume therefore that . By Theorem 1.31 we have
Since each term in the first sum is nonnegative, we see that
Since , it follows that . This is the desired inequality.
EUCLIDEAN SPACES
Euclidean spaces
For each positive integer , let be the set of all ordered -tuples
where are real numbers, called the coordinates of . The elements of are called points, or vectors, especially when . We shall denote vectors by boldfaced letters. If and if is a real number, put
so that and . This defines addition of vectors, as well as multiplication of a vector by a real number (a scalar). These two operations satisfy the commutative, associative, and distributive laws (the proof is trivial, in view of the analogous laws for the real numbers) and make into a vector space over the real field. The zero element of (sometimes called the origin or the null vector) is the point 0 , all of whose coordinates are 0.
We also define the so-called "inner product" (or scalar product) of and y by
and the norm of by
The structure now defined (the vector space with the above inner product and norm) is called euclidean -space.
Properties of Euclidean norm
Suppose , and is real. Then
(a)
(b) if and only if ;
(c)
(d) ;
(e) ;
(f) .