2.5.2 · D2Number Theory (Intermediate)

Visual walkthrough — Integers — operations, number line, absolute value

1,976 words9 min readBack to topic

This page is a deep-dive child of Integers — operations, number line, absolute value. We assume you can place a point on a line and nothing else. Everything — the bars , the word "distance", the squeeze trick — gets built here.


Step 1 — What "distance from zero" even means

WHAT we just did. We named a machine. You feed it any integer ; it hands back a plain, direction-free number of steps.

WHY we need it. The whole claim is about distances, and distance can't be negative — you never walk " steps". So before comparing distances we need a symbol that strips off the left/right sign and keeps only the size. That symbol is .

PICTURE. Look at and below. They are on opposite sides, yet each is exactly 3 steps from the middle. The two orange braces are the same length — that sameness is .

  • — the raw integer, sign and all.
  • — the flipped version; when is negative, flipping makes it positive, e.g. .

Related idea: the number line and left/right ordering come from inequalities.


Step 2 — The squeeze fact: every number is trapped by its own size

WHAT we just did. We claimed that any integer is sandwiched between the negative of its size and the positive of its size.

WHY this tool, and why now? We are heading toward bounding from above and below. To bound a sum you first bound each piece. This inequality is the cleanest possible bound on a single number: it says " can't be bigger than its own magnitude, and can't be smaller than minus its magnitude." Nothing fancier is needed — and nothing weaker would work.

PICTURE. Below, (the magenta dot) always lands inside the violet fence whose posts sit at and . Two cases are drawn: a positive leaning on the right post, a negative leaning on the left post. Either way, it's inside.

  • If : then , so is the right post — still . ✓
  • If : then , so is the left post — still . ✓

Both signs covered, no gaps.


Step 3 — Do the same trap for

WHAT we just did. We wrote the identical trap for a second integer .

WHY. The thing we ultimately care about is , which has two moving parts. We now hold a fence for each part separately, ready to be combined.

PICTURE. Two fences stacked: the magenta one from Step 2 for , a new orange one for . Each dot sits inside its own fence.

  • 's left post.
  • — the second number.
  • 's right post.

Step 4 — Add the two traps together

WHAT we just did. We stacked the two chains from Steps 2 and 3 and added them column by column: left posts to left posts, middles to middles, right posts to right posts.

WHY this is allowed — the one algebra rule, proved. Adding two same-direction inequalities is legal:

Mini-proof. From , add the number to both sides — adding the same amount to both sides never flips a (this is the basic order-preserving move from inequalities) — giving . From , add the number to both sides, giving . Now chain them: , so .

Apply this twice to the Step-2 and Step-3 chains: once to the right-hand halves ( with gives ) and once to the left-hand halves ( with gives ). This is the one algebra move the whole proof rides on.

PICTURE. Watch the left posts and merge into one far-left post , and the right posts merge into . The sum drops into the new, wider fence.

Every piece is just the Step-2 piece plus the Step-3 piece, lined up.


Step 5 — Read the trap back as an absolute value

WHAT we just did. We recognised the Step-4 sandwich as the very shape of an absolute-value statement, and folded it back into bars. To do that we borrow one general reading of the bars — but first let us say plainly what the letters will stand for.

WHY. Step 1 built = distance from . Being trapped in the range from to is precisely being within steps of , i.e. . Here is legal to use because it is a sum of two distances, so it is automatically .

PICTURE. The wide fence from Step 4 redrawn as a distance circle: lives no farther than from the origin.

  • — the true distance the sum ends up from .
  • — the "walk one then the other" upper limit.
  • — "at most", never more.

Step 6 — When is it equal, and when is it strictly less?

WHAT we just did. We split the single inequality into the case where it's tight and the case where there's slack.

WHY it matters. An inequality without its equality condition is half a fact. Knowing when the two sides agree tells you the bound is the best possible.

PICTURE. Left panel: same way, arrows chain nose-to-tail, . Right panel: opposite ways, the orange arrow backtracks, .


Step 7 — The degenerate cases (never leave a gap)

WHY these deserve a step. The contract: the reader must never meet a case we skipped. Zeros and exact-opposites are the boundary of the "same/opposite direction" split from Step 6, and both obey the boxed law.


The one-picture summary

The whole argument in a single frame: two fences (one per number) add into one wide fence; the sum can only ever land inside it; touching the wall means "same direction", landing short means "some cancellation."

Recall Feynman retelling — say it back in plain words

Give me any two whole-number moves. First I put a fence around move : it can't go past steps either side of home. I put the same kind of fence around move . Now I add the two moves — and because adding two "no-further-than" limits gives a "no-further-than" limit for the total, the sum is caught inside a bigger fence stretching on each side of home. Being inside a fence of half-width is the exact same thing as being within steps of zero — that's what the absolute-value bars mean. So the distance of the sum, , is at most . When both moves point the same way I hit the fence wall (equality); when they fight each other I land short (strictly less); a zero move adds nothing and gives equality too. Nothing about fractions was needed, so the same story runs on rational numbers and even on arrows in the 2D plane, where the "triangle" in the name finally becomes a real triangle.

Recall Quick self-test

What does measure? ::: The distance of from on the number line, ignoring direction. Which single algebra move powers Step 4? ::: Adding two same-direction inequalities: and give . When is exact? ::: When and have the same sign (or one is zero) — no cancellation. Compute and . ::: and ; indeed . Why is allowed as the bound in Step 5? ::: It's a sum of two distances, so it is , which the "between and " reading requires.

Prerequisite threads: counting steps, solving the equality condition like a linear equation, and plotting on the coordinate plane.