{"id":267,"date":"2022-05-16T12:04:44","date_gmt":"2022-05-16T03:04:44","guid":{"rendered":"https:\/\/erkanyildiz.me\/blog\/?p=267"},"modified":"2025-09-16T06:02:44","modified_gmt":"2025-09-15T21:02:44","slug":"intuitive-explanations-of-some-math-expressions","status":"publish","type":"post","link":"https:\/\/erkanyildiz.me\/blog\/intuitive-explanations-of-some-math-expressions\/","title":{"rendered":"Intuitive Explanations of Some Math Expressions"},"content":{"rendered":"<p>Some math expressions look strange until you connect them to something real.<br \/>\nHere are a few that make more sense with the right picture in mind.<\/p>\n<h3>0\/0 (Zero divided by zero)<\/h3>\n<p>Zero divided by zero is not zero, but undefined.<br \/>\nLet's think of a law enforcement agent working with an informant, and receiving regular tips:<\/p>\n<ul>\n<li><strong>Week 1<\/strong>: The agent gets 4 tips from the informant, and decides to raid all 4 places. Finds something in 2 of them. Success rate of the informant is: <code>2\/4 = 0.5<\/code>.<\/li>\n<li><strong>Week 2<\/strong>: The agent gets 3 tips, and again decides to raid all, but finds nothing. Success rate of the informant can be said to be <code>0\/3 = 0<\/code>.<\/li>\n<li><strong>Week 3<\/strong>: The agent gets 5 tips, but this time decides to raid none of them. Success rate: <code>0\/0<\/code>.<\/li>\n<\/ul>\n<p>This last case is different. No raids mean no chance to measure success or failure.<br \/>\nWe can't say the informant was bad (0 success), and we can't say good either.<br \/>\nThat's why <code>0\/0<\/code> is undefined, not zero.<\/p>\n<h3>0!  (Zero factorial)<\/h3>\n<p>Zero factorial is not 0, but 1.<br \/>\nThe factorial is a fundamental concept in combinatorics, the study of counting.<br \/>\nThe number of ways to arrange <code>n<\/code> distinct objects is given by <code>n!<\/code>.<\/p>\n<p>For example:<\/p>\n<p>There are <code>3! = 6<\/code> ways to arrange three different books on a shelf.<br \/>\nThere are <code>2! = 2<\/code> ways to arrange two different books.<br \/>\nThere is <code>1! = 1<\/code> way to arrange one book.<\/p>\n<p>Now, how many ways are there to arrange zero books?<\/p>\n<p>If you have a set with zero objects (an empty set), there is only one way to arrange them: by doing nothing.<br \/>\nThe &quot;arrangement&quot; is the empty shelf arrangement itself.<\/p>\n<p>So, the number of ways to arrange zero objects is 1.<br \/>\nTherefore, <code>0! = 1<\/code>. This interpretation is the one most commonly used in mathematics to define 0!.<\/p>\n<h3>i (Unit imaginary number)<\/h3>\n<p>Unit imaginary number, the square root of <code>-1<\/code>, corresponds to 90 degrees in 2D vector space.<br \/>\nBut it isn't so imaginary if you think of it as a rotation.<br \/>\nFirst consider multiplying a number by <code>-1<\/code>. This changes its direction by 180 degrees on the number line.<br \/>\nMultiplying a number by <code>i<\/code>, corresponds to rotating it 90 degrees.<br \/>\nDoing this again results in a 180 degrees rotation.<br \/>\nThat's the same as flipping to the negative side: <code>i \u00d7 i = -1<\/code>.<br \/>\nThis is the geometric reason why <code>i = \u221a-1<\/code>.<\/p>\n<h3>0\u2070 (Zero to the power of zero)<\/h3>\n<p>At first glance, 0 raised to the power of 0 looks like nonsense.<br \/>\nOne may be tempted to say it is <code>0<\/code>.<br \/>\nParticularly in mathematical analysis, it is often considered an indeterminate form.<br \/>\nBut in combinatorics and algebra it is actually just <code>1<\/code>.<\/p>\n<p>This one may not sound as intuitive as the ones above, but let's start with a foundational combinatorial principle:<br \/>\nIf we have a set <code>A<\/code> with <code>k<\/code> elements and a set <code>B<\/code> with <code>n<\/code> elements, the number of possible functions (or mappings) from set A to set B is given by <code>n\u1d4f<\/code>.<\/p>\n<p>When we say &quot;number of possible functions&quot; we mean: how many different ways can we assign each element of one set (the domain) to elements of another set (the codomain).<\/p>\n<p>For example:<\/p>\n<ul>\n<li>Domain = <code>{Alice, Bob}<\/code> (2 people).<\/li>\n<li>Codomain = <code>{Coffee, Tea, Juice}<\/code> (3 drinks).<\/li>\n<li>Alice can pick any of the 3 drinks.<\/li>\n<li>Bob can also pick any of the 3 drinks, no matter what Alice chose.<\/li>\n<li>That gives <code>3\u00b2 = 9<\/code> different &quot;assignment rules&quot;.<\/li>\n<\/ul>\n<p>Each of those 9 is a distinct function (one might map both names to Coffee, another maps <code>Alice to Tea<\/code>, <code>Bob to Juice<\/code>, etc.).<br \/>\nBut at the end there 9 different functions can exist for this mapping. Let's list all those functions actually:<\/p>\n<ul>\n<li>Function 1: <code>Alice \u2192 Coffee, Bob \u2192 Coffee<\/code><\/li>\n<li>Function 2: <code>Alice \u2192 Coffee, Bob \u2192 Tea<\/code><\/li>\n<li>Function 3: <code>Alice \u2192 Coffee, Bob \u2192 Juice<\/code><\/li>\n<li>Function 4: <code>Alice \u2192 Tea, Bob \u2192 Coffee<\/code><\/li>\n<li>Function 5: <code>Alice \u2192 Tea, Bob \u2192 Tea<\/code><\/li>\n<li>Function 6: <code>Alice \u2192 Tea, Bob \u2192 Juice<\/code><\/li>\n<li>Function 7: <code>Alice \u2192 Juice, Bob \u2192 Coffee<\/code><\/li>\n<li>Function 8: <code>Alice \u2192 Juice, Bob \u2192 Tea<\/code><\/li>\n<li>Function 9: <code>Alice \u2192 Juice, Bob \u2192 Juice<\/code><\/li>\n<\/ul>\n<p>Each of these functions would take a name as input and return a drink as output.<br \/>\nAnd as you can see there <code>3\u00b2 = 9<\/code> distinct functions. No more, no less.<\/p>\n<p>Now let's apply this to the case of <code>0\u2070<\/code>.<br \/>\nWe need to consider the number of functions from a set of size <code>0<\/code> to a set of size <code>0<\/code>.<\/p>\n<ul>\n<li>Domain: is a set with 0 elements, which is the empty set, denoted by <code>\u2205<\/code>.<\/li>\n<li>Codomain:  is also the empty set, <code>\u2205<\/code>.<\/li>\n<li>So, we are trying to find the number of functions <code>f: \u2205 \u2192 \u2205<\/code>.<br \/>\nA function is a rule that assigns each element of the domain to exactly one element of the codomain.<br \/>\nLet's follow this rule for our two empty sets:<\/p>\n<ol>\n<li><em>&quot;...assigns each element of the domain...&quot;<\/em>\n<ul>\n<li>The domain is the empty set. It has no elements.<\/li>\n<li>This condition is satisfied because there are no elements to assign. The rule &quot;for each element&quot; is trivially true because there are no elements to check.<\/li>\n<\/ul>\n<\/li>\n<li><em>&quot;...to exactly one element of the codomain.&quot;<\/em>\n<ul>\n<li>This part of the rule is also satisfied, again because there are no elements to assign.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<\/li>\n<\/ul>\n<p>So, the &quot;rule&quot; of the function holds true. The assignment is just a &quot;do nothing&quot; assignment. There is exactly one way to do nothing.<br \/>\nThe &quot;one way to do nothing&quot; is the empty function.<br \/>\nSince there is only one such function (the empty function itself), the number of ways to map elements from a set of 0 elements to a set of 0 elements is 1. Therefore, <code>0\u2070 = 1<\/code>.<\/p>\n<h3>Negative exponent<\/h3>\n<p>Exponents don't stop at whole numbers. Once you see the pattern, negatives and fractions fit naturally.<\/p>\n<p><code>a\u207b\u00b9<\/code> just means &quot;divide by a&quot;.<br \/>\nBecause <code>a\u00b9 \u00d7 a\u207b\u00b9 = a\u207d\u00b9\u207b\u00b9\u207e = a\u2070 = 1<\/code>.<br \/>\nExample: <code>2\u207b\u00b9 = 1\/2<\/code>, <code>10\u207b\u00b9 = 1\/10<\/code>.<br \/>\nIn general: <code>a\u207b\u207f = 1 \/ (a\u207f)<\/code>.<br \/>\nThis comes directly from the rule <code>a\u1d50 \u00d7 a\u207f = a\u207d\u1d50 \u207a \u207f\u207e<\/code>.<br \/>\nIf you want exponents to add consistently, negative exponents must represent division.<\/p>\n<h3>Fractional exponent<\/h3>\n<p><code>a\u00b9\u141f\u00b2<\/code> means &quot;a number that when multiplied by itself gives <code>a<\/code>&quot;.<br \/>\nBecause <code>a\u00b9\u141f\u00b2 \u00d7 a\u00b9\u141f\u00b2 = a\u207d\u00b9\u141f\u00b2 \u207a \u00b9\u141f\u00b2\u207e = a\u00b9 = a<\/code>.<br \/>\nThat's why <code>a\u00b9\u141f\u00b2<\/code> is the square root.<\/p>\n<p>Similarly, <code>a\u00b9\u141f\u00b3<\/code> means &quot;a number that when multiplied by itself three times gives <code>a<\/code>&quot;.<br \/>\nBecause <code>a\u00b9\u141f\u00b3 \u00d7 a\u00b9\u141f\u00b3 \u00d7 a\u00b9\u141f\u00b3 = a\u207d\u00b9\u141f\u00b3 \u207a \u00b9\u141f\u00b3 \u207a \u00b9\u141f\u00b3\u207e = a\u00b9 = a<\/code>.<br \/>\nThat's why <code>a\u00b9\u141f\u00b3<\/code> is the cube root.<\/p>\n<p>More generally:<br \/>\n<code>a\u00b9\u141f\u207f<\/code> is the <code>n-th<\/code> root of <code>a<\/code>.<br \/>\n<code>a\u1d50\u141f\u207f = (a\u00b9\u141f\u207f)\u1d50<\/code>.<\/p>\n<p>Example: <code>8\u00b2\u141f\u00b3 = (8\u00b9\u141f\u00b3)\u00b2 = 2\u00b2 = 4<\/code>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Some math expressions look strange until you connect them to something real. Here are a few that make more sense with the right picture in mind. 0\/0 (Zero divided by zero) Zero divided by zero is not zero, but undefined. Let&#8217;s think of a law enforcement agent working with an informant, and receiving regular tips: [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-267","post","type-post","status-publish","format-standard","hentry","category-development"],"_links":{"self":[{"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/posts\/267","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/comments?post=267"}],"version-history":[{"count":15,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/posts\/267\/revisions"}],"predecessor-version":[{"id":282,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/posts\/267\/revisions\/282"}],"wp:attachment":[{"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/media?parent=267"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/categories?post=267"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/erkanyildiz.me\/blog\/wp-json\/wp\/v2\/tags?post=267"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}