Involution and Commutator Length in PU(n,1)

Abstract

We study decompositions of holomorphic isometries of complex hyperbolic space into holomorphic involutions. We prove that, for every n>=3, the involution length of PU(n,1) is 4. This improves the higher-dimensional upper bound 8 of Paupert--Will, as well as the projective upper bound 5 implied by Bünger's linear decomposition theorem, to the optimal value 4. Combined with the two-dimensional result of Paupert--Will, this shows that the involution length of PU(n,1) is 4 for every n>=2. The core of the proof is a three-involution decomposition theorem for square roots: every g in PU(n,1) has a square root of involution length at most 3, and this uniform bound is optimal. The key construction is carried out first on a two- or three-dimensional indefinite block and then completed in higher dimensions by a necessary and sufficient spectral pairing criterion on the positive-definite orthogonal complement. The four-factor lower bound is provided by complex reflections in a point. As a consequence, every element of PU(n,1) is a single commutator, and the two elements in the commutator representation can be simultaneously reversed by the same nontrivial holomorphic involution. This extends the two-dimensional single-commutator result of Paupert--Will to every n>=2 and thereby verifies Djoković's Conjecture A for the family PU(n,1), n>=2.

On commutator length in free groups
Laurent Bartholdi, Sergei O. Ivanov, Danil Fialkovski
Groups, Geometry, and Dynamics3 Nov 2026Peer-reviewedCC BYFull textAlgebra & number theoryHAL
Presentation of monoids generated by a projection and an involution
Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
Semigroup Forum5 Oct 2026Peer-reviewedCC BY 4.0Full textGeneral mathematicsHAL
The Involution Rank of MCG(Σ₃) Is Four
Qilong Guo, Dongqi Sun
arXiv16 Oct 2026PreprintarXiv licenceFull textGeometry & topologyarXiv
Formal Matrix Rings with the Involution Property
Valeriya Kirova
arXiv24 Oct 2026PreprintCC BY 4.0Full textAlgebra & number theoryarXiv
Hilbert-Schmidt Norms of Self-Commutator and Cross-Commutator on N_η-type Quotient Modules in Polydisc
Anjian Xu, Yuchao Xiang
arXiv2 Oct 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv

Cite

BibTeX RIS

BibTeX

@misc{wang2026involution,
  title = {{Involution and Commutator Length in PU(n,1)}},
  author = {Zhongqi Wang and Shihai Yang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17957},
  eprint = {2609.17957},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17957},
}

RIS

TY  - UNPB
TI  - Involution and Commutator Length in PU(n,1)
AU  - Zhongqi Wang
AU  - Shihai Yang
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2609.17957
UR  - https://arxiv.org/abs/2609.17957
AB  - We study decompositions of holomorphic isometries of complex hyperbolic space into holomorphic involutions. We prove that, for every n>=3, the involution length of PU(n,1) is 4. This improves the higher-dimensional upper bound 8 of Paupert--Will, as well as the projective upper bound 5 implied by Bünger's linear decomposition theorem, to the optimal value 4. Combined with the two-dimensional result of Paupert--Will, this shows that the involution length of PU(n,1) is 4 for every n>=2. The core of the proof is a three-involution decomposition theorem for square roots: every g in PU(n,1) has a square root of involution length at most 3, and this uniform bound is optimal. The key construction is carried out first on a two- or three-dimensional indefinite block and then completed in higher dimensions by a necessary and sufficient spectral pairing criterion on the positive-definite orthogonal complement. The four-factor lower bound is provided by complex reflections in a point. As a consequence, every element of PU(n,1) is a single commutator, and the two elements in the commutator representation can be simultaneously reversed by the same nontrivial holomorphic involution. This extends the two-dimensional single-commutator result of Paupert--Will to every n>=2 and thereby verifies Djoković's Conjecture A for the family PU(n,1), n>=2.
ER  -

Abstract

Related

Cite