PROVE: Let f be riemann integrable on [a,b] Let \(\alpha , \beta , \gamma \) be arbitrary numbers in [a,b] (not necessarily ordered in any way) Prove that \[\int^\gamma_\alpha f=\int^\beta_\alpha f+ \int^\gamma_\beta\]
just a hint here, I don't see how it is different from the thm 5.2.2 from last time
consider the case with \(\beta>\gamma\)
right, but wouldn't there be 4 potential options?
yeah I guess so, you would have really 6.....
beta greater than gamma is just that thm from the last problem right?
post that link again. I thought it was nested.
nested?
it says b<c in that theorem
oh i guess i meant the \(\gamma<\beta\) option
yes that would be taken care of by that theorem
said it backwards shoot
so you have some rule about \(\int_a^bf=-\int_b^af\)?
yea, we have that
I guess you will have six cases then? \(a\le b\le c\\ a\le c\le b\\ b\le a \le c\\ b \le c \le a\\ c\le a \le b\\ c \le b \le a\)
so we need cases \(\gamma<\alpha ; \beta<\alpha ; \beta>\alpha; \beta>\gamma\)
we already have \(\beta<\gamma\), but do I have to do all of them? like 6! solutions?
there must be some general way
how do you have \(\beta \le \gamma\)?
we can discredit equals because that equals zero...
how do you have \(\beta < \gamma\)?
that thm from before
5.2.2?
it does not say that.
why not? Didn't we prove that?
lol im confused. we did not prove theorem 5.2.2 it is in your book. you said that theorem 5.2.2 says that we must have beta < gamma, and then you say we proved it. I think I am missing something.
brb, getting off of bus and will get on pc when I get home. Should not take long.
ok thanks, I'm so confused on what I need to prove here
I guess I also don't see how this works when we have \[\int^\gamma_\alpha f=\int^\beta_\alpha f+ \int_\gamma^\beta\]
Maybe prove a lemma first and use it instead of working all the cases : \[\int \limits_{\alpha}^{\beta}f = -\int\limits_{\beta}^{\alpha} f\]
right but how is that the same?
when we subtract that? ... ohhhh ok I'm a nitwit, ok, so I just need to prove that now. Let me try that
so conceptually I get it, we are subtracting the excess because we have modified our values, but can I get a hint on the technical proof?
proving lemma should be straightforward right ?
you're asking how to use it to argue that the integral splitting does not depend on the order ?
hmm ok... I'll try let me hit my head off the wall for a few minutes and I'll be back
i don't get what you're asking
what you consider straightforward, is not to me
okay its straightforward in calc1 atleast idk how it changes in real analysis
so I'm gonna try and see what I'm missing
\[\int_a^b f = F(b)-F(a) = -\left[F(a) - F(b)\right] = -\int_b^a f \]
oh that lemma, yea that has already been proved, I thought you meant the subtracion of the integral to cut off the excess
yeah making that connection is tricky, one sec
but first, do we have 6 pieces or do we have more?
so like if we use \(\gamma<\alpha\) do we then have 4 sub-cases where \(\beta <\alpha ; \beta<\gamma; \beta>\gamma; \beta >\alpha\)
which means we have 24 cases??? That seems like alot
there should be a clever way to argue instead of listing out all the different cases
i see only 6 cases though
hmm
the ones listed by zzr
yea, but isn't there multiple subcases if you bound it?
ie the limits are gamma and alpha, so you have two possibilities there
those 6 cases exhaust all the subcases
either gamma is bigger or alpha is bigger, then there are 4 subcases
beta is bigger/less than alpha, beta is bigger/less than gamma
all four for both options on bounds
list ur cases based on the "middle value" Case1 : when alpha is in between beta and gamma, you get two subcases \[\beta \le \alpha \le \gamma \] \[\gamma \le \alpha\le \beta\]
but the end values are not set either
yes you get two mose cases with two subcases each ?
*more
how am I getting 10...
im not sure, actually im bit lost...
think of it like this : you have 3 points on real line |dw:1416906636047:dw|
you can permute them in 3! = 6 ways
... I abhor analysis. Thank god next week is the last week of it....
I am thinking 2 options 4 suboptions
somehow your extra cases must be redundant
hmm ok,
ah I see the redundant ones now
Oh good, im still trying to prune the redundant ones
but still, 6 cases seems like a lot, shouldn't there be another way?
So you work all 6 cases by subtracting the excess where necesssary ?
yeah im fully sure there will be another nice way but im not getting any other ideas as of nw
yea... but I also don't see how to technically and rigorously prove that
@zzr0ck3r is still off
Conceptually I fully understand it
same here idk real analysis terminology
it's the technical..... ughh
Join our real-time social learning platform and learn together with your friends!