Proofs of the Existence of No Greatest Natural Number

jgens
Gold Member
Messages
1,575
Reaction score
50
Earlier today, I was thinking about the statement that "there exists no greatest natural number" and immediately, two proofs sprang to my mind. Since my question depends on these, I'll write them out below . . .


Proof 1: Let n \in \mathbb{N}. Clearly n+1 \in \mathbb{N} and n < n+1. Since, given any natural number, it's possible to explicitly construct a larger natural number, \mathbb{N} contains no greatest element.


Proof 2: Clearly 1 \in \mathbb{N}. Now suppose that \mathbb{N} is bounded above, in which case \mathbb{N} is a bounded, non-empty subset of the Real numbers. Since \mathbb{N} satisfies the necessary conditions, \sup\{\mathbb{N}\} exists. Because \sup\{\mathbb{N}\} is an upper bound for \mathbb{N}, it follows that for any natural number n we have that n < \sup\{\mathbb{N}\}. Since n+1 is also a natural number, n+1 < \sup\{\mathbb{N}\} which implies that n < \sup\{\mathbb{N}\} - 1. This contradicts the fact that \sup\{\mathbb{N}\} is a least upper bound and consequently, the assumption that \mathbb{N} is bounded above must have been incorrect. Therefore, \mathbb{N} is unbouded above, completing the proof.


Now, my question is this: What is the difference between the two proofs? From what I can gather, the first only demonstrates that \mathbb{N} contains no greatest element; while the second demonstrates that \mathbb{N} contains no greatest element and is in fact, unbounded above. Is this sort of thinking correct or am I just fundamentally confused about something? Any clarifications or advice are appreciated. Thanks!
 
Mathematics news on Phys.org
i thought it would have had something to do with \omega being an infinite limit ordinal
 
Last edited:
Because \sup\{\mathbb{N}\} is an upper bound for \mathbb{N}, it follows that for any natural number n we have that n < \sup\{\mathbb{N}\}.[/quote]
Minor error: the thing that immediately follows has \leq, not <.


As for your second proof, you have neglected somewhere along the line to show that sup(N)-1 is an upper bound on N, so you haven't yet shown the contradiction you were seeking.


Aside from those errors, your proofs look fine, and prove what you think they prove.
 
Thanks Hurkyl! I'm glad that you pointed out those errors, I really should know better.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top