Preface
I provided two answers to this question:
- This answer is the better answer and it suggests Mr. Fine is referring to naive set theory. Also, there is no great attempt at rigour here, and Mr. Fine simply jumps forward to his topic of interest. This answer is my primary answer.
I provided another answer in this same thread because the OP insisted on thinking of {A,A,A} as containing "three distinct elements" and posted a bounty. There was absolutely no convincing OP otherwise, so why not just agree and get the bounty? :)
The two answers actually complement each other since they show how one can describe the same mathematical phenomena by changing axioms, definitions, and rules in different places. You say TOE MAY TOE I say TOE MAH TOE. As it turns out, the other answer contains a cute "mathematical proof" that Mr. Fine thought {A, A, A} represents three distinct elements. It may be interesting to see how I defended such a proposition.
1. The Book is Referencing Naive Set Theory
The following Google Books link is easier to reference: The Number-system of Algebra: Treated Theoretically and Historically" (Henry Burchard Fine, Copyright 1890, Published 1907). The following is the excerpt in question from this 1907 book:
I. THE POSITIVE INTEGER AND THE LAWS WHICH REGULATE THE ADDITION AND MULTIPLICATION OF POSITIVE INTEGERS
1 Number.
We say of certain distinct things that they form a group (by group we mean finite group that is one which cannot be brought into one to one correspondence 2 with any part of itself) when we make them collectively a single object of our attention.
The number of things in a group is that property of the group which remains unchanged during every change in the group which does not destroy the separateness of the things from one another or their common separateness from all other things.
Such changes may be changes in the characteristics of the things or in their arrangement within the group. Again changes of arrangement may be changes either in the order of the things or in the manner in which they are associated with one another in smaller groups.
We may therefore say: The number of things in any group of distinct things is independent of the characters of these things of the order in which they may be arranged in the group and of the manner in which they may be associated with one another in smaller groups.
2 Numerical Equality. The number of things in any two groups of distinct things is the same when for each thing in the first group there is one in the second and reciprocally for each thing in the second group one in the first. Thus the number of letters in the two groups A, B, C; D, E, F, is the same... [Mr. Fine continues to talk about 1-to-1 correspondance - CoolHandLouis]...
It is clear to anyone who takes a beginning-level "Set Theory 101" class that this book is describing the foundation of set theory. We can confidently say that Mr. Fine's references to a "group" is exactly and precisely what is now known as a "set", and to "elements" when he was describing "distinct things". (As an aside, this entire post actually refers to what is called "Naive Set Theory", but that is inconsequential for this question/answer.)
Given that Mr. Fine is referring to Set Theory, and his book was written in 1907, my first suggestion is that you forget about Mr. Fine completely and google for some good references for beginner "set theory" and also look at some of the short videos on the same subject.
Mr. Fine's footnote "By group we mean finite group that is one which cannot be brought into one to one correspondence with any part of itself" is very strong evidence he's talking about (naive) set theory. He's obviously avoiding infinite sets, and based on the history of Set Theory, that may have been for political reasons. There's no reason for him to be contentious at that point in his career, and every reason to play it safe, especially with this book.
But that's a meta-answer. Here's a real answer:
2. Answer to Question - Intro
First lets standardize the rest of this post's language to the 21st century: A set is a collection of distinct elements. So let's not talk of "things" or "groups" anymore. And it matters not if they are concrete or abstract, real or imagined.
Changing the names for these terms does not in any way change any of the issues you are encountering. The new words refer to exactly the same thing Mr. Fine was saying. It's all a matter of definition, and I'll define everything as we go to show you the difference that is causing confusion.
3. How You Are Looking At "Distinct" and "Counting"
First, in one way, you are right. Within your own personal understanding/belief-system/definitions of "distinct", "collection", "set of things" and "group", and how one deals with them, you are "concluding" that "you are right". And neither I nor any mathematician can argue against your "right-ness" in this sense. Based on your definitions and methods of thinking, you are absolutely right. But that's just a start; That doesn't solve the confusion.
Let's make-up/invent a system in which you are "right". (Remember that we could just as well say "groups" and "things" but I'm standardizing to "sets" and "elements". The words used don't make any difference as long as we define them.)
Non-Standard Set Theory Rules According to Original Poster
- A set is a collection of elements.
- Each element is represented by one or more symbols (alphanumeric).
- The size of the set is the total number of elements.
- OP's Definition of Distinct: Each element is considered "distinct" if it appears in a different position, so {A, A} contains two distinct elements because they are in different positions (position one and position two).
Question: How many elements are there in {A, A, A} according to the above non-standard rules by Original Poster? Answer: 3.
4. How Math Set Theory (Mr. Fine's Book) Defines "Distinct" and "Counting"
Now let's consider this more from the standard mathematical definition.
Standard Mathematical Set Theory Rules
- A set is a collection of distinct elements.
- Each element is represented by one or more symbols.
- The size of a set is the total number of elements.
- Set Theory Definition of Distinct: Each element is considered "distinct" if it can be determined to be different than all other elements. When represented by letters and words, the only concern for distinctness is whether or not elements have different names. In written math, distinct = different names.
For the purpose of this answer, something named the same is not distinct - it refers to the same thing. So {A, A} is like saying, {India, India}. It's only referring to one country, not two countries. It's referring to the same country two times. So which is the count? The one country, or the two times it's mentioned? In set theory, it's the former.
"But why?" you might ask. In a way, you can think of this as completely arbitrary. "It's by definition." (But it's that way for a good reason; it makes a lot of other things in set theory work out well, but that's beyond this discussion). So you just have to accept it, just like "we have to accept that you are right with your definition".
Question: How many distinct countries are there in {France, France, France, France, India, India, India, Brazil, Brazil}?
Answer: 3 because the set is just referring to three distinct places = {France, India, Brazil}.
5. Coins in Your Pocket
It is for this reason and the sake of simplicity that we simply add another rule to Set Theory:
- No duplicates are allowed in sets.
Why? Because a set is kind of like a "bag of things" (concrete or abstract). For example, let's consider four coins in your left pocket on Monday. Let's say we don't know what they are. So we name them C1, C2, C3, C4.
- Monday_InLeftPocket_AllCoins = {C1, C2, C3, C4}
Given this idea, it makes no sense to refer to this as {C1, C1, C1, C2, C3, C4}. Why refer to the first coin three times? It's already in your pocket. It only needs to be referred to once. Now let's assign some attributes to the coins:
- C1 = Type=Penny; FaceValue=0.01; Date=1999; Weight = 2.4993399494 g; Condition=Mint
- C2 = Type=Penny; FaceValue=0.01; Date=1999; Weight = 2.4990044384 g; Condition=Good
- C3 = Type=Nickle; FaceValue=0.05; Date=2002; Weight = 5.0002292833 g; Condition=Very Good
- C4 = Type=Nickle; FaceValue=0.05; Date=2003; Weight = 5.0010022229 g; Condition=Very Good
Now that we know two of them are pennies, the set of coins in your pocket is still the same:
- Monday_InLeftPocket_AllCoins = {C1, C2, C3, C4}
But now we can ask about how many different (distinct) types of coins are in your pocket:
- Monday_InLeftPocket_TypesOfCoins = {Penny, Nickle}
Let's move coins C2, C3, and C4 to your right pocket on Tuesday. What's in your pockets on Wednesday?
- Wednesday_InLeftPocket_AllCoins = {C1}
Wednesday_InLeftPocket_TypesOfCoins = {Penny}
Wednesday_InRightPocket_AllCoins = {C2, C3, C4}
- Wednesday_InRightPocket_TypesOfCoins = {Penny, Nickle}