This paper explores the geometry of the affine group over integers, constructing computable invariants for geometric objects, classifying ellipses, and analyzing the decidability of polyhedra dissection problems within this group.
Contribution
It introduces computable invariants for affine group orbits, classifies ellipses using advanced algebraic methods, and establishes decidability results for rational polyhedra in integer affine geometry.
Findings
01
Constructed Turing-computable orbit invariants for various geometric figures.
02
Classified ellipses in integer affine geometry using algebraic invariants.
03
Proved the decidability of orbit equivalence for rational polyhedra under integer affine transformations.
Abstract
The subject matter of this paper is the geometry of the affine group over the integers, GL(n,Z)⋉Zn. Turing-computable complete GL(n,Z)⋉Zn-orbit invariants are constructed for angles, segments, triangles and ellipses. In rational affine GL(n,Q)⋉Qn-geometry, ellipses are classified by the Clifford--Hasse--Witt invariant, via the Hasse-Minkowski theorem. We classify ellipses in GL(n,Z)⋉Zn-geometry combining results by Apollonius of Perga and Pappus of Alexandria with the Hirzebruch-Jung continued fraction algorithm and the Morelli-W\l odarczyk solution of the weak Oda conjecture on the factorization of toric varieties. We then consider {\it rational polyhedra}, i.e., finite unions of simplexes in Rn with rational vertices. Markov's…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Algebraic Geometry and Number Theory · Advanced Algebra and Geometry
Full text
Basic geometry of the affine group over Z
Daniele Mundici
Department of
Mathematics and Computer Science “Ulisse Dini”
University of Florence
The subject matter of this paper is the geometry of
the affine group over the integers,
GL(n,Z)⋉Zn. Turing-computable complete
GL(n,Z)⋉Zn-orbit invariants
are constructed for angles, segments, triangles and ellipses.
In rational affine
GL(n,Q)⋉Qn-geometry, ellipses
are classified by the Clifford–Hasse–Witt invariant, via
the Hasse-Minkowski theorem.
We classify ellipses in
GL(n,Z)⋉Zn-geometry
combining results by
Apollonius of Perga and Pappus of Alexandria
with the Hirzebruch-Jung continued fraction algorithm and
the Morelli-Włodarczyk solution of the weak
Oda conjecture on the factorization of toric varieties.
We then consider rational polyhedra,
i.e., finite unions of simplexes in Rn with rational vertices. Markov’s unrecognizability theorem for combinatorial manifolds states
the undecidability of the problem whether
two rational polyhedra P and P′ are continuously
GL(n,Q)⋉Qn-equidissectable.
The same problem for the continuous
GL(n,Z)⋉Zn-equidissectability
of P and P′ is open.
We prove the decidability of the problem whether two
rational polyhedra P,Q in Rn have the same
GL(n,Z)⋉Zn-orbit.
Key words and phrases:
Affine group over the integers, Klein program,
complete invariant, Turing computable invariant,
GL(n,Z)-orbit, conic,
conjugate diameters,
Apollonius of Perga, Pappus of Alexandria,
quadratic form,
Clifford–Hasse–Witt invariant, Hasse-Minkowski theorem,
Farey regular simplex, regular triangulation,
desingularization,
weak Oda conjecture,
Hirzebruch-Jung continued fraction algorithm,
polyhedron,
Markov unrecognizability theorem.
In Klein’s 1872
inaugural lecture at the University of Erlangen
one finds the following programmatic statement111See
page 219 in his paper
“A comparative review of recent researches in geometry”,
Bull. New York Math. Soc., 2(10) (1893) 215–249,
https://projecteuclid.org/euclid.bams/1183407629:
As a generalization of geometry arises then the following comprehensive problem
[…]:
Given a manifoldness and a group of transformations of the same; to develop the theory of invariants relating to that group.
In the spirit of Klein’s program, in the first part of this paper
we construct Turing-computable complete invariants of angles,
segments, triangles and ellipses in the geometry of the affine group
over the integers, GL(n,Z)⋉Zn.
Our starting point is the following problem,
for arbitrary X,X′⊆Rn:
[TABLE]
Otherwise stated: Do X and X′ have the same GL(n,Z)⋉Zn-orbit ?
By a “decision method” for this problem
we understand
a Turing machine M which, over
any input X,X′ decides whether X
and X′ have the same orbit.
X and X′ must be
effectively presented to M as finite strings of
symbols.
Thus, e.g., if X is a triangle, we will assume
that its vertices have rational coordinates, and
X is presented
to M via the list of its vertices. If
X is an ellipse, X is understood as
the zeroset Z(ϕ) in R2
of a quadratic polynomial ϕ(x,y) with rational coefficients,
and is presented to M
via the list of coefficients of
ϕ.
In Theorem
5.4
we equip rational triangles with
a (Turing-) computable complete
GL(n,Z)⋉Zn-orbit invariant.
Basic constituents of our side-angle-side invariant are the
invariants introduced in
[4]
for affine spaces in GL(n,Z)⋉Zn-geometry, (Theorem
2.5).
Section 3 is devoted to showing
the computability of these invariants.
Further main constituents
are the
GL(n,Z)⋉Zn-orbit invariants for angles and segments
constructed in Theorems
4.2 and 5.3.
It follows that
Problem (1) is decidable
for segments, angles and triangles in GL(n,Z)⋉Zn-geometry.
In Section 6
we construct computable complete invariants for ellipses:
In euclidean
geometry, ellipses are
classified by the lengths of their major and minor axes.
In GL(2,Q)⋉Q2-geometry,
the Hasse-Minkowski theorem classifies rational
ellipses by their
(Clifford-Hasse-Witt)
invariants, [2, 1.1], [9, §5], [13, §4].
Let E denote the set of
rational ellipses E⊆R2
containing a rational point.
As is well known, (see, e.g.,
[6], [25]),
from the input rational coefficients of ϕ it is
decidable whether the zeroset of ϕ is an
ellipse E∈E.
If this is the case, E contains a dense set of rational points.
In Theorem 6.4 a
finite set of invariants
is computed from ϕ, in such a way that
a rational ellipse E′ has the same
GL(2,Z)⋉Z2-orbit of E iff
E and E′ have the same invariants.
It follows that
Problem (1) is decidable
for ellipses.
For our constructions in this paper
we combine results on conjugate diameters by
Apollonius of Perga [1] and Pappus of Alexandria [21],
with the Hirzebruch-Jung continued fraction algorithm,
[7, 8, 20], and
the Morelli-Włodarczyk solution of the weak
Oda conjecture on the factorization of toric varieties.
[15, 27],
In Theorem
7.2,
Problem (1) is shown to be
decidable for
rational
polyhedra, i.e., finite union of simplexes with
rational vertices, [26]. In a final remark this
result is compared with Markov’s
theorem ([5, 24],
see Theorem 7.1)
on the unrecognizability of
rational polyhedra in GL(n,Q)⋉Qn-geometry,
to the effect that manifolds cannot be characterized up to homeomorphism by computable complete invariants.
2. Classification of rational affine spaces in GL(n,Z)⋉Zn-geometry
A rational affine hyperplaneH
is a subset of Rn of the form
H=\{z\in\mathbb{R}^{n}\mid\langle p,z\rangle=\upsilon\},\mbox{ for some nonzero vector
p\in\mathbb{Q}^{n}and\upsilon\in\mathbb{Q}.}
Here
⟨\mbox−,\mbox−⟩ denotes scalar product.
Any intersection
of rational affine hyperplanes in Rn
is said to be a rational affine space in Rn.
For any subset X of Rn,
the affine spanaff(X) is defined by stipulating that
a point
z belongs to aff(X)
iff there are w1,…,wk∈X
and λ1,…,λk∈R
such that λ1+⋯+λk=1
and z=λ1w1+⋯+λkwk.
(See [11] for this terminology.)
Equivalently, we say that aff(X) is the set of
affine combinations
of elements of X.
A set {y1,…,yl}⊆Rn is said to be
affinely independent if none of its elements
is an affine combination of the remaining elements.
For 0≤d≤n, a d-simplex
in Rn is the
convex hull T=conv(v0,…,vd) of d+1 affinely
independent points v0,…,vd∈Rn.
The verticesv0,…,vd are uniquely determined by T.
T is said to be a rational simplex if its vertices are
rational. The (affine) dimensiondim(T) is equal to d.
The denominatorden(x) of a rational point
x=(x1,…,xn)∈Qn
is the least common denominator
of its coordinates.
The vector
[TABLE]
is said to be the homogeneous correspondent
of x.
The integer vector
x is primitive, [20, p.24], i.e.,
the greatest common divisor of its coordinates
is equal to 1.
Every primitive integer vector q∈Zn+1
whose (n+1)th coordinate is >0 is the homogeneous correspondent
of a unique rational point x∈Rn, called the
affine correspondent of q.
With the notation of [7, I, Definition 1.9, p.6],
given vectors v1,…,vs∈Rn we write
[TABLE]
for their positive hull in Rn.
Let t=1,2,…,n. Adopting
the terminology of [7, p.146],
by a t-dimensional
rational simplicial cone in Rn
we understand a set C⊆Rn of the form
C=pos[w1,…,wt],
for linearly independent primitive integer vectors
w1,…,wt∈Zn.
The latter are said to be the
primitive generating vectors of C. They are uniquely
determined by C.
By a *face * of C we mean the positive hull
of a subset of {w1,…,wt}.
The face of C determined by the empty
set is the singleton {0}. This is the only
zero-dimensional cone in Rn.
Farey regularity
A rational d-simplex
T=conv(v0,…,vd)⊆Rn
is said to be (Farey)* regular*
(“unimodular” in [17])
if the set {v~0,…,v~d} of
homogeneous correspondents of its vertices
can be extended to a basis of
the free abelian group Zn+1.
Equivalently, the cone pos[v~0,…,v~m]⊆Rn+1
is regular in the sense of [7, Definition V 1.10, p.146],
or “nonsingular” in the sense of [8, p.29] and [20, p.15], or “unimodular” in the sense of [11, §7].
A rational triangulation in Rn is an (always finite)
simplicial complex Δ such that the vertices
of every simplex in Δ have rational
coordinates in Rn.
The point-set union of all simplexes in Δ
(called the support of Δ) is the
most general possible rational polyhedron in Rn,
[26, Chapter II].
A simplicial complex
is said to be a regular
triangulation (of its support) if
all its simplexes are regular.
Regular triangulations are
affine counterparts of regular fans of toric algebraic
geometry, [7, p.165], called “nonsingular
fans” in [20, Theorem 1.10].
(Warning: the notion of a “regular” triangulation given in
[11, p. 387] has a different meaning.)
Regular triangulations play a fundamental role
in GL(n,Z)⋉Zn-geometry, as well as in the theory of AF C*-algebras
with lattice-ordered K0-group, [16, 18],
(also see [19] for recent developments).
Lemma 2.1** (A corollary of Steinitz exchange lemma).**
Let conv(x0,…,xm)⊆Rn be a regular m-simplex.
Suppose
conv(y0,…,ye)⊆Rn is
a regular e-simplex and
aff(y0,…,ye)=aff(x0,…,xe). Then
e≤m, and
conv(y0,…,ye,xe+1,…,xm) is a regular
m-simplex.
Proof.
Passing to the homogeneous correspondents
x~j,y~k∈Zn+1
of these rational points,
by definition of regularity we have a trivial
variant of Steinitz exchange lemma.
∎
Lemma 2.2** (A corollary of Minkowski convex body theorem).**
Given linearly independent
integer vectors p1,…,pm∈Rn
let
[TABLE]
be their half-open parallelepiped.
Then {p1,…,pm} is part of a basis of the free
abelian group Zn iff
the only integer point in P(p1,…,pm)
is the origin 0∈Rn.
P(p1,…,pm) is called the
fundamental parallelepiped of p1,…,pm
in [11, §7].
The following result is a routine consequence of
Lemma 2.2.
We include the proof for later use in
Lemma 4.1(iii).
Lemma 2.3**.**
Suppose
p∈Zm+1, and
{b1,…,bm,q} is a basis of the free abelian group
Zm+1. Then
{b1,…,bm,p} is a basis of Zm+1
iff p=±q+l for some linear combination l
of b1,…,bm with integer coefficients.
Proof.
(⇒)
Let us denote by [b1,…,bm,p] the unimodular matrix
with columns vectors
b1,…,bm,p.
Let H=Rb1+⋯+Rbm be the linear span of the vectors
b1,…,bm in Rm+1. Let H±
be the affine hyperplanes in Rm+1
parallel to H and containing ±q respectively.
By way of contradiction, suppose
p does not coincide with
±q+l for any a linear combination l
of b1,…,bm with integer coefficients.
Since ∣det[b1,…,bm,p]∣=1= volume of
P(b1,…,bm,p)=
volume of P(b1,…,bm,q),
then p∈H+ or p∈H−,
say p∈H+. Then for some linear combination
l′ of b1,…,bm with integer coefficients,
the translated half-open parallelepiped
q+l′+P(b1,…,bm)
contains the integer point p=q+l′. So
P(b1,…,bm) contains the nonzero
integer point p−q−l′. By Lemma 2.2,
this contradicts the fact that {b1,…,bm} is part of
a basis of Zm+1.
The (⇐) direction is trivial.
∎
The invariants dF and cF
For every rational affine space F⊆Rn
we set
[TABLE]
Next suppose F is
e-dimensional. If 0≤e<n
we define the integer
cF>0
as the
least possible denominator den(v) of
a rational point v∈Qn
such that there are points
v0,…,ve∈F∩Qn
making conv(v,v0,…,ve) a regular
(e+1)-simplex.
If e=n we define cF=1.
Lemma 2.4**.**
Let F⊆Rn be a rational affine space.
If dim(F)=n−1, cF=1.
If dim(F)=n−1, then 1≤cF≤max(1,dF/2) and gcd(cF,dF)=1, where
“gcd” denotes greatest common divisor.
There exists a Turing machine T with the following property:
For any two (n+1)-tuples
V=(v0,…,vn) and
W=(w0,…,wn) of rational points
in Rn with den(vi)=den(wi),(i=0,…,n),
T decides whether
both conv(v0,…,vn) and
conv(w0,…,wn)
are regular
n-simplexes in Rn and, if this is the case,
computes the uniquely determined map
γ=ϕVW∈GL(n,Z)⋉Zn such that
γ(vi)=wi for each i∈{0,…,n}.
Proof.
Lemma 2.2
yields a decision procedure to check whether
conv(v0,…,vn) is regular.
If this is the case, the proof of [4, Lemma 1]
yields an effective procedure to
compute the desired map γ.
∎
Lemma 3.2**.**
There is a Turing machine which, given a rational affine
space F=aff(a1,…,am)⊆Rn,(m\mboxarbitrary,eachai∈Qn)
together with a rational point v0∈F with
den(v0)=dF, first
computes the integer e=dim(F) and then outputs
points v1…,ve∈Qn∩F with
den(v1)=⋯=den(ve)=dF such that
conv(v0,v1,…,ve)
is a regular e-simplex.
Proof.
The dimension e of F is immediately computed from the input rational points ai. We can easily pick
rational points r1,…,re∈F
such that the set R=conv(v0,r1,…,re) is an
e-simplex. With the notation of (2), let
the set R⊆Rn+1 be defined by
[TABLE]
The desingularization procedure
[7, VI, 8.5], [8, p.48] yields a complex Φ of
rational polyhedral cones (for short, a fan) in Rn+1 such that
each (e+1)-dimensional cone C∈Φ
has the form C=pos[q~0,q~1,…,q~e]
for a suitable set
{q~0,q~1,…,q~e} of primitive integer vectors
which is part of a basis of the free abelian group Zn+1.Φ is known as a regular (or nonsingular) fan
providing a desingularization of R.Φ is computable by a Turing machine over input v0,r1,…,re.
The rational points
q0,q1,…,qe∈F are the vertices of a regular complex
Δ with support R. Thus in particular
Δ contains a regular
e-simplex
T0=conv(v0,w1,…,we) having v0 among its vertices.
By construction, the
set {v0,w1,…,we}
is part of a basis of the free abelian group Zn+1.
If den(wi)=dF for all i=1,…,e we are done.
Otherwise, let j be the smallest index in {1,…,e}
such that den(wj)>den(v0).
Then the integer vector wj−v0 is primitive, because
replacing wj by wj−v0 in the set
{v0,w1,…,we}
we obtain a part of a basis of Zn+1.
So let the rational point wj1 be defined by
wj1=wj−v0. Since both
wj and v0 lie in F, then so does wj1.
Further, the e-simplex
Tj1=conv(v0,w2,…,wj1,…,we)⊆F is regular,
and den(wj)>den(wj1)≥den(v0).
Inductively, we have regular e-simplexes
Tj1,Tj2,…⊆F with
[TABLE]
After a finite number s=sj≥0 of steps we will have
den(wjs)≤den(v0), whence
[TABLE]
by the assumed
minimality property
of den(v0).
We then set
vj=wjs\mboxandT1=Tjs,
and note that T1⊆F is the
regular e-simplex
obtained from T0 replacing wj by the new vertex
vj∈F.
Assuming inductively that Tr+1 is obtained
in a similar way by
replacing a vertex of Tr by a new vertex lying in F
with denominator equal to dF,
the procedure will finally output the desired regular
e-simplex
conv(v0,…,ve)⊆F
with den(v0)=⋯=den(ve)=dF.
The computability of
the map (a1,…,aj)↦(v0,…,ve)
is clear.
∎
Theorem 3.3**.**
Let F⊆Rn
be an e-dimensional rational affine space
(e=0,…,n). Then there are rational points
v0,…,vn∈F such that
(i)
den(vi)=dF* for all i∈{0,…,e};*
(ii)
den(vi)=cF* for all i∈{e+1,…,n};*
(iii)
conv(v0,…,vn)* is a regular n-simplex.
*
Moreover, once F is presented as aff(a0,…,ae) for
some a0,…,ae∈Qn, the points
v0,…,ve can be computed by a Turing machine.
Proof.
The problem whether
F contains rational points of a
prescribed denominator is decidable,
and whenever a solution exists,
such a point can be explicitly found—e.g.,
via integer linear programming, [11, §7]. Thus
we first check whether
F contains some integer point.
If such x exists then dF=1.
Otherwise we proceed inductively to
check if F contains a point with denominator
2, 3, …. Since
F is a rational subspace of Rn,
this process terminates, yielding a point
v0∈F with the smallest possible
denominator. Thus dF=den(v0).
Now Lemma 3.2 yields a regular
e-simplex conv(v0,…,ve)⊆F satisfying
den(v1)=⋯=den(ve)=den(v0)=dF.
The proof now proceeds arguing by cases:
Case 1:F has codimension 1,
i.e., e=n−1.
Let C0 be a closed cube with rational vertices,
centered at v0 and containing the simplex
conv(v0,…,ve). Let
C0⊆C1⊆C2⊆…
be a sequence
of closed n-cubes with rational vertices,
centered at v0, where Ct+1 is obtained
by doubling the sides of Ct.
For any t=0,1,…, we
check whether there exists a rational point s∈Ct
satisfying the conditions
(*)
den(s)≤max(1,dF/2), and
2. (**)
the set conv(v0,…,ve,s)
is a regular n-simplex.
Each cube Ct contains only finitely many rational points x
satisfying den(x)≤max(1,dF/2).
For any such point
x, Lemma 2.2
yields a method to decide whether
conv(v0,…,ve,x) is a regular
n-simplex: one checks that
the half-open (n+1)-dimensional
parallelepiped
[TABLE]
does not contain any nonzero integer point.
Lemma 2.4 in combination with
[4, Lemma 7] ensures the existence
of a point s∈Rn
with den(s)=cF≤max(1,dF/2), together with
points v0∗,…,ve∗∈F, all with denominator dF, such
that
conv(v0∗,…,ve∗,s) is a regular n-simplex.
Similarly, since conv(v0,…,ve)⊆F
is regular, an application of
Lemma 2.1 shows that
[TABLE]
We have just shown that there is
t=1,2,…,
and a rational point s∈Ct satisfying conditions
(*) and (**) above. This result is now strengthened as follows:
[TABLE]
If dF=1 then cF=1 and by Condition (*)
we are done.
So assume dF≥2.
If n=1 then e=0, so F={v0}
for some v0∈Q∖ZdF=den(v0)≥2.
Whenever s∈Q is such that
conv(v0,s) is a regular
1-simplex in R and den(s)≤max(1,den(v0)/2)=den(v0)/2,
there is no r with
conv(v0,r) regular and den(r)<den(s).
As a matter of fact, say without loss of generality
s>v0. Repeated applications of
Lemma 2.2
show:
If v0<r<s then P(v~0,s~) contains
the integer point r~, against the regularity of
conv(v0,s).
If v0<s<r then P(v~0,r~) contains
the integer point s~, against the regularity of
conv(v0,r).
If v0>r then P(v~0,s~) contains
the integer point v~0−r~, against the regularity of
conv(v0,r).
This settles the case n=1.
If n>1 we can write
n−1=e≥1\mboxandden(s)≤dF/2.
Let
\mathcal{D}=\{u\in\mathbb{Q}^{n}\mid\operatorname{\mathrm{conv}}(v_{0},\dots,v_{e},u)\mbox{ is a regular n-simplex}\}.
Thus u∈D iff {v~0,…,v~e,u~}
is a basis of Zn+1. By Condition (**) and
Lemma 2.3,
u∈D iff
u~=±s~+c, for some linear combination c of
v~0,…,v~e with integer coefficients. Thus in particular, if u∈D
the (n+1)th coordinate u~n+1 of u~ satisfies
[TABLE]
This is so because the
(n+1)th coordinates of v~0,…,v~e
are all equal to dF. Since
den(s)≤dF/2 then den(u)≥den(s) for all
u∈D.
Since, by (5),
s∗∈D then cF≤den(s)≤den(s∗)=cF,
which settles (6), and concludes the proof of Case 1.
*Case 2: *
The codimension of F is different
from 1.
Then by Lemma 2.4, cF=1.
Using Lemma 3.2
we compute
a regular simplex conv(v0,…,ve)⊆F with
den(v1)=⋯=den(ve)=den(v0)=dF.
In case dim(conv(v0,…,ve))=n
we are done.
In case dim(conv(v0,…,ve))=n,
knowledge that cF=1 simplifies the search
(within the increasing sequence of cubes Ct) of
the desired integer points ve+1,…,vn such that
conv(v0,…,vn) is regular. Regularity amounts to
the unimodularity of the integer matrix
whose rows are the vectors v0,…,vn—a decidable problem.
Since each Ct contains only finitely many integer points, an
exhaustive search
in each n-cube Ct centered at v0 will provide
the desired points ve+1,…,vn.
By construction, the map
(a0,…,ae)↦(v0,…,vn) is computable.
∎
Corollary 3.4**.**
For any rational affine space F⊆Rn the
invariants
dim(F),dF and cF
in Theorem 2.5 are computable.
Thus it is decidable whether the affine spans of two sets of
points a0,…,am∈Qn and
b0,…,bl∈Qn
have the same GL(n,Z)⋉Zn-orbit.
Moreover, there is a Turing machine M which,
whenever two e-dimensional
rational affine spaces F,F′⊆Rn
have the same GL(n,Z)⋉Zn-orbit (e=0,…,n),
computes two (n+1)-tuples
V=(v0,…,vn) and V′=(v0′,…,vn′)
of rational points
with den(v0)=⋯=den(ve)=den(v0′)=⋯=den(ve′)=dF and
den(ve+1)=⋯=den(vn)=den(ve+1′)=⋯=den(vn′)=cF such that
conv(v0,…,vn) and conv(v0′,…,vn′) are
regular n-simplexes and the map γ=ϕVV′∈GL(n,Z)⋉Zn
of Lemma 3.1 sends F onto F′.
Proof.
From Theorem 3.3 we obtain:
(i) rational points v0,…,ve∈F such that
conv(v0,…,ve) is a regular e-simplex and
den(v0)=⋯=den(ve)=dF;
(ii) (if e<n) additional points
ve+1,…,vn∈Rn
such that
conv(v0,…,vn) is a regular n-simplex
with den(ve+1)=⋯=den(vn)=cF.
Similarly, from
(b0,…,bk), we get
a regular n-simplex
conv(v0′,…,vn′) with
conv(v0′,…,ve′)⊆F′, and denominators as
in (i)-(ii). By
Theorem 2.5, the identity
(dim(F),dF,cF)=(dim(F′),dF′,cG′) can be effectively
checked. If the identity holds,
Lemma 3.1 and
Theorem 3.3
yield the desired Turing machine M.
∎
Remark 3.5**.**
One might speculate that the map
γ∈GL(n,Z)⋉Zn of F onto F′
in Corollary 3.4 is obtainable
by solving
a system of equations p1=0,…,pk=0, where
each pi is a polynomial with integer coefficients
and the unknowns are integers representing the terms
the matrix γ. As n grows, so does
the degree of the system. We are then
faced with a formidable subproblem of a
diophantine problem whose general
undecidability was proved by
Matiyasevič in his negative solution of Hilbert Tenth Problem,
[14].
Taking an alternative route, the decidability of the
orbit problem for
F and F′ has been established
by constructing suitable regular simplexes
in F and F′, using the classification
Theorem 2.5.
In the next sections,
refinements of these techniques
will provide computable complete
invariants for triangles and ellipses in GL(n,Z)⋉Zn-geometry.
4. Classification of
angles in GL(n,Z)⋉Zn-geometry
As a special case of a rational affine space, a rational lineL in Rn is a line containing at least two distinct rational
points. Every rational point v∈L determines
two rational half-lines in L with a common
origin v.
A rational oriented angle is a pair (H,K) of rational half-lines in
Rn with a common origin.
We will henceforth assume
that (n≥2 and) the affine spans of H and K
in Rn
are distinct (for short, the angle (H,K) is nontrivial).
Nontriviality is decidable by elementary linear algebra.
We denote by HK the convex portion
of the plane
aff(H∪K)⊆Rn
obtained by rotating H to K
around v in aff(H∪K), with the
orientation from H to K. Given a rational oriented
angle (H′,K′) in Rn we write
(H,K)≅(H′,K′)
if there is γ∈GL(n,Z)⋉Zn such that
γ(H)=H′ and γ(K)=K′.
When this is the case we also write
γ:(H,K)≅(H′,K′).
While HK=KH,
Theorem 4.2 will show that
the condition (H,K)≅(K,H) generally fails.
Lemma 4.1**.**
For any rational half-line H⊆Rn
with origin v, let
Hreg be the set of rational points h∈H
such that the segment conv(v,h) is regular. We then have:
(i) Any
two distinct points h,k∈Hreg have different denominators.
(ii) Hreg contains a farthest point from v, denoted
qH. This is also characterized as
the point in Hreg with
the smallest possible denominator.
(iii) Let (H,K) be a rational oriented angle in Rn
(with vertex v).
Let LHK be the set
of rational points y∈HK such that
conv(v,qH,y) is regular and den(y)
is as small as possible. Then there exists a (necessarily unique)
point pHK∈LHK
nearest to K.
Proof.
It is easy to see that
Hreg is an infinite set of rational points having v as
an accumulation point.
(i) By way of contradiction,
assume h and k are distinct points of Hreg
with den(h)=den(k). Passing to
homogeneous correspondents in Rn+1
and recalling (3),
it follows that either parallelogram
P(v~,h~) or P(v~,k~),
say
P(v~,h~),
contains a nonzero integer point.
By Lemma 2.2,
{v~,h~} cannot be extended to a basis
of Zn+1, i.e.,
the segment conv(v,h) is not regular—a contradiction.
(iii) Since any two points in LHK have
equal denominators, the (infinite) set
LHK has no accumulation
points. From the proof of Lemma
2.3
it follows that
LHK is contained in
a uniquely determined
rational half-line
M⊆HK parallel to H,
whose origin lies in K.
This ensures the existence and uniqueness of the
point pHK nearest to K.
∎
The following theorem provides a computable complete
invariant for rational oriented angles GL(n,Z)⋉Zn-geometry:
Theorem 4.2** (Rational oriented angles in GL(n,Z)⋉Zn-geometry).**
For any rational oriented angle
(H,K) in Rn with vertex v,
let angle(H,K)
be the following sextuple:
(i)
The triple of integers
(den(v),den(qH), den(pHK)).
(ii)
The (first two) barycentric coordinates of qK
with respect to the oriented
triangle conv(v,qH,pHK).
(iii)
The integer caff(HK),
(which, by Lemma 2.4,
is dispensable when n=3).
Then the map (H,K)↦angle(H,K) is computable.
Given a
rational oriented angle (H′,K′) in Rn,
we have (H,K)≅(H′K′)
iff angle(H,K)=angle(H′,K′).
Thus the orbit problem
(1)
for rational angles
in Rn is decidable.
Proof.
The definition of the rational points
qH,pHK,qK
in Lemma 4.1 ensures their
computability. The
barycentric coordinates of qK
with respect to
conv(v,qH,pHK)
are rational and computable.
The computability of the sextuple angle(H,K)
now follows by
Corollary 3.4.
In order to prove completeness of the invariant,
let us suppose η∈GL(n,Z)⋉Zn maps
H onto H′ and K onto K′,
η:(H,K)≅(H′,K′).
It follows that η maps HK
onto H′K′.
Since
η preserves
regular simplexes and
denominators of rational points,
Lemma 4.1 yields the identities
η(qH)=qH′,
η(qK)=qK′ and
η(pHK)=pH′K′.
The denominators of v,qH,pHK,qK
respectively coincide with
the denominators of v′,qH′,pH′K′,qK′.
Since
η preserves
affine combinations, the points
qK and qK′
have the same barycentric coordinates
with respect to the triangles conv(v,qH,pHK) and
conv(v′,qH′,pH′K′).
Since η maps aff(HK)
onto aff(H′K′),
Theorem 2.5 yields
caff(HK)=caff(H′K′).
Thus
angle(H,K)
= angle(H′,K′).
Conversely, assume
angle(H,K)=angle(H′,K′),
with the intent of proving (H,K)≅(H′,K′).
From the pair (H,K) we compute
the subspace F=aff(HK).
Since conv(v,qH,pHK) is a regular
2-simplex,
combining
Lemma 2.1 and
Theorem 3.3,
we obtain an (n−2)-tuple a=(a1,…,an−2)
of rational points in Rn, all
with
denominator cF, such that
conv(v,qH,pHK,a)
is a regular n-simplex
in Rn. Letting F′=aff(H′K′),
we similarly compute
an (n−2)-tuple a′=(a1′,…,an−2′)
of rational points in Rn, all with
denominator cF′, in such a way that
conv(v,qH′,pH′K′,a′)
is a regular n-simplex in Rn.
Since angle(H,K)=angle(H′,K′),
the denominators of the vertices of
conv(v,qH,pHK,a)
are pairwise equal to the denominators of the vertices of
conv(v,qH′,pH′K′,a′).
Lemma 3.1 now yields
a uniquely determined map θ∈GL(n,Z)⋉Zn
such that
θ(conv(v,qH,pHK,a))=conv(v,qH′,pH′K′,a′).
In more detail, θ(qH)=qH′
and θ(v)=v′, and hence
θ(H)=H′.
(Should we choose others (n−2)-tuples
b,b′
of points with denominator caff(HK)=caff(H′K′), such that
conv(v,qH,pHK,b)
and
conv(v′,qH′,pH′K′,b′)
are regular n-simplexes,
the resulting map
θ′∈GL(n,Z)⋉Zn given by
Lemma 3.1
would still
agree with θ on
aff(HK).)
Since θ preserves affine combinations
and θ(pHK)=pH′K′,
from
angle(H,K)=angle(H′,K′)
it follows that
θ(qK)=qK′.
We have just proved θ:(H,K)≅(H′,K′), as desired to complete
the proof of the theorem.
∎
Remark 4.3**.**
In GL(n,Z)⋉Zn-geometry
vertical angles need not have the same GL(n,Z)⋉Zn-orbit.
For instance, let L be the x-axis in R2,
and M⊆R2 be the line passing through
the points v=(3/5,0) and w=(1,1).
Let L′⊆L be the half-line originating
at v along the positive
direction of L. Let the half-line L′′ be defined
by L′′=cl(L∖L′), where “cl” denotes closure.
Let M′⊆M be the half-line
originating at v and lying in the first quadrant.
Let M′′=cl(M∖M′). A straightforward
computation shows that
angle(L′′,M′′)=angle(L′,M′)=angle(M′′,L′′).
Therefore, the two vertical angles
L′M′ and L′′M′′
do not have the same GL(2,Z)⋉Z2-orbit.
While prima facie our computable complete invariant
angle in
Theorem 4.2
may look less elementary
than its euclidean
counterpart,222if indeed arc length or the circular
functions are more elementary than
our orbit-invariant angle in
GL(n,Z)⋉Zn-geometry.
the following proposition shows that any other
computable complete GL(n,Z)⋉Zn-orbit invariant
of rational oriented angles in Rn
is Turing-equivalent to our invariant angle.
Proposition 4.4** (Universal property of the invariant angle).**
Suppose newangle is a
computable complete invariant
of rational oriented angles in Rn.
Then there is a Turing machine R which, over any
input string α=newangle(H,K) outputs the string
R(α)=angle(H,K).
Conversely there is a Turing machine S which, over any
input string β=angle(M,N), outputs the string
S(β)=newangle(M,N).
Further,
[TABLE]
Proof.
Suppose α=newangle(H,K)
for some rational angle (H,K). Equipping
with some lexicographic order the set of
all strings denoting rational angles in Rn
and letting
[TABLE]
be their enumeration in this order,
after a finite number of steps the first oriented
rational angle (I,J)t satisfying
α=newangle((I,J)t)
will be detected.
This follows from
our assumption about α and the
computability
of newangle.
The computability and completeness of both
angle and newangle
now yield a Turing machine
R
computing, over input α, the transformation
α↦(I,J)t↦angle((I,J)t)=angle(H,K).
(In case α=newangle((I,J)k)
for all rational angles (I,J)k,R will enter an infinite loop.
We are not
assuming that the range of the invariant
newangle is decidable.
So in general we cannot upgrade R to a machine
R+ that terminates after a finite number
of steps over any possible
input.)
Conversely, suppose β=angle(M,N).
The computability of
angle similarly yields an effective procedure to
detect
the first oriented
rational angle (I,J)r in the list
(8) such that
β=angle((I,J)r).
Again, the computability and completeness of
both invariants
newangle and angle yield a Turing machine
S
computing the transformation
β↦(I,J)r↦newangle((I,J)r)=newangle(M,N).
Finally, (7) follows
from the completeness of the invariants
newangle and angle.
∎
With the same proof,
the computable complete
invariant for
segments, triangles and ellipses constructed in the
next two sections
have the same
universal property.
5. Classification of triangles in GL(n,Z)⋉Zn-geometry
The Hirzebruch-Jung algorithm:
notation and terminology
For any pair (a,b) of distinct points in Qn let
us equip the rational
segment A=conv(a,b)⊆Rn
with the orientation from a to b. A is said to be
an oriented rational segment. With
the notation of (2), let
C=pos[a~,b~]⊆Rn+1
be the positive hull of the homogeneous correspondents
of a and b.
Let further
N be the set of nonzero integer points in
C, and H=conv(N), with its relative
boundary ∂H.
Following
[20, p.24-25] or [8, 2.6]
we write
[TABLE]
for the set of integer points lying
on the compact edges of ∂H,
listed in the order ⊑ from
a~ to b~. Thus
ei⊑ej iff the angle e00ei
is contained in the
angle e00ej.
The complex of cones (i.e., the fan) in
Rn+1 whose primitive
generating vectors are the
integer vectors ei is said to be obtained via
the Hirzebruch-Jung (continued fraction,
desingularization) algorithm on the cone C, [8, p.46].
Let the points xi∈Qn be defined by
[TABLE]
We will use the notation
[TABLE]
listed in the order inherited from
⊑.
Proposition 5.1**.**
The Hirzebruch-Jung algorithm of
the oriented rational segment
A=conv(a,b)⊆Rn
outputs a list
of rational points a=x0,x1,…,xu,xu+1=b
having the following properties, for each i=0,…,u:
(i)
The segment conv(xi,xi+1) is regular.
(ii)
xi+1* is the
(necessarily unique) rational
point z∈A with the smallest possible denominator
such that the segment
conv(xi,z) is regular.
Equivalently,
xi+1 is the
farthest point z from xi in A such that
conv(xi,z) is regular.*
(iii)
The vertices of HJ(A) are a subset of the vertices
of every regular triangulation
of A. Thus the list
x0,x1,…,xu,xu+1 is uniquely determined
by (a,b).
(iv)
The map
A↦HJ(A) is computable.
Proof.
This is the affine counterpart of
[8, 2.6] or [20, Proposition 1.19].
The computability of the
map
A↦HJ(A)
is evident by definition of
the Hirzebruch-Jung algorithm.
∎
The Hirzebruch-Jung regular triangulation of
the segment conv(−1/2,5/8) is shown in
Figure 1.
Blow-up and blow-down
Suppose Δ and ∇
are two simplicial complexes in Rn with the same
support.
We say that ∇ is
a subdivision of Δ
if every simplex of ∇ is
contained in some simplex of Δ.
Let Δ be a simplicial
complex and c∈∣Δ∣.
The blow-up Δ(c) of Δ at
c is the simplicial complex in Rn
obtained
by the following procedure
([27, p. 376], [7, III, 2.1]):
Replace every simplex S∈Δ such that c∈S by the set
of all simplexes of the form conv(c,F), where
F is any face of S such that c∈/F.
Note that Δ(c) is a subdivision of Δ
with the same support
of Δ.
The inverse of a blow-up is called a blow-down.
For any m≥1 and regular m-simplex
T=conv(v0,…,vm)⊆Rn, the
Farey mediant of T is the affine
correspondent
of the vector v~0+⋯+v~m∈Zn+1, where each
v~i is the homogeneous correspondent
of vi.
In the particular case when Δ
is a regular triangulation and
c is the Farey mediant of
a simplex of Δ, the blow-up
Δ(c) is regular.
The GL(n,Z)⋉Zn-invariant measure λ1
The second main tool for the
classification of rational segments in GL(n,Z)⋉Zn-geometry
is the one-dimensional fragment λ1
of the rational measure λd
introduced in [17, Theorem 2.1].
For any oriented rational segments
conv(a,b) and conv(a′,b′)
in Rn
we write conv(a,b)≅conv(a′,b′) if there is
γ∈GL(n,Z)⋉Zn such that γ(a)=a′ and
γ(b)=b′, in symbols,
[TABLE]
Theorem 5.2**.**
For any rational oriented
segment conv(a,b)⊆Rn let
[TABLE]
where a=x0,x1,…,xu,xu+1=b are the consecutive vertices of
the Hirzebruch-Jung desingularization
HJ(conv(a,b)).
We then have:
(Computability)* The map (a,b)↦λ1(conv(a,b))
is computable.*
(iii)
(Independence)*
Let λ1(conv(a,b),∇) denote the result of the
computation of
λ1(conv(a,b)) in
(10) by means of a regular triangulation
∇ of conv(a,b), in place of
HJ(conv(a,b)). Then
λ1(conv(a,b)) = λ1(conv(a,b),∇).*
(iv)
(Monotonicity)* For every rational point
c∈Rn with
conv(a,b)⫋conv(a,c)
we have
λ1(conv(a,b))<λ1(conv(a,c)).*
Proof.
(i)-(ii) These are immediate consequences of
Proposition 5.1(i)-(ii),
because every map γ∈GL(n,Z)⋉Zn
preserves denominators and regularity.
(iii)
Let Δ=HJ(conv(a,b)).
Let Δ(e)
be obtained
by blowing-up Δ
at the Farey mediant
e of some
1-simplex S=conv(xi,xi+1)∈Δ.
From the regularity of S we get
den(e)=den(xi)+den(xi+1).
Then a routine verification shows
that λ1(conv(a,b),Δ)=λ1(conv(a,b),Δ(e)).
The affine version of the
Morelli-Włodarczyk
theorem on decomposition of
birational toric maps (solution of the weak Oda conjecture,
[15], [27, 13.3]),
yields a sequence
[TABLE]
of regular triangulations of conv(a,b) such that
for each t=0,…,r−1,
Δt+1 is obtained from
Δt by a blow-up
at the Farey mediant of
some simplex of Δt,
or vice versa, with the roles of t
and t+1 interchanged. (Actually, in the
present one-dimensional case we may insist that
all blow-ups precede all blow-downs.) As in the case
t=0, also for each t=1,2,…,r−1, we have the identity
λ1(conv(a,b),Δt)=λ1(conv(a,b),Δt+1).
(iv) Let Δ′
and Δ′′ be the Hirzebruch-Jung
desingularizations of
conv(a,b) and (conv(b,c) respectively.
Then Δ′∪Δ′′ determines a regular
complex with support conv(a,c). By
(10) and (iii),
[TABLE]
The proof is complete.
∎
Theorem 5.3** (Rational oriented segments in GL(n,Z)⋉Zn-geometry).**
Let
A=conv(a,b)
be a rational oriented segment in Rn.
Let x1=a be the point nearest to a in the
Hirzebruch-Jung triangulation of A.
Then the quadruple
[TABLE]
is a
computable complete
GL(n,Z)⋉Zn-orbit invariant for A.
If n=2, the integer
caff(A) is redundant.
Proof.
For any rational oriented segment S in Rn
let us write
[TABLE]
where
den(HJ(S))=(den(s0),den(s1),…,den(sq),den(sq+1))
is the sequence
of the denominators of the vertices of
the Hirzebruch-Jung triangulation HJ(S),
listed in the ⊑-order.
By Corollary 3.4,
the integer
caff(S) is computable.
By Proposition 5.1(iv), the map
S↦hj(S)
is computable.
Claim 1.
For any oriented rational segment
A′=conv(a′,b′)
in Rn we have conv(a,b)≅conv(a′,b′) iff
hj(A)=hj(A′).
(⇒)
Suppose η:A≅A′
for some η∈GL(n,Z)⋉Zn.
By Theorem 2.5,
cA=cA′.
By Proposition 5.1(i)-(ii),
the two sequences of denominators in HJ(A) and
HJ(A′) coincide,
because η preserves denominators
and regularity.
So hj(A)=hj(A′).
(⇐)
Conversely, suppose
hj(A)=hj(A′).
Let
a=x0,x1,…,xu,xu+1=b be the vertices of HJ(A),
and
a′=x0′,x1′,…,xu′,xu+1′=b′ be the vertices of HJ(A′).
By hypothesis, den(xi)=den(xi′)
for each i=0,…,u+1. Further,
caff(A)=caff(A′).
Since conv(x0,x1) is regular, combining
Lemma 2.1 with
Theorem 3.3,
we have rational points
w2,…,wn, all with the same
denominator caff(A), such that
conv(x0,x1,w2,…,wn)
is a regular n-simplex in Rn.
Symmetrically,
Lemma 2.1 and
Theorem 3.3
yield a regular
n-simplex conv(x0′,x1′,w2′,…,wn′) in Rn,
where den(w2′)=⋯=den(wn′)=caff(A′).
It follows that the denominators of the vertices of
conv(x0′,x1′,w2′,…,wn′) and
of conv(x0,x1,w2,…,wn)
are pairwise equal.
(Note that daff(A)=daff(A′) follows from our standing
hypothesis hj(A)=hj(A′).)
Iterating this construction
for each t=0,…,u, we obtain
regular n-simplexes
conv(xt′,xt+1′,w2′,…,wn′)
and conv(xt,xt+1,w2,…,wn)
such that the denominators of their vertices
are pairwise equal. Thus
Lemma 3.1
yields γt∈GL(n,Z)⋉Zn
satisfying
γ:conv(xt,xt+1,w2,…,wn)≅conv(xt′,xt+1′,w2′,…,wn′). The map
t↦γt is computable.
We also have
[TABLE]
Indeed, let us compare
γ0 and γ1. On the one hand,
γ0 maps
conv(x0,x1) onto conv(x0′,x1′), and
γ1 maps
conv(x1,x2) onto conv(x1′,x2′).
On the other hand,
conv(x1,x2) is mapped onto
conv(x1′,γ0(x2)) by
γ0, and is mapped onto conv(x1′,x2′)
by γ1.
Both segments conv(x1′,γ0(x2)) and
conv(x1′,x2′)
are regular. Further, den(x2′)=den(γ1(x2))=den(γ0(x2)),
because γ0 and γ1 preserve denominators
and regularity.
By Lemma 4.1(i) and Proposition
5.1(i)-(ii),
γ1(x2)=x2′=γ0(x2).
Thus
γ0 and γ1 agree over
the segment conv(x1,x2),
whence they agree over all of Rn, because both
γ0 and γ1
send w2,…,wn to w2′,…,wn′.
Inductively, γj−1 agrees with γj
over the segment conv(xj,xj+1) whence
γj=γj−1.
Thus every γj agrees with γ0,
as required to settle (11) and
Claim 1.
Claim 2.
Let A=conv(a,b) and A′=conv(a′,b′)
be oriented rational segments
in Rn. Then conv(a,b)≅conv(a′,b′) iff
side(A)=side(A′).
Let
(x0=a,x1,…,xl,xl+1=b)\mboxand(x0′=a′,x1′,…,xm′,xm+1′=b′)
be the lists of vertices of the Hirzebruch-Jung
desingularizations of A and A′.
Suppose η∈GL(n,Z)⋉Zn maps A onto A′.
Then caff(A)=caff(A′).
By Claim 1(⇒),
hj(A)=hj(A′).
Then (10) yields
λ1(A)=λ1(A′). By Proposition
5.1(i),
both segments
conv(x0,x1) and conv(x0′,x1′) are regular.
By Proposition
5.1(ii), η(x1)=x1′.
It follows that
side(A)=side(A′).
Conversely, assume
side(A)=side(A′).
We will prove
[TABLE]
By way of contradiction, assume l<m.
Since by hypothesis side(A)=side(A′), then
hj(conv(a,x1))=hj(conv(a′,x1′)).
The basis in the inductive construction in
Claim 1(⇐) now yields a map
γ∈GL(n,Z)⋉Zn of conv(a,x1)
onto conv(a′,x1′).
By Proposition
5.1(i)-(ii), γ(x2)=x2′.
Inductively, γ(xi)=xi′
for each i=1,…,l+1. Thus γ(A) is a proper subset
of A′.
By Theorem
5.2 (iv),
[TABLE]
On the other hand, since side(A)=side(A′),
from Theorem
5.2 (i) we get
[TABLE]
a contradiction that settles (12).
In case l>m, arguing by contradiction
one similarly proves (12).
Thus γ:A≅A′.
The proof of Claim 2 is complete.
By Theorem 5.2(ii),
the rational λ1(A) is computable.
Therefore, the map A↦side(A) is computable.
The redundancy of caff(A)
for all n=2, follows from
Lemma 2.4.
∎
Let conv(u,v,w) be a rational 2-simplex
in Rn, with the orientation
u→v→w. We say that
conv(u,v,w) is an oriented rational triangle.
For any oriented rational triangle conv(u′,v′,w′)
in Rn
we write conv(u,v,w)≅conv(u′,v′,w′) if
there is
γ∈GL(n,Z)⋉Zn with γ(u)=u′,
γ(v)=v′ and γ(w)=w′,
in symbols,
[TABLE]
The rational segments conv(v,u) and conv(v,w)
determine two rational half-lines
Hvu⊆aff(conv(v,u))
and Kvw⊆aff(conv(v,w)) with
their common vertex v.
We then have the (nontrivial ) angle
(Hvu,Kvw)⊆Rn.
The following theorem is a
counterpart for GL(n,Z)⋉Zn-geometry
of the
side-angle-side criterion for congruent triangles
in euclidean geometry:
Theorem 5.4** (Rational oriented triangles in GL(n,Z)⋉Zn-geometry).**
A computable complete invariant
of any rational oriented triangle
T=conv(u,v,w)⊆Rn in
GL(n,Z)⋉Zn-geometry
is given by
[TABLE]
Proof.
Let T′=conv(u′,v′,w′) be another rational
oriented triangle in Rn.
If γ:T≅T′ for some γ∈GL(n,Z)⋉Zn,
then by Theorems
4.2 and 5.3,
tri(T)=tri(T′).
Conversely, suppose
tri(T)=tri(T′).
Let us write for short H=Hvu,K=Kvw,H′=Hv′u′,K′=Kv′w′.
Mimicking the proof of Theorem
4.2,
we preliminarily compute the integer caff(T), as well as
the points qH∈H, qK∈K
and pHK∈aff(T), and the
regular triangle
R=conv(qH,v,pHK).
Combining Lemma
2.1 and
Theorem 3.3,
we extend R
to a regular n-simplex R∗=conv(qH,v,pHK,z3,…,zn)
such that den(z3)=⋯=den(zn)=caff(T).
We similarly extend
the regular triangle R′=conv(qH′,v′,pH′K′)
to a regular n-simplex R∗′=conv(qH′,v′,pH′K′,z3′,…,zn′)
such that den(z3′)=⋯=den(zn′)=caff(T′).
Since angle(H,K)=angle(H′,K′), then
caff(T)=caff(T′), and both
R∗ and R∗′ are effectively computable.
Since by hypothesis, tri(T)=tri(T′),
the denominators of the vertices of
R∗ and R∗′ are pairwise equal.
Lemma 3.1 yields a uniquely
determined map γ∈GL(n,Z)⋉Zn of
R∗ onto R∗′.
It follows that
γ:R≅R′,\mboxandhenceγ:H≅H′.
Using Proposition 5.1(iv) we compute the
two (l+2)-tuples
[TABLE]
listing the vertices of the Hirzebruch-Jung
desingularizations HJ(conv(v,u))
and HJ(conv(v′,u′)).
From the hypothesis
side(conv(v,u))=side(conv(v′,u′))
it follows that hj(conv(v,u))=hj(Aconv(v′,u′)).
Therefore, l=m and for each i=0,…,l+1,
γ sends the
ith vertex of HJ(conv(v,u))
to the ith vertex of HJ(conv(v′,u′)).
Thus γ:conv(v,u)≅conv(v′,u′).
The assumption angle(H,K) =
angle(H′,K′) entails
γ:K≅K′,
whence
γ:HK≅H′K′.
From
side(conv(v,w))=side(conv(v′,w′))
it follows that
γ:conv(v,w)≅conv(v′,w′).
Summing up,
γ:T≅T′.
The computability of the map T↦tri(T) follows from
Theorems 4.2 and
5.3.
∎
6. Classification of ellipses in
GL(2,Z)⋉Z2-geometry
For notational simplicity, all ellipses in this paper are assumed
to lie in R2.
Our construction
of a computable complete
invariant for
ellipses in GL(2,Z)⋉Z2-geometry primarily rests on the
following properties of conjugate diameters, recorded
by
Apollonius of Perga [1]
and Pappus of Alexandria [21]:
Proposition 6.1**.**
Every ellipse E⊆R2 is the image of a circle
under a contraction with respect to some line.
E has a unique center of symmetry.
Calling a diameter of E any chord passing through the center,
it follows that the center of E bisects any diameter.
Let C be a diameter of E. There is a uniquely determined
diameter C∗ having the property that the middle
points of all chords of E parallel to C lie in C∗.
The latter is known as the conjugate diameter of C.
We have C∗∗=C.
Let T be the tangent of E at a point x∈E.
Let X be the diameter of E containing x.
Then the conjugate diameter
X∗ is parallel to T.
Proof.
All these properties
follow from the fact that every
affine transformation can be represented as a composition of a similarity
transformation and a contraction with respect to some line.
∎
Lemma 6.2**.**
Let ϕ(x,y)=ax2+bxy+cy2+dx+ey+f
be a polynomial with rational coefficients.
Then it is decidable whether the solution set
(the zeroset)
[TABLE]
is an ellipse E containing a rational point.
Further,
whenever any such point exists in Z(ϕ),
the set of rational points in E is dense in E,
and can be recursively enumerated in the
lexicographic
order of increasing denominators.
Proof.
As explained, e.g., in [23, §5.2],
E contains a rational point iff
the Legendre
equation
px2+qy2+rz2=0
has an integer solution with gcd(x,y,z)=1,
for suitable integers p,q,r which are effectively
computable from the coefficients a,…,f.
Perusal of [12, 17.3] shows
that this latter problem
is decidable, and whenever a solution exists it can be
effectively computed. The rest is clear.
(See [6]
and [25] for efficient
computations of rational points on rational conics.)
∎
By a rational ellipse we mean an ellipse
E⊆R2
that coincides with the zeroset Z(ϕ)
of a quadratic polynomial ϕ(x,y) with rational
coefficients, and contains a rational point (equivalently, E
contains a dense set of rational points).
We denote by E the set of rational
ellipses.
For any E∈E, its
center is
a rational point. A diameter
C of E is rational (meaning that
its vertices are rational)
iff so is its conjugate.
Given a rational diameter C in E, its conjugate
is effectively computable.
Two semi-diameters A,B of E are said to be conjugate
iff they lie in conjugate diameters of E.
For any map γ∈GL(2,Z)⋉Z2, the
image E′=γ(E) of any
E∈E is a member of E.
Further,
γ is a denominator preserving
one-one
map of all rational points
of E onto all rational points of
E′.
The proof of the following result now routinely follows from
Proposition 6.1:
Lemma 6.3**.**
(i) For any pair of distinct segments C,D with
a common vertex and aff(C)=aff(D), there is a unique ellipse
E such that (C,D) is a pair of conjugate
semi-diameters of E.333Pappus [21, Book VIII, §XVII,
Proposition 14] constructs
the axes of an ellipse from any given pair of conjugate
semi-diameters.
Further, if
the segments C and D are rational
then E is a rational ellipse,
which can be effectively obtained from
(C,D).
(ii)
Two ellipses E,E′∈E
have the same GL(2,Z)⋉Z2-orbit
iff there are conjugate rational semi-diameters
A,B of E and A′,B′ of E′ such that
the triangles T=conv(A∪B) and T′=conv(A′∪B′)
have the same GL(2,Z)⋉Z2-orbit. Moreover, if δ∈GL(2,Z)⋉Z2
maps T onto T′, then δ maps E onto E′.
Let O be the center of E∈E.
Let (A,B) be a pair of
conjugate rational semi-diameters of
E, say A=conv(O,x) and B=conv(O,y).
Then the
sum of the denominators
of x and y
is said to be the index of (A,B).
Theorem 6.4** (Rational ellipses in GL(2,Z)⋉Z2-geometry).**
For any E∈E
let {D1,…,Dq} be the
set of all pairs
Di=(Ai,Bi) of conjugate
semi-diameters of E having the smallest index.
For each i=1,…,q let
the triangle Ti=conv(Ai∪Bi) be oriented
so that O is the first vertex, followed by
the vertex of Ai, followed by the
vertex of Bi.
With
tri(Ti) the invariant defined in
Theorem 5.4, let
[TABLE]
We then have:
(i)
ell* is a
complete GL(2,Z)⋉Z2-orbit invariant
of ellipses in E.*
(ii)
For any rational
quadratic polynomial ϕ(x,y)
whose zeroset Z(ϕ) is an
element of E,
(a decidable condition, by Lemma 6.2),
the map ϕ↦ell(Z(ϕ)) is computable.
(iii)
Thus there is a decision procedure
for the problem whether
two rational ellipses E,E′∈E
have the same GL(2,Z)⋉Z2-orbit.
When this is the case, a map
γ∈GL(2,Z)⋉Z2
of E onto E′ can be effectively computed.
Proof.
(i) For any E,E′∈E we must show:
[TABLE]
(⇐) Suppose ell(E)=ell(E′).
By assumption,
E has a pair (A,B) of rational conjugate
semi-diameters
of smallest index d, and
E′ has a pair (A′,B′)
of rational conjugate
semi-diameters of the same smallest index d, such that
the two triangles conv(A∪B) and conv(A′∪B′)
have the same invariants.
By Theorem 5.4,
the two triangles conv(A∪B)
and conv(A′∪B′)
have the same GL(2,Z)⋉Z2-orbit.
By Lemma 6.3,
E and E′ have the same GL(2,Z)⋉Z2-orbit.
(⇒)
Let γ∈GL(2,Z)⋉Z2 map E onto E′.
Let O be the center of E, and O′ the center of E′.
Since γ preserves
ratios of collinear segment lengths, as well as
parallel and tangent lines,
then by Lemma 6.3,
O′=γ(O). Further,
γ sends any pair (A,B) of conjugate semi-diameters
of E to a pair (A′,B′) of conjugate semi-diameters
of E′=γ(E).
The preservation properties of the affine transformation
γ ensure that the image γ(E) coincides
with the ellipse constructed from (A′,B′)
according to Lemma 6.3.
Pick a triangle T of E arising from a pair of semi-diameters
of smallest index d.
Since γ preserves
all numerical invariants in
Theorems 4.2
and 5.3, then
the two sides of
γ(T) having O′ as a common vertex
will be conjugate semi-diameters of E′ of smallest
index =d. Further,
tri(T)=tri(γ(T)).
It follows that
γ induces a bijection β between
pairs (Aj,Bj),j=1,…,q,
of conjugate semi-diameters of E of smallest index,
and pairs (β(Aj),β(Bj))
of conjugate semi-diameters of E′ of smallest
index, and we may write
γ:conv(Aj∪Bj)≅conv(β(Aj)∪β(Bj)).
By Theorem 5.4,
tri(Tj)=tri(γ(Tj))
for each j=1,…,q.
By definition, ell(E)=ell(E′),
which completes the proof of (i).
(ii) To prove the computability of the map
ϕ↦ell(Z(ϕ))
we preliminarily check that the zeroset
Z(ϕ) is a member of E.
By Lemma 6.2,
this condition can be decided
by a Turing machine over the input given by the coefficients
of ϕ.
If the condition is satisfied,
letting E=Z(ϕ) we proceed as follows:
We compute the (automatically rational) center O of E,
and let S be a closed square
with rational vertices in R2, centered at O and containing
E;
For each j=1,2,… we let Xj be the set of rational points of
E of denominator ≤j. Xj is effectively
computable, because there are only finitely many rational
points x∈S of denominator ≤j, and it is decidable
whether any such point x lies in E;
For any pair (x,y) of points in Xj we check whether
(conv(O,x),conv(O,y)) is a pair of conjugate semi-diameters
of E. As already noted, this can be done in an effective way;
Let d be the smallest integer such that Xd
contains two points x,y having the property that
(conv(O,x),conv(O,y)) is a pair
of rational conjugate semi-diameters of E of index d.
Since E does have rational conjugate
semi-diameters, after a finite number of steps
such d will be found;
Let {D1,…,Dq} be the (necessarily finite) set of all
pairs of conjugate semi-diameters of E of index d.
For any Di=(Ai,Bi), letting Ti=conv(Ai∪Bi),
we compute
tri(Ti) as in Theorem
5.4.
We finally write ell(E)={tri(T1),…,tri(Tq)}.
Since all these steps are effective,
the map ϕ↦ell(Z(ϕ))
is computable.
(iii) This immediately follows from the proof of (i) and (ii).
The proof of (ii)
also shows that there is
a Turing machine having the following
property: whenever E and E′
have the same GL(2,Z)⋉Z2-orbit,
a map
γ∈GL(2,Z)⋉Z2
of E onto E′
is effectively obtainable from the input data
ϕ and ϕ′.
∎
The computable complete invariant ell of the
foregoing theorem is here to stay,
because of the following Turing equivalence
result, whose proof is similar to the proof of
Proposition 4.4:
Proposition 6.5** (Universal property of ell).**
Suppose newell is a
computable complete invariant
of ellipses in E in GL(2,Z)⋉Z2-geometry.
Then there is a Turing machine R which, over any
input string α coinciding with newell(E) for some
E∈E, outputs the string
R(α)=ell(E).
Conversely, there is a Turing machine S which, over any
input string β=ell(F) for some F∈E,
outputs the string
S(β)=newell(F).
The two maps α↦R(α)
and β↦S(β) are inverses of each other.
7. Polyhedra in GL(n,Z)⋉Zn geometry
Following [26, 1.1], by a
polyhedron (“compact polyhedron”, in [22, 2.2])
we mean the union P=⋃iSi of finitely many
simplexes Si in Rn.
P need not be convex or connected.
The Si need not have
the same dimension.
If the vertices of each Si have rational coordinates,
P is said to be a rational polyhedron.
Rational polyhedra play a key role in
the recognition problem of combinatorial
manifolds presented
as rational polyhedra X,Y.
As a matter of fact, (see, e.g., [10, p.55]),
X is homeomorphic to Y iff
there is a
rational PL-homeomorphismη
of X onto Y, i.e.,
a finitely piecewise affine linear (PL) one-one
continuous map
ϕ of X onto Y such that every affine linear piece of
ϕ has rational coefficients.
It follows that the set S of
pairs of rationally PL-homeomorphic
polyhedra is recursively
enumerable. And yet, the complementary set is not:
The problem whether two rational polyhedra
X and Y are rationally PL-homeomorphic is
undecidable.
While stated in terms of rational polyhedra, this
theorem had enough impact to
put an end to the (Klein) program of attaching
to any combinatorial manifold X
an invariant characterizing X up to homeomorphism.
It is an interesting open problem whether Markov unrecognizability
theorem
still holds when
rational PL-homeomorphisms
are replaced by integer PL-homeomorphisms.
Given rational polyhedra P,P′⊆Rn let
us agree so write P≅P′ if some γ∈GL(n,Z)⋉Zn
maps P onto P′, in symbols, γ:P≅P′.
Theorem 7.2** (Recognizing rational polyhedra in GL(n,Z)⋉Zn-geometry).**
The following problem is decidable:
INSTANCE:*
Rational polyhedra P=⋃i=1lSi
and P′=⋃j=1mTj,
where each Si and Tj is a rational simplex
in Rn,
presented by the list of its vertices.*
QUESTION:*
Does there exist δ∈GL(n,Z)⋉Zn such that δ(P)=P′?*
Moreover, whenever such δ exists it can be
effectively computed.
Proof.
From the two lists of simplexes Si,Tj we
construct rational triangulations
∇ of P and ∇′ of
P′ following [26, Chapter II].
(Also see [11, §§17 and 25].)
From the vertices of
∇ and ∇′, the algorithmic procedure of
[11, §§7 and 22]
yields the (vertices of the) convex hulls
C=conv(P)\mboxandC′=conv(P′)⊆Rn.
Let
[TABLE]
If P≅P′ then C≅C′ and F≅F′. Using the decision procedure of Corollary
3.4
we check whether
the affine subspaces F and F′
have the same GL(n,Z)⋉Zn-orbit.
If this condition fails, our problem has a negative
answer. Otherwise, we introduce the notation
Since the rational polyhedron C is e-dimensional and convex,
we fix, once and for all,
rational points r0,…,re∈C and
additional points re+1,…,rn∈Qn
such that conv(r0,…,rn) is an
n-simplex in Rn.
Using, if necessary, the desingularization procedure
described in
[7, VI, 8.5] or [8, p.48],
we may safely
assume that conv(r0,…,rn) is regular.
Let us use the abbreviations
[TABLE]
For each i=0,…,n let us set
[TABLE]
Observe that G∗=γ(R∗) is a regular n-simplex,
G=γ(R) is a regular e-simplex, and aff(G)
coincides with F′ by (13).
Claim. The following conditions are equivalent:
(I)
There exists a map δ∈GL(n,Z)⋉Zn
of P onto P′.
(II)
There are rational points
s0,…,se∈C′ with the following properties:
(i) den(si)=den(ri) for each i=0,…,e.
(ii) conv(s0,…,se) is a regular e-simplex;
(Thus by
Lemma 2.1
the n-simplex
conv(s0,…,se,ge+1,…,gn) is regular,
because
G∗ is regular and
aff({s0,…,se})=aff(C′)=aff(G)=F′).
(iii) Letting W⊆(Qn)n+1
be defined by
[TABLE]
the map ϕ=ϕVW of
R∗ onto conv(W)
given by Lemma 3.1 sends P onto P′.
(Lemma 3.1
can be applied because both simplexes
R∗
and
conv(W)
are regular and the denominators of their
vertices are pairwise equal.)
For the nontrivial direction,
suppose some δ∈GL(n,Z)⋉Zn maps P onto P′.
Then
δ:C≅C′ and δ:F≅F′.
For each i=0,…,n let us define the rational point si∈C′ by
[TABLE]
with the intent of proving that s0,…,se
satisfy conditions (i)-(iii).
Condition (i) is immediately satisfied,
because δ preserves denominators.
Next, let us set
S=conv(s0…,se)=δ(R)\mboxandS∗=conv(s0…,sn)=δ(R∗).
Since S∗ is regular then so is S,
and condition (ii) is satisfied. There remains
to be proved that s0,…,se satisfy condition (iii).
To this purpose let us first note that
both γ and δ map F onto F′, and hence
aff(S)=aff(G)=F′.
Further, from
γ:R∗≅G∗\mboxandδ:R∗≅S∗
we get
S∗≅G∗.
By restriction, we obtain regular e-simplexes
R≅G≅S
having the same GL(n,Z)⋉Zn-orbit.
Let
S←=conv(s0,…,se,ge+1,…,gn).
Since
the vertices ge+1,…,gn are common to both
G∗ and S←, by (16) we have
[TABLE]
Since G∗ is a regular n-simplex,
by Lemma 2.1
so is S←.
Therefore, by
Lemma 3.1,
there is a uniquely determined
β∈GL(n,Z)⋉Zn such that
β:G∗≅S←.
The two
n-simplexes S←
and S∗ are regular and their vertices have pairwise equal
denominators, because their first e+1 vertices
s0,…,se coincide, and by (17),
[TABLE]
Another application of Lemma 3.1
yields a uniquely determined
α∈GL(n,Z)⋉Zn such that
α:S←≅S∗.
It follows that
δ=α∘β∘γ,
where “∘” denotes composition.
Let ϕ=β∘γ.
Then ϕ∈GL(n,Z)⋉Zn maps R∗ onto S←.
Specifically, recalling (14)-(15),
ϕ coincides with
the map ϕVW of
Lemma 3.1.
By construction, ϕ
agrees with δ over R (whence ϕ agrees with
δ over F⊇C⊇P).
Since δ maps P onto P′,
then so does ϕ. Thus the points
s0,…,se satisfy condition (iii). Our claim is settled.
Let now Ω be the set of all (e+1)-tuples
s=(s0,…,se) of rational
points in C′ such that
den(si)=den(ri) for all i=0,…,e, and the set
Ts=conv(s0,…,se) is a regular
e-simplex—a condition that
can be effectively checked.
Ω is a finite set,
because
C′ is bounded and there are only finitely many
rational points in C′ with denominators
≤max(den(r0),…,den(re)).
It is easy to see that
Ω is the set of all (e+1)-tuples
of rational points in C′ satisfying conditions (i)-(ii) in our claim.
Letting the n-simplex Ts← be defined by
Ts←=conv(s0,…,se,ge+1,…,gn), the
regularity of Ts← follows
from the regularity of Ts and of G∗,
by Lemma 2.1.
From the (n+1)-tuple of rational points
V defined in (14) and the (n+1)-tuple
U(s)=(s0,…,se,ge+1,…,gn),
Lemma 3.1
yields a uniquely determined
map ϕVU(s)∈GL(n,Z)⋉Zn of R∗ onto Ts←.
By our claim,
P≅P′ iff
for at least one
(e+1)-tuple sˉ=(sˉ0,…,sˉe)∈Ω,
ϕVU(sˉ) maps
P onto P′, i.e., sˉ also satisfies
condition (iii). This final condition is decidable, by
resorting to the triangulations
∇ and ∇′ constructed at the outset of the proof:
indeed, we must only check whether for each
simplex in ∇
its ϕVU(sˉ)-image
is contained in the union of simplexes of
∇′, and vice-versa, check whether
for each
simplex in ∇′
its ϕVU(sˉ)−1-image
is contained in the union of simplexes of
∇.
We have just shown the decidability of the problem
whether there is a map δ∈GL(n,Z)⋉Zn
of P onto P′. Our constructive proof also shows that
whenever any such δ
exists,
it can be
effectively computed.
∎
Figure 2 illustrates the
crux of the proof for
n=3 and e=2.
Concluding Remarks
Suppose P and Q are
finite unions of n-dimensional rational simplexes
in Rn
(for short, P and Q are rational “n-polyhedra”).
Suppose there are rational triangulations Δ of
P and ∇ of
Q such that every simplex T of Δ can be mapped
one-one onto a simplex of ∇ by some
ηT∈GL(n,Q)⋉Qn, in such a way that the set
η=⋃{ηT∣T∈Δ} is a continuous one-one
map. We then say that
η is a “continuous GL(n,Q)⋉Qn-equidissection”,
[11, 31.3].
Markov unrecognizability
theorem
is to the effect that the continuous
GL(n,Q)⋉Qn-equidissectability of P and Q is not decidable.
It is an interesting open problem whether Markov’s theorem
still holds when
continuous GL(n,Q)⋉Qn-equidissections are
replaced by
continuous GL(n,Z)⋉Zn-equidissections.
The subproblem of
deciding whether P
and Q
have the same GL(n,Z)⋉Zn-orbit has been shown to
be decidable in Theorem 7.2.
Differently from the case of angles, segments,
triangles and ellipses, our positive solution of Problem
(1) for
rational polyhedra does not rest on the
assignment of a computable complete
invariant to every
rational polyhedron P⊆Rn.
And yet,
P is equipped with a wealth of
computable invariants for
continuous GL(n,Z)⋉Zn-equidissections—well beyond
the classical homeomorphism invariants given by dimension,
number of connected components, or Euler characteristic.
These invariants include:
The number of
rational points in P of a given denominator d=1,2,…;
The number of regular triangulations Δ of P
such that the denominators of all vertices of Δ are ≤d;
The smallest possible number of
k-simplexes in a regular triangulation Δ
of P such that
the denominators of all vertices of Δ are ≤d.
All these new invariants are (a fortiori),
GL(n,Z)⋉Zn-orbit invariants—and none makes sense in euclidean
geometry, or even in GL(n,Q)⋉Qn-geometry.
Closing a circle of ideas,
one may then naturally
ask the following question:
Problem (n=2,3,…)
Can the GL(n,Z)⋉Zn-orbit problem for
rational n-polyhedra
be decided by
computable complete invariants?
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Apollonius of Perga, Treatise on Conic Sections, T.L. Heath (ed.), Cambridge University Press, 1896.
2[2] A. Auel, Remarks on the Milnor conjecture over schemes, Galois-Teichmüller theory and arithmetic geometry, Advanced Studies in Pure Mathematics, 63, Math. Soc. Japan, Tokyo, (2012) pp. 1–30.
3[3] A. Barvinok, A course in convexity, Graduate studies in mathematics, vol.54, American Mathematical Society, Providence, Rhode Island, 2002.
4[4] L. M. Cabrer, D.Mundici, Classifying orbits of the affine group over the integers, Ergodic Theory and Dynamical systems, 37 (2017) 440–453.
5[5] A.V.Chernavsky, V.P.Leksine, Unrecognizability of manifolds, Annals of Pure and Applied Logic, 141 (2006) 325–335.
6[6] J. E. Cremona, D. Rusin, Efficient solution of rational conics, Mathematics of Computation, 72 (243) (2002) 1417–1441.
7[7] G. Ewald, Combinatorial convexity and algebraic geometry, Springer, New York, 1996.
8[8] W. Fulton, Introduction to Toric Varieties, Annals of Mathematics Studies, vol. 131, Princeton University Press, 1993.