polite proofs

Aug 7, 2022 03:22
@MordeusMorgenstern
Aug 7, 2022 02:53
Can I ask what year you are in?
Aug 7, 2022 02:51
I've also accepted your answer
Aug 7, 2022 02:51
Thank you
Aug 7, 2022 02:47
And I'll waste less time doing 'lazy' work where I just sit there not doing too much
Aug 7, 2022 02:47
I think the biggest thing that helps is switching to another thing for a while, like topology. Then I'll be more motivated coming back to do more analysis
Aug 7, 2022 02:43
But it's kind of difficult to think about things deeply without spending an absurd amount of time on them, but it's essentially required
Aug 7, 2022 02:43
I try
Aug 7, 2022 02:42
Hmm, okay then
Aug 7, 2022 02:40
Why not? I'm very far from learning multivariable analysis rigorously
Aug 7, 2022 02:39
I just wanna know multivariable calculus for the sake of knowing it
Aug 7, 2022 02:38
Okay, I'll have a look at it, thanks. Did you want to post a response to the question so I can accept it?
Aug 7, 2022 02:37
Haha, well, I just don't want to get too hung up on doing topology since I really want to finish my current plans as soon as possible
Aug 7, 2022 02:35
Strange I've previously heard good things about Munkres' book
Aug 7, 2022 02:35
Hmm, okay, I'll look into that book then
Aug 7, 2022 02:34
Or why do you say it's bad
Aug 7, 2022 02:33
Are you talking about the later chapters?
Aug 7, 2022 02:33
By analysis I mean more generalized analysis, since Spivak doesn't really do topology
Aug 7, 2022 02:32
I plan to get back to it after I finish Spivak. Current plan is Munkres initial chapters -> Back to Spivak -> Computational multivariable calculus -> Linear Algebra (rigorously) -> Analysis, probably by Rudin or something
Aug 7, 2022 02:31
I'm in my early 20's, and yes
Aug 7, 2022 02:30
So now I'm doing Spivak and I'll do the first some chapters of Munkres until I can't anymore
Aug 7, 2022 02:30
But I actually think linear algebra is often more straight forward at that level
Aug 7, 2022 02:30
Actually no, I did read the first few chapters of Axler before I quit
Aug 7, 2022 02:29
Then yes, but basically I didn't learn anything for over a year (to learn mechanics and chemistry) and then recently restarted reading my first rigorous texts
Aug 7, 2022 02:28
The last option, but I don't know how recently you would consider recently
Aug 7, 2022 02:27
Well that depends on your definition of starting out
Aug 7, 2022 02:27
:) I am glad
Aug 7, 2022 02:26
Would that work?
Aug 7, 2022 02:25
Let $y \in B_0$. By surjectivity, then there is some $a \in f^{-1}[B_0]$ such that $f(a) = y$. Therefore, $y \in f[f^{-1}[B_0]]$ which implies the desired result
Aug 7, 2022 02:22
Okay uh
Aug 7, 2022 02:21
I think we would reach a contradiction if f^{-1}(B_0) is empty?
Aug 7, 2022 02:19
Right, what's wrong with this? I am just applying the definitions and it should be true unless B_0 is empty
Aug 7, 2022 02:18
But what about my argument currently bothers you?
Aug 7, 2022 02:16
Hello Captain
Aug 7, 2022 02:16
@MordeusMorgenstern I don't need it, because we're not talking about $y$ just yet; we don't need surjectivity because we implicitly assume the sets are nonempty.
Aug 7, 2022 02:16
@MordeusMorgenstern Basically, I wanted to first state why there exists such an element in those sets, and then I apply surjectivity to get that it 'reaches' $y$.
Aug 7, 2022 02:16
@MordeusMorgenstern What about the rest of the proof?
Aug 7, 2022 02:16
I understand what you mean, yes that's definitely not the intended interpretation. I will edit my post.
Aug 7, 2022 02:16
@MordeusMorgenstern Hi, I agree with what you said, including that your suggestion is less confusing, however why is it wrong?
 

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
Jul 30, 2022 19:39
I guess since $L(f,P) = k - U(g,\psi(P))$ for any partition $P$ of $[a,b]$...?
Jul 30, 2022 19:38
@TedShifrin Why does one $k$ work in his case?
Jul 30, 2022 19:36
The reasoning just seems really handwavy..
Jul 30, 2022 19:30
I don't know... seems dodgy
Jul 30, 2022 19:30
Okay, well, we know that $U(f,P) = k - L(g,\psi(P))$. So then over all partitions $P$ of $[a,b]$: $\sup U(f,P) = \sup \{ k - L(g,\psi(P)) \}$. The impression inside the braces is maximized when $L(g,\psi(P))$ is minimized......
Jul 30, 2022 19:27
@TedShifrin Wait, so how do we justify it then?
Jul 30, 2022 19:24
Choosing $P$ locks in $P'$
Jul 30, 2022 19:23
Right
Jul 30, 2022 19:20
I just feel like he does something very similar.
Jul 30, 2022 19:19
Hmm
Jul 30, 2022 19:18
But that's essentially what Spivak does in the proof of 13-21 which I just realized