I What does V^G mean in linear algebra?

  • I
  • Thread starter Thread starter cask1
  • Start date Start date
  • Tags Tags
    Notation
cask1
Messages
8
Reaction score
0
TL;DR Summary
Hi. Newbee question. What does the notation V^G mean where V is a vector space and G is a group? I found it in: A linear algebraic group G is called linearly reductive if for every rational representation V and every v in V^G \ {0}, there exists a linear invariant function f in (V^*)^G such that f(v)<>0. I can't find a definition of the notation using google. Thanks.
Hi. Newbee question. What does the notation V^G mean where V is a vector space and G is a group? I found it in: A linear algebraic group G is called linearly reductive if for every rational representation V and every v in V^G \ {0}, there exists a linear invariant function f in (V^*)^G such that f(v)<>0. I can't find a definition of the notation using google. Thanks.
 
Physics news on Phys.org
Normally for sets ##X## and ##Y##, ##X^Y## is the set of functions from ##Y## to ##X##. In a context like this, it's often meant to be limited to functions of the desired type, e.g. only representations.

That doesn't really make sense here, since a representation is a map ##G\to GL(V)##, not a map from ##G## to ##V##.
 
When a group ##G## acts on a set ##X## (in your case ##V##), sometimes one writes ##X^G## for the set of invariant elements, that is, the elements of ##X## that are fixed by all group elements. Note that if ##G## acts linearly on ##V##, then it also does on ##V^*##, so it makes sense to write ##(V^*)^G## in your example.
 
Last edited:
The AI summary explanation that ends this thread, visible only when not logged in, incorrectly equates V^G with V ^*, and hence virtually every statement in it is false.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top