Unitary Matrices as a Group: Proof and Properties

  • Thread starter spaghetti3451
  • Start date
  • Tags
    Group Proof
In summary, the set of all ##n \times n## unitary matrices forms a group as it satisfies closure, associativity, and has an identity element and inverse for each element. The inverse exists due to the unitary property and the identity is clearly unitary.
  • #1
spaghetti3451
1,344
33

Homework Statement



Show that the set of all ##n \times n## unitary matrices forms a group.

Homework Equations



The Attempt at a Solution



For two unitary matrices ##U_{1}## and ##U_{2}##, ##x'^{2} = x'^{\dagger}x' = (U_{1}U_{2}x)^{\dagger}(U_{1}U_{2}x) = x^{\dagger}U_{2}^{\dagger}U_{1}^{\dagger}U_{1}U_{2}x = x^{\dagger}U_{2}^{\dagger}U_{2}x = x^{\dagger}x = x^{2}.##

So, closure is obeyed.

Matrix multiplication is associative.

The identity element is the identity matrix.

##x'^{2} = (U^{-1}x)^{\dagger}(U^{-1}x) = x^{\dagger}(U^{-1})^{\dagger}U^{-1}x = x^{\dagger}(U^{\dagger})^{-1}U^{-1}x = x^{\dagger}(UU^{\dagger})^{-1}x = x^{\dagger}x = x^{2}##.

So, the inverse of any unitary matrix is a unitary matrix.

Is my answer correct?
 
Last edited:
Physics news on Phys.org
  • #2
yep, and if you mention that the identity is clearly unitary and the inverse exists at all, e.g. because |det(U)| = 1 it'll be perfect
 
  • #3
Thanks! Got it!
 

What is U(n)?

U(n) is the group of all invertible elements in the set of integers modulo n. In other words, it is the set of all positive integers less than n that are relatively prime to n.

What does it mean for U(n) to be a group?

A group is a mathematical structure that consists of a set of elements and a binary operation that satisfies certain properties. In the case of U(n), the binary operation is multiplication modulo n, and the properties that it satisfies are closure, associativity, identity, and inverse.

How do you prove that U(n) is closed under multiplication modulo n?

To prove closure, we need to show that for any two elements a and b in U(n), their product a*b is also in U(n). This can be done by using the fact that gcd(a,n) = 1 and gcd(b,n) = 1, and then using the properties of modular arithmetic to show that gcd(a*b,n) = 1, which means that a*b is also relatively prime to n and therefore in U(n).

How do you prove associativity for U(n)?

To prove associativity, we need to show that for any three elements a, b, and c in U(n), the product (a*b)*c is equal to a*(b*c). This can be done by using the properties of modular arithmetic and the fact that gcd(a,n) = gcd(b,n) = gcd(c,n) = 1.

How do you prove that U(n) has an identity element?

The identity element for U(n) is the number 1. To prove that 1 is in U(n) and is an identity element, we need to show that gcd(1,n) = 1 and that for any element a in U(n), 1*a = a*1 = a. This can be done using the properties of modular arithmetic and the fact that 1 is relatively prime to any integer.

Similar threads

  • Calculus and Beyond Homework Help
Replies
21
Views
850
  • Calculus and Beyond Homework Help
Replies
0
Views
162
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
10
Views
5K
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Advanced Physics Homework Help
Replies
15
Views
1K
  • Beyond the Standard Models
Replies
3
Views
2K
Replies
8
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
643
  • Calculus and Beyond Homework Help
Replies
3
Views
897
Back
Top