Definition: The necessary condition for perfect tiling, stating that a container shape can be tiled by component shapes only if the area of the component divides the area of the container.
Chapter 1: The Cookie Sheet Rule (Elementary School Understanding)
Imagine you have a big rectangular sheet of cookie dough that is 6 inches by 10 inches. The total space you have is 6 × 10 = 60 square inches.
You have a cookie cutter that is a 2-inch by 3-inch rectangle. Each cookie you cut out will take up 2 × 3 = 6 square inches of dough.
The Law of Areal Divisibility is a simple, common-sense rule for this puzzle. It says:
You can only cover the whole sheet perfectly if the big sheet's area is perfectly divisible by the small cookie's area.
Let's check:
Big sheet area = 60.
Small cookie area = 6.
Is 60 divisible by 6? Yes! 60 ÷ 6 = 10.
The rule says it might be possible to fit exactly 10 cookies perfectly on the sheet. (And in this case, it is!)
Now, what if your cookie cutter was 3 inches by 3 inches?
Small cookie area = 9.
Is 60 divisible by 9? No. 60 ÷ 9 is 6 with a remainder.
The rule says it is impossible to cover the sheet perfectly with 3x3 cookies. You will always have leftover dough or gaps. This law is the very first thing you check to see if a puzzle is even possible.
Chapter 2: The First Test of Tiling (Middle School Understanding)
Tiling is the process of covering a surface (the container) with a set of shapes (the components or tiles) so there are no gaps and no overlaps.
The Law of Areal Divisibility is the first and most fundamental test that any tiling problem must pass. It states that for a perfect tiling to be possible, the total area of the container must be an integer multiple of the area of a single component tile.
The Formula:
Area(Container) / Area(Component) = k
where k must be a whole number (the number of tiles).
If k is not a whole number, the tiling is impossible.
Example 1: Success
Container: A 10 ft by 10 ft patio (Area = 100 sq ft).
Component: A 2 ft by 2 ft paving stone (Area = 4 sq ft).
Test: 100 / 4 = 25.
Verdict: The result is a whole number. The law says tiling is possible, and it will require exactly 25 stones.
Example 2: Failure
Container: An 8 ft by 8 ft room (Area = 64 sq ft).
Component: A 3 ft by 3 ft carpet tile (Area = 9 sq ft).
Test: 64 / 9 ≈ 7.11.
Verdict: The result is not a whole number. The law says tiling is impossible. You cannot cover the floor perfectly.
This law is a powerful "impossibility filter." It lets us quickly prove that many tiling puzzles are unsolvable without having to try every possible arrangement.
Chapter 3: A Necessary but Not Sufficient Condition (High School Understanding)
The Law of Areal Divisibility is formally stated as a necessary condition, but it is not a sufficient condition. This is a crucial distinction.
Necessary: If the condition is false, the outcome is impossible. (If the areas don't divide, you can't tile it).
Sufficient: If the condition is true, the outcome is guaranteed. (This is NOT the case here).
The most famous example that proves this distinction is the Mutilated Chessboard Problem.
The Container: Take a standard 8x8 chessboard (Area = 64) and remove two opposite corners (e.g., the top-left and bottom-right squares). The new area is 64 - 2 = 62.
The Component: A 1x2 domino (Area = 2).
Areal Divisibility Test:
Area(Container) / Area(Component) = 62 / 2 = 31.
The result is an integer. The Law of Areal Divisibility says that a tiling might be possible with 31 dominoes. It does not forbid it.
The Deeper Proof of Impossibility (The Coloring Argument):
A standard chessboard has 32 white and 32 black squares.
The two opposite corners are always the same color (e.g., both white). So, our mutilated board has 32 black squares but only 30 white squares.
Each domino, being 1x2, must always cover exactly one white square and one black square.
Therefore, 31 dominoes must cover exactly 31 white squares and 31 black squares.
This is a contradiction. Our board doesn't have 31 white squares. The tiling is impossible.
This proves that even when the Law of Areal Divisibility is satisfied, a tiling can be impossible for other, deeper structural reasons (like color or shape). The law is a powerful first step, but it doesn't tell the whole story.
Chapter 4: An Invariant-Based Proof of Impossibility (College Level)
The Law of Areal Divisibility is the most basic example of an invariant-based argument in tiling theory. An invariant is a property that is conserved—it doesn't change during a process.
Formal Statement: A region R can be tiled by a set of tiles {T₁, ..., Tₖ} only if the sum of the areas of the tiles equals the area of the region. Area(R) = Σ Area(Tᵢ). This is a statement of the conservation of the area invariant.
This principle can be generalized to prove impossibility using more sophisticated invariants, often by defining a coloring function or weighting function f.
A tiling is possible only if the total weight of the container is equal to the sum of the weights of the tiles.
∫_R f(x,y) dA = Σ ∫_{Tᵢ} f(x,y) dA
The Mutilated Chessboard Revisited:
We can formalize the coloring argument by defining a function f(square):
f(square) = +1 if the square is white.
f(square) = -1 if the square is black.
The "total weight" is the sum of these values over the region.
Weight of a Domino: A domino covers one white (+1) and one black (-1) square. Its total weight is (+1) + (-1) = 0.
Weight of 31 Dominoes: The sum of the weights of 31 tiles is 31 × 0 = 0.
Weight of the Mutilated Board: The board has 30 white squares (+30) and 32 black squares (-32). Its total weight is 30 - 32 = -2.
Conclusion: Since -2 ≠ 0, the invariant is not conserved. The tiling is proven to be impossible.
Tiling with Irrationals:
This method also provides a rigorous proof for why a square (Area = s², a rational number) cannot be tiled by equilateral triangles (Area = b²√3/4, an irrational number). The "invariant" here is the number's membership in the field ℚ versus the field extension ℚ(√3). You cannot sum a finite number of elements from ℚ(√3) to get a purely rational result unless the irrational parts perfectly cancel, which is often impossible for geometric reasons.
Chapter 5: Worksheet - The First Filter
Part 1: The Cookie Sheet Rule (Elementary Level)
Your cookie dough sheet is 8x8 (Area 64). Your cookie cutter is 2x4 (Area 8). Is it possible you could tile the sheet perfectly?
Your cookie dough sheet is 5x5 (Area 25). Your cookie cutter is 2x1 (Area 2). Is it possible you could tile the sheet perfectly?
Part 2: The First Test (Middle School Level)
You want to tile a 12x12 floor (Area 144) with 5x5 tiles (Area 25). Use the Law of Areal Divisibility to determine if this is possible.
A puzzle asks you to form a 10x10 square using only 4x1 rectangular tiles. Use the law to see if it's worth trying.
Part 3: Necessary, Not Sufficient (High School Level)
A "tromino" is a 3x1 tile. You want to tile a 5x5 board.
First, perform the Areal Divisibility test. Does it pass?
Second, try to sketch a tiling. Is it actually possible? What does this tell you about the law?
Explain the Mutilated Chessboard problem in your own words, focusing on why it proves the Law of Areal Divisibility is necessary but not sufficient.
Part 4: Invariants (College Level)
A "tetromino" is a shape made of four 1x1 squares. One type is a 4x1 rectangle. Another is a 2x2 square. Can you tile an 8x8 chessboard with 2x2 square tetrominoes? (Check both Areal Divisibility and the coloring argument).
Can you tile an 8x8 chessboard with 4x1 rectangular tetrominoes? (Check both Areal Divisibility and the coloring argument).
Explain how the concept of an "invariant" provides a more powerful and general framework for proving tiling impossibility than just area alone.