Understanding Well-Ordered Sets: Definition & Discrepancies

  • Context: Graduate 
  • Thread starter Thread starter aleph-aleph
  • Start date Start date
  • Tags Tags
    Set
Click For Summary

Discussion Overview

The discussion revolves around the definition of well-ordered sets, exploring historical and contemporary interpretations. Participants examine discrepancies between Cantor's original definition and modern definitions, particularly regarding the concepts of "first element" and "least element." The conversation touches on theoretical aspects of set theory and the implications of including or excluding the null set.

Discussion Character

  • Debate/contested
  • Technical explanation
  • Conceptual clarification

Main Points Raised

  • Some participants reference Cantor's definition of a well-ordered set, noting that it includes the requirement for each subset to have a first element, which is not necessarily the least element.
  • Others argue about whether the null set should be included as a well-ordered set, with some advocating for its inclusion and others suggesting it should be excluded.
  • A participant points out that the set of negative integers can be considered well-ordered under certain interpretations, despite lacking a least element.
  • There is a call for clarification on the definitions of "first element" and "least element," with suggestions that these terms may have different meanings in historical versus modern contexts.
  • Some participants propose that Cantor's approach to well-ordered sets was more constructivist, focusing on the ability to list elements rather than relying on a predefined order relation.
  • Others emphasize that modern definitions require an order relation to determine whether a set is well-ordered, contrasting this with historical perspectives that may have treated sets as inherently ordered.
  • One participant notes that the notation for sets has evolved, indicating that earlier conventions viewed sets as ordered, whereas contemporary views treat them as unordered collections.

Areas of Agreement / Disagreement

Participants express differing views on the definitions and implications of well-ordered sets, particularly regarding the inclusion of the null set and the necessity of an order relation. There is no consensus on these issues, and the discussion remains unresolved.

Contextual Notes

Limitations include the ambiguity surrounding the definitions of "first element" and "least element," as well as the historical context of set theory that may influence interpretations. The discussion also highlights the evolution of notation and conventions in set theory.

aleph-aleph
Messages
17
Reaction score
0
I'm reading Cantor's 1883 Grundlagen, it says a set is well-ordered if the set and it's subsets have first element, the next successor (unless it's an empty set or there is no successor). Note that the first element not neccessarily a least element. "Theory of sets" by E. Kamke also give the same definition. However, "Naive Set Theory" by Paul Halmos and many other recent publications say the first element as smallest element. Why is it so?
 
Physics news on Phys.org
Do we want to define a well ordered set so that the null set is a well ordered set or do we want to exclude the null set?
 
Include the null set.
 
I am aware, from reading a few histories and philosophical articles on logic, that, for Cantor, choice was something natural, to be used freely without mention. Also, set theory of the time contained urelements and was not as mathematical as it became later.

A well-ordered set (of elephants, apples, sets, whatever) is such that each subset has a first element. I read "the first element is not necessarily the least element" to mean, a meaningful ordering of the elements is not required, we can supply one by choice alone.
 
aleph-aleph said:
Include the null set.

Then null set is a well ordered set that doesn't have a least element.
 
The set of negative integers is well-ordered (because it has a first element, -1, and each element i has a successor element i-1). But it does not have a least element.
 
aleph-aleph said:
I'm reading Cantor's 1883 Grundlagen, it says a set is well-ordered if the set and it's subsets have first element

If you (or Cantor) are making a distinction between the "first element" of a set and the "least element" of a set, you should define what is meant by the "first element".

The negative integers, under the usual order relation on the integers are not a well ordered set.
 
Stephen Tashi said:
you should define what is meant by the "first element".

A suitable definition (can't remember if Cantor used it) would be the unique element that is not the successor of any other element.

Stephen Tashi said:
you should define what is meant by the "first element".

It would also be helpful to understand what is meant by the "least element". In the set of negative integers (which is well ordered under the relation ≥) the "least element" (in the context of set theory) is -1, which is of course the element which is arithmetically the greatest.

Stephen Tashi said:
The negative integers, under the usual order relation on the integers are not a well ordered set.

The positive integers are not a well ordered set under the usual order relation on American Presidents, but I don't find that remarkable.

I think there is actually a fine distinction that is being missed here. I believe that Cantor approached sets from a constructivist point of view, so that his well-ordered sets were constructed from a first element and a successor function: a function that for any element ## k_i ## generates element ## k_{i+1} ##. Modern set theory approaches the definition from the "other end" - a set is already defined, and in order to detemine whether it is well ordered or not you need a relation to put the elements in order. It is interesting that the authors of this theory decided to use the terms "less than" and "least" to describe this relation rather than "before" and "first".
 
Cantor didn't define "first element" nor mention "least element" but I think I get what you guys are saying. This is what I get, there is no concept of "relation" to Cantor, for Cantor, "well ordered" kinda means "can be listed in such a way that it has first element". For example set of even number is well ordered because it can be listed as {2,4,6,8,...}, set of integer is well ordered because it can be listed as {0,1,-1,2,-2,...} and set of negative integer is well ordered because it can be listed as {-1,-2,-3,...}. Set of {...,3,2,1} is not well ordered because it has no first element (Kamke 1950). I checked, there is no concept of "relation" in Kamke's book "Theory of sets" but "Naive set theory" by Paul Halmos and modern literatures have the concept of "relation". So, it seems to me that by adding the concept of "relation" and for certain reason unknown to me, the definition of "well ordered" changed.
 
  • #10
aleph-aleph said:
Cantor didn't define "first element" nor mention "least element" but I think I get what you guys are saying. This is what I get, there is no concept of "relation" to Cantor, for Cantor, "well ordered" kinda means "can be listed in such a way that it has first element". For example set of even number is well ordered because it can be listed as {2,4,6,8,...}, set of integer is well ordered because it can be listed as {0,1,-1,2,-2,...} and set of negative integer is well ordered because it can be listed as {-1,-2,-3,...}. Set of {...,3,2,1} is not well ordered because it has no first element (Kamke 1950). I checked, there is no concept of "relation" in Kamke's book "Theory of sets" but "Naive set theory" by Paul Halmos and modern literatures have the concept of "relation". So, it seems to me that by adding the concept of "relation" and for certain reason unknown to me, the definition of "well ordered" changed.

The concept of well-order doesn't apply to sets. You need an order relation on your set in order to make sense of the concept well-order.

So the set of even numbers is not a well-order, since you did not yet specify the order relation. If you say, the set of even numbers equiped with the usual relation, then this is a well-order.
The set of integers under the usual order is not a well-order since it has no least element. However, if you make a special order as ##0<1<-1<2<-2<...##, then this special order is a well-order.

The Kamke reference basically says the same thing since it talks in the definition of well-order about "ordered sets" and not just "sets". The classic set theory book by Hausdorff does the same thing.

What has changed however is the meaning of the notation ##\{1,2,3,4\}##. Now, we regard the set ##\{1,2,3,4\}## to be completely equal to ##\{4,3,2,1\}##. So we just see it as a set.
But before, they considered the notation ##\{1,2,3,4\}## not only to denote a set, but rather an ordered set. So the notation meant that the set was ordered as ##1<2<3<4##. This is a convention that is not used anymore.

So both now and historically, to talk about an well-order, we need an ordered set and not just a set.
 
  • Like
Likes   Reactions: 1 person

Similar threads

Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 14 ·
Replies
14
Views
6K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K