Privacy Policy Cookie Policy Terms and Conditions Talk:Empty set - Wikipedia, the free encyclopedia

Talk:Empty set

From Wikipedia, the free encyclopedia

Contents

[edit] Oct 2002

I removed this entire passage, based on material first submitted by a non-registered Wikipedian:

The empty set is very simple; ironically so simple that many mathematics students (and even professional mathematicians!) have a difficult time applying it correctly.
For example, take the first feature listed above, that the empty set is a subset of any set A. If you look up subset, then you'll see that this claim means that for every element x of {}, x belongs to A. Since "for every" is a strong condition, we intuitively expect that it must be necessary to find many elements of {} that also belong to A. Of course, we can't find any elements of {} that also belong to A. So many people think that {} is not a subset of A after all. But this is a mistake. In fact "for every" may not be a very strong requirement at all if it says "for every element of {}". Since there are no elements of {}, "for every element of {}" is no requirement at all. Every statement satisfies that requirement, which is actually the weakest condition possible.
A statement which claims something about all the elements of {} (i.e. about nothing whatsoever) is an example of a vacuous truth. So it is vacuously true that {} is a subset of A. The concept of vacuous truth can be a difficult one to wrap one's brain around, and this leads to difficulties in applying the empty set correctly.

Here are some of my reasons:

  1. "The empty set is very simple" is not NPOV, simplicity being a far from simple concept. I've tried to compensate for deleting this by giving the briefest mention of how intuition can conflict with the formal definition of a set. (This discussion probably belongs in a different article, but...)
  2. The second paragraph seems, in context of the first, to be an attempt to describe a common difficulty in "applying" the empty set concept "correctly". However, it is more a justification for why the first property of the empty set listed by the article is reasonable. As such a justification, I think the second paragraph is underdeveloped, and worse than no paragraph at all.
  3. The second paragraph has an implicit discussion of vacuous truth and the third has an explicit reference to it. At present, I believe the vacuous truth article does a better job explaining these issues.

-- Ryguasu (Wed Sep 25 01:01:06 EST 2002)

The nonregistered Wikipedian is me.

  1. No argument; what you've written is good, better than what I wrote.
  2. I don't see why you don't want to have an example of what we're talking about. First, how is this example "undeveloped"? It goes on a lot more than any straightforward application of the definitions; to just prove the statement is trivial! This is a standard example of nonintuitive reasoning that I've seen in several set theory books, and it seems odd to consider it out of place. If anything, we should have more of this sort of thing in here.
  3. What you have doesn't even explain how the empty set is related to vacuous truth. That's a major omission! Not every fact must appear on only one page; most should appear on several, since they deal with several things.

Toby 08:54 Sep 27, 2002 (UTC)


I'm baffled by the bit about everybody, even mathematicians finding it baffling. It is terribly simple. The hard stuff is problems like deciding how many elements a set like { { {}, { {} } }, { } } has, and even that's just a case of keeping a clear head and counting the brackets -- Tarquin

I wrote "and even professional mathematicians!" back in the day because I see such confusion so often. Whenever I read math texts, I'm always on the look out for incorrect handling of degenerate cases in definitions and theorems. (Of course, one can argue about the definitions, but not the theorems!) The empty set pops up here all the time.

The most common example in my personal experience is this statement of the axiom of choice:

Every nonempty collection of nonempty sets has a choice function.

This has one "nonempty" too many (look at our article to see which, because we get it right). Removing the extra "nonempty" results in an equivalent statement, of course, since the empty collection has a choice function (the empty function). But it's presence implies that the word is necessary, giving a false impression; and it wouldn't be there if somebody hadn't had a false impression before.

If you give me a chance to look in some books, I'll find you examples where confusion about the empty set leads not just to misleading inclusion of unncessary words but to actual false statements. Finding and correcting these is almost a hobby of mine.

Toby 11:25 Sep 28, 2002 (UTC)

Examples of such mistakes would be an interesting addition to the article! (I had a lecturer at university who didn't believe in the axiom of choice... ) -- Tarquin

Hum, now that means that I have to find a selection of standard texts (it's no far just picking things randomly off the shelves) and searching for this particular error. That could take up a lot of time, since I'd naturally get drawn into reading the other parts of these books ^_^. (And I don't believe the axiom of choice either, at least not on weekends.) — Toby 08:18 Sep 29, 2002 (UTC)

Sorry, didn't mean to send you off on a research quest! -- Tarquin

Don't worry, I probably won't do it ^_^. — Toby 10:52 Sep 29, 2002 (UTC)

Question: does the empty set have a well-defined notation? For example, the set S = {1, 2, 3, 4, 5} = {x : 1 <= x <= 5} is well-defined. Does the empty-set have an analagous notation, e.g. ES = {} = {x : x \notin S} for any nonempty set S? The first part of this definition says that the empty set *does* contain elements, otherwise the set is not well-defined. The second part of the definition tells us how to construct the empty set; define a set, then remove all elements until the set is empty. But then we get a contradiction from defining the empty set as a subset of *any* set, because any of these subsets is defined as: {x: x\notinS, x\inS}. So is there a real set-theoretic definition and notation for the empty set or do we just conceptualize it for convenience? — Elijah Gregory


Regarding the difficulty/simplicity of the concept: the other day I talked to a math Ph.D. who said that he thinks of the empty subset of R2 as being different from the empty subset of R. AxelBoldt 23:54 Sep 29, 2002 (UTC)

Does he think of the empty subset of Q as different from the empty subset of R? How about the subset {0}? Or the subset Q?

I often think of the same set as different subsets, depending on what set I'm thinking of it as being a subset of, much as I think of the same set of ordered pairs as different functions, depending on what set I'm think of as the codomain. (And this is more than just an analogy, since subsets of X can be identified with equivalence classes of injections into X, and indeed it's that concept that is used to define subobjects in category theory.) This is a matter of keeping track of context, and is useful when answering questions such as "What is the complement of {}?". You can formalise it as an ordered pair (A,X), where A is a subset of X (just as you can formalise a function as an ordered pair (G,Y), where G is the graph and Y is the codomain). Then the question "What is the complement of A?", normally ambiguous, is unambiguous, because "A" really means (A,X) and you're just abusing notation when you call it A.

But if your colleague treats {} specially in this regard, then I'm afraid that I can't help him. — Toby 07:56 Sep 30, 2002 (UTC)

The question "what is the complement of X" is meaningless. It's an acceptable shorthand when we all know what the superset is, but "complement" is a 3-way relation (or a binary operation): "A is the complement of X in Y". I wonder, does Axel's friend think of the zero in R as different from the zero in the Q? -- Tarquin 12:25 Sep 30, 2002 (UTC)

First, how can you say that "What is the complement of A?" is meaningless if you agree that it's acceptable shorthand in certain contexts? In those contexts, it has a perfectly good meaning! That is why you'll often see sentences just like it in reasonable math books. All meaning depends on context, even in math.

Second, the 0 element of R is different from the 0 element of Q in much the same sense as their empty subsets are different. Even more so, because people that stick to pure set-theoretic reductionism in their math will still see them as different (unless they go out of their way to avoid this), which you can't say in the subset case. (Say, one 0 is an ordered pair of sets of rational numbers, while another 0 is a set of ordered pairs of integers.)

My point is that when you ask if two things in math are equal or distinct, the question only has meaning when it is relevant, that is in a context where the two things are already of a certain type (such as subsets of R2 or elements of Q). Yes, the question "Are they equal?" has a meaning in a reductionist set-theoretic sense (using the axiom of extension), but since the answer to the question varies depending on how one carries out the reduction, it is ultimately meaningless. Thus, it's best to regard such things as so different that they are "not even distinct" (as Wolfgang Pauli might have put it). Or to put it another way, you're asking if they're the same species, when they're not even the same genus. — Toby 10:23 Oct 7, 2002 (UTC)

"meaningless" in that it's not clearly defined.
But it is perfectly well defined if you specify ahead of time that you're dealing with subsets of X. If you like algebra, then you might want to ask yourself what is the cokernel of the group homomorphism sgn defined on the symmetric group S3, where sgn σ is 1 or −1 depending on whether σ is odd or even. Well, the answer to my question is not clearly defined.
For most purposes in algebra, however, you can work in a context where you assume that signs belong to the group {1,−1}, since these are the only values that signs can ever take in any permutation situation. Then the cokernel is trivial, since the image of f is the entire group {1,−1}. On the other hand, you could work in a context where you take signs to belong to the group U(1) of unit complex numbers (which is just what you want in some applications to quantum physics), and then the cokernel is an infinite group (in fact isomorphic to U(1) again).
So the answer depends on the context. Absolutely, the problem is ill defined if the context is not specified (or not specified enough). But by the same token, the problem is quite well defined if the context is sufficiently specified.
Indeed, it's become fashionable (thanks to Bourbaki) to define group homomorphism in such a way that the necessary context for the above problem must be specified. Wikipedia's own definition requires a homomorphism to be a function (obvious enough) and then defines functions to be differnt if they have the same domain and graph but different codomains. And the codomain is exactly the context that we needed here; it was (in my examples) either {1,−1} or U(1).
We don't do this with the term subset; if you say "A is a subset", then you don't need to specify what it's a subset of. A subset of Q and a subset of R2 could well be equal under this definition. Yet I hope that you realise how unsatisfactory it is to say simply "A is a subset". You want to say "A is a subset of X", or else you're not really finished with what you wanted to say. So we could (and doubtless would, had Bourbaki seen fit to so influence us) define a subset to be an ordered pair (A,X) such that ∀xA, xX, much as we define a function be an ordered pair (gr,Y), where gr is a set (of ordered pairs) satisfying a certain condition involving Y. Back in the day, they just said that gr was the function, but ultimately that's missing something relevant. Similarly, to say that A is a subset is not really enough to do any good; to get anywhere, you have to say what A is a subset of.
"one 0 is an ordered pair of sets of rational numbers, while another 0 is a set of ordered pairs of integers" -- yes, but once R is built, do we still consider Q to be the old construction of pairs of integers, or do we consider Q to now be a subset of R? I suppose there is an "original" Q and a "meta"-Q. Ouch! -- Tarquin
Yes, and you'll sometimes even see that written up in textbooks. The alternative method, which you will also see written up in textbooks, is to take the newly constructed set R, remove all of the metarationals from it, and replace these by the original rationals, thus getting a proR ("προ" being the opposite of "μετα").
The important thing to realise, however, is that all that you actually need to do mathematics is a field Q with certain properties (prime, charcteristic 0), a field R with certain properties (ordered, Dedekind complete), and a monomorphism (that is, both a homomorphism and an injection) from Q to R (there is only one). Exactly what the sets are is irrelevant, and it's even unnecessary to assume that Q is literally a subset of R; you can consider it as just an abuse of notation (we could use an article on that) when you pretend that it is.
This all makes perfect sense from the viewpoint of category theory, where the notion of subset doesn't generalise precisely to arbitrary categories but there is a notion of subobject — according to which, any monomorphism is in exactly the same position as an actual subset inclusion. That is, when you generalise to arbitrary categories, you can no longer tell whether you really have a subset or just a monomorphism, and it doesn't matter. — Toby 10:46 Oct 10, 2002 (UTC)
I suppose that is similar to the question: "is there only one group C3 or are there many groups isomorphic to it?" -- Tarquin

Right, although there is a subtle difference between the case of C3 and the cases of R and Q.

What is really odd is that there is a sense in which it's OK to speak of "the" cyclic group with 2 elements but not OK to speak of "the" cyclic group with 3 elements. The reason is that not only are any two cyclic groups G and H each with 2 elements isomorphic, there is also only one isomorphism between them. Thus, if you and I (discussing "the" such group with one another) come up with different groups in our respective imaginations, we can not only rest assured that there is an ismorphism between our groups but also that we know what that isomorphism is. For some purposes, we need that level of certainty to communicate with one another, a level of certainty that just isn't available with cyclic groups each with 3 elements.

To see this in a more familiar place, consider "the" Dedekind complete ordered field. It's reasonable to use this as the definition of the set R of real numbers, because if you have one set R (say a set of Dedekind cuts) and I have another set R' (say a set of equivalence classes of Cauchy sequences), then they are isomorphic. But more than that, they are uniquely isomorphic. Thus I not only know that when I say "√2" to you that there is something in your R that corresponds to my √2 ∈ R', but I also know that there's only one thing that it could be.

In contrast, it's less safe to define the set C of complex numbers as "the" algebraic completion of R. The reason is that there is no way to distinguish i from −i; they have precisely identical algebraic (and topological) properties. The result is that we have to set conventions, for every representation of the complex numbers, for which square root of −1 is the official i. For example, in the Argand plane, i is counterclockwise from 1, while −i is clockwise. But it could just as easily have been the other way around. In Schroedinger's equation, momentum is −ihd/dx, not ihd/dx; but it could just as easily have been otherwise. Every time complex numbers appear, this convention must be set, or conflicting implementations will result. No such problems arise with the real numbers.

Toby 10:06 Oct 18, 2002 (UTC)


I removed:

In fact, in set theory, all objects which don't contain themselves can be constructed from the empty set and the operation of making a set containing some available elements. The empty set acts as a starting point.

First, no set can contain itself, a consequence of the axiom of foundation. The claim that all sets can somehow be constructed from the empty set should probably be formalized as "all sets are constructible", a statement which can neither be proved nor disproved from the ZFC axioms. AxelBoldt 13:09, 29 Nov 2003 (UTC)

[edit] The empty set symbol

The letters Φ (obtained by typing &Phi;), φ (&phi;) or φ (<math>\phi<<\math>) are not the symbol for the empty set in mathematics, and should not be used as such in Wikipedia.

In Unicode, the empty set symbol ∅ (&#8709;) occupies code point U+2205. But many fonts in use today don't include this character and render it as a small rectangle.

The TeX symbol \emptyset (<math>\emptyset</math>) looks funny and seems to dance above the baseline.

Therefore, I recommend using either Ø (&Oslash;) or {} ({}) to indicate the empty set.

Herbee 2004-02-18

I just found \varnothing (TeX \varnothing) which now looks best to me.
Herbee 23:18, 2004 Mar 18 (UTC)

I agree varnothing looks best. If we really want to avoid tex-png than Oslash seems the best choice. It also looks the most similar to varnothing. MarSch 13:46, 20 Apr 2005 (UTC)
The article Ø talks about ∅ (&#8709;). I think that this article should as well—or at least present the same symbol as a graphic. Perhaps there should be a new section at the end about representing the empty set in Unicode. BlankVerse 05:32, 3 May 2005 (UTC)
Mention &#8709; by all means. However, to be frank, I rather dislike all the sections in various articles about how to represent all kind of symbols in Unicode. I feel that this is a technical issue that has little to do with the concept empty set and is of little use to our readers. -- Jitse Niesen 10:01, 3 May 2005 (UTC)

[edit] "Boundings of the empty set"

I've moved the following newly added section titled "Boundings of the empty set" here for discussion

(Start of moved text.)

The empty set, like all sets, has a greatest lower bound and a least upper bound. The empty set and the real set differ in the bounds. The real set has a \sup\mathbb{R}=\infty and \inf\mathbb{R}=-\infty. The empty set is different though. In the empty set \sup\emptyset=-\infty and \inf\emptyset=\infty. This is logical because the upper bound is what is greater than or equal to any element in the set. For example, take x=5. Is x greater than or equal to all the elements in the empty set? Yes! Now, take x=-958. Is x greater than or equal to all the elements in the empty set? Yes! If the idea is extended to the entire real set then it is seen that the empty set has \sup\emptyset=-\infty. If the idea is applied to the greatest lower bound this time going from negatuve infinity to positive infinity then we can arrive at the same conclusion. The bounds property for the empty set is not an axiom, it is a theory.

(End of moved text.)

The idea that the empty set has (in some contexts) an inf and sup is an interesting property, which I think deserves including in the article. However, there are several problems with the text as it now stands. To begin with the first sentence as written is wrong, not every set has a greatest lower bound and a least upper bound. It is of course true that every bounded subset of R has a inf and a sup. And every subset including the empty set, of extended reals has infs and sups. This can be easily fixed of course. There are other quibbles I have with this section, which I can discuss if anyone cares to. But if not, I will just supply a rewrite, unless someone beats me to it ;-) Paul August 17:33, 14 September 2005 (UTC)

As a related question, isn't it that inf and sup are defined for non-empty set of real numbers? We can talk about Z (set of integers) because it is the subset of real numbers, but the empty set is a subset of any set, not necessarily R. Our Supremum is not clear on this issue, though it should be. Anyway, this is interesting; I've never thought of this case. -- Taku 23:04, 14 September 2005 (UTC)
== Boundings of the empty set ==
The empty set has a greatest lower bound and a least upper bound. The empty set and the real set differ in the bounds. The real set has a \sup\mathbb{R}=\infty and \inf\mathbb{R}=-\infty. The empty set is different though. In the empty set \sup\varnothing=-\infty and \inf\varnothing=\infty.
For direct proof, suppose that x\in\varnothing and suppose that y\in\mathbb{R}. By definition of the upper bound it can be seen that (x\le y)\forall(y\in\mathbb{R}). Thus \sup\varnothing=-\infty.
The proof for \inf\varnothing=\infty can be followed by the same logic. The bounds property for the empty set is not an axiom, it is a theory which can be proved by the axioms of the bacis real number set.
I'm sorry about all that. I'm just an undergraduate at University of South Florida. My professor told me about the property of bounds on the empty set on Monday (September 12, 2005) so I decided to put it up. I don't really know anything about math or all that but I saw it wasn't in the article so I wanted to put it up. I can get a proof of the entire thing (if the one I redid above isn't right or is too short or something) from my professor. He'd be really happy to help I think. Sorry about it all again. ~Econ Schol
I am not questioning your proof. What I am wondering is about definitions. To me, talking about bounds of the empty set sounds strange. Also, the consequence of this, that is, sup may be less than inf may not be desirable. On the other hands, defining sup and inf for the empty set as well might prove to be useful in proof-writing (same idea as zero factorial). -- Taku 00:59, 18 September 2005 (UTC)

I've seen this used in measure theory. Your proof is flawed though, since "suppose x is in the empty set" is a contradiction and thus allows any conclusion. --MarSch 09:47, 25 October 2005 (UTC)

[edit] Bourbaki and Ø

It seems clear that the Ø symbol was introduced in Éléments de mathématique (Bourbaki, 1939). The question is how much background info to include in this article on Bourbaki as opposed to Ø. Of course, we should include the specific information (which was, by the way, previously missing) that the symbol was introduced in 1939. But what is the point of mentioning that Bourbaki was a group mostly French mathematicians of the 20th century, when this information is a click away and is common to everything else mentioning Bourbaki? That's the beauty of wikilinking. Otherwise, why not include the Axiom of empty set here? or even the definition of a subset? --Macrakis 00:00, 25 October 2005 (UTC)

[edit] Whoa there!

I just found this page, and I've removed the text:

  • The empty set is NOT 0.
    \varnothing ≠ 0

To the contrary, it is often useful to define 0 to be the empty set. Why was this italicized, bolded, in all caps, and at the top of the Properties section?! Melchoir 01:13, 15 December 2005 (UTC)

Upon browsing ths history, it looks like 80.179.80.156 did it. Sigh... Melchoir 01:15, 15 December 2005 (UTC)

[edit] Iit_bpd1962 comments: 29 April 2006

I differ in the semantics of: "The empty set is not the same thing as nothing"; it is a set with nothing inside it, and such a set exists, which is the starting statement of this article. That is has suppoting ZF logic axioms is not comforting since on questioning axioms of Logic as extant today is itself being questioned and if not then is must be questioned.

If one can show that the notion of nothing is indeed required in the argument which claims "nothin can exist", then "nothing exists" must be entertained as a TRUE statement. However, "noting exists" is itself self contradictory. It says, that there is something like the notion of nothing and that this notion of nothing exists.

Now imagine "nothing exists" as TRUE. Then it is claiming that In the universe there is a consciousness (and this is neccessary, otherwise "who", "what" is making this / observing to clain "nothing has benen cognized to exist?) Thus even if allow "nothing exists" to be a vlid allowable notion we a forced to also say that a cognizer is also present. But then "nothing exists" itself is false.

I thus must beleive, that such statements of THE null set not being nothing are in this sense FALSE. The null set is indeed the same thing as nothing, arrived at because consiousness as a pre-requisite for stateting any matters about existence was not takn into account. If it is further argued that there is a cognizer and the cogniser is the one stating that the null set exists and that the null set is indeed not nothing, then it follows that the null set has no elements. Then what is this cognizer entity, cognising? It is cognizing the null set having no elements. This is physically meaningless and is thus impossible. So, what is platonic paradigm being formed which itself uses reality, which may not itself subscribe completely to platonic notions. (see discrete and continous mathematics).

Such claims are arrived at through sheer inacceptence of a material world which is finite (and discrete) and required to advertise such claims in the fist place. So what is being indulged in is that simultaneously two notion are made which are contradicting each other. Lesson: all atomic axioms of a Logic system must acknowledge consciousness as a required cognising / advertising entity, which itself cannot be made "zero", for if it made zero then nothing can even be uttered, leave alone "established".

{This topic is to be shortly continued, in which a new atomic axiom set may be formed overriding many ZF, Russel's (new) non-paradox axioms will be examined and proven not be really axiomatic and in tune with consiousness)

[edit] symbol

Not sure whether it's an exclusively local problem, but the whole section about symbols doesn't render properly here (it looks like my browser substitutes a zero-with-slash glyph for the empty set codepoint). Would it make sense to include an image of what precisely the empty set symbol looked like when Bourbaki used it, and maybe tone down the rest of the section a bit to clarify that many people, of course, use slight variations of the Bourbaki symbol?

RandomP 06:17, 4 May 2006 (UTC)

[edit] "the"

Mathematicians speak of "the empty set" rather than "an empty set". In set theory, two sets are equal if they have the same elements; therefore there can be only one set with no elements.

But mathematicians also speak of "the trivial group", "the cyclic group of order n", and so on. There's certainly no harm in using the definite article for objects in a category with a trivial automorphism group.

I think this does make the above paragraph a bit misleading, at least.

RandomP 06:25, 4 May 2006 (UTC)

[edit] Pun

The great thing about mathematics is that it allows one to be upset over nothing.

^--That's really a pretty good one.

[edit] Tom McKay et al.

I recently made a rather long few posts on the discussion page for the article on set theory that raise some of the same questions as those discussed in the section on whether the empty set exists or is necessary. An author, Tom McKay, is mentioned and a page is given for his university, but I am having trouble finding the book mentioned in this article (no title is given, for one thing). If anyone knows the title of this book, and, even better, how I might go about obtaining a copy (I didn't see him in a search on Amazon, for example), I would greatly appreciate this. It might also be nice if someone included the title in the article.

To me, the empty set is not simply counter-intuitive; it seems illogical. If a set is defined as a group of elements, then something with no elements is, as Lowe apparently puts it, a non-set. Why can't this be so? Wouldn't Occam's Razor suggest that we eliminate "empty sets" from a theory and eliminate the distinction between membership in a set and being a subset of it? That an empty set is an element of every set makes it also an element of the complement of every set, so it is both within and outside of every set (if it even exists). This is a contradiction in terms.

We have, as far as I can see, simply assumed some "concept of the set" without clearly defining it. A bag is not a useful analogy here because it is a real object that has real properties, and thus can be approximated in a model by a set of all of its observable properties. There is no such thing as something with no observable properties. See the article on the thing in itself and its criticisms: it seems to me that the empty set shares a lot with it.

Furthermore, in what I've read the very notions of the set and of membership in sets have been described as intuitive anyway, so how can we even discuss their properties precisely without examining their origins first? We have forgotten to quantify, in real terms, the difference between membership in a set and being a subset of it except in terms of sets themselves, which are in turn defined by the properties of their members and subsets, et cetera. It looks like a circular definition that leads to the proposition of a thing whose only property is that it is that thing (i.e., something utterly indeterminate and inobservable).

I'd like to read about the alternative suggested by McKay, simply to see whether it is at all viable. If anyone knows it, please post the title of his book. Tastyummy 04:10, 23 August 2006 (UTC)

I don't know anything about McKay, but.... There are certainly many different ways to define mathematical concepts. The choice of standard definitions depends on many things: partly the accidents of history, partly aesthetic and stylistic considerations, but above all by what works well in mathematical practice. This is no place to give a whole summary of the history of set theory; suffice it to say that all standard set theories distinguish clearly between subsets and members, and include the/an empty set. If you have good evidence of a notable alternative (I don't know of one), discuss it here, but keep in mind that there are always fringe theories which are not notable in the WP sense.... For more on the history of mathematical concepts, you might want to read Imre Lakatos's great book Proofs and Refutations. Good luck in your mathematical explorations. --Macrakis 17:57, 24 August 2006 (UTC)

The reason I've asked for the title of this guy's book is that I'd like to see for myself whether it's "notable". I understand that it's considered a "fringe theory", but that doesn't mean I won't even glance at it. Of course I don't have any evidence for an alternative: but I'd like to at least consider what might be evidence, even if it's probably just some nobody making things up. I can't help but find the empty set illogical; I'll note here that I'm certainly not only investigating weird quasi-set theories, but that I am trying to learn about ZF set theory, etc., and that the only reason I'm looking into theories that claim not to make use of the empty set is that I can't yet see why it's necessary: I have to figure this out before I can move on. I still can't see what's wrong with Lowe's suggestion that we call things without elements "non-sets" instead of "empty sets", since a set is supposedly a group of elements. What would be lost in doing this? (I'm not saying nothing would-- I'm just saying that I don't yet know why the empty set is necessary.)
I am trying to learn mathematics from the bottom up, and if the definition of the empty set describes it both as a group of elements (a "set") and not a group of elements, it seems self-conradictory, and this is hindering my progress. I don't see how there can be a "group" of zero elements. In order to have a group, as I understand it, we must be able to categorise things according to their similarities and differences. What similarities are there between an utter lack of anything that can be conceived of as an "element" and anything else whatsoever? Again, why not just call some things sets and others (i.e., lacks of elements) non-sets? I don't mean within formal set theory as it stands; I mean in using mathematics as a model of reality. And if we are to consider all mathematical objects as sets, then why aren't elements to be considered as sets? This would make any element of something also a subset of it. Again, I know this isn't how any current set theories work: I'm just wondering why this must be so.
I'll certainly take a look at Proofs and Refutations, as you've suggested. Thanks for your attention and patience.

Tastyummy 00:53, 25 August 2006 (UTC)

Just because something "seems illogical" or "seems self-contradictory" to you or me is not terribly relevant; Wikipedia reports on what mathematics is, not what we think it should be. On the other hand, it is true that it would be valuable to explain the background and motivation of concepts, both historically and philosophically, but that is hard. Let's find some good sources (cf. Wikipedia:No original research).

You mention that you want to "learn mathematics from the bottom up". I'm afraid that is a bit of a chimera. The so-called foundations of mathematics claim to be logically prior to the rest of mathematics, but unlike the foundations of a building, they were actually created after much of the mathematics they are the foundations of. Better to start with mathematics 'in the middle' and work outwards to more abstraction.

Finally, a few quick substantive comments on your problems with the empty set. If you think it is illogical to talk of an empty set, how about the number zero? Numbers, after all, are supposed to count things. How can you count no things? Should zero be considered a non-number? Think about intersections of sets -- the set which represents what two other sets have in common. The intersection of {a,b} and {b,c} is {b}. What is the intersection of {a,b} and {c,d}? You could say it was undefined (like 1/0), but wouldn't it work better if you could treat the result as a full-fledged set, assuming you could do that in a consistent way (which you can)?

Good luck in your continued studies. Read Lakatos and you'll be ahead of most college students (and maybe even many professors of mathematics) in understanding how math really works -- what all those definitions and axioms and proofs do for you. --Macrakis 18:44, 25 August 2006 (UTC)

Thanks again for your attention. I wasn't suggesting that the articles on set theory be modified in any way to reflect that I personally am having problems with certain concepts in it-- I'm just trying to learn about those concepts; I agree that Wikipedia articles on mathematics should reflect accepted and current formulations, and I'm sorry if I gave the impression that this wasn't the case. The article is, as it stands, valuable and interesting.
As for the number zero: this, to me, is a much more tangible concept than the empty set. I have zero elephants in my apartment. But I disagree with the statement made by user:tezh when he was trying to explain the empty set to me that "the set of elephants in my apartment is empty": I disagree for the simple reason that, the way I see it, there simply is no set of elephants in my apartment. I'd say that two sets that share no elements simply don't intersect, rather than saying that their intersection "is" the empty set. Again, I don't see what's wrong with Lowe's statement that collections of elements are sets, while things that are not collections of elements are simply non-sets. I still can't see the problem with this. I do not understand how there can be a group of zero elements, even though I understand that the number zero is real and useful, because all that is left here is the "concept of being a group", which, to me, requires that there be members in the group. There would be no "concept of planets", for example, if there were no planets to speak of. For us to suggest that there must exist "a planet which is not made of matter and does not orbit any star, and which is not roughly spherical and whose path is extremely irregular" is clearly absurd: how is it not equally absurd to propose the existence of a collection of elements with no elements?
But again, I don't mean to imply that this article ought to be modified in any way. I'm just trying to learn for myself why this concept is really necessary. I will certainly begin reading the book you've suggested, and, again, thanks for your advice and for your time.
Tastyummy 19:55, 26 August 2006 (UTC)

It's not surprising that I thought that you wanted to modify the article, since the function of Wikipedia Talk pages is to discuss edits on the article. They are not the appropriate forum for background discussion of the concepts. You might try newsgroups like sci.math, though frankly I think you'll learn more from Lakatos. By the way, it is deceptively simple. Read it the first time without the footnotes -- it's a pretty easy read until the last chapter. Once you've understood that, then go back and read with the footnotes; amazing! --Macrakis 20:05, 26 August 2006 (UTC)

I'm not blaming you; I did definitely get off topic in the above discussion. But I did propose one change in my first post (that the actual title of McKay's book be added by someone who knows it, since the article currently only says that it's a "recent book" and it would be useful to actually know what book it is.)
Anyway, I apologise for wasting space; I just did the same thing on the talk page for set theory in general, and I realise it's not what they're for. I won't continue to do this.
Thanks again for your time and advice; I'll definitely look for a copy of Proofs and Refutations and begin it as soon as possible.
Tastyummy 22:04, 27 August 2006 (UTC)
THIS WEB:

aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - be - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - closed_zh_tw - co - cr - cs - csb - cu - cv - cy - da - de - diq - dv - dz - ee - el - eml - en - eo - es - et - eu - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gd - gl - glk - gn - got - gu - gv - ha - haw - he - hi - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mg - mh - mi - mk - ml - mn - mo - mr - ms - mt - mus - my - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - rm - rmy - rn - ro - roa_rup - roa_tara - ru - ru_sib - rw - sa - sc - scn - sco - sd - se - searchcom - sg - sh - si - simple - sk - sl - sm - sn - so - sq - sr - ss - st - su - sv - sw - ta - te - test - tet - tg - th - ti - tk - tl - tlh - tn - to - tokipona - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu

Static Wikipedia 2008 (no images)

aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -

Static Wikipedia 2007:

aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - be - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - closed_zh_tw - co - cr - cs - csb - cu - cv - cy - da - de - diq - dv - dz - ee - el - eml - en - eo - es - et - eu - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gd - gl - glk - gn - got - gu - gv - ha - haw - he - hi - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mg - mh - mi - mk - ml - mn - mo - mr - ms - mt - mus - my - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - rm - rmy - rn - ro - roa_rup - roa_tara - ru - ru_sib - rw - sa - sc - scn - sco - sd - se - searchcom - sg - sh - si - simple - sk - sl - sm - sn - so - sq - sr - ss - st - su - sv - sw - ta - te - test - tet - tg - th - ti - tk - tl - tlh - tn - to - tokipona - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu

Static Wikipedia 2006:

aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - be - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - closed_zh_tw - co - cr - cs - csb - cu - cv - cy - da - de - diq - dv - dz - ee - el - eml - en - eo - es - et - eu - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gd - gl - glk - gn - got - gu - gv - ha - haw - he - hi - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mg - mh - mi - mk - ml - mn - mo - mr - ms - mt - mus - my - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - rm - rmy - rn - ro - roa_rup - roa_tara - ru - ru_sib - rw - sa - sc - scn - sco - sd - se - searchcom - sg - sh - si - simple - sk - sl - sm - sn - so - sq - sr - ss - st - su - sv - sw - ta - te - test - tet - tg - th - ti - tk - tl - tlh - tn - to - tokipona - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu