Skip to main content

All Questions

0 votes
1 answer
47 views

not precisely understanding what is asked by ex 3.5.13 Tao Analysis I (only one natural number system)

I am failing to understand the intent of the question posed by exercise 3.5.13 of Tao's Analysis I 4th ed. The purpose of this exercise is to show that there is essentially only one version of the ...
Penelope's user avatar
  • 3,325
0 votes
0 answers
94 views

Rigorous proof that cardinality of a disjoint union is the sum of cardinalities for finite sets

In a lot of books there are intuitive(but sort of hand wavy) proofs for finite, disjoint sets $A$ and $B$ that $$ |A \cup B| = |A| + |B| $$ since $A = \{a_1,a_2,a_3,\cdots,a_{|A|}\}$ and $B = \{b_1,...
MathCat's user avatar
0 votes
1 answer
82 views

Are the axioms of analysis a combination of Peano axioms and set theory axioms?

Observing the use of mathematical induction in proving the finite version of the axiom of choice, I began to ponder. Why is mathematical induction from Peano axioms employed to prove facts about sets? ...
ju so's user avatar
  • 297
-1 votes
2 answers
110 views

Applying Peano Axioms to Subsets of Natural Numbers [duplicate]

Concise Question Is it possible to apply the Peano axioms to subsets of the natural numbers and thus define arithmetic operations on those subsets strictly in terms of those subsets? If so, is it also ...
MonkeyWithDarts's user avatar
0 votes
2 answers
306 views

How to prove that there are $n$ natural numbers that are less or equal than $n$ and what properties are allowed to use in induction.

Let $n \in \mathbf{N}$. I wondered how to prove that there are exactly $n$ natural numbers that are smaller or equal than $n$. This seems somewhat circular which confuses me. I guess the way to do ...
MaxH's user avatar
  • 389
1 vote
1 answer
55 views

Finiteness, finite sets and representing its elements.

A set $S$ is called finite if there exists a bijection from $S$ to $\{1,...,n\}$ for one $n \in \mathbf{N}$. It is then common to write its elements as $s_1,...,s_n$. I now wonder, why this is ...
MaxH's user avatar
  • 389
0 votes
3 answers
258 views

Can the natural numbers contain an element that is not representable by a number?

I read the following document: https://www.math.wustl.edu/~freiwald/310peanof.pdf . In this document, the author wants to formalize that natural numbers, that are informally thought of as a collection ...
MaxH's user avatar
  • 389
2 votes
1 answer
205 views

Peano Axioms and modeling sets.

I am assuming the standard Peano-Axioms, which can be found here https://en.wikipedia.org/wiki/Peano_axioms under "Formulation". Does one assume that a set of objects called $\mathbf{N}$ ...
MaxH's user avatar
  • 389
1 vote
1 answer
103 views

How to construct a partial ordering from Peano's 5 Axioms?

I am trying to formally construct the usual partial ordering LTE from Peano's 5 Axioms. Would the following construction work? $$\forall a,b: [(a,b)\in LTE \iff(a,b)\in N^2$$ $$\land ~ \forall c\...
Dan Christensen's user avatar
0 votes
1 answer
149 views

$\pi$ is isomorphism from one Peano system $(N, S, e)$ to another $(N', S', e')$, then $\pi^{-1}$ is isomorphism from $(N', S', e')$ to $(N, S, e)$

This is an exercise from Cunningham's book "Set Theory: A First Course". Theorem: Let $(N, S, e)$ and $(N', S', e')$ be Peano systems. Let $\pi$ be an isomorphism from $(N, S, e)$ onto $(N', ...
anfauglit's user avatar
  • 366
1 vote
1 answer
141 views

Proof critique of least number principle, please!

I am independently working through Elliot Mendelson's "Number Systems and the Foundations of Analysis," which I find very well-written and rigorous, along with providing a healthy set of ...
Cyrus's user avatar
  • 368
2 votes
1 answer
418 views

Prove: if $m \in n$ then $m^+ \subseteq n$.

The following is exercise 5(d), section 6.2, from A book of set theory, by Charles Pinter (pg. 122). 5. Prove the following, where $m, n, p \in \omega$. d) If $m \in n$, then $m^+ \subseteq n$. ...
user avatar
3 votes
0 answers
302 views

Show that $(P,S,1)$ is a Peano system if and only if it satisfies the Iteration Theorem

You can skip the first section(hints and useful things) if you want, I will keep editing this along I got more findings related to the question. Hints and useful things: I find out that the book from ...
Paulo Henrique L. Amorim's user avatar
1 vote
1 answer
216 views

How to show that a triple $(P, S, 1)$ constitutes a Peano System?

Mendelson (in Number Systems & the Foundations of Analysis) defines a Peano System as a triple $(P, S, 1)$ consisting of a set $P$, a distinguished element $1 \in P$, and a singulary operation $S :...
Hugo's user avatar
  • 260
2 votes
1 answer
220 views

Determine whether or not the following structure $(P,S,1)$ is a Peano System

First this is how the book define as a Peano System. By a Peano System we mean a set $P$, a particular element $1$ in $P$, and a singulary operation $S$ on $P$ such that the following axioms are ...
Paulo Henrique L. Amorim's user avatar

15 30 50 per page