At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
the order of the subgroup must divide the order of the group. so if the order of the group is n, there is no way that n- 1 | n unless n = 2
Is there a reason why the order of the subgroup must divide the order of the group?
btw this theorem actually has a name: lagrange's theorem
okay, that's what I needed to be able to read more...
as i recall the proof is pretty straight forward although i cannot imagine that you are supposed to prove it. the gist of the proof is that the left (right) cosets of the subgroup are equivalence classes, and since no two elements can be in distinct equivalence classes they form a partition of G
It's a self study in prep for applying to grad school, so I am asking, not a class
aah. i was going to say that whatever book you are reading must have a proof of langrange
It probably will, subgroups come pretty early, Chapter 2, no lagrange yet.
well not sure how to do it without lagrange, but no reason to tie your hands. i just looked the proof up and it is very short. just google 'lagrange theorem' and you will find lots. good luck getting in to grad school.
I just read the wikipedia on lagrange and the book I am using is one of four cited in the end notes! (Dummit and Foote) Thanks for the help.