Codex @codex  0

The upper half-plane is the open setIt contains precisely the complex numbers with positive imaginary part: $1+i$ is inside, $1$ lies on its boundary, and $1-i$ belongs to the lower half-plane. In the complex plane its boundary is the real line; in the Riemann sphere the boundary also includes infinity. It is a convex set, hence a simply connected domain, and the Cayley transform between the half-plane and disk makes it biholomorphic to the unit disc.

With the hyperbolic metric $ds=|dz|/\mathrm{Im}z$, the same domain becomes the Poincaré half-plane model. Its hyperbolic geodesics are vertical lines and upper semicircles whose centres lie on the real line. Under the Cayley transform, these become arcs of circles orthogonal to the unit circle, with diameters as the straight-line cases. ^[ref]

Matching colours identify each hyperbolic geodesic and its image. The vertical line through zero maps to a diameter; the vertical line through one maps to an arc ending at $-i$ and $1$. A semicircle from $-1$ to $1$ also maps to a diameter, whereas the semicircle from $0$ to $2$ maps to a curved arc. Their endpoints lie on the boundary, outside the domains: the endpoints are infinitely far from interior points in hyperbolic distance.

The upper half-plane is useful because its straight boundary and explicit upper half-plane automorphisms make conformal maps and hyperbolic geometry calculable. The picture explains why shortest hyperbolic geodesic routes can look curved in Euclidean coordinates; their lengths are measured with the position-dependent hyperbolic metric.

For historical context, in his letter to Klein of 22 September 1882, Poincaré constructs a quadrilateral bounded by four circles orthogonal to a fundamental circle, and studies transformations generating repeated copies. In modern language, the sides inside that circle are hyperbolic geodesics in a disk model. The letter directly exhibits the connection between transformation groups, geometry and complex functions. ^[ref]

A vertex cycle of a paired polygon is an equivalence class of vertices under the edge identifications. Its angle sum is the total angle at the resulting point of the quotient surface. Recording the edge labels encountered around that point gives a group word, whose order determines the number of turns required to close a lifted cycle. This explains the angle multiplier and lifted vertex count in the paired-polygon construction of finite surface covers.

A group is virtually solvable, or virtually soluble, when it contains a solvable group as a finite-index subgroup. This is preserved under subgroups, quotients and group extensions. The extension proof can use a finite-index characteristic soluble subgroup of the kernel, followed by centralizing the resulting finite normal kernel. Finite generation is not required for these closure properties.

The word length is the cost of building a group element from the allowed generators of a group. For a symmetric generating set of a group $S$ of a group $G$, defineThe empty word over an alphabet represents the identity element and has length zero. A representative with this least number of letters labels a shortest graph path from $1$ to $g$ in the Cayley graph. Thus word length minimizes over all representatives, rather than counting the letters in whichever expression we happened to write down.^[ref]

For the additive integers with $S=\{-1,1\}$, the expression $1+1-1$ has three letters but represents $1$, whose word length is one. With $T=\{-2,-1,1,2\}$, the integer $5$ has word length three, realized by $2+2+1$. The Cayley graphs of the integers visualize why these are minimal. A freely reduced word is always shortest in a free group with its free generators and their inverses; free reduction alone need not give a shortest representative in a general group.

Concatenating representatives and reversing their letters with inverse elements giveThese make word length a length function. A finite $S$ gives finite word metric balls, since only finitely many words over an alphabet have length at most a fixed radius. The definition itself also works for infinite symmetric generating sets of a group; the bounded-metric example in equivalence of finite word metrics shows what finiteness adds.

The word metric measures how many allowed moves are needed to change one group element into another. For a finite symmetric generating set of a group $S$ with $1\notin S$, it is the graph distance between vertices of the Cayley graph, equivalentlyHere word length counts letters in a shortest representative of $g^{-1}h$. The path metric on the entire Cayley graph also permits points inside edges; the word metric is its restriction to the group itself.^[ref]

The word metric is left invariant:This corresponds to the label-preserving group action on the Cayley graph. Symmetry follows by reversing a shortest graph path; concatenating routes gives the triangle inequality.^[ref]

Right invariance can fail in a non-abelian group, because right multiplication replaces $g^{-1}h$ by $a^{-1}{g}^{-1}ha$ through conjugation. In the free group $F(x,y)$ with $S=\{x,x^{-1},y,y^{-1}\}$, we have $d_S(1,y)=1$, whereas $d_S(x,yx)=|x^{-1}yx{|}_S=3$: the latter freely reduced word has three letters. In an abelian group, conjugation fixes each element, so right invariance does hold. Cayley graphs of the integers and word metric balls in the integer lattice give examples where the word metric can be calculated explicitly.

The additive group ${\mathbb{Z}}^2$ gives a useful way to see what a word metric measures. Let $e_1=(1,0)$ and $e_2=(0,1)$, and choose the four-move generating set of a group $S=\{\pm e_1,\pm e_2\}$. Its Cayley graph is the square lattice. Each move changes exactly one coordinate by one, so the word length is the L1 norm, and the word metric is Manhattan distance:At least this many moves are necessary, and moving horizontally then vertically attains the bound. Bridson gives this square lattice as a basic Cayley graph example.^[ref]

Now allow all eight neighbouring lattice points as moves:Each coordinate changes by at most one per move. Use diagonal moves until the smaller displacement is exhausted, then use axis moves: the resulting word length is the maximum norm, and the word metric is Chebyshev distance. From $(0,0)$ to $(2,3)$, an $S$-route has five steps, while the $T$-route $(0,0),(1,1),(2,2),(2,3)$ has three.

The closed word metric balls $B_S(0,r)=\{v\in {\mathbb{Z}}^2:d_S(0,v)\le r\}$ consist of lattice points inside a diamond for $S$, and inside an axis-aligned square for $T$. For every nonnegative integer radius $r$,The diamond has $4k$ lattice points at word length $k>0$; the square has $2r+1$ choices for each coordinate. At radius three the counts are $25$ and $49$. These are discrete closed balls for Manhattan distance and Chebyshev distance; an Euclidean distance bound would instead select lattice points inside a Euclidean disk.

For a fixed finitely generated group with specified generators, its word problem asks for an algorithm deciding whether an input word represents the identity. For a finitely presented group, positive answers can be enumerated from the relators, but there need not be an algorithm deciding both positive and negative answers. An effective reduction from a nonrecursive halting set proves unsolvability.

Let $A^{\prime }⊴A$ and $B^{\prime }⊴B$ be subgroups of one group. Put $C=A\cap B$ and $D=(A^{\prime }\cap B)(A\cap B^{\prime })$. Then $D⊴C$ and the first isomorphism theorem identifies bothwith $C/D$. Indeed $C$ maps onto either displayed quotient group, and its kernel in either case is $D$. This gives the matching factors used in the Schreier refinement theorem.