Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bowditch's Q-Conditions in Rank-Two Representations

Updated 6 July 2026
  • Bowditch's Q-Conditions are trace-theoretic criteria on rank-two free group representations that enforce all primitive elements to be loxodromic.
  • They employ Markoff maps on the Farey graph to encode trace identities and propagate Fibonacci-linear bounds, ensuring only finitely many primitive classes have bounded traces.
  • By establishing an Out(F2)-invariant domain of discontinuity, these conditions are equivalent to primitive stability, linking combinatorial and geometric insights.

Bowditch’s Q-conditions are trace-theoretic conditions on representations of the rank-two free group F2F_2 that single out a large Out(F2)\mathrm{Out}(F_2)-invariant domain of discontinuity in the corresponding character variety. In the classical setting, they are imposed on primitive elements of a representation ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C) or ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C), and are encoded by Markoff maps on the Farey graph or Farey tree. Bowditch introduced them in the punctured-torus, type-preserving setting, and Tan–Wong–Zhang generalized them to relative character varieties with arbitrary commutator trace. Independent proofs by Lee–Xu and by Series established that, in rank two, Bowditch’s domain BQBQ coincides with Minsky’s primitive stable domain PSPS, with no discreteness hypothesis and for general κ=tr([A,B])\kappa=\mathrm{tr}([A,B]) (Lee et al., 2018, Series, 2019).

1. Rank-two setting and Markoff formalism

Let F2=a,bF_2=\langle a,b\rangle be the free group of rank $2$. An element uF2u\in F_2 is primitive if it belongs to some generating pair Out(F2)\mathrm{Out}(F_2)0 of Out(F2)\mathrm{Out}(F_2)1. Up to inverse and conjugacy, primitive elements are enumerated by extended conjugacy classes, which correspond bijectively to rational slopes Out(F2)\mathrm{Out}(F_2)2 via the Farey tree. For a fixed initial triple Out(F2)\mathrm{Out}(F_2)3, representatives Out(F2)\mathrm{Out}(F_2)4 are obtained by Farey addition and concatenation.

For a representation Out(F2)\mathrm{Out}(F_2)5, the character variety Out(F2)\mathrm{Out}(F_2)6 is the GIT quotient of Out(F2)\mathrm{Out}(F_2)7 by conjugation, and for irreducible representations it is identified with Out(F2)\mathrm{Out}(F_2)8 through

Out(F2)\mathrm{Out}(F_2)9

In the ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)0 formulation, traces are defined up to sign by choosing lifts to ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)1, so the invariant quantities are ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)2 and trace identities.

The trace geometry is governed by two basic identities: ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)3 and

ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)4

Writing ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)5, ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)6, ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)7, and ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)8, this becomes

ρ:F2SL(2,C)\rho:F_2\to \mathrm{SL}(2,\mathbb C)9

In the type-preserving punctured torus case, ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)0, hence ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)1, and the classical Markoff equation is recovered.

These identities define the Markoff-map framework. In one description, the complementary regions ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)2 of the Farey tree are identified with extended conjugacy classes of primitive elements, and a representation ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)3 defines

ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)4

where ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)5 corresponds to the primitive class of ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)6. In the dual Farey-graph description, primitive classes are the vertices. At each Farey triangle the three associated values satisfy the Markoff relation, and across an edge they satisfy the basic trace recursion. This is the combinatorial substrate of Bowditch’s Q-conditions (Lee et al., 2018).

2. Definition of the Q-conditions

Bowditch’s Q-conditions are conditions on primitive elements only. In the ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)7 formulation used by Lee–Xu, if ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)8 denotes the set of unoriented primitive conjugacy classes of ρ:F2PSL(2,C)\rho:F_2\to \mathrm{PSL}(2,\mathbb C)9, then BQBQ0 satisfies the Q-conditions when

BQBQ1

equivalently, after choosing lifts, BQBQ2, and

BQBQ3

In the BQBQ4 formulation used by Series, an irreducible representation satisfies BQBQ5 if

BQBQ6

and

BQBQ7

In the strict formulation with BQBQ8, this finite set may be empty; BQBQ9 is retained to match generalized settings and to emphasize openness. In the rank-two literature these conditions are routinely expressed in terms of the Markoff map: PSPS0 means the map avoids PSPS1 on primitive classes, while PSPS2 is the finiteness of bounded-trace primitive classes. Under PSPS3, Bowditch and Tan–Wong–Zhang proved that PSPS4 is equivalent to a uniform linear lower bound

PSPS5

for constants PSPS6, where PSPS7 is the cyclically reduced length in a fixed basis PSPS8; in this rank-two setting PSPS9 coincides with the Christoffel or Fibonacci length (Series, 2019, Lee et al., 2018).

3. Farey-tree dynamics, sink subtrees, and effective criteria

A central feature of Bowditch’s theory is that trace bounds propagate combinatorially along the Farey tree. Along an edge with adjacent regions κ=tr([A,B])\kappa=\mathrm{tr}([A,B])0 and third regions κ=tr([A,B])\kappa=\mathrm{tr}([A,B])1 at the endpoints, the recursion

κ=tr([A,B])\kappa=\mathrm{tr}([A,B])2

follows from κ=tr([A,B])\kappa=\mathrm{tr}([A,B])3. This permits an orientation of Farey edges by comparing the moduli of the two third-region traces.

For κ=tr([A,B])\kappa=\mathrm{tr}([A,B])4, define

κ=tr([A,B])\kappa=\mathrm{tr}([A,B])5

Then κ=tr([A,B])\kappa=\mathrm{tr}([A,B])6 is connected, and it is finite if and only if κ=tr([A,B])\kappa=\mathrm{tr}([A,B])7. Infinite rays oriented away from their initial vertex meet regions with κ=tr([A,B])\kappa=\mathrm{tr}([A,B])8, infinitely many unless the ray stays on the boundary of a single region. A finite sink subtree κ=tr([A,B])\kappa=\mathrm{tr}([A,B])9 exists with the property that any path of strictly decreasing arrows eventually lands on an edge of F2=a,bF_2=\langle a,b\rangle0; all sink vertices and all edges abutting a sink lie in F2=a,bF_2=\langle a,b\rangle1. Moreover, there is F2=a,bF_2=\langle a,b\rangle2 such that any region adjacent to an edge of F2=a,bF_2=\langle a,b\rangle3 has F2=a,bF_2=\langle a,b\rangle4.

Tan–Wong–Zhang’s generalized Markoff-map theory also isolates an exceptional set along the boundary of a single region,

F2=a,bF_2=\langle a,b\rangle5

for F2=a,bF_2=\langle a,b\rangle6. Values outside F2=a,bF_2=\langle a,b\rangle7 grow exponentially along the boundary; values in F2=a,bF_2=\langle a,b\rangle8 obstruct the simplest monotone-growth picture. This dependence on F2=a,bF_2=\langle a,b\rangle9 is one of the main distinctions between the classical type-preserving case and the relative-character-variety setting.

The practical verification scheme follows the same combinatorics. One fixes $2$0, computes $2$1, builds the Markoff map from initial trace data, propagates it with the two trace identities, orients edges by third-region moduli, identifies the finite sink subtree, verifies that no primitive trace lies in $2$2, and checks that only finitely many primitive classes have bounded trace. The wake estimates give Fibonacci growth: for a directed edge whose wake is oriented toward it, there exist $2$3 and $2$4 such that

$2$5

for all but at most $2$6 regions in the wake. This is the effective combinatorial core of $2$7 (Series, 2019).

4. Equivalence with primitive stability

Minsky’s primitive stability is a geometric condition on the orbit map into $2$8. Fix generators $2$9 and a basepoint uF2u\in F_20. For a cyclically shortest word uF2u\in F_21, the broken geodesic uF2u\in F_22 is obtained from the orbit points

uF2u\in F_23

with uF2u\in F_24. Primitive stability means that there are constants uF2u\in F_25 such that every broken geodesic arising from a primitive cyclic word is a uF2u\in F_26-quasi-geodesic; equivalently, for the relevant cyclic subwords,

uF2u\in F_27

The main theorem in rank two is

uF2u\in F_28

Series proves that Bowditch’s BQ-condition is equivalent to Minsky’s primitive stability for uF2u\in F_29, and Lee–Xu prove the analogous equality for Out(F2)\mathrm{Out}(F_2)00. Both proofs hold without any discreteness hypothesis; in Series’ formulation the equivalence also holds on relative character varieties with fixed Out(F2)\mathrm{Out}(F_2)01 (Lee et al., 2018, Series, 2019).

The implication Out(F2)\mathrm{Out}(F_2)02 is comparatively direct. Uniform quasi-geodesicity forces every primitive image to be loxodromic and yields a uniform linear lower bound on hyperbolic displacement and hence on trace. In Lee–Xu’s formulation,

Out(F2)\mathrm{Out}(F_2)03

This gives Out(F2)\mathrm{Out}(F_2)04 and Out(F2)\mathrm{Out}(F_2)05.

The converse Out(F2)\mathrm{Out}(F_2)06 is the deeper direction. In Series’ proof, Out(F2)\mathrm{Out}(F_2)07 first implies the bounded intersection property, then Tan–Wong–Zhang’s Fibonacci growth on wakes is combined with estimates on bending and segment lengths in broken geodesics to obtain uniform quasi-geodesicity. In Lee–Xu’s proof, one passes through a Coxeter extension and an oriented right-angled hexagon, uses the law of cosines

Out(F2)\mathrm{Out}(F_2)08

derives an angle lemma forcing Out(F2)\mathrm{Out}(F_2)09 to be small at high Farey level, and then exploits Christoffel bases so that high-level primitive words are positive in suitable generators. The resulting lower bounds on orbit distances along primitive axes establish primitive stability.

5. Bounded intersection property, examples, and failure modes

The bounded intersection property (BIP) was introduced to capture a geometric remnant of the Q-conditions. In Lee–Xu’s formulation, after fixing a basic triple Out(F2)\mathrm{Out}(F_2)10 with Out(F2)\mathrm{Out}(F_2)11 and the corresponding half-turn data Out(F2)\mathrm{Out}(F_2)12, one considers the sets

Out(F2)\mathrm{Out}(F_2)13

of intersections between the axes of palindromic primitive elements and the special half-turn axes Out(F2)\mathrm{Out}(F_2)14. A representation has BIP if it is irreducible, every primitive element is loxodromic, and these three sets are bounded subsets of Out(F2)\mathrm{Out}(F_2)15. Series formulates the same phenomenon in terms of axes of palindromic primitives intersecting fixed special hyperelliptic axes within uniformly bounded distance of a basepoint.

In rank two,

Out(F2)\mathrm{Out}(F_2)16

and both Out(F2)\mathrm{Out}(F_2)17 and Out(F2)\mathrm{Out}(F_2)18 imply BIP. The converse fails in general. A standard counterexample is an Out(F2)\mathrm{Out}(F_2)19-valued representation for which all images are elliptic with a common fixed point: all axes pass through that point, so BIP holds, but Out(F2)\mathrm{Out}(F_2)20 fails and primitive stability fails. In the discrete faithful setting, however, Lee–Xu prove that BIP forces the Q-conditions.

The classical positive examples are Schottky groups and many quasi-Fuchsian once-punctured torus groups. In these cases primitive words are loxodromic and trace growth along the Farey tree is exponential or at least Fibonacci-linear on the logarithmic scale, so only finitely many primitive classes can have small trace. The standard failure modes lie on the boundary of Out(F2)\mathrm{Out}(F_2)21: either some primitive element becomes elliptic or parabolic, violating Out(F2)\mathrm{Out}(F_2)22, or infinitely many primitive classes retain bounded trace, violating Out(F2)\mathrm{Out}(F_2)23. Geometrically this destroys the uniform quasi-geodesic control required by primitive stability; combinatorially it destroys attraction to a finite sink subtree (Lee et al., 2018, Series, 2019).

6. Generalizations, dynamics, and open directions

The dynamical significance of Bowditch’s Q-conditions is that Out(F2)\mathrm{Out}(F_2)24 is an open Out(F2)\mathrm{Out}(F_2)25-invariant subset of the character variety on which Out(F2)\mathrm{Out}(F_2)26 acts properly discontinuously. This domain strictly contains the Schottky or convex-cocompact locus, and it can contain non-discrete representations. Thus the dynamical decomposition of the character variety does not coincide with the discrete-versus-dense dichotomy.

A higher-dimensional generalization replaces trace by translation length. For a proper geodesic Gromov-hyperbolic space Out(F2)\mathrm{Out}(F_2)27, a representation Out(F2)\mathrm{Out}(F_2)28 satisfies the Out(F2)\mathrm{Out}(F_2)29-conditions if every primitive element is loxodromic and only finitely many primitive conjugacy classes have translation length at most Out(F2)\mathrm{Out}(F_2)30. Fléchelles proves that for Out(F2)\mathrm{Out}(F_2)31, Out(F2)\mathrm{Out}(F_2)32, and under the half-length property (HLP), the following are equivalent: Out(F2)\mathrm{Out}(F_2)33 where Out(F2)\mathrm{Out}(F_2)34 is non-increasing and

Out(F2)\mathrm{Out}(F_2)35

All Coxeter- or Out(F2)\mathrm{Out}(F_2)36-extensible representations satisfy HLP, so this recovers the classical Out(F2)\mathrm{Out}(F_2)37 equivalence and extends it to a substantial class of higher-dimensional representations. The bounded intersection property is also generalized to Out(F2)\mathrm{Out}(F_2)38, with primitive stability implying BIP and, in the discrete faithful case, BIP implying the strong Q-conditions (Fléchelles, 13 Jul 2025).

Two nuances remain central. First, Bowditch’s Q-conditions do not require discreteness; nondiscrete Out(F2)\mathrm{Out}(F_2)39 representations exist when Out(F2)\mathrm{Out}(F_2)40 varies. Second, in the punctured torus case Out(F2)\mathrm{Out}(F_2)41, Bowditch conjectured that all Out(F2)\mathrm{Out}(F_2)42 representations are quasi-Fuchsian; this remains open. These facts delimit both the reach and the unresolved boundary of the theory (Series, 2019).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Bowditch's Q-Conditions.