Multitude: Difference between revisions
No edit summary |
mNo edit summary |
||
(6 intermediate revisions by the same user not shown) | |||
Line 6: | Line 6: | ||
== Counting == | == Counting == | ||
'''Counting''' is a process in which one identifies the multitude of a set, through iteratively identifying multitudes of its subsets. | '''Counting''' is a process in which one identifies the multitude of a set, through iteratively identifying multitudes of its subsets. | ||
=== Successor function === | |||
The '''successor function''' is a function which takes a numerical symbol, and returns the next one. [TODO this definition is circular, because what I mean by "the next one" is the one that successor returns.] For example, it takes a symbol such as "thirteen" (spoken or thought) or "13" (written) or "1101" (computer code), and returns "fourteen" or "14" or "1110." I will give a full specification of the successor function for numerical symbols. First we define it manually for some one-digit numerical symbols, | |||
{| class="wikitable" | |||
|+ | |||
!<math>n</math> | |||
!<math>\text{succ}(n)</math> | |||
|- | |||
|0 | |||
|1 | |||
|- | |||
|1 | |||
|2 | |||
|- | |||
|2 | |||
|3 | |||
|- | |||
|3 | |||
|4 | |||
|- | |||
|4 | |||
|5 | |||
|- | |||
|5 | |||
|6 | |||
|- | |||
|6 | |||
|7 | |||
|- | |||
|7 | |||
|8 | |||
|- | |||
|8 | |||
|9 | |||
|} | |||
then we may define it in general for a tuple <math>(n_1, n_2, \cdots, n_k) </math> of numerical symbols: <math display="block">\text{succ}(n_1, n_2, \cdots, n_k) := | |||
\begin{cases} | |||
(n_1, n_2, \cdots, \text{succ}(n_k) ), & n_k < 9 \\ | |||
(n_1, n_2, \cdots, \text{succ}(n_{k-1}), 0), & n_{k} = 9 \text{ and } n_{k-1} < 9\\ | |||
\cdots & \cdots \\ | |||
\underbrace{(1, 0, 0, \cdots, 0) }_{k+1 \text{ entries }}, & n_1 = n_2 = \cdots = n_k = 9 | |||
\end{cases}</math> | |||
<math>\text{succ}(N)</math> is called "the successor to <math>N</math>." | |||
=== Successor algorithm === | |||
'''Successor''' counting, or counting by increments of 1, is the counting process where the first subset contains 1 element, and each subsequent subset in the process contains the previous subset, and also 1 more element. Traditionally, this is the first counting method that a child learns; it is the one which, when spoken aloud, sounds like "one, two, three, four, five, … ." | |||
We may now specify, in more detail, how the successor counting algorithm works. | |||
focus on a set <math>S</math>, and keep it in mind | |||
focus on a subset <math>A \subset S</math> which initially contains a single element | |||
nextSound := "one" | |||
do: | |||
think or say the sound nextSound | |||
nextSound := succ(nextSound) | |||
add one extra element to <math>A</math>, if there are any left | |||
while <math>A \subsetneq S</math>. | |||
The last sound spoken/thought is the perceptual symbol for the count. | |||
Oftentimes, to keep track of the set <math>A</math>, one uses extra tools. For example, at each step of counting, one might point to a different object, and regard that object and all the objects to the left of it as belonging to the set <math>A</math>, and all the objects to the right of it as not belonging to <math>A</math>. | |||
=== Other examples of counting === | |||
* Counting by 5s, as in "zero, five, ten, fifteen, twenty, … ." | |||
* Doing the successor counting algorithm, but instead of counting the whole set, you stop after "five." | |||
* Counting backwards, as in "ten, nine, eight, seven, six, five, four, three, two, one, blast-off!" | |||
* Counting using [[fractions]], as in "1/3, 2/3, 1, 4/3, 5/3, 2, … ." | |||
* Counting using [[integers]], as in "3, 2, 1, 0, -1, -2, -3, … ." | |||
* Counting using the hexadecimal numbers, as in "1c, 1d, 1e, 1f, 20, 21, … ." | |||
* Counting by keeping track of the count using one's fingers rather than auditory symbols. | |||
Borderline examples: | |||
* "Counting" by using tally marks. | |||
Non-examples | |||
* "Counting" the candies in a rectangular jar by counting the number of candies along its height, width, and length, then multiplying the three quantities together. | |||
== Specific natural numbers == | == Specific natural numbers == | ||
Multitude can be divided up into sub-concepts such as "1," "12," and "73." | A '''natural number''' is "an identification of a quantity by means of a symbol whose position in a fixed sequence of those symbols is the same amount as what you are identifying."<ref>Harry Binswanger (in an answer to a question, in his 2024 class on philosophy of mathematics).</ref> | ||
Multitude can be divided up into sub-concepts such as "1," "12," and "73." These subconcepts are known as natural numbers. The definitions of the natural numbers are as follows: | |||
'''0''' is the multitude of [[Set#Empty set|an empty set]]. | |||
'''1''' is the multitude of a set containing only a unit. | |||
'''2''' is the [[Multitude#Successor|successor]] to 1. | |||
4 is the | '''3''' is the successor to 2. | ||
'''4''' is the successor to 3. | |||
Etc. | Etc. | ||
Whether or not 0 is to be considered a natural number is optional. In most contexts, I will not consider 0 to be a natural number. Symbolically, I will use the symbol <math>\mathbb{N}</math> to denote nonzero natural numbers, and <math>\mathbb{N} \sqcup \{0\} </math> or <math>\mathbb{Z}_{\geq 0}</math> to denote natural numbers including zero. | |||
=== Examples === | |||
<gallery> | |||
File:Cat_outside.jpg|1 cat. | |||
File:Airbus_A380.jpg|4 engines. | |||
</gallery> | |||
== Addition == | == Addition == | ||
''' | In the context of natural numbers, '''addition''' is a process in which one identifies the multitude of a [[Set#Disjoint union|disjoint union]], based his knowledge of the multitudes of its summands. (By the ''summands'' of a disjoint union <math>A \sqcup B</math>, I mean the set <math>A </math> and the set <math>B</math>.) [TODO a problem with this definition is it doesn't work in all contexts. Doesn't include addition of integers, of fractions, of vectors, etc.] | ||
== Multiplication == | == Multiplication == | ||
''' | In the context of natural numbers, '''multiplication''' is a process in which one identifies the multitude of a [[Sets#Cartesian product|cartesian product]], based on his knowledge of the multitudes of its summands. (By the ''summands'' of a cartesian product <math>A \times B</math>, I mean the set <math>A </math> and the set <math>B</math>.) [TODO a problem with this definition is it doesn't work in all contexts. Doesn't include multiplication of integers, of fractions, of matrices, etc.] | ||
== References == |
Latest revision as of 01:34, 10 March 2025
Multitude is the quantity of a finite set. [TODO maybe circular because what do I mean by finite set?] Synonyms for multitude are natural number, whole quantity, cardinality, and the symbol ; though all those concepts have different shades of meaning, Objective Mathematics uses them interchangeably.
Comparison
"Few" and "many" describe relative multitudes.
Counting
Counting is a process in which one identifies the multitude of a set, through iteratively identifying multitudes of its subsets.
Successor function
The successor function is a function which takes a numerical symbol, and returns the next one. [TODO this definition is circular, because what I mean by "the next one" is the one that successor returns.] For example, it takes a symbol such as "thirteen" (spoken or thought) or "13" (written) or "1101" (computer code), and returns "fourteen" or "14" or "1110." I will give a full specification of the successor function for numerical symbols. First we define it manually for some one-digit numerical symbols,
0 | 1 |
1 | 2 |
2 | 3 |
3 | 4 |
4 | 5 |
5 | 6 |
6 | 7 |
7 | 8 |
8 | 9 |
then we may define it in general for a tuple of numerical symbols:
is called "the successor to ."
Successor algorithm
Successor counting, or counting by increments of 1, is the counting process where the first subset contains 1 element, and each subsequent subset in the process contains the previous subset, and also 1 more element. Traditionally, this is the first counting method that a child learns; it is the one which, when spoken aloud, sounds like "one, two, three, four, five, … ."
We may now specify, in more detail, how the successor counting algorithm works.
focus on a set , and keep it in mind focus on a subset which initially contains a single element nextSound := "one" do: think or say the sound nextSound nextSound := succ(nextSound) add one extra element to , if there are any left while . The last sound spoken/thought is the perceptual symbol for the count.
Oftentimes, to keep track of the set , one uses extra tools. For example, at each step of counting, one might point to a different object, and regard that object and all the objects to the left of it as belonging to the set , and all the objects to the right of it as not belonging to .
Other examples of counting
- Counting by 5s, as in "zero, five, ten, fifteen, twenty, … ."
- Doing the successor counting algorithm, but instead of counting the whole set, you stop after "five."
- Counting backwards, as in "ten, nine, eight, seven, six, five, four, three, two, one, blast-off!"
- Counting using fractions, as in "1/3, 2/3, 1, 4/3, 5/3, 2, … ."
- Counting using integers, as in "3, 2, 1, 0, -1, -2, -3, … ."
- Counting using the hexadecimal numbers, as in "1c, 1d, 1e, 1f, 20, 21, … ."
- Counting by keeping track of the count using one's fingers rather than auditory symbols.
Borderline examples:
- "Counting" by using tally marks.
Non-examples
- "Counting" the candies in a rectangular jar by counting the number of candies along its height, width, and length, then multiplying the three quantities together.
Specific natural numbers
A natural number is "an identification of a quantity by means of a symbol whose position in a fixed sequence of those symbols is the same amount as what you are identifying."[1]
Multitude can be divided up into sub-concepts such as "1," "12," and "73." These subconcepts are known as natural numbers. The definitions of the natural numbers are as follows:
0 is the multitude of an empty set.
1 is the multitude of a set containing only a unit.
2 is the successor to 1.
3 is the successor to 2.
4 is the successor to 3.
Etc.
Whether or not 0 is to be considered a natural number is optional. In most contexts, I will not consider 0 to be a natural number. Symbolically, I will use the symbol to denote nonzero natural numbers, and or to denote natural numbers including zero.
Examples
-
1 cat.
-
4 engines.
Addition
In the context of natural numbers, addition is a process in which one identifies the multitude of a disjoint union, based his knowledge of the multitudes of its summands. (By the summands of a disjoint union , I mean the set and the set .) [TODO a problem with this definition is it doesn't work in all contexts. Doesn't include addition of integers, of fractions, of vectors, etc.]
Multiplication
In the context of natural numbers, multiplication is a process in which one identifies the multitude of a cartesian product, based on his knowledge of the multitudes of its summands. (By the summands of a cartesian product , I mean the set and the set .) [TODO a problem with this definition is it doesn't work in all contexts. Doesn't include multiplication of integers, of fractions, of matrices, etc.]
References
- ↑ Harry Binswanger (in an answer to a question, in his 2024 class on philosophy of mathematics).