Let
G
G
be a finite simple group. We show that the commutator map
α
:
G
×
G
→
G
\alpha :G \times G \rightarrow G
is almost equidistributed as
|
G
|
→
∞
|G| \rightarrow \infty
. This somewhat surprising result has many applications. It shows that a for a subset
X
⊆
G
X \subseteq G
we have
α
−
1
(
X
)
/
|
G
|
2
=
|
X
|
/
|
G
|
+
o
(
1
)
\alpha ^{-1}(X)/|G|^2 = |X|/|G| + o(1)
, namely
α
\alpha
is almost measure preserving. From this we deduce that almost all elements
g
∈
G
g \in G
can be expressed as commutators
g
=
[
x
,
y
]
g = [x,y]
where
x
,
y
x,y
generate
G
G
.
This enables us to solve some open problems regarding
T
T
-systems and the Product Replacement Algorithm (PRA) graph. We show that the number of
T
T
-systems in
G
G
with two generators tends to infinity as
|
G
|
→
∞
|G| \rightarrow \infty
. This settles a conjecture of Guralnick and Pak. A similar result follows for the number of connected components of the PRA graph of
G
G
with two generators.
Some of our results apply for more general finite groups and more general word maps.
Our methods are based on representation theory, combining classical character theory with recent results on character degrees and values in finite simple groups. In particular the so called Witten zeta function
ζ
G
(
s
)
=
∑
χ
∈
Irr
(
G
)
χ
(
1
)
−
s
\zeta ^G(s) = \sum _{\chi \in \operatorname {Irr}(G)}\chi (1)^{-s}
plays a key role in the proofs.