What is the Composition Calculation Method for External Direct Products?

  • Thread starter Thread starter williamaholm
  • Start date Start date
williamaholm
Messages
3
Reaction score
0
greetings, I'm confused on how to perform external direct products. I'm not sure how to symbolize this operation so I'll use +.
My text explains it as: G1+G2+...+Gn ={(g1,g2,...gn)}|giEGi}, where (g1,g2,...,gn)(g'1,g'2,...,g'n) is defined as (g1g'1, g2g'2,..., gng'n). It then gives this as an example: U(8)+U(10) = {(1,1),(1,3),(1,7),(1,9),(3,1),(3,3),(3,7),(3,9),(5,1),(5,3),(5,7),(5,9),(7,1),(7,3),(7,7),(7,9)} . Since U(8)={1,3,5,7} and U(10)={1,3,7,9} doesn't this example have the form of (g1g'1, g1g'2, g1g'3, g1g'4, g2g'1, g2g'2, g2g'3... and so forth until we cycled through it all) :bugeye:
 
Physics news on Phys.org
GxH is the set of all ordered pairs (g,h) where g is in G and h in H. Which is what you've written. And?
It is a group under the operation (g,h)*(g',h')=(g*g',h*h') where we compose elements of G in the obvious way, and elements of H similarly.

I can't decipher what you think is wrong.
 
still confused

"doesn't this example have the form of (g1g'1, g1g'2, g1g'3, g1g'4, g2g'1, g2g'2, g2g'3..."
g1 is being distributed among all of g' s elements and then g2 gets distributed among all of g' s elements and this continues for all g elements. rather than g1g'1, g2g'2, g3g'3, where each element in g is associated with only one element in g'. Does this help you see where I'm confused?
 
No. Clearly the list you give with numbers in has more commas and different brackets. The list with g1 etc is a completely different format.

g1 distributed amongst the g's? what g's?

Read the definition of what the elements in the direct product are (ORDERED PAIRS, you have no ordered pairs mentioned in post #3.)


this bit here:
(g1g'1, g2g'2,..., gng'n)

refers to how you calculate the composition of two elements in the direct product.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

Find the elements of the direct product
Replies
2
Views
4K
Fortran Fortran (gfortran) compiling error
Replies
1
Views
3K

Hot Threads

Recent Insights

Back
Top