MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $(G,\cdot)$ be a group and $\phi:G\rightarrow\mathbb R$ bounded. Let me say that the pair $(G,\phi)$ is amenable if there is a finitely additive probability measure $\mu$ on $G$ such that for all $y\in G$

$$ \int \phi(x)d\mu(x)=\int \phi(x\cdot y)d\mu(x)=\int\phi(y\cdot x)d\mu(x) $$

Question: Does there exist a non-amenable group such that the pair $(G,\phi)$ is amenable for all $\phi\in\ell^\infty(G)$?

share|cite|improve this question
How about the free group with 2 generators? – Mark Sapir Sep 4 '11 at 15:05
I have no idea. Is it trivial that for any $\phi$ there is such a measure? – Valerio Capraro Sep 4 '11 at 15:28
Did you try any $\phi$ at all? – Mark Sapir Sep 4 '11 at 15:57
There are ergodic theorems for free group actions (Bufetov, Alexander I. Convergence of spherical averages for actions of free groups. Ann. of Math. (2) 155 (2002), no. 3, 929–944.) Perhaps that can help. But I would suggest that you ask the simplest question for which you do not know the answer first. How about the indicator function of a generator? – Mark Sapir Sep 4 '11 at 17:49
I think you should try to consider the indicator case yourself. It should be an easy exercise. Then you will get an idea what to do next. – Mark Sapir Sep 4 '11 at 23:32
up vote 2 down vote accepted

The answer is no, no such non-amenable group can exist. It follows from Justin Moore's answer to his own question that a single characteristic function can witness the non-amenability of a group.

share|cite|improve this answer
many thanks for the link. I will try to get into the details tomorrow. – Valerio Capraro Sep 11 '11 at 1:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.