Oh, so that’s what you’re referring to. Well, if you look at the theorem statements, you’ll see that P=P_d is an axiom that is explicitly called out in the theorems where it’s assumed; it’s not implictly part of Axiom 0 like you asserted, nor is it more generally left implicit at all.
but the important part is that last infinite sum: this is where all infinitary convex combinations are asserted to exist. Whether that is assigned to “background setup” or “axioms” does not matter. It has to be present, to allow the construction of St. Petersburg gambles.
I really think that thinking in terms of infinitary convex combinations is the wrong way to go about this here. As I said above: You don’t get a St. Petersburg gamble by taking some fancy convex combination, you do it by just constructing the function. (Or, in Fishburn’s framework, you do it by just constructing the distribution; same effect.) I guess without P=P_d you do end up relying on closure properties in Fishburn’s framework, but Savage’s framework just doesn’t work that way at all; and Fishburn with P=P_d, well, that’s not a closure property. Rather what Savage’s setup, and P=P_d have in common, is that they’re, like, arbitrary-construction properties: If you can make a thing, you can compare it.
Oh, so that’s what you’re referring to. Well, if you look at the theorem statements, you’ll see that P=P_d is an axiom that is explicitly called out in the theorems where it’s assumed; it’s not implictly part of Axiom 0 like you asserted, nor is it more generally left implicit at all.
I really think that thinking in terms of infinitary convex combinations is the wrong way to go about this here. As I said above: You don’t get a St. Petersburg gamble by taking some fancy convex combination, you do it by just constructing the function. (Or, in Fishburn’s framework, you do it by just constructing the distribution; same effect.) I guess without P=P_d you do end up relying on closure properties in Fishburn’s framework, but Savage’s framework just doesn’t work that way at all; and Fishburn with P=P_d, well, that’s not a closure property. Rather what Savage’s setup, and P=P_d have in common, is that they’re, like, arbitrary-construction properties: If you can make a thing, you can compare it.