25.01.2013 Views

popper-logic-scientific-discovery

popper-logic-scientific-discovery

popper-logic-scientific-discovery

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

probability 165<br />

binomial formula (3), it is sufficient to assume that α is chance-like or<br />

random. 2 (Our task is equivalent to that of showing that the special<br />

theorem of multiplication holds for the sequence of adjoining<br />

segments of a random sequence α.)<br />

The proof* 1 of formula (3) may be carried out in two steps. First we<br />

show that formula (2) holds not only for sequences of overlapping<br />

segments α (n), but also for sequences of adjoining sequences α n. Secondly,<br />

we show that the latter are ‘absolutely free’. (The order of these<br />

steps cannot be reversed, because a sequence of overlapping segments<br />

α (n) is definitely not ‘absolutely free’; in fact, a sequence of this kind<br />

provides a typical example of what may be called ‘sequences with<br />

after-effects’. 3 )<br />

First step. Sequences of adjoining segments α n are sub-sequences of<br />

α (n). They can be obtained from these by normal ordinal selection. Thus<br />

if we can show that the limits of the frequencies in overlapping<br />

sequences α(n) F′(m) are insensitive to normal ordinal selection, we<br />

have taken our first step (and even gone a little farther); for we shall<br />

have proved the formula:<br />

α n F′ (m) = α(n) F′ (m) (4)<br />

I shall first sketch this proof in the case of n = 2; i.e. I shall show that<br />

α 2 F′(m) = α(2) F′(m) (m � 2) (4a)<br />

is true; it will then be easy to generalize this formula for every n.<br />

From the sequence of overlapping segments α (2) we can select two<br />

2 Reichenbach (Axiomatik der Wahrscheinlichkeitsrechnung, Mathematische Zeitschrift 34, 1932,<br />

p. 603) implicitly contests this when he writes, ‘ . . . normal sequences are also free<br />

from after-effect, whilst the converse does not necessarily hold’. But Reichenbach’s normal<br />

sequences are those for which (3) holds. (My proof is made possible by the fact that I<br />

have departed from previous procedure, by defining the concept ‘freedom from aftereffect’<br />

not directly, but with the help of ‘n-freedom from after-effect’, thus making it<br />

accessible to the procedure of mathematical induction.)<br />

* 1 Only a sketch of the proof is here given. Readers not interested in the proof may turn<br />

to the last paragraph of the present section.<br />

3 Von Smoluchowski based his theory of the Brownian movement on after-effect<br />

sequences, i.e. on sequences of overlapping segments.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!