Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (linyu):

Prove that the set {n|n=1 or n in N and n-1 in N} is inductive.

OpenStudy (linyu):

N as in natural numbers

OpenStudy (loser66):

Is it not that by definition of inductive set, we need 2 things: 1) \(1\in S\) 2)\(\forall n\in S, n+1\in S\), And we have 1 ) already, 2) is easy by inductive rule : \[\dfrac{e_1 \in S ~~e_2\in S}{(e_1+e_2)\in S}\] where \(e_1=1, e_2=n ~~or ~~e_2=n-1\) Or I underestimate the problem??

OpenStudy (linyu):

that is a bit contradicting. I'm having a tough time because I thought 1 is excluded.

OpenStudy (linyu):

suppose n=1, then n-1=1-1=0 which means n-1 is not a natural number. Am I just overthinking this?

OpenStudy (loser66):

\(S={n|n=1 "or" n\in N "and" n-1\in N}\) To me, it means n=1 and n in N or n=1 and n-1 in N both works

OpenStudy (loser66):

@linyu since you post at College level, I assume that the problem is from Set theory course. Am I right?

OpenStudy (linyu):

Yes. It is advanced calculus one variable

OpenStudy (loser66):

oh, advance calculus, which book do you use? which chapter?

OpenStudy (linyu):

@Loser66 It's called "Advanced Calculus" 2ed by M. Fitzpatrick

OpenStudy (linyu):

section 1.1 problem 7

OpenStudy (loser66):

oh, my book is Elementary Classical Analysis by Marsden.

OpenStudy (linyu):

I think they teach the same techniques.

OpenStudy (loser66):

And I don't have inductive set

OpenStudy (loser66):

Good luck, my friend. It killed me when I took the course. I got a C

OpenStudy (linyu):

I'm new to classical analysis so..

OpenStudy (linyu):

@Loser66 I appreciate your help haha

OpenStudy (loser66):

ok, at the beginning, it was easy, but later on, it was harder and harder. I struggled with homework. I was always around 80!! hehehe...

OpenStudy (linyu):

@Loser66 pray for me oh god...

OpenStudy (loser66):

Yes, I will. hehehe... find some classmates to study together, knock on your professor's door when you need help.

OpenStudy (linyu):

@Loser66 Just as you said the second assumption of this question is easy. I just don't know how to bypass the first 1-1=0 is just wrong

OpenStudy (loser66):

Don't trust anybody else but the prof.

OpenStudy (linyu):

true that haha

OpenStudy (loser66):

The set S has more than 1 element. either it has 1 and n, or 1 and n-1

OpenStudy (loser66):

and at very first step, you need say: 1 in S, hence S is not empty.

OpenStudy (linyu):

Does it have something to do with the completeness axiom?

OpenStudy (loser66):

The completeness property is about monotone sequence and N is completeness set.

OpenStudy (loser66):

but I don't think we need it on this problem

OpenStudy (linyu):

@Loser66 take my class for me please *sob*

OpenStudy (loser66):

hehehe... good luck my friend. You can do it. trust me,

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!