Proof: [itex]1\neq m\in\mathbb{N}, m-1\in\mathbb{N}[/itex]

  • Thread starter Thread starter nuuskur
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Homework Help Overview

The discussion revolves around proving that if \( m \in \mathbb{N} \) and \( m \neq 1 \), then \( m - 1 \in \mathbb{N} \). The context involves properties of natural numbers and inductive sets, with participants exploring definitions and implications related to these concepts.

Discussion Character

  • Conceptual clarification, Assumption checking, Exploratory

Approaches and Questions Raised

  • Participants discuss the implications of \( m \) being an element of \( \mathbb{N} \) and the consequences of \( m \neq 1 \). There are attempts to justify the reasoning behind the assumption that \( n + 1 \neq m \) and to explore the properties of inductive sets. Questions arise about the nature of elements in \( \mathbb{N} \) and how they relate to the definitions provided.

Discussion Status

The discussion is active, with various interpretations being explored. Some participants suggest alternative approaches and simpler proofs, while others question the assumptions made in the original argument. There is a recognition of the need for clarity in the definitions and properties being used.

Contextual Notes

Participants note the importance of the definition of \( \mathbb{N} \) and the properties of inductive sets, as well as the implications of the assumption \( m \neq 1 \). There is an acknowledgment of the constraints imposed by the definitions and the need for rigorous justification of certain statements.

nuuskur
Science Advisor
Messages
928
Reaction score
1,226

Homework Statement


Given that m\in\mathbb{N} and m\neq 1, show that m-1\in\mathbb{N}
For this problem assume \mathbb{N} = \{1,2,...\}, also known as the product of all inductive sets.

Homework Equations


Inductive subset: A subset S\in\mathbb{R} is inductive if:
1) 1\in S (##1## is to be considered as the unit element for which ##1x = x1 = x## for every ##x##.
2) If x\in S, then x+1\in S for every x\in S

The Attempt at a Solution


Going to use the method (A\Rightarrow B\Leftrightarrow \neg B\Rightarrow\neg A) (kontraposition?)
Assume m\in\mathbb{N}\setminus\{1\}. If m-1\notin\mathbb{N} then \mathbb{N}\setminus\{m\}=:M is inductive.
If the above implication holds then we can say that if M is not inductive then m-1\in\mathbb{N}

Then let m\neq 1
Def 1) We can say that 1\in M
Def 2) Let n\in M, then n\in\mathbb{N} and because \mathbb{N} is inductive, n+1\in\mathbb{N}. We can also say that n+1\neq m, from which n+1\in M.
Hence M is inductive.

Problem is with the part where I say n+1\neq m, intuitively I know it's correct, but how do I justify this exactly?
Will it suffice to say that addition is an algebraic operation? Therefore n+1= m is impossible.

But from the definition of inductive subset, M cannot be inductive for \mathbb{N} = \mathbb{N}\setminus\{m\} is impossible (because every inductive subset has to contain \mathbb{N}) and we have that m-1\in\mathbb{N}, if m\neq 1
 
Last edited:
Physics news on Phys.org
You have left m and n essentially arbitrary. So m=3 and n=2 is a possibility. This would make n+1=m.

I think you have to use that ##\mathbb N## has the property that there are no elements in that set other than the ones that are mentioned in the definition of "inductive set".
 
Fredrik said:
You have left m and n essentially arbitrary. So m=3 and n=2 is a possibility. This would make n+1=m.

I think you have to use that ##\mathbb N## has the property that there are no elements in that set other than the ones that are mentioned in the definition of "inductive set".
The set M does not contain 3, Therefore 2+1, which is an algebraic operation, for both 2 and 1 are in M, has to be contained within the set M.
 
Sorry, that was a silly mistake by me. I'm not sure I have time to think about how to figure out how to turn your approach into a complete proof, but I see a simpler one. It's based on the idea that the statement ##m\in\mathbb N## implies one of two mutually exclusive possibilities, one of which is ##m=1##. What I have in mind for the other one is something more useful than the obvious ##m\neq 1##. Since the ##m=1## possibility is ruled out by assumption, the other one must be a true statement.
 
Fredrik said:
Sorry, that was a silly mistake by me. I'm not sure I have time to think about how to figure out how to turn your approach into a complete proof, but I see a simpler one. It's based on the idea that the statement ##m\in\mathbb N## implies one of two mutually exclusive possibilities, one of which is ##m=1##. What I have in mind for the other one is something more useful than the obvious ##m\neq 1##. Since the ##m=1## possibility is ruled out by assumption, the other one must be a true statement.
Assuming I get this right you mean to get at: ##m =1\vee m\in\mathbb{N}\setminus\{1\}## We know that ##m\in\mathbb{N}\setminus\{1\} =: A##, but then what is ##m+(-1)##? This, at least, is the first thing I tried, but because it isn't an algebraic operation I can't say anything about ##m-1## so I couldn't get anywhere with it.
 
Think of a property that every element of ##\mathbb N## except 1 has. If ##m## is an element of ##\mathbb N## such that ##m\neq 1##, then ##m## must have that property.
 
The only thing I can think of right now is if ##m\neq 1## then there always exist ##p,q\in\mathbb{N}## such that ##p< m < q##, but then again it sounds like something that needs to be proven first.
 
It's hard to tell you something without giving away the complete solution, but if we define ##s(x)=x+1## for each ##x\in\mathbb N##, then what is the range of the function ##s##?
 
Fredrik said:
It's hard to tell you something without giving away the complete solution, but if we define ##s(x)=x+1## for each ##x\in\mathbb N##, then what is the range of the function ##s##?
##[2,\infty)##.. right, I get where this is going, thanks :D
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
20
Views
4K