You are not logged in.
Pages: 1
Okay, I only just found out what it is. All groups of odd order are soluble (or solvable).
And this implies that all finite groups of odd composite order are not simple? I can prove it.
There. That was not really heavy machinery, was it?
Offline
There. That was not really heavy machinery, was it?
That solvability of composite order implies nonsimplicity is not, no. In fact, it becomes more obvious when you use the decomposition series that comes from being solvable. On the other hand, Feit-Thompson's theorem required 255 pages of heavy machinery to prove. I'm not sure of any proofs discovered since then, so perhaps it has become shorter with time.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
On the other hand, Feit-Thompson's theorem required 255 pages of heavy machinery to prove.
Oh, that puts a different complexion on the matter then.
Offline
Thought I read about a 1000 page proof in group theory. Andy's is 200, this is 250. What ever happened to the Greeks drive for simplicity?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
The first half of the Jordan-Holder program is estimated at 10,000 pages.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
Pages: 1