Lemma 6. If g ∈ G(Hk
n ) satisfies g(in) = in, then g(v) ∈ [i] for all v ∈ [i], i.e.,
g([i]) = [i] as a set.
Proof. For concreteness we assume that 0n is the vertex which is fixed by hypothesis.
Now assume, aiming for a contradiction, that there exists v ∈ [0] such that g(v) ∈
[i],i = 0. By Lemma 2, there exists a unique j = 0 such that g(jn) = in. Thus, both
g(v) and g(jn) are in [i]. Thus, since g(jn) = in, by Lemma 5 we have
d(g(v), g(jn)) < d(g(v), g(kn))
Lemma 6. If g ∈ G(Hk
n ) satisfies g(in) = in, then g(v) ∈ [i] for all v ∈ [i], i.e.,
g([i]) = [i] as a set.
Proof. For concreteness we assume that 0n is the vertex which is fixed by hypothesis.
Now assume, aiming for a contradiction, that there exists v ∈ [0] such that g(v) ∈
[i],i = 0. By Lemma 2, there exists a unique j = 0 such that g(jn) = in. Thus, both
g(v) and g(jn) are in [i]. Thus, since g(jn) = in, by Lemma 5 we have
d(g(v), g(jn)) < d(g(v), g(kn))
การแปล กรุณารอสักครู่..