{"id":21377,"date":"2026-06-16T10:01:48","date_gmt":"2026-06-16T14:01:48","guid":{"rendered":"https:\/\/notes.math.ca\/article\/on-finding-inverse-functions-and-the-swap-and-solve-disconnect\/"},"modified":"2026-06-16T10:28:38","modified_gmt":"2026-06-16T14:28:38","slug":"on-finding-inverse-functions-and-the-swap-and-solve-disconnect","status":"publish","type":"article","link":"https:\/\/notes.math.ca\/fr\/article\/on-finding-inverse-functions-and-the-swap-and-solve-disconnect\/","title":{"rendered":"On Finding Inverse Functions and the \u00ab\u00a0Swap and Solve\u00a0\u00bb Disconnect"},"content":{"rendered":"<p><strong>The Procedural Trap vs. The Conceptual Reality<\/strong><\/p>\n<p>In mathematics classrooms in North America, an algebraic techniques is deeply entrenched as the standard algorithm for finding an inverse function: \u00ab\u00a0Switch \ud835\udc65 and \ud835\udc66, then solve for \ud835\udc66.\u00a0\u00bb While algebraically efficient in simple, unconstrained linear cases, this mechanical routine frequently strips away the actual meaning of the function. It leaves both students and teachers disoriented when they encounter domain restrictions or real-world contexts where variables hold fixed meanings (Paoletti et al., 2018).)<\/p>\n<p>The conceptual reality is that an inverse function reverses the process of the original function &#8211; it maps outputs back to their original inputs. When instruction prioritizes procedural fluency over this logical foundation, the switching technique turns into a mathematical \u00ab\u00a0trick\u00a0\u00bb rather than a structural consequence. In fact, what escapes most students and teachers who rely of the swapping procedure is that it \u201cworks\u201d based on the mathematical definition if inverse.<\/p>\n<p>Furthermore, this procedural focus often breeds a deeper cognitive avoidance of non-invertibility. For instance, when presented with a quadratic function over an unrestricted domain \u2013\u00a0 such as \ud835\udc53(\ud835\udc65)=(\ud835\udc65+1)\u00b2\u00a0 for all real numbers \u2013 many students and teachers experience a strong resistance to declaring that \u00ab\u00a0the inverse does not exist.\u00a0\u00bb Instead of recognizing that the function fails injectivity, they often succumb to a \u00ab\u00a0space of fuzziness,\u00a0\u00bb providing a \u00ab\u00a0slanted parabola\u00a0\u00bb or writing down a flawed +\/\u2212 \u00a0square root expression (Marmur &amp; Zazkis, 2018). Even those who recognize the issue often feel compelled to artificially restrict the domain on the spot just to avoid the claim of inexistence and revert to the known algorithm.<\/p>\n<p>To explore what happens when a domain restriction is an inherent part of the problem, let us analyze a specific illustrative example that exposes the fragility of procedural automatism.<\/p>\n<p>Consider the following problem: Find the inverse function of \ud835\udc53(\ud835\udc65)=(\ud835\udc65+1)\u00b2 given the restricted domain \ud835\udc65 \u2264 \u22122.<\/p>\n<p>Mathematically, there is no difference in the underlying logic whether one chooses to express the variable first or swap them first in case when variables hold no fixed meanings. However, the order in which a solver executes these procedures fundamentally alters the cognitive load and the visibility of the functional relationship. How do you expect your students will approach the task? For our students, the swapping approach appeared to be a preferred one, which often led them astray.<\/p>\n<p><strong>Swapping \ud835\udc99 and \ud835\udc9a first (The Procedural Trap)<\/strong><\/p>\n<p>We have observed the cognitive stupor that frequently occurs when a student immediately applies the school curriculum convention of swapping the variables at the very first step:<\/p>\n<p>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \ud835\udc65=(\ud835\udc66+1)<strong data-sfc-root=\"c\" data-sfc-cb=\"\" data-processed=\"true\" data-copy-service-computed-style=\"font-family: &quot;Google Sans&quot;, Arial, sans-serif; font-size: 16px; font-weight: 600; margin: 0px; text-decoration: none; border-bottom: 0px rgb(10, 10, 10);\">\u00b2<\/strong>\u00a0<\/p>\n<p>The goal is now to isolate the \u00ab\u00a0new\u00a0\u00bb y and state the domain of the inverse. It is precisely here that the technique often breaks down into disconnected silos:<\/p>\n<ul>\n<li>The Radical Stupor: Upon trying to take the square root of both sides, some individuals freeze. They glance back at the original problem statement (\ud835\udc65 \u2264 \u22122) and incorrectly deduce that they cannot take the square root of <em>x<\/em> because <em>x<\/em> is negative. They completely forget that the \u00ab\u00a0new\u00a0\u00bb x is actually the former y (the output), which is non-negative.<\/li>\n<\/ul>\n<ul>\n<li>The Absolute Value Oversight: Those who bypass this hurdle and write \u221a\ud835\udc65=\ud835\udc66+1 routinely forget the absolute value entirely, or they assume it resolves with a positive sign because \ud835\udc66+1 \u00ab\u00a0looks\u00a0\u00bb positive. They fail to realize that because the \u00ab\u00a0new\u00a0\u00bb <em>y<\/em> is the former <em>x<\/em>, it is bound by the original constraint (\ud835\udc66 &lt;= \u22122), making \ud835\udc66+1 negative. Thus, they miss the required negative sign, leading to an incorrect final function.<\/li>\n<\/ul>\n<p>To avoid either pitfall, we describe a different approach.<\/p>\n<p><strong>Expressing <em>x<\/em><\/strong><strong> in terms of <em>y <\/em><\/strong><strong><em>\u00a0<\/em>first (The Conceptual Path)<\/strong><\/p>\n<p>By maintaining the original variables during the algebraic manipulation, the functional roles of input and output remain clear and traceable:<\/p>\n<ol>\n<li>We begin with the functional relationship: \ud835\udc66=(\ud835\udc65+1)\u00b2<\/li>\n<\/ol>\n<ol start=\"2\">\n<li>Because both sides are non-negative within our constraints, we take the square root of both sides. Recalling that the square root of a square is the absolute value, we write: \u221a\ud835\udc66=|\ud835\udc65+1|<\/li>\n<\/ol>\n<ol start=\"3\">\n<li>Since the given domain states \ud835\udc65 \u2264 \u22122, it follows that \ud835\udc65+1 \u2264 \u22121, meaning the expression inside the absolute value is negative. Thus, the absolute value clears with a negative sign:<br \/>\u221a\ud835\udc66=\u2212(\ud835\udc65+1).<\/li>\n<\/ol>\n<ol start=\"4\">\n<li>Solving for x yields: \ud835\udc65=\u2212\u221a\ud835\udc66\u22121.<\/li>\n<\/ol>\n<p>At this stage, the mathematical inversion is entirely complete. We have successfully determined how the independent variable \ud835\udc65 depends on the output \ud835\udc66. To finish the description of this new function, we identify its domain, which must coincide exactly with the range of the original function. Since \ud835\udc65 \u2264 \u22122, the output values are \ud835\udc66 \u2265 1. Hence, the domain of the inverse is<br \/>\ud835\udc66 \u2265 1.<\/p>\n<p>For convenience, and to follow the standard convention that allows us to graph both functions on the same coordinate axes, we can now execute a variable swap:<br \/>\ud835\udc66=\u2212\u221a\ud835\udc65\u22121 for \ud835\udc65 \u2265 1.<\/p>\n<p>Every step in this progression preserves the logical connections between the functional law, the variables, and their corresponding domains.<\/p>\n<p><strong>Conclusion <\/strong><\/p>\n<p>The \u00ab\u00a0swap and solve\u00a0\u00bb technique is incredibly powerful in unconstrained linear cases where students see an open path to isolating , giving them a safe sense of progress. However, as our quadratic example demonstrates, this structural safety is an illusion. In more complex or restricted settings, swapping the variables at the beginning can obscure the relationships among the function rule, the domain, and the range.<\/p>\n<p>We admit that completely banishing a technique so deeply showcased in the classrooms may be impossible. Rather, teaching must shift instructional focus away from mechanical routines and toward meaningful solutions. Introductory calculus course in college or university may be an appropriate place to reconsider what \u201cworked\u201d in school. \u00a0By anchoring procedural steps in their logical, structural foundations, we can ensure our students view algebraic manipulations not as isolated magic tricks, but as a direct reflection of the structural beauty of inverse relationships.<\/p>\n<p>\u00a0<\/p>\n<p><strong>References<\/strong><\/p>\n<p>Marmur, O. &amp; Zazkis, R. (2018). Space of fuzziness: Avoidance of deterministic decisions in the case of the inverse function. <em>Educational Studies in Mathematics, 99<\/em>(3), 261-275.<\/p>\n<p>Paoletti, T., Stevens, I. E., Hobson, N. L., Moore, K. C., &amp; LaForest, K. R. (2018). Inverse function: Pre-service teachers\u2019 techniques and meanings. <em>Educa-tional Studies in Mathematics<\/em>, 97(1), 93-109.<\/p>\n","protected":false},"author":11,"template":"","section":[56],"keyword":[],"class_list":["post-21377","article","type-article","status-publish","hentry","section-education-notes"],"toolset-meta":{"author-4-info":{"author-4-surname":{"type":"textfield","raw":""},"author-4-given-names":{"type":"textfield","raw":""},"author-4-honorific":{"type":"textfield","raw":""},"author-4-institution":{"type":"textfield","raw":""},"author-4-email":{"type":"email","raw":""},"author-4-cms-role":{"type":"textfield","raw":""}},"author-3-info":{"author-3-surname":{"type":"textfield","raw":""},"author-3-given-names":{"type":"textfield","raw":""},"author-3-honorific":{"type":"textfield","raw":""},"author-3-institution":{"type":"textfield","raw":""},"author-3-email":{"type":"email","raw":""},"author-3-cms-role":{"type":"textfield","raw":""}},"author-2-info":{"author-2-surname":{"type":"textfield","raw":"Zazkis"},"author-2-given-names":{"type":"textfield","raw":"Rina"},"author-2-honorific":{"type":"textfield","raw":""},"author-2-institution":{"type":"textfield","raw":"Simon Fraser University"},"author-2-email":{"type":"email","raw":""},"author-2-cms-role":{"type":"textfield","raw":""}},"author-info":{"author-surname":{"type":"textfield","raw":"Guryev"},"author-given-names":{"type":"textfield","raw":"Konstantin"},"author-honorific":{"type":"textfield","raw":""},"author-email":{"type":"email","raw":""},"author-institution":{"type":"textfield","raw":"Simon Fraser University"},"author-cms-role":{"type":"textfield","raw":""}},"unknown":{"downloadable-pdf":{"type":"file","raw":"","attachment_id":null},"article-toc-weight":{"type":"numeric","raw":"3"},"author-surname":{"type":"textfield","raw":"Guryev"},"author-given-names":{"type":"textfield","raw":"Konstantin"}}},"_links":{"self":[{"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/article\/21377","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/article"}],"about":[{"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/types\/article"}],"author":[{"embeddable":true,"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/users\/11"}],"version-history":[{"count":3,"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/article\/21377\/revisions"}],"predecessor-version":[{"id":21381,"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/article\/21377\/revisions\/21381"}],"wp:attachment":[{"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/media?parent=21377"}],"wp:term":[{"taxonomy":"section","embeddable":true,"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/section?post=21377"},{"taxonomy":"keyword","embeddable":true,"href":"https:\/\/notes.math.ca\/fr\/wp-json\/wp\/v2\/keyword?post=21377"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}