Affine map Created 2026-10-07 Updated 2026-10-14
An affine map combines a linear map with a translation. After choosing coordinate origins, it has the form , , where the matrix is its linear part of an affine map and is a fixed vector. Equivalently, it preserves every affine combination. [ref]
Curves and Surfaces in Geometric Modeling: Theory and Algorithms by Jean Gallier. §2.7, Definition 2.7.1 and linear-map construction, pp. 37–38
An original planar example isIt stretches horizontally, applies a shear mapping, and then translates. The vertices , and become , and . A square grid becomes a grid of parallelograms; straight edges and their weighted points still fit together.
This map is not a linear map with respect to the displayed origins, because rather than zero. It also is not a Euclidean similarity: has length and has length , while the right angle at becomes . Its determinant is , so it doubles planar area. These metric changes explain why affine geometry studies straightness, incidence and weighted points rather than treating every transformation as an isometry.
The linear part is an invertible matrix, giving the concise inverse . More generally an affine map is bijective exactly when its linear part of an affine map is bijective. Between equal finite-dimensional spaces, this means an invertible matrix; the translation cannot repair a loss of rank of a linear map.
Affine maps can collapse lines 2026-10-14
An affine map need not be injective. For , the direction belongs to the kernel of its linear part of an affine map. Consequently the whole line maps to , and every parallel line maps to . These are collapsed lines, not images with a surviving direction. Assertions that an affine map preserves distinct parallel lines require the appropriate noncollapse or injectivity hypothesis.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 16 2 Solution Created 2026-10-03 Updated 2026-10-07
Construct the Euclidean lattices in an orthogonal coordinate system whose squared axis lengths areThus an integer coordinate vector has squared norm . These four numbers are linearly independent over : the four sign changes of in their field extension isolate the four coefficients of a rational relation. The independence will distinguish the two flat tori; equality of their length spectra will hold for every positive choice of axis weights.
LetHere and below these integer coordinates are interpreted in the weighted orthogonal axes. Direct multiplication gives , , andIn particular both are full-rank Euclidean lattices. Denote their four generator columns by . Modulo the two matrices have the same columns, and the nonzero words of the given ternary tetracode are exactlyThese are the reductions of , respectively. The first and fourth displayed words are the specified generators, and the middle two arise from their sum and difference, up to sign. Thus reduction modulo maps either Euclidean lattice onto precisely .
To construct a length-preserving correspondence, find the kernels of this reduction. The inverse matrix is . Hence exactly when . These congruences are equivalent toFor clarity, the first congruence is ; subtracting the others gives evenness of each required pair sum. For the matrix the first congruence is ; the remaining congruences again give equality of the four parities. Substitution proves the converse in each case.
Let be the orthogonal reflection changing only coordinate . If the coordinates of are even, this changes their sum by a multiple of ; if all are odd, it changes the sum by modulo . ThereforeEach Euclidean lattice is the disjoint union of its kernel and the eight cosets , since has nine words. Define a map by using on and on each of and . Each piece maps bijectively onto the corresponding coset. Thus is a bijection satisfyingIt also commutes with . The closed geodesics of a flat torus have lengths for nonzero translation vectors in its Euclidean lattice. Consequently the two length spectra agree, including the multiplicities of translation classes and with either consistent orientation convention. If only primitive closed geodesics are counted, the same conclusion follows by removing iterates in increasing order of length: the total multiplicity at is the sum of primitive multiplicities at , and there are only finitely many such contributions below any fixed length. The correspondence need not itself preserve primitiveness to give this conclusion.
It remains to prove the two flat tori are not isometric. An isometry of flat tori lifts to an affine Euclidean isometry; its linear part of an affine map must carry onto . In integer coordinates write this part as . For every , both and have integer coordinates and have equal squared norms. Rational independence of the impliesApply this to for all . Two squared linear forms agreeing on all integer points agree as polynomials; their difference factors, so one form is the other or its negative. Since is invertible, is consequently a diagonal sign change .
Modulo , such a must preserve . Each nonzero word of has exactly three nonzero coordinates, and for each choice of zero coordinate there are just two such words, differing by an overall sign. Preserving these words forces the three signs on each support to agree. The four overlapping supports then force . Thus only and are possible. Neither changes .
Finally : it has the same ternary word as , but their difference is , which fails the congruence defining . Hence and no such linear isometry exists. This completes the tetracode length-isospectral lattice construction.
Square grid Created 2026-10-14 Updated 2026-10-18
Two equally spaced families of perpendicular lines partitioning the Euclidean plane into congruent squares. A general affine map can turn this grid into parallelograms, or collapse directions if its linear part of an affine map is not injective.
