I've discussed titles quite a bit in this forum post. If you buy my view about imperative titles, then you could consider "Exploit idempotents in a ring." But it depends whether the point of the article is more "You might not have thought of it, but idempotents are actually very useful," or "You have seen or heard that idempotents can be useful, but here is how to produce such arguments for yourself." If the former, then I would be very much in favour of the imperative title. Or one could go for something more specific, such as "Decompose your ring using idempotents." The ideal, in my view is a title that serves as a super-quick summary of the message of the entire article. It's not always possible to achieve that, but often it is.
Yes, I was thinking about the tensor product for abelian groups as a special case of a product construction (in Ring theory it is quite usual to think of everything as modules). Feel free to change it as you say, I added it just as a suggestion (I put it on the list because there really isn't any more on the stub at the moment!)
The above example has a more sophisticated method than the one I tried to describe in the quick description section. In the generalization of the method of example 1, there would be a function and the goal would be to improve our understanding of its smoothness. To that end, we use itself to define another function
such that , and is as smooth as . Now the implicit function theorem says is as smooth as and hence . The argument is continued as many steps as possible. Does anyone know of another application of this argument, or an argument similar to this?
Tensor products are not really defined for groups, but rather for modules
over rings. Abelian groups are-modules, and so tensor products are defined for abelian groups, but this is a construction of a very different flavour
to all the other constructions listed on this page.
Perhaps it would be better to have a comment somewhere on the page to this effect
(i.e. that one can define the tensor product of two abelian groups), and then just
link to the How to use tensor products page for more details.
If there are no objections, I will do this some time soon.
I propose changing the title of this article to ``How to exploit idempotents in a ring''.
I have used this idea many times in my research, but never knew it was called the Peirce decomposition until reading this article. Indeed, it is a standard example in the theory of schemes, and in the representation theory of p-adic groups, which motivate two of the above examples, but I have never seen it referred to by this name in any books on those subjects. (I say this just as a defense in advance of my ignorance of this name; I don't think I will be unique in having an interest in this article, while not knowing the name ``Peirce decomposition".)
If there are no objections within a day or so, I will make this change. I will then add a line to the quick description along the lines of ``this decomposition is sometimes refereed to as the Peirce decomposition of with respect to ''.
Also, the ``More generally'' remark about a complete system of orthogonal idempotents should be elaborated on. (Because if does not have an identity, then is not actually defined as an element of , and so the Peirce decomposition is itself more general than decomposing with respect to orthogonal idempotents. So while the decomposition by a complete system of orthogonal idempotents is very closely related to the Peirce decomposition, it does not always contains the latter as a special case. Indeed, the notion of a complete system of orthogonal idempotents probalby only makes sense if has an identity, at least as far as I can tell.)
Finally, I noticed that the earlier version of this article was to some extent lifted from PlanetMath. Maybe we should be careful doing this in general, just for copyright reasons.
That's true, if you ask for the trichotomy law axiom, then both definitions are equivalent. I don't know exactly how nonstandard is this, but since Wikipedia and Planetmath both mention it (Mathworld doesn't!), it should be safe. Maybe in the transfinite context it is more used? (I just checked my copy of Kamke's "Theory of Sets". He uses your convention!).
Excuse me for my comment, I thought the notation was somewhat confusing (but it was more like I was the one confused!)
I always thought that a total order could be strict, and that the condition was that , or . Is that a very nonstandard convention?
The relation on the ordinals is more convenient to use than , since one wants many statements to be true for every , for some given . I suppose one could add the word "strict" in brackets before the first occurrence of "total order", but that feels a bit strange, given that you can convert orders of the type into orders of the type and back again. Indeed, because of this I describe them both as total orders and think of them as different ways of describing the same basic underlying object.
A total order is supposed to be total, in the sense that for every pair , we have either or . Choosing the symbol instead of for the total order can be deceptive because it usually means "lesser but not equal". It's clear that this order isn't total, because we don't have . So, either it is a mistake or it is a conscious choice of the symbol. I haven't changed the notation myself precisely because there could be a good explanation to do it like this. If I don't receive an answer in several days I will change it.
I am thinking that the use of polar coordinates could be another entry in methods for simplifying integrals (or in general methods for estimating integrals). Of course the example in this article is maybe an elementary one but one could think of more involved examples in singular integrals (e.g. method of rotations) where essentially this principle is the basic trick. I understand that 'polar coordinates' is probably quite restrictive. We should probably have an entry along the lines 'try to change your coordinate system'. I think it is a standard trick in estimating oscillatory integrals as well. Stein does this in order to prove the multi-dimensional version of the van der Corput lemma with a bump function, and I think also Michael Christ has done that in a couple of papers in order to prove sub-level set estimates (but I can't say i have all the details in my head right now). That is, adopts the coordinate system to the direction along which the phase function has a derivative that stays bounded away from zero and uses a one dimensional estimate along this direction. I guess there are plenty of other cases that I don't know of. On the other hand maybe this should be part of an 'exploit symmetries and invariance' article if one thinks for example the way Stein proves the dimension free bounds for the Euclidean ball-maximal function. I am getting a bit confused concerning which is the natural or 'right' place for each article.
When this article is written, it should have examples of several different styles of inductive proof: the usual kind where you deduce from , the slightly more sophisticated kind where you deduce it from the fact that is true for every , induction over more sophisticated well-ordered sets, use of the well-ordering principle, etc.
Amusingly, I planned an article ages ago that was very similar in spirit to this one. I've just looked for a dead link but can't find one. Anyhow, it's great that you've started this one, which I hope may eventually fit in nicely as a special case of a more general principle, which is what my intended article was going to be about. The general principle is that whenever you need to choose something and it feels difficult to do so because you need to guess too much about how the rest of the proof will go, you have the option of not choosing it and instead taking some abstract object instead, running the rest of the proof, and seeing what properties you need your unspecified object to have. At that point, you have a new problem: is there an object with those properties? Often this problem is much clearer and easier than the problem you had before when you didn't know how the proof would go.
Numerical examples in analysis are an obvious source of examples. I use the general idea a lot, but when it came to writing the article I suddenly found I couldn't think of any. Perhaps I'll write a stub with a general discussion – roughly equal to the above paragraph – but no examples! And then it could be a parent for this article.
(Actually I am only now just beginning to realise the sheer scope of this project - it may end up making the Princeton Companion to Mathematics seem like a short story!) My strategy at this point is to lay down a large number of stubs and let them grow, develop, merge, etc. in unexpected ways, on the theory that the more articles already exist, the more likely it is that each potential contributor can find a niche.
I also want to write down a number of proofs of the Cauchy-Schwarz inequality here, as some of them emphasise some cute tricks (e.g. optimising in a parameter to be chosen later). I suppose initially we can put "How to use X" and "Proof of X" on the same page, though as discussed in the "different kind of article" thread we may eventually want to split them into two (interlinked) pages.
In this article, "decoupling" sounds as an interesting general strategy. We could add a parent article about this more general metatechnique (I don't have the knowledge to elaborate it). Why is it important? In which cases ought we try to get a decoupling? Etc
Another "decoupling" technique that comes to mind now is that of "separating variables" in ODEs and PDEs.
I think we have similar views on these things. My guess is what you refer to as the sample space in your statement ``...but for most other things once can avoid mentioning the sample space'' is the in, for example, the following statement:
``Let be a probability space and let ,, ..., ,... be a sequence of iid Bernoulli random variables with ''
Unfortunately, it is common in probability to state the structures that underly the problem in this abstract and obscure way. What is the remedy? I think the remedy is to explicitly state what these things are for the problem at hand. For example, I would rewrite the above statement as follows:
``
Let and .
Let .
Define for , and let be the unique extension of to . Let be the coordinate projections.''
One can write it in different ways but the point is: explicitly state what your maps are, what your sigma algebras are.
I think that the concepts of sigma algebras, measurability, maps, etc. are very well thought abstractions that are useful at every level, including, finite sets. If for nothing else, for notational and pedagogical reasons. For example: the notation is good, it allows us to talk about the result of an experiment. How to make this notation meaningful? Here is an example: If the experiment is the throw of a die, then , and finally the random variable is , is simply the canonical map. Is this abstract nonsense? I don't think so. Now I can soundly write .
Philosophically, I find this setup meaningful as well. is the identity map. Why? Because we model the experiment as random, i.e., we have settled to accept that we don't know the causes that determine the outcomes of the roll of our die. If we did then the causes would have been the domain of and would actually be a function mapping the causes to the effects. We throw away the causes and the relation between the causes and the effects and define as a map that maps each effect to itself. And as far as our knowledge of the experiment goes, we settle to simply live with the statistical properties of the outcomes, which we represent as a probability distribution.
From the pedagogical point of view: I ask my students nontrivial measurability questions in finite setups so that they get a good sense of what measurability means in cases where they can explicitly write down the objects they are working on. I think this is good preparation for times when one has to think about measuribility in much more abstract circumstances.
I think there should exist some examples involving trigonometric (or inverse trigonometric) functions, where we forget about the actual evaluations of the functions but we use their main properties, like periodicity, a sine is a cosine with a phase change, bounds between and ,,, etc.
More generally, I think we almost always do this abstraction: for us, mathematical objects are mostly what their main properties say they are; for example, we just associate every function with their properties, not with their sets of values (e.g., exponentials are the functions that verify the rules of exponentiation, are always positive, eigenfunctions for the derivative operator, etc). And when we define a family of "well-known" functions (for example, "elemental" functions and operations to represent an undefined integral), we are just restricting ourselves to functions whose properties we know well. I think this main idea could be the subject of another, even more abstract article about "Forget the actual object and stand by its properties" (not just for functions).
(Actually, I also want to write an article some day titled "Just check the definition", because sometimes it shows more fruitful to just stick to the definition of the object in question rather than trying characterizations and well-known properties of it. If you read this and feel like writing that article, feel free to do so!).
I've thought about this, and in the end I think it isn't really an example, because its algorithmic nature isn't playing a genuine role. The "real" proof that underlies the argument you give is this: take all maximal open subintervals of your set, and check that no two of them can intersect.
One sees that any open set is the union of disjoint intervals using a greedy algorithm. For an element in let , be the collection of all open intervals lying in and containing . Let and The intervals in are open, connected and they are not disjoint of each other because they all contain . These imply that is also a member of and by its definition it is the maximal element of .
We now enumerate the rationals in and iterate over them as follows. Suppose ,,..., are the intervals chosen upon iterating over the first rationals. For the rational we check if intersects with ,,...,. If there is a nonempty intersection with a then by the maximality of and in this case we complete the step and proceed to the next rational. If is disjoint from ,,..., then we let .
Let be the largest number the index reaches in the above iteration (it may be ). Because the rationals are dense in it follows that .
Actually, my view is more nuanced than my last comment would suggest. Having just taught a probability course, I think that one should define a random variable as a (measurable – though I prefer to start with the discrete case) function on a probability space, one should try as hard as possible not to use this in proofs. It's very convenient to use it when proving linearity of expectation, but for most other things one can avoid mentioning the sample space. Perhaps I'll write a Tricki article called something like "How not to think about sample spaces."
Thanks for the comment. I do hope that you and others will feel free to edit any of what I wrote here, I understand that it can be written better.
On the issue of what is probability theory I would like to share a sentence from Doob from his book Stochastic Processes:
``Probability is simply a branch of measure theory, with its own special emphasis and field of application, and no attempt has been made to suger-coat this fact. (page 1)''
Your point about the first sentence being incomplete and dry, I do agree. I couldn't come up with something better at a first writing. Here is again a better statement by Doob, which, similar to your sentence, emphasizes the relations rather than the objects:
``The theory of probability is concerned with the measure properties of various spaces, and with the mutual relations of measurable functions defined on those spaces. (Stochastic processes, page 2).''
I don't like this first sentence, for two reasons.
1. I disagree with it. I think probability theory is the study of ... probabilities, and probability measures are how we formulate that in a rigorous way. (For example, one would never say, "Number theory is the study of finite sets that are transitive and totally ordered by inclusion." Rather, it's the study of numbers and their relationships, and it so happens that we (sometimes) model numbers with the help of set theory.)
2. It will put off many readers. There will be lots of probability articles on the Tricki that will be comprehensible to someone who knows no measure theory, and they won't all be elementary.
A slightly more subtle objection (to the second paragraph) is that I don't like the identification of random variables with measurable functions. This is a point that was made to me by a probabilist who wrote for the Princeton Companion to Mathematics: almost all the time, one can analyse random variables without having to worry about what sample space one is using, and this is the "correct" way to think probabilistically.
Having said that, there is a place for the view of probability that you are putting forward here – as a sort of branch of measure theory. Perhaps there should be a measure theory front page with a subpage devoted to probability measures.
I'm not making any changes at the moment, partly because of time constraints and partly because others may wish to express their views before I go ahead and do anything.
Yes, you are right; I could have done the changes myself and I usually do this kind of work in Wikis (format/grammar editing). But here we have the luck of being a small site (yet) and I had the opportunity to expose my opinion directly to you and, in case you got convinced of the correctness of the change, I would have saved myself from the need of editing all your articles anytime you didn't use the courtesy plural ;-)
It's just the old topic of teaching how to grow wheat instead of just giving bread, if you allow me the comparison.
From the point of view of linking to this article, it is quite inconvenient to have levels of the hierarchy that are not articles, with sublevels that are. Would it be possible to create small articles for the headings above that are currently in black? (I could do this myself, but am rather busy for the next 24 hours or so.)
My feeling on infinite graphs, for what it's worth, is that they should probably be included here if the graph-theoretical perspective sheds some basic insight on the infinite structure, or if they can give some insight into finite graphs – so the usual graph on might qualify because it does encapsulate many of the properties of grids, but the obvious graph derived from the Leech lattice probably wouldn't qualify, since despite its retaining many of the interesting properties of the Leech lattice, it doesn't actually tell you anything that the lattice itself doesn't already. I'm not really all that familiar with infinite graph theory, though, so I'll probably leave that area mostly alone for now.
I agree with you generally about the organization of the article. I'm a little worried that the boundaries between (2) and the other classes seem kind of nebulous, but that difficulty will probably resolve itself over the course of editing the article.
I've discussed titles quite a bit in this forum post. If you buy my view about imperative titles, then you could consider "Exploit idempotents in a ring." But it depends whether the point of the article is more "You might not have thought of it, but idempotents are actually very useful," or "You have seen or heard that idempotents can be useful, but here is how to produce such arguments for yourself." If the former, then I would be very much in favour of the imperative title. Or one could go for something more specific, such as "Decompose your ring using idempotents." The ideal, in my view is a title that serves as a super-quick summary of the message of the entire article. It's not always possible to achieve that, but often it is.
Yes, I was thinking about the tensor product for abelian groups as a special case of a product construction (in Ring theory it is quite usual to think of everything as modules). Feel free to change it as you say, I added it just as a suggestion (I put it on the list because there really isn't any more on the stub at the moment!)
The above example has a more sophisticated method than the one I tried to describe in the quick description section. In the generalization of the method of example 1, there would be a function and the goal would be to improve our understanding of its smoothness. To that end, we use itself to define another function
such that , and is as smooth as . Now the implicit function theorem says is as smooth as and hence . The argument is continued as many steps as possible. Does anyone know of another application of this argument, or an argument similar to this?
Tensor products are not really defined for groups, but rather for modules
over rings. Abelian groups are -modules, and so tensor products are defined for abelian groups, but this is a construction of a very different flavour
to all the other constructions listed on this page.
Perhaps it would be better to have a comment somewhere on the page to this effect
(i.e. that one can define the tensor product of two abelian groups), and then just
link to the How to use tensor products page for more details.
If there are no objections, I will do this some time soon.
I propose changing the title of this article to ``How to exploit idempotents in a ring''.
I have used this idea many times in my research, but never knew it was called the Peirce decomposition until reading this article. Indeed, it is a standard example in the theory of schemes, and in the representation theory of p-adic groups, which motivate two of the above examples, but I have never seen it referred to by this name in any books on those subjects. (I say this just as a defense in advance of my ignorance of this name; I don't think I will be unique in having an interest in this article, while not knowing the name ``Peirce decomposition".)
If there are no objections within a day or so, I will make this change. I will then add a line to the quick description along the lines of ``this decomposition is sometimes refereed to as the Peirce decomposition of with respect to ''.
Also, the ``More generally'' remark about a complete system of orthogonal idempotents should be elaborated on. (Because if does not have an identity, then is not actually defined as an element of , and so the Peirce decomposition is itself more general than decomposing with respect to orthogonal idempotents. So while the decomposition by a complete system of orthogonal idempotents is very closely related to the Peirce decomposition, it does not always contains the latter as a special case. Indeed, the notion of a complete system of orthogonal idempotents probalby only makes sense if has an identity, at least as far as I can tell.)
Finally, I noticed that the earlier version of this article was to some extent lifted from PlanetMath. Maybe we should be careful doing this in general, just for copyright reasons.
That's true, if you ask for the trichotomy law axiom, then both definitions are equivalent. I don't know exactly how nonstandard is this, but since Wikipedia and Planetmath both mention it (Mathworld doesn't!), it should be safe. Maybe in the transfinite context it is more used? (I just checked my copy of Kamke's "Theory of Sets". He uses your convention!).
Excuse me for my comment, I thought the notation was somewhat confusing (but it was more like I was the one confused!)
I always thought that a total order could be strict, and that the condition was that , or . Is that a very nonstandard convention?
The relation on the ordinals is more convenient to use than , since one wants many statements to be true for every , for some given . I suppose one could add the word "strict" in brackets before the first occurrence of "total order", but that feels a bit strange, given that you can convert orders of the type into orders of the type and back again. Indeed, because of this I describe them both as total orders and think of them as different ways of describing the same basic underlying object.
A total order is supposed to be total, in the sense that for every pair , we have either or . Choosing the symbol instead of for the total order can be deceptive because it usually means "lesser but not equal". It's clear that this order isn't total, because we don't have . So, either it is a mistake or it is a conscious choice of the symbol. I haven't changed the notation myself precisely because there could be a good explanation to do it like this. If I don't receive an answer in several days I will change it.
I am thinking that the use of polar coordinates could be another entry in methods for simplifying integrals (or in general methods for estimating integrals). Of course the example in this article is maybe an elementary one but one could think of more involved examples in singular integrals (e.g. method of rotations) where essentially this principle is the basic trick. I understand that 'polar coordinates' is probably quite restrictive. We should probably have an entry along the lines 'try to change your coordinate system'. I think it is a standard trick in estimating oscillatory integrals as well. Stein does this in order to prove the multi-dimensional version of the van der Corput lemma with a bump function, and I think also Michael Christ has done that in a couple of papers in order to prove sub-level set estimates (but I can't say i have all the details in my head right now). That is, adopts the coordinate system to the direction along which the phase function has a derivative that stays bounded away from zero and uses a one dimensional estimate along this direction. I guess there are plenty of other cases that I don't know of. On the other hand maybe this should be part of an 'exploit symmetries and invariance' article if one thinks for example the way Stein proves the dimension free bounds for the Euclidean ball-maximal function. I am getting a bit confused concerning which is the natural or 'right' place for each article.
yannis
When this article is written, it should have examples of several different styles of inductive proof: the usual kind where you deduce from , the slightly more sophisticated kind where you deduce it from the fact that is true for every , induction over more sophisticated well-ordered sets, use of the well-ordering principle, etc.
Amusingly, I planned an article ages ago that was very similar in spirit to this one. I've just looked for a dead link but can't find one. Anyhow, it's great that you've started this one, which I hope may eventually fit in nicely as a special case of a more general principle, which is what my intended article was going to be about. The general principle is that whenever you need to choose something and it feels difficult to do so because you need to guess too much about how the rest of the proof will go, you have the option of not choosing it and instead taking some abstract object instead, running the rest of the proof, and seeing what properties you need your unspecified object to have. At that point, you have a new problem: is there an object with those properties? Often this problem is much clearer and easier than the problem you had before when you didn't know how the proof would go.
Numerical examples in analysis are an obvious source of examples. I use the general idea a lot, but when it came to writing the article I suddenly found I couldn't think of any. Perhaps I'll write a stub with a general discussion – roughly equal to the above paragraph – but no examples! And then it could be a parent for this article.
(Actually I am only now just beginning to realise the sheer scope of this project - it may end up making the Princeton Companion to Mathematics seem like a short story!) My strategy at this point is to lay down a large number of stubs and let them grow, develop, merge, etc. in unexpected ways, on the theory that the more articles already exist, the more likely it is that each potential contributor can find a niche.
I also want to write down a number of proofs of the Cauchy-Schwarz inequality here, as some of them emphasise some cute tricks (e.g. optimising in a parameter to be chosen later). I suppose initially we can put "How to use X" and "Proof of X" on the same page, though as discussed in the "different kind of article" thread we may eventually want to split them into two (interlinked) pages.
In this article, "decoupling" sounds as an interesting general strategy. We could add a parent article about this more general metatechnique (I don't have the knowledge to elaborate it). Why is it important? In which cases ought we try to get a decoupling? Etc
Another "decoupling" technique that comes to mind now is that of "separating variables" in ODEs and PDEs.
I think we have similar views on these things. My guess is what you refer to as the sample space in your statement ``...but for most other things once can avoid mentioning the sample space'' is the in, for example, the following statement:
``Let be a probability space and let , , ..., ,... be a sequence of iid Bernoulli random variables with ''
Unfortunately, it is common in probability to state the structures that underly the problem in this abstract and obscure way. What is the remedy? I think the remedy is to explicitly state what these things are for the problem at hand. For example, I would rewrite the above statement as follows:
``
Let and .
Let .
Define for , and let be the unique extension of to . Let be the coordinate projections.''
One can write it in different ways but the point is: explicitly state what your maps are, what your sigma algebras are.
I think that the concepts of sigma algebras, measurability, maps, etc. are very well thought abstractions that are useful at every level, including, finite sets. If for nothing else, for notational and pedagogical reasons. For example: the notation is good, it allows us to talk about the result of an experiment. How to make this notation meaningful? Here is an example: If the experiment is the throw of a die, then , and finally the random variable is , is simply the canonical map. Is this abstract nonsense? I don't think so. Now I can soundly write .
Philosophically, I find this setup meaningful as well. is the identity map. Why? Because we model the experiment as random, i.e., we have settled to accept that we don't know the causes that determine the outcomes of the roll of our die. If we did then the causes would have been the domain of and would actually be a function mapping the causes to the effects. We throw away the causes and the relation between the causes and the effects and define as a map that maps each effect to itself. And as far as our knowledge of the experiment goes, we settle to simply live with the statistical properties of the outcomes, which we represent as a probability distribution.
From the pedagogical point of view: I ask my students nontrivial measurability questions in finite setups so that they get a good sense of what measurability means in cases where they can explicitly write down the objects they are working on. I think this is good preparation for times when one has to think about measuribility in much more abstract circumstances.
I think there should exist some examples involving trigonometric (or inverse trigonometric) functions, where we forget about the actual evaluations of the functions but we use their main properties, like periodicity, a sine is a cosine with a phase change, bounds between and , , , etc.
More generally, I think we almost always do this abstraction: for us, mathematical objects are mostly what their main properties say they are; for example, we just associate every function with their properties, not with their sets of values (e.g., exponentials are the functions that verify the rules of exponentiation, are always positive, eigenfunctions for the derivative operator, etc). And when we define a family of "well-known" functions (for example, "elemental" functions and operations to represent an undefined integral), we are just restricting ourselves to functions whose properties we know well. I think this main idea could be the subject of another, even more abstract article about "Forget the actual object and stand by its properties" (not just for functions).
(Actually, I also want to write an article some day titled "Just check the definition", because sometimes it shows more fruitful to just stick to the definition of the object in question rather than trying characterizations and well-known properties of it. If you read this and feel like writing that article, feel free to do so!).
I've thought about this, and in the end I think it isn't really an example, because its algorithmic nature isn't playing a genuine role. The "real" proof that underlies the argument you give is this: take all maximal open subintervals of your set, and check that no two of them can intersect.
Would the following example be too trivial?
One sees that any open set is the union of disjoint intervals using a greedy algorithm. For an element in let , be the collection of all open intervals lying in and containing . Let and The intervals in are open, connected and they are not disjoint of each other because they all contain . These imply that is also a member of and by its definition it is the maximal element of .
We now enumerate the rationals in and iterate over them as follows. Suppose , ,..., are the intervals chosen upon iterating over the first rationals. For the rational we check if intersects with , ,...,. If there is a nonempty intersection with a then by the maximality of and in this case we complete the step and proceed to the next rational. If is disjoint from , ,..., then we let .
Let be the largest number the index reaches in the above iteration (it may be ). Because the rationals are dense in it follows that .
Actually, my view is more nuanced than my last comment would suggest. Having just taught a probability course, I think that one should define a random variable as a (measurable – though I prefer to start with the discrete case) function on a probability space, one should try as hard as possible not to use this in proofs. It's very convenient to use it when proving linearity of expectation, but for most other things one can avoid mentioning the sample space. Perhaps I'll write a Tricki article called something like "How not to think about sample spaces."
I think the identification of random variables and measurable functions is standard. For example, Varadhan's Probability Theory book, page 7:
``An important notion is that of a random variable or a measurable function.''
then the next definition:
``Definition 1.5. A random variable or a measurable function is a map ...''
Another example is the book Probabilities and Potential by [[w:Paul-Andr
Thanks for the comment. I do hope that you and others will feel free to edit any of what I wrote here, I understand that it can be written better.
On the issue of what is probability theory I would like to share a sentence from Doob from his book Stochastic Processes:
``Probability is simply a branch of measure theory, with its own special emphasis and field of application, and no attempt has been made to suger-coat this fact. (page 1)''
Your point about the first sentence being incomplete and dry, I do agree. I couldn't come up with something better at a first writing. Here is again a better statement by Doob, which, similar to your sentence, emphasizes the relations rather than the objects:
``The theory of probability is concerned with the measure properties of various spaces, and with the mutual relations of measurable functions defined on those spaces. (Stochastic processes, page 2).''
I don't like this first sentence, for two reasons.
1. I disagree with it. I think probability theory is the study of ... probabilities, and probability measures are how we formulate that in a rigorous way. (For example, one would never say, "Number theory is the study of finite sets that are transitive and totally ordered by inclusion." Rather, it's the study of numbers and their relationships, and it so happens that we (sometimes) model numbers with the help of set theory.)
2. It will put off many readers. There will be lots of probability articles on the Tricki that will be comprehensible to someone who knows no measure theory, and they won't all be elementary.
A slightly more subtle objection (to the second paragraph) is that I don't like the identification of random variables with measurable functions. This is a point that was made to me by a probabilist who wrote for the Princeton Companion to Mathematics: almost all the time, one can analyse random variables without having to worry about what sample space one is using, and this is the "correct" way to think probabilistically.
Having said that, there is a place for the view of probability that you are putting forward here – as a sort of branch of measure theory. Perhaps there should be a measure theory front page with a subpage devoted to probability measures.
I'm not making any changes at the moment, partly because of time constraints and partly because others may wish to express their views before I go ahead and do anything.
Yes, you are right; I could have done the changes myself and I usually do this kind of work in Wikis (format/grammar editing). But here we have the luck of being a small site (yet) and I had the opportunity to expose my opinion directly to you and, in case you got convinced of the correctness of the change, I would have saved myself from the need of editing all your articles anytime you didn't use the courtesy plural ;-)
It's just the old topic of teaching how to grow wheat instead of just giving bread, if you allow me the comparison.
From the point of view of linking to this article, it is quite inconvenient to have levels of the hierarchy that are not articles, with sublevels that are. Would it be possible to create small articles for the headings above that are currently in black? (I could do this myself, but am rather busy for the next 24 hours or so.)
My feeling on infinite graphs, for what it's worth, is that they should probably be included here if the graph-theoretical perspective sheds some basic insight on the infinite structure, or if they can give some insight into finite graphs – so the usual graph on might qualify because it does encapsulate many of the properties of grids, but the obvious graph derived from the Leech lattice probably wouldn't qualify, since despite its retaining many of the interesting properties of the Leech lattice, it doesn't actually tell you anything that the lattice itself doesn't already. I'm not really all that familiar with infinite graph theory, though, so I'll probably leave that area mostly alone for now.
I agree with you generally about the organization of the article. I'm a little worried that the boundaries between (2) and the other classes seem kind of nebulous, but that difficulty will probably resolve itself over the course of editing the article.
I will change this, but as I understand the way a wiki works, you could have changed it yourself. The author doesn't own the article.