Bloch theorem 1.4.6: why S ⊆ ℕ from the definition

7 replies · 3K views · last reply
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Ethan D. Bloch's book: The Real Numbers and Real Analysis ...

I am currently focused on Section 1.4: Entry 2: Axioms for the Integers ... In this section Bloch defines the integers as an ordered integral domain that satisfies the Well Ordering Principle ... rather than defining the integers via the natural numbers ...

I need help/clarification with an aspect of Theorem 1.4.6 ...

Theorem 1.4.6 and the start of the proof reads as follows:
Scanned page of a textbook: Theorem 1.4.6 stating no integer y lies strictly between x and x+1, followed by its proof by contradiction using the Well-Ordering Principle and the set S of integers between 0 and 1.
In the above proof ... near the start of the proof, we read the following:

" ... ... From the definition of ##\mathbb{N}##, we observe that ##S \subseteq \mathbb{N}##. ... ..."Question: What exactly is the reasoning that allows us to conclude that ##S \subseteq \mathbb{N}## from the definition on ##\mathbb{N}## ... "The above theorem is in the section where Bloch defines the integers as an ordered integral domain that satisfies the Well Ordering Principle... ... as follows:
Screenshot of a textbook page: Definition 1.4.3 of the Well-Ordering Principle for an ordered integral domain R, with the set {x in R | x > 0}, and Axiom 1.4.4 stating that an ordered integral domain Z satisfies the Well-Ordering Principle.

The definition of the natural numbers is mentioned above ... Bloch's definition is as follows ...
Scanned textbook page showing Axiom 1.2.1 (Peano Postulates) with parts a, b and c, followed by a paragraph and Definition 1.2.2 defining the natural numbers as the set given by the Peano Postulates.
Hope someone can help,

Peter
 
Attachments
  • Printed page from a textbook showing Theorem 1.4.6 that no integer y lies strictly between x and x+1, followed by its proof with equations and a closing square symbol.
    Bloch - Theorem 1.4.6 ... ....png
    50.9 KB · Views: 663
  • Screenshot of a textbook page: Definition 1.4.3 defines the Well-Ordering Principle for an ordered integral domain R as every non-empty subset of {x in R | x > 0} having a least element; Axiom 1.4.4 says an ordered integral domain Z satisfying the Well-Ordering Principle exists.
    Bloch - Axioms for Integers and Well Ordering ....png
    17.2 KB · Views: 555
  • Screenshot of a textbook page showing Axiom 1.2.1 (Peano Postulates) with parts a to c, followed by Definition 1.2.2 defining the natural numbers as the set given by the Peano Postulates.
    Bloch - Peano Postulates and Defn of the Natural Numbers ... ....png
    27.2 KB · Views: 548
Maybe I shouldn't answer my own questions ... but maybe I am worrying too much over a trivial point ... ... maybe the reasoning is simply ... as follows ...since ##S## is a set made up of positive integers then it is a subset of ##\mathbb{N}## ... is it as simple as that ..?

My apologies if it is that simple ...

Peter
 
Math Amateur said:
Maybe I shouldn't answer my own questions ... but maybe I am worrying too much over a trivial point ... ... maybe the reasoning is simply ... as follows ...since ##S## is a set made up of positive integers then it is a subset of ##\mathbb{N}## ... is it as simple as that ..?

My apologies if it is that simple ...

Peter
As I read it, yes. However, I do not see immediately from the Peano axiom how the natural numbers are all positive, but this depends on the definition of the order as well. So somewhere between 1.2.1. and 1.4.6. the author should have shown (or defined), that natural numbers are positive.
 
  • Like
Likes   Reactions: Math Amateur
fresh_42 said:
As I read it, yes. However, I do not see immediately from the Peano axiom how the natural numbers are all positive, but this depends on the definition of the order as well. So somewhere between 1.2.1. and 1.4.6. the author should have shown (or defined), that natural numbers are positive.
Thanks fresh_42 ... indeed my problem was how to derive ##S \subseteq \mathbb{N}## ... but got confused (with Bloch's help ... :frown: ...)

To explain ...

Bloch investigates two approaches to defining/constructing the integers as he describes here ...

Printed page with the heading 1.4 Entry 2: Axioms for the Integers, followed by a paragraph comparing two approaches to defining the integers: the Peano Postulates route and the ordered integral domain route.
In Section 1.4, where Theorem 1.4.6 occurs, Bloch is expounding the ordered integral domain approach to the integers ... so we should not go back to the Peano Postulates as I did - that is his approach number 1 ... under the second approach, the ordered integral domain approach, the Peano Postulates/Axioms become a theorem and are proved ...

Actually when we meet ##\mathbb{N}## in the proof of Theorem 1.4.6 Bloch has not defined ##\mathbb{N}## yet in this approach ... he does so after presenting Theorem 1.4.6 as follows:

Text page showing Definition 1.4.7: x in Z is positive if x > 0 and negative if x < 0; N is the set {x in Z | x > 0}; then Z = -N union {0} union N, with the three sets pairwise disjoint.


Interestingly as Evgeny Makarov has pointed out in the Math Help Forum, the claim ##S \subseteq \mathbb{N}## seems unnecessary for the rest of the proof ...

Peter
 
Attachments
  • Printed text page under the heading 1.4 Entry 2: Axioms for the Integers, comparing two approaches to defining the integers: the Peano Postulates route and the ordered integral domain route.
    Bloch - Section 1.4 Introduction ....png
    67.8 KB · Views: 583
  • Text from Definition 1.4.7: 1. For x in Z, x is positive if x > 0 and negative if x < 0. 2. The natural numbers N = {x in Z | x > 0}, followed by a triangle end-of-definition mark. Below, text states that with -N the negative integers, Z = -N ∪ {0} ∪ N, and the three sets are pairwise disjoint.
    Bloch - Defn 1.4.7 ... ....png
    15.4 KB · Views: 646
Math Amateur said:
Interestingly as Evgeny Makarov has pointed out in the Math Help Forum, the claim S⊆NS⊆NS \subseteq \mathbb{N} seems unnecessary for the rest of the proof ...
It is not, because he needs ##p \in \mathbb{N}## provided by the well-ordering principle of ##S \subseteq \mathbb{N}.## Otherwise he wouldn't have the laws available, which he applies on ##p,## and which I assume were provided by the axioms (or derived statements) of the natural numbers.
 
Hi fresh_42,

Well ... I do not think that that is the case ...

Maybe I did not make clear the approach to the integers that was relevant to Theorem 1.4.6 ...

Bloch is, in Section 1.4, dealing with the approach to defining/constructing the integers via defining the integers as an ordered integral domain that satisfies the Well-Ordering Principle ... not the approach through the natural numbers (see my previous post above). In the ordered integral domain approach the natural numbers the natural numbers are 'found'/defined as an embedded set within the integers. The relevant definition for the natural numbers is given in Definition 1.4.7 - unfortunately presented after Theorem 1.4.6. The definition reads as follows:

Text reading Definition 1.4.7: 1. Let x in Z. x is positive if x > 0 and negative if x < 0. 2. The natural numbers N are defined by N = {x in Z | x > 0}. Followed by a note that -N, the negative integers, gives Z = -N union {0} union N, with these three sets pairwise disjoint.


Once we have defined the integers as an ordered integral domain we have the following properties to call on in Theorem 1.4.6 ... and these properties include those named in the proof of the Theorem ...

Definition 1.4.1 listing the axioms of an ordered integral domain: addition and multiplication laws, identity and inverse laws, distributive law, no zero divisors, trichotomy, transitivity, order laws, and 0 ≠ 1.


Peter
 
Attachments
  • Text reproduction of Definition 1.4.7: 1. For x in Z, x is positive if x > 0 and negative if x < 0. 2. The natural numbers N are the set {x in Z | x > 0}, followed by a triangle end-of-definition mark.
    Bloch - Defn 1.4.7 ... ....png
    15.4 KB · Views: 596
  • Definition 1.4.1 of an ordered integral domain: a set R with elements 0, 1, binary operations + and ·, unary operation −, and relation <, satisfying properties a through n, including associative, commutative, identity, inverse, distributive, no zero divisors, trichotomy, transitive, addition and multiplication laws for order, and 0 ≠ 1.
    Bloch - Defn 1.4 - Ordered Integral Domain ....png
    51.1 KB · Views: 800
One needs the well-ordering to get ##p \in S## (definition 1.4.3). Together with definition 1.4.7. this abbreviates to ##S \subseteq \mathbb{N}##. It is just another language as to say all elements of ##S## are positive. So whether you say all elements of ##S## are natural numbers or all elements of ##S## are positive, doesn't make a difference, it is the same. And which ever way you look at it, one of them is needed. So the language might be redundant, the fact is not.
 
Hi fresh_42 ... thanks for the post ...

Yes ... see the point you are making ...

Peter