MHB What Is the Upper Bound of Groups of Order in Finite Group Theory?

pauloromero1983
Messages
2
Reaction score
0
In the context of group theory, there's a theorem that states that for a given positive integer \(n\) there exist finitely different types of groups of order \(n\). Notice that the theorem doesn´t say anything of how many groups there are, only states that such groups exist. In the proof of this statement, they define a map \(f:G\times G \rightarrow X\) where \(X\) is a set with \(n\) elements. Defining a group structure in the same map by means of the product rule \(f(g_{1})f(g_{2})=f(g_{1}g_{2})\), where \(g_{1}, g_{2}\) belong to \(G\) they arrive to the following conclusion: there's an upper bound on the number of different groups of order \(n\), namely: \(n^{n^{2}}\)

My question is how to arrive to such conclusion. I am aware that, for every ordered pair of \(G\times G\) there's \(n\) images (since \(X\) was assumed to have \(n\) elements). For a concrete example, let be \(G\) a group of 2 elements. Then, there are 4 ordered pairs. Each pair has 2 images, so the total number of maps would be 4*2=8. However, by use of the relation \(n^{n^{2}}\) we get \(2^{2^{2}}=16\), i.e, there are 16 different maps, not 8. I am missing something here, but I don't know what exactly what the error is.
 
Physics news on Phys.org
Hi pauloromero1983,

In the example you gave for each element of $G\times G$ there are 2 choices in $X$ to which the element can be mapped. Since the total number of elements in $G\times G$ is 4, the total number of possible mappings is $2\times 2\times 2\times 2 = 2^{4} = 16.$

In general, if $A$ and $B$ are finite sets, then there are $|B|^{|A|}$ different mappings/functions from $A$ to $B$. Does this help answer your question?
 
ok, I think I understand now, thank you.
 
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##...

Similar threads

Back
Top