For the tetracode length-isospectral lattice construction , choose the first coordinate divisible by three and reverse its sign. Such a coordinate always exists because each nonzero tetracode word has one zero coordinate. The reflection preserves the reduction modulo three and switches the two lattice membership conditions modulo four. It is an involution between and preserving every absolute coordinate, so arbitrary positive diagonal weights preserve equality of their vector-length multisets.
The given two-dimensional ternary subspace is the tetracode. Its nonzero words form four one-dimensional subspaces, represented by
Every nonzero word has exactly three nonzero coordinates; in particular every codeword has a zero coordinate. We use this zero coordinate to construct a length-preserving reflection, but then choose unequal coordinate weights to rule out a global isometry.
The parity congruence description of tetracode lattices is especially convenient. Define integer Euclidean lattices
These congruences define additive subgroups of containing , so they are discrete and have full rank. For all-even vectors the last conditions coincide. For all-odd vectors they require respectively coordinate sum zero or two modulo four.
For an explicit basis, set
Their columns reduce to modulo three and satisfy the stated parity congruences, so . Since , . Conversely, the modulo-three condition has index nine, while each allowed set of residues modulo four has sixteen elements out of : eight all-even and eight all-odd residues. The Chinese remainder theorem therefore gives . The inclusions have equal index and are equalities.
For any , choose the first coordinate for which , and reflect that coordinate:
Such a coordinate always exists by the codeword description. Its reflection preserves and the common coordinate parity. If is odd, its sum changes by two modulo four, taking the plus condition to the minus condition. If is even, the sum changes by zero modulo four, and the two conditions already coincide. The set of coordinates divisible by three is unchanged, so applying the same rule again recovers . This proves a bijection preserving each absolute coordinate, the coordinate reflection bijection for tetracode lattices.
Now choose positive weights linearly independent over , for instance
The Euclidean lattices and have the same multiset of vector lengths, because is preserved by . A closed geodesic of a flat torus is the projection of a straight line with displacement a lattice vector. Thus the two tori have identical length spectra, including multiplicities of lattice displacements. Primitive lengths can also be recovered by subtracting proper iterates successively, so they agree as well.
Suppose a torus isometry existed. Its lift to is affine with orthogonal linear part taking onto . Put , so . Since , its image is an integer vector satisfying
Rational independence of the weights forces . Hence for every : the rationally independent axis weights obstruct a lattice isometry by forcing it to be a diagonal sign change.
Such a sign change would preserve modulo three. The code has a unique nonzero projective word supported on each triple of coordinates, so preserving each of its four support sets forces the three signs on each triple to agree. All four signs therefore agree, leaving only or . Both preserve rather than exchanging it with . These lattices are distinct: is odd and has sum zero, so is not in . This contradiction proves
The choice of weights is essential; setting all four equal would make the displayed bases orthogonal with equal lengths and would not prove nonisometry.
Use the following skew-symmetric matrix, whose columns reduce modulo three to four of the specified nonzero tetracode words:
Set , , and define the full Euclidean lattices . Their determinants have absolute value , since
For arbitrary positive real numbers , put and . This is the tetracode length-isospectral lattice construction. We prove equality of the length multisets by an explicit bijection, not just equality of the shortest lengths.
Modulo three, both lattices have image . The matrix has rank two over ; its four column lines are precisely the four lines in . Also modulo three, so . Each nonzero tetracode word has exactly one zero coordinate. Every therefore has some coordinate divisible by three. Moreover, all four coordinates of have the same parity, because every entry of either is odd.
For , choose the least index with and set . The coordinate reflection bijection for tetracode lattices will show that . First, , so . Second, positive-lattice membership implies . Hence
The expression in parentheses has th coordinate zero and every other coordinate even, by the common parity and . Thus . Together the congruences modulo three and four say , which is precisely .
Conversely, if , the same reflection has unchanged reduction modulo three, and now . Thus
Its th coordinate is and its other coordinates are even multiples of two, so it vanishes modulo four; it vanishes modulo three as well. The reflected vector is in . The chosen index is unchanged by reflection, including for vectors reducing to zero, so this map is an involution between the two lattices. It preserves every and therefore preserves . The two lattices have the same length spectrum, including every multiplicity, for every positive choice of weights.
To prove a genuine failure of isometry, choose
These four numbers are linearly independent over : changing the signs of the independent square roots in the multiquadratic field isolates each coefficient of a rational relation. If an orthogonal transformation maps to , then
and . Comparing rational coefficients of the independent in the diagonal entries gives . Consequently is diagonal with entries .
Such a coordinate sign change must preserve modulo three. For each zero coordinate , there are exactly two opposite nonzero tetracode words. Preserving their line requires the other three signs to be equal. Taking two different zero coordinates forces all four signs to be equal. Thus or , either of which would imply . But
This contradiction proves and are not isometric. Allowing affine isometries changes nothing: translating the image of zero back to zero reduces them to the orthogonal case.
For the flat tori, take period lattices equal to the dual lattices:
The standard spectrum of a flat torus lemma states that its characters of a real torus are indexed by the dual of its period lattice. Here they are for , with Laplacian eigenvalue . These characters give a complete orthogonal basis, so our length-preserving bijection proves that and are isospectral manifolds. The second standard lemma is that an isometry of flat tori lifts to an affine isometry of their Euclidean universal covers. Its orthogonal part maps the period lattices to one another, and therefore maps their dual lattices to one another. This would give the impossible isometry . Hence and are isospectral non-isometric flat four-dimensional tori.
Choose positive axis weights linearly independent over the rationals, and suppose both integer Euclidean lattices contain for some positive integer . A length-preserving linear map sends each to an integer vector with exactly that absolute-coordinate pattern, by the displayed implication. Thus the map must be a diagonal sign change. For the four-coordinate tetracode, preserving the code forces all four signs to agree, because each of its four nonzero projective words has support on a different triple of coordinates. A global sign cannot exchange the two odd-vector parity conditions, proving nonisometry for these weights.
Tetracode length-isospectral lattice construction Created 2026-10-07 Updated 2026-10-14
For the skew matrix , both Euclidean lattices reduce to the tetracode modulo . A reflection depending on the reduction coset matches their vectors coordinatewise in absolute value. Their weighted length spectra agree for all positive diagonal axis weights. Rationally independent weights force any possible linear isometry to be a coordinate sign change; the code then forces an overall sign, which does not identify the two lattices.