March 20, 2026
Kuina-chan
“Kuina-chan’s Math” Lesson 2 explains the basics of mathematics and the flow of proof through “



”! It is assumed you have read Lesson 1.




”! It is assumed you have read Lesson 1.Lesson 1 explained the basic rules of mathematics.
This time, we will prove “



” from concrete axioms. But before that, I would like to explain the most fundamental element of mathematics, the “Set”. In mathematics, basically everything, starting with numbers like “



”, is considered to be made of “Sets”.




” from concrete axioms. But before that, I would like to explain the most fundamental element of mathematics, the “Set”. In mathematics, basically everything, starting with numbers like “



”, is considered to be made of “Sets”.1.Naive Set Theory
1.1Sets and Elements
A “Set” is a “collection of several things”. “Several things” is vague, but historically, sets started from such a vague understanding. Eventually, it will be defined rigorously.
Also, these “several things” are called “Elements”. And when an element
is inside a set
, we say that element
“belongs to” set
and write “

”.
is inside a set
, we say that element
“belongs to” set
and write “

”.
In this figure, element
belongs to set
, so it is “

”. On the other hand, element
and element
do not belong to set
, and in such cases where they do not belong, we write “

” and “

”.
belongs to set
, so it is “

”. On the other hand, element
and element
do not belong to set
, and in such cases where they do not belong, we write “

” and “

”.1.2Extensional and Intensional Notation
There are two ways to express what elements belong to a set. They are “Extensional Notation” and “Intensional Notation”.
“Extensional Notation” is a method of listing the elements that belong to the set. For example, when elements “Dog”, “Cat”, and “Rabbit” belong to set
, in extensional notation we write “

Dog
Cat
Rabbit
”.
, in extensional notation we write “

Dog
Cat
Rabbit
”.“Intensional Notation” is a method of describing the properties of the elements. For example, when all animals belong to set
, in intensional notation we write “




is an animal
”. Here we used the symbol
, but you can use any symbol and write “
symbol
condition using the symbol
”, which means the set of all things that satisfy that condition.
, in intensional notation we write “




is an animal
”. Here we used the symbol
, but you can use any symbol and write “
symbol
condition using the symbol
”, which means the set of all things that satisfy that condition.You can use either extensional notation or intensional notation, and the one that can be expressed more concisely is used.
1.3Subset and Equality
Next, let’s explain the relationship between sets. For example, if “

Dog
Cat
Rabbit
” and “

Dog
Cat
”, all elements of
are elements of
. In this case, we say set
is “contained in” set
(or is a subset of
) and write “

”.


Dog
Cat
Rabbit
” and “

Dog
Cat
”, all elements of
are elements of
. In this case, we say set
is “contained in” set
(or is a subset of
) and write “

”.“Belongs to (
)” and “Contained in (
)” look similar in symbol and meaning, but you need to be careful not to confuse them. “Belongs to” is the relationship between an element and a set, while “Contained in” is the relationship between sets.
)” and “Contained in (
)” look similar in symbol and meaning, but you need to be careful not to confuse them. “Belongs to” is the relationship between an element and a set, while “Contained in” is the relationship between sets.Note
Since almost everything is treated as a set in modern mathematics, generally elements of a set are also sets, so the distinction between “belongs to” and “contained in” is complicated. “Set Y belongs to Set X” means that Set Y is one of the elements of Set X, while “Set Y is contained in Set X” means that all elements of Set Y appear in the elements of Set X.
Also, when all elements match between set
and set
, we say set
and set
are “equal” and write “

”. If they are not equal, we write “

”. The order of elements in a set does not matter, and duplicate elements are considered as one. That is, if “

Dog
Cat
Rabbit
” and “

Rabbit
Cat
Dog
Dog
Dog
”, then “

” holds true.
and set
, we say set
and set
are “equal” and write “

”. If they are not equal, we write “

”. The order of elements in a set does not matter, and duplicate elements are considered as one. That is, if “

Dog
Cat
Rabbit
” and “

Rabbit
Cat
Dog
Dog
Dog
”, then “

” holds true.The symbols “
” and “
” are also used when comparing elements. If element
and element
are the same thing, we write “

”, and if they are different, we write “

”.
” and “
” are also used when comparing elements. If element
and element
are the same thing, we write “

”, and if they are different, we write “

”.1.4Sets of Sets
Now, we can also consider “a set whose elements are sets”. For example, a set with “Dog” as an element is “
Dog
”, but a set with this set as an element is “
Dog
”.
Dog
”, but a set with this set as an element is “
Dog
”.For example, if “Set 


Dog

Cat
”, “Set 


Dog
”, and “Set 

Dog
”, then “

” and “

”. Please pay attention to whether it is a relationship between an element and a set, or a relationship between sets.



Dog

Cat
”, “Set 


Dog
”, and “Set 

Dog
”, then “

” and “

”. Please pay attention to whether it is a relationship between an element and a set, or a relationship between sets.1.5Union and Intersection
In the explanation of propositions in Lesson 1, we explained “or (
)” and “and (
)”, and sets have similar things. For sets, “or” is represented by the symbol “
”, and “and” is represented by the symbol “
”. For set
and
, we write like “

” and “

”.
)” and “and (
)”, and sets have similar things. For sets, “or” is represented by the symbol “
”, and “and” is represented by the symbol “
”. For set
and
, we write like “

” and “

”.For example, let’s define set
collecting “sweet things” as “

Honey
Sugar
Grapefruit
”, and set
collecting “sour things” as “

Vinegar
Lemon
Grapefruit
”. In this case, “sweet things or sour things” becomes “



Honey
Sugar
Grapefruit
Vinegar
Lemon
”, and “sweet things and sour things” becomes “



Grapefruit
”.
collecting “sweet things” as “

Honey
Sugar
Grapefruit
”, and set
collecting “sour things” as “

Vinegar
Lemon
Grapefruit
”. In this case, “sweet things or sour things” becomes “



Honey
Sugar
Grapefruit
Vinegar
Lemon
”, and “sweet things and sour things” becomes “



Grapefruit
”.In other words, “
” can be said to be something that combines sets, and “
” can be said to be something that extracts the common part of sets.
” can be said to be something that combines sets, and “
” can be said to be something that extracts the common part of sets.1.6Empty Set
A set with no elements exists and is called the “Empty Set”, represented by the symbol “
”. For example, when there are no elements in set
, it is “

”. This symbol resembles the Greek letter “
(phi)”, but it is a different symbol.
”. For example, when there are no elements in set
, it is “

”. This symbol resembles the Greek letter “
(phi)”, but it is a different symbol.“
” and “

” are different sets. “
” is a set with no elements, but “

” is a set that has “
” as an element.
” and “

” are different sets. “
” is a set with no elements, but “

” is a set that has “
” as an element.2.Natural Numbers
Now then, in order to prove “



”, let’s define “Natural Numbers” using sets.




”, let’s define “Natural Numbers” using sets.“Natural Numbers” are a series of numbers continuing endlessly like “









”. Whether to include “
” in natural numbers depends on the school of thought. In modern mathematics, it is often included, but in the field of number theory, the proviso “except
” appears frequently, so it is often not included. This time, we will include it.










”. Whether to include “
” in natural numbers depends on the school of thought. In modern mathematics, it is often included, but in the field of number theory, the proviso “except
” appears frequently, so it is often not included. This time, we will include it.Let’s define the set of all natural numbers
. For the definition of
, it might seem sufficient to say, for example, “













”. However, this relies on the premise that we know it continues as “





” next, so it cannot be called a rigorous definition. Therefore, this time, we will adopt what is called the “Peano Axioms” as the definition of natural numbers.
. For the definition of
, it might seem sufficient to say, for example, “













”. However, this relies on the premise that we know it continues as “





” next, so it cannot be called a rigorous definition. Therefore, this time, we will adopt what is called the “Peano Axioms” as the definition of natural numbers.According to the “Peano Axioms”, “Natural Numbers” are things that satisfy the following structure.
- “
” is a natural number. - If “
” is a natural number, then the “successor of
” is also a natural number. - When “
” and “
” are equal natural numbers, and only then, the “successor of
” and the “successor of
” are equal natural numbers. - There is no natural number whose “successor” is “
”. - Only those things determined by the above are natural numbers.
Breaking it down, starting from “
”, connecting endlessly like “the successor of
is
”, “the successor of
is
”, and having no branches or loops is what we call “Natural Numbers”. Illustrating the contents of (1) to (5) of this definition looks like the following.
”, connecting endlessly like “the successor of
is
”, “the successor of
is
”, and having no branches or loops is what we call “Natural Numbers”. Illustrating the contents of (1) to (5) of this definition looks like the following.
(3) and (4) eliminate branches and loops, and (5) eliminates sequences other than “





”. From this figure, you can see that it excludes other cases so that natural numbers become a single path like “







”.






”. From this figure, you can see that it excludes other cases so that natural numbers become a single path like “







”.Now, we consider everything that satisfies such a “structure” as natural numbers. The important point is not that “Natural Numbers” exist concretely, but that when something concrete has such a “structure”, we call it a natural number. By perceiving it this way, we can treat various things as natural numbers.
Then, let’s construct natural numbers using only sets. As explained at the beginning, sets are the basic elements of mathematics, so if we can construct the structure of natural numbers with just sets, natural numbers can also be treated as elements of mathematics.
For example, if we represent
as the empty set “
”, and for a number
, represent the successor as “

”, we can define “









” as “

”, “



”, “





”, “







”, “









”. This satisfies each condition of the Peano axioms. Therefore, we can say this is a natural number.
as the empty set “
”, and for a number
, represent the successor as “

”, we can define “









” as “

”, “



”, “





”, “







”, “









”. This satisfies each condition of the Peano axioms. Therefore, we can say this is a natural number.As another example, if we represent
as the empty set “
”, and for a number
, represent the successor as “



”, it goes like “

”, “













”, “























”, “(omitted)








”, “









”. This also satisfies the Peano axioms, so we can say this is a natural number too.
as the empty set “
”, and for a number
, represent the successor as “



”, it goes like “

”, “













”, “























”, “(omitted)








”, “









”. This also satisfies the Peano axioms, so we can say this is a natural number too.In this way, natural numbers can be constructed from sets in many ways. Specifically which method was used to construct natural numbers is not important, any method is fine as long as it satisfies the Peano axioms. Hereafter, we will represent the natural numbers constructed in this way as the set “













”.














”.3.Axiomatic Set Theory
3.1Russell’s Paradox
So far, we have proceeded with the talk somewhat intuitively, but strict logic reveals that handling sets intuitively like this collapses. One example of that is “Russell’s Paradox”. Russell’s Paradox is as follows.
First, consider the set “Words” collecting everything that is a word. In this case, “Words” itself is also a word, so it belongs to this set. That is, it becomes like “Words 
Dog
Apple
Words

”.

Dog
Apple
Words

”.Next, consider the set “Emojis” collecting everything that is an emoji. In this case, “Emojis” itself is not an emoji, so it does not belong to this set. That is, it becomes like “Emojis 








”.









”.Thinking this way, sets can be divided into two types: those like “Words” where “the set itself belongs to the set”, and those like “Emojis” where “the set itself does not belong to the set”.
Here, let’s consider the set collecting all “sets that do not belong to themselves”. Since “Emojis” was a “set that does not belong to itself”, it becomes “Set of sets not belonging to themselves 
Emojis

”. Now, does this set belong to itself? That is, does it become “Set of sets not belonging to themselves 
Emojis
Set of sets not belonging to themselves

”?

Emojis

”. Now, does this set belong to itself? That is, does it become “Set of sets not belonging to themselves 
Emojis
Set of sets not belonging to themselves

”?If we assume it belongs to itself, it is a “set that does not belong to itself” yet it belongs, so it is a contradiction. Also, if we assume it does not belong to itself, it satisfies the condition “set that does not belong to itself”, so it should belong to this set, which is also a contradiction.
As explained in Lesson 1, a proposition must be either true or false, so such a question cannot be a proposition. In other words, if we admit a set like “the set of all sets that do not belong to themselves”, it leads to a logical collapse.
3.2Axiomatic Set Theory
Therefore, a movement arose to define sets not by intuitive definitions like “a collection of things” but by “axioms” that rigorously determine what a set is. This is called “Axiomatic Set Theory”. The intuitive one is called “Naive Set Theory”.
4.Axioms of Addition
Now, finally, let’s prove “



”. To the natural numbers defined so far, we add the following axioms.




”. To the natural numbers defined so far, we add the following axioms.When 

are natural numbers,
However, for a natural number
, “
” represents “the successor of
”.
This is called the “Axioms of Addition”. Using this axiom, we can prove “



”. It is as follows.




”. It is as follows.- Hereafter, we transform “


” into “
”. - From the definition of natural numbers,







. (We defined “0′”, i.e., the successor of 0, as 1 in the definition of natural numbers.) - From Axiom of Addition 2, since










, 









. - From Axiom of Addition 1, since




, 









. - Since the successor of
is
, 




. - Therefore,




. (End of Proof)
Just by mechanically applying the axioms of addition, “
” is derived from “

”. Similarly, you can verify that “



”, “









”, etc. can be proved, so please try it.
” is derived from “

”. Similarly, you can verify that “



”, “









”, etc. can be proved, so please try it.This time, we defined natural numbers using sets and proved “



” using the axioms of addition. Next time, we will talk about various numbers including “integers” which include negative numbers in natural numbers!




” using the axioms of addition. Next time, we will talk about various numbers including “integers” which include negative numbers in natural numbers!
