compile incompatible, solely <strong>and</strong> equally possible propositions 1 , 2 , …, , µ of whichhave B as their join. But it is obvious that d i ~ , k because, when assuming for example that d 1> 1 , we would have obtained that always d i < i <strong>and</strong>, in accord with Axiom 2.2b, > which is impossible. But then, d 1 ~ 1 , d 2 ~ 2 etc, hence(d 1 or d 2 or … or d µ ) ~ ( 1 or 2 or … or µ );that is, A ~ B, QED.2.1.4. Definition of Mathematical <strong>Probability</strong>The coefficient, which we called the mathematical probability of A, is thus quitedetermined by the fraction m/n where n is the number of solely <strong>and</strong> equally possibleincompatible propositions m of which have A as their join. Consequently, this coefficient is afunction of m/n which we denote by (m/n). On the basis of the above, should beincreasing <strong>and</strong> this necessary condition is at the same time sufficient for satisfying all theassumed axioms if only the function (m/n) can be fixed once <strong>and</strong> forever for all thetotalities that might be added to the given one. Since such a function can be chosenarbitrarily, we assume its simplest form: (m n) = m/n so that m/n is called the mathematicalprobability of A.However, in accord with the main axioms we could have just as well chosen m 2 /n 2 , m/(n –m), etc. The assumption of one or another verbal definition of probability would haveobviously influenced the conclusions of probability theory just as little as a change of a unitof measure influences the inferences of geometry or mechanics. Only the form but not thesubstance of the theorems would have changed; we would have explicated the theory ofprobability in a new terminology rather than obtained a new theory. The agreement that I amintroducing here is therefore of a purely technical nature 7 as contrasted with the case of themain axioms assumed above <strong>and</strong> characterizing the essence of the notion of probability: theirviolation would have, on the contrary, utterly changed the substance of probability theory.Note. Together with Borel (1914, p. 58) we might have called the fraction m/(n – m), – theratio of the number of the favorable cases to the number of unfavorable cases; or, theexpression (m/n )/[(n – m)/n], – the ratio of the probability of a proposition to that of itsnegation, – the relative probability of the proposition.Remark. When adding a new totality to the given one, we must, <strong>and</strong> we can alwaysdistribute, in accord with the axioms, the values of the probabilities of the newly introducedpropositions in such a manner that the given propositions will still have the same probability{probabilities} as they had in the original totality. Indeed, suppose that the elementarypropositions A 1 , A 2 , …, A n in the given totality are equally possible; consequently, afterchoosing the function (m/n) all the propositions of the totality acquire quite definite values.Add the second totality formed of elementary propositions B 1 , B 2 , …, B k <strong>and</strong> let us agree toconsider that, for example, all the combinations (A i <strong>and</strong> B j ) in the united totality are alsoequally possible. If the function persists all the propositions of the united totality willobtain definite probabilities <strong>and</strong> any join of the type (A 1 or A 2 or … or A m ) previously havingprobability (m/n) <strong>and</strong> regarded as a join[(A 1 <strong>and</strong> B 1 ) or (A 1 <strong>and</strong> B 2 ) or … or (A m <strong>and</strong> B k )]must now have probability (km/kn) equal to its previous value, (m/n). And all thepropositions B j will also be equally possible.We may thus agree to consider any incompatible <strong>and</strong> solely possible propositionsA 1 , A 2 , …, A k (16)
included in a given totality as equally possible. After this, those <strong>and</strong> only those propositionswhich are joins of (16), or, otherwise, which are included into a totality G as its elementarypropositions, obtain definite probabilities. Then another group of solely possible <strong>and</strong>incompatible propositions B 1 , B 2 , …, B l can also be considered as equally possible if thetotality G composed of them is not connected with G, etc.Indeed, no proposition excepting is a join of the elementary propositions of G <strong>and</strong> G)at the same time. If, however, <strong>and</strong> are two incompatible with each other propositions ofG, <strong>and</strong> <strong>and</strong> are similar propositions of G, then, on the strength of the definition ofprobability, the agreement that ~ , ~ will lead to ( or ) ~ ( or ) <strong>and</strong> ~ , <strong>and</strong> > will imply ( or ) > ( or ) so that our axioms will not be violated.As to the combinations <strong>and</strong> joins of compatible propositions, their probabilities are notquite determined <strong>and</strong> a new agreement is necessary (see below) for determining them. In anycase, I have indicated above the possibility of such an agreement.2.1.5. The Addition TheoremThe Axiom 2.2a can be formulated otherwise: If p is the probability of A, <strong>and</strong> p 1 , theprobability of B, the probability of (A or B) for A <strong>and</strong> B incompatible one with another is afunction f(p; p 1 ). The type of f depends on the choice of the function (m/n). It is not difficultto derive a general connection between them, but after the above statements it is quitesufficient to restrict our attention to the case of (m/n) = m/n which leads, as we shall see, tof(p; p 1 ) = p + p 1 . (17)Conversely, if we fix the function f, which on the strength of the axioms should necessarilybe increasing, symmetric <strong>and</strong> satisfying the equationf[p; f(p 1 ; p 2 )] = f[p 1 ; f(p 1 ; p 2 )],we will obtain the appropriate ; in particular, from (17) it is possible to derive (m/n) =(m/n)H where H is an arbitrary positive number.Theorem 2.2. If two incompatible propositions A <strong>and</strong> B have probabilities p <strong>and</strong> p 1respectively, then the proposition (A or B) has probability (p + p 1 ).This theorem is usually proved (Markov 1913, pp. 11 <strong>and</strong> 172) for incompatible joins ofsolely <strong>and</strong> equally possible incompatible propositions A <strong>and</strong> B, i.e., when a direct applicationof the definition of probability makes it hardly necessary. In actual fact, the theorem isimportant exactly when it cannot be justified. For the sake of completeness of the proof weonly need to cite Axiom 2.2 once more: to refer to its first part if both numbers p <strong>and</strong> p 1 arerational, <strong>and</strong> to its second part if they are irrational 8 .Indeed, let us assume at first that p <strong>and</strong> p 1 are rational so that p = m/n <strong>and</strong>p 1 = m 1 /n 1 . When adding some totality to the initial one, unconnected with it <strong>and</strong> containingnn 1 equally possible elementary propositions, proposition A), which is a join of some mn 1 ofthese, will have the same probability mn 1 /nn 1 = m/n = p as A whereas B), which is a join ofsome other 9 m 1 n elementary propositions, will have the same probability m 1 n/n 1 n = m 1 /n 1 =p 1 as B. In this case, (A) or B)) will be a join of (m 1 n + n 1 m) out of nn 1 elementarypropositions <strong>and</strong> therefore, in accord with the definition of probability,(m 1 n + n 1 m)/nn 1 = m 1 /n 1 + m/n = p 1 + pwill be the probability of (A) or B)), <strong>and</strong>, on the strength of Axiom 2.2a, it will also be theprobability of (A or B), QED.
- 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: A ~ A 1 and B = B 1 , we will have
- 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 and 70: infinitely many digits only dependi
- Page 71 and 72: 10. (§2.1.5). Such two proposition
- 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