# Why −(−a) = a Is Secretly a Theorem > Everybody knows that two minus signs make a plus, but in the first chapter of a real analysis course it is a theorem, and its proof is one motion. This lecture reads the minus sign as a job title rather than a sign: minus a is whichever number cancels a, so the double minus is the canceler of the canceler. The inverse axiom promises that a canceler exists; it never promises there is only one. We build a four element addition table where identity, inverses and commutativity all hold, associativity fails, and the double minus genuinely lands on the wrong number. Then we slide one bracket along a row of three symbols to prove that cancelers are unique, apply the same slide to a plus its canceler plus that canceler's canceler, and finish by marking out what this ground floor result does not yet give you: nothing about products, and nothing about the word positive. - Canonical watch page: [Why −(−a) = a Is Secretly a Theorem](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem) - Publisher: [Academa, Inc.](https://academa.ai) - Subject: Mathematics - Published: 2026-09-02T04:36:45.302Z - Updated: 2026-09-02T04:36:45.302Z - Duration: PT807S (13 minutes 27 seconds) - Chapters: 6 - Views: 1 - Language: en-US - Access: Free - Video stream: [HLS content](https://academa.ai/media/l/01M1G55RAYY6BFTNC2PZYEQ2CX/0/dark/master.m3u8) - Audiovisual record: [Semantic JSON](https://academa.ai/media/l/01M1G55RAYY6BFTNC2PZYEQ2CX/0/semantic.json) - Thumbnail: [Image](https://academa.ai/media/l/01M1G55RAYY6BFTNC2PZYEQ2CX/0/dark/poster.jpg) ## Description Two minus signs make a plus is a theorem: existence is free from the inverse axiom, uniqueness costs one slide of a bracket. ## Chapters - [00:00–02:10.901 · Two Minuses, and an Argument](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0) - [02:10.901–04:33.973 · The Minus Sign Is a Job Title](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=130.90145833333332) - [04:33.973–06:22.544 · A World Where It Fails](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=273.97304166666663) - [06:22.544–08:22.88 · The Bracket Slides](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=382.5438958333333) - [08:22.88–11:17.889 · Cashing It In](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=502.8800625) - [11:17.889–13:27 · What It Does Not Prove](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=677.8892708333333) ## Transcript ### [00:00 · Two Minuses, and an Argument](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0) Everybody knows this one. Turn around, then turn around again, and you are facing the way you started. Flip a coin twice and it shows the same face. Cancel somebody's debt, and you have handed them money. Two minus signs make a plus. So why did one short question about it turn into a twelve hour argument, on a forum full of people learning mathematics? An argument that ended only when one of the two people in it wrote, you are right, my apologies. The two sides went like this. One of them said the fact holds in any system where you can add and cancel, so there is nothing to prove. The other said that the proof on offer assumed the very thing it was trying to prove. You cannot get a theorem by writing a symbol down in a suggestive way. They were both pointing at something real. There is a small, genuine theorem hiding inside this obvious fact, and the argument was about where it lives. To find it we have to work only from the rules. The person who asked was reading the first chapter of Spivak's Calculus, which opens by writing down the rules that numbers obey. From here on we are allowed exactly what the rules say and nothing else. No obviously. No number line. Rule one: grouping does not matter. If you are adding three things, you may bracket the first pair or the last pair, and you get the same answer. Rule two: there is a number called zero, and adding it does nothing at all. And rule three, the one the whole argument is about. For every number a, there is a number, written minus a, that cancels it. a plus minus a is zero, and minus a plus a is zero as well. Now read that third rule again, slowly, in words. Four of those words are going to carry this entire video. There is a number. It says there is a number. It never says there is only one. And notice one last thing before we go on. The fourth rule on that list, that a plus b equals b plus a, we are never going to use. ### [02:10.901 · The Minus Sign Is a Job Title](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=130.90145833333332) Three rules and a claim. Before we argue about the claim, we had better be sure what its symbols mean, and the minus sign is where people slip. In this rulebook the minus sign is not a property of a number. It is not negativeness. It is a job title. Minus a means whichever number holds the job of cancelling a. Rule three hands us that number and says what the job is: a plus minus a is zero. Let me draw it. Here is a, here is its canceler, and I will join two numbers with a line whenever they add to zero. If a is five, the canceler is minus five. If a is minus three, the canceler is three, so a symbol with a minus in front can perfectly well be a positive number. And zero cancels itself. Now read the thing we are trying to prove from the inside out. Minus a is the canceler of a. So minus minus a is the canceler of the canceler of a. I am keeping that one grey, with a question mark on it, because at this point in the story we do not know which number it is. Here is where the thread got tangled, and it is a good tangle. Does a cancel minus a? Yes, at once. Rule three says minus a plus a is zero, and that is exactly the job. So a does it, for free. So are we done? Not quite, and the difference is a single word. What we have shown is that a is a canceler of minus a. What the symbol names is the canceler of minus a. Look at rule three once more. It promised that a canceler exists. It never promised there is only one. If minus a had two different cancelers, the symbol would be ambiguous. It might be a. It might be the grey one. Two minuses making a plus would be a coin toss. So here is the theorem underneath the claim. Every number has exactly one canceler. Once you have that, minus minus a equals a is only that theorem, read out at the number minus a. And you might think exactly one canceler is obviously true. It is not. ### [04:33.973 · A World Where It Fails](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=273.97304166666663) To see that exactly one canceler is not obvious, let me build a number system where it is false. Four numbers: zero, a, b and c. Its addition is given by a table, the same kind you learned your sums from, only smaller. Check rule two. The zero row and the zero column hand everything straight back, unchanged. Zero does nothing here. Check rule three. Every number here has a canceler. a and b add to zero. c and b add to zero. And zero cancels itself. The table is even symmetric, so this addition commutes too. Now look at the row for b. It has two zeros in it. b is cancelled by a, and b is also cancelled by c. In this world, b has two cancelers. So compute the canceler of the canceler of a. The row for a has exactly one zero, in the b column, so minus a is b. Now the row for b has two zeros, so the canceler of b is a, or it is c. Take c. In this little world, minus minus a is c, and c is not a. Which rule did we break? Not rule two. Not rule three. And commutativity is fine as well. Look at rule one. Add a and b first, then add c: a plus b is zero, and zero plus c is c. Now bracket the other pair: b plus c is zero, and a plus zero is a. And look at the two values we just got. The first was c. The second was a. Those are exactly the two numbers that were fighting over the title canceler of b. That is not a coincidence. It is our theorem, seen from the wrong side. ### [06:22.544 · The Bracket Slides](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=382.5438958333333) So what does our number system have that the toy one does not? One thing. The bracket can slide. Here is what that buys us. Suppose two numbers, a and c, both cancel the same number b. So a plus b is zero, and b plus c is zero. I am assuming nothing else about them. Must a and c be the same number? Write all three of them in a row: a plus b plus c. Rule one says this row has one value, no matter how I bracket it. So let us bracket it two different ways and compare. Bracket the left pair first. a and b cancel, so that pair is zero. Zero plus c is c. The whole row is worth c. Now the one motion to remember from this whole video. Watch the bracket leave the left pair, and land on the right pair instead. Now the same thing happens at the other end. b and c cancel, so that pair is zero. a plus zero is a. The row is worth a. Same row. One value. So a equals c, and that is the proof. Any two cancelers of the same number are equal. Cancelers are unique. There is nothing clever in that argument. a and c only had to be in the same room as b, and rule one is what puts them there. In the toy world the bracket cannot slide, so a and c never have to meet, and nothing makes them equal. That is the only difference between the two worlds. Let us write that down as a theorem, because we are about to use it twice. If a cancels b, and c also cancels b, then a and c are the same number. Rule three says a canceler exists. Rule one says there is only ever one. ### [08:22.88 · Cashing It In](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=502.8800625) Before we cash it in, let us fix what the symbol is allowed to mean. Minus minus a is a canceler of minus a, any one of them. We are not assuming there is only one of them, because that is the thing we are proving. Now rule three gives us two promises. First: a has a canceler, and the two of them add to zero. Second: minus a has a canceler too, and minus minus a is the name of one. Write all three in a row, exactly as before: a, then the canceler of a, then the canceler of that. Rule one says this row has one value however I bracket it. Bracket the left pair. a and its canceler make zero, and zero plus the last slot leaves the last slot standing. So the row is worth minus minus a. Now slide it. The bracket leaves the left pair and lands on the right pair instead. And now the other two cancel, by the promise we just wrote down. a plus zero is a. So the row is worth a. Same row, one value. So minus minus a equals a. That is the theorem we came for, and it is now proved. Written as a single chain, the whole proof is five lines. Zero does nothing, so the thing on the left is zero plus itself. That is rule two. That zero is a plus the canceler of a: rule three. And now the only interesting line in the proof. Slide the bracket. Rule one. The middle and the right cancel, by rule three again, leaving a plus zero. And a plus zero is a, by rule two. Done. Now notice what never happened in that chain. We never swapped two terms. The fourth rule, that a plus b equals b plus a, was never used. So this is not really a fact about numbers. It holds anywhere there is a zero, an undo for every move, and a bracket that slides. Rotating a cube. Shuffling a deck. The undo of the undo is the move you started with. So back to the argument. Who was right? Both of them, describing one theorem from opposite ends. The person who asked had the shape of it exactly right. a cancels minus a. Cancelers are unique. Therefore a is the canceler of minus a, and minus minus a is only its name. The objection was right too: you cannot get that middle line by notation. Which is exactly why the small proof earns its keep. It proves the middle line on the spot, with one slide of the bracket. The objector saw that, and said so. That is a good thread. ### [11:17.889 · What It Does Not Prove](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=677.8892708333333) One more question from the thread, and it is a good one. Does everything we have just done prove that a negative times a negative is a positive? No. And seeing why is worth a minute. Think of the rules as a building. Everything today happened on the ground floor: addition, zero, cancelers, and the bracket that slides. On this floor there is no multiplication at all, and no such thing as a positive or a negative number. Minus a is only the canceler of a, and it might be five, or minus five, or zero. To even say negative times negative you need the next floor up: multiplication, and the rule that ties it to addition. Watch what happens there. Add a to minus one times a, and rewrite the first a as one times a. Pull the a out. One plus minus one is zero, and zero times anything is zero. So minus one times a cancels a. And because cancelers are unique, minus one times a is minus a. That is our engine, borrowed. From there, minus a times minus b works out to a times b, and that step uses today's theorem. But you still have not said the word positive. For that you need a third floor, the rules for which numbers count as positive, and only there does the sentence mean anything. Today's theorem is one brick in that wall. A load bearing one. But it is not the wall. So here is the picture to keep. Draw a line between two numbers whenever they add to zero. Rule three says every number gets at least one such line. Rule one says no number gets two. So the lines make a perfect pairing, and zero is its own partner. Minus minus a equals a says exactly this: go to your partner, then go to your partner's partner, and you are home. Turn around twice: true. Why it is true: one slide of a bracket. ## About Academa, Inc. Academa makes technical knowledge easier to understand through visual lectures and lets learners request new lecture videos on the topics they need. ## Complete audiovisual record Immutable source: [semantic.json](https://academa.ai/media/l/01M1G55RAYY6BFTNC2PZYEQ2CX/0/semantic.json) Record version: 1. Render attempt: 0. ### How to read this timeline Each scene owns its object identifiers. A beat's board is the complete board when listed, empty when marked empty, and unchanged from the nearest earlier listed board in the same scene when marked unchanged. Action times are absolute positions in the published video. ### Scene 1: [Two Minuses, and an Argument](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0) Span: 00:00–02:10.901 (0s–130.90145833333332s). #### Objects - chapter: a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers" - claim: a Math \[text\] that says "$-(-a) = a$" - head\_open: a Heading that says "Everybody Knows This One" - head\_rules: a Heading that says "The Rulebook" - head\_thread: a Heading that says "A Twelve Hour Argument" - intuitions: a Block \[text\] that says "Turn around, then turn around again. Flip a coin twice. Cancel a debt, and you are given money." - label\_no: a Tex \[text\] that says "Or did it need a proof?" - label\_yes: a Tex \[text\] that says "Was it obvious?" - p1: a Math \[text\] that says "$upright("P1") quad a + (b + c) = (a + b) + c$" - p2: a Math \[text\] that says "$upright("P2") quad a + 0 = 0 + a = a$" - p3: a Math \[text\] that says "$upright("P3") quad a + (-a) = (-a) + a = 0$" - p3\_words: a Panel that says "For every number $a$ there is a number $-a$ such that $a + (-a) = (-a) + a = 0$." - p4\_aside: a Panel that says "The list has a fourth rule, $a + b = b + a$. We will not need it." - voice\_no: a Panel that says "Your proof assumes its own conclusion. Writing a symbol down in a suggestive way is not an argument." - voice\_yes: a Panel that says "This holds in every system where you can add and cancel. There is nothing here to prove." #### Beats ##### [00:00](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0) Narration: Everybody knows this one. Turn around, then turn around again, and you are facing the way you started. Flip a coin twice and it shows the same face. Cancel somebody's debt, and you have handed them money. Two minus signs make a plus. Board: Empty. Actions: - [00:00](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0): head\_open is shown on the screen, written out. - [00:00](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=0): claim is shown on the screen, written out. - [00:1.741](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=1.741): intuitions is shown on the screen, written out. - [00:5.422](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=5.422): intuitions (the "Turn around" part) is emphasized. - [00:7.21](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=7.21): intuitions (the "Flip a coin" part) is emphasized. - [00:7.21](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=7.21): intuitions (the "Turn around" part) is no longer emphasized. - [00:10.321](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=10.321): intuitions (the "Cancel a debt" part) is emphasized. - [00:10.321](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=10.321): intuitions (the "Flip a coin" part) is no longer emphasized. - [00:14.594](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=14.594): intuitions (the "Cancel a debt" part) is no longer emphasized. ##### [00:15.194](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=15.193999999999999) Narration: So why did one short question about it turn into a twelve hour argument, on a forum full of people learning mathematics? An argument that ended only when one of the two people in it wrote, you are right, my apologies. Board: claim — a Math \[text\] that says "$-(-a) = a$"; intuitions — a Block \[text\] that says "Turn around, then turn around again. Flip a coin twice. Cancel a debt, and you are given money."; head\_open — a Heading that says "Everybody Knows This One" Actions: - [00:16.703](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=16.702999999999996): claim is indicated — a transient flash. - [00:28.011](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=28.011499999999998): claim is hidden from the screen — left the board. - [00:28.011](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=28.011499999999998): head\_open is hidden from the screen — left the board. - [00:28.011](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=28.011499999999998): intuitions is hidden from the screen — left the board. ##### [00:29.212](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=29.2115) Narration: The two sides went like this. One of them said the fact holds in any system where you can add and cancel, so there is nothing to prove. Board: Empty. Actions: - [00:29.212](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=29.2115): head\_thread is shown on the screen, written out. - [00:31.881](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=31.881): label\_yes is shown on the screen, written out. - [00:32.415](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=32.415000000000006): voice\_yes is shown on the screen, written out. ##### [00:38.008](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=38.008) Narration: The other said that the proof on offer assumed the very thing it was trying to prove. You cannot get a theorem by writing a symbol down in a suggestive way. Board: label\_yes — a Tex \[text\] that says "Was it obvious?"; voice\_yes — a Panel that says "This holds in every system where you can add and cancel. There is nothing here to prove."; head\_thread — a Heading that says "A Twelve Hour Argument" Actions: - [00:38.008](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=38.008): label\_no is shown on the screen, written out. - [00:40.376](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=40.376000000000005): voice\_no is shown on the screen, written out. ##### [00:47.181](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=47.1815) Narration: They were both pointing at something real. There is a small, genuine theorem hiding inside this obvious fact, and the argument was about where it lives. To find it we have to work only from the rules. Board: label\_yes — a Tex \[text\] that says "Was it obvious?"; voice\_yes — a Panel that says "This holds in every system where you can add and cancel. There is nothing here to prove."; label\_no — a Tex \[text\] that says "Or did it need a proof?"; voice\_no — a Panel that says "Your proof assumes its own conclusion. Writing a symbol down in a suggestive way is not an argument."; head\_thread — a Heading that says "A Twelve Hour Argument" Actions: - [00:47.686](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=47.686): voice\_yes (the "add and cancel" part) is indicated — a transient flash. - [00:48.836](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=48.836): voice\_no (the "assumes its own conclusion" part) is indicated — a transient flash. - [00:59.865](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=59.865): head\_thread is hidden from the screen — left the board. - [00:59.865](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=59.865): label\_no is hidden from the screen — left the board. - [00:59.865](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=59.865): label\_yes is hidden from the screen — left the board. - [00:59.865](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=59.865): voice\_no is hidden from the screen — left the board. - [00:59.865](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=59.865): voice\_yes is hidden from the screen — left the board. ##### [01:1.065](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=61.065) Narration: The person who asked was reading the first chapter of Spivak's Calculus, which opens by writing down the rules that numbers obey. From here on we are allowed exactly what the rules say and nothing else. No obviously. No number line. Board: Empty. Actions: - [01:1.065](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=61.065): head\_rules is shown on the screen, written out. - [01:3.306](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=63.306): chapter is shown on the screen, written out. ##### [01:16.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=76.502) Narration: Rule one: grouping does not matter. If you are adding three things, you may bracket the first pair or the last pair, and you get the same answer. Board: chapter — a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers"; head\_rules — a Heading that says "The Rulebook" Actions: - [01:17.326](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=77.326): p1 is shown on the screen, written out. ##### [01:26.564](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=86.564) Narration: Rule two: there is a number called zero, and adding it does nothing at all. Board: chapter — a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers"; p1 — a Math \[text\] that says "$upright("P1") quad a + (b + c) = (a + b) + c$"; head\_rules — a Heading that says "The Rulebook" Actions: - [01:27.261](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=87.261): p2 is shown on the screen, written out. ##### [01:32.632](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=92.6325) Narration: And rule three, the one the whole argument is about. For every number a, there is a number, written minus a, that cancels it. a plus minus a is zero, and minus a plus a is zero as well. Board: chapter — a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers"; p1 — a Math \[text\] that says "$upright("P1") quad a + (b + c) = (a + b) + c$"; p2 — a Math \[text\] that says "$upright("P2") quad a + 0 = 0 + a = a$"; head\_rules — a Heading that says "The Rulebook" Actions: - [01:33.538](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=93.53800000000001): p3 is shown on the screen, written out. - [01:39.738](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=99.73800000000001): p3 (the "(-a)" part) is indicated — a transient flash. ##### [01:47.419](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=107.4195) Narration: Now read that third rule again, slowly, in words. Four of those words are going to carry this entire video. There is a number. Board: chapter — a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers"; p1 — a Math \[text\] that says "$upright("P1") quad a + (b + c) = (a + b) + c$"; p2 — a Math \[text\] that says "$upright("P2") quad a + 0 = 0 + a = a$"; p3 — a Math \[text\] that says "$upright("P3") quad a + (-a) = (-a) + a = 0$"; head\_rules — a Heading that says "The Rulebook" Actions: - [01:50.635](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=110.635): p3\_words is shown on the screen, written out. - [01:53.317](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=113.31700000000001): p3\_words (the "there is a number" part) is emphasized. ##### [01:56.645](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=116.645) Narration: It says there is a number. It never says there is only one. And notice one last thing before we go on. The fourth rule on that list, that a plus b equals b plus a, we are never going to use. Board: chapter — a Tex \[text\] that says "Spivak, Chapter 1: Basic Properties of Numbers"; p1 — a Math \[text\] that says "$upright("P1") quad a + (b + c) = (a + b) + c$"; p2 — a Math \[text\] that says "$upright("P2") quad a + 0 = 0 + a = a$"; p3 — a Math \[text\] that says "$upright("P3") quad a + (-a) = (-a) + a = 0$"; p3\_words — a Panel that says "For every number $a$ there is a number $-a$ such that $a + (-a) = (-a) + a = 0$."; head\_rules — a Heading that says "The Rulebook" Actions: - [02:0.779](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=120.77900000000001): p3\_words (the "there is a number" part) is no longer emphasized. - [02:3.426](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=123.426): p4\_aside is shown on the screen, written out. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): chapter is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): head\_rules is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): p1 is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): p2 is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): p3 is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): p3\_words is hidden from the screen — left the board. - [02:9.86](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=129.8597916666667): p4\_aside is hidden from the screen — left the board. ### Scene 2: [The Minus Sign Is a Job Title](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=130.90145833333332) Span: 02:10.901–04:33.973 (130.90145833333332s–273.97304166666663s). #### Objects - cancels: a Math \[text\] that says "$a + (-a) = 0$" - edge: a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)) - edge\_q: a Line \[gray\] labelled "0" drawn in web (start=(4.9, 1.0), end=(4.9, 3.0), dashed=True) - free: a Math \[text\] that says "$(-a) + a = 0 quad upright("(P3)")$" - gap\_q: a Panel that says "Is $a$ a canceler of $-a$, or is it the canceler?" - head\_gap: a Heading that says "A Canceler, or The Canceler?" - head\_job: a Heading that says "The Minus Sign Is a Job Title" - head\_parse: a Heading that says "Read It Inside Out" - head\_under: a Heading that says "The Theorem Underneath" - job: a Panel that says "In this rulebook $-a$ is not a sign stuck to a number. It is a name for whichever number cancels $a$." - jobs: a Table \[text\] that says "Name Its job $-a$ cancels $a$ $-(-a)$ cancels $-a$" (rows=(('Name', 'Its job'), ('$-a$', 'cancels $a$'), ('$-(-a)$', 'can…, header=True) - node\_a: a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)) - node\_na: a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)) - node\_q: a Point \[gray\] labelled "?" drawn in web (location=(4.9, 1.0)) - target: a Math \[gray\] that says "$-(-a) = a$" - under: a Panel that says "Every number has exactly one canceler." - web: a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)) #### Beats ##### [02:10.901](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=130.90145833333332) Narration: Three rules and a claim. Before we argue about the claim, we had better be sure what its symbols mean, and the minus sign is where people slip. Board: Empty. Actions: - [02:10.901](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=130.90145833333332): head\_job is shown on the screen, written out. ##### [02:20.116](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=140.1159583333333) Narration: In this rulebook the minus sign is not a property of a number. It is not negativeness. It is a job title. Minus a means whichever number holds the job of cancelling a. Board: head\_job — a Heading that says "The Minus Sign Is a Job Title" Actions: - [02:26.431](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=146.43145833333332): job is shown on the screen, written out. ##### [02:32.43](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=152.42995833333333) Narration: Rule three hands us that number and says what the job is: a plus minus a is zero. Let me draw it. Here is a, here is its canceler, and I will join two numbers with a line whenever they add to zero. Board: job — a Panel that says "In this rulebook $-a$ is not a sign stuck to a number. It is a name for whichever number cancels $a$."; head\_job — a Heading that says "The Minus Sign Is a Job Title" Actions: - [02:38.745](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=158.74545833333332): cancels is shown on the screen, written out. - [02:40.359](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=160.35945833333332): web is shown on the screen, written out. - [02:41.648](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=161.64845833333334): node\_a is shown on the screen, written out. - [02:43.25](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=163.2504583333333): node\_na is shown on the screen, written out. - [02:45.885](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=165.88545833333333): edge is shown on the screen, written out. ##### [02:48.784](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=168.78445833333333) Narration: If a is five, the canceler is minus five. If a is minus three, the canceler is three, so a symbol with a minus in front can perfectly well be a positive number. And zero cancels itself. Board: job — a Panel that says "In this rulebook $-a$ is not a sign stuck to a number. It is a name for whichever number cancels $a$."; cancels — a Math \[text\] that says "$a + (-a) = 0$"; web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); head\_job — a Heading that says "The Minus Sign Is a Job Title"; node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)) Actions: - [02:50.63](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=170.63045833333334): node\_na is indicated — a transient flash. - [03:3.482](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=183.48245833333334): web moves to a new place on the board. - [03:3.482](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=183.48245833333334): cancels is hidden from the screen — left the board. - [03:3.482](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=183.48245833333334): head\_job is hidden from the screen — left the board. - [03:3.482](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=183.48245833333334): job is hidden from the screen — left the board. ##### [03:4.682](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=184.68245833333333) Narration: Now read the thing we are trying to prove from the inside out. Minus a is the canceler of a. So minus minus a is the canceler of the canceler of a. Board: web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)) Actions: - [03:4.682](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=184.68245833333333): head\_parse is shown on the screen, written out. - [03:4.682](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=184.68245833333333): jobs is shown on the screen, written out. - [03:9.163](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=189.16345833333332): jobs is shown on the screen, written out. - [03:12.611](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=192.61145833333333): jobs is shown on the screen, written out. - [03:14.098](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=194.09845833333333): node\_q is shown on the screen, written out. - [03:14.516](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=194.51647242951907): edge\_q is shown on the screen, written out. ##### [03:17.194](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=197.19395833333334) Narration: I am keeping that one grey, with a question mark on it, because at this point in the story we do not know which number it is. Board: web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)); head\_parse — a Heading that says "Read It Inside Out"; node\_q — a Point \[gray\] labelled "?" drawn in web (location=(4.9, 1.0)); edge\_q — a Line \[gray\] labelled "0" drawn in web (start=(4.9, 1.0), end=(4.9, 3.0), dashed=True) Actions: - [03:20.131](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=200.1314583333333): node\_q is indicated — a transient flash. - [03:25.46](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=205.45995833333333): head\_parse is hidden from the screen — left the board. - [03:25.46](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=205.45995833333333): jobs is hidden from the screen — left the board. ##### [03:26.66](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=206.65995833333332) Narration: Here is where the thread got tangled, and it is a good tangle. Does a cancel minus a? Yes, at once. Rule three says minus a plus a is zero, and that is exactly the job. So a does it, for free. Board: web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)); node\_q — a Point \[gray\] labelled "?" drawn in web (location=(4.9, 1.0)); edge\_q — a Line \[gray\] labelled "0" drawn in web (start=(4.9, 1.0), end=(4.9, 3.0), dashed=True) Actions: - [03:26.66](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=206.65995833333332): head\_gap is shown on the screen, written out. - [03:34.961](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=214.96145833333333): free is shown on the screen, written out. - [03:41.544](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=221.54445833333332): edge is indicated — a transient flash. ##### [03:42.864](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=222.86445833333332) Narration: So are we done? Not quite, and the difference is a single word. What we have shown is that a is a canceler of minus a. What the symbol names is the canceler of minus a. Board: web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)); node\_q — a Point \[gray\] labelled "?" drawn in web (location=(4.9, 1.0)); edge\_q — a Line \[gray\] labelled "0" drawn in web (start=(4.9, 1.0), end=(4.9, 3.0), dashed=True); free — a Math \[text\] that says "$(-a) + a = 0 quad upright("(P3)")$"; head\_gap — a Heading that says "A Canceler, or The Canceler?" Actions: - [03:47.102](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=227.10245833333335): gap\_q is shown on the screen, written out. ##### [03:55.585](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=235.5849583333333) Narration: Look at rule three once more. It promised that a canceler exists. It never promised there is only one. If minus a had two different cancelers, the symbol would be ambiguous. It might be a. It might be the grey one. Two minuses making a plus would be a coin toss. Board: web — a Figure (x\_range=(0.0, 6.4), y\_range=(0.0, 4.2), aspect=(5.0, 3.4)); node\_a — a Point \[blue\] labelled "a" drawn in web (location=(1.5, 3.0)); node\_na — a Point \[yellow\] labelled "-a" drawn in web (location=(4.9, 3.0)); edge — a Line \[green\] labelled "0" drawn in web (start=(1.5, 3.0), end=(4.9, 3.0)); node\_q — a Point \[gray\] labelled "?" drawn in web (location=(4.9, 1.0)); edge\_q — a Line \[gray\] labelled "0" drawn in web (start=(4.9, 1.0), end=(4.9, 3.0), dashed=True); free — a Math \[text\] that says "$(-a) + a = 0 quad upright("(P3)")$"; gap\_q — a Panel that says "Is $a$ a canceler of $-a$, or is it the canceler?"; head\_gap — a Heading that says "A Canceler, or The Canceler?" Actions: - [04:4.071](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=244.07145833333334): edge\_q is indicated — a transient flash. - [04:9.47](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=249.47045833333334): node\_q is indicated — a transient flash. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): free is hidden from the screen — left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): gap\_q is hidden from the screen — left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): head\_gap is hidden from the screen — left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): web is hidden from the screen — left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): node\_a is hidden from the screen — web left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): node\_na is hidden from the screen — web left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): edge is hidden from the screen — web left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): node\_q is hidden from the screen — web left the board. - [04:13.755](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=253.75495833333332): edge\_q is hidden from the screen — web left the board. ##### [04:14.955](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=254.9549583333333) Narration: So here is the theorem underneath the claim. Every number has exactly one canceler. Once you have that, minus minus a equals a is only that theorem, read out at the number minus a. And you might think exactly one canceler is obviously true. It is not. Board: Empty. Actions: - [04:14.955](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=254.9549583333333): head\_under is shown on the screen, written out. - [04:18.054](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=258.05445833333334): under is shown on the screen, written out. - [04:25.612](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=265.61245833333334): target is shown on the screen, written out. - [04:30.535](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=270.53545833333334): under (the "exactly one" part) is emphasized. - [04:32.681](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=272.681375): under (the "exactly one" part) is no longer emphasized. - [04:32.931](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=272.931375): head\_under is hidden from the screen — left the board. - [04:32.931](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=272.931375): target is hidden from the screen — left the board. - [04:32.931](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=272.931375): under is hidden from the screen — left the board. ### Scene 3: [A World Where It Fails](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=273.97304166666663) Span: 04:33.973–06:22.544 (273.97304166666663s–382.5438958333333s). #### Objects - assoc: a Derivation \[text\] that says "$(a plus.o b) plus.o c &= 0 plus.o c = c \\ a plus.o (b plus.o c) &= a plus.o 0 = a$" - checklist: a Block \[text\] that says "P2 holds: zero does nothing. P3 holds: everything has a canceler. Addition even commutes. P1 fails." - f\_ab: a Math \[text\] that says "$a plus.o b = b plus.o a = 0$" - f\_cb: a Math \[text\] that says "$c plus.o b = b plus.o c = 0$" - f\_na: a Math \[text\] that says "$-a = b$" - f\_nb: a Math \[text\] that says "$-b = a quad upright("or") quad -b = c$" - f\_zero: a Math \[text\] that says "$0 plus.o x = x plus.o 0 = x$" - head\_break: a Heading that says "Which Rule Did We Break?" - table: a Table \[text\] that says "$plus.o$ $0$ $a$ $b$ $c$ $0$ $0$ $a$ $b$ $c$ $a$ $a$ $c$ $0$ $b$ $b$ $b$ $0$ $b$ $0$ $c$ $c$ $b$ $0$ $a$" (rows=(('$plus.o$', '$0$', '$a$', '$b$', '$c$'), ('$0$', '$0$', '$a$'…, header=True) - toy\_answer: a Math \[text\] that says "$-(-a) = c eq.not a$" - toy\_q: a Panel that says "Does every number have exactly one canceler? Here is a system of four numbers where it does not. Its plus sits in a circle, so nobody mistakes it for ordinary addition." - verdict: a Math \[text\] that says "$c eq.not a$" #### Beats ##### [04:33.973](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=273.97304166666663) Narration: To see that exactly one canceler is not obvious, let me build a number system where it is false. Four numbers: zero, a, b and c. Its addition is given by a table, the same kind you learned your sums from, only smaller. Board: Empty. Actions: - [04:33.973](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=273.97304166666663): toy\_q is shown on the screen, written out. - [04:45.641](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=285.64104166666664): table is shown on the screen, written out. - [04:46.374](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=286.37352270382706): table is shown on the screen, written out. - [04:46.666](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=286.6664936282233): table is shown on the screen, written out. - [04:46.986](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=286.98596021086075): table is shown on the screen, written out. - [04:47.215](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=287.2145458418675): table is shown on the screen, written out. ##### [04:50.084](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=290.0840416666666) Narration: Check rule two. The zero row and the zero column hand everything straight back, unchanged. Zero does nothing here. Board: toy\_q — a Panel that says "Does every number have exactly one canceler? Here is a system of four numbers where it does not. Its plus sits in a circle, so nobody mistakes it for ordinary addition." Actions: - [04:50.432](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=290.43204166666663): f\_zero is shown on the screen, written out. - [04:52.65](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=292.65004166666665): table (the "row=2" part) is emphasized. - [04:53.695](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=293.6950416666666): table (the "column=2" part) is emphasized. - [04:53.695](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=293.6950416666666): table (the "row=2" part) is no longer emphasized. - [04:57.898](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=297.89804166666664): table (the "column=2" part) is no longer emphasized. ##### [04:59.572](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=299.5720416666666) Narration: Check rule three. Every number here has a canceler. a and b add to zero. c and b add to zero. And zero cancels itself. The table is even symmetric, so this addition commutes too. Board: f\_zero — a Math \[text\] that says "$0 plus.o x = x plus.o 0 = x$"; toy\_q — a Panel that says "Does every number have exactly one canceler? Here is a system of four numbers where it does not. Its plus sits in a circle, so nobody mistakes it for ordinary addition." Actions: - [05:3.792](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=303.79204166666665): f\_ab is shown on the screen, written out. - [05:5.951](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=305.95104166666664): f\_cb is shown on the screen, written out. ##### [05:14.482](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=314.48154166666666) Narration: Now look at the row for b. It has two zeros in it. b is cancelled by a, and b is also cancelled by c. In this world, b has two cancelers. Board: f\_zero — a Math \[text\] that says "$0 plus.o x = x plus.o 0 = x$"; f\_ab — a Math \[text\] that says "$a plus.o b = b plus.o a = 0$"; f\_cb — a Math \[text\] that says "$c plus.o b = b plus.o c = 0$"; toy\_q — a Panel that says "Does every number have exactly one canceler? Here is a system of four numbers where it does not. Its plus sits in a circle, so nobody mistakes it for ordinary addition." Actions: - [05:15.48](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=315.48004166666664): table (the "row=4" part) is emphasized. - [05:18.998](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=318.9980416666666): f\_ab is indicated — a transient flash. - [05:20.414](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=320.4140416666666): f\_cb is indicated — a transient flash. - [05:25.209](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=325.2090416666666): table (the "row=4" part) is no longer emphasized. ##### [05:25.809](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=325.80904166666664) Narration: So compute the canceler of the canceler of a. The row for a has exactly one zero, in the b column, so minus a is b. Now the row for b has two zeros, so the canceler of b is a, or it is c. Take c. In this little world, minus minus a is c, and c is not a. Board: Unchanged from the preceding beat in this scene. Actions: - [05:29.709](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=329.7090416666666): table (the "row=3" part) is emphasized. - [05:32.902](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=332.9020416666666): f\_na is shown on the screen, written out. - [05:34.562](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=334.56204166666663): table (the "row=3" part) is no longer emphasized. - [05:34.562](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=334.56204166666663): table (the "row=4" part) is emphasized. - [05:35.572](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=335.5720416666666): f\_nb is shown on the screen, written out. - [05:41.227](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=341.22704166666665): toy\_answer is shown on the screen, written out. - [05:44.303](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=344.3030416666667): table (the "row=4" part) is no longer emphasized. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): f\_ab is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): f\_cb is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): f\_na is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): f\_nb is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): f\_zero is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): table is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): toy\_answer is hidden from the screen — left the board. - [05:45.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=345.15054166666664): toy\_q is hidden from the screen — left the board. ##### [05:46.351](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=346.35054166666663) Narration: Which rule did we break? Not rule two. Not rule three. And commutativity is fine as well. Look at rule one. Add a and b first, then add c: a plus b is zero, and zero plus c is c. Now bracket the other pair: b plus c is zero, and a plus zero is a. Board: Empty. Actions: - [05:46.351](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=346.35054166666663): head\_break is shown on the screen, written out. - [05:46.351](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=346.35054166666663): checklist is shown on the screen, written out. - [05:48.905](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=348.90504166666665): checklist (the "P2 holds" part) is emphasized. - [05:50.31](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=350.3100416666666): checklist (the "P2 holds" part) is no longer emphasized. - [05:50.31](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=350.3100416666666): checklist (the "P3 holds" part) is emphasized. - [05:51.657](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=351.6570416666666): checklist (the "Addition even commutes" part) is emphasized. - [05:51.657](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=351.6570416666666): checklist (the "P3 holds" part) is no longer emphasized. - [05:56.208](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=356.20804166666665): assoc is shown on the screen, written out. - [06:3.151](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=363.15104166666663): assoc is shown on the screen, written out. - [06:4.857](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=364.85704166666665): checklist (the "Addition even commutes" part) is no longer emphasized. - [06:4.857](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=364.85704166666665): checklist (the "P1 fails" part) is emphasized. ##### [06:7.803](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=367.8025416666666) Narration: And look at the two values we just got. The first was c. The second was a. Those are exactly the two numbers that were fighting over the title canceler of b. That is not a coincidence. It is our theorem, seen from the wrong side. Board: checklist — a Block \[text\] that says "P2 holds: zero does nothing. P3 holds: everything has a canceler. Addition even commutes. P1 fails."; head\_break — a Heading that says "Which Rule Did We Break?" Actions: - [06:8.731](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=368.73104166666667): verdict is shown on the screen, written out. - [06:10.287](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=370.28704166666665): assoc is indicated — a transient flash. - [06:11.715](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=371.71504166666665): assoc is indicated — a transient flash. - [06:14.861](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=374.86104166666667): verdict is indicated — a transient flash. - [06:17.81](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=377.8100416666666): checklist (the "P1 fails" part) is no longer emphasized. - [06:21.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=381.5022291666666): assoc is hidden from the screen — left the board. - [06:21.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=381.5022291666666): checklist is hidden from the screen — left the board. - [06:21.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=381.5022291666666): head\_break is hidden from the screen — left the board. - [06:21.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=381.5022291666666): verdict is hidden from the screen — left the board. ### Scene 4: [The Bracket Slides](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=382.5438958333333) Span: 06:22.544–08:22.88 (382.5438958333333s–502.8800625s). #### Objects - ask: a Tex \[text\] that says "Both $a$ and $c$ cancel $b$. Must they be the same number?" - head\_slide: a Heading that says "The Bracket Slides" - head\_unique: a Heading that says "Cancelers Are Unique" - readings: a Derivation \[text\] that says "$(a + b) + c &= 0 + c = c \\ a + (b + c) &= a + 0 = a$" - row: a Math \[text\] that says "$a + b + c$" - same: a Math \[text\] that says "$a = c$" - setup: a Math \[text\] that says "$a + b = 0, quad b + c = 0$" - uniq: a Panel that says "A number has at most one canceler. With P3, it has exactly one." - uniq\_claim: a Math \[text\] that says "$a + b = 0 thin upright("and") thin b + c = 0 quad arrow.r quad a = c$" #### Beats ##### [06:22.544](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=382.5438958333333) Narration: So what does our number system have that the toy one does not? One thing. The bracket can slide. Here is what that buys us. Board: Empty. Actions: - [06:22.544](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=382.5438958333333): head\_slide is shown on the screen, written out. - [06:30.462](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=390.4618958333333): ask is shown on the screen, written out. ##### [06:32.077](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=392.0773958333333) Narration: Suppose two numbers, a and c, both cancel the same number b. So a plus b is zero, and b plus c is zero. I am assuming nothing else about them. Must a and c be the same number? Board: ask — a Tex \[text\] that says "Both $a$ and $c$ cancel $b$. Must they be the same number?"; head\_slide — a Heading that says "The Bracket Slides" Actions: - [06:38.771](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=398.77089583333327): setup is shown on the screen, written out. - [06:44.738](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=404.7378958333333): ask is indicated — a transient flash. ##### [06:47.532](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=407.5323958333333) Narration: Write all three of them in a row: a plus b plus c. Rule one says this row has one value, no matter how I bracket it. So let us bracket it two different ways and compare. Board: ask — a Tex \[text\] that says "Both $a$ and $c$ cancel $b$. Must they be the same number?"; setup — a Math \[text\] that says "$a + b = 0, quad b + c = 0$"; head\_slide — a Heading that says "The Bracket Slides" Actions: - [06:48.879](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=408.8788958333333): row is shown on the screen, written out. ##### [07:0.4](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=420.3998958333333) Narration: Bracket the left pair first. a and b cancel, so that pair is zero. Zero plus c is c. The whole row is worth c. Board: ask — a Tex \[text\] that says "Both $a$ and $c$ cancel $b$. Must they be the same number?"; setup — a Math \[text\] that says "$a + b = 0, quad b + c = 0$"; row — a Math \[text\] that says "$a + b + c$"; head\_slide — a Heading that says "The Bracket Slides" Actions: - [07:1.364](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=421.3638958333333): row becomes "$(a + b) + c$". - [07:7.273](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=427.2728958333333): readings is shown on the screen, written out. ##### [07:12.554](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=432.5543958333333) Narration: Now the one motion to remember from this whole video. Watch the bracket leave the left pair, and land on the right pair instead. Board: Unchanged from the preceding beat in this scene. Actions: - [07:17.048](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=437.0478958333333): row becomes "$a + (b + c)$". ##### [07:21.558](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=441.5583958333333) Narration: Now the same thing happens at the other end. b and c cancel, so that pair is zero. a plus zero is a. The row is worth a. Board: Unchanged from the preceding beat in this scene. Actions: - [07:25.587](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=445.5868958333333): readings is shown on the screen, written out. ##### [07:32.098](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=452.09839583333326) Narration: Same row. One value. So a equals c, and that is the proof. Any two cancelers of the same number are equal. Cancelers are unique. Board: Unchanged from the preceding beat in this scene. Actions: - [07:34.902](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=454.9018958333333): same is shown on the screen, written out. - [07:36.597](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=456.5968958333333): A box is drawn around same. ##### [07:43.875](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=463.8753958333333) Narration: There is nothing clever in that argument. a and c only had to be in the same room as b, and rule one is what puts them there. In the toy world the bracket cannot slide, so a and c never have to meet, and nothing makes them equal. That is the only difference between the two worlds. Board: ask — a Tex \[text\] that says "Both $a$ and $c$ cancel $b$. Must they be the same number?"; setup — a Math \[text\] that says "$a + b = 0, quad b + c = 0$"; row — a Math \[text\] that says "$a + b + c$"; same — a Math \[text\] that says "$a = c$"; head\_slide — a Heading that says "The Bracket Slides" Actions: - [07:49.1](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=469.0998958333333): row is indicated — a transient flash. - [07:57.436](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=477.4358958333333): readings is indicated — a transient flash. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): ask is hidden from the screen — left the board. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): head\_slide is hidden from the screen — left the board. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): readings is hidden from the screen — left the board. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): row is hidden from the screen — left the board. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): same is hidden from the screen — left the board. - [08:2.939](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=482.9388958333333): setup is hidden from the screen — left the board. ##### [08:4.139](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=484.1388958333333) Narration: Let us write that down as a theorem, because we are about to use it twice. If a cancels b, and c also cancels b, then a and c are the same number. Rule three says a canceler exists. Rule one says there is only ever one. Board: Empty. Actions: - [08:4.139](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=484.1388958333333): head\_unique is shown on the screen, written out. - [08:9.062](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=489.06189583333327): uniq\_claim is shown on the screen, written out. - [08:15.366](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=495.3658958333333): uniq is shown on the screen, written out. - [08:20.358](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=500.35789583333326): uniq (the "exactly one" part) is emphasized. - [08:21.588](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=501.58839583333327): uniq (the "exactly one" part) is no longer emphasized. - [08:21.838](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=501.83839583333327): head\_unique is hidden from the screen — left the board. - [08:21.838](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=501.83839583333327): uniq is hidden from the screen — left the board. - [08:21.838](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=501.83839583333327): uniq\_claim is hidden from the screen — left the board. ### Scene 5: [Cashing It In](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=502.8800625) Span: 08:22.88–11:17.889 (502.8800625s–677.8892708333333s). #### Objects - answer: a Math \[text\] that says "$-(-a) = a$" - chain: a Derivation \[text\] that says "$-(-a) &= 0 + (-(-a)) quad upright("(P2)") \\ &= (a + (-a)) + (-(-a)) quad upright("(P3)") \\ &= a + ((-a) + (-(-a))) quad upright("(P1)") \\ &= a + 0 quad upright("(P3)") \\ &= a quad upright("(P2)")$" - fact\_a: a Math \[text\] that says "$a + (-a) = 0$" - fact\_na: a Math \[text\] that says "$(-a) + (-(-a)) = 0$" - head\_cash: a Heading that says "Cash It In" - head\_chain: a Heading that says "The Whole Proof, in Five Steps" - head\_who: a Heading that says "So Who Was Right?" - honest: a Panel that says "From here on $-(-a)$ means only this: a canceler of $-a$, any one of them. We are not assuming it is unique. That is what we are proving." - label\_claim: a Tex \[text\] that says "What the claim contains" - label\_thread: a Tex \[text\] that says "How the thread ended" - p4: a Math \[text\] that says "$a + b = b + a$" - p4\_note: a Tex \[text\] that says "Never used." - readings2: a Derivation \[text\] that says "$(a + (-a)) + (-(-a)) &= 0 + (-(-a)) = -(-a) \\ a + ((-a) + (-(-a))) &= a + 0 = a$" - recipe: a Block \[text\] that says "$a$ cancels $-a$. Free: that is P3. Cancelers are unique. One slide of the bracket. So $a$ is the canceler of $-a$, and $-(-a)$ is its name." - row2: a Math \[text\] that says "$a + (-a) + (-(-a))$" - voice\_end: a Panel that says "You are right. That is exactly what it shows. My apologies." - voice\_obj: a Panel that says "Proof by notation is not valid." #### Beats ##### [08:22.88](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=502.8800625) Narration: Before we cash it in, let us fix what the symbol is allowed to mean. Minus minus a is a canceler of minus a, any one of them. We are not assuming there is only one of them, because that is the thing we are proving. Board: Empty. Actions: - [08:22.88](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=502.8800625): head\_cash is shown on the screen, written out. - [08:25.794](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=505.7940625): honest is shown on the screen, written out. - [08:33.317](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=513.3170625): honest (the "any one of" part) is emphasized. - [08:36.824](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=516.8235625): honest (the "any one of" part) is no longer emphasized. ##### [08:37.424](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=517.4235625) Narration: Now rule three gives us two promises. First: a has a canceler, and the two of them add to zero. Second: minus a has a canceler too, and minus minus a is the name of one. Board: honest — a Panel that says "From here on $-(-a)$ means only this: a canceler of $-a$, any one of them. We are not assuming it is unique. That is what we are proving."; head\_cash — a Heading that says "Cash It In" Actions: - [08:40.686](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=520.6860625): fact\_a is shown on the screen, written out. - [08:45.214](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=525.2140625): fact\_na is shown on the screen, written out. ##### [08:51.352](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=531.3515625) Narration: Write all three in a row, exactly as before: a, then the canceler of a, then the canceler of that. Rule one says this row has one value however I bracket it. Board: honest — a Panel that says "From here on $-(-a)$ means only this: a canceler of $-a$, any one of them. We are not assuming it is unique. That is what we are proving."; fact\_a — a Math \[text\] that says "$a + (-a) = 0$"; fact\_na — a Math \[text\] that says "$(-a) + (-(-a)) = 0$"; head\_cash — a Heading that says "Cash It In" Actions: - [08:52.733](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=532.7330625): row2 is shown on the screen, written out. ##### [09:3.639](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=543.6385625) Narration: Bracket the left pair. a and its canceler make zero, and zero plus the last slot leaves the last slot standing. So the row is worth minus minus a. Board: honest — a Panel that says "From here on $-(-a)$ means only this: a canceler of $-a$, any one of them. We are not assuming it is unique. That is what we are proving."; fact\_a — a Math \[text\] that says "$a + (-a) = 0$"; fact\_na — a Math \[text\] that says "$(-a) + (-(-a)) = 0$"; row2 — a Math \[text\] that says "$a + (-a) + (-(-a))$"; head\_cash — a Heading that says "Cash It In" Actions: - [09:4.335](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=544.3350625): row2 becomes "$(a + (-a)) + (-(-a))$". - [09:8.166](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=548.1660625): readings2 is shown on the screen, written out. ##### [09:15.12](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=555.1195625) Narration: Now slide it. The bracket leaves the left pair and lands on the right pair instead. Board: Unchanged from the preceding beat in this scene. Actions: - [09:17.349](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=557.3490625000001): row2 becomes "$a + ((-a) + (-(-a)))$". ##### [09:21.202](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=561.2020625) Narration: And now the other two cancel, by the promise we just wrote down. a plus zero is a. So the row is worth a. Board: Unchanged from the preceding beat in this scene. Actions: - [09:22.502](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=562.5020625): readings2 is shown on the screen, written out. ##### [09:29.937](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=569.9365625) Narration: Same row, one value. So minus minus a equals a. That is the theorem we came for, and it is now proved. Board: Unchanged from the preceding beat in this scene. Actions: - [09:33.64](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=573.6400625): answer is shown on the screen, written out. - [09:35.486](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=575.4860625): A box is drawn around answer. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): answer is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): fact\_a is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): fact\_na is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): head\_cash is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): honest is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): readings2 is hidden from the screen — left the board. - [09:38.226](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=578.2255625): row2 is hidden from the screen — left the board. ##### [09:39.426](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=579.4255625000001) Narration: Written as a single chain, the whole proof is five lines. Zero does nothing, so the thing on the left is zero plus itself. That is rule two. Board: Empty. Actions: - [09:39.426](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=579.4255625000001): head\_chain is shown on the screen, written out. - [09:40.587](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=580.5870625): chain is shown on the screen, written out. ##### [09:49.035](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=589.0350625) Narration: That zero is a plus the canceler of a: rule three. And now the only interesting line in the proof. Slide the bracket. Rule one. Board: head\_chain — a Heading that says "The Whole Proof, in Five Steps" Actions: - [09:50.381](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=590.3810625): chain is shown on the screen, written out. - [09:56.442](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=596.4420625): chain is shown on the screen, written out. - [09:58.404](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=598.4040625): chain is indicated — a transient flash. ##### [09:59.93](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=599.9295625) Narration: The middle and the right cancel, by rule three again, leaving a plus zero. And a plus zero is a, by rule two. Done. Board: Unchanged from the preceding beat in this scene. Actions: - [10:3.523](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=603.5230625): chain is shown on the screen, written out. - [10:8.573](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=608.5730625): chain is shown on the screen, written out. ##### [10:10.055](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=610.0550625) Narration: Now notice what never happened in that chain. We never swapped two terms. The fourth rule, that a plus b equals b plus a, was never used. Board: Unchanged from the preceding beat in this scene. Actions: - [10:15.907](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=615.9070625): p4 is shown on the screen, written out. - [10:19.192](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=619.1920625): p4 is struck through — it is ruled out. - [10:19.766](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=619.7661318199213): p4\_note is shown on the screen, written out. ##### [10:20.861](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=620.8605625) Narration: So this is not really a fact about numbers. It holds anywhere there is a zero, an undo for every move, and a bracket that slides. Rotating a cube. Shuffling a deck. The undo of the undo is the move you started with. Board: p4 — a Math \[text\] that says "$a + b = b + a$"; p4\_note — a Tex \[text\] that says "Never used."; head\_chain — a Heading that says "The Whole Proof, in Five Steps" Actions: - [10:28.209](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=628.2090625): chain is indicated — a transient flash. - [10:36.325](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=636.3245625): chain is hidden from the screen — left the board. - [10:36.325](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=636.3245625): head\_chain is hidden from the screen — left the board. - [10:36.325](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=636.3245625): p4 is hidden from the screen — left the board. - [10:36.325](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=636.3245625): p4\_note is hidden from the screen — left the board. ##### [10:37.525](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=637.5245625) Narration: So back to the argument. Who was right? Both of them, describing one theorem from opposite ends. Board: Empty. Actions: - [10:37.525](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=637.5245625): head\_who is shown on the screen, written out. - [10:37.525](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=637.5245625): label\_claim is shown on the screen, written out. - [10:41.449](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=641.4490625): recipe is shown on the screen, written out. ##### [10:45.44](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=645.4395625) Narration: The person who asked had the shape of it exactly right. a cancels minus a. Cancelers are unique. Therefore a is the canceler of minus a, and minus minus a is only its name. Board: label\_claim — a Tex \[text\] that says "What the claim contains"; recipe — a Block \[text\] that says "$a$ cancels $-a$. Free: that is P3. Cancelers are unique. One slide of the bracket. So $a$ is the canceler of $-a$, and $-(-a)$ is its name."; head\_who — a Heading that says "So Who Was Right?" Actions: - [10:49.596](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=649.5960625): recipe (the "Free: that is P3" part) is emphasized. - [10:52.254](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=652.2540625): recipe (the "Cancelers are unique" part) is emphasized. - [10:52.254](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=652.2540625): recipe (the "Free: that is P3" part) is no longer emphasized. - [10:58.233](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=658.2330625): recipe (the "Cancelers are unique" part) is no longer emphasized. - [10:58.233](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=658.2330625): recipe (the "its name" part) is emphasized. ##### [10:59.6](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=659.5995625) Narration: The objection was right too: you cannot get that middle line by notation. Which is exactly why the small proof earns its keep. It proves the middle line on the spot, with one slide of the bracket. The objector saw that, and said so. That is a good thread. Board: Unchanged from the preceding beat in this scene. Actions: - [10:59.6](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=659.5995625): label\_thread is shown on the screen, written out. - [11:3.153](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=663.1530625): recipe (the "Cancelers are unique" part) is emphasized. - [11:3.153](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=663.1530625): recipe (the "its name" part) is no longer emphasized. - [11:3.849](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=663.8490625): voice\_obj is shown on the screen, written out. - [11:14.321](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=674.3210624999999): voice\_end is shown on the screen, written out. - [11:15.924](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=675.9240625): recipe (the "Cancelers are unique" part) is no longer emphasized. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): head\_who is hidden from the screen — left the board. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): label\_claim is hidden from the screen — left the board. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): label\_thread is hidden from the screen — left the board. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): recipe is hidden from the screen — left the board. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): voice\_end is hidden from the screen — left the board. - [11:16.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=676.8476041666667): voice\_obj is hidden from the screen — left the board. ### Scene 6: [What It Does Not Prove](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=677.8892708333333) Span: 11:17.889–13:27.121 (677.8892708333333s–807.1205208333333s). #### Objects - ask2: a Panel that says "Does this prove that a negative times a negative is a positive?" - chips: a Block \[text\] that says "Free, by P3: $a$ cancels $-a$. Unique, by P1: nobody else does." - final\_claim: a Math \[text\] that says "$-(-a) = a$" - first: a Polygon \[yellow\] drawn in floors (vertices=((0.6, 2.1), (5.4, 2.1), (5.4, 3.6), (0.6, 3.6)), fill\_opacity=0.2) - first\_tag: a Point \[yellow\] labelled "upright("multiplication")" drawn in floors (location=(3.0, 2.5), show\_marker=False) - floors: a Figure (x\_range=(0.0, 6.0), y\_range=(0.0, 6.0), aspect=(4.0, 4.2)) - ground: a Polygon \[blue\] drawn in floors (vertices=((0.6, 0.5), (5.4, 0.5), (5.4, 2.0), (0.6, 2.0)), fill\_opacity=0.25) - ground\_tag: a Point \[blue\] labelled "upright("addition")" drawn in floors (location=(3.0, 0.9), show\_marker=False) - head\_close: a Heading that says "One Partner Each" - mtag: a Tex \[text\] that says "So $(-1) dot.op a$ cancels $a$. By uniqueness, $(-1) dot.op a = -a$." - mtag2: a Math \[text\] that says "$(-a)(-b) = a b$" - mwork: a Derivation \[text\] that says "$a + (-1) dot.op a &= 1 dot.op a + (-1) dot.op a \\ &= (1 + (-1)) dot.op a = 0 dot.op a = 0$" - p\_a: a Point \[blue\] labelled "a" drawn in pairing (location=(1.1, 3.0)) - p\_b: a Point \[blue\] labelled "b" drawn in pairing (location=(4.3, 3.0)) - p\_edge\_a: a Line \[green\] drawn in pairing (start=(1.1, 3.0), end=(2.7, 3.0)) - p\_edge\_b: a Line \[green\] drawn in pairing (start=(4.3, 3.0), end=(5.9, 3.0)) - p\_loop: a Circle \[green\] drawn in pairing (center=(3.5, 1.2), radius=0.35) - p\_na: a Point \[yellow\] labelled "-a" drawn in pairing (location=(2.7, 3.0)) - p\_nb: a Point \[yellow\] labelled "-b" drawn in pairing (location=(5.9, 3.0)) - p\_zero: a Point \[text\] labelled "0" drawn in pairing (location=(3.5, 1.2)) - pairing: a Figure (x\_range=(0.0, 7.0), y\_range=(0.0, 4.0), aspect=(5.0, 3.0)) - second: a Polygon \[gray\] drawn in floors (vertices=((0.6, 3.7), (5.4, 3.7), (5.4, 5.2), (0.6, 5.2)), fill\_opacity=0.2) - second\_tag: a Point \[gray\] labelled "upright("order")" drawn in floors (location=(3.0, 4.1), show\_marker=False) #### Beats ##### [11:17.889](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=677.8892708333333) Narration: One more question from the thread, and it is a good one. Does everything we have just done prove that a negative times a negative is a positive? Board: Empty. Actions: - [11:17.889](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=677.8892708333333): ask2 is shown on the screen, written out. ##### [11:26.349](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=686.3492708333333) Narration: No. And seeing why is worth a minute. Think of the rules as a building. Everything today happened on the ground floor: addition, zero, cancelers, and the bracket that slides. Board: ask2 — a Panel that says "Does this prove that a negative times a negative is a positive?" Actions: - [11:30.854](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=690.8542708333333): floors is shown on the screen, written out. - [11:33.466](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=693.4662708333333): ground is shown on the screen, written out. - [11:34.848](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=694.8482708333332): ground\_tag is shown on the screen, written out. ##### [11:40.452](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=700.4522708333333) Narration: On this floor there is no multiplication at all, and no such thing as a positive or a negative number. Minus a is only the canceler of a, and it might be five, or minus five, or zero. Board: floors — a Figure (x\_range=(0.0, 6.0), y\_range=(0.0, 6.0), aspect=(4.0, 4.2)); ask2 — a Panel that says "Does this prove that a negative times a negative is a positive?"; ground — a Polygon \[blue\] drawn in floors (vertices=((0.6, 0.5), (5.4, 0.5), (5.4, 2.0), (0.6, 2.0)), fill\_opacity=0.25); ground\_tag — a Point \[blue\] labelled "upright("addition")" drawn in floors (location=(3.0, 0.9), show\_marker=False) Actions: - [11:41.195](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=701.1952708333333): ground is indicated — a transient flash. ##### [11:54.183](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=714.1827708333333) Narration: To even say negative times negative you need the next floor up: multiplication, and the rule that ties it to addition. Watch what happens there. Add a to minus one times a, and rewrite the first a as one times a. Board: Unchanged from the preceding beat in this scene. Actions: - [11:57.422](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=717.4222708333333): first is shown on the screen, written out. - [11:58.629](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=718.6292708333333): first\_tag is shown on the screen, written out. - [12:7.116](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=727.1162708333333): floors moves to a new place on the board. - [12:7.116](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=727.1162708333333): mwork is shown on the screen, written out. ##### [12:10.938](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=730.9382708333333) Narration: Pull the a out. One plus minus one is zero, and zero times anything is zero. So minus one times a cancels a. And because cancelers are unique, minus one times a is minus a. That is our engine, borrowed. Board: floors — a Figure (x\_range=(0.0, 6.0), y\_range=(0.0, 6.0), aspect=(4.0, 4.2)); ask2 — a Panel that says "Does this prove that a negative times a negative is a positive?"; ground — a Polygon \[blue\] drawn in floors (vertices=((0.6, 0.5), (5.4, 0.5), (5.4, 2.0), (0.6, 2.0)), fill\_opacity=0.25); ground\_tag — a Point \[blue\] labelled "upright("addition")" drawn in floors (location=(3.0, 0.9), show\_marker=False); first — a Polygon \[yellow\] drawn in floors (vertices=((0.6, 2.1), (5.4, 2.1), (5.4, 3.6), (0.6, 3.6)), fill\_opacity=0.2); first\_tag — a Point \[yellow\] labelled "upright("multiplication")" drawn in floors (location=(3.0, 2.5), show\_marker=False) Actions: - [12:11.257](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=731.2572708333332): mwork is shown on the screen, written out. - [12:21.381](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=741.3812708333332): mtag is shown on the screen, written out. - [12:25.7](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=745.7002708333333): mtag (the "uniqueness" part) is indicated — a transient flash. ##### [12:27.67](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=747.6697708333332) Narration: From there, minus a times minus b works out to a times b, and that step uses today's theorem. But you still have not said the word positive. For that you need a third floor, the rules for which numbers count as positive, and only there does the sentence mean anything. Board: mtag — a Tex \[text\] that says "So $(-1) dot.op a$ cancels $a$. By uniqueness, $(-1) dot.op a = -a$."; floors — a Figure (x\_range=(0.0, 6.0), y\_range=(0.0, 6.0), aspect=(4.0, 4.2)); ask2 — a Panel that says "Does this prove that a negative times a negative is a positive?"; ground — a Polygon \[blue\] drawn in floors (vertices=((0.6, 0.5), (5.4, 0.5), (5.4, 2.0), (0.6, 2.0)), fill\_opacity=0.25); ground\_tag — a Point \[blue\] labelled "upright("addition")" drawn in floors (location=(3.0, 0.9), show\_marker=False); first — a Polygon \[yellow\] drawn in floors (vertices=((0.6, 2.1), (5.4, 2.1), (5.4, 3.6), (0.6, 3.6)), fill\_opacity=0.2); first\_tag — a Point \[yellow\] labelled "upright("multiplication")" drawn in floors (location=(3.0, 2.5), show\_marker=False) Actions: - [12:30.293](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=750.2932708333333): mtag2 is shown on the screen, written out. - [12:37.817](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=757.8172708333333): second is shown on the screen, written out. - [12:40.173](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=760.1732708333333): second\_tag is shown on the screen, written out. ##### [12:45.464](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=765.4642708333333) Narration: Today's theorem is one brick in that wall. A load bearing one. But it is not the wall. Board: mtag — a Tex \[text\] that says "So $(-1) dot.op a$ cancels $a$. By uniqueness, $(-1) dot.op a = -a$."; mtag2 — a Math \[text\] that says "$(-a)(-b) = a b$"; floors — a Figure (x\_range=(0.0, 6.0), y\_range=(0.0, 6.0), aspect=(4.0, 4.2)); ask2 — a Panel that says "Does this prove that a negative times a negative is a positive?"; ground — a Polygon \[blue\] drawn in floors (vertices=((0.6, 0.5), (5.4, 0.5), (5.4, 2.0), (0.6, 2.0)), fill\_opacity=0.25); ground\_tag — a Point \[blue\] labelled "upright("addition")" drawn in floors (location=(3.0, 0.9), show\_marker=False); first — a Polygon \[yellow\] drawn in floors (vertices=((0.6, 2.1), (5.4, 2.1), (5.4, 3.6), (0.6, 3.6)), fill\_opacity=0.2); first\_tag — a Point \[yellow\] labelled "upright("multiplication")" drawn in floors (location=(3.0, 2.5), show\_marker=False); second — a Polygon \[gray\] drawn in floors (vertices=((0.6, 3.7), (5.4, 3.7), (5.4, 5.2), (0.6, 5.2)), fill\_opacity=0.2); second\_tag — a Point \[gray\] labelled "upright("order")" drawn in floors (location=(3.0, 4.1), show\_marker=False) Actions: - [12:47.136](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=767.1362708333334): ground is indicated — a transient flash. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): ask2 is hidden from the screen — left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): floors is hidden from the screen — left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): ground is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): ground\_tag is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): first is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): first\_tag is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): second is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): second\_tag is hidden from the screen — floors left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): mtag is hidden from the screen — left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): mtag2 is hidden from the screen — left the board. - [12:51.757](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=771.7567708333333): mwork is hidden from the screen — left the board. ##### [12:52.957](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=772.9567708333333) Narration: So here is the picture to keep. Draw a line between two numbers whenever they add to zero. Rule three says every number gets at least one such line. Rule one says no number gets two. So the lines make a perfect pairing, and zero is its own partner. Board: Empty. Actions: - [12:52.957](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=772.9567708333333): head\_close is shown on the screen, written out. - [12:55.673](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=775.6732708333333): pairing is shown on the screen, written out. - [12:56.3](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=776.3002708333333): p\_a is shown on the screen, written out. - [12:56.58](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=776.580163517274): p\_na is shown on the screen, written out. - [12:56.791](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=776.7910562012147): p\_edge\_a is shown on the screen, written out. - [13:1.281](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=781.2812708333333): p\_b is shown on the screen, written out. - [13:1.542](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=781.5417599562376): p\_nb is shown on the screen, written out. - [13:1.893](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=781.8928321468985): p\_edge\_b is shown on the screen, written out. - [13:9.327](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=789.3272708333333): p\_zero is shown on the screen, written out. - [13:9.987](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=789.9865236642642): p\_loop is shown on the screen, written out. ##### [13:11.07](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=791.0702708333333) Narration: Minus minus a equals a says exactly this: go to your partner, then go to your partner's partner, and you are home. Board: pairing — a Figure (x\_range=(0.0, 7.0), y\_range=(0.0, 4.0), aspect=(5.0, 3.0)); head\_close — a Heading that says "One Partner Each"; p\_a — a Point \[blue\] labelled "a" drawn in pairing (location=(1.1, 3.0)); p\_na — a Point \[yellow\] labelled "-a" drawn in pairing (location=(2.7, 3.0)); p\_edge\_a — a Line \[green\] drawn in pairing (start=(1.1, 3.0), end=(2.7, 3.0)); p\_b — a Point \[blue\] labelled "b" drawn in pairing (location=(4.3, 3.0)); p\_nb — a Point \[yellow\] labelled "-b" drawn in pairing (location=(5.9, 3.0)); p\_edge\_b — a Line \[green\] drawn in pairing (start=(4.3, 3.0), end=(5.9, 3.0)); p\_zero — a Point \[text\] labelled "0" drawn in pairing (location=(3.5, 1.2)); p\_loop — a Circle \[green\] drawn in pairing (center=(3.5, 1.2), radius=0.35) Actions: - [13:14.826](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=794.8262708333333): pairing moves to a new place on the board. - [13:14.826](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=794.8262708333333): final\_claim is shown on the screen, written out. - [13:17.136](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=797.1362708333334): p\_a is indicated — a transient flash. - [13:18.448](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=798.4482708333333): p\_na is indicated — a transient flash. ##### [13:21.034](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=801.0337708333333) Narration: Turn around twice: true. Why it is true: one slide of a bracket. Board: final\_claim — a Math \[text\] that says "$-(-a) = a$"; pairing — a Figure (x\_range=(0.0, 7.0), y\_range=(0.0, 4.0), aspect=(5.0, 3.0)); head\_close — a Heading that says "One Partner Each"; p\_a — a Point \[blue\] labelled "a" drawn in pairing (location=(1.1, 3.0)); p\_na — a Point \[yellow\] labelled "-a" drawn in pairing (location=(2.7, 3.0)); p\_edge\_a — a Line \[green\] drawn in pairing (start=(1.1, 3.0), end=(2.7, 3.0)); p\_b — a Point \[blue\] labelled "b" drawn in pairing (location=(4.3, 3.0)); p\_nb — a Point \[yellow\] labelled "-b" drawn in pairing (location=(5.9, 3.0)); p\_edge\_b — a Line \[green\] drawn in pairing (start=(4.3, 3.0), end=(5.9, 3.0)); p\_zero — a Point \[text\] labelled "0" drawn in pairing (location=(3.5, 1.2)); p\_loop — a Circle \[green\] drawn in pairing (center=(3.5, 1.2), radius=0.35) Actions: - [13:21.765](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=801.7652708333333): chips is shown on the screen, written out. - [13:23.413](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=803.4132708333333): A box is drawn around final\_claim. - [13:24.737](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=804.7372708333334): chips (the "Unique, by P1" part) is emphasized. - [13:25.829](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=805.8288541666666): chips (the "Unique, by P1" part) is no longer emphasized. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): chips is hidden from the screen — left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): final\_claim is hidden from the screen — left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): head\_close is hidden from the screen — left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): pairing is hidden from the screen — left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_a is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_na is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_edge\_a is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_b is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_nb is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_edge\_b is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_zero is hidden from the screen — pairing left the board. - [13:26.079](https://academa.ai/@sina/lectures/why-a-a-is-secretly-a-theorem?t=806.0788541666666): p\_loop is hidden from the screen — pairing left the board.