Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 12 2 Solution Created 2026-10-03 Updated 2026-10-07
Consider two finite assemblies of the same number of congruent bounded Euclidean tiles. Label their matching faces so the same prescribed face identifications are used in both assemblies. For each face type , encode the first assembly by a symmetric involution : a paired face exchanges its two tile indices, an exterior Dirichlet boundary condition contributes diagonal , and an exterior Neumann boundary condition contributes diagonal . Let encode the second assembly. Face coordinates are pulled back to the same reference face; if identifications have additional face isometries, these pullbacks must be included in the intertwining operators.
The transplantation theorem says that a constant matrix with for every face type sends the vector of tile restrictions of a Laplacian eigenfunction on the first assembly to one on the second, by . If is invertible, it is a bijection of each eigenspace and the assemblies are isospectral with multiplicities.
To prove it, each component solves the same interior equation , and a constant linear combination solves that equation too. On a face, let be the vector of boundary values and the vector of outward normal derivatives. All matching and exterior conditions are exactlyFor an internal face these equations say that values agree and the two outward derivatives sum to zero. For diagonal they impose zero value, and for diagonal zero normal derivative. The intertwining identity gives and , so the transplanted functions match and satisfy the correct boundary conditions. Applying proves the eigenspace bijection. At corners the same reasoning is interpreted in the finite-energy weak domain: no value jump and cancellation of normal flux prevent an extra distributional source. It gives the usual self-adjoint Dirichlet/mixed Laplacians on polygonal assemblies.
Here is an explicit transplantation by reflection parity. Take a rectangle of width and height , with the Dirichlet boundary condition on every exterior side. Cut it at its vertical midline into two congruent half-rectangles, pulling the right-hand half back by reflection. The midline gluing matrix isReplace the connected assembly by the disjoint union of two width-, height- rectangles: the first has Dirichlet conditions on all sides; the second has Dirichlet on three sides and Neumann on the side representing the cut. Its corresponding matrix is . The invertible, indeed orthogonal, matrixintertwines the midline conditions. Every other face has matrix on both assemblies, which automatically intertwines. The transplantation theorem proves equality of the complete spectra, although one surface is connected and the other has two components with the required uniform and mixed conditions.
Equivalently, odd reflection eigenfunctions vanish on the cut, while even reflection eigenfunctions have zero normal derivative there. A direct separation-of-variables check gives the connected rectangle's eigenvaluesEven gives the fully Dirichlet half-rectangle spectrum, and odd , , gives the mixed half-rectangle spectrum. The split preserves every multiplicity, including coincidences between different pairs of indices.
