Professional Documents
Culture Documents
Configurations of Cycles and The Apollonius Problem
Configurations of Cycles and The Apollonius Problem
JOURNAL OF MATHEMATICS
Volume 31, Number 2, Summer 2001
CONFIGURATIONS OF CYCLES
AND THE APOLLONIUS PROBLEM
c
Copyright 2001 Rocky Mountain Mathematics Consortium
725
726 B.J. ZLOBEC AND N.M. KOSTA
(n + 1, 2) on Rn+3 given by
(X1 | X2 ) = v1 ω2 + p1 · p2 + v2 ω1 − ρ1 ρ2
(1)
= X1 · AX2 ,
x1 , . . . , xk = {z ∈ Pn+2 | Z = λ1 X1 + · · · + λk Xk }
For any x
= r, let x0 denote the orthogonal projection of x onto the
subspace r⊥ . So if X = (v, p, ω, ρ), then X 0 = (v, p, ω, 0). If x ∈ Ω,
then (X 0 | X 0 ) = ρ2 .
Here are some geometric facts which follow from this expression. If
P (x1 , x2 ) ≥ 0, this is the tangential distance between the oriented
spheres Cx1 and Cx2 . Specifically, if P (x1 , x2 ) = 0 the geometric
cycles Cx1 and Cx2 are coherently tangent. If x1 is a point cycle, then
P (x1 , x2 ) < 0 if the point Cx1 is in the interior of Cx2 (i.e., in the
bounded component of Rn − Cx2 ), P (x1 , x2 ) > 0 if Cx1 is in the exterior
of Cx2 , and P (x1 , x2 ) = 0 if Cx1 lies on Cx2 .
Definition 2.2. Let x1 and x2 be proper cycles which are not point
cycles, and let
(X1 | X2 )
(4) A(x1 , x2 ) = ,
ρ1 ρ2
(5) |A|(x1 , x2 ) = A(x1 , x2 )A(x1 , x2 )
ρ21 ρ22 − (X10 | X20 )2
=
ρ21 ρ22
(X10 | X20 )
(6) C(x1 , x2 ) = A(x1 , x2 ) + 1 = .
ρ1 ρ2
C(x1 , x2 ) = cos ϕ,
x2
x2
x1
x1
FIGURE 1. The angle α under which one cycle is seen from a second one.
this is the angle under which Cx2 is seen from the point on Cx1 closest
to Cx2 (compare Figure 1).
for (λ1 , λ2 ) has two, one or no solutions, and this depends on whether
the discriminant
is greater than, equal or less than 0. For any two cycles x1 , x2 of the
pencil we can write X 0 = λ1 Z10 + λ2 Z20 , X20 = µ1 Z10 + µ2 Z20 . Since
ρ2i = (Xi0 | Xi0 ), i = 1, 2, we get
(X10 | X20 )2
|A|(x1 , x2 ) = 1 −
(X1 | X10 )(X20 | X20 )
0
(λ1 Z10 +λ2 Z20 | λ1 Z10 +λ2 Z20 )(µ1 Z10 +µ2 Z20 | µ1 Z10 +µ2 Z20 )
=
(X10 | X10 )(X20 | X20 )
(λ1 Z1 + λ2 Z2 | µ1 Z10 + µ2 Z20 )2
0 0
−
(X10 | X10 )(X20 | X20 )
(Z 0 | Z20 )2 − (Z10 | Z10 )(Z20 | Z20 )
= −(λ1 µ2 − λ2 µ2 )2 1 ,
ρ21 ρ22
two lines with the Lie quadric are proper cycles geometrically related
to the cycles of the bunch with pole z. Let Z = (v, p, ω, ρ).
1. The intersections of the line z, w with Ω are given by the
homogeneous equation (λZ + µW | λZ + µW ) = 0. The first solution
λ = 0 determines the point w. If (Z | W )
= 0, the equation has a
second solution which determines a proper cycle ẑ with homogeneous
coordinates
(Z | Z) ρ2 − p2
(8) Ẑ = Z − W = , p, ω, ρ .
2ω 2ω
The cycle ẑ is thus defined for every z ∈/ w⊥ . It represents the sphere
Cẑ which is tangent to the family of planes represented by proper cycles
in z, w⊥ .
2. The intersections of the line z, r with Ω are given by the equation
(λZ + µR | λZ + µR) = 0. If (Z 0 | Z 0 ) ≥ 0 the solutions determine
a pair of proper (possibly equal) cycles {z̃, z̃ } representing the same
nonoriented geometric cycle with both orientations. The homogeneous
coordinates of these two cycles are
(9) Z̃ = (v, p, ω, (Z 0 | Z 0 )), Z̃ = (v, p, ω, − (Z 0 | Z 0 )).
The geometric cycles {Cz̃ , Cz̃ } can be described as the union of all point
cycles in z, r⊥ . If (Z 0 | Z 0 ) = 0, then z̃ = z̃ is a point cycle.
Let B = z⊥ ∩ Ω be the bunch with pole z, where z is different from
w and r.
(Z | Z)
P (x, ẑ) = .
ωz2
All finite cycles in the bunch B therefore have the same tangential
distance to the cycle Cẑ .
CONFIGURATIONS OF CYCLES 735
2
P (x, ẑ) = − (X | Ẑ)
ωz ωx
2 (Z | Z)
=− X|Z− W
ωz ωx 2ωz
(Z | Z)
= .
ωz2
(Z | Z)
|A|(x, z̃) = .
(Z 0 | Z 0 )
ρ2x ρ2z̃ − (X 0 | Z̃ 0 )
|A|(x, z̃) = −
ρ2x ρ2z̃
ρ2 (Z 0 | Z 0 )2 − (X | Z) − ρ2x ρ2z
= x
ρ2x (Z 0 | Z 0 )2
(Z 0 | Z 0 ) − ρ2z
=
(Z 0 | Z 0 )
for x ∈ B.
Proof. If (U | U )
= 0, then {X1 , . . . , Xn+1 , U, V } is a basis of Rn+3 .
Let P be the transition matrix from the standard basis to this basis.
Then, by (1),
(X | Y ) = X · AY = P X · AP Y = X · P T AP Y ,
must have value 0 for some λ ∈ (0, 1). The line u, v therefore
intersects the quadric.
Cv̂
x3
Cṽ
y1
Cû
y2
x1
x2
FIGURE 5. Configuration 1.
The cycles of the configuration belong to the bunch with pole v. Since
(V | V ) > 0, the cycle ṽ exists and, by Proposition 3.3, Cṽ intersects
all cycles Cxi under the same angle.
2. If (U | U ) = 0, then y = u is a solution of the Apollonius problem,
so the configuration is Apollonius. The point Cu is a common point of
all cycles of the configuration. We distinguish two cases.
a. If u ∈ X , then
n+1
(U | Z) = αi Xi | Z =0
i=1
x3
C y1 = C y2 = Cu
x1
x2
Cv̂
x3
y2
Cũ
Cû
x1
y1
x3
y1
x2
x1
Cû
Cũ Cv̂
y2
Cṽ
x2 y2
Cv̂
x1
Cũ
y1
Cû x3
Cṽ
x3
x2
x1
C y1 = C y2 = Cv
Cû
Cũ
Cṽ Cv̂
x2
x3
x1
Cû
Cũ
Zi = Xi + ai ρi R where ai = 1 − cos ϕi .
(Zi | Y ) = (Xi | Y ) − ai ρy ρi = 0, i = q, . . . , n + 1
and are the intersections of the projective line z1 , . . . , zn+1 ⊥ with
the Lie quadric. Since X is a Steiner configuration and the vectors
X1 , . . . , Xn+1 , R are linearly independent, the vectors Z1 , . . . , Zn+1 , R
are also linearly independent and a unique cycle u = Z, r⊥ exists just
as in Proposition 4.1. A similar classification describing the solutions
in terms of u and the existence of v can be made as in the case of the
classical Apollonius problem.
REFERENCES