Hostname: page-component-745bb68f8f-lrblm Total loading time: 0 Render date: 2025-02-11T18:29:49.196Z Has data issue: false hasContentIssue false

Measure Theoretic Analysis of Consistency of the Principal Principle

Published online by Cambridge University Press:  01 January 2022

Rights & Permissions [Opens in a new window]

Abstract

Weak and strong consistency of the Abstract Principal Principle are defined in terms of classical probability measure spaces. It is proved that the Abstract Principal Principle is both weakly and strongly consistent. The Abstract Principal Principle is strengthened by adding a stability requirement to it. Weak and strong consistency of the resulting Stable Abstract Principal Principle are defined. It is shown that the Stable Abstract Principal Principle is weakly consistent. Strong consistency of the Stable Abstract Principal Principle remains an open question.

Type
The Principal Principle
Copyright
Copyright © The Philosophy of Science Association

1. The Claims

This article investigates the measure theoretic consistency of what we call the “Abstract Principal Principle.” The consistency expresses that the Abstract Principal Principle is in harmony with the basic structure of measure theoretic probability theory. This type of consistency is tacitly assumed in the literature on the Principal Principle, although we will see that the consistency in question is not trivial. The main philosophical significance of proving such a consistency is that without making sure that such a consistency obtains, the Abstract Principal Principle would be inconsistent as a general norm that guides forming subjective degrees of belief (credences): without such consistency a Bayesian agent would not always be able to adjust his degrees of belief to objective probabilities (e.g., chances) in a Bayesian manner, via Bayesian conditionalization.

After stating the Abstract Principal Principle informally in section 2, we define formally the weak and strong consistency of theAbstract Principal Principle (definitions 1 and 2) in section 3 and state weak and strong consistency of the Abstract Principal Principle (propositions 1 and 2). We then argue that it is very natural to strengthen the Abstract Principal Principle by requiring it to satisfy a stability property, which expresses that conditional degrees of belief in events already equal (in the spirit of the Abstract Principal Principle) to the objective probabilities of the events do not change as a result of conditionalizing them further on knowing the objective probabilities of other events (in particular, of events that are independent with respect to their objective probabilities). We call this amended principle the Stable Abstract Principal Principle (if stability is required only with respect to further conditionalizing on values of probabilities of independent events: Independence-Stable Principal Principle). This stability requirement leads to suitably modified versions of both the weak and strong consistency of the (Independence-)Stable Abstract Principal Principle (definitions 3 and 4). We will prove that the Stable Abstract Principal Principle is weakly consistent (proposition 3). This entails weak consistency of the Independence-Stable Abstract Principal Principle (proposition 4). The strong consistency of both the stable and the Independence-Stable Abstract Principal Principle remain open problems, however; we conjecture that both consistencies hold.Footnote 1

Until section 6, few references are given. Section 6 puts the results into context: here we discuss the relevance of strong consistency of the Stable Abstract Principal Principle from the perspective of Lewis’s Principal Principle and its “debugged” versions. The details of all the proofs are in the appendix.

2. The Abstract Principal Principle Informally

The Abstract Principal Principle regulates probabilities representing the subjective degrees of belief psubj(A) of an abstract Bayesian agent by stipulating that psubj(A) are related to the objective probabilities pobj(A) as

(1)psubj(A|pobj(A)=r)=pobj(A),

where pobj(A)=r denotes the proposition “the objective probability, pobj(A), of A is equal to r.”

The formulation (1) of the Abstract Principal Principle presupposes that both psubj and pobj are probability measures: additive maps defined on a σ-algebra taking values in [0,1]. Probability pobj is supposed to be defined on a σ-algebra Sobj of random events, and psubj is supposed to be a map with a domain of definition being a σ-algebra Ssubj.

It is crucial to realize that the σ-algebras Sobj and Ssubj cannot be unrelated: for the conditional probability psubj(A|pobj(A)=r) in equation (1) to be well defined via Bayes’s rule, the σ-algebra Ssubj must contain both the σ-algebra Sobj of random events and with every random event A also the proposition pobj(A)=r—otherwise the formula psubj(A|pobj(A)=r) cannot be interpreted as an expression of conditional probability specified by Bayes’s rule.

It is far from obvious, however, that, given any σ-algebra Sobj of random events with any probability measure pobj on Sobj, there exists a σ-algebra Ssubj meeting these algebraic requirements in such a way that a probability measure psubj satisfying the condition (1) also exists on Ssubj. If there exists a σ-algebra Sobj* of random events with a probability measure pobj* giving the objective probabilities of events for which there exists no σ-algebra Ssubj on which a probability function psubj satisfying (1) can be defined, then the Abstract Principal Principle would be inconsistent as a general norm: in this case the agent, being in the epistemic situation of facing the objective facts represented by (Sobj*,pobj*), cannot have degrees of belief satisfying the Abstract Principal Principle for fundamental structural reasons inherent in the basic structure of classical probability theory. We say that the Abstract Principal Principle is weakly consistent if it is not inconsistent in the sense described. (The adjective “weakly” will be explained shortly.)

Remark. One can construe the Principal Principle differently: taking it as a norm that regulates internal consistency of the agent.Footnote 2 Under this construal, the subjective degrees of belief should satisfy

(2)psubj(A|pobj(A)=r)=rforallr[0,1].

Here pobj(A)=r is the proposition that the agent believes that the objective probability of A is equal to r, and (2) requires that the agent’s subjective degrees of belief conditional on this belief should be equal to r—otherwise the agent is inconsistent in his thinking. The difference between (1) and (2) is that r on the right-hand side of (2) need not be equal to the real objective probability pobj(A). The difference between these two interpretations plays no role, however, from the perspective of the consistency problem we investigate here: because of the universal quantification over pobj in the consistency definitions and because of the universal quantification over r in (2), the two construals lead to the same consistency problem.

3. Weak and Strong Consistency of the Abstract Principal Principle

A classical probability measure space is denoted (X,S,p), where S is a σ-algebra of (some) subsets of X, and p is a probability measure on S. Given two σ-algebras S and S, the injective map h:SS is a σ-algebra embedding if it preserves all Boolean σ-operations. The probability space (X,S,p) is called an extension of (X,S,p) with respect to h if h is a σ-algebra embedding of S into S that preserves the probability measure p:

(3)p(h(A))=p(A)AS.

Definition 1. The Abstract Principal Principle is called weakly consistent if the following conditions hold: given any probability space (Xobj,Sobj,pobj), there exists a probability space (Xsubj,Ssubj,psubj) and a σ-algebra embedding h of Sobj into Ssubj such that

  • (i) For every ASobj there exists an ASsubj with the property

    (4)psubj(h(A)|A)=pobj(A).
  • (ii) If A,BSobj and A=B, then A=B.

Definition 1 says: given the “objective” probability space (Xobj,Sobj,pobj), the σ-algebra Ssubj in (Xsubj,Ssubj,psubj) contains the “copies” h(A) of all the random events ASobj and also an element A to be interpreted as representing the proposition “the objective probability, pobj(A), of A is equal to r” (this proposition we denoted by pobj(A)=r). If A=B, then A=B must hold because pobj(A)=r and pobj(B)=s are different propositions—this is expressed by ii in the definition. The main content of the Abstract Principal Principle is then expressed by condition (4), which states that the conditional degrees of beliefs psubj(h(A)|A) of an agent about random events h(A)ASobj are equal to the objective probabilities pobj(A), where the condition A is that the agent knows the values of the objective probabilities.

Proposition 1. The Abstract Principal Principle is weakly consistent.

The above proposition follows from proposition 3 stating the weak consistency of the Stable Abstract Principal Principle, which we state later.

Definition 2. The Abstract Principal Principle is defined to be strongly consistent if, in addition to conditions i–ii in definition 1, the following condition holds:

  • (iii) The probability space (Xsubj,Ssubj,psubj) is an extension of the probability space (Xobj,Sobj,psubj0) with respect to h; that is, we have

    (5)psubj(h(A))=psubj0(A)ASobj.

The content of this additional requirement is that the agent’s prior probability function psubj restricted to the random events can be equal to probability measure psubj0 on Sobj that can differ from the objective probabilities of the random events given by pobj.

Proposition 2. The Abstract Principal Principle is strongly consistent if pobj is absolutely continuous with respect to the agent’s prior degrees of beliefs psubj0.

4. The Stable Abstract Principal Principle

Once the agent has adjusted his subjective degree of belief by conditionalizing, psubj(h(A)|pobj(A)=r)=r, he may then learn the value of another objective probability, pobj(B)=s, in which case he must conditionalize again. What should be the result of this second conditionalization? Since the agent’s conditional degrees of belief psubj(h(A)|pobj(A)=r) in A are already correct (equal to the objective probabilities), it would be irrational to change his already correct degree of belief about A upon learning an additional truth, namely, the value of the objective probability pobj(B). So a rational agent’s conditional subjective degrees of belief should be stable in the sense of satisfying the following condition:

(6)psubj(h(A)|pobj(A)=r)=psubj(h(A)|pobj(A)=rpobj(B)=s)BSobj.

If A and B are independent with respect to their objective probabilities pobj(AB)=pobj(A)pobj(B), then, if the conditional subjective degrees of belief are stable in the sense of (6), then (assuming the Abstract Principal Principle) one has

(7)psubj(h(A)h(B)|pobj(A)=rpobj(B)=spobj(AB)=t)=psubj(h(AB)|pobj(A)=rpobj(B)=spobj(AB)=t)=psubj(h(AB)|pobj(AB)=t)=pobj(AB)=pobj(A)pobj(B)=psubj(h(A)|pobj(A)=r)psubj(h(B)|pobj(B)=s)=psubj(h(A)|pobj(A)=rpobj(B)=spobj(AB)=t)×psubj(h(B)|pobj(A)=rpobj(B)=spobj(AB)=t).

Equation (7) means that if the conditional subjective degrees of belief are stable, then, if A and B are objectively independent, they (their isomorphic images h(A),h(B)) are also subjectively independent—independent also with respect to the probability measure that represents conditional subjective degrees of belief, where the condition is that the agent knows the objective probabilities of all of A, B, and (AB). In this case, the conditional subjective degrees of belief properly reflect the objective independence relations of random events—they are independence faithful. Note that for the subjective degrees of belief to satisfy the independence-faithfulness condition expressed by equation (7), it is sufficient that stability (6) only holds for the restricted set of elements B in the σ-subalgebra SobjA,ind of Sobj generated by the elements in Sobj that are independent of A with respect to pobj.

This motivates us to amend the Abstract Principal Principle by requiring stability of the subjective probabilities, resulting in the “Stable Abstract Principal Principle”:

Stable Abstract Principal Principle. The subjective probabilities psubj(A) are related to the objective probabilities pobj(A) as required by equation (1); furthermore, the subjective probability function is stable in the sense that the following condition holds:

(8)psubj(h(A)|pobj(A)=r)=psubj(h(A)|pobj(A)=rpobj(B)=s)BSobj.

If the subjective probability function is only independence stable in the sense that (8) above holds for all BSobjA,ind, then the corresponding Stable Abstract Principal Principle is called the Independence-Stable Abstract Principal Principle.

5. Is the Stable Abstract Principal Principle Strongly Consistent?

Definition 3. The Stable Abstract Principal Principle is defined to be weakly consistent if it is weakly consistent in the sense of definition 1 and the subjective probability function psubj is stable: it satisfies condition (8). The Independence-Stable Abstract Principal Principle is defined to be weakly consistent if it is weakly consistent in the sense of definition 1 and the subjective probability function psubj is independence stable: it satisfies (8) for all BSobjA,ind.

Proposition 3. The Stable Abstract Principal Principle is weakly consistent.

The above proposition entails

Proposition 4. The Independence-Stable Abstract Principal Principle is weakly consistent.

Definition 4. The Stable Abstract Principal Principle is defined to be strongly consistent if it is strongly consistent in the sense of definition 2 and the subjective probability function psubj is stable. The Independence-Stable Abstract Principal Principle is strongly consistent if it is strongly consistent in the sense of definition 2 and the subjective probability function psubj satisfies (8) for all BSobjA,ind.

Problem. Is the (Independence-)Stable Abstract Principal Principle strongly consistent?

The problem of strong consistency of both the stable and the Independence-Stable Abstract Principal Principle remains open (see Bana Reference Bana2016).

6. Relation to Other Works

Lewis (Reference Lewis1986) introduced the term “Principal Principle” to refer to the principle linking subjective beliefs to chances. In the context of the Principal Principle, psubj(A) is called the “credence,” Crt(A), of the agent in event A at time t; pobj(A) is the chance, Cht(A), of the event A at time t; and the Principal Principle is the stipulation that credences and chances are related as

(9)Crt(A|Cht(A)=rE)=Cht(A)=r,

where E is any admissible evidence the agent has at time t in addition to knowing the value of the chance of A.

Proposition Cht(A)=r is clearly admissible evidence for (9), and, substituting E=Cht(A)=r into equation (9), we obtain

(10)Crt(A|Cht(A)=r)=Cht(A)=r,

which, at any given time t, is an instance of the Abstract Principal Principle if we make the identifications pobj(A)=Cht(A), psubj(A)=Crt(A). By proposition 2 we know that, for any time parameter t, relation (10) is consistent with probability as measure.

If, however, admissibility of evidence E is defined in such a way that propositions stating the values of chances of other events B at time t (i.e., propositions of the form Cht(B)=s) are admitted as E, then (9) together with (10) entails that we also should have

(11)Crt(A|Cht(A)=rCht(B)=s)=Cht(A)=r.

The relation (11) together with equation (10) is, at any given time t, an instance of the Stable Abstract Principal Principle if we make the identifications pobj(A)=Cht(A), psubj(A)=Crt(A), and pobj(B)=Cht(B). Thus, whether relations (11) and (10) can hold at all is exactly the question whether the Stable Abstract Principal Principle is strongly consistent. If one allows as evidence E in (11) only propositions stating the value of objective chances of events B that are objectively independent of A, then the question whether relations (11) and (10) can hold in general is exactly the question whether the Independence-Stable Abstract Principal Principle is strongly consistent. Since Lewis regarded admissible all propositions containing information that is “irrelevant” for the chance of A (Reference Lewis1986, 91), for him, admissible evidence should include propositions about values of chances of events that are independent of A with respect to the probability measure describing their chances. Under this interpretation of “irrelevant” information, the consistency of Lewis’s Principal Principle as a general norm needs proven consistency of the Independence-Stable Abstract Principal Principle. It should be emphasized that this kind of consistency has nothing to do with any metaphysics about chances or with the concept of natural law that one may have in the background of the Principal Principle; in particular, this inconsistency is different from the one related to “undermining” (see below). This consistency expresses a simple but fundamental compatibility of the Principal Principle with the basic structure of probability theory.

Lewis himself saw a consistency problem in his Principal Principle (he called it the “big bad bug”): if A is an event in the future of t that has a nonzero chance r>0 of happening at that later time but we have knowledge E about the future that entails that A will in fact not happen, EA, then substituting this E into (9) leads to contradiction if r>0. Such an A is called an “unactualized future that undermines present chances”—hence, the phrase “undermining” to refer to this situation. Since certain metaphysical arguments led Lewis to think that one is forced to admit such an evidence E, he tried to “debug” the Principal Principle (Lewis Reference Lewis1994); the same sort of debugging was proposed simultaneously by Hall (Reference Hall1994) and Thau (Reference Thau1994). Other debugging attempts have followed (Black Reference Black1998; Roberts Reference Roberts2001; Hall Reference Hall2004; Loewer Reference Loewer2004; Hoefer Reference Hoefer2007; Ismael Reference Ismael2008; Glynn Reference Glynn2010; Meacham Reference Meacham2010; Nissan-Rozen Reference Nissan-Rozen2013; Pettigrew Reference Pettigrew2013; Frigg and Hoefer Reference Frigg and Hoefer2015), and to date no consensus has emerged as to which of the debugged versions of the Principal Principle is tenable: Vranas (Reference Vranas2004) claims that there was no need for a debugging in the first place; Briggs (Reference Briggs2009) argues that none of the modified principles work; Pettigrew (Reference Pettigrew2012) provides a framework that allows one to choose the correct Principal Principle depending on one’s metaphysical concept of chance.

Papers aiming at “debugging” Lewis’s Principal Principle typically combine the following three moves a, b, or c:

  • a) Restricting the admissible evidence in (9) to a particular class AA of propositions in order to avoid “undermining” (Hoefer Reference Hoefer2007).

  • b) Modifying the Principal Pinciple by replacing Cht(A) on the right-hand side of (9) with a value F(A) given by a function F different from the objective chance function (new principle by Hall [Reference Hall1994]; general Principal Principle by Lewis [Reference Lewis1980] and by Roberts [Reference Roberts2001]).

  • c) Modifying the Principal Principle by replacing the conditioning proposition Cht(A)=rE on the left-hand side of (9) by a different conditioning proposition CA, which is a conjunction of some propositions from Sobj, AA, and propositions of the form pobj(B)=r (conditional principle and general principle by Vranas [Reference Vranas2004]; general recipe by Ismael [Reference Ismael2008]).

To establish a theory of chance along a debugging strategy characterized by a combination of a, b, and c, it is not enough to show that undermining is avoided: one has to prove that the debugged Principal Principle is consistent in the sense of definition 5 below, which is in the spirit of the notion of consistency investigated in this article:

Definition 5. We say that the “(AA,CA,F)-debugged” Principal Principle is strongly consistent if the following conditions hold: given any probability space (Xobj,Sobj,pobj) and another probability measure psubj0 on Sobj, there exists a probability space (Xsubj,Ssubj,psubj) and a σ-algebra embedding h of Sobj into Ssubj such that

  • i) For every ASobj, the set AA is in Ssubj, and for every ASobj, there exists a CASsubj with the property

    (12)psubj(h(A)|CA)=F(A).
  • ii) If A,BSobj and A=B, then CA=CB.

  • iii) The probability space (Xsubj,Ssubj,psubj) is an extension of the probability space (Xobj,Sobj,psubj0) with respect to h; that is, we have

    (13)psubj(h(A))=psubj0(A)ASobj.
  • iv) For all ASobj and for all BAA, we have

    (14)psubj(h(A)|CA)=psubj(h(A)|CAB).

We say that the “(AA,CA,F)-debugged” Principal Principle is weakly consistent if i, ii, and iv hold.

Taking specific CA and F, one obtains particular definitions expressing the consistency of specific debugged Principal Principles. For instance, stipulations

(15)CA=Bpobj(A|B)=r
(16)F(A)=pobj(A)

yield Vranas’s conditional principle (Reference Vranas2004, 370), whereas Hall’s new principle (Reference Hall1994, 511) can be obtained by

(17)CA=Ht,wTw
(18)F(A)=pobj(A|Tw),

where Ht,w is “the proposition that completely characterizes w’s history up to time t” and Tw is the “proposition that completely characterizes the laws at w” (w being a possible world; 506).

Proving consistency of the (AA,CA,F)-debugged Principal Principles is necessary for the respective debugged Principal Principles to be compatible with measure theoretic probability theory. To our best knowledge such consistency proofs have not been given: it seems that this type of consistency is tacitly assumed in the works analyzing the modified Principal Principles, although, as the propositions and their proofs presented in this article show, the truth of these types of consistency claims is far from obvious.

The problem of strong consistency of the Stable Abstract Principal Principle is also relevant from the perspective of existence of particular models of the axioms of higher-order probability theory (HOP) suggested by Gaifman (Reference Gaifman1988). If one regards HOP as an axiomatic theory, then the question arises whether models of the theory exist. Gaifman provides a few specific examples that are models of the axioms (208–10), but he does not raise the general issue of what kinds of models exist. What one would like to know is whether any objective probability theory can be made part of a HOP in such a way that the objective probabilities are related to the subjective ones in the manner required by the HOP axioms. Proving the existence of such HOPs entails that the Stable Abstract Principal Principle is strongly consistent.

Appendix

Proof of Strong Consistency of the Abstract Principal Principle (Proposition 2)

The statement follows from proposition A1 below if we make the following identifications:

(•)(Xobj,Sobj,pobj)(X,S,p^).
(•)(Xobj,Sobj,pSubj0)(X,S,p).
(A1)(Xsubj,Ssubj,psubj)(X,S,p).

Proposition A1. Let (X,S,p) be a probability space and let p^ be another probability measure on S such that p^ is absolutely continuous with respect to p. Then there exists an extension (X,S,p) of (X,S,p) with respect to the embedding h:SS having the following properties:

  • i) For all AS there is AS such that

    (A2)p(h(A)|A)=p^(A).
  • ii) AB implies AB

Proof. We distinguish two cases: the σ-algebra S is (i) finite and (ii) nonfinite.

When S is finite, the proof consist of two steps. In the first step we choose an arbitrary element AS and construct an extension (X*,S*,p*) of (X,S,p) with respect to an embedding h* in such a manner that in this extension this particular event A has a pair A=A* with the required properties. In step 2 we repeat this step n1 times, choosing each time another element from S until we exhaust S and obtain the extension (X,S,p) of (X,S,p).

Step 1. Take any AS. We wish to construct a space (X*,S*,p*) and a function h*:SS* such that

  • h*:(S,p)(S*,p*) is a measure-preserving, injective Boolean algebra homomorphism.

  • There is A*S* such that p*(h*(A)|A*)=p^(A).

Let (X1,S1) and (X2,S2) be two disjoint copies of (X,S), and fix the algebra isomorphisms h1:(X,S)(X1,S1) and h2:(X,S)(X2,S2). Put X*=X1X2 and define

(A3)S*={h1(A)h2(B):A,BS}.

It is a routine task to verify that S* is a Boolean algebra of subsets of X* with respect to the usual set-theoretical operations ∪, ∩, \ (below we also use the notation A to refer to the set-theoretical complement of an element A with respect to a set that is fixed by the context).

Define the map h*:SS* by

(A4)h*(A)=h1(A)h2(A) AS,

where h * is a homomorphism between S and S*. Let 0α1 be any number, and define p* on S* by

(A5)p*(h1(A)h2(B))αp(A)+(1α)p(B)A,BS.

For each AS we have then

(A6)p*(h*(A))=αp(A)+(1α)p(A)=p(A).

Consequently, h*:(S,p)(S*,p*) is a measure-preserving, injective Boolean algebra homomorphism.

For any fixed AS, define A* by

(A7)A*h1(A)h2(A).

Our aim now is to choose α in such a way that the following condition is true:

(A8)p*(h*(A)|A*)=p^(A).

Some basic algebra shows that

(A9)p*(h*(A)|A*)=αp(A)αp(A)+(1α)(1p(A)).

Thus, in order to satisfy (A6) we have to choose α to guarantee

(A10)αp(A)αp(A)+(1α)(1p(A))=p^(A).

By assumption, if p(A)=1 then p^(A)=1, and thus any α0 makes (A8) true. Similarly, if p(A)=0, then p^(A)=0, which means that any α1 will do. Also, if p^(A)=0, then α=0 will do. Therefore, we may assume 0<p(A)<1 and 0<p^(A)1. By reordering equation (A8) and using the notation p = p(A), r=p^(A), we obtain

(A11)α=rprrpr+prp.

To guarantee (A8) we only have to show that α in equation (A9) is between 0 and 1. Since 0<p<1 and 0<r1, we have rp<r and prp. This means that both the numerator and the denominator of the fraction in (A9) are negative, when α is positive. But, we have

(A12)0prprprrpr+prprprrpr+prp1.

Thus, 0α1 can always be chosen so that equation (A6) holds.

Step 2. We obtain (X,S,p) by iterating step 1. Let A1,,An be an enumeration of S. Applying step 1 with A1 in place of A, one finds a space (X1,S1,p1)=(X*,S*,p*), an event A1*S1, and an embedding h1

(A13)(X,S,p)h1(X1,S1,p1),

such that

p1(h1(A1)|A1*)=p^(A1).

Continuing in this way, we get elements (hi1h1(Ai))*Si and a chain of extensions

(X,S,p)h1(X1,S1,p1)h2(X2,S2,p2)h3hn(Xn,Sn,pn),

such that

pn(hnh2h1(Ai)|hnhi+1((hi1h1(Ai))*))=p^(Ai)

holds for all Ai. Therefore, we can complete the proof by letting

(X,S,p)=(Xn,Sn,pn)h=hnhn1h1Ai=hnhi+1((hi1h1(Ai))*).

One has to verify that the extension in step j does not destroy the result of the previous one. But this is a consequence of hj being an embedding that preserves the probability.

When the σ-algebra S is not finite, we take the extension (X,S,p) to be the product space

(X,S,p)([0,1],L,λ)=(X[0,1],SL,pλ),

where ([0,1],,λ) is the standard Lebesgue space over the unit interval and where denotes the special product of two probability spaces introduced in Gyenis and Rédei (Reference Gyenis and Rédei2011). The elements of S are certain [0,1]S functions, the embedding h:(X,S,p)(X,S,p) is via the constant function

h(A)(x)=A(x[0,1]).

The extension of p is

p(h(A))=01ph(A)dλ=01p(A)dλ=p(A).

Fix a real number α[0,1] and take any Lebesgue-measurable subset B[0,1] with measure λ(B)=α. Write A for the function A:[0,1]S:

A(x)={AifxBAotherwise.

Then AS, and one can verify easily that

p(h(A)|A)=αp(A)αp(A)+(1α)(1p(A)).

It follows that if we choose α such that

αp(A)αp(A)+(1α)(1p(A))=p^(A),

then we get

p(h(A)|A)=p^(A).

That we can choose α to satisfy (A12) is contained in the proof of the finite case.

QED

Proof of Weak Consistency of the Stable Abstract Principal Principle (Proposition 3)

The statement of weak consistency of the Stable Abstract Principal Principle follows from proposition A2 below if we make the following identifications:

(Xobj,Sobj,pobj)(X,S,p).
(Xsubj,Ssubj,psubj)(X,S,p).

Proposition A2. Let (X,S,p) be a probability space. Then there exists an extension (X,S,p) of (X,S,p) with respect to a σ-algebra homomorphism h:SS such that

  • i) For all AS, there is AS such that

    p(h(A)|A)=p(A).
  • ii) AB implies AB

  • iii)

    p(h(A)|A)=p(h(A)|AB)BS.

Proof. Let (X,S,p) be a probability space and Y0 be a set disjoint from S and having the same cardinality as the cardinality of S. We can think of Y0 as having elements yA labeled by elements AS. Consider the set

YY0{y}={yA:AS}{y},

where y is an auxiliary element different from every yA. Take the power set P(Y), and let q be any probability measure on P(Y) such that q({y})0. Then (Y,P(Y),q) is a probability space, and we can form the product space

(X,S,p)=(X×Y,SP(Y),p×q)

with p=(p×q) being the product measure on SP(Y). The map h:SS defined by h(A) ≐ A × Y is an injective, measure-preserving σ-algebra embedding. For each AS, put

AX×{yA,y}.

It is clear that ii in the proposition holds for A,B so defined. Utilizing that p is a product measure, one can verify by explicit calculation that both i and iii hold. QED

Footnotes

Research was supported in part by the National Research, Development and Innovation Office, Hungary, K 115593 and K 100715. Rédei thanks the Institute of Philosophy of the Hungarian Academy of Sciences, with which he was affiliated as honorary research fellow while this article was written.

1. Bana (Reference Bana2016) proved this conjecture.

2. We thank C. Hoefer and G. Bana for pointing this out in the discussion in the symposium.

References

Bana, G. 2016. “On the Formal Consistency of the Principal Principle.” Philosophy of Science, in this issue.CrossRefGoogle Scholar
Black, R. 1998. “Chance, Credence, and the Principal Principle.” British Journal for the Philosophy of Science 49:371–85.CrossRefGoogle Scholar
Briggs, R. 2009. “The Anatomy of the Big, Bad Bug.” Noûs 43:428–49.CrossRefGoogle Scholar
Frigg, R., and Hoefer, C.. 2015. “The Best Humean System for Statistical Mechanics.” Erkenntnis 80:551–74.CrossRefGoogle Scholar
Gaifman, H. 1988. “A Theory of Higher Order Probabilities.” In Causation, Chance, and Credence: Proceedings of the Irvine Conference on Probability and Causation, Vol. 1, ed. B. Skyrms and W. L. Harper, 191–219. University of Western Ontario Series in Philosophy of Science 41. Dordrecht: Kluwer.CrossRefGoogle Scholar
Glynn, L. 2010. “Deterministic Chance.” British Journal for the Philosophy of Science 61:5180.CrossRefGoogle Scholar
Gyenis, Z., and Rédei, M.. 2011. “Characterizing Common Cause Closed Probability Spaces.” Philosophy of Science 78:393409.CrossRefGoogle Scholar
Hall, N. 1994. “Correcting the Guide to Objective Chance.” Mind 103:505–18.CrossRefGoogle Scholar
Hall, N. 2004. “Two Mistakes about Credence and Chance.” Australasian Journal of Philosophy 82:93111.CrossRefGoogle Scholar
Hoefer, C. 2007. “The Third Way on Objective Probability: A Sceptic’s Guide to Objective Chance.” Mind 116:449596.CrossRefGoogle Scholar
Ismael, J. 2008. “Raid! Correcting the Big Bad Bug.” Noûs 42:292307.CrossRefGoogle Scholar
Lewis, D. 1980. “A Subjectivist’s Guide to Objective Chance.” In Studies in Inductive Logic and Probability, Vol. 2, ed. R. C. Jeffrey, 263–93. Berkeley: University of California Press. Repr. in Lewis 1986.CrossRefGoogle Scholar
Lewis, D. 1986. “A Subjectivist’s Guide to Objective Chance.” In Philosophical Papers, vol. 2, 83132. Oxford: Oxford University Press.Google Scholar
Lewis, D. 1994. “Humean Supervenience Debugged.” Mind 103:473–90.Google Scholar
Loewer, B. 2004. “David Lewis’s Humean Theory of Objective Chance.” Philosophy of Science 71:1115–25.CrossRefGoogle Scholar
Meacham, C. J. G. 2010. “Two Mistakes regarding the Principal Principle.” British Journal for the Philosophy of Science 61:407–31.CrossRefGoogle Scholar
Nissan-Rozen, I. 2013. “Jeffrey Conditionalization, the Principal Principle, the Desire as Belief Thesis and Adam’s Thesis.” British Journal for the Philosophy of Science 64:837–50.CrossRefGoogle Scholar
Pettigrew, R. 2012. “Accuracy, Chance and the Principal Principle.” Philosophical Review 121:241–75.CrossRefGoogle Scholar
Pettigrew, R. 2013. “A New Epistemic Utility Argument for the Principal Principle.” Episteme 10:1935.CrossRefGoogle Scholar
Roberts, J. T. 2001. “Undermining Undermined: Why Humean Supervenience Never Needed to Be Debugged.” Philosophy of Science 68 (Proceedings): S98S108.CrossRefGoogle Scholar
Thau, M. 1994. “Undermining and Admissibility.” Mind 103:491504.CrossRefGoogle Scholar
Vranas, P. B. M. 2004. “Have Your Cake and Eat It Too: The Old Principal Principle Reconciled with the New.” Philosophy and Phenomenological Research 64:368–82.Google Scholar