If the largest square has a size of 1×1, the entire Pythagoras tree fits snugly inside a box of size 6×4. The finer details
of the tree resemble the Lévy C curve.
The construction of the Pythagoras tree begins with a square. Upon this square are constructed two squares, each scaled down by a linear factor of ½√2, such that the corners of
the squares coincide pairwise. The same procedure is then applied recursively to the two smaller squares, ad infinitum. The illustration below shows the first few iterations in the construction process.
Iteration n in the construction adds 2n squares of size (½√2)n, for a
total area of 1. Thus the area of the tree might seem to grow without bound in the limit n→∞. However,
some of the squares overlap starting at the order 5 iteration, and the tree actually has a finite area because it fits inside
a 6×4 box.
It can be shown easily that the area A of the Pythagoras tree must be in the range 5 < A < 18,
which can be narrowed down further with extra effort. Little seems to be known about the actual value of A.