1Thanks
• 1 Post By Deveno

# Thread:

1. ## proving the sylow p-subgroups are abelian

Assume that $p$ is an odd prime and $G$ is a finite simple group with exactly $2p+1$ Sylow $p$-subgroups. Prove that the Sylow $p$-subgroups are abelian.

I haven't made much progress: It's easy if $p^2$ doesn't divide the order of $G$, since then the Sylow $p$-subgroups have order $p$ and are therefore cyclic.

Thanks,
Hollywood

2. ## Re: proving the sylow p-subgroups are abelian

i figured it out:

let G act on the sylow p-subgroups by conjugation.

this gives a homomorphism of G into S2p+1.

since G is simple, and the action is transitive, the kernel of this action must be trivial.

therefore |G| divides (2p+1)!.

now we can ask, what is the highest possible power of p that divides (2p+1)! ?

well, the only integers 2 ≤ n ≤ 2p+1 that p divides are p and 2p. this means that the highest possible power of p that divides (2p+1)! is p2.

thus the sylow p-subgroups of G have either order p, or p2, and are abelian in either case.

Brilliant!!

Thanks,
Hollywood

4. ## Re: proving the sylow p-subgroups are abelian

Deveno - well done!
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9079142808914185, "perplexity_flag": "middle"}