Talk:Probability axioms

message: Would it be possibvle to rejig this in terms of Borel sets?  Just a more elegant way of expressing it IMHO; here it's as if the defintion of sigma algebra comes out of probability theory.  It might be moe confusing for the general reader however.
----
It's more confusing for me, anyway. The universe S is not necessarily a topological space, so what is a Borel set in this context?  Fool 23:42 Mar 11, 2003 (UTC)
----
"Fool" is right.  Borel sets are by definition members of the sigma-algebra generated by a topology.  But there need not be any topology on a probability space.  Or, at least, no topology is explicitly contemplated by the conventional Kolmogorovian definition.
I have moved this article to "Probability axioms" (plural!).  Usually it is better to use the singular than the plural in the title of an article; "zebra" is better than "zebras".  But in the case of this article, it is colossally silly.  This is not about axioms as individual things; it is about systems of axioms, or, at least, about one particular system of axioms --- the one formulated by Kolmogorov. Michael Hardy 00:41 Mar 12, 2003 (UTC)
----
I think Cox's axioms should be stated here in addition to Kolmogorov's; if I'm not mistaken, the Kolmogorov axioms are derivable as theorems from Cox's -- which, again IINM, was Cox's point, that the accepted laws of probability are derivable from more basic assumptions. The one bit that doesn't carry over, if we start from Cox's axioms, is countable additivity -- IINM finite additivity derives from Cox's axioms but not countable additivity. Wile E. Heresiarch 15:30, 27 Dec 2003 (UTC)
thread_title:  Earliest discussion 

message: I'd like to rework this article to at least begin in a less technical manner, as I distinctly remember being confused by this when I learned it. But I'm not sure about the history here. I can understand why a modern mathematician working in ZFC needs this sort of thing to excommunicate non-measurable sets, but did Kolmogorov really care (or even know) about such things at all? Did his first axiom not apply to all events? Was his third axiom really countably additive and not just pairwise (therefore finitely) additive? -Dan (Fool) 03:47, 5 December 2005 (UTC)
replies: text: Yes, his celebrated 1933 book does explicitly state the axiom as countable additivity.  And he said that that, rather than just finite additivity, was merely for the sake of convenience.  That Kolmogorov did NOT know about such things as sigma-algebras and non-measurable sets strikes me as implausible, but I haven't looked that closely.  But after all, Kolmogorov's book appeared in 1933, so one should expect it to be quite modern in approach. Michael Hardy 22:11, 5 December 2005 (UTC)
replies: text: Thanks. Actually, I figured it out, I was confusing him with Kronecker for some reason. Oops. -Dan 00:44, 6 December 2005 (UTC)
thread_title:  Sigma-algebra 

message: I propose this page has a merge with probability theory. Please add your comments to the proposal there. Thanks Andeggs 16:13, 24 December 2006 (UTC)
thread_title:  Proposed merge with probability theory 

message: From the discussion here it looks like this once discussed sigma-algebras and now doesn't.  As it stands, this is just wrong - not every subset of omega can be assigned a probability. — ciphergoth 10:29, 11 November 2007 (UTC)
thread_title:  Oversimplified? 

message: I have a question regarding the third axiom. P(E1UE2......UEN)=P(E1)+....P(EN) thing... Wouldn't it suffice to say the equality for two events ? Can't the above equality be derived from the equation considering just 2 Events? In fact, by Occam's Razor, isn't the latter the way it is supposed to be ? Rkr1991 (Wanna chat?) 13:43, 11 September 2009 (UTC)
replies: text: Stating it for two events implies the equality only for finitely many events ("finite additivity"), not for countably many ("countable additivity"). It is in fact possible to reject countable additivity and get a different kind of probability theory, but it's not common. Shreevatsa (talk) 14:03, 11 September 2009 (UTC)
replies: text: Why woldn't it hold for countable additivity ? Can you please explain ? Rkr1991 (Wanna chat?) 04:13, 12 September 2009 (UTC)
replies: text:  Why would it hold? :-) It is clear how to extend it from 2 to any finite number (by induction etc.), but it's not possible to extend it to infinitely many. [BTW if a mathematical discussion gets too far from discussing the article itself, it may be best to take it to the reference desk.) Shreevatsa (talk) 04:26, 12 September 2009 (UTC)
thread_title:  Question regarding third axiom 

message: I think the name of this page is misleading, since there are other ways to formalise probability theory than Kolmogorov's (one example is Cox's approach, linked at the bottom of the article). It should be called something like "Kolmogorov's axioms for probability theory" instead.  Nathaniel Virgo (talk) 13:34, 14 April 2011 (UTC)
thread_title:  Page name 

message: So...maybe I'm a horrible person, but I've been reading this page for a while and just noticed that axiom 1 kind of spells out 
:P(E) \in RAPE \geq 0
Feel free to disregard if it's just me...but maybe a simple rotation of the P(E) and R terms would help...?
71.197.0.228 (talk) 06:51, 2 May 2012 (UTC)
thread_title:  Re-organizing First Axiom?