ε=exp(2πi/5)
S11 |
E |
(C11)2 |
(C11)4 |
(C11)6 |
(C11)8 |
i |
(S11)7 |
(S11)9 |
S1 |
(S11)2 |
(S11)4 |
|
Ag |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
E1g |
E1g,a E1g,b |
1 1 |
ε* ε* |
ε2* ε2* |
ε2* ε2* |
ε* ε* |
1 1 |
ε* ε* |
ε2* ε2* |
ε2* ε2* |
ε* ε* |
1 1 |
E2g |
E2g,a E2g,b |
1 1 |
ε2* ε2* |
ε* ε* |
ε* ε* |
ε2* ε2* |
1 1 |
ε2* ε2* |
ε* ε* |
ε* ε* |
ε2* ε2* |
1 1 |
|
Au |
1 |
1 |
1 |
1 |
1 |
-1 |
-1 |
-1 |
-1 |
-1 |
-1 |
E1u |
E1u,a E1u,b |
1 1 |
ε* ε* |
ε2* ε2* |
ε2* ε2* |
ε* ε* |
-1 -1 |
-ε* -ε* |
-ε2* -ε2* |
-ε2* -ε2* |
-ε* -ε* |
-1 -1 |
E2u |
E2u,a E2u,b |
1 1 |
ε2* ε2* |
ε* ε* |
ε* ε* |
ε2* ε2* |
-1 -1 |
-ε2* -ε2* |
-ε* -ε* |
-ε* -ε* |
-ε2* -ε2* |
-1 -1 |
Obviously the E representations are reducible. Nevertheless the E representations are treated often as irreducible representations and are called real-valued or pseudo irreducible representations. One should keep in mind that general statements for character tables fail for real-valued representations. For example:
- The number of irreducible representations is usually equal the number of classes. For point group S11 this statement is true for the complex irreducible representations. The number of real-valued irreducible representations is less than the number of classes.
- The sum of the squared characters of the neutral symmetry element over all irreducible representations is equal to the total number of symmetry elements
h = ∑ Χi(E) Χi(E)
This statement is true for the complex irreducible representations but not for the real-valued irreducible representations - Reduction formula: The occurence of i-th irreducible representation in an reducible representation is given by the well known formula
ci = 1/h ∑R nR χi(R)irred χ(R)red
This statement is true for the complex irreducible representations. The norm of the two-dimensional real-valued irreducible representations is 2h (instead of h) meaning that the reduction formula has to be modified:ci(E) = 1/(2h) ∑R nR χi(R)irred χ(R)red = (∑R nR χi(R)irred χ(R)red) / (∑R nR χi(R)irred χi(R)irred)
Last update November, 13th 2023 by A. Gelessus, Impressum, Datenschutzerklärung/DataPrivacyStatement