Finite Additivity, Complete Additivity, and the Comparative Principle

In the longstanding foundational debate whether to require that probability is count-ably additive, in addition to being finitely additive, those who resist the added condition raise two concerns that we take up in this paper. (1) Existence : Settings where no countably additive probability exists though finitely additive probabilities do. (2) Complete Additivity : Where reasons for countable additivity don’t stop there. Those reasons entail complete additivity—the (measurable) union of probability 0 sets has probability 0, regardless the cardinality of that union. Then probability distributions are discrete, not continuous. We use Easwaran’s (Easwaran, Thought 2:53–61, 2013) advocacy of the Comparative principle to illustrate these two concerns. Easwaran supports countable additivity, both for numerical probabilities and for finer, qualitative probabilities, by defending a condition he calls the Comparative principle [ C ]. For numerical probabilities, principle C contrasts pairs, P 1 and P 2 , defined over a common partition ∏ = {a i : i ∈ I} of measurable events. C requires that no P 1 may be pointwise dominated, i.e., no (finitely additive) probability P 2 exists such that for each i ∈ I, P 2 (a i ) > P 1 (a i ). By design, the cardinality of ∏ is not limited in C , which Easwaran asserts is important when arguing that the principle does not require more, or less, than that probability is countably additive. We agree that a numerical probability P satisfies principle C in all partitions just in case P is countably additive. However, we show that for numerical probabilities, by considering the size of the algebra of events to which probability is applied, principle C is subject to each of the above concerns, (1) and (2). Also, Easwaran considers principle C with non-numer-ical, qualitative probabilities, where a qualitative probability may be finer than an almost agreeing numerical probability P. A qualitative probability is regular if possible events are strictly more likely than impossible events. Easwaran motivates and illustrates regular qualitative probabilities using a continuous, almost agreeing quantitative probability that is uniform on the unit interval. We make explicit the conditions for applying principle C with qualitative probabilities and show that C restricts regular qualitative probabilities to those whose almost agreeing quantitative probabilities are completely additive. For instance, Easwaran’s motivating example of a regular qualitative probability is precluded by principle C


Introduction
One of the continuing debates in the foundations of mathematical probability is whether to require that mathematical probability is countably additive. 1That is, whether to require that the probability of a countably infinite union of pairwise disjoint events is the limit of the partial sums of the probabilities of the individual events.This is the conventional position, often taking Kolmogorov's (1956) work as the seminal theory-though Kolmogorov offers his equivalent version of countable additivity (his Axiom VI) merely as an "expedient" for working with infinite fields of events.
A rival theory, finite additivity, requires less: The probability of a finite union of pairwise disjoint events is the sum of the individual probabilities, with no further restrictions placed on the probability of an infinite union of events.(When a probability is finitely but not countably additive say it is merely finitely additive.)De Finetti's (1974) and Savage's (1954) theories offer well known examples of this position.Two reasons among others they give for not requiring countable additivity address existence and complete additivity of numerical probabilities.
Regarding existence, de Finetti (1974, p. 121) objects that countable additivity precludes a uniform probability distribution on a countable partition, but not on a finite partition and not on a continuum partition of the unit interval.By contrast, for each partition, regardless of its cardinality, there exists a finitely additivity probability that gives equal probability to each element of the partition.We extend this reasoning by investigating when, because of the algebraic structure of the space of possible events, imposing countable additivity rather than finite additivity precludes all probabilities.We refer to this as the issue of existence and argue it is a wider problem than is evidenced by de Finetti's example involving a uniform distribution on a denumerable partition.
Regarding complete additivity, a simple corollary to Ulam's (1930) theorem entails that, assuming the continuum is not greater than the least weakly inaccessible cardinal, each countably additive probability with sufficiently many measurable sets to create an Ulam-matrix is a discrete, completely additive probability. 2o such restriction obtains with finite additivity where, e.g., a continuous countably additive probability on Borel measurable sets may be extended to a finitely additive probability on the powerset of those Borel sets.We use this idea to debate countable additivity versus finite additivity by investigating when imposing countable additivity brings with it added restrictions, e.g., that the (measurable) union of a set of events, each set having probability 0, has probability 0. We refer to this as the issue of complete additivity.
In his 2013 paper, Why Countable Additivity?, K. Easwaran's presents two defenses of countable additivity.He writes, I give two arguments that probability functions must satisfy countable additivity, which don't generalize to support full additivity.(p. 53) and.
… my purpose in this article is to show that countable additivity is not merely an arbitrary stopping point on the way to full additivity.(p. 54) We contest these assertions.The first argument is a variant of de Finetti's Book where, contrary to de Finetti's account, infinitely many favorable bets may be placed in one round of the game.We consider this reason for countable additivity in Sect. 2. We argue that this variant of the Book argument entails complete additivity when applied to de Finetti's original theory of fair bets, or when applied to strictly favorable, called-off bets for a countably additive probability.
The second reason Easwaran offers for countable additivity is based on the Comparative principle [ C ], which is the central topic of this paper.
The Comparative principle (with italics added): If Π is a partition of the sure event for two probability functions P 1 and P 2 , then it is not the case that for every member a of Π, a is strictly more likely under P 2 than a is under P 1 .
Easwaran credits Pruss (2014) for motivation.Easwaran argues that the Comparative principle is equivalent to countable additivity for numerical probabilities defined on a field of sets, and does not require stronger additivity conditions.
In Sect.3, we explore the issues of existence and complete additivity for principle C when applied to numerical probabilities.Concerning existence, in Sect.3.2, we adapt a result of M. Amer (1985b, Theorem 5) to show that if A is an infinite, free Boolean algebra then no numerical probability on A satisfies principle C in all denu- merable partitions. 3However, there exist purely finitely additive probabilities-an extreme form of merely finitely additive probabilities-that are defined for A. An example of such a Boolean algebra A for which no numerical probability satisfies principle C is the Lindenbaum-Tarski algebra for sentential logic.Thus, the existence problem is wider than de Finetti's concern about a uniform probability distribution on a countable partition.
We investigate the issue of complete additivity for numerical probabilities in Sect.3.3.Consider an uncountable state space, κ =|Ω| ≥ ℵ 1 .When the field B of measurable events is sufficiently large to include the κ-many sets in an Ulam-matrix, then the only numerical probabilities that satisfy principle C are discrete (com- pletely additive) distributions.Principle C evaluates a probability P separately for each partition Π and, so, appears to place no demands on P beyond finite additivity in each uncountable partition.That appearance is deceptive.When the sets in the Ulam-matrix are all measurable, however, there are further combinatorial constraints on the additivity of a countably additive probability that arise from satisfying principle C , simultaneously, in infinitely many uncountable partitions.These constraints require that the countably additive probability P is completely additive.This restriction does not obtain for merely finitely additive probabilities defined on the same measurable space.
Easwaran also entertains non-numerical, qualitative versions of principle C .A qualitative probability relation between events may be finer than an almost agreeing numerical probability P.
Numerical probability P almost agrees with a qualitative relation of is strictly more likely than, provided that whenever P(E) > P(F), then E is strictly more likely than F, abbreviated E ⊳ F. When a numerical P almost agrees with a qualitative prob- ability, it may be that E ⊳ F even though P(E) = P(F).Easwaran motivates this case by introducing qualitative probabilities that distinguish between possible and impossible P-null events.Consider two events E and F that are P-null: P(E) = P(F) = 0, but where E is possible under P whereas F is not.Qualitative probability can capture this distinction, allowing E ⊳ F. We call such qualitative probabilities regular.
In Sect.4, we investigate principle C for regular qualitative probabilities.We show principle C requires that each almost agreeing quantitative probability P is a discrete (completely additive) distribution.Thus, the qualitative principle C is restrictive with respect to countable additivity.It imposes more restrictive additivity conditions on an almost agreeing quantitative probability than countable additivity does.Hence, the qualitative principle C is not equivalent to countable additivity for regular, qualitative probabilities.
In a recent paper, Stewart and Nielsen (2021) investigate the Comparative principle for numerical probabilities P and introduce a condition (here called SN-disintegrability) that they prove is satisfied by P in a (positive) denumerable partition Π if and only if P satisfies the Comparative principle in Π:.We show that, regardless the cardinality of the state space Ω, if a finitely additive probability P satisfies SN-disintegrability in the (finest) partition by states {ω} of Ω, then P is completely additive.Thus, SN-disintegrability is more restrictive than the Comparative principle when used in uncountable partitions.

Infinitary Books
Easwaran's first reason for countable additivity is a variant of de Finetti's Book argument that creates a sure loss for anyone betting with fair odds fixed by a merely finitely additive probability P. The strategy Easwaran uses to create the Book requires summing together the proceeds of denumerably many unconditional bets, each of which, on its own, is strictly favorable (i.e. each is strictly preferred to the alternative of abstaining from betting) according to the expectations fixed by P. If P is merely finitely additive, there exists a countably infinite set of favorable unconditional gambles whose infinite combination results in a (uniform) sure loss.That cannot happen if P is countably additive.
Next, we remind the reader of the consequences also of accepting the infinite combinations of fair bets, as Easwaran assumes it is appropriate to accept infinite combinations of favorable bets.(A bookie judges a bet fair if indifferent to holding either side of the wager, and indifferent to abstaining from that bet with consequence the status-quo.)De Finetti (1972, p. 91) objected to requiring infinite combinations of fair bets on the grounds that it "is circular, for only if we know that complete additivity holds can we think of extending the notion of combinations of fair bets to combinations of an infinite number of bets."4De Finetti's criterion of sure-loss from betting-what he calls "incoherence 1 "requires a uniform loss from a finite combination of fair bets, regardless the cardinality of the set of events for which the bookie has offered fair odds.As de Finetti established, a set of fair odds for a (possibly infinite) set of events are coherent 1 if and only if there exists a finitely additive probability P where, for each event E, the fair betting odds on E versus not-E are P(E) : [1-P(E)].
When de Finetti's criterion of coherence 1 is modified to require avoiding sure loss from combining infinitely many fair bets, the result is a stronger additivity condition even than countable additivity.For instance, the countably additive uniform (Lebesgue) measure on [0,1] assigns probability 0 to each point X = x, 0 ≤ x ≤ 1.The associated (real-valued) fair betting odds are extreme, 1 : 0-for each x, P(X ≠ x) = 1.So, a gambler makes $1 for sure from the bookie against these fair odds by combining the continuum of individual bets, each at a wager of $0 against $1, that X = x.Regardless which is the realized value X = x, the gambler loses all but one bet, for a combined loss of $0, payable to the bookie.The remaining bet is won, for a net gain of $1 from the bookie.Thus, the criterion of avoiding a (uniform) sure loss from combining infinitely many fair gambles is more restrictive than requiring countable additivity.That criterion requires fair odds agreeing with a completely additive probability: the union of events each having 0 probability must have 0 probability.
Easwaran acknowledges this result.Regarding the infinitary version of de Finetti's Book argument that requires the bookie to accept an infinite set A of fair gambles, he writes, However, it also entails countable additivity, and even full additivity.Nothing in this argument requires the set A to be countable.(2013, p. 55) We do not see why the bookie is obliged to accept an infinite set of strictly favorable gambles but not an infinite set of fair gambles.
A second concern with Easwaran's infinitary variant of the Book argument arises with infinite sets of strictly favorable conditional (called-off) bets.Let E be an event, associated with its An unconditional bet by the bookie on an event E, at odds of x: (1-x), with combined stake S A conditional (called-off) bet by the bookie on E, given an event F, at odds of x: (1-x), with combined stake S has If event F obtains in state , the conditional bet has payoffs to the two players as in an unconditional bet.But if F fails to obtain in state , the conditional bet is called-off with the status-quo outcome, no payment from betting, for each player.
De Finetti's Book argument extends to the bookie's (possibly infinite) set of fair unconditional and conditional odds.These are coherent 1 (i.e., there is no finite set whose combination is uniformly dominated by abstaining) if and only if there is a finitely additive probability P that matches the bookie's unconditional odds-for betting on event E, the bookie's odds are P(E) : 1-P(E); and matches the bookie's conditional odds-for betting on E, called-off if event F fails, the bookie's conditional odds are P(E|F) : 1-P(E|F).
There is a second reason de Finetti gave, specifically relating to conditional bets, to justify the restriction that the gambler is limited to finite sets of gambles for creating a (uniform) sure loss for the bookie.That reason stems from nonconglomerability of conditional probabilities.As we explain, next, that reason applies to show that unless P is completely additive, there is an infinite set of strictly favorable bets, including conditional bets, that result in a uniform sure loss to the bookie.
Whenever the bookie's probability is non-conglomerable, it is straightforward for a gambler to create a uniform sure loss for the bookie using infinitely many bets, each of which is favorable for the bookie.Here is the recipe.
So, each of the following is a favorable bet from the perspective of the bookie's fair odds: • one unconditional favorable bet on E c at odds of [1−(x + /4)] : (x + /4), with stake 1 unit; • |Π|-many conditional favorable bets on E, given h i , each at odds of (y− /4) : [1− (y− /4)], indicator function E( ) = 1 if event E obtains in state , and E( ) = 0 if event E does not obtain in state .
has payoff to the bookie of [E( ) − x] in state and payoff to the gambler of − [E( ) − x] in state .
payoff to the bookie of F( )( [E( ) − x]) in state and payoff to the gambler of − F( )( [E( ) − x]) in state .
Since Π is a partition, for each state ∈ Ω, all but one of these |Π|-many conditional bets is called off.Given , denote by h i the sole element of Π such that h i ( ) = 1.For all other elements of Π, h i ( ) = 0. Thus, regardless which state obtains, the bookie faces only two bets with non-zero payoffs, namely, the unconditional bet and one conditional bet.Their sum is a uniform, sure loss to the bookie.
That is, the bookie's net payoff from all these bets is a uniform loss, regardless whether E or E c obtains.Schervish et al. (2017) show that, if P is a countably additive probability that is not κ + -additive, then P is non-conglomerable in a (measurable) partition Π where |Π|= κ. 5 Thus, infinite combinations of strictly favorable unconditional and conditional bets, as assessed by a countably additive probability P that is not completely additive, lead to a uniform sure loss when those bets reflect the non-conglomerability of P. 6

The Comparative Principle for Numerical Probabilities
The second reason Easwaran offers for countable additivity is formulated in terms of the Comparative principle [ C ], which we repeat here for the reader's convenience.
The Comparative principle (with italics added): If Π is a partition of the sure event for two probability functions P 1 and P 2 , then it is not the case that for every member a of Π, a is strictly more likely under P 2 than a is under P 1 .
Easwaran intends the Comparative principle to apply more broadly than only to numerical probabilities, as he acknowledges that being "strictly more likely" may include comparisons with non-numerical probabilities, e.g., non-Archimedean 5 Their Theorem (2017, p. 291) uses Dubins' (1975) theory of conditional probability for controlling conditional probability given non-empty, P-null events.Dubins' theory of conditional probability is neutral in the debate over whether an unconditional finitely additive probability is countably additive.
As noted by an anonymous referee, Easwaran (2019) favors Kolmogorov's rival theory of regular conditional distributions, rcd's, over Dubin's theory.However, rcd's are not defined unless both unconditional and conditional probability is countably additive.Hence, in the debate whether probability might be merely finitely additive, the question here is begged by appeal to rcd's.Moreover, not every countably additive unconditional probability admits rcd's.Concerning existence of rcd's, see Seidenfeld et al. (2001) p. 1614. 6Stern and Kadane (2015) investigate conditions for combining more than finitely many bets to assess sure loss, and when such combinations may be used to justify countable additivity.Schervish et al. (2014) show that if one wants to extend de Finetti's criterion of coherence to include a denumerable number of unconditional decisions without requiring countable additivity, then apply "coherence 2 ": avoid sure loss from a denumerable set of unconditional, finitely additive forecasts with losses subject to strictly proper scoring rules.That result does not extend, however, to coherence 2 for denumerably many conditional forecasts when probability is non-conglomerable.
qualitative probabilities.Following Easwaran's notation, let the expression (P 1 , E 1 ) ≻ (P 2, E 2 ) mean that event E 1 is strictly more likely under probability P 1 than is event E 2 under probability P 2 .
For numerical probabilities P 1 and P 2 , Easwaran requires that.
For the converse he considers two cases: • In what he calls an unambiguous case (p.60), if (P 1 , E 1 ) ≻ (P 2, E 2 ) then P 1 (E 1 ) > P 2 (E 2 ).We consider this case, below.• Otherwise, it may be that being strictly more likely is not defined by numerical probabilities alone; so that, in particular, it is allowed that P 1 (E 1 ) = P 2 (E 2 ) but (P 1 , E 1 ) ≻ (P 2, E 2 ).We consider this case in Sect. 4.

Structural Assumptions for Numerical Probabilities
First, we investigate the unambiguous case of the Comparative principle for numerical probabilities in the setting of an atomic, measurable space < Ω, Ɓ > , where set theoretic union and intersection are the infinitary Boolean operations in Ɓ.We adopt the formal theory of probability for a (finitely additive) measure space, < Ω, Ɓ, P > , where P is a finitely additive probability defined on a field of sets Ɓ, with the sure-event Ω equal to a set of disjoint and mutually exhaustive possibilities, called "states": Ω = { i : i ∈ I}. 7 A set B is said to be measurable if B ∈ Ɓ, i.e., if B is in the domain of the probability P. In this sub-section we assume that each state { } is measurable.That is, first, we deal with atomic fields, where the states are the atoms of the algebra Ɓ.We relax these assumptions in Sect.3.2 where we investigate principle C for atomless, countable Boolean algebras whose infinitary operations need not be set theoretic union and intersection.
Definition A numerical probability P is finitely additive if it satisfies these three axioms: (i) For each measurable set B, 0 ≤ P(B) ≤ 1.
(iii) If E and F are disjoint measurable sets, with G = E∪ F, then P(G) = P(E) + P(F).
For probability P to be countably additive is to require also either of the following two axioms, which, given (i)-(iii), are equivalent provided that Ɓ is a field of sets. 87 It is commonplace to assume that B is a -field of sets, closed under countable unions and intersections.In order to discuss principle C broadly, we do not make this assumption.Also, we use capital letters 'I' and 'J' as index sets. 8See Sect. 2 of Billingsley (1995).
(iv-a) Let {A i : i = 1, . . .} be a denumerable sequence of measurable, pairwise disjoint sets, and assume that their union, A, is measurable.That is, assume A i ∩ A j = ∅ if i ≠ j, and A = ∪ i A i ∈ Ɓ. P is countably additive 1 provided that P(A) = ∑ i P(A i ) for each such sequence.(iv-b) Let {B i : i = 1, . . .} be a decreasing (or, respectively increasing) denumerable sequence of measurable sets, and assume that their limit, B, is measurable.That is, B i ⊇ B i+1, and assume B = ∩ i B i (or respectively B i ⊆ B i+1 and B = ∪ i B i ) is measurable.P is countably additive 2 provided that P(B) = lim i P(B i ) for each such sequence.When P is finitely but not countably additive, it is merely finitely additive.
Definition Π = {a j : j ∈ J} is a measurable partition of Ω provided that: each element a j of Π is measurable, the elements of Π are pairwise disjoint, and their union is Ω.
A numerical probability P 1 satisfies the unambiguous Comparative principle in partition Π = {a j : j ∈ J} when there is no finitely additive probability P 2 for Π where P 2 (a j ) > P 1 (a j ) for each j ∈ J. (3.1).
A numerical probability P 1 satisfies the unambiguous Comparative principle if it does so for each measurable partition Π in the measurable space < Ω, Ɓ > .(3.2).
Theorem.(Easwaran).With respect to the a finitely additive numerical measure space, the unambiguous Comparative principle (3.2) is equivalent to countable additivity 1 .
Easwaran writes, In order to unambiguously apply the Comparative Principle, we would need a case where P 1 (a) < P 2 (a) for all a in A. But as mentioned above, if A is uncountable, then at least P 2 will violate finite additivity.Thus, the only finitely additive, non-negative, normalized functions that are ruled out as probabilities by the Comparative Principle are the ones that violate countable additivity.This principle does nothing to rule out violations of full additivity.So we have a second argument for countable additivity that fails to extend to full additivity.Countable additivity is not an arbitrary stopping point.(p.60) As Easwaran points out, it is evident that each finitely additive probability satisfies the unambiguous Comparative principle in each finite partition (by axiom (iii)), and in each uncountable partition-as no finitely additive probability P 2 is positive for uncountably many disjoint events.He emphasizes the point that the unambiguous Comparative principle applies in each (measurable) partition, regardless the cardinality of that partition.And, he asserts that it does not entail complete additivity (he calls it "full additivity") in an uncountable partition.This reasoning does not address the two issues of existence and complete additivity: • In Sect.3.2, we adapt Amer's (1985b) Theorem 5 about infinite, free Boolean algebras to show that only purely finitely additive probabilities exist on, e.g., the Lindenbaum-Tarski algebra of (equivalence classes of) sentential propositions.
There are no probabilities for such Boolean algebras that satisfy principle C .
Existence is a problem for countably additive probabilities, but not for merely finitely additive probabilities.• In Sect.3.3 we adapt Ulam's (1930) Theorem about measurable cardinals to show that Easwaran's reasoning about principle C neglects the combinatorics of infinitely many uncountable partitions.To impose countable additivity when the sets in an Ulam-matrix are measurable is to require complete additivity.Finitely additive probabilities bear no such restriction.

Numerical
Probabilities for Infinite Free Boolean Algebras, Principle C , and Existence

Amer Reports the Following Result
Theorem.(Amer, 1985b): Let A be an infinite, free Boolean algebra.There are no countably additive probabilities on A.
Example: The Lindenbaum-Tarski algebra L for sentential logic is a countable, free Boolean algebra with the denumerable set of sentence letters serving as a set of free generators.According to Amer's Theorem, L supports no countably additive probability.But L supports uncountably many merely finitely additive probabilities. 9 Amer's proof uses countable additivity 2 (iv-b) applied with a monotone increasing, denumerably infinite sequence of A-measurable events whose infinitary join exists in A. But this method is not suited for applying principle C , which contrasts finitely additive probabilities in denumerable partitions.We adapt Amer's reasoning using an algebraic version of (iv-a), countable additivity 1 .Proposition 3.1, below, asserts that no numerical probability defined on A satisfies principle C.
Also, our adaptation of Amer's method allows a modest improvement to the conclusion of his theorem by showing that each finitely additive probability defined on an infinite, free Boolean algebra is not only merely finitely additive, but is purely finitely additive.A purely finitely additive probability instantiates an extreme of failure of countable additivity, as we explain next.
Yoshida and Hewitt (1952) establish a decomposition for each finitely additive probability P, defined on a field of events, that facilitates a characterization of the extent to which P is not countably additive.
Definition A probability is purely finitely additive if the only non-negative countably additive set function Q that satisfies P ≥ Q ≥ 0 is Q ≡ 0. 9 There are 2 ℵ 0 different, 2-valued, semantic models for L -where each model provides a truth value for each sentence letter in L Each semantic model induces a different 2-valued merely finitely additive probability P on L. (See Theorem 5 of Amer (1985a).)Hence, there are uncountably many merely finitely additive probabilities on L.
These 2-valued merely finitely additive probabilities are strongly finitely additive, as well.That is, for each such P there exists an L-measurable, denumerable partition Π = {a 1 , a 2 , …} where Σ i P(a i ) = 0.As explained in Appendix A, necessary for this result is that Π forms a partition in L because L is not a σ-algebra.
The following equivalent condition of a purely finitely additive probability is helpful in proving Proposition 3.1.
Theorem (Schervish et al, 1984, p. 208): A probability P defined on a field F is purely finitely additive if and only if, for each > 0 there exists a denumerable partition Π = {h 1 , h 2 , …} such that Σ i P(h i ) < .⋄Theorem (Yoshida & Hewitt, 1952) For each finitely additive probability P defined on a field of events F, there exist P C (a countably additive probability defined on F), P D (a purely finitely additive probability defined on F), and two real numbers α P ≥ 0, P ≥ 0 (with P + P = 1), where P = P P C + P P D .The numbers P and P are unique.If P ≠ 0, P C is unique.Likewise, if P ≠ 0, P D is unique.⋄Thus, the magnitude of P in the Yoshida and Hewitt decomposition provides a characterization of the extent to which P is not countably additive.Also, it provides a convenient index of the extent to which a finitely additive probability P 1 fails principle C , as we explain, next.
Let P i be the class of finitely additive probabilities P 2 for which Π i is a measurable partition and where, for each j = 1, 2, …, p 2ij ≥ p 1ij .
Define the extent to which P 1 fails principle C in partition Π i as Define the extent to which P 1 fails principle C as: Lemma 3.1 C(P 1 ) = P 1 .
Proof Immediate from the fact that if a P 1 = x, then for each Π I , Σ j p 1ij ≥ x, and for each ε > 0, there exists a denumerable partition Π I where Σ j p 1ij < x + ε.And then.supremum So, C(P 1 ) = 1 if and only if P 1 is purely finitely additive.
Proposition 3.1 Let A be an infinite, free Boolean algebra.Each finitely additive probability P on A fails principle C maximally, C(P) = 1.That is, each finitely addi- tive probability P on A is purely finitely additive.
Proof See Appendix A.
Thus, principle C makes it impossible to apply numerical probabilities on such a Boolean algebra A. But, there are uncountably many purely finitely additive probabilities on A.
Proposition 3.2 For Ɓ a sufficiently large subset of the powerset of Ω to contain an Ulam-matrix, if P is countably additive it is a discrete (completely additive) probability, i.e., where, for some countable set C ∈ Ɓ, P(C) = 1.⋄Proof.Argue indirectly.Let κ =|Ω| be the least cardinal that carries a countably additive probability P where, for each ω ∈ Ω, P({ }) = 0. Then P is κ -additive. 11Suppose there exists a Ɓ-measurable, co-countable subset S ⊆ Ω, where |Ω-S|≤ ℵ 0 , P(S) > 0, and for each ω ∈ S, P({ }) = 0. So, |S|= κ.Build an Ulam-matrix M of κ-many rows and λ-many columns, with entries B αβ (α < κ, β < λ) that are Ɓ-measurable subsets of S.Under these circumstances, for each row α, P(S-∪ β B αβ ) = 0.And then, as there are only λ-many columns, for at least one β in that row α, P(B αβ ) > 0. By the pigeon hole principle, for at least one column β, for κ-many values of α, P(B αβ ) > 0. But, as these are pairwise disjoint sets, some finite partial sums of these probabilities exceeds 1, yielding a measurable set with probability greater than 1.Hence, if < Ω, Ɓ, P > is a finitely additive measure space where |Ω |is an infinite successor cardinal, where P satisfies the Comparative principle, and where Ɓ is large enough to include an Ulam-matrix of measurable sets, then P is completely additive.Easwaran asserts that principle C places no additional additivity constraints on P apart from countable additivity.That reasoning fails to account for the combinatorics of satisfying C in infinitely many uncountable partitions simultaneously.Then, for an algebra, Ɓ, that contains an Ulam-matrix, being countably additive entails being completely additive.

On Non-Numerical Interpretations of "Strictly More Likely."
On pp.59-60 of his ( 2013) article, Easwaran suggests that the Comparative principle does not require more (or less) than countable additivity even when outside the unambiguous case.That is, Easwaran entertains situations where the 4-term, qualitative relation: is finer than the comparison given merely by the quantitative probabilities, P 1 (E 1 ) and P 2 (E 2 ), for these events.That is, he allows: As we understand his text, Easwaran applies the Comparative principle with this 4-term qualitative relation in all partitions.But what conditions apply to the relation, ≻, as it is used in the Comparative principle, to contrast (P 1 , E 1 ) with (P 2 , E 2 ) when outside the "unambiguous" case?
To make progress answering this question, consider restricted instances of the relation ≻, where the same numerical probability appears in both terms, i.e., restrict comparisons to pairs involving a common numerical probability, P i .Specifically, as a condition of adequacy relating numerical probabilities and qualitative probability, Easwaran requires that In the literature on qualitative probability, this is the requirement that numerical probability P i almost agrees with ≻ restricted to such pairs. 12or convenience, next we introduce three abbreviations associated with the qualitative relation ≻ restricted to comparisons that involve a common qualitative probability: In order to satisfy Easwaran's sufficient condition (4.1), assume that a qualitative probability relation ⊳ admits an almost agreeing numerical probability, P(⋅).Also, assume that ⊳ satisfies de Finetti's four axioms for a finitely additive qualitative probability: Event E 1 subject to numerical probability P 1 is strictly more likely than event E 2 subject to numerical probability P 2 Axiom Qual 1 : ⊳ is a weak order: ⊳ is transitive and all pairs of events are comparable.
When 0 < P i (E) < 1, Qual 2 obtains from the requirement that P almost agrees with ≻ i .Thus, Qual 2 adds the conditions that no event is qualitatively more probable than the sure event, and no event is qualitatively less probable than the impossible event.
In the context of an almost agreeing numerical probability, Qual 3 is redundant as, for each numerical probability P, 1 = P(Ω) > P(∅) = 0. Axiom Qual 4 : Qual 4 is the qualitative version of finite additivity.
A qualitative probability ⊳ is regular if, whenever E ≠ ∅, then E ⊳ ∅.Of course, though a qualitative probability ⊳ is regular, each of its almost agree- ing numerical probabilities P may fail to be regular, as when with an uncountable Ω, for each {ω}⊳∅. 13 What constrains the qualitative comparison ≽ between the pair (P 1 ,E 1 ) and (P 2 ,E 2 )?We propose using the two qualitative probabilities, ⊳ 1 and ⊳ 2 as follows: ≽ Axiom 1: The comparison ≽ is a weak order, with derived asymmetric relation ≻, and derived symmetric relation ≈.
The following explains why we do not use axiom Qual 5 for Easwaran's program.Let < Ω,B,P > be a non-regular, countably additive measure space where there exists a nested sequence of P-non-null measurable events whose intersection is empty: P(E i ) > 0 (i = 1, 2, …), E i ⊇ E i+1 and ∩ i E i = ∅, and where also there exists a B-measurable non-empty P-null event F: F ≠ ∅ but P(F) = 0.
Let⊳ be a regular qualitative probability for which P is an almost agreeing probability.Then ⊳ is not countably additive as it fails axiom Qual 5 .
Then there is a model of ≽ where, for each pair E 1 , E 2 of A-measurable events, and for i,j = 1, 2, ≽ Axiom 3 requires that when two qualitative probabilities are identical on an algebra, it is consistent that a comparison of "is strictly more likely" between events from that algebra depends solely on the events being compared, and does not depend on which qualitative probability is matched with the events in the comparison.
Next we investigate principle C when the relation ≽ is not unambiguous and quali- tative probabilities are regular.In what follows, we assume each qualitative probabilitiy ⊳ satisfies the four de Finetti axioms, and we assume that ≽ comparisons sat- isfy the three axioms, above.
An important illustration that Easwaran offers for demonstrating being outside the unambiguous case is where P 1 (E) = P 2 (E) = 0, but where E is possible under P 1 while E is impossible under P 2 .For instance, let the state space Ω = {H, T, E}, corresponding to the outcome of a flip of a coin landing exclusively and exhaustively, either H: heads-up, T: tails-up, or E: on-edge.Let P 1 be a numerical (non-regular) fair-coin probability: P 1 (H) = P 1 (T) = 1/2, and so P 1 (E) = 0, but where E is a possible outcome.Let P 2 be the regular numerical fair-coin probability P 2 (H) = P 2 (T) = 1/2, so P 2 (E) = 0, but where E is not a possible outcome.Specifically, let P 2 (⋅) = P 1 (⋅|not-E).Then, in order to respect the qualitative difference between possible and impossible probability 0 events, P 1 (E) = P 2 (E) = 0, but (P 1 ,E) ≻ (P 2 ,E).Of course, then principle C requires that at least one of, (P 2 ,H) ≽ (P 1 ,H), or (P 2 ,T) ≽ (P 1 ,T) if P 2 is not domi- nated by P 1 .
Below, Proposition 4.1 establishes that, if a (finitely additive) regular qualitative probability ⊳ satisfies principle C , that is, if there is no partition where another qualita- tive probability pointwise ≻-dominates ⊳ , then if a countably additive numerical prob- ability P almost agrees with ⊳ , P is a discrete distribution.Thus, outside the unambig- uous case, principle C restricts qualitative probabilities to those with only completely additive almost agreeing numerical probabilities.
Proof: Argue indirectly.With 0 ≤ z < 1, let P = zP d + (1-z)P c , where P d is a discrete probability, and P c is a continuous probability.Let D = { : P d ( ) > 0}.So, as |D| ≤ ℵ 0 , then P c (D) = 0 and P c (D c ) = 1.Let X be a real-valued random variable defined on states in D c .And let y = CDF c (X = x), the Cumulative Distribution Function associated with P c , defined for states in D c .Then y is uniform U[0, 1] under the continuous conditional probability P c ( | D c ). Apply the reasoning in the Heuristic Example, as follows.Let P 0 be defined on {H,T} × D c , where P 0 is the product measure of the fair coin probability on {H,T} and the continuous probability P c ( | D c ). Define P 1 (⋅) = P 0 (⋅|H) and P 2 (⋅) = P 0 (⋅|T).Define the partitions ∏ 1 and ∏ 2 as in the Heuristic Example.Then each of P 1 and P 2 is inconsistent with principle C. Thus, in order to satisfy the Comparative principle C with a regular, qualitative probability, ⊳ , each of its almost agreeing numerical probabilities P is completely additive.This establishes that, subject to the (de Finetti) four axioms for a qualitative probability, and the three axioms on ≽ for the qualitative comparisons, principle C imposes additional restrictions, beyond what countable additivity requires, outside the unambiguous case. 14strict strengthening of conglomerability and equivalent to disintegrability."(p.501) 15   Stewart and Nielsen propose a condition-here we call it SN-disintegrability, 16(5.1).which is the subject of their result, discussed below.
A Proof: Let P be a finitely additive probability on a measurable space {Ω, Ɓ}.Let ∏ = {a i : i ∈ I} be a (measurable) partition.Assume that (5.1) obtains: ∀B ∈ Ɓ P(B) = ∑ i∈I P(B|a i )P(a i ), whenever the conditional probabilities P(B|a i ) are well defined for each i ∈ I.
For the special case, B = Ω, P(Ω|a i ) = 1 for each i ∈ I.And this equality obtains in every theory of conditional probability that we know: Dubins (1975), Kolmogorov (1956), andRenyi (1970) Thus, considering the comparison with the (unambiguous) Comparative principle C in uncountable partitions-as is necessary in order to meet Easwaran's require- ment that C does not entail complete additivity in uncountable partitions-SN-disin- tegrability is not equivalent to principle C.

Summary of the Principal Observations Regarding Principle C.
In his (2013), Easwaran offers the unambiguous Comparative principle C as a basis for countable additivity of numerical probability.The two are equivalent in finitely additive measure spaces.However, there are other challenges that arise when countable additivity is pitted against finite additivity.
When the set of measurable events is a countable, free Boolean algebra (e.g. the Lindenbaum-Tarski algebra for sentential logic), only purely finitely additive probabilities exist: no numerical probability satisfies the Comparative principle.And when the state space is uncountable, if the algebra of measurable events is sufficiently large to include the sets in an Ulam-matrix, only discrete (completely additive) probabilities satisfy the Comparative principle.For then the combinatorics of satisfying the Comparative principle simultaneously in infinitely many uncountable partitions brings with it demands for stronger additivity.By contrast, (merely) finitely additive probabilities are free from either of these consequences.
The Comparative principle for non-numerical probabilities is not fully defined in Easwaran's (2013) article.The version of C that we offer for regular quali- tative probabilities, outside the unambiguous case (based on Easwaran's example), precludes countably additive continuous almost agreeing numerical probabilities.However, if regular qualitative probabilities are not required to satisfy C , then a countably additive almost agreeing quantitative probability need not be completely additive.Thus, contrary to Easwaran's condition of adequacy for justifying countable additivity, principle C requires stronger additivity outside the unambiguous case.

Appendix A.
Proposition 3.1: Let A be an infinite, free Boolean algebra.Each finitely additive probability P on A fails principle C maximally, C(P) = 1.That is, each finitely additive probability P on A is purely finitely additive.
We establish the result for a subalgebra Aκ ⊆ A generated by κ = { 1 , …}, a denumerable subset of generators of A. Without loss of generality, we use the Lindenbaum-Tarksi algebra L of sentential logic for this subalgebra.That is, up to isomorphism, L is the free Boolean algebra with countably many generators.Next, we summarize relevant details of L.
Let L be the first order sentential language with denumerably many proposition letters, p, which are the atomic propositions of L, P = {p 1 , p 2 , …}.For convenience, let '&', 'ν' and '¬' be the sentential operators in L, whose semantics are respectively the usual truth functions 'and', 'or', and 'not'.Let WFF be the denumerable set of well formed formulas in L, which is the syntactic, recursive closure of the atomic propositions under the sentential operators.
Let ≡ denote (semantic) logical equivalence, an equivalence relation between pairs of well formed formulas in L.
For s ∈ WFF, let s be the equivalence class of its logically equivalent well formed formulas.
L is the Lindenbaum-Tarski algebra over WFF/≡.L is a countable Boolean algebra, where, for s, t ∈ WFF. the algebraic join s ∨ t = s t, the algebraic meet s ∧ t = −s&t the algebraic complement s′ = ¬s.
Define the (transitive) partial order ≺ on L by s ≺ t if s (semantically) entails t.
Note that ≺ is a strict partial order; that is, if s ≺ t and t ≺ s then s = t.Denote by s ≺ t the asymmetric, transitive relation, s ≺ t and s ≠ t.T is the maximal element and ⊥ is the minimal element of this strict partial order.
That is, ⊥ ≺ T and if ⊥ ≠ s ≠ T then ⊥ ≺ s ≺ T.
When neither s ≺ t nor t ≺ s , say that s and t are independent.
Observe that L is atomless: That is, consider s ∈ WFF where s ≠ ⊥.Let t = s & p, where 'p' does not appear among the atomic propositions in s.Then ⊥ ≺ t ≺ s .So s is not an atom of L.
For convenience, denote = equivalence class of tautologies, and ⊥ = equivalence class of contradictions.
L is (up to isomorphism) the countable, atomless Boolean algebra.Because L is a countable Boolean algebra, it is not a Boolean -algebra.(See Sikorski [1969, p. 66, (E)].)So we have to be careful about the existence of infinitary joins and infinitary meets within L. That is, an infinitary join is the least upper bound under ≺ and the infinitary meet is the greatest lower bound under≺ of a (countable) set of elements of the Boolean algebra.These need not exist in L.
For S = { s i ∈L: i = 1, 2, …}, say that t ∈L is the infinitary join of S , written t = VS, provided that, for each s i ∈S , s i ≺ t , and. if also there exists t ′ ∈ L where, for each s i ∈S , s i ≺ t ′ , then t≺ t'.
Definition: P is countably additive 1 on L provided that, whenever S = { s i ∈L: i = 1, 2, …} is a denumerable partition, i.e., satisfying.(i) s i ∧ s j = ⊥ whenever i ≠ j, and (ii) where the infinitary join t = ⋁ S exists, then P(t) = Σ i P(s i ).

Proof of Proposition 3.1
Let P be a finitely additive probability on L. Let > 0. We show there exists a denumerable partition Ψ = { 1 , 2 , …} in L with Σ i P( i ) < .
Let κ = { 1 , …} be the set of the sentential generators of L: the set of (equivalence classes of the) atomic propositions.
That is, b j = { k(j−1)j 2 +1 , …, k(j+1)j  Because the generators are independent, the Boolean elements j m and k n from different blocks b j and b k are also independent, i.e., neither  j m ≼  k n nor k n ≼ j m .As P is finitely additive, then for each block b j (j = 1, 2, …), there exists (at least) one Boolean element j m with P( j m ) ≤ 1/2 j×k .For ease of notation, denote this ele- ment of A Γ as j .

Appendix B
We distinguish "disintegrability" and "S-N disintegrability" as the two are not equivalent, even in a positive, denumerable partition.We follow the approach in Dunford and Schwartz (1966, p. 112) for finitely additive integrals of bounded functions.Let < Ω, Ɓ, P > be a finitely additive measure space.Definition.A probability P is disintegrable in a measurable partition Π = {a j : j ∈ J} provided that Regardless the cardinality of Ω, each finitely additive probability is disintegrable in the finest partition of its measure space, the partition ∏ Ω by the elements of Ω.Let |Ω|= ℵ 0 and let P be merely finitely additive with P(ω i ) > 0, i = 1, … .So ∏ Ω is a positive, denumerable partition under P. P is disintegrable in ∏ Ω .But since P is not countably additive, P is not S-N disintegrable in ∏ Ω , nor does P satisfy principle C 1 = { 1 , …, k }, b 2 = { k+1 , …, 3k }, b 3 = { 3k+1 , …, 6k }, etc.The set of blocks partitions the set of generators in κ.Each block, b j , generates 2 j×k many Boolean elements j m (m = 1, …, 2 j×k ) of Aκ of the form where i = i or i = i ′.Note that, since the algebra Aκ is free, each j m satisfies: ⊥ ≺  j m ≺ T. Trivially, for each block b j , if Equally evident, for each block b j , T = ⋁ { j m : m = 1, …, 2 j×k }.
SN-disintegrability in the finest partition by states, then P is completely additive.Since the (unambiguous) Comparative principle does not mandate more than countable additivity, the equivalence between SN-disintegrability and the Comparative principle is limited to countable partitions.That is, as noted previously, each finitely additive probability P satisfies the (unambiguous) Comparative principle in each uncountable partition.But only a discrete, countably additive probability satisfies SN-disintegrability in an uncountable partition.Here are the relevant details.