Processing math: 100%

G-sets

Abbreviation: Gset

Definition

A \emph{G-set} is a structure A=A,fg(gG), where G,,1,1 is a group, such that

f1 is the identity map: 1x=x and

the group action associates: (gh)x=g(hx)

Remark: fg(x)=gx is a unary operation called \emph{the group action by g}.

If follows from the associativity that fg1 is the inverse function of fg.

This is a template. If you know something about this class, click on the 'Edit text of this page' link at the bottom and fill out this page.

It is not unusual to give several (equivalent) definitions. Ideally, one of the definitions would give an irredundant axiomatization that does not refer to other classes.

Morphisms

Let A and B be … . A morphism from A to B is a function h:AB that is a homomorphism: h(xy)=h(x)h(y)

Definition

An \emph{…} is a structure A=A, of type such that

is …: axiom

is …: axiom

Examples

Example 1:

Basic results

Properties

Finite members

$\begin{array}{lr}

f(1)= &1\\
f(2)= &\\
f(3)= &\\
f(4)= &\\
f(5)= &\\

\end{array}\begin{array}{lr}

f(6)= &\\
f(7)= &\\
f(8)= &\\
f(9)= &\\
f(10)= &\\

\end{array}$

Subclasses

[[...]] subvariety
[[...]] expansion

Superclasses

[[...]] supervariety
[[...]] subreduct

References


1) F. Lastname, \emph{Title}, Journal, \textbf{1}, 23–45 MRreview

QR Code
QR Code g-sets (generated for current page)