Proving the Shoelace Method at the Precalculus Level












5












$begingroup$


Using only precalculus mathematics (including that the area of the triangle with vertices at the origin, $(x_1,y_1)$, and $(x_2,y_2)$ is half of the absolute value of the determinant of the $2times 2$ matrix of the vertices $(x_1,y_1)$ and $(x_2,y_2)$, $frac{1}{2}cdotleft|x_1cdot y_2 - x_2cdot y_1right|$) how can one prove that the shoelace method works for all non-self-intersecting polygons?










share|cite|improve this question











$endgroup$

















    5












    $begingroup$


    Using only precalculus mathematics (including that the area of the triangle with vertices at the origin, $(x_1,y_1)$, and $(x_2,y_2)$ is half of the absolute value of the determinant of the $2times 2$ matrix of the vertices $(x_1,y_1)$ and $(x_2,y_2)$, $frac{1}{2}cdotleft|x_1cdot y_2 - x_2cdot y_1right|$) how can one prove that the shoelace method works for all non-self-intersecting polygons?










    share|cite|improve this question











    $endgroup$















      5












      5








      5


      4



      $begingroup$


      Using only precalculus mathematics (including that the area of the triangle with vertices at the origin, $(x_1,y_1)$, and $(x_2,y_2)$ is half of the absolute value of the determinant of the $2times 2$ matrix of the vertices $(x_1,y_1)$ and $(x_2,y_2)$, $frac{1}{2}cdotleft|x_1cdot y_2 - x_2cdot y_1right|$) how can one prove that the shoelace method works for all non-self-intersecting polygons?










      share|cite|improve this question











      $endgroup$




      Using only precalculus mathematics (including that the area of the triangle with vertices at the origin, $(x_1,y_1)$, and $(x_2,y_2)$ is half of the absolute value of the determinant of the $2times 2$ matrix of the vertices $(x_1,y_1)$ and $(x_2,y_2)$, $frac{1}{2}cdotleft|x_1cdot y_2 - x_2cdot y_1right|$) how can one prove that the shoelace method works for all non-self-intersecting polygons?







      geometry algebra-precalculus contest-math analytic-geometry






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 22 '13 at 14:50







      Isaac

















      asked Jul 28 '10 at 18:26









      IsaacIsaac

      29.9k1285128




      29.9k1285128






















          1 Answer
          1






          active

          oldest

          votes


















          9












          $begingroup$

          One way is to note that $x_1y_2 - x_2y_1$ is a signed area, i.e. it may positive or negative. Adding up all the signed areas of the triangles formed by the points $O$, $P_k$ and $P_{k+1}$ will cancel all the superfluous parts, as can be seen from the sketch:



          Adding signed areas for the sides of a polygon



          The same argument also works for trapezoids with the $x$-axis instead of triangles with the origin. (I think this is the most illuminating argument, because the key trick is to give the area a sign depending on orientation.)



          One could argue that this is not very rigorous, however. A more rigorous proof is to divide the polygon into two smaller polygons (it's not trivial to show that this is possible) and argue that adding the shoelace sums of the two parts gives the shoelace sum of the whole. That's because the two additional terms for the extra side cancel each other. (This cancellation is well-known from line integrals, we are in essence calculating $frac12 oint_{polygon} x,dy - y,dx$ here.) By induction, you then only have to verify the formula for a triangle.



          Shoelace sums of two polygons






          share|cite|improve this answer











          $endgroup$













            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            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%2fmath.stackexchange.com%2fquestions%2f1017%2fproving-the-shoelace-method-at-the-precalculus-level%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            9












            $begingroup$

            One way is to note that $x_1y_2 - x_2y_1$ is a signed area, i.e. it may positive or negative. Adding up all the signed areas of the triangles formed by the points $O$, $P_k$ and $P_{k+1}$ will cancel all the superfluous parts, as can be seen from the sketch:



            Adding signed areas for the sides of a polygon



            The same argument also works for trapezoids with the $x$-axis instead of triangles with the origin. (I think this is the most illuminating argument, because the key trick is to give the area a sign depending on orientation.)



            One could argue that this is not very rigorous, however. A more rigorous proof is to divide the polygon into two smaller polygons (it's not trivial to show that this is possible) and argue that adding the shoelace sums of the two parts gives the shoelace sum of the whole. That's because the two additional terms for the extra side cancel each other. (This cancellation is well-known from line integrals, we are in essence calculating $frac12 oint_{polygon} x,dy - y,dx$ here.) By induction, you then only have to verify the formula for a triangle.



            Shoelace sums of two polygons






            share|cite|improve this answer











            $endgroup$


















              9












              $begingroup$

              One way is to note that $x_1y_2 - x_2y_1$ is a signed area, i.e. it may positive or negative. Adding up all the signed areas of the triangles formed by the points $O$, $P_k$ and $P_{k+1}$ will cancel all the superfluous parts, as can be seen from the sketch:



              Adding signed areas for the sides of a polygon



              The same argument also works for trapezoids with the $x$-axis instead of triangles with the origin. (I think this is the most illuminating argument, because the key trick is to give the area a sign depending on orientation.)



              One could argue that this is not very rigorous, however. A more rigorous proof is to divide the polygon into two smaller polygons (it's not trivial to show that this is possible) and argue that adding the shoelace sums of the two parts gives the shoelace sum of the whole. That's because the two additional terms for the extra side cancel each other. (This cancellation is well-known from line integrals, we are in essence calculating $frac12 oint_{polygon} x,dy - y,dx$ here.) By induction, you then only have to verify the formula for a triangle.



              Shoelace sums of two polygons






              share|cite|improve this answer











              $endgroup$
















                9












                9








                9





                $begingroup$

                One way is to note that $x_1y_2 - x_2y_1$ is a signed area, i.e. it may positive or negative. Adding up all the signed areas of the triangles formed by the points $O$, $P_k$ and $P_{k+1}$ will cancel all the superfluous parts, as can be seen from the sketch:



                Adding signed areas for the sides of a polygon



                The same argument also works for trapezoids with the $x$-axis instead of triangles with the origin. (I think this is the most illuminating argument, because the key trick is to give the area a sign depending on orientation.)



                One could argue that this is not very rigorous, however. A more rigorous proof is to divide the polygon into two smaller polygons (it's not trivial to show that this is possible) and argue that adding the shoelace sums of the two parts gives the shoelace sum of the whole. That's because the two additional terms for the extra side cancel each other. (This cancellation is well-known from line integrals, we are in essence calculating $frac12 oint_{polygon} x,dy - y,dx$ here.) By induction, you then only have to verify the formula for a triangle.



                Shoelace sums of two polygons






                share|cite|improve this answer











                $endgroup$



                One way is to note that $x_1y_2 - x_2y_1$ is a signed area, i.e. it may positive or negative. Adding up all the signed areas of the triangles formed by the points $O$, $P_k$ and $P_{k+1}$ will cancel all the superfluous parts, as can be seen from the sketch:



                Adding signed areas for the sides of a polygon



                The same argument also works for trapezoids with the $x$-axis instead of triangles with the origin. (I think this is the most illuminating argument, because the key trick is to give the area a sign depending on orientation.)



                One could argue that this is not very rigorous, however. A more rigorous proof is to divide the polygon into two smaller polygons (it's not trivial to show that this is possible) and argue that adding the shoelace sums of the two parts gives the shoelace sum of the whole. That's because the two additional terms for the extra side cancel each other. (This cancellation is well-known from line integrals, we are in essence calculating $frac12 oint_{polygon} x,dy - y,dx$ here.) By induction, you then only have to verify the formula for a triangle.



                Shoelace sums of two polygons







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Dec 11 '18 at 11:02









                Glorfindel

                3,41981830




                3,41981830










                answered Jul 30 '10 at 20:39









                Greg GravitonGreg Graviton

                3,66121733




                3,66121733






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • 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%2fmath.stackexchange.com%2fquestions%2f1017%2fproving-the-shoelace-method-at-the-precalculus-level%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

                    Mont Emei

                    Province de Neuquén

                    Journaliste