There is a ready-made picture proof of the three core exponent laws that uses nothing more complicated than counting identical tiles. The static version is covered in the tile-view proof. What this article adds is a live checker — two sliders for m and n — so that you can drive the picture yourself and confirm the laws at whatever exponents you want.

The idea is blunt. A law of exponents is a claim about how many factors of a appear after some operation. If you can count the tiles on both sides and match them, the law is proved. If ever a slider setting gave you different totals on the two sides, the law would be false. Slide all you want; the totals stay locked.

Checker 1 — Product law: a^m \cdot a^n = a^{m+n}

Drag the sliders for m and n below. The live readout shows the left-hand count (a row of m tiles followed by a row of n tiles, multiplied) and the right-hand count (a single row of m + n tiles). The two totals must always match.

Interactive checker for the product law of exponents Two draggable points M and N on a horizontal axis from one to six. Live readouts show the value of m, the value of n, the product a to the m times a to the n, the sum m plus n, and the result a to the m plus n. The two products always have equal exponent totals. 1 3 4 6 ← m → ← n → ↔ drag either point
Drag $m$ and $n$ between $1$ and $6$. The readout reports $a^m$, $a^n$, and their product $a^{m+n}$. Whatever integers you pick, gluing an $m$-strip of $a$s to an $n$-strip of $a$s produces an $(m+n)$-strip. That is the whole proof of the product law, made physical.

The count is not an accident of algebra — it is literally the number of factors of a on each side. On the left, m factors multiplied by n factors. On the right, m + n factors in a single strip. Addition of exponents is concatenation of tile strips.

Why the strips literally count: a^m is defined as the product a \times a \times \cdots \times a with exactly m factors — each factor is one tile. So a strip is not a metaphor. It is the definition.

Checker 2 — Power of a power: (a^m)^n = a^{mn}

Now stack the tiles into a grid. A strip of m tiles, replicated n times end to end, gives a row of m tiles stacked n-deep — a grid of m \times n tiles.

Interactive checker for the power of a power law Two draggable points M and N on a horizontal axis from one to five. Live readouts show m, n, m times n, and the resulting power a to the m n. The identity a to the m all to the n equals a to the m times n is confirmed as the reader drags. 1 3 5 ← m → ← n → ↔ drag either point
Slide $m$ and $n$ from $1$ to $5$. The outer exponent $n$ is "how many copies of the $m$-strip," and the tiles in an $m$-wide, $n$-tall grid number exactly $m \times n$. Area equals product, which is why the exponents multiply.

This one is the grid law: write (a^m)^n as a m-wide, n-tall rectangle of a tiles, and count. You get m \times n tiles. Whatever integers you pick for m and n, the rectangle contains mn tiles, and those mn tiles are the mn factors of a on the right-hand side.

Why the nesting gives a rectangle: (a^m)^n means "n copies of a^m multiplied together." Each copy of a^m is a strip of m tiles. Stack n strips, and you have a rectangle. Count by rows times columns to get mn.

Checker 3 — Power of a product: (ab)^m = a^m \cdot b^m

The third law is the easiest to see in the tile view. (ab)^m is a strip of m pairs, each pair consisting of an a-tile and a b-tile. Regroup: collect all the a-tiles on the left and all the b-tiles on the right. You get an a-strip of length m followed by a b-strip of length m.

Interactive checker for the power of a product law A single draggable point M on a horizontal axis from one to six. Live readouts show m, the left-hand count of a-b pairs (m of them), and the right-hand counts of a-tiles and b-tiles (both m). The identity (a b) to the m equals a to the m times b to the m is always verified. 1 3 6 ← m → ↔ drag m
Drag $m$ from $1$ to $6$. Whatever value you pick, the $(ab)^m$ strip contains exactly $m$ copies of $a$ and $m$ copies of $b$ — sort them, and you get $a^m \cdot b^m$. Regrouping is allowed because multiplication of real numbers is commutative and associative.

The one prerequisite this law quietly relies on is that order of multiplication does not matter — you can freely slide a-tiles past b-tiles. If you were working in a system where that is not true (for example, matrix multiplication), the law would fail. In ordinary arithmetic, the law is safe.

What the checker is really doing

The checker is a counter, not a calculator. At no point does it perform any exponent arithmetic. It is just tracking how many tiles of a are in each shape and reporting that count as an exponent.

That is why the three laws look so different in algebra but are really the same move in tile land:

Each move is a physical rearrangement that preserves the total tile count. The exponent laws are the algebraic shadows of those rearrangements.

Why to keep this picture in mind

Students often learn the three laws as three separate rules to memorise, and then promptly confuse them at the worst possible moment in an exam. The tile picture lets you derive each law on the fly from a single idea: count the tiles. If your answer's tile count doesn't match the question's tile count, your answer is wrong.

Concretely: next time you hesitate over whether (x^{4})^{3} is x^{7} or x^{12}, draw the grid. Three copies of a four-tile strip, stacked. That is a 4 \times 3 = 12-tile rectangle. x^{12}, not x^{7}. The tile count refuses to lie.

Related: Exponents and Powers · Tile-View Proof of the Three Core Exponent Laws · Exponent Slider: Watch 2^x Sweep Through 1/8, 1/4, 1/2, 1, 2, 4, 8 · Grain of Rice on a Chessboard