Documentation

TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.SidePairing.Vertex.Stabilizer

Stabilizers of the finite vertices of a fundamental polygon #

Let σ be a side pairing of a convex hyperbolic polygon P, and let Γ ≤ PSL(2, ℝ) contain the side-pairing maps and move the interior of P off itself: distinct translates of the interior are disjoint. At a finite vertex z = vertex j, the tiles met by following the vertex cycle turn around z through the successive interior angles. Two of these tiles whose sectors overlap must be the same translate of P. This forces the angles of some number t of circuits of the cycle to add up to exactly 2π, and the cycle transformation to have order t.

Every element of Γ fixing z then moves P to one of the tiles around z, so the stabilizer of z in Γ is generated by the cycle transformation. Hence the stabilizer is finite cyclic of order m and the angle sum of the cycle is 2π / m. This is the converse of the angle condition at finite vertices in Poincaré's polygon theorem, and it reads off the elliptic points of Γ on the boundary of P and their orders. Neither local finiteness of the translates nor discreteness of Γ is assumed.

Main results #

References #

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.orderOf_cycleMap_mul_cycleAngleSum {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

The angle condition at a finite vertex of a fundamental polygon. Let Γ contain the side-pairing maps, with distinct translates of the interior of P disjoint. At a finite vertex, the order of the cycle transformation times the cycle angle sum is 2π. In particular that order is finite and the angle sum is 2π / m for a positive integer m.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.orderOf_cycleMap_ne_zero {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

At a finite vertex of a polygon with disjoint translated interiors, the cycle transformation has finite order.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.cycleAngleSum_eq_two_pi_div {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

At a finite vertex of a polygon with disjoint translated interiors, the cycle angle sum is 2π divided by the order of the cycle transformation.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.mem_smul_carrier_iff_exists_inv_partialCycleMap_eq {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) {g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ} (hg : g ∈ Γ) :
z ∈ g • P.carrier ↔ ∃ m < orderOf (σ.cycleMap j) * σ.cycleLength j, (σ.partialCycleMap j m)⁻¹ = g

The tiles containing a finite vertex are exactly the inverse partial cycle tiles before one full turn. This classifies all tiles at the vertex, without assuming that its preimage under the tile transformation is a vertex.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.exists_partialCycleMap_eq_of_smul_vertex_eq {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j k : Fin n} {z w : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hw : P.vertex k = Sum.inl w) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) {g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ} (hg : g ∈ Γ) (hgz : g • z = w) :
∃ m < orderOf (σ.cycleMap j) * σ.cycleLength j, σ.partialCycleMap j m = g ∧ (⇑σ.next)^[m] j = k

Every element identifying two finite vertices of a polygon with disjoint translated interiors is a partial cycle product. The product occurs before the cycle has made one full turn, namely before orderOf (cycleMap j) * cycleLength j steps.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.smul_eq_self_iff_mem_zpowers_cycleMap {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) {g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ} (hg : g ∈ Γ) :

The stabilizer of a finite vertex of a fundamental polygon. Let Γ contain the side-pairing maps, with distinct translates of the interior of P disjoint. An element of Γ fixes the finite vertex z = vertex j exactly when it is a power of the cycle transformation.

The stabilizer of a finite vertex of a fundamental polygon is generated by its cycle transformation. Under the hypotheses of smul_eq_self_iff_mem_zpowers_cycleMap, the stabilizer of the vertex in Γ, viewed in PSL(2, ℝ), is the cyclic group generated by the cycle transformation.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.stabilizer_eq_bot_iff_cycleMap_eq_one {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

A finite vertex has trivial stabilizer exactly when its cycle transformation is the identity. Thus the nontrivial finite cycles are precisely the elliptic vertex cycles.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.natCard_stabilizer_eq_orderOf_cycleMap {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

The order of the stabilizer of a finite vertex equals the order of its cycle transformation, including the trivial cycle of order one.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.natCard_stabilizer_mul_cycleAngleSum {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

The angle sum at a finite vertex of a fundamental polygon is 2π / m, where m is the order of the stabilizer of the vertex. Under the hypotheses of smul_eq_self_iff_mem_zpowers_cycleMap, the stabilizer of the vertex in Γ has order m with m times the cycle angle sum equal to 2π.

theorem TauCeti.UpperHalfPlane.ConvexPolygon.SidePairing.cycleMap_eq_positiveStabilizerGenerator {n : ℕ} [NeZero n] {P : ConvexPolygon n} (σ : P.SidePairing) {Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)} {j : Fin n} {z : UpperHalfPlane} [Finite ↥(MulAction.stabilizer (↥Γ) z)] (hz : P.vertex j = Sum.inl z) (hmap : ∀ (i : Fin n), σ.map i ∈ Γ) (hdisj : ∀ (γ : ↥Γ), γ ≠ 1 → Disjoint (↑γ • interior P.carrier) (interior P.carrier)) :

The finite vertex-cycle transformation of a fundamental polygon is the positive stabilizer generator, not its inverse. Only disjointness of translated interiors is needed.