On Math Looking Obvious in RetrospectMost 'obvious' open problems in complexity theoryUndergraduate math researchNew grand projects in contemporary mathWhat problem in pure mathematics required solution techniques from the widest range of math sub-disciplines?Research semester in math

On Math Looking Obvious in Retrospect


Most 'obvious' open problems in complexity theoryUndergraduate math researchNew grand projects in contemporary mathWhat problem in pure mathematics required solution techniques from the widest range of math sub-disciplines?Research semester in math













14












$begingroup$


Admittedly, a soft-question.



I, being a very young researcher (PhD student) have personally faced the following situation many times: You delve into a problem desperately. No progress for a very long while. All of a sudden, you get the light, and boom: the result is proven. Looking in retrospect, though, the result looks extremely obvious (to the extent you sometimes are ashamed of not getting till then, or embarrassed sharing/publishing).



I wonder people's personal opinion on this matter (would also like to hear several real-stories on it, related to published papers).



Note If moderators believe Mathoverflow is not the right venue for my question, I can consider relocating it.










share|cite|improve this question











$endgroup$









  • 1




    $begingroup$
    There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
    $endgroup$
    – Sam Hopkins
    8 hours ago







  • 3




    $begingroup$
    In some sense the dream of Grothendieck was to make everything "almost obvious".
    $endgroup$
    – Todd Trimble
    8 hours ago






  • 5




    $begingroup$
    Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
    $endgroup$
    – Matt F.
    8 hours ago







  • 2




    $begingroup$
    One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
    $endgroup$
    – Sam Hughes
    7 hours ago






  • 2




    $begingroup$
    I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
    $endgroup$
    – Yemon Choi
    7 hours ago















14












$begingroup$


Admittedly, a soft-question.



I, being a very young researcher (PhD student) have personally faced the following situation many times: You delve into a problem desperately. No progress for a very long while. All of a sudden, you get the light, and boom: the result is proven. Looking in retrospect, though, the result looks extremely obvious (to the extent you sometimes are ashamed of not getting till then, or embarrassed sharing/publishing).



I wonder people's personal opinion on this matter (would also like to hear several real-stories on it, related to published papers).



Note If moderators believe Mathoverflow is not the right venue for my question, I can consider relocating it.










share|cite|improve this question











$endgroup$









  • 1




    $begingroup$
    There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
    $endgroup$
    – Sam Hopkins
    8 hours ago







  • 3




    $begingroup$
    In some sense the dream of Grothendieck was to make everything "almost obvious".
    $endgroup$
    – Todd Trimble
    8 hours ago






  • 5




    $begingroup$
    Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
    $endgroup$
    – Matt F.
    8 hours ago







  • 2




    $begingroup$
    One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
    $endgroup$
    – Sam Hughes
    7 hours ago






  • 2




    $begingroup$
    I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
    $endgroup$
    – Yemon Choi
    7 hours ago













14












14








14


4



$begingroup$


Admittedly, a soft-question.



I, being a very young researcher (PhD student) have personally faced the following situation many times: You delve into a problem desperately. No progress for a very long while. All of a sudden, you get the light, and boom: the result is proven. Looking in retrospect, though, the result looks extremely obvious (to the extent you sometimes are ashamed of not getting till then, or embarrassed sharing/publishing).



I wonder people's personal opinion on this matter (would also like to hear several real-stories on it, related to published papers).



Note If moderators believe Mathoverflow is not the right venue for my question, I can consider relocating it.










share|cite|improve this question











$endgroup$




Admittedly, a soft-question.



I, being a very young researcher (PhD student) have personally faced the following situation many times: You delve into a problem desperately. No progress for a very long while. All of a sudden, you get the light, and boom: the result is proven. Looking in retrospect, though, the result looks extremely obvious (to the extent you sometimes are ashamed of not getting till then, or embarrassed sharing/publishing).



I wonder people's personal opinion on this matter (would also like to hear several real-stories on it, related to published papers).



Note If moderators believe Mathoverflow is not the right venue for my question, I can consider relocating it.







soft-question research






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








asked 9 hours ago


























community wiki





kawa











  • 1




    $begingroup$
    There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
    $endgroup$
    – Sam Hopkins
    8 hours ago







  • 3




    $begingroup$
    In some sense the dream of Grothendieck was to make everything "almost obvious".
    $endgroup$
    – Todd Trimble
    8 hours ago






  • 5




    $begingroup$
    Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
    $endgroup$
    – Matt F.
    8 hours ago







  • 2




    $begingroup$
    One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
    $endgroup$
    – Sam Hughes
    7 hours ago






  • 2




    $begingroup$
    I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
    $endgroup$
    – Yemon Choi
    7 hours ago












  • 1




    $begingroup$
    There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
    $endgroup$
    – Sam Hopkins
    8 hours ago







  • 3




    $begingroup$
    In some sense the dream of Grothendieck was to make everything "almost obvious".
    $endgroup$
    – Todd Trimble
    8 hours ago






  • 5




    $begingroup$
    Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
    $endgroup$
    – Matt F.
    8 hours ago







  • 2




    $begingroup$
    One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
    $endgroup$
    – Sam Hughes
    7 hours ago






  • 2




    $begingroup$
    I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
    $endgroup$
    – Yemon Choi
    7 hours ago







1




1




$begingroup$
There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
$endgroup$
– Sam Hopkins
8 hours ago





$begingroup$
There's an extent to which everything looks obvious in retrospect, especially for material which has been given the "textbook treatment." But if you are just looking for, e.g., two examples from combinatorics of long-standing problems which were recently solved via totally elementary and indeed quite short proofs, the resolution of the capset problem by Croot-Lev-Pach/Ellenberg-Gijswijt and the resolution of the sensitivity conjecture by Huang come to mind. You can find discussion of these on Terry Tao's blog: tinyurl.com/y7efley7 and tinyurl.com/yy4kwp7w
$endgroup$
– Sam Hopkins
8 hours ago





3




3




$begingroup$
In some sense the dream of Grothendieck was to make everything "almost obvious".
$endgroup$
– Todd Trimble
8 hours ago




$begingroup$
In some sense the dream of Grothendieck was to make everything "almost obvious".
$endgroup$
– Todd Trimble
8 hours ago




5




5




$begingroup$
Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
$endgroup$
– Matt F.
8 hours ago





$begingroup$
Some soft questions are ok, but so far there’s no question here, and “what is your personal opinion of this?” is off topic.
$endgroup$
– Matt F.
8 hours ago





2




2




$begingroup$
One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
$endgroup$
– Sam Hughes
7 hours ago




$begingroup$
One useful thing I try to remember is "in mathematics everything is either trivial or impossible"
$endgroup$
– Sam Hughes
7 hours ago




2




2




$begingroup$
I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
$endgroup$
– Yemon Choi
7 hours ago




$begingroup$
I'm voting to close this question because it seems too open-ended and "discussion-inviting": MO is not really meant as a forum for chatting and evolving conversations
$endgroup$
– Yemon Choi
7 hours ago










2 Answers
2






active

oldest

votes


















9












$begingroup$

Interpretation #1: P vs. NP



There are many hard-to-solve problems with easily verified solutions. It can be a real talent to present a proof which is especially easy for humans to verify. In like manner, a good counterexample can be very enlightening. Those who have searched for counterexamples can testify to the fact that these can be very hard to find in the first place.



Do not confuse the ease of verifying a solution with the difficulty of finding that solution.



Interpretation #2: Kolmogorov compexity



There are many proofs in the literature that are gigantic case checks, one of the most famous being the four color theorem. Another is Helfgott's proof of Goldbach's weak conjecture. Some proofs require an extraordinary amount of data, which simply cannot be compressed into a smaller space. However, we don't usually celebrate the fact that a computer actually checked all those cases (even though that really does need to be done). Rather, we delight in the fact that we understand how to turn it into a finite task, doable in a small time-frame. The important parts of the proof are the key ideas, which sometimes are quite small in comparison to the rest of the work.



Do not confuse length with importance.



Interpretation #3: Obfuscation



Good mathematical writing makes things clearer. One should "eschew obfuscation, espouse elucidation". My greatest joy in my research is discovering something new and then explaining it to others, in a way that makes it clear and easy to them as well. In my experience, a large amount of time should go into writing the solution well.



Do not confuse lack of clarity with brilliance.






share|cite|improve this answer











$endgroup$










  • 2




    $begingroup$
    The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
    $endgroup$
    – Sam Hopkins
    7 hours ago


















8












$begingroup$

Certainly I myself tend to see anything that I understand well as "being nearly obvious" (although I know better).



Also, I and many other people I know have realized upon completion of a PhD that their advisor "probably could have done this in an afternoon, if they cared...". Right. Much of a PhD (in math) in my opinion is getting-up-to-speed on technique, so that what was impossible before is at least approachable... if only due to acquisition of good technique.



Also, some or many parts of mathematics, perhaps the most useful parts, are very robust, in the sense that once we see the mechanism, we do not have to be particularly careful to have things work out and not fail... So, yes, once one is acquainted with such robust stuff, and has assimilated such things into one's "intuition", lots of things are "easy".



A few things seem to remain permanently delicate... and I myself have a hard time understanding them.



A point that seems often overlooked is that, in my perception of myself and many others, the course of a (successful, substantial) research project involves as much changing oneself as anything else. So one's perception has changed, so that what was unobvious is now obvious. The thing itself probably did not change much...?



Yes, this can be misunderstood as one's own unforgiveable slowness to understand (since after-the-fact it seems so easy), but I think that is a far too naive appraisal of the mechanism.






share|cite|improve this answer











$endgroup$

















    Your Answer








    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "504"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f338148%2fon-math-looking-obvious-in-retrospect%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    9












    $begingroup$

    Interpretation #1: P vs. NP



    There are many hard-to-solve problems with easily verified solutions. It can be a real talent to present a proof which is especially easy for humans to verify. In like manner, a good counterexample can be very enlightening. Those who have searched for counterexamples can testify to the fact that these can be very hard to find in the first place.



    Do not confuse the ease of verifying a solution with the difficulty of finding that solution.



    Interpretation #2: Kolmogorov compexity



    There are many proofs in the literature that are gigantic case checks, one of the most famous being the four color theorem. Another is Helfgott's proof of Goldbach's weak conjecture. Some proofs require an extraordinary amount of data, which simply cannot be compressed into a smaller space. However, we don't usually celebrate the fact that a computer actually checked all those cases (even though that really does need to be done). Rather, we delight in the fact that we understand how to turn it into a finite task, doable in a small time-frame. The important parts of the proof are the key ideas, which sometimes are quite small in comparison to the rest of the work.



    Do not confuse length with importance.



    Interpretation #3: Obfuscation



    Good mathematical writing makes things clearer. One should "eschew obfuscation, espouse elucidation". My greatest joy in my research is discovering something new and then explaining it to others, in a way that makes it clear and easy to them as well. In my experience, a large amount of time should go into writing the solution well.



    Do not confuse lack of clarity with brilliance.






    share|cite|improve this answer











    $endgroup$










    • 2




      $begingroup$
      The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
      $endgroup$
      – Sam Hopkins
      7 hours ago















    9












    $begingroup$

    Interpretation #1: P vs. NP



    There are many hard-to-solve problems with easily verified solutions. It can be a real talent to present a proof which is especially easy for humans to verify. In like manner, a good counterexample can be very enlightening. Those who have searched for counterexamples can testify to the fact that these can be very hard to find in the first place.



    Do not confuse the ease of verifying a solution with the difficulty of finding that solution.



    Interpretation #2: Kolmogorov compexity



    There are many proofs in the literature that are gigantic case checks, one of the most famous being the four color theorem. Another is Helfgott's proof of Goldbach's weak conjecture. Some proofs require an extraordinary amount of data, which simply cannot be compressed into a smaller space. However, we don't usually celebrate the fact that a computer actually checked all those cases (even though that really does need to be done). Rather, we delight in the fact that we understand how to turn it into a finite task, doable in a small time-frame. The important parts of the proof are the key ideas, which sometimes are quite small in comparison to the rest of the work.



    Do not confuse length with importance.



    Interpretation #3: Obfuscation



    Good mathematical writing makes things clearer. One should "eschew obfuscation, espouse elucidation". My greatest joy in my research is discovering something new and then explaining it to others, in a way that makes it clear and easy to them as well. In my experience, a large amount of time should go into writing the solution well.



    Do not confuse lack of clarity with brilliance.






    share|cite|improve this answer











    $endgroup$










    • 2




      $begingroup$
      The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
      $endgroup$
      – Sam Hopkins
      7 hours ago













    9












    9








    9





    $begingroup$

    Interpretation #1: P vs. NP



    There are many hard-to-solve problems with easily verified solutions. It can be a real talent to present a proof which is especially easy for humans to verify. In like manner, a good counterexample can be very enlightening. Those who have searched for counterexamples can testify to the fact that these can be very hard to find in the first place.



    Do not confuse the ease of verifying a solution with the difficulty of finding that solution.



    Interpretation #2: Kolmogorov compexity



    There are many proofs in the literature that are gigantic case checks, one of the most famous being the four color theorem. Another is Helfgott's proof of Goldbach's weak conjecture. Some proofs require an extraordinary amount of data, which simply cannot be compressed into a smaller space. However, we don't usually celebrate the fact that a computer actually checked all those cases (even though that really does need to be done). Rather, we delight in the fact that we understand how to turn it into a finite task, doable in a small time-frame. The important parts of the proof are the key ideas, which sometimes are quite small in comparison to the rest of the work.



    Do not confuse length with importance.



    Interpretation #3: Obfuscation



    Good mathematical writing makes things clearer. One should "eschew obfuscation, espouse elucidation". My greatest joy in my research is discovering something new and then explaining it to others, in a way that makes it clear and easy to them as well. In my experience, a large amount of time should go into writing the solution well.



    Do not confuse lack of clarity with brilliance.






    share|cite|improve this answer











    $endgroup$



    Interpretation #1: P vs. NP



    There are many hard-to-solve problems with easily verified solutions. It can be a real talent to present a proof which is especially easy for humans to verify. In like manner, a good counterexample can be very enlightening. Those who have searched for counterexamples can testify to the fact that these can be very hard to find in the first place.



    Do not confuse the ease of verifying a solution with the difficulty of finding that solution.



    Interpretation #2: Kolmogorov compexity



    There are many proofs in the literature that are gigantic case checks, one of the most famous being the four color theorem. Another is Helfgott's proof of Goldbach's weak conjecture. Some proofs require an extraordinary amount of data, which simply cannot be compressed into a smaller space. However, we don't usually celebrate the fact that a computer actually checked all those cases (even though that really does need to be done). Rather, we delight in the fact that we understand how to turn it into a finite task, doable in a small time-frame. The important parts of the proof are the key ideas, which sometimes are quite small in comparison to the rest of the work.



    Do not confuse length with importance.



    Interpretation #3: Obfuscation



    Good mathematical writing makes things clearer. One should "eschew obfuscation, espouse elucidation". My greatest joy in my research is discovering something new and then explaining it to others, in a way that makes it clear and easy to them as well. In my experience, a large amount of time should go into writing the solution well.



    Do not confuse lack of clarity with brilliance.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    answered 7 hours ago


























    community wiki





    Pace Nielsen











    • 2




      $begingroup$
      The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
      $endgroup$
      – Sam Hopkins
      7 hours ago












    • 2




      $begingroup$
      The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
      $endgroup$
      – Sam Hopkins
      7 hours ago







    2




    2




    $begingroup$
    The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
    $endgroup$
    – Sam Hopkins
    7 hours ago




    $begingroup$
    The "P vs. NP" aspect of "obvious" results is discussed by Scott Aaronson in reference to Huang's recent proof of the sensitivity conjecture (mentioned above) here: scottaaronson.com/blog/?p=4229
    $endgroup$
    – Sam Hopkins
    7 hours ago











    8












    $begingroup$

    Certainly I myself tend to see anything that I understand well as "being nearly obvious" (although I know better).



    Also, I and many other people I know have realized upon completion of a PhD that their advisor "probably could have done this in an afternoon, if they cared...". Right. Much of a PhD (in math) in my opinion is getting-up-to-speed on technique, so that what was impossible before is at least approachable... if only due to acquisition of good technique.



    Also, some or many parts of mathematics, perhaps the most useful parts, are very robust, in the sense that once we see the mechanism, we do not have to be particularly careful to have things work out and not fail... So, yes, once one is acquainted with such robust stuff, and has assimilated such things into one's "intuition", lots of things are "easy".



    A few things seem to remain permanently delicate... and I myself have a hard time understanding them.



    A point that seems often overlooked is that, in my perception of myself and many others, the course of a (successful, substantial) research project involves as much changing oneself as anything else. So one's perception has changed, so that what was unobvious is now obvious. The thing itself probably did not change much...?



    Yes, this can be misunderstood as one's own unforgiveable slowness to understand (since after-the-fact it seems so easy), but I think that is a far too naive appraisal of the mechanism.






    share|cite|improve this answer











    $endgroup$



















      8












      $begingroup$

      Certainly I myself tend to see anything that I understand well as "being nearly obvious" (although I know better).



      Also, I and many other people I know have realized upon completion of a PhD that their advisor "probably could have done this in an afternoon, if they cared...". Right. Much of a PhD (in math) in my opinion is getting-up-to-speed on technique, so that what was impossible before is at least approachable... if only due to acquisition of good technique.



      Also, some or many parts of mathematics, perhaps the most useful parts, are very robust, in the sense that once we see the mechanism, we do not have to be particularly careful to have things work out and not fail... So, yes, once one is acquainted with such robust stuff, and has assimilated such things into one's "intuition", lots of things are "easy".



      A few things seem to remain permanently delicate... and I myself have a hard time understanding them.



      A point that seems often overlooked is that, in my perception of myself and many others, the course of a (successful, substantial) research project involves as much changing oneself as anything else. So one's perception has changed, so that what was unobvious is now obvious. The thing itself probably did not change much...?



      Yes, this can be misunderstood as one's own unforgiveable slowness to understand (since after-the-fact it seems so easy), but I think that is a far too naive appraisal of the mechanism.






      share|cite|improve this answer











      $endgroup$

















        8












        8








        8





        $begingroup$

        Certainly I myself tend to see anything that I understand well as "being nearly obvious" (although I know better).



        Also, I and many other people I know have realized upon completion of a PhD that their advisor "probably could have done this in an afternoon, if they cared...". Right. Much of a PhD (in math) in my opinion is getting-up-to-speed on technique, so that what was impossible before is at least approachable... if only due to acquisition of good technique.



        Also, some or many parts of mathematics, perhaps the most useful parts, are very robust, in the sense that once we see the mechanism, we do not have to be particularly careful to have things work out and not fail... So, yes, once one is acquainted with such robust stuff, and has assimilated such things into one's "intuition", lots of things are "easy".



        A few things seem to remain permanently delicate... and I myself have a hard time understanding them.



        A point that seems often overlooked is that, in my perception of myself and many others, the course of a (successful, substantial) research project involves as much changing oneself as anything else. So one's perception has changed, so that what was unobvious is now obvious. The thing itself probably did not change much...?



        Yes, this can be misunderstood as one's own unforgiveable slowness to understand (since after-the-fact it seems so easy), but I think that is a far too naive appraisal of the mechanism.






        share|cite|improve this answer











        $endgroup$



        Certainly I myself tend to see anything that I understand well as "being nearly obvious" (although I know better).



        Also, I and many other people I know have realized upon completion of a PhD that their advisor "probably could have done this in an afternoon, if they cared...". Right. Much of a PhD (in math) in my opinion is getting-up-to-speed on technique, so that what was impossible before is at least approachable... if only due to acquisition of good technique.



        Also, some or many parts of mathematics, perhaps the most useful parts, are very robust, in the sense that once we see the mechanism, we do not have to be particularly careful to have things work out and not fail... So, yes, once one is acquainted with such robust stuff, and has assimilated such things into one's "intuition", lots of things are "easy".



        A few things seem to remain permanently delicate... and I myself have a hard time understanding them.



        A point that seems often overlooked is that, in my perception of myself and many others, the course of a (successful, substantial) research project involves as much changing oneself as anything else. So one's perception has changed, so that what was unobvious is now obvious. The thing itself probably did not change much...?



        Yes, this can be misunderstood as one's own unforgiveable slowness to understand (since after-the-fact it seems so easy), but I think that is a far too naive appraisal of the mechanism.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        answered 8 hours ago


























        community wiki





        paul garrett































            draft saved

            draft discarded
















































            Thanks for contributing an answer to MathOverflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f338148%2fon-math-looking-obvious-in-retrospect%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

            Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

            199年 目錄 大件事 到箇年出世嗰人 到箇年死嗰人 節慶、風俗習慣 導覽選單