up | next | prev | ptail | tail |
50. Functions of a positive integral variable. In Chapter II we discussed the notion of a function of a real variable , and illustrated the discussion by a large number of examples of such functions. And the reader will remember that there was one important particular with regard to which the functions which we took as illustrations differed very widely. Some were defined for all values of , some for rational values only, some for integral values only, and so on.
Consider, for example, the following functions: (i) , (ii) , (iii) the denominator of , (iv) the square root of the product of the numerator and the denominator of , (v) the largest prime factor of , (vi) the product of and the largest prime factor of , (vii) the th prime number, (viii) the height measured in inches of convict in Dartmoor prison.
Then the aggregates of values of for which these functions are defined or, as we may say, the fields of definition of the functions, consist of (i) all values of , (ii) all positive values of , (iii) all rational values of , (iv) all positive rational values of , (v) all integral values of , (vi), (vii) all positive integral values of , (viii) a certain number of positive integral values of , viz., , , …, , where is the total number of convicts at Dartmoor at a given moment of time.36
Now let us consider a function, such as (vii) above, which is defined for all positive integral values of and no others. This function may be regarded from two slightly different points of view. We may consider it, as has so far been our custom, as a function of the real variable defined for some only of the values of , viz. positive integral values, and say that for all other values of the definition fails. Or we may leave values of other than positive integral values entirely out of account, and regard our function as a function of the positive integral variable , whose values are the positive integers
In this case we may write and regard now as a function of defined for all values of .It is obvious that any function of defined for all values of gives rise to a function of defined for all values of . Thus from the function we deduce the function by merely omitting from consideration all values of other than positive integers, and the corresponding values of . On the other hand from any function of we can deduce any number of functions of by merely assigning values to , corresponding to values of other than positive integral values, in any way we please.
51. Interpolation. The problem of determining a function of which shall assume, for all positive integral values of , values agreeing with those of a given function of , is of extreme importance in higher mathematics. It is called the problem of functional interpolation.
Were the problem however merely that of finding some function of to fulfil the condition stated, it would of course present no difficulty whatever. We could, as explained above, simply fill in the missing values as we pleased: we might indeed simply regard the given values of the function of as all the values of the function of and say that the definition of the latter function failed for all other values of . But such purely theoretical solutions are obviously not what is usually wanted. What is usually wanted is some formula involving (of as simple a kind as possible) which assumes the given values for , , ….
In some cases, especially when the function of is itself defined by a formula, there is an obvious solution. If for example , where is a function of , such as or , which would have a meaning even were not a positive integer, we naturally take our function of to be . But even in this very simple case it is easy to write down other almost equally obvious solutions of the problem. For example
assumes the value for , since .In other cases may be defined by a formula, such as , which ceases to define for some values of (as here in the case of fractional values of with even denominators, or irrational values). But it may be possible to transform the formula in such a way that it does define for all values of . In this case, for example,
if is an integer, and the problem of interpolation is solved by the function .In other cases may be defined for some values of other than positive integers, but not for all. Thus from we are led to . This expression has a meaning for some only of the remaining values of . If for simplicity we confine ourselves to positive values of , then has a meaning for all rational values of , in virtue of the definitions of fractional powers adopted in elementary algebra. But when is irrational has (so far as we are in a position to say at the present moment) no meaning at all. Thus in this case the problem of interpolation at once leads us to consider the question of extending our definitions in such a way that shall have a meaning even when is irrational. We shall see later on how the desired extension may be effected.
Again, consider the case in which
In this case there is no obvious formula in which reduces to for , as means nothing for values of other than the positive integers. This is a case in which attempts to solve the problem of interpolation have led to important advances in mathematics. For mathematicians have succeeded in discovering a function (the Gamma-function) which possesses the desired property and many other interesting and important properties besides.52. Finite and infinite classes. Before we proceed further it is necessary to make a few remarks about certain ideas of an abstract and logical nature which are of constant occurrence in Pure Mathematics.
In the first place, the reader is probably familiar with the notion of a class. It is unnecessary to discuss here any logical difficulties which may be involved in the notion of a ‘class’: roughly speaking we may say that a class is the aggregate or collection of all the entities or objects which possess a certain property, simple or complex. Thus we have the class of British subjects, or members of Parliament, or positive integers, or real numbers.
Moreover, the reader has probably an idea of what is meant by a finite or infinite class. Thus the class of British subjects is a finite class: the aggregate of all British subjects, past, present, and future, has a finite number , though of course we cannot tell at present the actual value of . The class of present British subjects, on the other hand, has a number which could be ascertained by counting, were the methods of the census effective enough.
On the other hand the class of positive integers is not finite but infinite. This may be expressed more precisely as follows. If is any positive integer, such as , or any number we like to think of, then there are more than positive integers. Thus, if the number we think of is , there are obviously at least positive integers. Similarly the class of rational numbers, or of real numbers, is infinite. It is convenient to express this by saying that there are an infinite number of positive integers, or rational numbers, or real numbers. But the reader must be careful always to remember that by saying this we mean simply that the class in question has not a finite number of members such as or .
53. Properties possessed by a function of for large values of . We may now return to the ‘functions of ’ which we were discussing in §§ 50–51. They have many points of difference from the functions of which we discussed in Chap. II. But there is one fundamental characteristic which the two classes of functions have in common: the values of the variable for which they are defined form an infinite class. It is this fact which forms the basis of all the considerations which follow and which, as we shall see in the next chapter, apply, mutatis mutandis, to functions of as well.
Suppose that is any function of , and that is any property which may or may not have, such as that of being a positive integer or of being greater than . Consider, for each of the values , , , …, whether has the property or not. Then there are three possibilities:—
(a) may have the property for all values of , or for all values of except a finite number of such values:
(b) may have the property for no values of , or only for a finite number of such values:
(c) neither (a) nor (b) may be true.
If (b) is true, the values of for which has the property form a finite class. If (a) is true, the values of for which has not the property form a finite class. In the third case neither class is finite. Let us consider some particular cases.
(1) Let , and let be the property of being a positive integer. Then has the property for all values of .
If on the other hand denotes the property of being a positive integer greater than or equal to , then has the property for all values of except a finite number of values of , viz. , , , …, . In either of these cases (a) is true.
(2) If , and is the property of being less than , then (b) is true.
(3) If , and is the property of being odd, then (c) is true. For is odd if is odd and even if is even, and both the odd and the even values of form an infinite class.
Example. Consider, in each of the following cases, whether (a), (b), or (c) is true:
(i) , being the property of being a perfect square,
(ii) , where
denotes the
th prime
number, being
the
property of being odd,
(iii) , being the property of being even,
(iv) , being the property ,
(v) , being the property ,
(vi) , being the property ,
(vii) , being the property ,
(viii) , being the property ,
(ix) , being the property ,
(x) , or , being either of the properties or ,
(xi) , being the property .
54. Let us now suppose that and are such that the assertion (a) is true, i.e. that has the property , if not for all values of , at any rate for all values of except a finite number of such values. We may denote these exceptional values by
There is of course no reason why these values should be the first values , , …, , though, as the preceding examples show, this is frequently the case in practice. But whether this is so or not we know that has the property if . Thus the th prime is odd if , being the only exception to the statement; and if , the first values of being the exceptions; and if , the exceptional values being , , , …, . That is to say, in each of these cases the property is possessed for all values of from a definite value onwards.We shall frequently express this by saying that has the property for large, or very large, or all sufficiently large values of . Thus when we say that has the property (which will as a rule be a property expressed by some relation of inequality) for large values of , what we mean is that we can determine some definite number, say, such that has the property for all values of greater than or equal to . This number , in the examples considered above, may be taken to be any number greater than , the greatest of the exceptional numbers: it is most natural to take it to be .
Thus we may say that ‘all large primes are odd’, or that ‘ is less than for large values of ’. And the reader must make himself familiar with the use of the word large in statements of this kind. Large is in fact a word which, standing by itself, has no more absolute meaning in mathematics than in the language of common life. It is a truism that in common life a number which is large in one connection is small in another; goals is a large score in a football match, but runs is not a large score in a cricket match; and runs is a large score, but £ is not a large income: and so of course in mathematics large generally means large enough, and what is large enough for one purpose may not be large enough for another.
We know now what is meant by the assertion ‘ has the property for large values of ’. It is with assertions of this kind that we shall be concerned throughout this chapter.
55. The phrase ‘ tends to infinity’. There is a somewhat different way of looking at the matter which it is natural to adopt. Suppose that assumes successively the values , , , …. The word ‘successively’ naturally suggests succession in time, and we may suppose , if we like, to assume these values at successive moments of time (e.g. at the beginnings of successive seconds). Then as the seconds pass gets larger and larger and there is no limit to the extent of its increase. However large a number we may think of (e.g. ), a time will come when has become larger than this number.
It is convenient to have a short phrase to express this unending growth of , and we shall say that tends to infinity, or , this last symbol being usually employed as an abbreviation for ‘infinity’. The phrase ‘tends to’ like the word ‘successively’ naturally suggests the idea of change in time, and it is convenient to think of the variation of as accomplished in time in the manner described above. This however is a mere matter of convenience. The variable is a purely logical entity which has in itself nothing to do with time.
The reader cannot too strongly impress upon himself that when we say that ‘tends to ’ we mean simply that is supposed to assume a series of values which increase continually and without limit. There is no number ‘infinity’: such an equation as
is as it stands absolutely meaningless: cannot be equal to , because ‘equal to ’ means nothing. So far in fact the symbol means nothing at all except in the one phrase ‘tends to ’, the meaning of which we have explained above. Later on we shall learn how to attach a meaning to other phrases involving the symbol , but the reader will always have to bear in mind(1) that by itself means nothing, although phrases containing it sometimes mean something,
(2) that in every case in which a phrase containing the symbol means something it will do so simply because we have previously attached a meaning to this particular phrase by means of a special definition.
Now it is clear that if has the property for large values of , and if ‘tends to ’, in the sense which we have just explained, then will ultimately assume values large enough to ensure that has the property . And so another way of putting the question ‘what properties has for sufficiently large values of ?’ is ‘how does behave as tends to ?’
56. The behaviour of a function of as tends to infinity. We shall now proceed, in the light of the remarks made in the preceding sections, to consider the meaning of some kinds of statements which are perpetually occurring in higher mathematics. Let us consider, for example, the two following statements: (a) is small for large values of , (b) is nearly equal to for large values of . Obvious as they may seem, there is a good deal in them which will repay the reader’s attention. Let us take (a) first, as being slightly the simpler.
We have already considered the statement ‘ is less than for large values of ’. This, we saw, means that the inequality is true for all values of greater than some definite value, in fact greater than . Similarly it is true that ‘ is less than for large values of ’: in fact if . And instead of or we might take or , or indeed any positive number we like.
It is obviously convenient to have some way of expressing the fact that any such statement as ‘ is less than for large values of ’ is true, when we substitute for any smaller number, such as or or any other number we care to choose. And clearly we can do this by saying that ‘however small may be (provided of course it is positive), then for sufficiently large values of ’. That this is true is obvious. For if , so that our ‘sufficiently large’ values of need only all be greater than . The assertion is however a complex one, in that it really stands for the whole class of assertions which we obtain by giving to special values such as . And of course the smaller is, and the larger , the larger must be the least of the ‘sufficiently large’ values of : values which are sufficiently large when has one value are inadequate when it has a smaller.
The last statement italicised is what is really meant by the statement (a), that is small when is large. Similarly (b) really means “if , then the statement ‘ for sufficiently large values of ’ is true whatever positive value we attribute to ”. That the statement (b) is true is obvious from the fact that .
There is another way in which it is common to state the facts expressed by the assertions (a) and (b). This is suggested at once by § 55. Instead of saying ‘ is small for large values of ’ we say ‘ tends to as tends to ’. Similarly we say that ‘ tends to as tends to ’: and these statements are to be regarded as precisely equivalent to (a) and (b). Thus the statements
are equivalent to one another and to the more formal statement
‘if is any positive number, however small, then for sufficiently large values of ’,
or to the still more formal statement
‘if is any positive number, however small, then we can find a number such that for all values of greater than or equal to ’.
The number which occurs in the last statement is of course a function of . We shall sometimes emphasize this fact by writing in the form .
The reader should imagine himself confronted by an opponent who questions the truth of the statement. He would name a series of numbers growing smaller and smaller. He might begin with . The reader would reply that as soon as . The opponent would be bound to admit this, but would try again with some smaller number, such as . The reader would reply that as soon as : and so on. In this simple case it is evident that the reader would always have the better of the argument.
We shall now introduce yet another way of expressing this property of the function . We shall say that ‘the limit of as tends to is ’, a statement which we may express symbolically in the form
or simply . We shall also sometimes write ‘ as ’, which may be read ‘ tends to as tends to ’; or simply ‘’. In the same way we shall write or .57. Now let us consider a different example: let . Then ‘ is large when is large’. This statement is equivalent to the more formal statements
‘if is any positive number, however large, then for sufficiently large values of ’,
‘we can find a number such that for all values of greater than or equal to ’.
And it is natural in this case to say that ‘ tends to as tends to ’, or ‘ tends to with ’, and to write
Finally consider the function . In this case is large, but negative, when is large, and we naturally say that ‘ tends to as tends to ’ and write
And the use of the symbol in this sense suggests that it will sometimes be convenient to write for and generally to use instead of , in order to secure greater uniformity of notation.But we must once more repeat that in all these statements the symbols , , mean nothing whatever by themselves, and only acquire a meaning when they occur in certain special connections in virtue of the explanations which we have just given.
58. Definition of a limit. After the discussion which precedes the reader should be in a position to appreciate the general notion of a limit. Roughly we may say that tends to a limit as tends to if is nearly equal to when is large. But although the meaning of this statement should be clear enough after the preceding explanations, it is not, as it stands, precise enough to serve as a strict mathematical definition. It is, in fact, equivalent to a whole class of statements of the type ‘for sufficiently large values of , differs from by less than ’. This statement has to be true for or or any positive number; and for any such value of it has to be true for any value of after a certain definite value , though the smaller is the larger, as a rule, will be this value .
We accordingly frame the following formal definition:
DEFINITION I. The function is said to tend to the limit as tends to , if, however small be the positive number , differs from by less than for sufficiently large values of ; that is to say if, however small be the positive number , we can determine a number corresponding to , such that differs from by less than for all values of greater than or equal to .
It is usual to denote the difference between and , taken positively, by . It is equal to or to , whichever is positive, and agrees with the definition of the modulus of , as given in Chap. III, though at present we are only considering real values, positive or negative.
With this notation the definition may be stated more shortly as follows: ‘if, given any positive number, , however small, we can find so that when , then we say that tends to the limit as tends to , and write
Sometimes we may omit the ‘’; and sometimes it is convenient, for brevity, to write .
The reader will find it instructive to work out, in a few simple cases, the explicit expression of as a function of . Thus if then , and the condition reduces to for , which is satisfied if .37 There is one and only one case in which the same will do for all values of . If, from a certain value of onwards, is constant, say equal to , then it is evident that for , so that the inequality is satisfied for and all positive values of . And if for and all positive values of , then it is evident that when , so that is constant for all such values of .
59. The definition of a limit may be illustrated geometrically as follows. The graph of consists of a number of points corresponding to the values , , , ….
Draw the line , and the parallel lines , at distance from it. Then
if, when once these lines have been drawn, no matter how close they may be together, we can always draw a line , as in the figure, in such a way that the point of the graph on this line, and all points to the right of it, lie between them. We shall find this geometrical way of looking at our definition particularly useful when we come to deal with functions defined for all values of a real variable and not merely for positive integral values.
60. So much for functions of which tend to a limit as tends to . We must now frame corresponding definitions for functions which, like the functions or , tend to positive or negative infinity. The reader should by now find no difficulty in appreciating the point of
DEFINITION II. The function is said to tend to (positive infinity) with , if, when any number , however large, is assigned, we can determine so that when ; that is to say if, however large may be, for sufficiently large values of .
Another, less precise, form of statement is ‘if we can make as large as we please by sufficiently increasing ’. This is open to the objection that it obscures a fundamental point, viz. that must be greater than for all values of such that , and not merely for some such values. But there is no harm in using this form of expression if we are clear what it means.
When tends to we write
We may leave it to the reader to frame the corresponding definition for functions which tend to negative infinity.61. Some points concerning the definitions. The reader should be careful to observe the following points.
(1) We may obviously alter the values of for any finite number of values of , in any way we please, without in the least affecting the behaviour of as tends to . For example tends to as tends to . We may deduce any number of new functions from by altering a finite number of its values. For instance we may consider the function which is equal to for , , , , , , , and equal to for all other values of . For this function, just as for the original function , . Similarly, for the function which is equal to if , , , , , , , , and to otherwise, it is true that .
(2) On the other hand we cannot as a rule alter an infinite number of the values of without affecting fundamentally its behaviour as tends to . If for example we altered the function by changing its value to whenever is a multiple of , it would no longer be true that . So long as a finite number of values only were affected we could always choose the number of the definition so as to be greater than the greatest of the values of for which was altered. In the examples above, for instance, we could always take , and indeed we should be compelled to do so as soon as our imaginary opponent of § 56 had assigned a value of as small as (in the first example) or a value of as great as (in the second). But now however large may be there will be greater values of for which has been altered.
(3) In applying the test of Definition I it is of course absolutely essential that we should have not merely when but when , i.e. for and for all larger values of . It is obvious, for example, that, if is the function last considered, then given we can choose so that when : we have only to choose a sufficiently large value of which is not a multiple of . But, when is thus chosen, it is not true that when : all the multiples of which are greater than are exceptions to this statement.
(4) If is always greater than , we can replace by . Thus the test whether tends to the limit as tends to is simply whether when . If however , then is again , but is sometimes positive and sometimes negative. In such a case we must state the condition in the form , for example, in this particular case, in the form .
(5) The limit may itself be one of the actual values of . Thus if for all values of , it is obvious that . Again, if we had, in (2) and (3) above, altered the value of the function, when is a multiple of , to instead of to , we should have obtained a function which is equal to when is a multiple of and to otherwise. The limit of this function as tends to is still obviously zero. This limit is itself the value of the function for an infinite number of values of , viz. all multiples of .
On the other hand the limit itself need not be the value of the function for any value of . This is sufficiently obvious in the case of . The limit is zero; but the function is never equal to zero for any value of .
The reader cannot impress these facts too strongly on his mind. A limit is not a value of the function: it is something quite distinct from these values, though it is defined by its relations to them and may possibly be equal to some of them. For the functions
the limit is equal to all the values of : for it is not equal to any value of : for (whose limits as tends to are easily seen to be and , since is never numerically greater than ) the limit is equal to the value which assumes for all even values of , but the values assumed for odd values of are all different from the limit and from one another.(6) A function may be always numerically very large when is very large without tending either to or to . A sufficient illustration of this is given by . A function can only tend to or to if, after a certain value of , it maintains a constant sign.
Examples XXIII. Consider the behaviour of the following functions of as tends to :
1. , where is a positive or negative integer or rational fraction. If is positive, then tends to with . If is negative, then . If , then for all values of . Hence .
The reader will find it instructive, even in so simple a case as this, to write down a formal proof that the conditions of our definitions are satisfied. Take for instance the case of . Let be any assigned number, however large. We wish to choose so that when . We have in fact only to take for any number greater than . If e.g. , then when , when , and so on.
2. , where is the th prime number. If there were only a finite number of primes then would be defined only for a finite number of values of . There are however, as was first shown by Euclid, infinitely many primes. Euclid’s proof is as follows. If there are only a finite number of primes, let them be , , , , , , … . Consider the number . This number is evidently not divisible by any of , , , … , since the remainder when it is divided by any of these numbers is . It is therefore not divisible by any prime save , and is therefore itself prime, which is contrary to our hypothesis.
It is moreover obvious that for all values of (save , , ). Hence .
3. Let be the number of primes less than . Here again .
4. , where is any positive number. Here
and so on; and .5. If , then : and if , then . These conclusions are in no way affected by the fact that at first is much larger than , being in fact larger until .
6. , , . The first function tends to , the second to , the third does not tend either to a limit or to .
7. , where is any real number. Here , since , and .
8. , , where and are any real numbers.
9. . If is integral then for all values of , and therefore .
Next let be rational, e.g. , where and are positive integers. Let where is the quotient and the remainder when is divided by . Then . Suppose, for example, even; then, as increases from to , takes the values
When increases from to these values are repeated; and so also as goes from to , to , and so on. Thus the values of form a perpetual cyclic repetition of a finite series of different values. It is evident that when this is the case cannot tend to a limit, nor to , nor to , as tends to infinity.The case in which is irrational is a little more difficult. It is discussed in the next set of examples.
DEFINITION. When does not tend to a limit, nor to , nor to , as tends to , we say that oscillates as tends to .
A function certainly oscillates if its values form, as in the case considered in the last example above, a continual repetition of a cycle of values. But of course it may oscillate without possessing this peculiarity. Oscillation is defined in a purely negative manner: a function oscillates when it does not do certain other things.
The simplest example of an oscillatory function is given by
which is equal to when is even and to when is odd. In this case the values recur cyclically. But consider the values of which are When is large every value is nearly equal to or , and obviously does not tend to a limit or to or to , and therefore it oscillates: but the values do not recur. It is to be observed that in this case every value of is numerically less than or equal to . Similarly oscillates. When is large, every value is nearly equal to or to . The numerically greatest value is (for ). But now consider , the values of which are , , , , , …. This function oscillates, for it does not tend to a limit, nor to , nor to . And in this case we cannot assign any limit beyond which the numerical value of the terms does not rise. The distinction between these two examples suggests a further definition.DEFINITION. If oscillates as tends to , then will be said to oscillate finitely or infinitely according as it is or is not possible to assign a number such that all the values of are numerically less than , i.e. for all values of .
These definitions, as well as those of §§ 58 and 60, are further illustrated in the following examples.
Examples XXIV. Consider the behaviour as tends to of the following functions:
1. , , , .
2. , .
3. , .
4. . In this case the values of are
The odd terms are all zero and the even terms tend to : oscillates infinitely.5. . The second term oscillates infinitely, but the first is very much larger than the second when is large. In fact and is greater than any assigned value if . Thus . It should be observed that in this case is always less than , so that the function progresses to infinity by a continual series of steps forwards and backwards. It does not however ‘oscillate’ according to our definition of the term.
6. , , .
7. . We have already seen (Exs. XXIII. 9) that oscillates finitely when is rational, unless is an integer, when , .
The case in which is irrational is a little more difficult. But it is not difficult to see that still oscillates finitely. We can without loss of generality suppose . In the first place . Hence must oscillate finitely or tend to a limit. We shall consider whether the second alternative is really possible. Let us suppose that
Then, however small may be, we can choose so that lies between and for all values of greater than or equal to . Hence is numerically less than for all such values of , and so .Hence
must be numerically less than . Similarly must be numerically less than ; and so each of , must be numerically less than . That is to say, is very small if is large, and this can only be the case if is very small. Similarly must be very small, so that must be zero. But it is impossible that and can both be very small, as the sum of their squares is unity. Thus the hypothesis that tends to a limit is impossible, and therefore oscillates as tends to .The reader should consider with particular care the argument ‘ is very small, and this can only be the case if is very small’. Why, he may ask, should it not be the other factor which is ‘very small’? The answer is to be found, of course, in the meaning of the phrase ‘very small’ as used in this connection. When we say ‘ is very small’ for large values of , we mean that we can choose so that is numerically smaller than any assigned number, if . Such an assertion is palpably absurd when made of a fixed number such as , which is not zero.
Prove similarly that oscillates finitely, unless is an even integer.
8. , , , .
10. .
11. . If is integral, then , . If is rational but not integral, or irrational, then oscillates infinitely.
12. . In this case tends to if and are both positive, but to if both are negative. Consider the special cases in which , , or , , or , . If and have opposite signs generally oscillates infinitely. Consider any exceptional cases.
13. . If is integral, then . Otherwise oscillates finitely, as may be shown by arguments similar to though more complex than those used in Exs. XXIII. 9 and XXIV. 7.38
14. . If has a rational value , then is certainly integral for all values of greater than or equal to . Hence . The case in which is irrational cannot be dealt with without the aid of considerations of a much more difficult character.
15. , , where is rational.
16. , .
17. , , .
18. The smallest prime factor of . When is a prime, . When is even, . Thus oscillates infinitely.
19. The largest prime factor of .
20. The number of days in the year A.D.
Examples XXV. 1. If and for all values of , then .
2. If , and for all values of , then .
3. If , then .
4. If tends to a limit or oscillates finitely, and when , then tends to a limit or oscillates finitely.
5. If tends to , or to , or oscillates infinitely, and
when , then tends to or to or oscillates infinitely.6. ‘If oscillates and, however great be , we can find values of greater than for which , and values of greater than for which , then oscillates’. Is this true? If not give an example to the contrary.
7. If as , then also , being any fixed integer. [This follows at once from the definition. Similarly we see that if tends to or or oscillates so also does .]
8. The same conclusions hold (except in the case of oscillation) if varies with but is always numerically less than a fixed positive integer ; or if varies with in any way, so long as it is always positive.
9. Determine the least value of for which it is true that
10. Determine the least value of for which it is true that
11. Determine the least value of for which it is true that
being any positive number.[(a) : (b) or , according as is odd or even, i.e. .]
12. Determine the least value of such that
when . [Let us take the latter case. In the first place and it is easy to see that the least value of , such that when , is . But the inequality given is satisfied by , and this is the value of required.]63. Some general theorems with regard to limits. A. The behaviour of the sum of two functions whose behaviour is known.
THEOREM I. If and tend to limits , , then tends to the limit .
This is almost obvious.39 The argument which the reader will at once form in his mind is roughly this: ‘when is large, is nearly equal to and to , and therefore their sum is nearly equal to ’. It is well to state the argument quite formally, however.
Let be any assigned positive number (e.g. , , …). We require to show that a number can be found such that
(1) |
when . Now by a proposition proved in Chap. III (more generally indeed than we need here) the modulus of the sum of two numbers is less than or equal to the sum of their moduli. Thus
It follows that the desired condition will certainly be satisfied if can be so chosen that(2) |
when . But this is certainly the case. For since we can, by the definition of a limit, find so that when , and this however small may be. Nothing prevents our taking , so that when . Similarly we can find so that when . Now take to be the greater of the two numbers , . Then and when , and therefore (2) is satisfied and the theorem is proved.
The argument may be concisely stated thus: since and , we can choose , so that
and then, if is not less than either or , and therefore64. Results subsidiary to Theorem I. The reader should have no difficulty in verifying the following subsidiary results.
1. If tends to a limit, but tends to or to or oscillates finitely or infinitely, then behaves like .
2. If , and or oscillates finitely, then .
In this statement we may obviously change into throughout.
3. If and , then may tend either to a limit or to or to or may oscillate either finitely or infinitely.
These five possibilities are illustrated in order by (i) , , (ii) , , (iii) , , (iv) , , (v) , . The reader should construct additional examples of each case.
4. If and oscillates infinitely, then may tend to or oscillate infinitely, but cannot tend to a limit, or to , or oscillate finitely.
For ; and, if behaved in any of the three last ways, it would follow, from the previous results, that , which is not the case. As examples of the two cases which are possible, consider (i) , , (ii) , . Here again the signs of and may be permuted throughout.
5. If and both oscillate finitely, then must tend to a limit or oscillate finitely.
As examples take
6. If oscillates finitely, and infinitely, then oscillates infinitely.
For is in absolute value always less than a certain constant, say . On the other hand , since it oscillates infinitely, must assume values numerically greater than any assignable number (e.g. , , …). Hence must assume values numerically greater than any assignable number (e.g. , , …). Hence must either tend to or or oscillate infinitely. But if it tended to then
would also tend to , in virtue of the preceding results. Thus cannot tend to , nor, for similar reasons, to : hence it oscillates infinitely.7. If both and oscillate infinitely, then may tend to a limit, or to , or to , or oscillate either finitely or infinitely.
Suppose, for instance, that , while is in turn each of the functions , , , , . We thus obtain examples of all five possibilities.
The results 1–7 cover all the cases which are really distinct. Before passing on to consider the product of two functions, we may point out that the result of Theorem I may be immediately extended to the sum of three or more functions which tend to limits as .
65. B. The behaviour of the product of two functions whose behaviour is known. We can now prove a similar set of theorems concerning the product of two functions. The principal result is the following.
THEOREM II. If and , then
Let
so that and . Then Hence the numerical value of the difference is certainly not greater than the sum of the numerical values of , , . From this it follows that which proves the theorem.The following is a strictly formal proof. We have
Assuming that neither nor is zero, we may choose so that when . Then which is certainly less than if . That is to say we can choose so that when , and so the theorem follows. The reader should supply a proof for the case in which at least one of and is zero.We need hardly point out that this theorem, like Theorem I, may be immediately extended to the product of any number of functions of . There is also a series of subsidiary theorems concerning products analogous to those stated in § 64 for sums. We must distinguish now six different ways in which may behave as tends to . It may (1) tend to a limit other than zero, (2) tend to zero, (3a) tend to , (3b) tend to , (4) oscillate finitely, (5) oscillate infinitely. It is not necessary, as a rule, to take account separately of (3a) and (3b), as the results for one case may be deduced from those for the other by a change of sign.
To state these subsidiary theorems at length would occupy more space than we can afford. We select the two which follow as examples, leaving the verification of them to the reader. He will find it an instructive exercise to formulate some of the remaining theorems himself.
(i) If and oscillates finitely, then must tend to or to or oscillate infinitely.
Examples of these three possibilities may be obtained by taking to be and to be one of the three functions , , .
(ii) If and oscillate finitely, then must tend to a limit or oscillate finitely.
For examples, take (a) , (b) , , and (c) , .
A particular case of Theorem II which is important is that in which is constant. The theorem then asserts simply that if . To this we may join the subsidiary theorem that if then or , according as is positive or negative, unless , when of course for all values of and . And if oscillates finitely or infinitely, then so does , unless .
66. C. The behaviour of the difference or quotient of two functions whose behaviour is known. There is, of course, a similar set of theorems for the difference of two given functions, which are obvious corollaries from what precedes. In order to deal with the quotient
we begin with the following theorem.THEOREM III. If , and is not zero, then
Let
so that . Then and it is plain, since , that we can choose so that this is smaller than any assigned number when .From Theorems II and III we can at once deduce the principal theorem for quotients, viz.
THEOREM IV. If and , and is not zero, then
The reader will again find it instructive to formulate, prove, and illustrate by examples some of the ‘subsidiary theorems’ corresponding to Theorems III and IV.
THEOREM V. If is any rational function of , , , …, i.e. any function of the form where and denote polynomials in , , , …: and if and then
For is a sum of a finite number of terms of the type
where is a constant and , , … positive integers. This term, by Theorem II (or rather by its obvious extension to the product of any number of functions) tends to the limit , and so tends to the limit , by the similar extension of Theorem I. Similarly tends to ; and the result then follows from Theorem IV.68. The preceding general theorem may be applied to the following very important particular problem: what is the behaviour of the most general rational function of , viz. as tends to ?40
In order to apply the theorem we transform by writing it in the form
The function in curly brackets is of the form , where , and therefore tends, as tends to , to the limit . Now if ; and if ; and if . Hence, by Theorem II,
Examples XXVI. 1. What is the behaviour of the functions
as ?2. Which (if any) of the functions
tend to a limit as ?
3. Denoting by the general rational function of considered above, show that in all cases
69. Functions of which increase steadily with . A special but particularly important class of functions of is formed by those whose variation as tends to is always in the same direction, that is to say those which always increase (or always decrease) as increases. Since always increases if always decreases, it is not necessary to consider the two kinds of functions separately; for theorems proved for one kind can at once be extended to the other.
DEFINITION. The function will be said to increase steadily with if for all values of .
It is to be observed that we do not exclude the case in which has the same value for several values of ; all we exclude is possible decrease. Thus the function
whose values for , , , , , … are is said to increase steadily with . Our definition would indeed include even functions which remain constant from some value of onwards; thus steadily increases according to our definition. However, as these functions are extremely special ones, and as there can be no doubt as to their behaviour as tends to , this apparent incongruity in the definition is not a serious defect.There is one exceedingly important theorem concerning functions of this class.
THEOREM. If steadily increases with , then either (i) tends to a limit as tends to , or (ii) .
That is to say, while there are in general five alternatives as to the behaviour of a function, there are two only for this special kind of function.
This theorem is a simple corollary of Dedekind’s Theorem (§ 17). We divide the real numbers into two classes and , putting in or according as for some value of (and so of course for all greater values), or for all values of .
The class certainly exists; the class may or may not. If it does not, then, given any number , however large, for all sufficiently large values of , and so
If on the other hand exists, the classes and form a section of the real numbers in the sense of § 17. Let be the number corresponding to the section, and let be any positive number. Then for all values of , and so, since is arbitrary, . On the other hand for some value of , and so for all sufficiently large values. Thus
for all sufficiently large values of ; i.e.It should be observed that in general for all values of ; for if is equal to for any value of it must be equal to for all greater values of . Thus can never be equal to except in the case in which the values of are ultimately all the same. If this is so, is the largest member of ; otherwise has no largest member.
COR 1. If increases steadily with , then it will tend to a limit or to according as it is or is not possible to find a number such that for all values of .
We shall find this corollary exceedingly useful later on.
COR 2. If increases steadily with , and for all values of , then tends to a limit and this limit is less than or equal to .
It should be noticed that the limit may be equal to : if e.g. , then every value of is less than , but the limit is equal to .
COR 3. If increases steadily with , and tends to a limit, then for all values of .
The reader should write out for himself the corresponding theorems and corollaries for the case in which decreases as increases.
70. The great importance of these theorems lies in the fact that they give us (what we have so far been without) a means of deciding, in a great many cases, whether a given function of does or does not tend to a limit as , without requiring us to be able to guess or otherwise infer beforehand what the limit is. If we know what the limit, if there is one, must be, we can use the test
as for example in the case of , where it is obvious that the limit can only be zero. But suppose we have to determine whether tends to a limit. In this case it is not obvious what the limit, if there is one, will be: and it is evident that the test above, which involves , cannot be used, at any rate directly, to decide whether exists or not.Of course the test can sometimes be used indirectly, to prove by means of a reductio ad absurdum that cannot exist. If e.g. , it is clear that would have to be equal to and also equal to , which is obviously impossible.
71. Alternative proof of Weierstrass’s Theorem of §19. The results of §69 enable us to give an alternative proof of the important theorem proved in §19.
If we divide into two equal parts, one at least of them must contain infinitely many points of . We select the one which does, or, if both do, we select the left-hand half; and we denote the selected half by (Fig. 28). If is the left-hand half, is the same point as .
Similarly, if we divide into two halves, one at least of them must contain infinitely many points of . We select the half which does so, or, if both do so, we select the left-hand half. Proceeding in this way we can define a sequence of intervals
each of which is a half of its predecessor, and each of which contains infinitely many points of .The points , , , … progress steadily from left to right, and so tends to a limiting position . Similarly tends to a limiting position . But is plainly less than , whatever the value of ; and , being equal to , tends to zero. Hence coincides with , and and both tend to .
Then is a point of accumulation of . For suppose that is its coordinate, and consider any interval of the type . If is sufficiently large, will lie entirely inside this interval.41 Hence contains infinitely many points of .
72. The limit of as tends to . Let us apply the results of § 69 to the particularly important case in which . If then , , and if then , , so that these special cases need not detain us.
First, suppose positive. Then, since , increases with if , decreases as increases if .
If , then must tend either to a limit (which must obviously be greater than ) or to . Suppose it tends to a limit . Then , by Exs. XXV. 7; but
and therefore : and as and are both greater than , this is impossible. HenceExample. The reader may give an alternative proof, showing by the binomial theorem that if is positive and , and so that
On the other hand is a decreasing function if , and must therefore tend to a limit or to . Since is positive the second alternative may be ignored. Thus , say, and as above , so that must be zero. Hence
Example. Prove as in the preceding example that tends to if , and deduce that tends to .
We have finally to consider the case in which is negative. If and , so that , then it follows from what precedes that and therefore . If it is obvious that oscillates, taking the values , alternatively. Finally if , and , so that , then tends to , and therefore takes values, both positive and negative, numerically greater than any assigned number. Hence oscillates infinitely. To sum up:
Examples XXVII.42 1. If is positive and , where , for all values of , then .
[For
from which the conclusion follows at once, as .]2. The same result is true if the conditions above stated are satisfied only when .
3. If is positive and , where , then . This result also is true if the conditions are satisfied only when .
4. If when , and , then .
5. If is positive and , then .
[For we can determine so that when : we may, e.g., take halfway between and . Now apply Ex. 1.]
6. If , where is numerically less than unity, then . [This follows from Ex. 4 as Ex. 5 follows from Ex. 1.]
7. Determine the behaviour, as , of , where is any positive integer.
[If then for all values of , and . In all other cases
First suppose positive. Then if (Ex. 5) and if (Ex. 6). If , then . Next suppose negative. Then tends to if and to if . Hence oscillates infinitely if and if .]8. Discuss in the same way. [The results are the same, except that when or .]
9. Draw up a table to show how behaves as , for all real values of , and all positive and negative integral values of .
[The reader will observe that the value of is immaterial except in the special cases when or . Since , whether be positive or negative, the limit of the ratio depends only on , and the behaviour of is in general dominated by the factor . The factor only asserts itself when is numerically equal to .]
10. Prove that if is positive then as . [Suppose, e.g., . Then , , , … is a decreasing sequence, and for all values of . Thus , where . But if we can find values of , as large as we please, for which or ; and, since as , this is impossible.]
11. . [For if or , which is certainly satisfied if (see §73 for a proof). Thus decreases as increases from onwards, and, as it is always greater than unity, it tends to a limit which is greater than or equal to unity. But if , where , then , which is certainly untrue for sufficiently large values of , since with (Exs. 7, 8).]
12. . [However large may be, if is large enough. For if then , which tends to zero as , so that does the same (Ex. 6).]
13. Show that if then
tends to zero as .[If is a positive integer, for . Otherwise
unless .]73. The limit of . A more difficult problem which can be solved by the help of § 69 arises when .
It follows from the binomial theorem43 that
The th term in this expression, viz.
is positive and an increasing function of , and the number of terms also increases with . Hence increases with , and so tends to a limit or to , as .But
Thus cannot tend to , and so
where is a number such that .74. Some algebraical lemmas. It will be convenient to prove at this stage a number of elementary inequalities which will be useful to us later on.
(i) It is evident that if and is a positive integer then
Multiplying both sides of this inequality by , we obtain and adding to each side, and dividing by , we obtain(1) |
Similarly we can prove that
(2) |
It follows that if and are positive integers, and , then
(3) |
Here . In particular, when , we have
(4) |
(ii) The inequalities (3) and (4) have been proved on the supposition that and are positive integers. But it is easy to see that they hold under the more general hypothesis that and are any positive rational numbers. Let us consider, for example, the first of the inequalities (3). Let , , where , , , are positive integers; so that . If we put , the inequality takes the form
and this we have proved already. The same argument applies to the remaining inequalities; and it can evidently be proved in a similar manner that(5) |
if is a positive rational number less than .
(iii) In what follows it is to be understood that all the letters denote positive numbers, that and are rational, and that and are greater than , and less than . Writing for , and for , in (4), we obtain
(6) |
Similarly, from (5), we deduce
(7) |
Combining (4) and (6), we see that
(8) |
(9) |
if . And the same argument, applied to (5) and (7), leads to
(10) |
Examples XXVIII. 1. Verify (9) for , , and (10) for , .
2. Show that (9) and (10) are also true if .
3. Show that (9) also holds for . [See Chrystal’s Algebra, vol. ii, pp. 43–45.]
4. If , where , as , then , being any rational number.
[We may suppose that , in virtue of Theorem III of §66; and that , as is certainly the case from a certain value of onwards. If ,
or according as or . It follows that the ratio of and lies between and . The proof is similar when . The result is still true when , if .]5. Extend the results of Exs. XXVII. 7, 8, 9 to the case in which or are any rational numbers.
75. The limit of . If in the first inequality (3) of §74 we put , , we see that
when . Thus if then decreases steadily as increases. Also is always positive. Hence tends to a limit as , and .Again if, in the first inequality (7) of §74, we put , we obtain
Thus . Hence, if , we have where .Next suppose , and let ; then . Now , and (Exs. XXVII. 10)
Hence, if , we have Finally, if , then for all values of .Thus we arrive at the result: the limit defines a function of for all positive values of . This function possesses the properties and is positive or negative according as or . Later on we shall be able to identify this function with the Napierian logarithm of .
Example. Prove that . [Use the equations
76. Infinite Series. Suppose that is any function of defined for all values of . If we add up the values of for , , … , we obtain another function of , viz.
also defined for all values of . It is generally most convenient to alter our notation slightly and write this equation in the form or, more shortly,If now we suppose that tends to a limit when tends to , we have
This equation is usually written in one of the forms the dots denoting the indefinite continuance of the series of ’s.The meaning of the above equations, expressed roughly, is that by adding more and more of the ’s together we get nearer and nearer to the limit . More precisely, if any small positive number is chosen, we can choose so that the sum of the first terms, or any of greater number of terms, lies between and ; or in symbols
if . In these circumstances we shall call the series a convergent infinite series, and we shall call the sum of the series, or the sum of all the terms of the series.Thus to say that the series converges and has the sum , or converges to the sum or simply converges to , is merely another way of stating that the sum of the first terms tends to the limit as , and the consideration of such infinite series introduces no new ideas beyond those with which the early part of this chapter should already have made the reader familiar. In fact the sum is merely a function , such as we have been considering, expressed in a particular form. Any function may be expressed in this form, by writing
and it is sometimes convenient to say that converges (instead of ‘tends’) to the limit , say, as .If or , we shall say that the series is divergent or diverges to , or , as the case may be. These phrases too may be applied to any function : thus if we may say that diverges to . If does not tend to a limit or to or to , then it oscillates finitely or infinitely: in this case we say that the series oscillates finitely or infinitely.44
77. General theorems concerning infinite series. When we are dealing with infinite series we shall constantly have occasion to use the following general theorems.
(1) If is convergent, and has the sum , then is convergent and has the sum . Similarly is convergent and has the sum .
(2) If is convergent and has the sum , then is convergent and has the sum
(3) If any series considered in (1) or (2) diverges or oscillates, then so do the others.
(4) If is convergent and has the sum , then is convergent and has the sum .
(5) If the first series considered in (4) diverges or oscillates, then so does the second, unless .
(6) If and are both convergent, then the series is convergent and its sum is the sum of the first two series.
All these theorems are almost obvious and may be proved at once from the definitions or by applying the results of §§ 63–66 to the sum . Those which follow are of a somewhat different character.
(7) If is convergent, then .
For , and and have the same limit . Hence .
The reader may be tempted to think that the converse of the theorem is true and that if then the series must be convergent. That this is not the case is easily seen from an example. Let the series be
so that . The sum of the first four terms is The sum of the next four terms is ; the sum of the next eight terms is greater than , and so on. The sum of the first terms is greater than and this increases beyond all limit with : hence the series diverges to .(8) If is convergent, then so is any series formed by grouping the terms in brackets in any way to form new single terms, and the sums of the two series are the same.
The reader will be able to supply the proof of this theorem. Here again the converse is not true. Thus oscillates, while
or converges to .(9) If every term is positive , then the series must either converge or diverge to . If it converges, its sum must be positive (unless all the terms are zero, when of course its sum is zero).
For is an increasing function of , according to the definition of § 69, and we can apply the results of that section to .
(10)If every term is positive , then the necessary and sufficient condition that the series should be convergent is that it should be possible to find a number such that the sum of any number of terms is less than ; and, if can be so found, then the sum of the series is not greater than .
This also follows at once from § 69. It is perhaps hardly necessary to point out that the theorem is not true if the condition that every is positive is not fulfilled. For example
obviously oscillates, being alternately equal to and to .(11)If , are two series of positive terms, and the second series is convergent, and if , where is a constant, for all values of , then the first series is also convergent, and its sum is less than or equal to times that of the second.
For if then for all values of , and so ; which proves the theorem.
Conversely, if is divergent, and , then is divergent.
78. The infinite geometrical series. We shall now consider the ‘geometrical’ series, whose general term is . In this case
except in the special case in which , when In the last case . In the general case will tend to a limit if and only if does so. Referring to the results of § 72 we see that the series is convergent and has the sum if and only if .If , then , and so ; i.e. the series diverges to . If , then or according as is odd or even: i.e. oscillates finitely. If , then oscillates infinitely. Thus, to sum up, the series diverges to if , converges to if , oscillates finitely if , and oscillates infinitely if .
Examples XXIX. 1. Recurring decimals. The commonest example of an infinite geometric series is given by an ordinary recurring decimal. Consider, for example, the decimal . This stands, according to the ordinary rules of arithmetic, for
The reader should consider where and how any of the general theorems of §77 have been used in this reduction.2. Show that in general
the denominator containing ’s and ’s.3. Show that a pure recurring decimal is always equal to a proper fraction whose denominator does not contain or as a factor.
4. A decimal with non-recurring and recurring decimal figures is equal to a proper fraction whose denominator is divisible by or but by no higher power of either.
5. The converses of Exs. 3, 4 are also true. Let , and suppose first that is prime to . If we divide all powers of by we can obtain at most different remainders. It is therefore possible to find two numbers and , where , such that and give the same remainder. Hence is divisible by , and so , where , is divisible by . Hence may be expressed in the form , or in the form
i.e. as a pure recurring decimal with figures. If on the other hand , where is prime to , and is the greater of and , then has a denominator prime to , and is therefore expressible as the sum of an integer and a pure recurring decimal. But this is not true of , for any value of less than ; hence the decimal for has exactly non-recurring figures.6. To the results of Exs. 2–5 we must add that of Ex. I. 3. Finally, if we observe that
we see that every terminating decimal can also be expressed as a mixed recurring decimal whose recurring part is composed entirely of ’s. For example, . Thus every proper fraction can be expressed as a recurring decimal, and conversely.7. Decimals in general. The expression of irrational numbers as non-recurring decimals. Any decimal, whether recurring or not, corresponds to a definite number between and . For the decimal stands for the series
Since all the digits are positive, the sum of the first terms of this series increases with , and it is certainly not greater than or . Hence tends to a limit between and .Moreover no two decimals can correspond to the same number (except in the special case noticed in Ex. 6). For suppose that , are two decimals which agree as far as the figures , , while . Then (unless , , … are all ’s), and so
It follows that the expression of a rational fraction as a recurring decimal (Exs. 2–6) is unique. It also follows that every decimal which does not recur represents some irrational number between and . Conversely, any such number can be expressed as such a decimal. For it must lie in one of the intervals If it lies between and , then the first figure is . By subdividing this interval into parts we can determine the second figure; and so on. But (Exs. 3, 4) the decimal cannot recur. Thus, for example, the decimal , obtained by the ordinary process for the extraction of , cannot recur.8. The decimals and , in which the number of zeros between two ’s or ’s increases by one at each stage, represent irrational numbers.
9. The decimal , in which the th figure is if is prime, and zero otherwise, represents an irrational number. [Since the number of primes is infinite the decimal does not terminate. Nor can it recur: for if it did we could determine and so that , , , , … are all prime numbers; and this is absurd, since the series includes .]45
Examples XXX. 1. The series is convergent if , and its sum is (§77, (2)).
2. The series is convergent if , and its sum is (§77, (4)). Verify that the results of Exs. 1 and 2 are in agreement.
3. Prove that the series is convergent, and that its sum is , () by writing it in the form , () by writing it in the form , () by adding the two series , . In each case mention which of the theorems of §77 are used in your proof.
4. Prove that the ‘arithmetic’ series
is always divergent, unless both and are zero. Show that, if is not zero, the series diverges to or to according to the sign of , while if it diverges to or according to the sign of .5. What is the sum of the series
when the series is convergent? [The series converges only if . Its sum is , except when , when its sum is .]6. Sum the series
[The series is always convergent. Its sum is , except when , when its sum is .]7. If we assume that is convergent then we can prove that its sum is by means of §77, (1) and (4). For if then
8. Sum the series
when it is convergent. [The series is convergent if , i.e. if or if , and its sum is . It is also convergent when , when its sum is .]9. Answer the same question for the series
10. Consider the convergence of the series
and find their sums when they are convergent.
11. If then the series is convergent for , and its sum is not greater than .
12. If in addition the series is convergent, then the series is convergent for , and its sum is not greater than the lesser of and .
13. The series
is convergent. [For .]14. The series
are convergent.15. The general harmonic series
where and are positive, diverges to .[For . Now compare with .]
16. Show that the series
is convergent if and only if tends to a limit as .17. If is divergent then so is any series formed by grouping the terms in brackets in any way to form new single terms.
18. Any series, formed by taking a selection of the terms of a convergent series of positive terms, is itself convergent.
79. The representation of functions of a continuous real variable by means of limits. In the preceding sections we have frequently been concerned with limits such as
and series such as in which the function of whose limit we are seeking involves, besides , another variable . In such cases the limit is of course a function of . Thus in § 75 we encountered the function and the sum of the geometrical series is a function of , viz. the function which is equal to if and is undefined for all other values of .Many of the apparently ‘arbitrary’ or ‘unnatural’ functions considered in Ch. II are capable of a simple representation of this kind, as will appear from the following examples.
Examples XXXI. 1. . Here does not appear at all in the expression of , and for all values of .
2. . Here for all values of .
3. . If , ; if , : only when has a limit (viz. ) as . Thus when and is not defined for any other value of .
4. , .
5. . Here , (); , (); and is not defined for any other value of .
6. . Here differs from the of Ex. 5 in that it has the value when .
7. . Here differs from the of Ex. 6 in that it has the value when as well as when .
8. . [, (); , (); , ( or ); and is not defined when .]
9. , , , , .
10. , , . [In the first case when , when , when and is not defined when . The second and third functions differ from the first in that they are defined both when and when : the second has the value and the third the value for both these values of .]
11. Construct an example in which , (); , (); and , ( and ).
12. , .
13. . [Here , (); , (); , (); and is undefined when .]
14. . [, (); , (); , (). This function is important in the Theory of Numbers, and is usually denoted by .]
15. . [ when is an integer; and is otherwise undefined (Ex. XXIV. 7).]
16. If then for all rational values of (Ex. XXIV. 14). [The consideration of irrational values presents greater difficulties.]
17. . [ except when is integral, when .]
18. If then the number of days in the year A.D. is
80. The bounds of a bounded aggregate. Let be any system or aggregate of real numbers . If there is a number such that for every of , we say that is bounded above. If there is a number such that for every , we say that is bounded below. If is both bounded above and bounded below, we say simply that is bounded.
Suppose first that is bounded above (but not necessarily below). There will be an infinity of numbers which possess the property possessed by ; any number greater than , for example, possesses it. We shall prove that among these numbers there is a least,46 which we shall call . This number is not exceeded by any member of , but every number less than is exceeded by at least one member of .
We divide the real numbers into two classes and , putting into or according as it is or is not exceeded by members of . Then every belongs to one and one only of the classes and . Each class exists; for any number less than any member of belongs to , while belongs to . Finally, any member of is less than some member of , and therefore less than any member of . Thus the three conditions of Dedekind’s Theorem (§17) are satisfied, and there is a number dividing the classes.
The number is the number whose existence we had to prove. In the first place, cannot be exceeded by any member of . For if there were such a member of , we could write , where is positive. The number would then belong to , because it is less than , and to , because it is greater than ; and this is impossible. On the other hand, any number less than belongs to , and is therefore exceeded by at least one member of . Thus has all the properties required.
This number we call the upper bound of , and we may enunciate the following theorem. Any aggregate which is bounded above has an upper bound . No member of exceeds ; but any number less than is exceeded by at least one member of .
In exactly the same way we can prove the corresponding theorem for an aggregate bounded below (but not necessarily above). Any aggregate which is bounded below has a lower bound . No member of is less than ; but there is at least one member of which is less than any number greater than .
It will be observed that, when is bounded above, , and when is bounded below, . When is bounded, .
81. The bounds of a bounded function. Suppose that is a function of the positive integral variable . The aggregate of all the values defines a set , to which we may apply all the arguments of §80. If is bounded above, or bounded below, or bounded, we say that is bounded above, or bounded below, or bounded. If is bounded above, that is to say if there is a number such that for all values of , then there is a number such that
(i) for all values of ;
(ii) if is any positive number then for at least one value of . This number we call the upper bound of . Similarly, if is bounded below, that is to say if there is a number such that for all values of , then there is a number such that
(i) for all values of ;
(ii) if is any positive number then for at least one value of . This number we call the lower bound of .
If exists, ; if exists, ; and if both and exist then
82. The limits of indetermination of a bounded function. Suppose that is a bounded function, and and its upper and lower bounds. Let us take any real number , and consider now the relations of inequality which may hold between and the values assumed by for large values of . There are three mutually exclusive possibilities:
(1) for all sufficiently large values of ;
(2) for all sufficiently large values of ;
(3) for an infinity of values of , and also for an infinity of values of .
In case (1) we shall say that is a superior number, in case (2) that it is an inferior number, and in case (3) that it is an intermediate number. It is plain that no superior number can be less than , and no inferior number greater than .
Let us consider the aggregate of all superior numbers. It is bounded below, since none of its members are less than , and has therefore a lower bound, which we shall denote by . Similarly the aggregate of inferior numbers has an upper bound, which we denote by .
We call and respectively the upper and lower limits of indetermination of as tends to infinity; and write
These numbers have the following properties:(1) ;
(2) and are the upper and lower bounds of the aggregate of intermediate numbers, if any such exist;
(3) if is any positive number, then for all sufficiently large values of , and for an infinity of values of ;
(4) similarly for all sufficiently large values of , and for an infinity of values of ;
(5) the necessary and sufficient condition that should tend to a limit is that , and in this case the limit is , the common value of and .
Of these properties, (1) is an immediate consequence of the definitions; and we can prove (2) as follows. If , there can be at most one intermediate number, viz. , and there is nothing to prove. Suppose then that . Any intermediate number is less than any superior and greater than any inferior number, so that . But if then must be intermediate, since it is plainly neither superior nor inferior. Hence there are intermediate numbers as near as we please to either or .
To prove (3) we observe that is superior and intermediate or inferior. The result is then an immediate consequence of the definitions; and the proof of (4) is substantially the same.
Finally (5) may be proved as follows. If , then
for every positive value of and all sufficiently large values of , so that . Conversely, if , then the inequalities above written hold for all sufficiently large values of . Hence is inferior and superior, so that and therefore . As , this can only be true if .Examples XXXII. 1. Neither nor is affected by any alteration in any finite number of values of .
2. If for all values of , then .
3. If , then and .
4. If , then and .
5. If , then , , .
6. If , then , , , .
7. Let , where . If is an integer then . If is rational but not integral a variety of cases arise. Suppose, e.g., that , and being positive, odd, and prime to one another, and . Then assumes the cyclical sequence of values
It is easily verified that the numerically greatest and least values of are and , so that The reader may discuss similarly the cases which arise when and are not both odd.The case in which is irrational is more difficult: it may be shown that in this case and . It may also be shown that the values of are scattered all over the interval in such a way that, if is any number of the interval, then there is a sequence , , … such that as .47
The results are very similar when is the fractional part of .
83. The general principle of convergence for a bounded function. The results of the preceding sections enable us to formulate a very important necessary and sufficient condition that a bounded function should tend to a limit, a condition usually referred to as the general principle of convergence to a limit.
THEOREM 1. The necessary and sufficient condition that a bounded function should tend to a limit is that, when any positive number is given, it should be possible to find a number such that for all values of and such that .
In the first place, the condition is necessary. For if then we can find so that
when , and so(1) |
when and .
In the second place, the condition is sufficient. In order to prove this we have only to show that it involves . But if then there are, however small may be, infinitely many values of such that and infinitely many such that ; and therefore we can find values of and , each greater than any assigned number , and such that
which is greater than if is small enough. This plainly contradicts the inequality (1). Hence , and so tends to a limit.84. Unbounded functions. So far we have restricted ourselves to bounded functions; but the ‘general principle of convergence’ is the same for unbounded as for bounded functions, and the words ‘a bounded function’ may be omitted from the enunciation of Theorem 1.
In the first place, if tends to a limit then it is certainly bounded; for all but a finite number of its values are less than and greater than .
In the second place, if the condition of Theorem 1 is satisfied, we have
whenever and . Let us choose some particular value greater than . Then when . Hence is bounded; and so the second part of the proof of the last section applies also.The theoretical importance of the ‘general principle of convergence’ can hardly be overestimated. Like the theorems of §69, it gives us a means of deciding whether a function tends to a limit or not, without requiring us to be able to tell beforehand what the limit, if it exists, must be; and it has not the limitations inevitable in theorems of such a special character as those of §69. But in elementary work it is generally possible to dispense with it, and to obtain all we want from these special theorems. And it will be found that, in spite of the importance of the principle, practically no applications are made of it in the chapters which follow.48 We will only remark that, if we suppose that
we obtain at once a necessary and sufficient condition for the convergence of an infinite series, viz:THEOREM 2. The necessary and sufficient condition for the convergence of the series is that, given any positive number , it should be possible to find so that for all values of and such that .
85. Limits of complex functions and series of complex terms. In this chapter we have, up to the present, concerned ourselves only with real functions of and series all of whose terms are real. There is however no difficulty in extending our ideas and definitions to the case in which the functions or the terms of the series are complex.
Suppose that is complex and equal to
where , are real functions of . Then if and converge respectively to limits and as , we shall say that converges to the limit , and write Similarly, when is complex and equal to , we shall say that the series is convergent and has the sum , if the series are convergent and have the sums , respectively.To say that is convergent and has the sum is of course the same as to say that the sum
converges to the limit as .In the case of real functions and series we also gave definitions of divergence and oscillation, finite or infinite. But in the case of complex functions and series, where we have to consider the behaviour both of and of , there are so many possibilities that this is hardly worth while. When it is necessary to make further distinctions of this kind, we shall make them by stating the way in which the real or imaginary parts behave when taken separately.
86. The reader will find no difficulty in proving such theorems as the following, which are obvious extensions of theorems already proved for real functions and series.
(1) If then for any fixed value of .
(2) If is convergent and has the sum , then is convergent and has the sum , and is convergent and has the sum .
(3) If and , then
(4) If , then .
(5) If and , then .
(6) If converges to the sum , and to the sum , then converges to the sum .
(7) If converges to the sum then converges to the sum .
(8) If is convergent then .
(9) If is convergent, then so is any series formed by grouping the terms in brackets, and the sums of the two series are the same.
As an example, let us prove theorem (5). Let
Then
But
and so that i.e.The following theorems are of a somewhat different character.
(10)In order that should converge to zero as , it is necessary and sufficient that
should converge to zero.If and both converge to zero then it is plain that does so. The converse follows from the fact that the numerical value of or cannot be greater than .
(11) More generally, in order that should converge to a limit , it is necessary and sufficient that
should converge to zero.For converges to zero, and we can apply (10).
(12)Theorems 1 and 2 of §§ 83–84 are still true when and are complex.
We have to show that the necessary and sufficient condition that should tend to is that
(1) |
when .
If then and , and so we can find numbers and depending on and such that
the first inequality holding when , and the second when . Hence when , where is the greater of and . Thus the condition (1) is necessary. To prove that it is sufficient we have only to observe that when . Thus tends to a limit , and in the same way it may be shown that tends to a limit .87. The limit of as , being any complex number. Let us consider the important case in which . This problem has already been discussed for real values of in § 72.
If then , by (1) of § 86. But, by (4) of § 86,
and therefore , which is only possible if (a) or (b) . If then . Apart from this special case the limit, if it exists, can only be zero.Now if , where is positive, then
so that . Thus tends to zero if and only if ; and it follows from (10) of § 86 that if and only if . In no other case does converge to a limit, except when and .88. The geometric series when is complex. Since
unless , when the value of is , it follows that the series is convergent if and only if . And its sum when convergent is .Thus if , and , we have
Separating the real and imaginary parts, we obtain
provided . If we change into , we see that these results hold also for negative values of numerically less than . Thus they hold when .
Examples XXXIII. 1. Prove directly that converges to when and to when and is a multiple of . Prove further that if and is not a multiple of , then oscillates finitely; if and is a multiple of , then ; and if and is not a multiple of , then oscillates infinitely.
2. Establish a similar series of results for .
3. Prove that
if and only if . Which of the theorems of §86 do you use?
4. Prove that if then
5. The series
converges to the sum if . Show that this condition is equivalent to the condition that has a real part greater than .
1. The function takes the values , , , , , , , , , … when , , , …. Express in terms of by a formula which does not involve trigonometrical functions. [.]
2. If steadily increases, and steadily decreases, as tends to , and if for all values of , then both and tend to limits, and . [This is an immediate corollary from §69.]
3. Prove that, if
then and . [The first result has already been proved in §73.]4. Prove also that for all values of : and deduce (by means of the preceding examples) that both and tend to limits as tends to .49
5. The arithmetic mean of the products of all distinct pairs of positive integers whose sum is is denoted by . Show that .
6. Prove that if , , and so on, and being positive, then .
[Prove first that .]
7. If is a positive integer for all values of , and tends to with , then tends to if and to if . Discuss the behaviour of , as , for other values of .
8.50If increases or decreases steadily as increases, then the same is true of .
9. If , and and are positive, then the sequence , , , … is an increasing or decreasing sequence according as is less than or greater than , the positive root of the equation ; and in either case as .
10. If , and and are positive, then the sequences , , , … and , , , … are one an increasing and the other a decreasing sequence, and each sequence tends to the limit , the positive root of the equation .
11. The function is increasing and continuous (see Ch. V) for all values of , and a sequence , , , … is defined by the equation . Discuss on general graphical grounds the question as to whether tends to a root of the equation . Consider in particular the case in which this equation has only one root, distinguishing the cases in which the curve crosses the line from above to below and from below to above.
12. If , are positive and , then the sequences , , , … and , , , … are one a decreasing and the other an increasing sequence, and they have the common limit .
13. Draw a graph of the function defined by the equation
14. The function
is equal to except when is an integer, and then equal to . The function is equal to unless is an integer, and then equal to .15. Show that the graph of the function
is composed of parts of the graphs of and , together with (as a rule) two isolated points. Is defined when (a) , (b) , (c) ?16. Prove that the function which is equal to when is rational, and to when is irrational, may be represented in the form
where as in Ex. XXXI. 14. [If is rational then , and therefore , is equal to zero from a certain value of onwards: if is irrational then is always positive, and so is always equal to .]Prove that may also be represented in the form
17. Sum the series
[Since
we have and so18. If , then
19. Expansion of in powers of . Let , be the roots of , so that . We shall suppose that , , , , are all real, and and unequal. It is then easy to verify that
There are two cases, according as or .(1) If then the roots , are real and distinct. If is less than either or we can expand and in ascending powers of (Ex. 18). If is greater than either or we must expand in descending powers of ; while if lies between and one fraction must be expanded in ascending and one in descending powers of . The reader should write down the actual results. If is equal to or then no such expansion is possible.
(2) If then the roots are conjugate complex numbers (Ch. III §43), and we can write
where , , so that , .If then each fraction may be expanded in ascending powers of . The coefficient of will be found to be
If we obtain a similar expansion in descending powers, while if no such expansion is possible.20. Show that if then
[The sum to terms is .]
21. Expand in powers of , ascending or descending according as or .
22. Show that if and then
where ; and find the corresponding expansion, in descending powers of , which holds when .23. Verify the result of Ex. 19 in the case of the fraction . [We have .]
24. Prove that if then
25. Expand , and in ascending powers of . For what values of do your results hold?
26. If then
27. If then
[Let . Then we have to prove that tends to zero if does so.
We divide the numbers , , …, into two sets , , …, and , , …, . Here we suppose that is a function of which tends to as , but more slowly than , so that and : e.g. we might suppose to be the integral part of .
Let be any positive number. However small may be, we can choose so that , , …, are all numerically less than when , and so
But, if is the greatest of the moduli of all the numbers , , …, we have and this also will be less than when , if is large enough, since as . Thus when ; which proves the theorem.The reader, if he desires to become expert in dealing with questions about limits, should study the argument above with great care. It is very often necessary, in proving the limit of some given expression to be zero, to split it into two parts which have to be proved to have the limit zero in slightly different ways. When this is the case the proof is never very easy.
The point of the proof is this: we have to prove that is small when is large, the ’s being small when their suffixes are large. We split up the terms in the bracket into two groups. The terms in the first group are not all small, but their number is small compared with . The number in the second group is not small compared with , but the terms are all small, and their number at any rate less than , so that their sum is small compared with . Hence each of the parts into which has been divided is small when is large.]
28. If as , then .
[If then , and the theorem reduces to that proved in the last example.]
29. If , so that is equal to or according as is odd or even, then as .
[This example proves that the converse of Ex. 27 is not true: for oscillates as .]
30. If , denote the sums of the first terms of the series
thenup | next | prev | ptail | top |