ReferencesAleks<strong>and</strong>rov, P.S., Akhiezer, N.I., Gnedenko, B.V., Kolmogorov, A.N. (1969), S.N.Bernstein. An obituary. Uspekhi Matematich. Nauk, vol. 24, No. 3, pp. 211 – 218. Thisperiodical is being completely translated as Russian Math. Surveys.Bernstein, S.N. (1922), On the application of mathematics to biology. Translated in thiscollection.--- (1923a), Démonstration mathématique de la loi d’hérédité de Mendel. C.r. Acad. Sci.Paris, t. 177, pp. 528 – 531.--- (1923b), Principe de stationnarité et généralisations de la loi de Mendel. Ibidem, pp. 581 –584.--- (1942), Solution of a mathematical problem connected with the theory of heredity. AnnalsMath. Stat., vol. 13, pp. 53 – 61.--- (1946), (Theory of probability). M. Fourth edition.Johannsen, Wm (1926), Elemente der exakten Erblichkeitslehre. 3. Aufl. Jena.Karlin, S. (1922), Fisher <strong>and</strong> evolutionary theory. Stat. Sci., vol. 7, pp. 13 –33.Kolmogorov, A.N. (1938), Theory of probability <strong>and</strong> its applications. In Matematika iEstestvoznanie v SSSR. M., pp. 51 – 61. ( R ) Transl.: DHS 2696, 2000, pp. 175 – 186.Morgan, T.H. (1919), The physical basis of heredity. Philadelphia – London.Seneta, E. (2001), S.N. Bernstein. In Statisticians of the Centuries. Editors, C.C. Heyde, E.Seneta. New York, 2001, pp. 339 – 342.<strong>Sheynin</strong>, O. (1998), <strong>Statistics</strong> in the Soviet epoch. Jahrbücher f. Nat.-ökon. u. Statistik, Bd.217, pp. 529 – 549.3. S.N. Bernstein. An Essay on an Axiomatic Justification of the Theory of <strong>Probability</strong> (Coll. Works), vol. 4. N.p., 1964, pp. 10 – 60 …Foreword by TranslatorThe human mind experiencesless{difficulties}when movingahead than when probing itself(Laplace 1812)The first to argue that the theory of probability should be axiomatized was Boole (1854, p.288); Hilbert, in 1901, attributed the theory to physical sciences <strong>and</strong> formulated the samedem<strong>and</strong>. Bernstein was likely the first to develop an axiomatic approach to probability, <strong>and</strong>he later described his attempt in each edition of his treatise (1927). Then, in an extremelyshort annotation to vol. 4 (1960) of his (Coll. Works), where his workwas reprinted, he stated that his axiomatics was the basis of a “considerable part” of hiswritings of 1911 – 1946. Slutsky (1922) examined the logical foundation of the theory ofprobability. Several years later he (1925, p. 27n) remarked that then, in 1922, he had notknown Bernstein’s work which “deserves a most serious study”.Kolmogorov (1948, p. 69) described Bernstein’s work as follows: the essence of hisconcept consisted “not of the numerical values of the probability of events but of aqualitative comparison of events according to their higher or lower probabilities …” Then, he<strong>and</strong> Sarmanov (1960, pp. 215 – 216) largely repeated that statement <strong>and</strong> added that Koopmanhad “recently” been moving in the same direction. In turn, Ibragimov (2000, p. 85) stated thatboth Bernstein <strong>and</strong> Kolmogorov had “adopted the structure of normed Boolean algebras asthe basis of probability theory”. Ibragimov (pp. 85 <strong>and</strong> 86) also politely called in question
Bernstein’s st<strong>and</strong>point regarding infinitely many trials (his §3.2.1) <strong>and</strong> even his opinionconcerning general mathematical constructions such as convergence almost everywhere.Bernstein’s contribution translated below is hardly known outside Russia. EvenHochkirchen (1999) only mentioned it in his list of Quellen und Fachliteratur but not at all inhis main text.Bernstein had not systematized his memoir. The numbering of the formulas was notthought out, theorems followed one another without being numbered consecutively; notationwas sometimes violated <strong>and</strong> misprints were left unnoticed. Finally, in §3.2.5 Bernsteinintroduced function F(z) which appeared earlier as F(x). And, what happens time <strong>and</strong> timeagain in the works of many authors, he had not supplied the appropriate page number in hisepigraph above. I have not been able to correct sufficiently these shortcomings but at least Imethodically numbered the axioms, theorems <strong>and</strong> corollaries although several propositionsnot called either theorems or corollaries; again, yet others were named principles.* * *The calculation of probabilities is based on several axioms <strong>and</strong> definitions. Usually,however, these main axioms are not stated sufficiently clearly; it remains therefore an openquestion which assumptions are necessary, <strong>and</strong> whether they do not contradict one another.The definition itself of mathematical probability implicitly contains a premise (Laplace 1814,p. 4) in essence tantamount to the addition theorem which some authors (Bohlmann ca. 1905,p. 497) assume as an axiom. Consequently, I consider it of some use to explicate here myattempt to justify axiomatically the theory of probability. I shall adhere to a purelymathematical point of view that only dem<strong>and</strong>s a rigorous <strong>and</strong> exhausting statement ofindependent rules not contradicting each other, on whose foundation all the conclusions ofthe theory, regarded as an abstract mathematical discipline, ought to be constructed. It is ofcourse our desire for cognizing the external world as precisely as possible that dictates usthese rules. However, so as not to disturb the strictly logical exposition, I prefer to touch theissue of the philosophical <strong>and</strong> practical importance of the principles of probability theoryonly in a special supplement at the end of this paper.Chapter 1. Finite Totalities of Propositions1.1. Preliminary Definitions <strong>and</strong> Axioms1.1.1. Equivalent <strong>and</strong> Non-Equivalent PropositionsLet us consider a finite or infinite totality of symbols A, B, C, etc which I shall callpropositions. I shall write M = N (N = M) <strong>and</strong> call M <strong>and</strong> N equivalent after agreeing that,when performing all the operations defined below on our symbols, it is always possible toreplace M by N <strong>and</strong> vice versa. In particular, if M = N <strong>and</strong> M = L, then N = L.Suppose that not all of the given propositions are equivalent, that there exist two such A<strong>and</strong> B that A ' B. If the number of non-equivalent propositions is finite, I shall call theirgiven totality finite; otherwise, infinite. In this chapter, I consider only finite totalities.1.1.2. Axioms Describing the Operation (of Partition) Expressed by the Sign “Or”1.1. The constructive principle: If (in the given totality) there exist propositions A <strong>and</strong> B,then proposition C = (A or B) also exists.1.2. The commutative principle: (A or B) = (B or A ).1.3. The associative principle: [A or (B or C)] = [(A or B) or C] = (A or Bor C).1.4. The principle of tautology: (A or A) = A.By applying the first three principles it is possible to state that, in general, there exists aquite definite proposition H = (A or B or … E). I shall call it a join of propositions A, B, …,E. Each of these is called a particular case of H.
- 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: Notes1. Our formulas obviously pres
- 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 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