Normed amenability and bounded cohomology over non-Archimedean fields
Francesco Fournier-Facio

TL;DR
This paper investigates the properties of bounded cohomology of totally disconnected locally compact groups over non-Archimedean fields, introducing normed $K$-amenability and exploring its implications and contrast with real bounded cohomology.
Contribution
It introduces the concept of normed $K$-amenability, provides algebraic and cohomological characterizations, and studies the comparison map's properties over non-Archimedean fields.
Findings
Normed $K$-amenable groups are locally elliptic.
Comparison map is injective in all degrees under certain conditions.
Bounded cohomology over non-Archimedean fields satisfies a Mayer--Vietoris sequence.
Abstract
We study continuous bounded cohomology of totally disconnected locally compact groups with coefficients in a non-Archimedean valued field . To capture the features of classical amenability that induce the vanishing of real bounded cohomology, we introduce the notion of normed -amenability, of which we prove an algebraic characterization. It implies that normed -amenable groups are locally elliptic, and it relates an invariant, the norm of a -amenable group, to the order of its discrete finite -subquotients, where is the characteristic of the residue field of . Moreover, we prove a bounded-cohomological characterization for discrete groups. The algebraic characterization shows that normed -amenability is a very restrictive condition, so the bounded cohomological one suggests that there should be plenty of groups with rich bounded cohomology with trivial …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories · Topological and Geometric Data Analysis · Advanced Operator Algebra Research
