Explain an Orbit: Simple Definition & Example

  • Thread starter Thread starter hottytoddy
  • Start date Start date
  • Tags Tags
    Explain Orbit
hottytoddy
Messages
21
Reaction score
0
I'm trying to study a proof for a quiz right now, and even though I have the answer, I don't get it because I don't understand what an orbit is. I got no definition in class, and can't find anything in the book. I looked on wikipedia, but that was completely over my head.

Can someone please explain an orbit as simply as possible, and perhaps with an example?

Thank you!
 
Physics news on Phys.org


http://img98.imageshack.us/img98/6195/orbit2oj8.gif

hmm looks like the image code is broken
 
Last edited by a moderator:


This sentence from Wikipedia basically sums up an what an orbit is as briefly as possible...

The orbit of a point x in X is the set of elements of X to which x can be moved by the elements of G.

So a few questions for you. What's a G-set? What's an action? Where is all of this coming from?

I'm curious, what book are you using for your class? I've used Introduction to Abstract Algebra by Keith Nicholson, and it provides a pretty decent discussion on this material. Also, what proof are you looking at right now?
 
Last edited:


Somehow, everyone in my class gets this, but me. I don't know how I missed it, but I've never learned this stuff... I'm past the proof, but now I have another problem and just don't understand what it means.

The book we're using is the third edition of Abstract Algebra, I.N. Herstein. The only references in the book, according to the index, are problems.

So a few questions for you. What's a G-set? What's an action? Where is all of this coming from?

The wiki sentence: Is it saying that if X is {1,2,3,4,5} then, for some G, O(x) for x=1 could be {2,4}? I don't know what a G-set is, and I can only assume an action refers to a function?
 
Last edited:


Well the orbit of x will include x itself, but I think you're starting to get the idea. Basically the orbit is all of the possible values that you can achieve when operating the element x with all of the elements in G, where G is a group. The action is the operation that's used, so yeah basically a function.

Another resource that you can look at is Wolfram MathWorld. They usually provide defintions, with a few extra information about the topic.
 
##\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...
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...
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...
Back
Top