theoretically certain <strong>and</strong> its non-occurrence can take place only because of an incompleteaccordance between the actual conditions <strong>and</strong> our theoretical pattern. Thus, when forming adefinite infinite binary fraction, for example, 8/15 = 0.10001 …, where the limit of therelative number of the units is 1/4, we must state that its composition is incompatible with theassumption that the occurrence of 1 <strong>and</strong> 0 on each place is equally probable.And it is generally impossible to indicate a method of forming an infinite binary fraction,where the sequence of unities <strong>and</strong> zeros would have obeyed an infinite number of conditionsimplied by the laws of large numbers. Infinite series composed absolutely arbitrarily,r<strong>and</strong>omly (so that each number is arbitrary in itself) essentially differ from series compiled inaccord with a definite mathematical law no matter how arbitrary it is. A confusion of thesetwo notions, caused by the fact that such differentiation does not exist between r<strong>and</strong>om <strong>and</strong>regular finite series, is one of the main sources of paradoxes to which the theory ofprobability of infinite totalities is leading.Notes1. (§1.1.8). Conversely, the principle of uniqueness follows if we suppose that (A or A ) =; that is, when assuming that a proposition <strong>and</strong> its negation are solely possible. Indeed, if is compatible with any proposition (excepting O), then α = O, hence ( or O) = <strong>and</strong> =.2. (§1.1.9). When applying it to the given equation (4), we find that conditions{(A or a or b) or [ A <strong>and</strong> ( a′or b′ )]} = ,{(A) or a or b) or [ A <strong>and</strong> ( a or b )]} = are necessary <strong>and</strong> sufficient for its solvability.3. (§1.2.1). It could have been proved that, also conversely, the assumption that a trueproposition exists, leads to the constructive principle. Thus, for a finite totality {ofpropositions}, this principle <strong>and</strong> the axiom of the existence of a true proposition areequivalent. {Not axiom but Theorem 1.1.}4. (§1.2.3). For example, the principle of uniqueness is not valid for the system 1, 2, 3, 4,6, 12. The proposition corresponding to the number 2 would have been compatible with allthe propositions <strong>and</strong> its negation would therefore be only the false proposition. This lastmentionedwould therefore possess the most important property of a true proposition withouthowever being true.5. (§1.3.1). So as not to exclude the false proposition, it is possible to agree that it is a joinof zero elementary propositions, – that it does not contain any of them.6. (§2.1.1). The theory of probability considers only perfect totalities of propositions.7. (§2.1.4). Had we called the fraction m/(n – m) probability, the ratio of the number of theoccurrences of an event to the total number of trials should have been replaced, in theBernoulli theorem for example, by the ratio of the former to the number of the nonoccurrences.The statement of the addition theorem would have also been appropriatelychanged: the probability of (A or B) would have been equal not to the sum of theprobabilities, (p + p 1 ), but to(p + p 1 + 2pp 1 )/(1 – pp 1 ).8. (§2.1.5).{Below, the author specifies his incomplete distinction.}9. (§2.1.5) If p + p 1 > 1, we would have to choose A instead of B <strong>and</strong> would have thusconvinced ourselves in the inadmissibility of such an assumption.
10. (§2.1.5). Such two propositions could not be chosen only if n + n > 1. Replacing thenproposition B n by A n , we would have determined, when applying Axiom 2.2, that theproposition (A or B) has probability higher than unity, – that is, higher than has, whichcontradicts Axiom 2.1. Consequently, in this case p <strong>and</strong> p 1 cannot be the probabilities ofincompatible propositions.11. (§2.1.6). Note that Axioms 2.1 <strong>and</strong> 2.2b taken together are equivalent to the followingsingle axiom: Inequality A > B means that there exists (or can be added) such a propositionB 1 being a particular case of A that B 1 ~ B.12. (§2.2.2). Issuing from the notion of realization of one or several propositions, Markov(1913, p. 19) provides another definition:We call several events E 1 , E 2 , …, E n independent one of another if the probability of noneof them depends on the existence or non-existence of the other ones, so that no indicationthat some of these events exist or do not exist changes the probabilities of the other events.It is not difficult to satisfy ourselves that the two definitions are equivalent, but it ought tobe noted that some conditions in the latter necessarily follow from the other ones. This isobvious because the number of these conditions is here n(2 n–1 – 1), or [(n – 2)2 n–1 + 1] greaterthan in the former definition. These redundant conditions are therefore corollaries of theother ones. For n = 2 the independence of B of A is a corollary of the independence of A of B.Note that in many cases (for example, in the {Bienaymé –} Chebyshev inequality), it isessential to break up the notion of independence, <strong>and</strong> the pairwise dependence orindependence plays an especially important part.13. (§2.2.3). A similar axiom only concerning totalities with equally possible elementarypropositions is found in Markov (1913, p. 8). Let us explain our axiom by an example. If anypermutation of a complete deck of playing cards taken two at a time has the same probability1/(5251), then, in accord with the addition theorem, the probability that the first or thesecond drawn card is the knave of hearts is 51/(5251) = 1/52; upon discovering that the firstcard was the queen of hearts, all the permutations containing that queen remain equallypossible only because of the axiom of realization, <strong>and</strong> the probability for the second card tobe the knave of hearts becomes equal to 1/51. Had we only assumed that at each singledrawing the possibility of the occurrence of each card was one <strong>and</strong> the same, this axiomwould have been insufficient for recognizing that all the permutations taken two at a timewere equally possible. This fact becomes natural once we note that it is easy to indicate anexperiment where these permutations are not equally possible.14. (§2.2.3). {Literal translation.}15. (§2.2.3). At first, issuing from the functional equation f(x + y) = f(x) + f(y), we obtain,for any integer n,f(n x) = n f(x). (*)Then, assuming that nx = my, where m is also an integer, we get nf(x) = mf(y), hence f(nx/m)= n/mf(x). Since f(x) is finite (|f(x)| 1 for 0 x 1), we infer from (*) that it tends to zerowith x so that it is continuous <strong>and</strong> the equality f(tx) = tf(x), proven for any rational t, is thenvalid for any t. Consequently,f(t) = tf(1).16. (§3.1.1). It is obvious that, once join H exists, it is unique. Indeed, if H 1 also satisfiesthe first condition, then (A or H 1 ) = H 1 , (B or H 1 ) = H 1 , etc, so that (H or H 1 ) = H 1 . But sinceH 1 also obeys the second condition, (H or H 1 ) = H <strong>and</strong> H = H 1 .17. (§3.1.2). The previous definition of incompatibility of two propositions can persist.
- Page 3:
of All Countries and to the Entire
- Page 6 and 7:
(Coll. Works), vol. 4. N.p., 1964,
- Page 8 and 9:
individuals of the third class, the
- Page 10:
From the theoretical point of view
- Page 13 and 14:
Second case: Each crossing can repr
- Page 15 and 16:
On the other hand, for four classes
- Page 17 and 18:
f i = i S + i , i = 1, 2, 3, 4, (
- Page 19 and 20: f 1 = C 1 P(f 1 ; …; f n+1 ), C 1
- Page 21 and 22: ut in this case f = 2 , f 1 = 2 ,
- Page 23 and 24: I also note the essential differenc
- Page 25 and 26: A 1 23n1 + 1 A 1 A 1 … A 11A 2 A
- Page 27 and 28: coefficient of 2 in the right side
- Page 29 and 30: h(A r h - c h A r 0 ) = - A r0we tr
- Page 31 and 32: Notes1. Our formulas obviously pres
- Page 33 and 34: Bernstein’s standpoint regarding
- Page 35 and 36: Corollary 1.8. A true proposition c
- Page 37 and 38: It is important to indicate that al
- Page 39 and 40: ut for the simultaneous realization
- Page 41 and 42: devoid of quadratic divisors and re
- Page 43 and 44: propositions (B i and C j ) can be
- Page 45 and 46: A ~ A 1 and B = B 1 , we will have
- Page 47 and 48: included in a given totality as equ
- Page 49 and 50: For unconnected totalities we would
- Page 51 and 52: proposition given that a second one
- Page 53 and 54: On the other hand, let x be a parti
- Page 55 and 56: totality is perfect, but that the j
- Page 57 and 58: In this case, all the finite or inf
- Page 59 and 60: probabilities p 1 , p 2 , … respe
- Page 61 and 62: where x is determined by the inequa
- Page 63 and 64: totality of the second type (§3.1.
- Page 65 and 66: x = /2 + /(23) + … + /(23… p n
- Page 67 and 68: that the fall of a given die on any
- Page 69: infinitely many digits only dependi
- Page 73 and 74: F(x + h) - F(x) = Mh, therefore F(x
- Page 75 and 76: “confidence” probability is bas
- Page 77 and 78: x1+ Lp n (x) x1− Lx1+ Lf(t)dt < x
- Page 79 and 80: |(x 1 ; t 0 ; t 1 ) - 1 t0tf(t)dt|
- Page 81 and 82: 5. The distribution ofξ , the arit
- Page 83 and 84: P(x 1i < x) = F(x; a i ) = C(a i )
- Page 85 and 86: egards his promises. Markov shows t
- Page 87 and 88: other solely and equally possible i
- Page 89 and 90: notion of probability and of its re
- Page 91 and 92: However, already in the beginning o
- Page 93 and 94: the revolution. My main findings we
- Page 95 and 96: Nevertheless, Slutsky is not suffic
- Page 97 and 98: path that would completely answer h
- Page 99 and 100: on political economy as well as wit
- Page 101 and 102: scientific merit. Borel was indeed
- Page 103 and 104: [3] Already in Kiev Slutsky had bee
- Page 105 and 106: different foundation. The difficult
- Page 107 and 108: 5. On the criterion of goodness of
- Page 109 and 110: --- (1999, in Russian), Slutsky: co
- Page 111 and 112: Here also, the author considers the
- Page 113 and 114: second, it is not based on assumpti
- Page 115 and 116: experimentation and connected with
- Page 117 and 118: Russian, and especially of the Sovi
- Page 119 and 120: station in England. This book, as h
- Page 121 and 122:
Uspekhi Matematich. Nauk, vol. 10,
- Page 123 and 124:
variety and detachment of those lat
- Page 125 and 126:
46. On the distribution of the regr
- Page 127 and 128:
119. On the Markov method of establ
- Page 129 and 130:
No lesser difficulties than those e
- Page 131 and 132:
Separate spheres of work considerab
- Page 133 and 134:
10. Anderson, O. Letters to Karl Pe
- Page 135 and 136:
Hier sind, im Allgemeinen, ganz ana
- Page 137 and 138:
Jedenfalls, glaube ich erwiesen zu
- Page 139 and 140:
werde ich das ganze Material in kur
- Page 141 and 142:
considered as the limiting case of
- Page 143 and 144:
and, inversely,] = m ...1 2 N[ ch h
- Page 145 and 146:
µ 2 2 = m 2 2 - 2m 2 m 1 2 + m 1 4
- Page 147 and 148:
(x k - x k+1 ) … (x k - x +) = E(
- Page 149 and 150:
the thus obtained relations as pert
- Page 151 and 152:
[1/S(S - 1)(S - 2)][(Si = 1Sx i ) 3
- Page 153 and 154:
( N −1)((S − N )(2NS− 3S− 3
- Page 155 and 156:
µ 5 + 2µ 2 µ 3 = U [S/S] 5 + 2U
- Page 157 and 158:
case, the same property is true wit
- Page 159 and 160:
It follows that the question about
- Page 161 and 162:
then expressed my doubts). And Gned
- Page 163 and 164:
For Problem 1, formula (7) shows th
- Page 165 and 166:
Let us calculate now, by means of f
- Page 167 and 168:
ϕ′1(x)1E(a|x 1 ; x 2 ; …; x n
- Page 169 and 170:
Theorem 3. If the prior density 3
- Page 171 and 172:
P( ≤ ≤ |, 1 , 2 , …, s )
- Page 173 and 174:
6. A Sensible Choice of Confidence
- Page 175 and 176:
0 = A 0 n, = B2, = B2, 0 = C 0 n
- Page 177 and 178:
Note also that (95),(96), (83),(85)
- Page 179 and 180:
Γ(n / 2)Γ [( n −1) / 2]k = (1/2
- Page 181 and 182:
f (x 1 , x 2 , …, x n ) = 1 if x
- Page 183 and 184:
and the probability of achieving no
- Page 185 and 186:
E = kEµ. (14)In many particular ca
- Page 187 and 188:
a = np, b = np 2 = a 2 /n, = a/nand
- Page 189 and 190:
with number (2k - 2), we commit an
- Page 191 and 192:
(67)which is suitable even without
- Page 193 and 194:
" = 1/[1 - e - ], = - ln [1 - (1/
- Page 195 and 196:
Such structures are entirely approp
- Page 197 and 198:
11. As a result of its historical d
- Page 199 and 200:
exaggeration towards a total denial