Is G a Connected Group? Proving Connectivity in a Matrix Set

  • Thread starter Thread starter Spriteling
  • Start date Start date
  • Tags Tags
    Set
Click For Summary

Homework Help Overview

The discussion revolves around proving the connectivity of a group G defined by a specific matrix form involving parameters u, v, and θ. Participants explore the properties of connectedness in the context of group theory and matrix representations.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants consider various methods to demonstrate that G is not the disjoint union of two non-empty sets. There is discussion about using path connectivity and parametrization by real numbers. One participant proposes a function to connect two elements in G, while another questions the validity of this approach by providing a counterexample.

Discussion Status

The conversation is ongoing, with participants actively questioning assumptions and exploring different approaches to establish connectivity. Some guidance has been offered regarding the need for careful consideration of the matrix form, but no consensus has been reached on a definitive method.

Contextual Notes

Participants are grappling with the challenge of finding a suitable curve that satisfies the conditions for connectivity, while also considering the implications of expressing elements of G in terms of exponential forms.

Spriteling
Messages
34
Reaction score
0

Homework Statement



Show that the group G where G = \left(\begin{array}{ccc} \cos\theta &amp; -<br /> sin\theta &amp; u \\ \sin\theta &amp; \cos\theta &amp; v \\ 0 &amp; 0 &amp; 1 \end{array} \right) u,v \in \Re, \theta \in \Re/2\pi Z


Homework Equations



I know that a set is connected if it is not the disjoint union of two non-empty sets, if any two elements in G can be joined by a C^k path in G, and if G is generated by a neighbourhood of 1.

The Attempt at a Solution



I thought that it would be easiest to show that G is not the disjoint union of two non-empty sets, and I was trying to do it by contradiction, but got nowhere.

Any hints/nudges in the right direction would be appreciated.
 
Physics news on Phys.org
Path connectivity is often the easiest direction to go in, especially when your set is parametrized by real numbers
 
Would it then work to say that you can take the function f: [0,1] -> G, where f = tg + (1-t)g' with g, g' members of G. f(0) =g and f(1) = g' so G is indeed connected?

Or am I missing something here?
 
That's not quite right. Imagine
g = \left(\begin{array}{ccc} 1 &amp; <br /> 0 &amp; 0\\ 0 &amp; 1 &amp; 0 \\ 0 &amp; 0 &amp; 1 \end{array} \right)

g&#039; = \left(\begin{array}{ccc} 0 &amp; <br /> -1 &amp; 0\\ 1 &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; 1 \end{array} \right)

then the halfway point is

g = \left(\begin{array}{ccc} 1/2 &amp; -<br /> 1/2 &amp; 0\\ 1/2 &amp; 1/2 &amp; 0 \\ 0 &amp; 0 &amp; 1 \end{array} \right)

which isn't actually of the desired form. You need to be a little more careful about how you deal with the sin and cos terms



Homework Equations



I know that a set is connected if it is not the disjoint union of two non-empty sets, if any two elements in G can be joined by a C^k path in G, and if G is generated by a neighbourhood of 1.

The Attempt at a Solution



I thought that it would be easiest to show that G is not the disjoint union of two non-empty sets, and I was trying to do it by contradiction, but got nowhere.

Any hints/nudges in the right direction would be appreciated.[/QUOTE]
 
Yeah, I realized that last night when I was showering.

However, I can't seem to find a curve that will actually suit all of the conditions, namely that:
f(t) = a(t)g + b(t)g' with b(t) + a(t) = 1 from the bottom right corner and that a(t)cos(x) + b(t)cos(y) = cos(z) and a(t)sin(x) + b(t)sin(y) = sin(z).

I think it may just be easier to show that any g in G can be written as an exponential, and so then all points are joined together.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 12 ·
Replies
12
Views
3K