A uniqueness theorem for convex-ranged probabilities
A finitely additive probability measure P defined on a class of subsets of a space is convex-ranged if, for all P(A)>0 and all 0 < < 1, there exists a set, ∋ B⊆A, such that P(B)= P(A).<p>Our main result shows that, for any two probabilities P and Q, with P convex-ranged and Q countably additive, P=Q whenever there exists a set A∈ , with 0 < P(A) < 1, such that (P(A)=P(B)⟶Q(A)=Q(B)) for all B ∈ .