Primitive cyclic corners (Lemma 8.21) #
def:primitive-return-corner and lem:primitive-cyclic-corners
(primitive-ray-equations.tex). Part (1): a generating ray f : x → y, x ≠ y,
cyclic at both endpoints with q_x f = f q_y ≠ 0 and ℓ(q_x) primitive, has a primitive
reverse whenever f A₀(y, x) ≠ 0: the generating ray h of A₀(y, x) satisfies fh = q_x,
hf = q_y. A higher least return exponent gives a four-point crown in the faithful projective
support at x.
A primitive reverse of f (def:primitive-return-corner(1)).
Instances For
Lemma 8.21(1) (lem:primitive-cyclic-corners): the generating reverse is primitive.
Return partners and the corner S_x #
A return partner y of x (def:primitive-return-corner(2)).
Instances For
Membership in the primitive return corner S_x.
Instances For
A factorization uv = q_x through y ≠ x (lem:primitive-cyclic-corners(3), last
paragraph): u is generating with primitive reverse v, and y is a return partner.
Primitive pairs #
Weights of a primitive pair: χ_b = ℓ(t) + ℓ(h) = χ_c.
The first ray of a primitive pair between distinct vertices is generating.
A primitive pair gives a return partner when one local length is at least three
(lem:primitive-cyclic-corners(3): "both displayed actions are nonzero: use
q_b² = t q_c h or q_c² = h q_b t").
Lemma 9.8 (lem:external-hom-chain): generating rays out of x with surviving
q_x-action and targets outside S_x are comparable.
Lemma 8.21(2), the chain (lem:primitive-cyclic-corners(2)): the generating outgoing
rays of x with primitive reverses and surviving equal actions q_x f = f q_y ≠ 0 are
comparable under factorization ("incomparability would be a crown").
The comparison pair (lem:primitive-cyclic-corners(3)): for partners b, c of a
with v = ut, the rays t : b → c and h = v̄u : c → b satisfy th = q_b, ht = q_c.
Two partners of a are mutual partners when one has local length at least three
(lem:primitive-cyclic-corners(3), first paragraph).
a is a partner of its partner b when N_a ≥ 3 (q_b ū = ū q_a ≠ 0).
V_a ⊆ V_b for a partner b of a with N_a, N_b ≥ 3.
V_a = V_b for a partner b of a with N_a, N_b ≥ 3.
Lemma 8.21(3) (lem:primitive-cyclic-corners(3)): for vertices x, x' with
N_x, N_{x'} ≥ 3, the vertex sets V_x, V_{x'} of the primitive return corners are disjoint or
equal. (Primitivity is not needed for this part; with it, every nontrivial factorization of
q_x passes through S_x, partner_of_factor.)
Lemma 9.8, incoming form.