MathOverflow Asked by QSH on December 7, 2020

Let $G$ be a group. Suppose for any general linear representation $rho:Gtomathrm{GL}(n)$,

$rho$ must be trivial.

Question: Are there any characterizations or equivalent conditions for $G$?

Thanks for guidance.

With no limit on $n$, Martin Bridson and I proved that this property is undecidable for finitely presented groups. See the reformulation of the main theorem on page 2 of Bridson and Wilton - The triviality problem for profinite completions:

There is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite-dimensional linear representation (over any field).

This reformulation goes as Ian Agol mentions in the comments: every representation is trivial if and only if the group has no non-trivial finite quotients.

On the other hand, for fixed $n$ such problems are decidable. See, for instance, Algorithms determining finite simple images of finitely presented groups by Bridson, Evans, Liebeck, and Segal.

Correct answer by HJRW on December 7, 2020

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- Joshua Engel on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?
- haakon.io on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?
- Peter Machado on Why fry rice before boiling?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP